Question 1 (Module Outcome #1): Complete the trace of the following list 4,3,1,7,2:

for do

for do

if then swap and

Question 2 (Module Outcome #2): Write an algorithm in pseudocode which prints all strings of length 4 where the first and fourth characters are any symbol from X={!,@,#,$,%,^}, the 2nd character is any digit in {0,1,2}, and the 3rd character is any digit 1,2,9. How many times will the print command be called (e.g. how many 6-character strings will be printed)?

Question 3 (Module Outcome #3): Let g(n) = n3 + 4n2 - 5. Determine the big-theta estimate of f. A complete response will include: , and Q.

Question 4 (Module Outcome #4): How many compares of the form will the following algorithm perform on a list of length n? Express your answer as a rational expression in terms of n.

for do

for do

if then swap and