Final Term
1. A solution is said to be efficient if it solves the problem within its resource constraints i.e. hardware and time.
A.

True

B.

False

2. Which one of the following is known as "Last-In, First-Out" or LIFO Data Structure?
A.

B.

Stack

C.

Queue

D.  Tree
3.

For compiler a postfix expression is easier to evaluate than infix expression?

A.

True

B.

False

4.

Consider the following pseudo code declare a stack of characters

`````` while ( there are more characters in the word to read ) {
read a character push the character on the stack
} while ( the stack is not empty ) {
pop a character off the stack write the character to the screen
} ``````

What is written to the screen for the input "apples"?

A.

selpa

B.  selppa C.

apples

D.

aaappppplleess

5.

6 Consider the following function:

``````void test_a(int n)
{
cout << n << " ";
if (n>0) test_a(n-2);
} ``````

What is printed by the call test_a(4)?

A.  4 2 B.

0 2 4

C.

0 2

D.

2 4

6.

If there are N external nodes in a binary tree then what will be the no. of internal nodes in this binary tree?

A.

N -1

B.

N+N

C.

N+2

D.

N

7.

If there are N internal nodes in a binary tree then what will be the no. of external nodes in this binary tree?

A.  N -1 B.

N

C.

N +1

D.

N +2

8.

If we have 1000 sets each containing a single different person. Which of the following relation will be true on each set:

A.

Reflexive

B.

Symmetric

C.

Transitive

D.

Associative

9.

Which one of the following is NOT the property of equivalence relation:

A.

Reflexive

B.

Symmetric

C.

qransitive

D.

Associative

10.

If there are N elements in an array then the number of maximum steps needed to find an element using Binary Search is _______ .

A.

N

B.

N2

C.  Nlog2N D.

log2N