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.Which of the following formulas in Omega notation best represent the expression
n²+35n+6?
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.In a graph if e=[u, v], Then u and v are called
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.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 4 of 30
Q-4.If f,t: N→ R+, then t (n) Ω (f (n)), iff f(n) O (t (n)) is known as
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.The space factor when determining the efficiency of algorithm is measured by
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.A connected graph T without any cycles is called
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.In a priority queue, insertion and deletion takes place at ………………
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.Quick sort invented by _____________
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.Best case time complexity of Quick sort is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.The functions f &g are non-negative functions. The function f(n)=O(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 13 of 30
Q-13.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 14 of 30
Q-14.The Sorting methodwhich is used for external sort is
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.Which of the following are essential statement types for describing algorithms?
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.Which is not a criteria of algorithm
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.Time complexity of given algorithm
Algorithm Display(A)
{
S:=0.0;
For i:=0 to n-1
{
S:=S+A[i];
Return S;
}
}
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.Prims algorithm is based on _____________ method
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.The time complexity of the normal quick sort, randomized quick sort algorithms in the
worst case is
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.__________ is the average number of steps that can executed for the given
parameters
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.Which method of traversal does not use stack to hold nodes that are waiting to be
processed?
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.In a graph if e=(u, v) means
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.The mathematical definition for Omega can be defined as, provided f,g:NR+ and c
is a positive constant and n > n0,
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.Which of the following is something that has certain attributes or properties which may be assigned values?
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.lower bound is denoted as _______
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.Worst case efficiency of binary search is
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.BFS is best compared to DFS in the case of ________________
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.Worst case efficiency of which search is O(n)?
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.Which of the following is an application of stack?
Your Answer:Correct
Your Answer:Incorrect