Question 1

What is the time complexity of the selection sort algorithm?

A. O(N) B. O(log N) C. O(N^2) D. O(N log N)

Question 2

How is the time complexity of the binary heap construction expressed?

A. O(1) B. O(log N) C. O(N) D. O(N log N)

Question 3

What is the time complexity of the delete operation in a binary search tree (BST)?

A. O(1) B. O(log N) C. O(N) D. O(N log N)

Question 4

How is the time complexity of the breadth-first search (BFS) algorithm in a graph characterized?

A. O(N) B. O(log N) C. O(N^2) D. O(V + E), where V is the number of vertices and E is the number of edges.

Question 5

True or False: A map/dictionary stores values in a specific order

A. FALSE B. TRUE

Question 6

How is the time complexity of the radix sort algorithm characterized?

A. O(N) B. O(log N) C. O(N^2) D. O(Nk), where k is the number of digits in the maximum number.

Question 7

How is the time complexity of bubble sort characterized?

A. O(N) B. O(N log N) C. O(N^2) D. O(1)

Question 8

What is the time complexity of the insertion operation in a binary search tree (BST)?

A. O(1) B. O(log N) C. O(N) D. O(N log N)

Question 9

How is the time complexity of the bubble sort algorithm in the best-case scenario characterized?

A. O(N) B. O(log N) C. O(N^2) D. O(1)

Question 10

How is the time complexity of the merge sort algorithm characterized?

A. O(N) B. O(log N) C. O(N^2) D. O(N log N)

Data Structure