Time Left - 05:00 mins
ISRO Exam CS 2017 Daily Quiz -3 (Algorithms)
Attempt now to get your rank among 816 students!
Question 1
An unordered list contains n distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is
Question 2
Let f(n) = n and g(n) = n(1+sin n), where n is a positive integer. Which of the following statements is / are correct?
I. f(n)= 0(g(n))
II. f(n)=Ω(g(n))
I. f(n)= 0(g(n))
II. f(n)=Ω(g(n))
Question 3
The complexity of the snippet
For(i=1;i<(1<<n);i++)
{
Do something
}
For(i=1;i<(1<<n);i++)
{
Do something
}
Question 4
Solve T(n)=T(n-1)+logn
Question 5
The running time of an efficient algorithm to find an Euler tour in a graph if one exists
- 816 attempts
- 6 upvotes
- 15 comments
Tags :
GATE & PSU CSAlgorithmsApr 6GATE & PSU CS
