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.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 2 of 30
Q-2.In Knapsack problem, the best strategy to get the optimal solution, where Pi, Wi is the
Profit, Weight associated with each of the Xith object respectively is to
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.The disadvantage in using a circular linked list is …………………….
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.The complexity of linear search algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.Application of mergesort _________
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.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 7 of 30
Q-7.If all c(i, j )’s and r(i, j)’s are calculated, then OBST algorithm in worst case takes
one of the following time.
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.In an array representation of binary tree the right child of root will be at location of
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.Find the odd one out from the following categories of algorithms.
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.Upper bound is denoted as _______
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.The timecomplexity of Strassen’s algorithm is ___________
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12. What term is used to describe an O(n) algorithm?
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.Theasymptotic notation for defining the average time complexity is
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.O(n^3) means computing time is __________________
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.Quick sort is based on divide and conquer paradigm; we divide the problem on base
of pivotelementand:
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.Which is not in general criteria of algorithm
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.The running time of quick sort depends heavily on the selection of
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.Two main measures for the efficiency of an algorithm are
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.The optimal merge pattern is based on _________ method
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.Time complexity of given algorithm
AlgorithmSum(A,S)
{
for i:=1 to n-1
{
for j:=2 to n-1
{
S:=S+i+j;
return S;
}
}
}
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.Breadth first search uses __________ as an auxiliary structure to hold nodes for
future processing.
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.The Knapsack problem where the objective function is to minimize the profit is
______
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.Identify the data structure which allows deletions at both ends of the list but insertion at only one enD
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.The values in which field uniquely determine the record in a file
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.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 27 of 30
Q-27.Prims algorithm is based on _____________ method
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.Identify the correct problem for multistage graph from the list given below.
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.The Sorting methodwhich is used for external sort is
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.A problem L is NP-complete iff L is NP-hard and
Your Answer:Correct
Your Answer:Incorrect