🎯
GATE CS - Full Mock Test
Complete 65-question mock test covering all subjects (3-hour timed exam)
65 questions•7 pages•~98 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 / 650%
Page 2 of 7 • Questions 11-20 of 65
Q11easy
What is the worst-case time complexity of quicksort?
Q12medium
What is the space complexity of merge sort?
Q13medium
What is the time complexity of deleting an element from a balanced BST?
Q14medium
What is the time complexity of Dijkstra's algorithm using binary heap?
Q15medium
What is the optimal substructure property in dynamic programming?
Q16medium
What is the time complexity of the 0/1 knapsack problem using dynamic programming?
Q17medium
What is the greedy choice property?
Q18medium
What is the time complexity of Kruskal's algorithm for MST?
Q19medium
What is the time complexity of finding longest common subsequence using DP?
Q20medium
What is the time complexity of Bellman-Ford algorithm?
...