⚙️
GATE CS - Algorithms
Master algorithm design, complexity analysis, and problem-solving techniques
50 questions•5 pages•~75 min
Use this quiz track to strengthen recall, speed, and exam-style decision making. Attempt one page first, review explanations, and then re-attempt incorrect questions without notes.
A good scoring strategy is to mark uncertain questions, finish known ones quickly, and return with elimination logic. This improves accuracy while keeping momentum under time constraints.
Progress: 0 / 500%
Page 4 of 5 • Questions 31-40 of 50
Q31easy
Which algorithm finds all-pairs shortest paths?
Q32medium
What is the time complexity of radix sort for n numbers with d digits?
Q33medium
What is the time complexity of the activity selection problem using greedy?
Q34medium
What is the time complexity of finding the kth smallest element using quickselect?
Q35medium
Which algorithm is used for string matching with pattern preprocessing?
Q36hard
What is the time complexity of Prim's algorithm for MST?
Q37medium
What is the time complexity of the coin change problem using DP?
Q38medium
What is the time complexity of finding cycles in a directed graph using DFS?
Q39medium
What is the time complexity of the subset sum problem using DP?
Q40medium
What is the time complexity of finding articulation points in a graph?
...