ZimZam

What will be the value of s, if n=127?

Read n
i=0,s=0
Function Sample(int n)
while(n>0)
r=n%10
p=8^i
s=s+p*r
i++
n=n/10
End While
Return s;
End Function

• 27

• 127

• 187

• 87

What will be the output if limit = 3?

Read limit
n1 = 0, n2= 1, n3=1, count = 1;
while count <= limit
count=count+1
print n3
n3 = n1 + n2
n1 = n2
n2 = n3
End While

• 113

• 112

• 111

• 123

What will be the value of s if N=3?

Read N
Function sample(N)
s = 0
f = 1
i = 1
while i <= N:
f = f * i
s = s +(i / f)
i+=1
End while
return(s);
End Function

• 1

• 2

• 3

• 4

Read a=56 ,b=876
Function mul(a, b)
t = 0
while (b != 0)
t = t + a
b=b-1
End While
return t;
End Function

• 49095

• 49055

• 49056

• 49099

Read number = 2630

Function divisible(number)

even_counter = 0

num_remainder = number

while (num_remainder)

digit = num_remainder % 10

if digit != 0 AND number % digit == 0

even_counter = even_counter + 1

end if

num_remainder = num_remainder / 10

end while

return even_counter

End Function

• 1

• 11

• 2

• 22

What will be the output of the following pseudocode for input a = 30, b = 60, C = 90?

Integer a, b, c, sum 
Read a, b, c 
Set sum = a + b + c 
if ((sum EQUALS 180) and (a NOT EQUALS 0) and (b NOT EQUALS 0) and (c NOT EQUALS 0))
Print " Success" 
Otherwise 
Print "Fail" 
End if

• Fail

• Success

• Error

• None

What will be the output of the following pseudocode for a = 9, b = 7?

Integer funn(Integer a, Integer b)
Integer c 
Set c = 2 
b = b mod c 
a = a mod c
return a + b 
End function funn()

• 4

• 2

• 3

• 1

What will be the output of the following pseudo-code?

integer i
set i=3
do
print i+3
i=i-1
while( i < 0)
end while

• 6 5 4

• 6 5 2

• 1 2 3

• 3 2 1

How many times the following loop will be executed?

main()
{
ch = ‘b’;
while(ch >= ‘a’ && ch <= ‘z’)
ch++;
}

• 0

• 1

• 26

• 25

Consider the following piece of code. What will be the space required for this code?

int sum (int A[], int n)
{
int sum = 0, i;
for (i = 0; i < n; i++)
sum = sum + A[i];
return sum;
}// sizeof(int) = 2 bytes

• 2n+4

• 2n+6

• 2n+8

• 2n