Time Left - 10:00 mins

# IIIT Hyderabad Practice Quiz : Algorithms-1

Attempt now to get your rank among 482 students!

Question 1

Suppose f(n) = O(n

^{2}),g(n) = Ω(n^{2}) and h(n) = Ω(n) then [f(n) +(g(n) . h(n))]will beQuestion 2

Consider the following statement:

S_{1} : f(n) = O(f(n)^{2})

S_{2} : If f(n) = Ω(g(n)) then f(n)=O(g(n))

S_{3} : If f(n) O(g(n)) then g(n) O(f(n))

Which of the following statements are always **true**?

Question 3

Which of the following algorithm has minimum number of swap in worst case?

Question 4

If the array elements are already in the increasing order, then which of the following sorting algorithms takes worst case Time Complexity.

I. Insertion sort

II. Quick sort

III. Heap sort

Question 5

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

I. ABDCFE

II. ADBCFE

III. ABCFED

- 482 attempts
- 3 upvotes
- 7 comments

Tags :

GATE & PSU CSAlgorithmsFeb 24GATE & PSU CS

Posted by: