Q61medium
Which algorithm is most suitable for searching an element in a sorted list of unknown or infinite length?
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 ModeQ62medium
You have a Hash Table of size 10. Using the hash function h(k) = k mod 10, what is the index for key 1257?
Q63hard
What is the complexity of an algorithm that first sorts an array using Merge Sort (O(n log n)) and then performs a linear search (O(n)) on it?
Q64medium
An array has only 3 distinct values (e.g., 0, 1, 2) repeated many times. Which algorithm (Dutch National Flag problem) is most efficient?
Q65easy
For an array of size 10,000, what is the most efficient block size for a Jump Search?
Q66easy
What is a Sentinel Node?
Q67hard
You need an algorithm with a guaranteed O(N \log N) worst- case time complexity and O(1) extra space. Which is the best choice?
Q68easy
If a Hash Table has 100 slots and contains 70 items, what is its Load Factor?
Q69easy
In Quadratic Probing, if the initial hash is h, the sequence of probes is:
Q70hard
In the worst-case scenario, how many comparisons are required to find an element in a sorted array of 1,024 elements using Binary Search?