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.What is the type of the algorithm used in solving the 4 Queens problem?
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.Tight bound is denoted as _______
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.kruskal algorithm is based on ___________method
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.Which of the following versions of merge sort algorithm does uses space efficiently?
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.Identify the name of the sorting in which time is not proportional to n2.
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.The timecomplexity of Strassen’s algorithm is ___________
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.The Knapsack problem where the objective function is to minimize the profit is
______
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.Average case time complexity of Quick sort is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.The application of heap tree is
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.How many minimum number of spanning trees, one can have from a given
connected graph with N nodes is having different weights for the edges.
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.Worst case time complexity of binary search is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.In the case of Fibnocci heap the running time of Prim’s algorithm is _________
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.A problem L is NP-complete iff L is NP-hard and
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.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 16 of 30
Q-16.A linear list in which each node has pointers to point to the predecessor and successors nodes
is called as ..
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.The method which stops the execution ,if it find the solution. Otherwise it start from
the top
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.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 19 of 30
Q-19.Write the out put of the following program: int a[] = {1,2,3}*P;
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.Recursive algorithms are based on
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.The general criteria of algorithm; Each instruction is clear and unambiguous ______
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.What do you call the selected keys in the quick sort method?
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.which is optimal value in the case of job sequence problem
item : 1 2 3 4 5 6 7
profit : 3 5 20 18 1 6 30
deadline : 1 3 4 3 2 1 2
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24. Primsalgorithm is based on _____________ method
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.Which of the following are essential statement types for describing algorithms?
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 isoptimal value in the case of job sequence problem
item : 1 2 3 4 5
profit : 20 15 10 5 1
deadline : 2 2 3 3 3
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.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 29 of 30
Q-29.lower bound is denoted as _______
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.For 0/1 KNAPSACK problem, the algorithm takes ________ amount of time for
memory table, and ______time to determine the optimal load, for N objects and
W as the capacity of KNAPSACK.
Your Answer:Correct
Your Answer:Incorrect