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.Given two non-negative functions f(n)= 6n2+5n+1 and g(n)=n2 . Calculate lower bound
value ,C
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.Which of the following involves arranging the records in a logical order?
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.The time taken by NP-class sorting algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.The ___________ of an algorithm is the amount of memory it needs to run to
completion.
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.Recursive algorithms are based on
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.Which is not return optimal solution from the following methods
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.The complexity of linear search algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.The amount of memory needs to run to completion is known as_____________
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.Application of quicksort _________
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.Time complexity of 4-queen problem
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.Graphical representation of algorithm is _____________________
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.Which of the following case does not exist in complexity theory
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.The number of comparisons of elements for best case is ____________ in the case
of maxmin algorithm based on divide and conquer method
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.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 15 of 30
Q-15.The method will choosing when sub problems share sub problems
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.Which of following algorithm scans the list by swapping the entries whenever pair
of adjacent keys are out of desired order?
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.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 19 of 30
Q-19.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 20 of 30
Q-20.The total number of comparisons in a bubble sort is
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.A connected graph T without any cycles is called
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.Consider the usual algorithm for determining whether a sequence of parentheses is
balanced. What is the maximum number of parentheses that will appear on the stack
AT ANY ONE TIME when the algorithm analyzes: (()(())(()))
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.lower bound is denoted as _______
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.Average case time complexity of Quick sort is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.The deletion mechanism in the stack is called as
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.Identify the correct problem for multistage graph from the list given below.
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.Breadth first search
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.The functions f & g are non-negative functions. The function f(n)=θ(g(n)) if and only
if there exist positive constants c1,c2 & n0 such that ________for all n, n≥ n0
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.The Knapsack problem where the objective function is to minimize the profit is
______
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.How many edges are there in a Hamiltonian cycle if the edge cost is ‘c’ and the
Your Answer:Correct
Your Answer:Incorrect