General DSA Quiz

What is the time complexity of recursive_function?

• O(n)

• O(n^2)

• O(2^n)

• O(log n)

Which of the following data structures provides O(1) average-time complexity for search operations?

• Array

• Linked List

• Hash Table

• Binary Search Tree

What is the time complexity of inserting an element into a max heap of size n?

• O(1)

• O(log n)

• O(n)

• O(n log n)

What is the time complexity of the Depth-First Search (DFS) algorithm in a graph with n vertices and m edges?

• O(n)

• O(m)

• O(n + m)

• O(n * m)

If an algorithm has a time complexity of O(n^2), which of the following is also true?

• The algorithm has a time complexity of O(n^3)

• The algorithm has a time complexity of Θ(n^2)

• The algorithm has a time complexity of Ω(n)

• All of the above

In an array of size n, what is the time complexity of inserting an element at the beginning?

• O(1)

• O(n)

• O(log n)

• O(n log n)

What is the worst case time complexity to find an element that is not the largest in an unsorted array?

• O(1)

• O(n)

• O(logn)

• O(nlogn)

Which of the following is the result of 9 << 2?

• 36

• 18

• 27

• 72

What is the result of 15 ^ 15?

• 0

• 15

• -1

• 1

How many elements can a 3D array int arr[4][5][6] hold?

• 15

• 75

• 100

• 120