⚙️
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 3 of 5 • Questions 21-30 of 50
Q21medium
What is the time complexity of counting sort?
Q22medium
What is the recurrence relation for merge sort?
Q23medium
What is the time complexity of the longest increasing subsequence problem using DP?
Q24medium
Which algorithm is used for topological sorting?
Q25easy
What is the space complexity of iterative binary search?
Q26medium
What is the time complexity of the edit distance problem using DP?
Q27easy
Which algorithm has the best average-case time complexity for sorting?
Q28medium
What is the time complexity of finding all strongly connected components?
Q29medium
What is the time complexity of the fractional knapsack problem using greedy?
Q30medium