Ex 6) This exercise uses sub-algorithms. Trace it for when input value is 6 and complete the trace tables. Also note that there are two variables name num, one in the main algorithm and another in the sub-algorithm. They are not related. Assume input is a positive integer. Write pre- post-conditions for each of these algorithms (the main one and the sub-algorithm). Note that the prime sub-algorithm is similar to the algorithm in Ex 1) but instead of reading input and producing outputs, it has a parameter num, and it returns the result. Also note that the true is in gray color, which means it can be ignored. Note that since the sub-program is called several times, it's better that you use separate trace tables, one for each call, as shown below. start num 142 i<+1+1 is num T prime()-true F prime(num) start flag-true d+2 flog true and ds num/2 num mod d=0 3 umed value

Compare and contrast the problem-solving strategies of iterative and recursive methods. It's important to know when to utilize recursion and when to use iteration. Provide supporting evidence that differs from the examples included in the presentation slides to back up your claim.

Determine how many times the innermost loop will be iterated when the following algorithm segment is implemented and run. (Assume that m and n are positive integers.) for j:=1 to m for k:=1 to n [Statements in body of inner loop. None contain branching statements that lead outside the loop.] next k next j (Hint: See Example 9.2.5 in the "Read It" link.) For each iteration of the outer loop there are X iterations of the inner loop. Therefore, the answer is H X

To determine the nth order Fibonacci sequence number, create a recursive algorithm.To keep track of the variables involved in the recursion, include the proper input/output statements. Are you able to see the "invisible" array in action? Keep a record of your findings.