## Freshers Data Structure Multiple Choice Questions And Answers

b. Lin ear dou bly linked list
c. cir cu lar linked list
d. None of the above
ANS:C

42. In a Stack the com mand to access nth ele ment from the top of the stack s will be
a. S[Top-n]
b. S [Top+n]
c. S [top-n-1]
d. None of the above
ANS:A

43. 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
a. xxx
b. yyy
c. zzz
d. can not be determined
ANS:A

44. In a bal ance binary tree the height of two sub trees of every node can not dif fer by more than
a. 2
b. 1
c. 0
d. 3
ANS:B

45. The result of eval u at ing pre fix expres sion */b+-dacd, where a = 3, b = 6, c = 1, d = 5 is
a. 0
b. 5
c. 10
d. 15
ANS:C

46. In an array rep re sen ta tion of binary tree the right child of root will be at loca tion of
a. 2
b. 5
c. 3
d. 0
ANS:C

47. The total num ber of com par isons in a bub ble sort is
a. O(n log n)
b. O(2n)
c. O(n2)
d. None of the above
ANS:A

a. First record of the actual data
b. Last record of the actual data
c. Pointer to the last record of the actual data
d. None of the above
ANS:A

49. Write the out put of the fol low ing pro gram: int a[] = {1,2,3}*P;
a. 3
b. Junk value
c. Run time error
d. Address of the third element
ANS:B

50 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
a. Only (i)
b. Only (ii)
c. Both (i) and (ii)
d. Both (ii) and (III)
ANS:C