Home > Basic Programming > Quizzes > Data Structures Fundamentals Test
Data Structures Fundamentals Test
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 23% • Most missed: “What is true of the complete bipartite graphs K(3 - 3) and K(2 - 4)?”
Data Structures Fundamentals Test
Time left 00:00
25 Questions

1. Where does the push member function place the new entry on the linked list in the linked list implementation of a queue?
2. A matrix is called sparse when______
3. Which of the operations is simpler in the doubly linked list than it is in the simple linked list?
4. What will happen if in data structure a pop operation on the stack causes the stack pointer to move past the origin of the stack?
5. Which information is not saved in the activation record when a function call is executed?
6. You have implemented a queue with a circular array keeping track of the first item - the last item - and the count (the number of items in the array). Suppose the address of the first is zero - and that of the last is CAPACITY-1 - what can you say about the count?
7. Which of the following is false?
8. A given connected graph G is a Euler graph if and only if all vertices of G are of ______.
9. What is the worst-case scenario for the binary search for finding a single item in an sorted array?
10. One difference between a queue and a stack is:
11. Suppose X is a B-tree leaf containing 41 entries and has at least one sibling. Which of the statements would be true in this case?
12. Four characters are placed in a queue in the following order: D - C - B - and A. If they are removed one at a time - what will be the order of their removal?
13. What is the pre-order traversal equivalent of the following algebraic expression? [a+(b-c)]*[(d-e)/(f+(g-h))]
14. Which feature of heaps allows them to be efficiently implemented using a partially filled array?
15. A sparse matrix can be a lower-triangular matrix when____.
16. A graph in which all nodes are of an equal degree is known as:
17. What is the worst-case scenario for mergesort to sort an array of n elements?
18. Which of the following lines of the code will delete two successive nodes of a single linked linear list(with more than two nodes)? Here 'LINK[X]' denotes the address field of node X.
19. Which of the following sorting algorithms yield approximately the same worst-case and average-case running time behavior in O(n*log(n))?
20. The operation for adding an entry to a stack is traditionally called ________.
21. Suppose we have a circular array implementation of a queue - with ten items in the queue stored at data[2] through data[11]. The CAPACITY is 42. Where does the push member function place the new entry in the array?
22. What is the formulae to find maximum number of nodes n in a perfect binary tree?
23. In a graph G having the cut set matrix C(G) and an incidence matrix A(G) - the rank of C(G) would be____
24. Which term is used to describe an O(n) algorithm?
25. Consider a hashing function that resolves collision by quadratic probing. Assume that the address space is indexed from 1 to 8. If a collision occurs at position 4 - the location which will never be probed is:

⚡ 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 Concepts Of Programming Languages: Final Programming
 
❤ 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.