1. Which of the following is not an abstract data type?
(A) Stack
(B) Queue
(C) Array
(D) Linked List
2. What does ADT stand for?
(A) Abstract Design Type
(B) Abstract Data Type
(C) Array Data Type
(D) Algorithm Data Type
3. Which ADT stores elements in a first-in, first-out (FIFO) order?
(A) Stack
(B) Queue
(C) List
(D) Tree
4. Which operation is not associated with the Stack ADT?
(A) Push
(B) Pop
(C) Peek
(D) Enqueue
5. In a Queue ADT, which operation is used to add an element?
(A) Push
(B) Insert
(C) Enqueue
(D) Append
6. Which of the following is true for a Stack ADT?
(A) Last-in, first-out (LIFO)
(B) First-in, first-out (FIFO)
(C) Random access
(D) Both A and B
7. Which of the following data structures is best suited for implementing a recursive function call?
(A) Queue
(B) Stack
(C) Linked List
(D) Tree
8. Which ADT allows access to elements by their position index?
(A) Stack
(B) Queue
(C) List
(D) Tree
9. In a linked list, what is each element typically referred to as?
(A) Node
(B) Vertex
(C) Cell
(D) Unit
10. Which ADT is best for representing a hierarchical relationship?
(A) Stack
(B) Queue
(C) Graph
(D) Tree
11. Which ADT is not linear?
(A) Stack
(B) Queue
(C) Tree
(D) Array
12. Which of the following operations is not fundamental to the Queue ADT?
(A) Enqueue
(B) Dequeue
(C) Peek
(D) Traverse
13. What is the complexity of accessing an element in an array?
(A) O(1)
(B) O(n)
(C) O(log n)
(D) O(n²)
14. What is the complexity of inserting an element at the beginning of a linked list?
(A) O(1)
(B) O(n)
(C) O(log n)
(D) O(n²)
15. Which ADT is best for representing a sequence of elements where insertions and deletions occur frequently?
(A) Array
(B) Linked List
(C) Stack
(D) Queue
16. Which of the following operations is associated with the Tree ADT?
(A) Insertion
(B) Deletion
(C) Traversal
(D) All of the above
17. What type of ADT is used to model real-world hierarchical data such as organizational structures?
(A) Stack
(B) Queue
(C) Tree
(D) Graph
18. In a circular queue, how is the queue fullness determined?
(A) Front = Rear
(B) Rear = Max size
(C) (Rear + 1) % Max size = Front
(D) None of the above
19. Which ADT is appropriate for implementing a priority system?
(A) Stack
(B) Queue
(C) Priority Queue
(D) Linked List
20. Which of the following is not a common operation on an ADT?
(A) Creation
(B) Destruction
(C) Traversal
(D) Compilation