Time complexity MCQs

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

What is the time complexity of accessing an element in an array by index?

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

a) O(n)
b) O(log n)
c) O(1)
d) O(n^2)
Answer: c) O(1)
What is the best-case time complexity of quicksort?

a) O(n)
b) O(n log n)
c) O(n^2)
d) O(log n)
Answer: b) O(n log n)
What is the worst-case time complexity of quicksort?

a) O(n log n)
b) O(n)
c) O(n^2)
d) O(log n)
Answer: c) O(n^2)
What is the time complexity of searching for an element in a balanced binary search tree (BST)?

a) O(n)
b) O(log n)
c) O(1)
d) O(n log n)
Answer: b) O(log n)
What is the time complexity of merging two sorted arrays of size n?

a) O(n log n)
b) O(n)
c) O(log n)
d) O(n^2)
Answer: b) O(n)
What is the time complexity of deleting an element from a linked list given a pointer to that element?

a) O(1)
b) O(n)
c) O(log n)
d) O(n^2)
Answer: a) O(1)
What is the average-case time complexity of binary search?

a) O(n)
b) O(log n)
c) O(1)
d) O(n log n)
Answer: b) O(log n)
What is the time complexity of finding the maximum element in an unsorted array?

a) O(n log n)
b) O(n)
c) O(log n)
d) O(1)
Answer: b) O(n)
What is the time complexity of the bubble sort algorithm in the worst case?

a) O(n)
b) O(n log n)
c) O(n^2)
d) O(log n)
Answer: c) O(n^2)
What is the time complexity of inserting an element into a max-heap?

a) O(n)
b) O(log n)
c) O(1)
d) O(n log n)
Answer: b) O(log n)
What is the time complexity of deleting the minimum element from a min-heap?

a) O(n)
b) O(log n)
c) O(1)
d) O(n log n)
Answer: b) O(log n)
What is the time complexity of traversing a binary tree?

a) O(n log n)
b) O(n)
c) O(log n)
d) O(n^2)
Answer: b) O(n)
What is the time complexity of the merge sort algorithm?

a) O(n log n)
b) O(n)
c) O(log n)
d) O(n^2)
Answer: a) O(n log n)
What is the time complexity of the selection sort algorithm?

a) O(n log n)
b) O(n)
c) O(log n)
d) O(n^2)
Answer: d) O(n^2)
What is the time complexity of searching for an element in an unbalanced binary search tree (BST)?

a) O(n)
b) O(log n)
c) O(1)
d) O(n log n)
Answer: a) O(n)
What is the time complexity of checking if an element exists in a hash table with n elements?

a) O(n)
b) O(log n)
c) O(1)
d) O(n^2)
Answer: c) O(1)
What is the time complexity of the insertion sort algorithm in the best case?

a) O(n log n)
b) O(n)
c) O(log n)
d) O(n^2)
Answer: b) O(n)
What is the time complexity of deleting an element from an array, given its index?

a) O(1)
b) O(n)
c) O(log n)
d) O(n log n)
Answer: b) O(n)
What is the time complexity of the Fibonacci sequence using dynamic programming?

a) O(n)
b) O(log n)
c) O(1)
d) O(n^2)
Answer: a) 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