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.The sorting , which works very well for small file is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.The Sorting methodwhich is used for external sort is
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.In Algorithm Specification the blockes are indicated with matching _______
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.0/1 knapsack is based on ____________method
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.In a graph if e=(u, v) means
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.Best case time complexity of binary search is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.Which of the following is not a limitation of binary search algorithm?
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.Which design strategy stops theexecution when it find the solution otherwise starts
the problem from top
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.The data structure which is one ended is ………………
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.Which is not in general criteria of algorithm
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.The mathematical definition for Omega can be defined as, provided f,g:NR+ and c is
a positive constant and n > n0,
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.The graph colouringalgorithm’s time can be bounded by _________
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.Which is true statement in the following?
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.___________ is the process of executing a correct program on data sets and
measuring the time and space it takes tocompute the results.
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.Which of the following formulas in Omega notation best represent the expression
n²+35n+6?
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.__________ is the maximum number of steps that can executed for the given
parameters
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.Application of mergesort _________
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.In which of the following length records file records may contain different lengths?
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.Which of the following involves arranging the records in a logical order?
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.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
(1,5,6,4)
(7,6,4,3)
(2,3,1,7)
(1,2,3,4)
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.Which of the following searching methods requires that all keys must reside
in internal memory?
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.How do you determine the cost of a spanning tree?
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.What do you call the selected keys in the quick sort method?
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.The Worst case occur in linear search algorithm when
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.4 -Queen problem what is the space complexity
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.The depth of a complete binary tree is given by
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.Dijkstra’s algorithm :
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.In a priority queue, insertion and deletion takes place at ………………
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.Write the out put of the following program: int a[] = {1,2,3}*P;
Your Answer:Correct
Your Answer:Incorrect