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 29 Time Limit 20 Minutes Points 1 Point for each Question
Remaining Time: 0 MINUTES
0 of 29 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
Information
You have already completed the test before. Hence you can not start it again.
0 of 29 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
Question 1 of 29
Q-1.Which of the following versions of merge sort algorithm does uses space efficiently?
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 29
Q-2.The complexity of linear search algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 29
Q-3.The general criteria of algorithm; Each instruction is clear and unambiguous ______
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 29
Q-4.A binary tree can easily be converted into q 2-tree
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 29
Q-5.The general criteria of algorithm; at least one quantity is produced ______
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 29
Q-6.Express the formula (n – 2)*(n – 4) using θ notation:
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 29
Q-7.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 8 of 29
Q-8.Which of the following formulas in Omega notation best represent the expression
n²+35n+6?
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 29
Q-9.When converting binary tree into extended binary tree, all the original nodes in binary tree are
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 29
Q-10.The following are the statements regarding the NP problems. Chose the right option
from the following options: I. All NP-complete problems are not NP-hard.
II. SomeNP-hard problems are not known to be NP-complete.
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 29
Q-11.The time complexity of the shortest path algorithm can be bounded by
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 29
Q-12.The complexity of merge sort algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 29
Q-13.In the case ofsub problems share sub problems ,which method is suitable
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 29
Q-14.Breadth first search
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 29
Q-15.Choose the correct answer for the following statements: I. The theory of NP–completeness provides a method of obtaining a
polynomial time for NPalgorithms.
II. All NP-complete problem are NP-Hard.
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 29
Q-16.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 17 of 29
Q-17.The optimal solution to a problem is a combination of optimal solutions to its subproblems. This is known as
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 29
Q-18.An algorithm that calls itself directly or indirectly is known as
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 29
Q-19.Which of the following refers to a single unit of values?
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 29
Q-20.In the case of Fibnocci heap the running time of Prim’s algorithm is _________
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 29
Q-21.The in order traversal of tree will yield a sorted listing of elements of tree in
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 29
Q-22.The disadvantage in using a circular linked list is …………………….
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 29
Q-23.The Worst case occur in linear search algorithm when
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 29
Q-24.The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 29
Q-25.Identify the correct problem for multistage graph from the list given below.
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 29
Q-26.BFS is best compared to DFS in the case of ________________
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 29
Q-27.Two main measures for the efficiency of an algorithm are
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 29
Q-28.How many nodes are there in a full state space tree with n = 6?
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 29
Q-29.When we say an algorithm has a time complexity of O (n), what does it mean?
Your Answer:Correct
Your Answer:Incorrect