Home > Basic Programming > Quizzes > Data Structures and Algorithms Fundamentals Test
Data Structures and Algorithms Fundamentals Test
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 31% • Most missed: “BFS and DFS are two types of”
Data Structures and Algorithms Fundamentals Test
Time left 00:00
25 Questions

1. Which of the following is NOT a basic function of a linked list?
2. What is the difference between the stack and queue data structures?
3. What is the best-case for comparison based sorting?
4. Worst case insert for a dynamic array is
5. What algorithm uses polynomial time to find the largest common subsequence of two sequences?
6. If a node having two children is deleted from a binary tree - it is replaced by its:
7. What is the correct order for a pre-order binary tree traversal?
8. Can a binary tree be implemented using an array?
9. What is the data structure used to perform recursion?
10. Can Dijkstra's be used to find the longest-path in a graph?
11. Which is an access mechanism that transforms the search key into a storage address - thereby providing very fast access to stored data?
12. BFS and DFS are two types of
13. Which of the following is NOT a metric of algorithm analysis?
14. What is a disadvantage of a linked list?
15. What is the worst-case time complexity of the simple Ford-Fulkerson algorithm for finding the maximum flow in a graph given a source and a sink - and all integer capacities on edges? Assume the graph G = (V - E) has a finite - integer maximum flow value of f.
16. A full binary tree with 2n+1 nodes contains:
17. All binary trees are balanced
18. What is the amortized insertion time into a red and black tree?
19. Which data structure is used in performing non-recursive depth-first search in graphs?
20. Which is a sequence of statements that form a logical argument?
21. What is the simplest file structure?
22. Minimum number of queues needed to implement the priority queue?
23. What is the most suitable data structure for a situation where tasks must be scheduled for execution on a computer and the tasks include system tasks?
24. Which represents data as a chain of nodes and provides dynamic growth of data?
25. The path length from root to farthest leaf node is the ______ of the tree.

⚡ Recently practiced quizzes in this topic
Live quiz activity
Conditional Programming System Analysis And Design Basic Programming Vocab General Programming System Programming Fundamentals Test 2 Programming Languages Introduction to Programming Fundamentals Test Scratch Programming Skills Test Data Structures Fundamentals Test Concepts Of Programming Languages: Final
 
❤ 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.