Q1easy
In a Binary Min-Heap, where is the second smallest element located?
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 ModeQ2hard
What is the time complexity to build a Binary Heap from an unsorted array of N elements using the bottom-up heapify method?
Q3easy
In DSU, what is the purpose of **"Union by Rank"** (or Size)?
Q4easy
In the context of Big-O, why do we say O(N) is "Better" than O(N^2)?
Q5easy
What is Overlapping Sub-problems in the context of DP?
Q6medium
You are building a search engine "Auto-complete" feature. Which data structure provides the most efficient way to store words and find all words starting with a specific prefix?
Q7medium
Why is bitwise AND with 1 (x & 1) often used to check if a number is odd, instead of x % 2 != 0?
Q8hard
During a DFS on a Directed Graph, you encounter an edge (u, v) where v is already in the current recursion stack. This indicates:
Q9hard
An algorithm has a time complexity of O(N!). If it takes 1 second to run for N = 10, how long will it approximately take for N = 11?
Q10easy
What is the Alphabet Size (Σ) for a standard binary string algorithm?