Q11medium
Given the string "abacaba", what is the value of Z[4] in the Z- array? (0-indexed, where Z[i] is the length of the longest substring starting at i which is also a prefix).
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 ModeQ12hard
In Dynamic Programming, what is Memoization?
Q13easy
What is the Lower Bound for the number of comparisons required to sort N elements using any Comparison-based sorting algorithm?
Q14easy
What is the "Top-Down" approach in Algorithm Design?
Q15easy
What is Tail-Call Optimization (TCO)?
Q16medium
A plagiarism checker needs to find multiple different phrases from a database in a single student essay. Which algorithm is best suited for matching multiple patterns at once?
Q17medium
In a graph representation using an Adjacency Matrix adj[V] [V], how do you check if an edge exists between node 3 and node 5?
Q18easy
What is a Topological Sort of a Directed Acyclic Graph (DAG)?
Q19easy
What is the difference between Backtracking and Brute Force?
Q20hard
You need to detect if a "Deadlock" exists in an Operating System. You model the resources and processes as a directed graph. A deadlock exists if: