An algorithm has been written in pseudocode to input 100 numbers and print out the sum. A REPEAT . UNTIL loop has been used. Count + O Sum + 0 REPEAT INPUT Number Sum + Sum + Number Count + Count + 1 UNTIL Count > 100 PRINT Sum (a) Find the error in the pseudocode and suggest a correction. Error. Correction (b) Rewrite the correct algorithm using a more suitable loop structure.

An algorithm has been written in pseudocode to input 100 numbers and print out the sum. A REPEAT . UNTIL loop has been used. Count + O Sum + 0 REPEAT INPUT Number Sum + Sum + Number Count + Count + 1 UNTIL Count > 100 PRINT Sum (a) Find the error in the pseudocode and suggest a correction. Error. Correction (b) Rewrite the correct algorithm using a more suitable loop structure.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter5: Looping

Section: Chapter Questions

Problem 20RQ

See similar textbooks

Similar questions

Given an input string, delete recursively all the duplicate adjacent characters and return a string where all those adjacent characters that are the same have been reduced to just a single character. Do not use any loops. Do not use any regular expressions and methods such as matches, split, replaceAlI. Test case 1: delDuplicate("aaabbc") "abc" Test case 2: delDuplicate("aaaaa") "a"
Modify and Implement the below algorithm such that instead of inserting the numbers into the matrix, it should print the numbers already inserted in the matrix, line after line, with equal spaces between the numbers. After each line is printed, the cursor should go to the next line. Save and print your code(in c), run the program and print the output. Note:The code should be in c programming language
ckup on sum-0 while n>0: digit=n%10 print (digit) sum-sum+digit print (sum) n=n//10 print (n) Figure 5 a) Complete the trace table given below to trace the flow of execution of algorithm in Figure5 when n value is 2362. n sum O digit b) What causes the while loop to terminate ? ♫ A P
Modify the code to generate the Fibonacci sequence in the following ways, and complete each ofthe tasks using both the for- and while-loop.(a) Change the first two elements to 2 and 2.(b) Change the first two elements to 3 and 2.(c) Change the update rule from summing successive elements to taking differences of successiveelements. For example, the third element is defined as the second element minus the first element, andso on.(d) Change the update rule so that each element is defined as the sum of the three precedingelements. Set the third element as 1 in order to start the process.
Write summations to represent loops and simplify. The loops are inclusive.
4) How many loop iterations will the algorithm execute? (int i=0;i
python code. instructions are given below. Run function is already done. 1) def binary_search_rec(x, t, start, end): """ Return the left most index of x if x is in t indexed between [start, end] inclusive Otherwise return -1 You may assume that both start and end are valid index for t. Use Recursion, Do Not Use loops Your algorithm should be logarithmic to number of elements between [start, end] regardless of how many duplicates of x is. """ return 0 2) def binary_search_loop(x, t, start, end): """ Return the left most index of x if x is in t indexed between [start, end] inclusive Otherwise return -1 You may assume that both start and end are valid index for t. Use loop, Do Not Use Recursion Your algorithm should be logarithmic to number of elements between [start, end] regardless of how many duplicates of x is. """ return 0
In a Collatz sequence, all of its terms are positive integers which satisfy the following recursive formula an=0.5an−1 if an−1 is even an=3an−1+1 if an−1 is odd Directions: Given an initial term implement a Collatz sequence, and find its length.Input: a1Output: the length of the Collatz sequence Don't use some sort of menu loop to get user input
Design and implement an algorithm using recursion and backtracking to sort an array of integers into ascending order. Consider the given array as input and produce a sorted array as output. Each time you take an integer from the input array, place it at the end of the output array. If the result is unsorted, backtrack.
In algorithm design we focus on optimizing loops and recursions only Select one: True False
What would be the complexity of given loop.
•Write an algorithm to calculate the sum of a set of values (we don't know their count). When 0 is entered this means that algorithm should stop receiving data, and print the sum