Time Left - 10:00 mins

IIIT Hyderabad Practice Quiz : Algorithms-4

Attempt now to get your rank among 365 students!

Question 1

Match the List-I with List-II and select the correct answer:

List-I

P. T(n) = T(n – 1) + n

Q. T(n) = T logn

R. T(n) = T(n – 1) + 1

S. T(n) = T + 1

List-II

1) O(n)

2) O(n2)

3) O(n2 logn)

4) O(logn)

Question 2

What is the time complexity of following recurrence relation?

T(1) = 0

Question 3

What will be the status of the input 14, 12, 90, 34, 23, 67, 35, 337, 87, 156, 389, 278, 92 after 3rd pass on applying  Straight two way Merge Sort.

Question 4

The sorting algorithm which requires least number of swaps in the worst case is

Question 5

Which of the following is valid BFS of the above graph?

I. ABDCFE

II. ADBCFE

III. ABCFED

  • 365 attempts
  • 3 upvotes
  • 6 comments
Feb 27GATE & PSU CS

Posted by:

Harshita AgarwalHarshita AgarwalMember since Jul 2020
Share this quiz   |