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.A binary tree can easily be converted into q 2-tree
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.The Average case occur in linear search algorithm
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.Which design strategy stops theexecution when it find the solution otherwise starts
the problem from top
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.kruskal algorithm is based on ___________method
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.The advantage of selecting maxmin algorithm using divide and conquer
method compared to staightmaxmin algorithm is _____
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.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 7 of 30
Q-7.In pseudo-code conventions output express as __________
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.In Algorithm Specification the blockes are indicated with matching _______
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.If the out degree of every node is exactly equal to M or 0 and the number of nodes at level K is Mk-1 [consider root at level 1], then tree is called as (i) Full m-ary try
(ii) Complete m-ary tree
(iii)Positional m-ary tree
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.The space factor when determining the efficiency of algorithm is measured by
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.In a Stack the command to access nth element from the top of the stacks will be
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.Which of the following belongs to the algorithm paradigm?
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.The in order traversal of tree will yield a sorted listing of elements of tree in
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.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 15 of 30
Q-15.Sequential search has a time complexity of O(n), and binary search has a time
complexity of O(log(n)). What difference will it make when the size n is 1000?
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.A list which displays the relationship of adjacency between elements is said to be
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.Sorting is not possible by using which of the following methods?
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.Performance based criteria of algorithm , which has to do with its storage
requirements is _______________
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.The time factor when determining the efficiency of algorithm is measured by
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.Which of thefollowing sorting algorithm is of divide-and-conquer type?
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.O(n^2) means computing time is __________________
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.For the bubble sort algorithm, what is the time complexity of the best/worst case?
(assume that the computation stops as soon as no more swaps in one pass)
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.Upper bound is denoted as _______
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.In Quick sort algorithm,constants hidden in T(n lg n) are
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.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 26 of 30
Q-26.Worst case efficiency of which search is O(n)?
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.The dummy header in linked list contain
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.The time taken by NP-class sorting algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.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 30 of 30
Q-30.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