Pages

Thursday, 24 September 2015

Data Structure Objective type Questions and Answers

11. Which of the following linked list below have last node of the list pointing to the first node?
A. circular doubly linked list
B. circular linked list
C. circular singly linked list
D. doubly linked list
Ans: A

12. Items in a priority queue are entered in a _____________ order
A. random
B. order of priority
C. as and when they come
D. none of the above
Ans: A

13. A tree cannot contain cycles.
A. False
B. True
Ans: B

14. Breadth First search is used in
A. Binary trees
B. Stacks
C. Graphs
D. Both a and c above
Ans: C

15. A _____ tree is a tree where for each parent node, there is only one associated child node
A. balanced binary tree
B. rooted complete binary tree
C. complete binary tree
D. degenerate tree
Ans: D

16. In graphs, A hyperedge is an edge that is allowed to take on any number of ______.
A. Vertices
B. edges
C. both a and b above
D. labels
Ans: B

17. An empty list is the one which has no
A. nodes
B. data
C. both a and b above
D. address
Ans: C

18. Key value pair is usually seen in
A. Hash tables
B. Heaps
C. Both a and b
D. Skip list
Ans: A

19. In a heap, element with the greatest key is always in the _______ node.
A. leaf
B. root
C. first node of left sub tree
D. first node of right sub tree
Ans: B

20. In _________ tree, the heights of the two child subtrees of any node differ by at most one
A. Binary tree
B. Red black tree
C. Splay tree
D. AVL tree
Ans: D

More Questions & Answers:-
Page1 Page2 Page3 Page4 Page5 Page6 Page7 Page8 Page9

No comments:

Post a Comment