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 29 Time Limit 20 Minutes Points 1 Point for each Question
Remaining Time: 0 MINUTES
0 of 29 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
Information
You have already completed the test before. Hence you can not start it again.
0 of 29 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
Question 1 of 29
Q-1.Readthe following statements carefully, and choose the correct answer. I. The Ω notation is Anti Symmetric.
II. The big Oh notation is Semi Equivalence.
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 29
Q-2.Which of the following is not a primitive data structure?
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 29
Q-3.The Sorting methodwhich is used for external sort is
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 29
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 29
Q-5.The complexity of Binary search algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 29
Q-6.The optimal merge pattern is based on _________ method
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 29
Q-7.For defining the best time complexity, let f (n) = log n and g (n) = √n, _________
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 29
Q-8.If the graph is represented as an adjacency matrix then the time complexity
of Kruskal’s algorithm is ____________
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 29
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 29
Q-10.___________ is the process of executing a correct program on data sets and
measuring the time and space it takes tocompute the results.
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 29
Q-11.Breadth first search
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 29
Q-12.In linked lists there are no NULL links in:
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 29
Q-13.Find the odd one out.
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 29
Q-14.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 15 of 29
Q-15.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 16 of 29
Q-16.The complexity of merge sort algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 29
Q-17.The output of Kruskal and Prims algorithm is ________________
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 29
Q-18.The values in which field uniquely determine the record in a file
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 29
Q-19.The element which is inserted first will be removed last in the
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 29
Q-20.Which of the following sorting algorithm is of divide-and-conquer type?
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 29
Q-21.BFS is best compared to DFS in the case of ________________
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 29
Q-22.Which of the following is a set of data values and associated operations that are specified accurately, independent of any particular implementation?
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 29
Q-23.Best case time complexity of binary search is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 29
Q-24.The general criteria of algorithm; at least one quantity is produced ______
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 29
Q-25.Average case time complexity of binary search is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 29
Q-26.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 27 of 29
Q-27.The complexity of Bubble sort algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 29
Q-28.Which of the following case does not exist in complexity theory
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 29
Q-29.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