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 is not a limitation of binary search algorithm?
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.In the case of Fibnocci heap the running time of Prim’s algorithm is _________
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.The space factor when determining the efficiency of algorithm is measured by
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.Which of the following versions of merge sort algorithm does uses space efficiently?
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.The timecomplexity of Strassen’s algorithm is ___________
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.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 8 of 30
Q-8.job sequencing with deadline is based on ____________method
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.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 10 of 30
Q-10.Breadth first search uses __________ as an auxiliary structure to hold nodes for
future processing.
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.The general criteria of algorithm; Each instruction is clear and unambiguous ______
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 divide and conquer merge sort algorithm’s time complexity can be defined as
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.Which of the following data structure is non-linear type?
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.The complexity of Binary search algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.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 17 of 30
Q-17.Identify the name of the sorting in which time is not proportional to n2.
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.Which is not return optimal solution from the following methods
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.which is not feasible solution in the case of job sequence problem
item : 1 2 3 4
profit : 100 10 15 27
deadline : 2 1 2 1
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.In a balance binary tree the height of two sub trees of every node can not differ by more than
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.This 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 22 of 30
Q-22.The time factor when determining the efficiency of algorithm is measured by
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.An algorithm that calls itself directly or indirectly is known as
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.The function f(n)=o(g(n)) if and only if Limit f(n)/g(n)=0n->∞
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.Greedy job scheduling with deadlines algorithms’ complexity is defined as
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.Which of the following case does not exist in complexity theory
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.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 28 of 30
Q-28.The running time of quick sort depends heavily on the selection of
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.The deletion mechanism in the stack is called as
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.The graph colouringalgorithm’s time can be bounded by _________
Your Answer:Correct
Your Answer:Incorrect