Algorithms
Quiz-summary
0 of 27 questions completed
Questions:
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
Information
- You will be given 180 seconds ( 3 minutes) for every question.
- Every question may contain multiple answers.Once you click the submit button you can not change your answer. You cannot go back to the same question once you click the submit button.
- Every question carries the marks equal to its difficulty level ( from 1 to 5).
- There is a negative marking of -1 for every wrong answer.
- Once a set of questions is complete, you can wait for another set of questions or you can try some other category.
- Your total marks will be displayed after every question.
- For any doubts/comments/suggestions on the question you can go to same question in untimed section.
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading...
You must sign in or sign up to start the quiz.
You have to finish following quiz, to start this quiz:
Results
0 of 27 questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 points, (0)
Categories
- Algorithms 0%
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- Answered
- Review
-
Question 1 of 27
1. Question
5 pointsThe goodness of an algorithm is most often expressed in terms of its
Correct
Incorrect
-
Question 2 of 27
2. Question
5 pointsOnly Instructions accountable for dominant operations in your algorithm are looked up in
Correct
Incorrect
-
Question 3 of 27
3. Question
5 pointsWhat is true about posterior analysis
Correct
Incorrect
-
Question 4 of 27
4. Question
5 pointsDue to exponential growth in capacity at primary and secondary Memory level, Memory is not an issue as far as algorithm analysis is concerned.
Correct
Incorrect
-
Question 5 of 27
5. Question
5 pointsThe reasons for doing the complexity analysis of an algorithm are
Correct
Incorrect
-
Question 6 of 27
6. Question
5 pointsWhich of the following are drawbacks/Deficiencies in the Empirical study of algorithms?
Correct
Incorrect
-
Question 7 of 27
7. Question
5 pointsIn searching algorithms which of the following are the dominant operations
Correct
Incorrect
-
Question 8 of 27
8. Question
5 pointsWhich of the following are the reasons to prefer the worst case analysis of an algorithm
Correct
Incorrect
-
Question 9 of 27
9. Question
5 pointsIn case of Binary Search Algorithm if the number to be found is present at the first place then it represents
Correct
Incorrect
-
Question 10 of 27
10. Question
5 pointsComputer Scientist will be interested in asymptotic analysis of the algorithm because
Correct
Incorrect
-
Question 11 of 27
11. Question
5 pointsThe minimum time will be taken by the algorithm of complexity
Correct
Incorrect
-
Question 12 of 27
12. Question
5 pointsThe minimum time will be taken by the algorithm of complexity
Correct
Incorrect
-
Question 13 of 27
13. Question
5 pointsIf we consider the asymptotic behavior then he minimum time will be taken by the algorithm of complexity
Correct
Incorrect
-
Question 14 of 27
14. Question
5 pointsIf f(n) = Θ(g(n)) and g(n) = Θ(h(n)), then h(n) = Θ(f(n))
Correct
Incorrect
-
Question 15 of 27
15. Question
5 pointsWhich of the following is true about the complexity of n5+ 2n+8
Correct
Incorrect
-
Question 16 of 27
16. Question
5 pointsWhat can be filled in the 10n2 + 400 logn = __________ ?
Correct
Incorrect
-
Question 17 of 27
17. Question
5 pointsIf insertion sort runs in 8n2 steps and merge sort runs in 64nlgn steps, for which values of n does insertion sort becomes slower than merge sort
Correct
Incorrect
-
Question 18 of 27
18. Question
5 pointsIf Total complexity after micro analysis is 5n3 + 10n2 + 100 n +400 logn+ 10, The Big Oh complexity is
Correct
Incorrect
-
Question 19 of 27
19. Question
5 pointsComplexity Expression of a program comes as 31n+nlogn+6logn+ 5n(logn)2
The Big Oh Complexity of the algorithm isCorrect
Incorrect
-
Question 20 of 27
20. Question
5 pointsFor recurrence T(n) = T(n-1) + n what will be the big oh complexity.
Correct
Incorrect
-
Question 21 of 27
21. Question
5 pointsHow many time we should half the number n to reach 1.
Correct
Incorrect
-
Question 22 of 27
22. Question
5 pointsExpression 2n+1 = O(2n) and 22n = O(2n) are
Correct
Incorrect
-
Question 23 of 27
23. Question
5 pointsTime complexity of Euclid Algorithm to find greatest common divisor is
Correct
Incorrect
-
Question 24 of 27
24. Question
5 pointsFind the complexity of the following code
for (i=0; i<n;i++)
{
for (j=0; i<n;j++)
{
for (k=0; i<n;k++)
{
i=j;
}
}
}Correct
Incorrect
-
Question 25 of 27
25. Question
5 pointsT(n) = O(f(n)) if there are positive constants c and n0 such that _________for all n ≥ n0 This notation is known as Big-Oh notation
Correct
Incorrect
-
Question 26 of 27
26. Question
5 pointsFind out the false statement in context of code tuning techniques
Correct
Incorrect
-
Question 27 of 27
27. Question
5 pointsWhich of the following uses Divide and Conquer Approach
Correct
Incorrect