Abstract Data Types (ADT) MCQs

20
Score: 0
Attempted: 0/20
Subscribe

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

Data Structures MCQs

Basic Concepts

Introduction to Data Structures
- Abstract Data Types (ADT) MCQs
Complexity Analysis MCQs

Linear Data Structures MCQs

Arrays MCQs
Linked Lists MCQs
Stacks MCQs
- Stack operations (push, pop, peek) MCQs
- Applications of stacks (expression evaluation, recursion) MCQs
Queues MCQs
- Queue operations (enqueue, dequeue, front, rear) MCQs
- Types: Simple queue, circular queue, priority queue, deque MCQs

Non-Linear Data Structures MCQs

Trees MCQs
Heaps MCQs
Graphs MCQs

Hashing MCQs MCQs

Hash Tables

Sorting and Searching Algorithms MCQs

Sorting Algorithms MCQs
Searching Algorithms MCQs

Miscellaneous

Memory Management in data structures MCQs
- Dynamic memory allocation MCQs
- Garbage collection MCQs
String Manipulation Algorithms MCQs
- Pattern matching (KMP, Rabin-Karp) MCQs
- String hashing MCQs

Data Structures MCQs 1
Data Structures MCQs 2
Data Structures MCQs 3
Data Structures MCQs 4
Data Structures MCQs 5
Stacks Solved MCQs
Queues MCQs
pointer mcqs
Array MCQs

Types of Instructions (Data Movement, Arithmetic, Control) MCQs
Attributes types in data mining
Data Types in CPP (C Plus Plus)
Data Quality in Data Preprocessing for Data Mining
Types of contracts (e.g., sales contracts MCQs, employment contracts MCQs)
Backup types and strategies MCQs in DBMS

Abstract Data Types (ADT) MCQs
By: Prof. Dr. Fazal Rehman | Last updated: May 14, 2025

Related Posts: