Home > BCA > Quizzes > Data Structures Test
Data Structures Test
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 26% • Most missed: “A tree is a data structure which represents hierarchical relationship between in…”
Data Structures Test
Time left 00:00
25 Questions

1. Data items that are divided into subitems are called ___________.
2. A tree is a data structure which represents hierarchical relationship between individual _________.
3. __________is combining the records in two different sorted files in to a single sorted file.
4. The OS of a computer may periodically collect all the deleted space onto the free storage list. This technique is called______________.
5. A connected graph T without any cycles is called _____________.
6. The number of edges in a regular graph of degree d and n vertices is _______.
7. The complexity of linear search algorithm is____________.
8. Which of the following conditions checks available free space in avail list?
9. The hashing file space is divided into_______________.
10. For the heap sort, access to nodes involves simple _______________ operations.
11. A linked list whose last node points back to the list node instead of containing the null pointer________.
12. Which of the following data structure is linear data structure?
13. What is the worst-case time for heap sort to sort an array of n elements?
14. Base address is the address of __________.
15. The queue which wraps around upon reaching the end of the array is called as____________.
16. A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
17. The children node of same parent is called____________.
18. _______________ is a solution to a problem independent of programming language.
19. An _________ is a well defined list of steps for solving a problem.
20. Collection of related data items is called _______.
21. Sub algorithms fall into two basic categories: function sub algorithms and ____________ sub algorithms.
22. ____________ has certain attributes or properties which may be assigned values.
23. STACK is also called as ______________.
24. The maximum number of nodes on level i of a binary tree is ___________.
25. Which data structure allows deleting data elements from front and inserting at rear?

⚡ Recently practiced quizzes in this topic
Live quiz activity
Introduction To Computers: Basics Operating Systems Review Computer Networking Practice Test Theory Of Computation System Analysis & Design Android Application Development Introduction To Computers: Operating Systems and Networking Computer Based Optimization Techniques Internet And Web Design Network Security Quiz
 
❤ If you liked Fatskills, consider supporting us by checking out The Life Manuals You Never Got.

🌈  Our mission is to help improve your scores in any subject and exam withonline quizzes, practice tests, study guides, & advice for students. Since 2018.
About | Explore | User Guide | Topics | Subjects | Doubt Solver | Career Aptitude Test | Answers | Free Tools | OSHA Basics Quiz | What Should We Know?
Privacy | Terms |
Without work one finishes nothing. - Ralph Waldo Emerson
© 2026 Fatskills.com

All trademarks, logos and brand names are the property of their respective owners. All company, product and service names used in this website are for identification purposes only. Use of these names, trademarks and brands does not imply endorsement.