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. Primsalgorithm is based on _____________ method
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.In which of the following length records file records may contain different lengths?
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.Binary Search Algorithm cannot be applied to
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.An algorithm that calls itself directly or indirectly is known as
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.For 0/1 KNAPSACK problem, the algorithm takes ________ amount of time for
memory table, and ______time to determine the optimal load, for N objects and
W as the capacity of KNAPSACK.
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.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 7 of 30
Q-7.When converting binary tree into extended binary tree, all the original nodes in binary tree are
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.Application of mergesort _________
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.In analysis of algorithm, approximate relationship between the size of the job and
the amount of work required to do it is expressed by using
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.How many edges are there in a Hamiltonian cycle if the edge cost is ‘c’ and the
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.A binary tree whose every node has either zero or two children is called
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.A binary tree can easily be converted into q 2-tree
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.Identify the name of the sorting in which time is not proportional to n2.
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.The files x1,x2,x3 are 3 files of length 30,20,10 records each. What is the optimal
merge pattern value?
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.The general criteria of algorithm; algorithm must terminates after a finite number
of steps ______
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.In a priority queue, insertion and deletion takes place at ………………
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.Advantage of finding maximum and minimum using divide and conquer method
instead of using conditional operators is __________________
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.___________ 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 19 of 30
Q-19.When representing any algebraic expression E which uses only binary operations in a 2-tree
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.Graph Coloring is which type of algorithm design strategy
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.Breadth first search uses __________ as an auxiliary structure to hold nodes for
future processing.
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.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 23 of 30
Q-23.The sorting , which works very well for small file is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.Which of the following operations accesses each record exactly once so that certain items may be processed?
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.The amount of memory needs to run to completion is known as_____________
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.The general criteria of algorithm; Each instruction is clear and unambiguous ______
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.The worst case time complexity of the nondeterministic dynamic knapsack
algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.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 29 of 30
Q-29.The depth of a complete binary tree is given by
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.Theasymptotic notation for defining the average time complexity is
Your Answer:Correct
Your Answer:Incorrect