4. Consider the following algorithm. ALGORITHM Mystery(n) I/Input: A nonnegative integer n S+0 for i +1 to n do S+S+i *i return S a. What does this algorithm compute? b. What is its basic operation? c. How many times is the basic operation executed? d. What is the efficiency class of this algorithm?

Recall the Babylonian Algorithm for calculating a square root that we discussed in class. What will output if we were solving the square root of 21  (S = 21) using the Babylonian Algorithm with a first guess of x = 10 with just one iteration? What will the algorithm output be after a second iteration? (Answer rounded to 2 decimal places)

Which statement is FALSE? a) Space complexity demands less memory b) Worst case analysis of an algorithm is the largest number of operations needed c) Time complexity is expressed in terms of number of operations d) Time complexity demands more CPU cycles

Algorithm Development Course, Could you please help me to find out what is the answer to this question!

Design an algorithm to find the kth number such that the only prime factors are 3, 5, and 7. Note that 3, 5, and 7 do not have to be factors, but it should not have any other prime factors. For example, the first several multiples would be (in order) 1, 3, 5, 7, 9, 15, 21.

Consider the following non-recursive algorithm: Algorithm Euclid2(m, n)//Input: Integers m and n where m >=n//Output: Greatest Common Divisor of m and nwhile n ≠ 0 do                r ← m mod n     m← n     n ← r   return m a) What does this algorithm compute?b) What is the input size for this algorithm?c) What is the basic operation of this algorithm?d) How many times the basic operation is executed worst case scenario?e) How many times the basic operation is executed in best-case scenario?

Please written by computer source

Exercise 2. Give a recursive definition for the factorial operation k! n! for n ≥ 1. (remember that 1! = 0! = 1)  Provide an algorithm in pseudo code to evaluate k! n! as one function Provide an algorithm in pseudo code to evaluate k! n! as three functions Evaluate the complexity of the algorithm at point 2 Evaluate the complexity of the algorithm at point 3

## Format Requirement Algorithms in pseudo code **MUST** be placed in code blocks/fences, and use highlighter. Algorithms should follow the pseudo code standard described in *Pseudocode Handout*. срр as the syntax Do NOT change the template except the answer portion. Formulas and equations should be in math mode using Latex math symbols. - Markdown math tutorial: http://tug.ctan.org/info/undergradmath/undergradmat h.pdf Two ways to enter math mode: Insert a pair of dollar signs: \$your equations go here\$. This is the inline math mode. *Notice that there is no space between the \$ and the letter*. Insert a pair of double-dollar signs: \$\ $ your equations go here \$\$, which produces a standalone equation/formula set.

Please assist me with these questions. Devise an algorithm to receive a positive number, n, and output all prime numbers that are smaller than n and have the digit 5. For example, if n is 100, the program should output 5, 53 and 59. Your solution should have a main algorithm and two sub-algorithms, let's call them prime(num) and has5(num). Trace your algorithm and sub-sub-algorithm for the input 15. You should provide pre- and post-conditions for all your 3 (sub)algorithms. I also need help with creating JavaScript code for the flowchart provided below. Note: You will have to implement several functions that require multiple inputs (e.g., 12, 2, -3, 6, -11, -3, 1, -1). In these cases, accept as input a comma-delimited string (i.e., "12,2,-3,6,-11,-3,1,-1"). Then, break the comma-delimited string into a series of integers for processing with your algorithm. Thank you