Data Structures and Algorithms MCQs

1. Which data structure allows deleting data elements from and inserting at both ends efficiently?

A) Stack
B) Queue
C) Deque
D) Tree

Answer: C

2. In a binary search tree, the maximum number of nodes at level ‘k’ is:

A) 2^k
B) k
C) 2^(k-1)
D) 2^k – 1

Answer: A

3. What is the worst-case time complexity of inserting a new element into the heap?

A) O(log n)
B) O(n)
C) O(n log n)
D) O(1)

Answer: A

4. Which of the following sorting algorithms has the lowest worst-case time complexity?

A) Bubble Sort
B) Merge Sort
C) Selection Sort
D) Insertion Sort

Answer: B

5. Which data structure is used to implement recursion?

A) Stack
B) Queue
C) Array
D) Tree

Answer: A

6. What is the time complexity of finding the shortest path in a weighted graph using Dijkstra’s algorithm?

A) O(V log V)
B) O(V^2)
C) O(E log V)
D) O(E + V log V)

Answer: D

7. Which search algorithm requires the data to be in sorted order?

A) Binary Search
B) Linear Search
C) Depth-First Search
D) Breadth-First Search

Answer: A

8. Which of the following is not a stable sorting algorithm?

A) Merge Sort
B) Bubble Sort
C) Quick Sort
D) Insertion Sort

Answer: C

9. What is the time complexity to find the minimum element in a min-heap?

A) O(log n)
B) O(n)
C) O(1)
D) O(n log n)

Answer: C

10. Which data structure is typically used for implementing LIFO behavior?

A) Queue
B) Stack
C) Heap
D) Tree

Answer: B

11. Which of the following traversals is used to get an ascending order in a sorted array?

A) Inorder
B) Preorder
C) Postorder
D) Level order

Answer: A

12. Which sorting algorithm makes use of the divide and conquer strategy?

A) Bubble Sort
B) Insertion Sort
C) Quick Sort
D) Selection Sort

Answer: C

13. Which data structure is best suited for searching for a value in a sorted list of items?

A) Array
B) Stack
C) Queue
D) Binary Search Tree

Answer: D

14. What is the worst-case time complexity of the insertion operation in a hash table?

A) O(1)
B) O(log n)
C) O(n)
D) O(n log n)

Answer: A

15. Which of the following is not a type of tree traversal?

A) Spanning Tree
B) Depth-First Search
C) Breadth-First Search
D) Inorder Traversal

Answer: A

16. Which of the following data structures can be used to efficiently implement recursion?

A) Array
B) Linked List
C) Stack
D) Queue

Answer: C

17. What is the worst-case time complexity of quicksort algorithm?

A) O(n)
B) O(n log n)
C) O(n^2)
D) O(log n)

Answer: C

18. Which data structure is suitable for applications that require the access of elements in a LIFO (Last-In-First-Out) order?

A) Queue
B) Tree
C) Stack
D) Linked List

Answer: C

19. Which sorting algorithm is known for its “divide and conquer” approach?

A) Bubble Sort
B) Insertion Sort
C) Quick Sort
D) Selection Sort

Answer: C

20. What is the average time complexity of a binary search algorithm to find an element in a sorted array of size n?

A) O(1)
B) O(log n)
C) O(n)
D) O(n log n)

Answer: B

21. Which of the following data structures can be used to efficiently implement a priority queue?

A) Stack
B) Linked List
C) Heap
D) Tree

Answer: C

22. Which data structure is most suitable for implementing a recursive algorithm?

A) Array
B) Stack
C) Queue
D) Heap

Answer: B

23. Which of the following is not a stable sorting algorithm?

A) Merge Sort
B) Bubble Sort
C) Quick Sort
D) Selection Sort

Answer: C

24. What is the worst-case time complexity of the heapify operation in a max-heap of size n?

A) O(log n)
B) O(n)
C) O(n log n)
D) O(1)

Answer: A

25. Which sorting algorithm has the best average-case time complexity?

A) Bubble Sort
B) Merge Sort
C) Insertion Sort
D) Selection Sort

Answer: B

26. What is the time complexity of deleting an element from a binary search tree with n nodes, in the worst case?

A) O(log n)
B) O(n)
C) O(n log n)
D) O(1)

Answer: B

27. Which algorithm is used to find the strongly connected components in a graph?

