2. Which of the following is not true about a singly linked list?

It allows random access
It can grow dynamically
Insertion is faster than arrays
It uses more memory than arrays

3. Which data structure uses LIFO (Last In First Out) principle?

Queue
Array
Stack
Tree

4. Which of the following queue types allows insertion at one end and deletion at the other?

Circular Queue
Deque
Priority Queue
Linear Queue

5. What is the maximum number of nodes in a binary tree of height h?

2^h
2^h - 1
h
h²

6. What is the best-case time complexity of binary search?

O(n)
O(log n)
O(1)
O(n log n)

7. Which of these sorting algorithms has the worst-case time complexity of O(n²)?

Merge Sort
Quick Sort
Bubble Sort
Heap Sort

8. What is the primary advantage of using a hash table?

Sorted data
Constant-time search
Easy implementation
Uses less memory

9. What data structure is commonly used for Breadth-First Search (BFS) in graphs?

Stack
Queue
Array
Linked List

10. Which of the following problems is best solved using recursion?

Linear search
Tower of Hanoi
Bubble sort
Binary to decimal conversion