📝
GATE CS - Practice Questions
GATE-style practice questions covering all subjects
75 questions•8 pages•~113 min
Progress: 0 / 750%
Page 1 of 8 • Questions 1-10 of 75
Q1easy
[GATE CS 2025] What is the time complexity of finding the maximum element in an unsorted array of n elements?
Q2medium
[GATE CS 2025] Consider a binary tree with 15 nodes. What is the minimum possible height of this tree?
Q3easy
[GATE CS 2025] In a hash table with chaining, if the load factor is 0.75 and table size is 100, how many keys are stored?
Q4medium
[GATE CS 2025] What is the time complexity of Dijkstra's algorithm using binary heap for a graph with V vertices and E edges?
Q5medium
[GATE CS 2025] In a round-robin scheduling with time quantum 2ms, if process P1 has burst time 5ms, how many context switches occur?
Q6medium
[GATE CS 2025] What is the subnet mask for IP address 192.168.10.0/26?
Q7medium
[GATE CS 2025] In a database, if relation R is in 3NF, which of the following is true?
Q8easy
[GATE CS 2025] What is the purpose of the TLB (Translation Lookaside Buffer)?
Q9medium
[GATE CS 2025] In a 5-stage pipeline, if there are 100 instructions, how many clock cycles are needed?
Q10hard
[GATE CS 2025] What is the pumping length for the language L = {0ⁿ1ⁿ | n ≥ 0}?
...