52588
Unique Id: 18951
Edit screen 1
Edit screen 2
DIRECTIONS
for the question:
Solve the following question and mark the most appropriate option.
A numerical machine accepts two values X and Y. Then it updates these values as X = XY and Y = Y + l in every step. The machine stops at X ≥ N.
For X = 3, Y = 2 and N = 100, how many steps are performed before the machine stops?
A)
2
B)
3
C)
4
D)
5
C
Based on the inputs, the following tables gives the input output
X
Y
Initial
3
2
Step I
6
3
Step II
18
4
Step III
72
5
Step IV
360
6
Stop (x = 360) ≥ (N = 100)
So, four Steps are reqd.
Question include in Following Tests :
Placement Cognizant GenC 06
Upload Final Test
Actual SNAP 2014
Upload Final Test
Placement ZS Associates - 01 (MBA)
Upload Final Test