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

Consider the hashing table with ‘m’ slots and ‘n’ keys. If the expected number of probes in unsuccessful search is 3 then value of load factor is ____.(upto 3 decimal places)

Consider two function g(n) and h(n) which is given as g(n) = n and h(n) = n^{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))

Consider the following symbols and their frequency in a specific document

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

Which of the following is/are stable algorithms?

1) Bubble sort

2) merge sort

3) Heap sort

4) insertion sort

Consider the following statements with respect to Quick sort algorithm

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

Find the complexity T(n) for the following recurrence relation.

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

i) O(n^log₅³) ii) Ω(n^log₅³) iii) O(n^log₈³) iv) Ω(n^log₈³) v) O(n^log₆³)

Consider the following C program:

If the time complexity is O(n^alog₂b), then find the value of a*2.5 + b* 3?

MA stands for matrix addition of order n.

Consider the following Graph :

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

Consider a sequence of 10 elements:

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.