⚙️

GATE CS - Algorithms

Master algorithm design, complexity analysis, and problem-solving techniques

50 questions•5 pages•~75 min

Progress: 0 / 500%

Page 1 of 5 • Questions 1-10 of 50

Q1easy

What is the time complexity of binary search?

A)O(n)

B)O(log n)

C)O(n log n)

D)O(1)

Q2medium

What is the worst-case time complexity of quicksort?

A)O(n log n)

B)O(n²)

C)O(n)

D)O(log n)

Q3easy

Which sorting algorithm has the best average-case time complexity?

A)Bubble Sort

B)Insertion Sort

C)Merge Sort

D)Selection Sort

Q4medium

What is the time complexity of BFS on a graph with V vertices and E edges?

A)O(V)

B)O(E)

C)O(V + E)

D)O(V × E)

Q5medium

What is the space complexity of merge sort?

A)O(1)

B)O(log n)

C)O(n)

D)O(n log n)

Q6medium

Which algorithm is used to find the shortest path in a weighted graph with negative edges?

A)Dijkstra's algorithm

B)Bellman-Ford algorithm

C)Floyd-Warshall algorithm

D)BFS

Q7hard

What is the time complexity of the 0/1 Knapsack problem using dynamic programming?

A)O(n)

B)O(n log n)

C)O(n × W)

D)O(2ⁿ)

Q8easy

Which algorithm design technique is used in quicksort?

A)Greedy

B)Dynamic Programming

C)Divide and Conquer

D)Backtracking

Q9easy

What is the time complexity of finding the maximum element in an unsorted array?

A)O(1)

B)O(log n)

C)O(n)

D)O(n log n)

Q10medium

Which data structure is typically used to implement Dijkstra's algorithm efficiently?

A)Stack

B)Queue

C)Priority Queue (Heap)

D)Hash Table

...

Schoolabe

Learn, Practice, Ace Coding

Programs Companies Tutorials Practice Quiz Interview Prep

About Contact Careers Blog

Documentation API Reference Community Support