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.When converting binary tree into extended binary tree, all the original nodes in binary tree are
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.Average case time complexity of binary search is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.The time complexity of the shortest path algorithm can be bounded by
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.The worst case time complexity of the nondeterministic dynamic knapsack
algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.Worst case time complexity of Quick sort is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.The Sorting methodwhich is used for external sort is
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.Sequential search has a time complexity of O(n), and binary search has a time
complexity of O(log(n)). What difference will it make when the size n is 1000?
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.Worst case efficiency of which search is O(n)?
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.Binary Search Algorithm cannot be applied to
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.Let f, t: N→R 0, and t (n) O (f (n)) iff t(n)≤ c.f (n) where cis positive real
constant andn≥ no, then no is ___________
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.The complexity of Bubble sort algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.In pseudo-code conventions input express as __________
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.What is the type of the algorithm used in solving the 4 Queens problem?
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.Find the odd one out.
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.The total number of comparisons in a bubble sort is
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.The complexity of the average case of an algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.Which is not a criteria of algorithm
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.Worst case efficiency of binary search is
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.kruskal algorithm is based on ___________method
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.which is optimal value in the case of job sequence problem
item : 1 2 3 4 5 6 7
profit : 3 5 20 18 1 6 30
deadline : 1 3 4 3 2 1 2
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.How many edges are there in a Hamiltonian cycle if the edge cost is ‘c’ and the
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.For analyzing an algorithm, which is better computing time?
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23. From the following pick the one which does not belongs to the same paradigm to which
others belongs to.
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.job sequencing with deadline is based on ____________method
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.Upper bound is denoted as _______
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.The amount of time needs to run to completion is known as____________
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.Which of the following case does not exist in complexity theory
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.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 29 of 30
Q-29.The number of comparisons of elements for average case is ____________ in the
case of maxmin algorithm based on divide and conquer method
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.Identify the correct problem for multistage graph from the list given below.
Your Answer:Correct
Your Answer:Incorrect