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 application of heap tree is
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.Let G be a graph with ‘n’ nodes and let ‘m’ be the chromatic number of the graph.
Then the time taken by the backtracking algorithm to color it is
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.__________ is the maximum number of steps that can executed for the given
parameters
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.What is the type of the algorithm used in solving the 8 Queens problem?
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.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 6 of 30
Q-6.Which of the following data structure is not linear data structure?
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.Application of mergesort _________
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.fractional knapsack is based on ____________method
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.Recursive algorithms are based on
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.From the following choose the one which belongs to the algorithm paradigm other than
. to which others from the following belongs to.
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.In a graph if e=(u, v) means
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13. 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 14 of 30
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.Which of the following operations combined record into different sorted files into a single sorted file?
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.In the case ofsub problems share sub problems ,which method is suitable
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.which is optimal value in the case of fractional knapsack problem, capacity of
knapsack is 20
item : 1 2 3
profit : 25 24 15
weight : 18 15 10
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.For the bubble sort algorithm, what is the time complexity of the best/worst case?
(assume that the computation stops as soon as no more swaps in one pass)
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.The worst case time complexity of the nondeterministic dynamic knapsack
algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.The sorting , which works very well for small file is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.Which of the following is an application of stack?
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.Which of the following is not a limitation of binary search algorithm?
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.If f,t: N→ R+, then t (n) Ω (f (n)), iff f(n) O (t (n)) is known as
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.By Strassen’s equation what is wrong in the following equation
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.In an array representation of binary tree the right child of root will be at location of
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.When representing any algebraic expression E which uses only binary operations in a 2-tree
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.Time complexity of given algorithm
Algorithm Display(A)
{
S:=0.0;
For i:=0 to n-1
{
S:=S+A[i];
Return S;
}
}
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.In analysis of algorithm, approximate relationship between the size of the job and
the amount of work required to do is expressed by using _________
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.In analysis of algorithm, approximate relationship between the size of the job and
the amount of work required to do it is expressed by using
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.Identify the name of the sorting in which time is not proportional to n2.
Your Answer:Correct
Your Answer:Incorrect