📚
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 2 of 5 • Questions 11-20 of 50
Q11easy
What is the time complexity of push operation in a stack implemented using array?
Q12easy
What is the time complexity of enqueue operation in a queue?
Q13easy
How many edges does a complete graph with n vertices have?
Q14medium
What is the minimum height of a binary tree with n nodes?
Q15medium
What is the space complexity of adjacency list representation of a graph?
Q16easy
What is the time complexity of finding an element in a linked list?
Q17easy
Which data structure is used to implement recursion?
Q18medium
What is the time complexity of deleting a node from a BST?
Q19easy
What is the main advantage of doubly linked list over singly linked list?
Q20easy
What is the time complexity of inorder traversal of a binary tree with n nodes?
...