Home > B.Sc (CS) > Quizzes > B.Sc.(CS) - Data Structures
B.Sc.(CS) - Data Structures
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 23% Most missed: “The earliest use of__________ sorting was in conjunction with network analysis.”
B.Sc.(CS) - Data Structures
Time left 00:00
25 Questions

1. __________is combining the records in two different sorted files in to a single sorted file.
2. The pointer of the last node contains a special value called_____________.
3. The string with zero characters is called___________.
4. The elements of an array are allocated in spaces________.
5. Generally the strings are stored in__________ types of structures.
6. A linked list whose last node points back to the list node instead of containing the null pointer________.
7. Which of the following way follows in Post order traversal?
8. The data structure which reflects relationship among elements is called a rooted tree graph or simply a____.
9. Collection of field is called a___________.
10. Expand ADT______________.
11. Which of the following data structure is non-linear type?
12. Which of the following is collision resolution?
13. A graph is called__________ if there is no single node whose removal causes the graph to break into two or more pieces.
14. _______________ is a solution to a problem independent of programming language.
15. Arranging records in some logical order is called __________
16. Stack can be represented by means of ____________.
17. ______ are simply values or sets of values.
18. Expansion of PERT is _________.
19. Which of the following is not a data structure operation?
20. The number of nodes in a complete binary tree of level 5 is__________.
21. The sequence (1,1) (2,1) (3,1) (1,2) (2,2) (3,2) . . . .represents _________.
22. When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.
23. The post order traversal of a binary tree is DEBFCA. Find out the preorder traversal.
24. A _________linked list is a linked list which always contains a special node called the header node, at the beginning of the list.
25. The hashing file space is divided into_______________.