HAPPY DSA

Which of the following data structures is used in the implementation of a recursive function?

• A) Queue
  
  
  

• B) Stack

• C) Linked List

• D) Tree

Which of the following is the time complexity of accessing an element in an array of size n?

• A) O(1)

• B) O(n)

• C) O(log⁡n)

• D) O(n^2)

Which of the following algorithms is used for sorting an array in place?

• D) Heap Sort

• C) Bubble Sort

• B) Quick Sort

• A) Merge Sort

What is the space complexity of a recursive function that uses a stack for its execution?

• B) O(n)

• A) O(1)

• D) O(n^2)

• C) O(log⁡n)

Which of the following data structures allows for the implementation of a LIFO (Last In First Out) principle?

• B) Stack

• D) Linked List

• A) Queue

• C) Array

What is the average time complexity of a binary search algorithm on a sorted array?

• A) O(n)

• D) O(1)

• C) O(n log⁡n)

• B) O(log⁡n)

Which of the following data structures is best suited for implementing a priority queue?

• B) Stack

• A) Array

• D) Linked List

• C) Heap

What is the worst-case time complexity of the insertion operation in a balanced binary search tree?

• C) O(n log⁡n)

• B) O(log⁡n)

• D) O(1)

• A) O(n)

Which of the following data structures is most efficient for implementing a hash table?

• D) Tree

• A) Array

• B) Linked List

• C) Hash Map

What is the average time complexity for searching an element in a balanced binary search tree?

• B) O(log⁡n)

• C) O(n log⁡n)

• D) O(1)

• A) O(n)