Home > BCA > Quizzes > Advanced Data Structure
Advanced Data Structure
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 19% • Most missed: “data structure where elements can be added or removed at either end but not in t…”
Advanced Data Structure
Time left 00:00
25 Questions

1. The disadvantage in using a circular linked list is …………………….
2. The simplest type of data structure is ………………
3. Which is/are the application(s) of stack
4. Which of the following data structure is non-linear type?
5. Linear arrays are also called ……………….
6. ………… is very useful in situation when data have to stored and then retrieved in reverse order.
7. Which of the following statement is false?
8. Which of the following data structures are indexed structures?
9. The time complexity of quick sort is …………..
10. State True or False. A. An undirected graph which contains no cycles is called forest. B. A graph is said to be complete if there is an edge between every pair of vertices.
11. Which of the following is not the type of queue?
12. …………………. Is a directed tree in which outdegree of each node is less than or equal to two.
13. graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
14. ………… is not the operation that can be performed on queue.
15. Arrays are best data structures
16. Arrays are best data structures …………
17. Which data structure is used in breadth first search of a graph to hold nodes?
18. Which of the following is non-liner data structure?
19. To represent hierarchical relationship between elements, Which data structure is suitable?
20. Which of the following are the operations applicable an primitive data structures?
21. In a circular queue the value of r will be ..
22. There is an extra element at the head of the list called a ……….
23. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
24. When does top value of the stack changes?
25. 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."

⚡ 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.