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 searching methods requires that all keys must reside
in internal memory?
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.Theasymptotic notation for defining the average time complexity is
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.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 4 of 30
Q-4.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 5 of 30
Q-5.In a Stack the command to access nth element from the top of the stacks will be
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.The complexity of linear search algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.How many nodes are there in a full state space tree with n = 6?
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8. Primsalgorithm is based on _____________ method
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.The complexity of Bubble sort algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.The ___________ of an algorithm is the amount of memory it needs to run to
completion.
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.The depth of a complete binary tree is given by
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.The number of comparisons of elements for average case is ____________ in the
case of maxmin algorithm based on divide and conquer method
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.Time complexity of 4-queen problem
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.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 15 of 30
Q-15.Huffmancodes are the applications of _________ with minimal weighted external
path length obtained by an optimal set.
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.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 17 of 30
Q-17.Which of thefollowing sorting algorithm is of divide-and-conquer type?
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.The in order traversal of tree will yield a sorted listing of elements of tree in
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.Two main measures for the efficiency of an algorithm are
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.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 23 of 30
Q-23.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 24 of 30
Q-24.The functionf(n)=o(g(n)) if and only if Limit g(n)/f(n)=0 n->∞
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.An algorithm that calls itself directly or indirectly is known as
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.Average case time complexity of Quick sort is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.The data structure which is one ended is ………………
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.Prims algorithm is based on _____________ method
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.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 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