📝
GATE CS - Practice Questions
GATE-style practice questions covering all subjects
75 questions•8 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 5 of 8 • Questions 41-50 of 75
Q41medium
[GATE CS 2025] Consider a complete binary tree with 7 nodes. What is the height of this tree?
Q42medium
[GATE CS 2025] In a graph with 10 vertices, what is the maximum number of edges possible?
Q43medium
[GATE CS 2025] What is the time complexity of the 0/1 knapsack problem using dynamic programming with n items and capacity W?
Q44hard
[GATE CS 2025] In LRU page replacement, if page reference string is 1,2,3,4,1,2,5,1,2,3,4,5 with 3 frames, how many page faults occur?
Q45medium
[GATE CS 2025] What is the effective access time with cache hit ratio 90%, cache access 1ns, memory access 100ns?
Q46easy
[GATE CS 2025] What is the subnet mask for IP address 10.0.0.0/8?
Q47medium
[GATE CS 2025] In a database, if relation R(A,B,C) has functional dependencies A→B and B→C, what normal form is R in?
Q48medium
[GATE CS 2025] What is the time complexity of finding strongly connected components using Kosaraju's algorithm?
Q49medium
[GATE CS 2025] In a 4-way set-associative cache with 64 blocks total, how many sets are there?
Q50medium
[GATE CS 2025] What is the main difference between 2NF and 3NF?
......