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 timecomplexity of Strassen’s algorithm is ___________
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.O(n) means computing time is __________________
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.The in order traversal of tree will yield a sorted listing of elements of tree in
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.__________ is the minimum number of steps that can executed for the given
parameters
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.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 6 of 30
Q-6.The Hamiltonian cycles problem uses the following line of code to generate a
next vertex, provided x[ ] is a global array and kth vertex is under consideration:
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 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 9 of 30
Q-9.Graphical representation of algorithm is _____________________
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.The complexity of Binary search algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.The time taken by NP-class sorting algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.Which of the following is the collection of records of the entities in a given entity set?
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.Recursive algorithms are based on
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.In a priority queue, insertion and deletion takes place at ………………
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.The total number of comparisons in a bubble sort is
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.A __________ is a round trip path along n edges of G that visits every vertex once
and returns to its starting position.
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.Dijkstra’s algorithm :
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.Which of the following operations combined record into different sorted files into a single sorted file?
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.The amount of time needs to run to completion is known as____________
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.What would be the cost value for any answering node of a sub tree with root ‘r’
using branch-bound algorithm?
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.which isoptimal value in the case of job sequence problem
item : 1 2 3 4 5
profit : 20 15 10 5 1
deadline : 2 2 3 3 3
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.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 23 of 30
Q-23.Tight bound is denoted as _______
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.If all c(i, j )’s and r(i, j)’s are calculated, then OBST algorithm in worst case takes
one of the following time.
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.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 26 of 30
Q-26.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 27 of 30
Q-27.Which of the following sorting algorithm is of divide-and-conquer type?
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.Quick sort is based on divide and conquer paradigm; we divide the problem on base
of pivotelementand:
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29. What term is used to describe an O(n) algorithm?
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.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