BARC 2020: Algorithm Nuclear Quiz 2 (App update required to attempt this test)
Attempt now to get your rank among 945 students!
Statement 1- g(n) = O(h(n))
Statement 2- g(n) = ῼ(h(n))
After applying Huffman coding algorithm, the weighted external path length is _________.
1) Bubble sort
2) merge sort
3) Heap sort
4) insertion sort
Statement 1- Quick sort algorithm’s worst case space complexity is O(log n) where n is the number of elements to be sorted.
Statement 2- Good implementation of quick sort algorithm is faster than Heap sort.
Statement 3- Stability depends in how the pivot is handled.
Number of statements that are incorrect is
T(n) = T(n/5) + T(n/6) + T(n/8) + c
i) O(nlog53) ii) Ω(nlog53) iii) O(nlog83) iv) Ω(nlog83) v) O(nlog63)
If the time complexity is O(nalog2b), then find the value of a*2.5 + b* 3?
MA stands for matrix addition of order n.
Which of the following is not the correct Breadth first traversal of the given graph?
S = [-4, 6, -2, 3, -9, 8, -1, -7, 5]. The subsequence sum B (i, j) = . Determine the maximum of B (i. j), where 0 ≤ i < j.
- 945 attempts
- 0 upvotes
- 4 comments