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.Sorting is not possible by using which of the following methods?
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.Application of quicksort _________
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.When converting binary tree into extended binary tree, all the original nodes in binary tree are
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.For the quick sort algorithm, what is the time complexity of the best/worst case?
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.The time complexity of the shortest path algorithm can be bounded by
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.When we say an algorithm has a time complexity of O (n), what does it mean?
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.The graph colouringalgorithm’s time can be bounded by _________
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.O(n) means computing time is __________________
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.To calculatec(i, j )’s, w( i, j)’s and r(i, j)’s; the OBST algorithm in worst case takes
the following time.
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.In the case of Fibnocci heap the running time of Prim’s algorithm is _________
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11. Primsalgorithm is based on _____________ method
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.Which of the following is the collection of records of the entities in a given entity set?
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.Time complexity of given algorithm
Algorithm Display (A)
{
For I:=0 to n-1
{
For J:=0 to n-1
{
Write A;
}
}
}
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.Worst case efficiency of which search is O(n)?
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.O(n^2) means computing time is __________________
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.Which of the following data structure is not linear data structure?
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.The Average case occur in linear search algorithm
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.In a priority queue, insertion and deletion takes place at ………………
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.The method which stops the execution ,if it find the solution. Otherwise it start from
the top
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.A __________ is a round trip path along n edges of G that visits every vertex once
and returns to its starting position.
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.Which is the logical or mathematical model of a particular organization of a data?
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.Graph Coloring is which type of algorithm design strategy
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.The functions f & g are non-negative functions. The function f(n)=θ(g(n)) if and only
if there exist positive constants c1,c2 & n0 such that ________for all n, n≥ n0
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.The Hamiltonian cycles problem uses the following line of code to generate a
next vertex, provided x[ ] is a global array and kth vertex is under consideration:
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.The time factor when determining the efficiency of algorithm is measured by
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.Merge sort invented by _____________
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.Which of the following versions of merge sort algorithm does uses space efficiently?
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.___________ 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 30 of 30
Q-30.The functions f & g are non-negative functions. The function f(n)=Ω(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