📝
GATE CS - Practice Questions
GATE-style practice questions covering all subjects
75 questions8 pages~113 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 / 750%
Page 7 of 8 • Questions 61-70 of 75
Q61medium
[GATE CS 2025] What is the space complexity of merge sort?
Q62medium
[GATE CS 2025] In a binary tree with n nodes, what is the minimum number of levels?
Q63medium
[GATE CS 2025] What is the time complexity of finding longest common subsequence using DP for strings of length m and n?
Q64medium
[GATE CS 2025] In FCFS scheduling, if processes arrive at times 0, 2, 4 with burst times 5, 3, 2, what is average waiting time?
Q65medium
[GATE CS 2025] What is the maximum number of hosts in subnet 192.168.1.0/26?
Q66hard
[GATE CS 2025] In a relation R(A,B,C) with A as primary key and functional dependencies A→B and B→C, what normal form is R in?
Q67medium
[GATE CS 2025] What is the time complexity of Bellman-Ford algorithm for shortest path?
Q68medium
[GATE CS 2025] In a 4-way set-associative cache with 256 blocks total, how many sets are there?
Q69hard
[GATE CS 2025] What is the pumping length for proving that {aⁿbⁿcⁿ | n ≥ 0} is not context-free?
Q70medium