1.1 In each of the following cases do the following: Write only the specified structures, do not write the whole algorithm. Make use of the pre-test loop (for-loop and do-while) in pseudocode using the variable names as provided. The number of times that the loop will execute, The value of the counter control variable after execution of the loop and e.g. Use a counter variable called count1 that has an initial value of 0 and a final value of 35
(1) a. for count1 = 0 to 5 b. 6 times c. 6 a. count1 = 0 while count1 <=5 b. 6 times c. 6
1.1.1 Use a counter variable called studentCount that has an initial value of 50, a final value of 0, and a decrement of 2.
1.1.2 Use a counter variable called countX that has an initial value of 31, a final value of 15, and an increment of -3.
Algorithm for a program that generates 1000 random numbers between 0 and 100 000. Display the number of odd values generated as well as the smallest and the largest values. Output should be displayed in a windows message box.
Compute and display the grade of a student in the exam. Grade is equal to 1/3 of the minor exam and 2/3 of the major exam.
Compute and display the grade of a student in the exam. Grade is equal to 1/3 of the minor exam and 2/3 of the major exam.
Solve the Integer LP problem using the GOMORY'S cutting plane method. Maximize Z = 2Y1+ 20Y2-10Y3 subject to the constraints (0) 2Y1+20Y2+4Y3 ≤ 15, (ii) 6Y1+ 20Y2+4Y3=201 and Y1, Y2, Y3 20 and are integers.
John has n sweets which are to be distributed equally to m kids. Design the flowchart such that it also prints number of sweets each kid gets and the remaining sweets with John
Getting the age of participant, of the age is less than or equal to 17 you need to print sorry you are not able to join the event, else you need to print welcome to the event.
Getting the age of participant, of the age is less than or equal to 17 you need to print sorry you are not able to join the event, else you need to print welcome to the event.
Examine what Big-O notation is and explain its role in evaluating efficiencies of algorithms.