📚
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 1 of 5 • Questions 1-10 of 50
Q1easy
What is the time complexity of accessing an element in an array by index?
Q2easy
What is the time complexity of inserting an element at the beginning of an array?
Q3easy
What is the time complexity of inserting an element at the head of a linked list?
Q4medium
What is the maximum number of nodes in a binary tree of height h?
Q5easy
What is the time complexity of searching in a balanced BST?
Q6easy
Which traversal of a BST gives elements in sorted order?
Q7medium
What is the time complexity of BFS on a graph with V vertices and E edges?
Q8medium
What is the space complexity of DFS on a graph?
Q9easy
What is the time complexity of hash table search with good hash function?
Q10easy
What is the main advantage of linked list over array?
...