Q.101 The data structure needed to convert a recursion to an iterative procedure is

(A) Queue. (B) Graph.

(C) Stack. (D) Tree.

Q.81 How many distinct binary search trees can be formed which contains the integers 1, 2,

3?

(A) 6 (B) 5

(C) 4 (D) 3

Q.67 The constructed datatype of C is known as

(A) Pointers (B) String

(C) Structure (D) Array

Q.67 The constructed datatype of C is known as

(A) Pointers (B) String

(C) Structure (D) Array

52 Which of the following statement is true about a function?

(A) An invoking function must pass arguments to the invoked function.

(B) Every function returns a value to the invoker.

(C) A function may contain more than one return statement.

(D) Every function must be defined in its own separate file.

Q.51 What is the output of following statement?

for(i=1; i<4; i++)

printf(“%d”,(i%2) ? i : 2*i);

(A) 1 4 3 (B) 1 2 3

(C) 2 4 6 (D) 2 2 6

Q.41 Which is not dynamic memory allocation function?

(A) malloc (B) free

(C) alloc (D) calloc