Abstract Data Types (ADT) MCQs

By: Prof. Dr. Fazal Rehman | Last updated: September 20, 2024

Which of the following is not an abstract data type?

a) Stack
b) Queue
c) Array
d) Linked List
Answer: c) Array
What does ADT stand for?

a) Abstract Design Type
b) Abstract Data Type
c) Array Data Type
d) Algorithm Data Type
Answer: b) Abstract Data Type
Which ADT stores elements in a first-in, first-out (FIFO) order?

a) Stack
b) Queue
c) List
d) Tree
Answer: b) Queue
Which operation is not associated with the Stack ADT?

a) Push
b) Pop
c) Peek
d) Enqueue
Answer: d) Enqueue
In a Queue ADT, which operation is used to add an element?

a) Push
b) Insert
c) Enqueue
d) Append
Answer: c) Enqueue
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
Answer: a) Last-in, first-out (LIFO)
Which of the following data structures is best suited for implementing a recursive function call?

a) Queue
b) Stack
c) Linked List
d) Tree
Answer: b) Stack
Which ADT allows access to elements by their position index?

a) Stack
b) Queue
c) List
d) Tree
Answer: c) List
In a linked list, what is each element typically referred to as?

a) Node
b) Vertex
c) Cell
d) Unit
Answer: a) Node
Which ADT is best for representing a hierarchical relationship?

a) Stack
b) Queue
c) Graph
d) Tree
Answer: d) Tree
Which ADT is not linear?

a) Stack
b) Queue
c) Tree
d) Array
Answer: c) Tree
Which of the following operations is not fundamental to the Queue ADT?

a) Enqueue
b) Dequeue
c) Peek
d) Traverse
Answer: d) Traverse
What is the complexity of accessing an element in an array?

a) O(1)
b) O(n)
c) O(log n)
d) O(n^2)
Answer: a) O(1)
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^2)
Answer: a) O(1)
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
Answer: b) Linked List
Which of the following operations is associated with the Tree ADT?

a) Insertion
b) Deletion
c) Traversal
d) All of the above
Answer: d) All of the above
What type of ADT is used to model real-world hierarchical data such as organizational structures?

a) Stack
b) Queue
c) Tree
d) Graph
Answer: c) Tree
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
Answer: c) (Rear + 1) % Max size = Front
Which ADT is appropriate for implementing a priority system?

a) Stack
b) Queue
c) Priority Queue
d) Linked List
Answer: c) Priority Queue
Which of the following is not a common operation on an ADT?

a) Creation
b) Destruction
c) Traversal
d) Compilation
Answer: d) Compilation

 

Data Structures MCQs

Basic Concepts

1. Introduction to Data Structures
   • Abstract Data Types (ADT) MCQs
2. Complexity Analysis MCQs
   • Time complexity MCQs
   • Space complexity MCQs
   • Big O, Big Ω, Big Θ notations MCQs

Linear Data Structures MCQs

1. Arrays MCQs
   • One-dimensional arrays MCQs
   • Multi-dimensional arrays MCQs
   • Operations: traversal, insertion, deletion MCQs
2. Linked Lists MCQs
   • Singly linked list MCQs
   • Doubly linked list MCQs
   • Circular linked list MCQs
3. Stacks MCQs
   • Stack operations (push, pop, peek) MCQs
   • Applications of stacks (expression evaluation, recursion) MCQs
4. Queues MCQs
   • Queue operations (enqueue, dequeue, front, rear) MCQs
   • Types: Simple queue, circular queue, priority queue, deque MCQs

Non-Linear Data Structures MCQs

1. Trees MCQs
   • Binary trees MCQs
   • Binary Search Trees (BST) MCQs
   • AVL Trees MCQs
   • B-trees and B+ trees MCQs
   • Tree traversal methods (in-order, pre-order, post-order) MCQs
2. Heaps MCQs
   • Min-heap MCQs
   • Max-heap MCQs
   • Heap operations (insertion, deletion, heapify) MCQs
   • Applications of heaps (priority queues, heap sort) MCQs
3. Graphs MCQs
   • Graph representation (adjacency matrix, adjacency list) MCQs
   • Graph traversal algorithms (DFS, BFS) MCQs
   • Shortest path algorithms (Dijkstra’s, Bellman-Ford) MCQs
   • Minimum Spanning Tree (Kruskal’s, Prim’s) MCQs

Hashing MCQs MCQs

1. Hash Tables
   • Hash functions MCQs
   • Collision resolution techniques (chaining, open addressing) MCQs
   • Applications of hashing MCQs

Sorting and Searching Algorithms MCQs 

1. Sorting Algorithms MCQs
   • Bubble sort MCQs
   • Selection sort MCQs
   • Insertion sort MCQs
   • Merge sort MCQs
   • Quick sort MCQs
   • Heap sort MCQs
2. Searching Algorithms MCQs
   • Linear search MCQs
   • Binary search MCQs
   • Interpolation search MCQs

Miscellaneous

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

1. Data Structures MCQs 1
2. Data Structures MCQs 2
3. Data Structures MCQs 3
4. Data Structures MCQs 4
5. Data Structures MCQs 5
6. Stacks Solved MCQs
7. Queues MCQs
8. pointer mcqs
9. Array MCQs