A) Dijkstra’s Algorithm
B) Bellman-Ford Algorithm
C) Prim’s Algorithm
D) Kosaraju’s Algorithm

Answer: D

28. Which data structure allows access to elements in FIFO (First-In-First-Out) order?

A) Stack
B) Queue
C) Heap
D) Tree

Answer: B

29. What is the time complexity of searching for an element in a hash table, assuming a good hash function?

A) O(1)
B) O(log n)
C) O(n)
D) O(n log n)

Answer: A

30. Which of the following sorting algorithms is not an in-place sorting algorithm?

A) Quick Sort
B) Merge Sort
C) Bubble Sort
D) Insertion Sort

Answer: B

31. Which data structure is typically used for implementing priority queues?

A) Stack
B) Queue
C) Heap
D) Linked List

Answer: C

32. What is the time complexity of the best-case scenario for bubble sort?

A) O(n)
B) O(n log n)
C) O(n^2)
D) O(log n)

Answer: A

33. Which of the following data structures can be traversed in both depth and breadth order?

A) Queue
B) Stack
C) Tree
D) Heap

Answer: C

34. Which of the following sorting algorithms has the best space complexity?

A) Bubble Sort
B) Merge Sort
C) Insertion Sort
D) Quick Sort

Answer: B

35. Which algorithm can be used to find the shortest path in a weighted graph where some edges may have negative weights?

A) Dijkstra’s Algorithm
B) Prim’s Algorithm
C) Bellman-Ford Algorithm
D) Kruskal’s Algorithm

Answer: C

36. Which data structure is not suitable for implementing a hash table?

A) Array
B) Linked List
C) Binary Search Tree
D) Stack

Answer: D

37. What is the time complexity of finding the kth smallest element in an unsorted array using the quickselect algorithm?

A) O(n)
B) O(n log n)
C) O(n^2)
D) O(log n)

Answer: A

38. Which of the following is not a type of binary tree?

A) AVL Tree
B) Red-Black Tree
C) B-Tree
D) Fibonacci Tree

Answer: D

39. What is the time complexity of merging two sorted arrays of sizes m and n?

A) O(m + n)
B) O(m * n)
C) O(log(m + n))
D) O(max(m, n))

Answer: A

40. Which sorting algorithm performs best when all elements are already sorted?

A) Bubble Sort
B) Insertion Sort
C) Quick Sort
D) Merge Sort

Answer: B

41. What is the worst-case time complexity of the insertion operation in a doubly linked list?

A) O(1)
B) O(log n)
C) O(n)
D) O(n log n)

Answer: A

42. Which of the following algorithms is used to find the maximum flow in a flow network?

A) Kruskal’s Algorithm
B) Dijkstra’s Algorithm
C) Prim’s Algorithm
D) Ford-Fulkerson Algorithm

Answer: D

43. Which data structure is used for traversing a binary search tree in non-decreasing order?

A) Preorder traversal
B) Inorder traversal
C) Postorder traversal
D) Level order traversal

Answer: B

44. What is the time complexity of the best-case scenario for merge sort?

A) O(n)
B) O(n log n)
C) O(n^2)
D) O(log n)

Answer: B

45. Which of the following sorting algorithms is not a comparison-based sorting algorithm?

A) Quick Sort
B) Merge Sort
C) Radix Sort
D) Bubble Sort

Answer: C

46. What is the worst-case time complexity of deleting an element from a binary search tree?

A) O(log n)
B) O(n)
C) O(n log n)
D) O(1)

Answer: B

47. Which algorithm is used to find the shortest path in an unweighted graph?

A) Dijkstra’s Algorithm
B) Prim’s Algorithm
C) Breadth-First Search
D) Depth-First Search

Answer: C

48. What is the time complexity of finding the kth smallest element in a min-heap?

A) O(k)
B) O(log k)
C) O(n)
D) O(log n)

Answer: B

49. Which data structure is used for implementing a dynamic set?

A) Queue
B) Stack
C) Heap
D) Hash Table

Answer: D

50. What is the time complexity of the worst-case scenario for insertion sort?

A) O(n)
B) O(n log n)
C) O(n^2)
D) O(log n)

Answer: C

Data Structures and Algorithms MCQs

More MCQS on Electronics MCQs

Leave a Comment Cancel reply