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.lower bound is denoted as _______
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.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 3 of 30
Q-3.An algorithm that calls itself directly or indirectly is known as
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.Theasymptotic notation for defining the average time complexity is
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.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 6 of 30
Q-6.Name the node which has been generated but none of its children nodes have
been generated in state space tree of backtracking method.
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.Let f, t: N→R 0, and t (n) O (f (n)) iff t(n)≤ c.f (n) where cis positive real
constant andn≥ no, then no is ___________
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.The complexity of the average case of an algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.____________ is an algorithm design method that can be used when the solution
to a problem can be viewed as the result of a sequence of decisions
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.Two main measures for the efficiency of an algorithm are
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
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.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 14 of 30
Q-14.The space factor when determining the efficiency of algorithm is measured by
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.The number of comparisons of elements for average case is ____________ in the
case of maxmin algorithm based on divide and conquer method
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.kruskal algorithm is based on ___________method
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.Which of the following is not a limitation of binary search algorithm?
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.Readthe following statements carefully, and choose the correct answer. I. The Ω notation is Anti Symmetric.
II. The big Oh notation is Semi Equivalence.
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.From the following which is not return optimal solution
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.The deletion mechanism in the stack is called as
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.Which of the following is a non linear data structure?
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.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 23 of 30
Q-23.A binary tree can easily be converted into q 2-tree
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.The disadvantage in using a circular linked list is …………………….
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.Which of the following data structure is linear type?
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.__________ is the minimum number of steps that can executed for the given
parameters
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.Huffmancodes are the applications of _________ with minimal weighted external
path length obtained by an optimal set.
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.If every node u in G is adjacent to every other node v in G, A graph is said to be
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.How do you determine the cost of a spanning tree?
Your Answer:Correct
Your Answer:Incorrect