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 time factor when determining the efficiency of algorithm is measured by
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.A problem L is NP-complete iff L is NP-hard and
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.In a graph if e=(u, v) means
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.Which of the following refers to a single unit of values?
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.Which of the following is an application of stack?
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.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 8 of 30
Q-8.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 9 of 30
Q-9.The method which return different solutions from a single point ,which is
_________
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.The amount of time needs to run to completion is known as____________
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.Advantage of finding maximum and minimum using divide and conquer method
instead of using conditional operators is __________________
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.The complexity of Bubble sort algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.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 14 of 30
Q-14.The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.Let there be an array of length ‘N’, and the selection sort algorithm is used to sort it,
how many times a swap function is called to complete the execution?
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.Breadth first search uses __________ as an auxiliary structure to hold nodes for
future processing.
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.To calculatec(i, j )’s, w( i, j)’s and r(i, j)’s; the OBST algorithm in worst case takes
the following time.
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.When we say an algorithm has a time complexity of O (n), what does it mean?
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.The space factor when determining the efficiency of algorithm is measured by
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.Application of mergesort _________
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.Average case time complexity of binary search is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.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 23 of 30
Q-23.The Worst case occur in linear search algorithm when
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.Which of the following case does not exist in complexity theory
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.0/1 knapsack is based on ____________method
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.Which is not return optimal solution from the following methods
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.Binary Search Algorithm cannot be applied to
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.In Algorithm Specification the blockes are indicated with matching _______
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.Which of the following is not a primitive data structure?
Your Answer:Correct
Your Answer:Incorrect