GATE Overflow | Mock GATE | Test 1 | Question: 32

Question

A sequential search operation is performed on an array $A$ for the key value of $'x'$ (ignore quotes). Consider the following piece of assembly language code that uses back patching to perform the sequential search.
i=0;
P: if (i<A.length) goto ____;
Q: goto ____;
R: if (x==A[i]) goto ____
S: goto _____;
T: return i;
U: return -1;

What should be the correct values in the blanks provided ordered from top to bottom?

• A. R T U P
• B. R U T P
• C. P U T R
• D. P T U R

Answer 1

it's like below-

i=0; 
P: if (i<A.length) goto __R__; // if length of the array is not 0 then next we'll check the condition on R.
Q: goto __U__; // if array length is 0 then return -1.
R: if (x==A[i]) goto __T__ // if element is found then return the index.
S: goto ___P__; // else not found go to P.
T: return i; 
U: return -1; 

Option B.