Q91hard
What is the Space Complexity of an iterative implementation of Binary Search?
Back to Data Structures & Algorithms
108 Questions Total
Foundations of Data Structures and Algorithms MCQs
Topic-wise practice questions for Data Structures & Algorithms. Test your knowledge, check solutions on demand, and pace your preparation.
Zero-leak answer engine • Rate-limited explanations
Practice in Timed ModeQ92easy
When an algorithm is Θ(n log n), it means:
Q93medium
In a Circular Queue of size 5, if front = 4 and rear = 4 (full), and one item is dequeued, what is the new front?
Q94hard
What is the time complexity of a recursive function that calls itself twice with (n-1) each time? (e.g., f(n) { f(n-1); f(n-1); })
Q95easy
What is the Degree of a Leaf node in a tree?
Q96easy
Which notation is used to describe the Best Case scenario of an algorithm's growth?
Q97hard
A developer believes their algorithm is O(1) because it doesn't have any loops. However, inside the function, they call list.contains(item) on a list of size n. What is the actual complexity?
Q98medium
In a mathematical Tree with N nodes, what is the exact number of edges required to keep it connected without cycles?
Q99easy
What is the absolute prerequisite for an array before a Binary Search can be successfully executed?
Q100easy
What is the difference between a Linear and Circular Linked List?