Big-o Multiple Choice
22 Questions
| Total Attempts: 2802
Settings
.
Questions and Answers
- 1.30. What is the time complexity of insert(index) method in ArrayList
- A.
O(n)
- B.
O(n^2)
- C.
O(nlogn)
- D.
O(logn)
- 2.33. Indicate constant time complexity in terms of Big-O notation
- A.
O(n)
- B.
O(1)
- C.
O(logn)
- D.
O(n^2)
- 3.37. Indicate exponential time complexity in terms of big-O notation?
- A.
O(n)
- B.
O(n^2)
- C.
O(2^n)
- D.
O(logn)
- 4.38. Find the slowest time
- A.
O(n)
- B.
O(n^2)
- C.
O(n!)
- D.
O(2^n)
- 5.39. What is the time complexity of ArrayList remove(index) method
- A.
O(n)
- B.
O(2n)
- C.
O(logn)
- D.
O(n^2)
- 6.40. What is the time complexity of adding an item in front of a LinkedList
- A.
O(logn)
- B.
O(1)
- C.
O(n^2)
- D.
O(2^n)
- 7.41. What is the time complexity of adding element in the beginning of ArrayList
- A.
O(n)
- B.
O(n^2)
- C.
O(2n)
- D.
O(nlogn)
- 8.71. Indicate logarithm polynomial time complexity
- A.
O(n^const(const=2,3…) )
- B.
O(n^2)
- C.
O(2n)
- D.
O(2^n)
- 9.76. What is the time complexity of insert(index) method in ArrayList?
- A.
O(n)
- B.
O(2n)
- C.
O(logn)
- D.
O(nlogn)
- 10.116.What is the time complexity of recursive Binary Search algorithm?
- A.
O(n)
- B.
O(2^n)
- C.
O(logn)
- D.
O(nlogn)
- 11.121.What the time complexity of LinearSearch algorithm?
- A.
O(n)
- B.
O(n^2)
- C.
O(2^n)
- D.
O(1)
- 12.131.Search a binary search tree costs?
- A.
O(n)
- B.
O(n^2)
- C.
O(logn)
- D.
O(nlogn)
- 13.137.Element insertion to a Binary Search tree costs?
- A.
O(n)
- B.
O(n^2)
- C.
O(logn)
- D.
O(2^n)
- 14.141.Insert and remove items from a heap costs?
- A.
O(n)
- B.
O(n^2)
- C.
O(logn)
- D.
O(1)
- 15.148.Average time complexity of Selection sort is?
- A.
O(n)
- B.
O(2^n)
- C.
O(logn)
- D.
O(nlogn)
- 16.149.Average time complexity of Heap sort is?
- A.
O(n)
- B.
O(2^n)
- C.
O(logn)
- D.
O(nlogn)
- 17.150.Average time complexity of Quick sort is?
- A.
O(n)
- B.
O(n^2)
- C.
O(2+nlogn)
- D.
O(nlogn)
- 18.160.Average time complexity of Insertion sort is?
- A.
O(n)
- B.
O(n^2)
- C.
O(2^n)
- D.
O(logn)
- 19.1.A hash table uses hashing to transform an items key into a table index so that iterations, retrievals and deletions can be performed in expected ___________ time.
- A.
O(n)
- B.
O(logn)
- C.
O(1)
- D.
O(false)
- 20.163.Average time complexity of Merge sort is?
- A.
O(n)
- B.
O(2^n)
- C.
O(logn)
- D.
O(nlogn)
- 21.167.Average time complexity of Shell sort is?
- A.
O(n)
- B.
O(n^2)
- C.
O(n^1.25)
- D.
O(n^2.25)
- 22.170.Average time complexity of Bubble sort is?
- A.
O(n^2)
- B.
O(n)
- C.
O(logn)
- D.
O(nlogn)
Back to top