2. In a Stack the com mand to access nth ele ment from the top of the stack s will be

S[Top-n]

S [Top+n]

S [top-n-1]

None of the above

S[Top-n]

3. If yyy, xxx and zzz are the ele ments of a lex i cally ordered binary tree, then in pre order tra ver sal which node will be tra verse first

xxx

yyy

zzz

can not be determined

xxx

4. In a balance binary tree the height of two sub trees of every node can not dif fer by more than

2

1

3

1

5. The result of evaluating pre fix expres sion */b+-dacd, where a = 3, b = 6, c = 1, d = 5 is

0

5

10

15

10

6. In an array rep re sen ta tion of binary tree the right child of root will be at loca tion of

2

5

3

3

7. The total num ber of com par isons in a bub ble sort is

O(n log n)

O(2n)

O(n^2)

None of the above

O(n log n)

8. The dummy header in linked list contain

First record of the actual data

Last record of the actual data

Pointer to the last record of the actual data

None of the above

First record of the actual data

9. Write the out put of the fol low ing pro gram: int a[] = {1,2,3}*P;

3

Junk value

Run time error

Address of the third element

Junk value

10. If the out degree of every node is exactly equal to M or 0 and the num ber of nodes at level K is Mk-1 [con sider root at level 1], then tree is called as (i) Full m-ary try
(ii) Com plete m-ary tree
(iii)Positional m-ary tree