Q71easy
What is a major memory-related disadvantage of a Trie compared to a Hash Map for string storage?
Back to Data Structures & Algorithms
104 Questions Total
Graph 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 ModeQ72medium
A change-making algorithm always picks the largest coin denomination first. For standard US currency (25, 10, 5, 1), this works. For custom coins (10, 7, 1), it fails to find the minimum number of coins for the value 14. This shows the failure of:
Q73easy
What is Optimal Substructure?
Q74hard
In computational complexity theory, what is the definition of the class P?
Q75hard
An algorithm is using Divide and Conquer to find the closest pair of points in a 2D plane. What is the standard complexity achieved?
Q76medium
You are designing a "Find and Replace" feature for a text editor. The user is searching for a very short word (2 letters) in a massive novel. Which algorithm might perform worse than expected here?
Q77easy
What is the primary difference between **Kruskal's** and **Prim's** algorithms for finding an MST?
Q78easy
What is State Space Search?
Q79medium
Which of the following is an example of an **NP-Complete** problem that is often solved using Backtracking?
Q80easy
Which of the following problems is notoriously intractable (NP- Complete)?