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

Question include in Following Tests :
Placement Cognizant GenC 06
Actual SNAP 2014
Placement ZS Associates - 01 (MBA)