# BARC 2020: Algorithm Nuclear Quiz 2 (App update required to attempt this test)

Attempt now to get your rank among 927 students!

Question 1

Question 2

^{sin n}, where n is a positive integer which of the following statement is correct

Statement 1- g(n) = O(h(n))

Statement 2- g(n) = ῼ(h(n))

Question 3

After applying Huffman coding algorithm, the weighted external path length is _________.

Question 4

1) Bubble sort

2) merge sort

3) Heap sort

4) insertion sort

Question 5

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

Question 6

Question 7

T(n) = T(n/5) + T(n/6) + T(n/8) + c

i) O(n^{log}_{5}^{3}) ii) Ω(n^{log}_{5}^{3}) iii) O(n^{log}_{8}^{3}) iv) Ω(n^{log}_{8}^{3}) v) O(n^{log}_{6}^{3})

Question 8

If the time complexity is O(n^{a}log_{2}b), then find the value of a*2.5 + b* 3?

MA stands for matrix addition of order n.

Question 9

Which of the following is not the correct Breadth first traversal of the given graph?

Question 10

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.

- 927 attempts
- 0 upvotes
- 4 comments

Tags :

GATE & PSU CSAlgorithmsPosted by: