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.In an array representation of binary tree the right child of root will be at location of
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.Tight bound is denoted as _______
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.Read the following statements carefully and pick the correct option:
I. The worst time complexity of the Floyd’s algorithm is O(n3). II.
The worst time complexity of the Warshall’s algorithm is O(n3).
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.A problem L is NP-complete iff L is NP-hard and
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.The in order traversal of tree will yield a sorted listing of elements of tree in
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.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 7 of 30
Q-7.In Algorithm comments begin with____________
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.When converting binary tree into extended binary tree, all the original nodes in binary tree
are
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.Let G be a graph with ‘n’ nodes and let ‘m’ be the chromatic number of the graph.
Then the time taken by the backtracking algorithm to color it is
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.The optimal merge pattern is based on _________ method
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.When converting binary tree into extended binary tree, all the original nodes in binary tree are
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.The time factor when determining the efficiency of algorithm is measured by
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.The number of comparisons of elements for worst case is ____________ in the case
of maxmin algorithm based on divide and conquer method
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.Two main measures for the efficiency of an algorithm are
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.The output of Kruskal and Prims algorithm is ________________
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.The running time of quick sort depends heavily on the selection of
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.BFS is best compared to DFS in the case of ________________
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.The term ________ refers to all state space search methods in which all hildren of
the –nodes are generated before any other live node can becomethe E-node.
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.Given two non-negative functions f(n)= 6n2+5n+1 and g(n)=n2 . Calculate lower bound
value ,C
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.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 22 of 30
Q-22.The space factor when determining the efficiency of algorithm is measured by
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.Name the node which has been generated but none of its children nodes have
been generated in state space tree of backtracking method.
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.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 25 of 30
Q-25.Which data structure allows deleting data elements from front and inserting at rear?
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.The method will choosing when sub problems share sub problems
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.Which of the following is is also called last in first out LIFO system?
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.Which of the following searching methods requires that all keys must reside
in internal memory?
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.The following are the statements regarding the NP problems. Chose the right option
from the following options: I. All NP-complete problems are not NP-hard.
II. SomeNP-hard problems are not known to be NP-complete.
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.Identify the data structure which allows deletions at both ends of the list but insertion at only one enD
Your Answer:Correct
Your Answer:Incorrect