MTE BITP 1113 Programming Technique - WordA ahmed garcad AGFileHomeInsertDrawDesignLayoutAcrobatO Tell me what you want to do& ShareReferencesMailingsReviewViewHelpE Aligntei GroupHBreaks -SpacingIndentD Line NumbersELeft: 0.32 cm0.32 cm1 Before: 0 ptPosition WrapBringText Forward - BackwardMargins Orientation Size ColumnsSendSelectionbề HyphenationE Right: 0 cmAfter: 0 ptPaneA RotatePage SetupParagraph--- - --r-gArrange--------o-----int numl = 2, total = 88;doif (numl 2 == 0 && numl <= 10)total = total + numl * numl;else if (numl * 2 == 0 && numl > 10)total = total * numl;elsetotal = total - numl * numl;numl++;}while (num1 <= 8) ;cout << "total = " << total << endl;Figure 3.1What is the output when the program is executed.a.b.Convert the program segment using for loopC.Convert the program segment using while loopPage 6 of 11938 wordsDE English (United States)80%4:14 AMO Type here to searchIAW26°CG 4») ENG2625/11/2021(21

Given: Answer multiple questions.

Paragraph Arrange int numl = 2, total = 88; do if (numl $ 2 =- 0 44 numi <= 10) total = total + numi • numl; else if (numi + 2 == 0 64 numl > 10) total = total • numl; else total = total - numl numl; numl++; }while (numl <= 8); cout << "total = " « total « endl; Figure 3.1 What is the output when the program is executed. b. Convert the program segment using for loop c. Convert the program segment using while loop

Paragraph Arrange int numl = 2, total = 88; do if (numl $ 2 =- 0 44 numi <= 10) total = total + numi • numl; else if (numi + 2 == 0 64 numl > 10) total = total • numl; else total = total - numl numl; numl++; }while (numl <= 8); cout << "total = " « total « endl; Figure 3.1 What is the output when the program is executed. b. Convert the program segment using for loop c. Convert the program segment using while loop

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

6. sum_highest_five This function takes a list of numbers, finds the five largest numbers in the list, and returns their sum. If the list of numbers contains fewer than five elements, raise a ValueError with whatever error message you like. Sample calls should look like: >>> sum_highest_five([10, 10, 10, 10, 10, 5, -17, 2, 3.1])50>>> sum_highest_five([5])Traceback (most recent call last): File "/usr/lib/python3.8/idlelib/run.py", line 559, in runcode exec(code, self.locals) File "<pyshell#44>", line 1, in <module> File "/homework/final.py", line 102, in sum_highest_five raise ValueError("need at least 5 numbers")ValueError: need at least 5 numbers
C sharp
What do the following statements do? random_device rdevice{};default_random_engine num{ rdevice() };uniform_int_distribution<<unsigned int> randomNum{10, 25};cout << randomNum(num) << endl;
Please continue tthe code below --- #include <stdio.h> struct Employee { // declaring the members of the structure char emp_full_name[30]; int pos; float rate_per_hour; int hour_worked; float deduction; float gross_week_pay; float net_week_pay; }; int main() { struct Employee var; // declare the Employee variable struct Employee *ptr; // create a pointer variable (*ptr) ptr = &var ;// assigning the address of var to pointer type variable return 0; }
#ifndef LLCP_INT_H#define LLCP_INT_H #include <iostream> struct Node{ int data; Node *link;};void DelOddCopEven(Node*& headPtr);int FindListLength(Node* headPtr);bool IsSortedUp(Node* headPtr);void InsertAsHead(Node*& headPtr, int value);void InsertAsTail(Node*& headPtr, int value);void InsertSortedUp(Node*& headPtr, int value);bool DelFirstTargetNode(Node*& headPtr, int target);bool DelNodeBefore1stMatch(Node*& headPtr, int target);void ShowAll(std::ostream& outs, Node* headPtr);void FindMinMax(Node* headPtr, int& minValue, int& maxValue);double FindAverage(Node* headPtr);void ListClear(Node*& headPtr, int noMsg = 0); // prototype of DelOddCopEven of Assignment 5 Part 1 #endif
vrite a each eler the original assigns the element with 0. Ex: lowerScores = {5, 0, 2, -3} becomes {4, 0, 1, 0}. 406554.2871636.qx3zqy7 1 #include 2 #include 3 using namespace std; 4 5 int main() { 6 7 9 10 11 12 13 14 15 16 17 Run const int SCORES_SIZE = 4; vector lowerScores (SCORES_SIZE); unsigned int i; for (i 0; i > lowerScores.at(i); } /* Your solution goes here */ for (i = 0; i < lowerScores.size(); ++i) { cout << lowerScores.at (i) << " "; nent was greater than 0, and oth wise.
#include <iostream> #include <cmath> #include <iomanip> using namespace std; int calc_qty(int qty); void receipt( int qty, int qty2); int calc_qty(int qty); void coffee_size(int qty, int size, int choice, int qty2); void slices(); void beanounces(); int main() { int qty = 0, order = 0, size = 0, qty2 = 0; receipt (qty,qty2); calc_qty (qty); do { //displays the menu cout<<" Please select an item on the menu you would like to buy."<<endl; cout<<"Enter 1 for Coffee\n"<<"Enter 2 for cheese cake\n"<<"Enter 3 for coffee beens\n"<<endl; cin>>choice; } switch (choice) { case 1: coffee_size(qty, size, order, qty2); break; case 2: slices(); break; case 3: beanounces(); break; case 4: cout<<"Enjoy your day"<<endl;…
#define _CRT_SECURE_NO_WARNINGS #include <stdio.h> #define NAME_LEN 25 #define MAX_PARTS 100 struct part { int number; char name[NAME_LEN + 1]; int on_hand; double price; } inventory[MAX_PARTS]; int num_parts = 0; int find_part(int number); void insert(void); void search(void); void update(void); void print(void); int read_line(char str[], int n); int main(void) { char code; for (;;) { printf("Enter operation code: "); scanf(" %c", &code); while (getchar() != '\n') /* skips to end of line */ ; switch (code) { case 'i': insert(); break; case 's': search(); break; case 'u': update(); break; case 'p': print(); break; case 'q': return 0; default: printf("Illegal code\n"); } printf("\n"); } } int find_part(int number) { int i; for (i = 0; i < num_parts; i++) if…
Gamex, an online game website launches a game for kids where the kids have to pick up balls from a pool and drag them to the ribbon beneath the pool. The pool contains red, blue and green colored balls. Tester function of the game checks whether the kid have placed the picked balls according to the following constraints: The kid should have picked atleast one red, one blue and two green colored balls. The kid should place the balls in the following order. Red balls followed by green followed by blue balls. The number of red balls should be equal to blue balls. iv. i. ii. ii. The number of green balls should be twice as of red balls. Design pushdown automata to simulate the function of tester. Justify your answer.
the statement if (form.element.length>=1) is a form of ___ validation
struct BookInfo string title; string author; string publisher; double price; Booklnfo booklist[20]; Fill in the table below: ZARLE List What is structure name? Answer: How nany members? How many element? Write a code (one line only) to access the title member of booklist[5]: BOURCE CODE 1.
Please complete create box function in box.c this is box.h /* Do not modify */#ifndef BOX_H#define BOX_Htypedef struct {int *data;int size;int cap;} Box;/* Creates a new box with 'init_cap' capacity */void createBox(Box **b, int init_cap); this is box.c #include <stdio.h>#include <stdlib.h>#include "box.h"void createBox(Box **b, int init_cap) {}