This section contains more frequently asked Data Structure and Algorithms Multiple Choice Questions Answers in the various competitive exams.
PRACTICE IT NOW TO SHARPEN YOUR CONCEPT AND KNOWLEDGE
1. In linked lists there are no NULL links in:
- Single linked list
- Linear doubly linked list
- circular linked list
- None of the above
C. circular linked list
2. In a Stack the command to access nth element from the top of the stacks will be
- S[Top-n]
- S [Top+n]
- S [top-n-1]
- None of the above
A. S[Top-n]
3. If yyy, xxx and zzz are the elements of a lexically ordered binary tree, then in preorder traversal which node will be traverse first
- xxx
- yyy
- zzz
- can not be determined
A. xxx
4. In a balance binary tree the height of two sub trees of every node can not differ by more than
- 2
- 1
- 3
B. 1
5. The result of evaluating prefix expression */b+-dacd, where a = 3, b = 6, c = 1, d = 5 is
- 0
- 5
- 10
- 15
C. 10
6. In an array representation of binary tree the right child of root will be at location of
- 2
- 5
- 3
C. 3
7. The total number of comparisons in a bubble sort is
- O(n log n)
- O(2n)
- O(n^2)
- None of the above
A. 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
A. First record of the actual data
9. Write the out put of the following program: int a[] = {1,2,3}*P;
- 3
- Junk value
- Run time error
- Address of the third element
B. Junk value
10. If the out degree of every node is exactly equal to M or 0 and the number of nodes at level K is Mk-1 [consider root at level 1], then tree is called as (i) Full m-ary try (ii) Complete m-ary tree (iii)Positional m-ary tree
- Only (i)
- Only (ii)
- Both (i) and (ii)
- Both (ii) and (III)
C. Both (i) and (ii)
