Question

Control Structures and Subroutines

I. A while loop whose condition is not made false is called an infi nite loop. However, it is infinite, in the sense of continuing to run forever, only in theory. The loop will stop at some point. Why? 2. To evaluate the if statements in this question below, assume that a Print statement simply prints whatever is in quotes after it. The phrases after a semicolon in the third code fragment are comments and are meant to explain the code. Also assume the following variables have the values give A=5 ·C =7 For each pseudocode fragment below, write what would be printed in the case of the values given above. (a) If A < B then Print "the first thing (b) If C-D then Print "the first thing (c) If C > D then Print "the first thing (d) If A 5 then if B < C then Print "the first thing.. else Print "the second thing" else Print "the second thing" Print "the second part" ;else for second if: else Print "the second thing" else for first if: else Print "the third thing" (e) If A 5 then if B > C then Print "the first thing.. else Print "the second thing" else Print "the third thing (f) If A = 4 then if B < C then Print "the first thing." else Print "the second thing" else Print "the third thing

Answer 1

1.when the memory alloted will exhaust,at that that the while loop will stop.because it cannot hold more numbers due to memory deficit

2.a) the first string //the condition is true because a is more than b

b) will not compile//error because = means assignment and it is not used inside if..equal to should be ==

c) the first thing //value of c is more than d.so cndition is true

d)the first thing //the condition is true.c is smaller than d

e)the second thing //c is smaller than b

f) the first thing //b is less than c

3) error because jth loop is not mentioned or given and it is tried to increment.for program to work it should be i which must be incremented

4)if i=i+2 is used after the print statement, then message will be printed 5 times

5) 5 4 3 2 1. //because value of j will print and decrement from 5 to 0.

6)

7)

Step 1: begin
Step 2:Set j to 1
Step 3: if j > n then go to step 7
Step 4: if A[i] = x then go to step 6
Step 5: Set j to j + 1
Step 6: Go back to Step 2
Step 7: Print Element x Found at index j and go to step 8
Step 8: Print element not found
Step 8: End