Time Left - 12:00 mins

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

Attempt now to get your rank among 783 students!

Question 1

Find the complexity of the following algorithm.

Question 2

State whether the following is true of false.

f(n) = o(g(n))

iff

2^{f(n)} = o(2^{g(n)})

Enter 1 for true or 0 for false.

Question 3

Which of the following statement is true for Bellman Ford algorithm.

Question 4

The worst case time complexity required for an efficient algorithm to compute the number of inversions in any permutation of n elements, stored in an array are:

Question 5

Number of ways to parenthesis matrix multiplication of five matrix is ___

Question 6

Consider two character sequence X=abaaba and Y=babab. the value of 10x+y is ____ where x is number of distinct longest common subsequence(LCS) and y is length of LCS.

Question 7

In selection Sort, if minimum subarray of any size can be found in O(n^2) then, time Complexity of selection sort will be given by?

Question 8

Merge Function best and worst-case comparison needed if two sorted subarray of size m and n are given.

Question 9

A 6-trees forest with total 23 vertices then, what will be the total number edges:-

Question 10

Number of times hello will be printed?

- 783 attempts
- 1 upvote
- 4 comments

Tags :

GATE & PSU CSAlgorithmsFeb 19GATE & PSU CS

Posted by: