Home > BCA > Quizzes > Data Structures Review
Data Structures Review
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 28%
Data Structures Review
Time left 00:00
25 Questions

1.
2. Which of the following statement is true? Using singly linked lists and circular list, it is not possible to traverse the list backwards. - To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
3.
4.
5. Which of the following data structure is linear type?
6. There is an extra element at the head of the list called a
7.
8. State true or false. ) The degree of root node is always zero. "i) Nodes that are not root and not leaf are called as internal nodes."
9.
10. Herder node is used as sentinel in
11. When new data are to be inserted into a data structure, but there is not available space; this situation is usually called
12. Linear arrays are also called
13. Which of the following data structure is not linear data structure?
14.
15. State true or false. - empty tree is also a binary tree. - In strictly binary tree, the out-degree of every node is either o or 2.
16. When does top value of the stack changes?
17. Which of the following data structures are indexed structures?
18. The logical or mathematical model of a particular organization of data is called a
19. binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called
20. The use of pointers to refer elements of a data structure in which elements are logically adjacent is
21. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
22. The advantage of
23. The number of comparisons done by sequential search is
24. State true of false. ) A node is a parent if it has successor nodes. "i) A node is child node if out degree is one."
25. Which of the following data structure is non linear type?