📚
GATE CS - Programming & Data Structures
Practice arrays, linked lists, stacks, queues, trees, graphs, and hashing
50 questions•5 pages•~75 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 / 500%
Page 3 of 5 • Questions 21-30 of 50
Q21easy
What is the collision resolution method in hash tables that uses linked lists?
Q22easy
What is the time complexity of inserting an element at the end of an array?
Q23medium
What is the maximum number of nodes at level i in a binary tree?
Q24medium
What is the time complexity of DFS on a graph?
Q25easy
What is the main disadvantage of adjacency matrix representation?
Q26easy
What is the time complexity of finding minimum element in a BST?
Q27medium
What is the space complexity of recursive quicksort?
Q28medium
What is the main advantage of circular queue over linear queue?
Q29medium
What is the time complexity of hash table insert with chaining?
Q30easy