With each visit of this Data Structure and Algorithms online Quiz / Practice Test, the list of MCQs / Objective Questions presented will be different, offering you a diverse set of practice opportunities. This variability encourages you to practice extensively, refining the accuracy of your answers and your overall grasp of the content. By utilizing this resource, you can hone your skills and become more adept at managing time constraints during actual exams.
Test Instructions Question type Randomized MCQs.Changes every time you visit the test Total Number of Questions 30 Time Limit 20 Minutes Points 1 Point for each Question
Remaining Time: 0 MINUTES
0 of 30 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 28 29 30
Information
You have already completed the test before. Hence you can not start it again.
0 of 30 questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 points, (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 28 29 30
Question 1 of 30
Q-1.BFS is best compared to DFS in the case of ________________
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.____________ is an algorithm design method that can be used when the solution
to a problem can be viewed as the result of a sequence of decisions
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.The Sorting methodwhich is used for external sort is
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.Advantage of finding maximum and minimum using divide and conquer method
instead of using conditional operators is __________________
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.Which of the following belongs to the algorithm paradigm?
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.The files x1,x2,x3 are 3 files of length 30,20,10 records each. What is the optimal
merge pattern value?
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.For defining the best time complexity, let f (n) = log n and g (n) = √n, _________
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.The time complexity of binary search in best, worst cases for an array of size N is
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.A binary tree whose every node has either zero or two children is called
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.How many nodes are there in a full state space tree with n = 6?
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.Worst case time complexity of binary search is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.Performance based criteria of algorithm , which has to do with its computing time is
_______________
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.In pseudo-code conventions output express as __________
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.Quick sort invented by _____________
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.In the case ofsub problems share sub problems ,which method is suitable
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.In pseudo-code conventions input express as __________
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.Which method of traversal does not use stack to hold nodes that are waiting to be
processed?
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.__________ is the maximum number of steps that can executed for the given
parameters
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.which is optimal value in the case of fractional knapsack problem, capacity of
knapsack is 20
item : 1 2 3
profit : 25 24 15
weight : 18 15 10
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.Performance based criteria of algorithm , which has to do with its storage
requirements is _______________
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.A connected graph T without any cycles is called
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.Which of the following refers to a single unit of values?
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.Express the formula (n – 2)*(n – 4) using θ notation:
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.The depth of a complete binary tree is given by
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.A binary tree can easily be converted into q 2-tree
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.Which of the following case does not exist in complexity theory
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.The result of evaluating prefix expression */b+-dacd, where a = 3, b = 6, c = 1, d = 5 is
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.The functions f &g are non-negative functions. The function f(n)=O(g(n)) if and only
if there exist positive constants c& n0 such that __________ for all n, n≥ n0
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.Average case time complexity of Quick sort is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.In stable sorting algorithm
Your Answer:Correct
Your Answer:Incorrect