**EXAMINATION REVISION QUESTIONS: SET 1**
**Linear Data Structures (Stack, Queue):**
1. (5 marks): Define a stack and a queue. Please provide an example for each, highlighting their
behaviors: Last In, First Out (LIFO) for stacks and First In, First Out (FIFO) for queues.
2. (5 marks): Explain how a stack checks for balanced parentheses in an expression, along with a
brief example.
**Non-Linear Data Structures (Tree, Graph, Heaps):**
3. (5 marks): Describe the key properties of a binary search tree (BST) and how its structure
enhances search efficiency.
4. (5 marks): Differentiate between Depth-First Search (DFS) and Breadth-First Search (BFS).
Provide scenarios where each is preferable.
5. (5 marks): What is a heap? Describe the differences between a min-heap and a max-heap.
6. (5 marks): Explain a binary tree and the difference between complete and full binary trees.
**Data Dictionaries (Hash Tables):**
7. (5 marks): What is a hash table? Discuss hash collisions and one method for resolving them.
8. (5 marks): Describe the average-case time complexity for searching, inserting, and deleting in
a well-implemented hash table.
**Sorting Algorithms:**
**Linear Data Structures (Stack, Queue):**
1. (5 marks): Define a stack and a queue. Please provide an example for each, highlighting their
behaviors: Last In, First Out (LIFO) for stacks and First In, First Out (FIFO) for queues.
2. (5 marks): Explain how a stack checks for balanced parentheses in an expression, along with a
brief example.
**Non-Linear Data Structures (Tree, Graph, Heaps):**
3. (5 marks): Describe the key properties of a binary search tree (BST) and how its structure
enhances search efficiency.
4. (5 marks): Differentiate between Depth-First Search (DFS) and Breadth-First Search (BFS).
Provide scenarios where each is preferable.
5. (5 marks): What is a heap? Describe the differences between a min-heap and a max-heap.
6. (5 marks): Explain a binary tree and the difference between complete and full binary trees.
**Data Dictionaries (Hash Tables):**
7. (5 marks): What is a hash table? Discuss hash collisions and one method for resolving them.
8. (5 marks): Describe the average-case time complexity for searching, inserting, and deleting in
a well-implemented hash table.
**Sorting Algorithms:**
