Data Structure quiz for entrance exam
1. Which
data structure allows deleting data elements from front and inserting at rear?
b. Queues
2. Identify
the data structure which allows deletions at both ends of the list but
insertion at only one end.
a. Input-restricted deque
3. Which of
the following data structure is non-linear type?
d. None of above
4. Which of
the following data structure is linear type?
d. All of above
5. To
represent hierarchical relationship between elements, which data structure is
suitable?
c. Tree
6. A binary
tree whose every node has either zero or two children is called
c. Extended binary tree
7. The depth
of a complete binary tree is given by
d. Dn = log2n + 1
8. When
representing any algebraic expression E which uses only binary operations in a
2-tree,
a. the variable in E will appear
as external nodes
and operations in internal nodes
9. A binary
tree can easily be converted into q 2-tree
d. by replacing each empty sub
tree by a new external node
10. When
converting binary tree into extended binary tree, all the original nodes in
binary tree are
a. internal nodes on extended
tree
11. The post order traversal of a
binary tree is DEBFCA. Find out the pre order traversal
c. ABDECF
12. Which of
the following sorting algorithm is of divide-and-conquer type?
c. Quick
sort
13. An
algorithm that calls itself directly or indirectly is known as
b. Recursion
14. In a
binary tree, certain null entries are replaced by special pointers which point
to nodes higher in the tree for efficiency. These special pointers are called
d. thread
15. The in
order traversal of tree will yield a sorted listing of elements of tree in
b. Binary search trees
16. In a Heap
tree
b. Values in a node is greater
than every value in children of it
17. In a
graph if e=[u, v], Then u and v are called
d. all of above
18. A
connected graph T without any cycles is called
d. All of above
19. In a
graph if e=(u, v) means
d. both b and c
20. If every node u in G is
adjacent to every other node v in G, A graph is said to be
b. complete
RELATED SEARCH
0 comments:
Post a Comment
Feel free to ask here :)