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.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 2 of 30
Q-2.Which of the following is not a primitive data structure?
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.In a priority queue, insertion and deletion takes place at ………………
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.In Algorithm Specification the blockes are indicated with matching _______
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.Breadth first search uses __________ as an auxiliary structure to hold nodes for
future processing.
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.The Sorting methodwhich is used for external sort is
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.Thegeneralcriteriaof algorithm;zero or more quantities are externally supplied is
______
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.The amount of time needs to run to completion is known as____________
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.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 10 of 30
Q-10.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 11 of 30
Q-11.Which of the following data structure is non-linear type?
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.which is optimal value in the case of fractional knapsack problem, capacity of
knapsack is 10
item : 1 2 3 4 5
profit : 12 32 40 30 50
weight : 4 8 2 6 1
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.job sequencing with deadline is based on ____________method
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.By Strassen’s equation what is wrong in the following equation
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.The functions f & g are non-negative functions. The function f(n)=Ω(g(n)) if and only
if there exist positive constants c& n0 such that ___________ for all n, n≥ n0
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.Which is not in general criteria of algorithm
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.The optimal solution to a problem is a combination of optimal solutions to its subproblems. This is known as
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.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 20 of 30
Q-20.Identify the name of the sorting in which time is not proportional to n2.
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.Given two non-negative functions f(n)= 5n2+6n+1 and g(n)=n2 . Calculate upper
bound value ,C
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.A binary tree can easily be converted into q 2-tree
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.Which of the following case does not exist in complexity theory
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.4 -Queen problem what is the space complexity
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.The complexity of Binary search algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.Upper bound is denoted as _______
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.__________ is the average number of steps that can executed for the given
parameters
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.Quick sort invented by _____________
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.Greedy job scheduling with deadlines algorithms’ complexity is defined as
Your Answer:Correct
Your Answer:Incorrect