This Data Structure – Design And Analysis of Algorithms Multiple choice Question and Answers (MCQ) Based Online Tests Created specifically for the purpose of Testing and Improving knowledge about the Data Structure and Algorithm’s.
Quizsummary
0 of 20 questions completed
Questions:
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
Information
Data Structure – Algorithms MCQ Based Online Tests 1
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 20 questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 points, (0)
Categories
 Not categorized 0%
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 Answered
 Review

Question 1 of 20
1. Question
_____ is a stepbystep recipe for solving an instance of problem
Correct
Incorrect

Question 2 of 20
2. Question
______ is used to describe the algorithm, in less formal language
Correct
Incorrect

Question 3 of 20
3. Question
______ of an algorithm is the amount of time (or the number of steps) needed by a program to complete its task.
Correct
Incorrect

Question 4 of 20
4. Question
______ of a program is the amount of memory used at once by the algorithm until it completes its execution.
Correct
Incorrect

Question 5 of 20
5. Question
______ is used to define the worstcase running time of an algorithm.
Correct
Incorrect

Question 6 of 20
6. Question
A problem L is NPComplete if and only if
Correct
Incorrect

Question 7 of 20
7. Question
Dijkstra algorithm is for finding
Correct
Incorrect

Question 8 of 20
8. Question
Find the solution for the following recurrence relation an = 5n2an–1 with a0 = 5
Correct
Incorrect

Question 9 of 20
9. Question
Match the following pairs:
Correct
Incorrect

Question 10 of 20
10. Question
Match the pairs:
Correct
Incorrect

Question 11 of 20
11. Question
What shall be value of x in the following pseudocode?
x = 0;
For (t = 1; t < N; t++) For( p = 1; p < = t; p++) x = x+1; Endfor EndforCorrect
Incorrect

Question 12 of 20
12. Question
Time complexity of merging three sorted lists of sizes m, n and p is
Correct
Incorrect

Question 13 of 20
13. Question
Which of the following algorithm employs dynamic programming
approach?Correct
Incorrect

Question 14 of 20
14. Question
f (n) = O(g(n)) if and only if
Correct
Incorrect

Question 15 of 20
15. Question
(i) f (n) = Ω(n^2 log2 n)
(ii) f (n) = Ω(n^2)
(iii) f (n) = Ω(n^3)
(iv) f (n) = Ω(log2 n)
Given f (n) = Ω(n^2), which of the above shall hold good?Correct
Incorrect

Question 16 of 20
16. Question
Which of the following is correct?
Correct
Incorrect

Question 17 of 20
17. Question
Which one of the following is analogous to f (n) = o(g(n))?
Correct
Incorrect

Question 18 of 20
18. Question
For f (n) = 5n^2 + 3n + 2,
Correct
Incorrect

Question 19 of 20
19. Question
Which of the algorithm design approach is used by Mergesort
Correct
Incorrect

Question 20 of 20
20. Question
Which of the following shortest path algorithm cannot detect presence
of negative weight cycle graph?Correct
Incorrect