Operations: traversal, insertion, deletion MCQs

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

What is traversal in the context of data structures?

a) Adding an element to the data structure
b) Removing an element from the data structure
c) Accessing and processing each element of the data structure
d) Sorting the elements of the data structure
Answer: c) Accessing and processing each element of the data structure
Which traversal technique visits the left subtree, then the root, and finally the right subtree in a binary tree?

a) Preorder traversal
b) Inorder traversal
c) Postorder traversal
d) Level order traversal
Answer: b) Inorder traversal
Which traversal method is used in depth-first search (DFS) of a graph?

a) Inorder traversal
b) Preorder traversal
c) Postorder traversal
d) Any of the above
Answer: d) Any of the above
In a linked list, which operation requires traversal to reach the desired position?

a) Insertion at the head
b) Deletion at the head
c) Insertion at the tail
d) All of the above
Answer: c) Insertion at the tail
What is the time complexity of traversing an array of size n?

a) O(1)
b) O(log n)
c) O(n)
d) O(n^2)
Answer: c) O(n)
Insertion Operations
What is the time complexity of inserting an element at the beginning of a singly linked list?

a) O(1)
b) O(n)
c) O(log n)
d) O(n^2)
Answer: a) O(1)
In an array, what is the time complexity of inserting an element at the end?

a) O(1)
b) O(n)
c) O(log n)
d) O(n^2)
Answer: a) O(1)
What is the time complexity of inserting an element at a specific position in an array of size n?

a) O(1)
b) O(log n)
c) O(n)
d) O(n^2)
Answer: c) O(n)
In a binary search tree (BST), what is the average time complexity of inserting an element?

a) O(1)
b) O(log n)
c) O(n)
d) O(n^2)
Answer: b) O(log n)
In a heap, what is the time complexity of inserting an element?

a) O(1)
b) O(log n)
c) O(n)
d) O(n^2)
Answer: b) O(log n)
Deletion Operations
What is the time complexity of deleting the first element of a singly linked list?

a) O(1)
b) O(n)
c) O(log n)
d) O(n^2)
Answer: a) O(1)
In an array, what is the time complexity of deleting an element from a specific position?

a) O(1)
b) O(log n)
c) O(n)
d) O(n^2)
Answer: c) O(n)
What is the time complexity of deleting an element from the end of an array of size n?

a) O(1)
b) O(n)
c) O(log n)
d) O(n^2)
Answer: a) O(1)
In a binary search tree (BST), what is the average time complexity of deleting an element?

a) O(1)
b) O(log n)
c) O(n)
d) O(n^2)
Answer: b) O(log n)
What is the time complexity of deleting the root element in a max heap?

a) O(1)
b) O(log n)
c) O(n)
d) O(n^2)
Answer: b) O(log n)
Combined Operations
Which data structure allows insertion, deletion, and traversal in O(1) time complexity?

a) Array
b) Singly linked list
c) Doubly linked list
d) None of the above
Answer: d) None of the above
Which of the following data structures supports O(1) time complexity for both insertion and deletion at the beginning?

a) Array
b) Stack
c) Queue
d) Singly linked list
Answer: d) Singly linked list
Which traversal method is typically used to display elements of a binary search tree in ascending order?

a) Preorder
b) Inorder
c) Postorder
d) Level order
Answer: b) Inorder
In which data structure does insertion and deletion take O(1) time but traversal takes O(n) time?

a) Stack
b) Queue
c) Linked list
d) Binary search tree
Answer: c) Linked list
What is the time complexity of inserting an element in the middle of a linked list?

a) O(1)
b) O(n)
c) O(log n)
d) O(n log n)
Answer: b) O(n)

 

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