Course question bank

GATE CS Algorithms Questions

Practice Algorithms GATE CS questions with answers and solutions. Browse 5 questions across 4 chapters and 5 topics for focused subject-wise revision.

Subject overview

Algorithms practice map

5 questions are available across 4 chapters and 5 topics.

2 questions

Sorting

Quick Sort

The average-case time complexity of Quick Sort is?MCQ / 2022 / Question

Merge Sort

Merge Sort's worst-case space complexity is?MCQ / 2023 / Theory

1 questions

Graph Algorithms

Dijkstra's Algorithm

Dijkstra's algorithm fails when the graph has?MCQ / 2023 / Question

1 questions

Dynamic Programming

0/1 Knapsack

Time complexity of 0/1 Knapsack via DP with n items and capacity W?MCQ / 2024 / Question

1 questions

Greedy

Activity Selection

Given activities with start/end times, the greedy strategy that maximizes the number of activities selects activities sorted by which attribute? (1 = start time, 2 = end time)NAT / 2022 / Theory