Big O Notation Quiz
Do you know anything about the Big O Notation Algorithm? Test your knowledge with this quiz. In computer science, the Big O Notation is utilized to group algorithms according to how their run time or space conditions change as the input size grows. In analytic number theory, the Big O Notation is often used to convey the arithmetical function. This Big O Notation quiz can be a valuable tool for practicing for an exam.
- 1.What is the time complexity of the insert(index) method in ArrayList?
- A.
O(n)
- B.
O(n^2)
- C.
O(nlogn)
- D.
O(logn)
- 2.Indicate constant time complexity in terms of Big-O notation.
- A.
O(n)
- B.
O(1)
- C.
O(logn)
- D.
O(n^2)
- 3.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.Find the slowest time.
- A.
O(n)
- B.
O(n^2)
- C.
O(n!)
- D.
O(2^n)
- 5.What is the time complexity of the ArrayList remove(index) method?
- A.
O(n)
- B.
O(2n)
- C.
O(logn)
- D.
O(n^2)
- 6.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.What is the time complexity of adding elements at the beginning of ArrayList?
- A.
O(n)
- B.
O(n^2)
- C.
O(2n)
- D.
O(nlogn)
- 8.Indicate logarithm polynomial time complexity.
- A.
O(n^const(const=2,3…) )
- B.
O(n^2)
- C.
O(2n)
- D.
O(2^n)
- 9.What is the time complexity of the insert(index) method in ArrayList?
- A.
O(n)
- B.
O(2n)
- C.
O(logn)
- D.
O(nlogn)
- 10.What is the time complexity of the recursive Binary Search algorithm?
- A.
O(n)
- B.
O(2^n)
- C.
O(logn)
- D.
O(nlogn)
- 11.What the time complexity of the linear search algorithm?
- A.
O(n)
- B.
O(n^2)
- C.
O(2^n)
- D.
O(1)
- 12.Search a binary search tree costs?
- A.
O(n)
- B.
O(n^2)
- C.
O(logn)
- D.
O(nlogn)
- 13.Element insertion to a Binary Search tree costs?
- A.
O(n)
- B.
O(n^2)
- C.
O(logn)
- D.
O(2^n)
- 14.Insert and remove items from a heap costs?
- A.
O(n)
- B.
O(n^2)
- C.
O(logn)
- D.
O(1)
- 15.The average time complexity of the Selection sort is?
- A.
O(n)
- B.
O(2^n)
- C.
O(logn)
- D.
O(nlogn)
- 16.The average time complexity of the Heap sort is?
- A.
O(n)
- B.
O(2^n)
- C.
O(logn)
- D.
O(nlogn)
- 17.The average time complexity of Quicksort is?
- A.
O(n)
- B.
O(n^2)
- C.
O(2+nlogn)
- D.
O(nlogn)
- 18.The average time complexity of Insertion sort is?
- A.
O(n)
- B.
O(n^2)
- C.
O(2^n)
- D.
O(logn)
- 19.A hash table uses hashing to transform an item's 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.Average time complexity of Merge sort is?
- A.
O(n)
- B.
O(2^n)
- C.
O(logn)
- D.
O(nlogn)
- 21.The 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.The average time complexity of Bubble sort is?
- A.
O(n^2)
- B.
O(n)
- C.
O(logn)
- D.
O(nlogn)
Back to top