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.Worst case efficiency of binary search is
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.What algorithm technique is used in the implementation of Kruskal’ssolution for
theMST?
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.Which of the following operations combined record into different sorted files into a single sorted file?
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.Two main measures for the efficiency of an algorithm are
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.Which of the following is is also called last in first out LIFO system?
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.In the case of Fibnocci heap the running time of Prim’s algorithm is _________
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.In which of the following length records file records may contain different lengths?
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.How many edges are there in a Hamiltonian cycle if the edge cost is ‘c’ and the
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.Identify the data structure which allows deletions at both ends of the list but insertion at only one enD
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.Read the following statements carefully and pick the correct option:
I. The worst time complexity of the Floyd’s algorithm is O(n3). II.
The worst time complexity of the Warshall’s algorithm is O(n3).
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.__________ is the average number of steps that can executed for the given
parameters
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.Performance based criteria of algorithm , which has to do with its storage
requirements is _______________
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.Binpackingproblem is the application of ____________
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.Worst case efficiency of binary search is
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.In a priority queue, insertion and deletion takes place at ………………
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.Testing of a program consists of 2 phases which are ______________________
and ____________
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.What would be the cost value for any answering node of a sub tree with root ‘r’
using branch-bound algorithm?
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.A binary tree whose every node has either zero or two children is called
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.The data structure which is one ended is ………………
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.Which of the following is a set of data values and associated operations that are specified accurately, independent of any particular implementation?
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.Average case time complexity of binary search is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.What would be the cost value for any answering node of a sub tree with root ‘r’
using branch-bound algorithm?
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.In stable sorting algorithm
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.The complexity of Bubble sort algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.Which of the following is not a limitation of binary search algorithm?
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.If the graph is represented as an adjacency matrix then the time complexity
of Kruskal’s algorithm is ____________
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.which is not feasible solution in the case of job sequence problem
item : 1 2 3 4
profit : 100 10 15 27
deadline : 2 1 2 1
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.The amount of time needs to run to completion is known as____________
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.By Strassen’s equation what is wrong in the following equation
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.O(n^2) means computing time is __________________
Your Answer:Correct
Your Answer:Incorrect