Computer Sciences > Gate 2018 > Recursion
Consider the following program written in pseudo-code. Assume that x and y are integers.
The number of times that the print statement is executed by the call Count(1024, 1024) is _______ .
Count (x, y) {
if (y !=1 ) {
if (x !=1) {
print("*");
Count (x/2, y);
}
else {
y=y-1;
Count (1024, y);
}
}
}
if (y !=1 ) {
if (x !=1) {
print("*");
Count (x/2, y);
}
else {
y=y-1;
Count (1024, y);
}
}
}
The number of times that the print statement is executed by the call Count(1024, 1024) is _______ .
Correct : a
Similar Questions
Which of the following statements are CORRECT?1) Static allocation of all data areas by a compiler makes it impossible to implement recursion.2) Automatic garba...
Which of the following statements are CORRECT?1) Static allocation of all data areas by a compiler makes it impossible to implement recursion.2) Automatic garba...
Which of the following statements are CORRECT?1) Static allocation of all data areas by a compiler makes it impossible to implement recursion.2) Automatic garba...
Total Unique Visitors
Loading......