Abstract Data Types (ADT) MCQsBy: Prof. Dr. Fazal Rehman | Last updated: May 14, 2025 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 Time complexity MCQs Space complexity MCQs Big O, Big Ω, Big Θ notations MCQs Linear Data Structures MCQs Arrays MCQs One-dimensional arrays MCQs Multi-dimensional arrays MCQs Operations: traversal, insertion, deletion MCQs Linked Lists MCQs Singly linked list MCQs Doubly linked list MCQs Circular linked list 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 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 Heaps MCQs Min-heap MCQs Max-heap MCQs Heap operations (insertion, deletion, heapify) MCQs Applications of heaps (priority queues, heap sort) MCQs 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 Hash Tables Hash functions MCQs Collision resolution techniques (chaining, open addressing) MCQs Applications of hashing MCQs Sorting and Searching Algorithms MCQs Sorting Algorithms MCQs Bubble sort MCQs Selection sort MCQs Insertion sort MCQs Merge sort MCQs Quick sort MCQs Heap sort MCQs Searching Algorithms MCQs Linear search MCQs Binary search MCQs Interpolation search 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 Related Posts:Types of Instructions (Data Movement, Arithmetic, Control) MCQsAttributes types in data miningData Types in CPP (C Plus Plus)Data Quality in Data Preprocessing for Data MiningTypes of contracts (e.g., sales contracts MCQs, employment contracts MCQs)Backup types and strategies MCQs in DBMS