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.The in order traversal of tree will yield a sorted listing of elements of tree in
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.Which sorting algorithn is faster :
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.When converting binary tree into extended binary tree, all the original nodes in binary tree are
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.Which method of traversal does not use stack to hold nodes that are waiting to be
processed?
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.Which of the following involves arranging the records in a logical order?
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.In which of the following length records file records may contain different lengths?
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.The data structure which is one ended is ………………
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.The result of evaluating prefix expression */b+-dacd, where a = 3, b = 6, c = 1, d = 5 is
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.Testing of a program consists of 2 phases which are ______________________
and ____________
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.Which of the following is is also called last in first out LIFO system?
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.The upper bound on the time complexity of the nondeterministic
sorting algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.A ……………….. is a linear list in which insertions and deletions are made to from either end of
the structure.
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.A binary tree whose every node has either zero or two children is called
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.From the following choose the one which belongs to the algorithm paradigm other than
. to which others from the following belongs to.
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.The notation is __________ I. Symmetric.
II. Reflexive.
III. Transitive.
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.Time complexity of given algorithm
Algorithm Display (A)
{
For I:=0 to n-1
{
For J:=0 to n-1
{
Write A;
}
}
}
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.Two main measures for the efficiency of an algorithm are
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.The time taken by NP-class sorting algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.By Strassen’s equation what is wrong in the following equation
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.Which of the following operations accesses each record exactly once so that certain items may be processed?
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.For defining the best time complexity, let f (n) = log n and g (n) = √n, _________
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.In an array representation of binary tree the right child of root will be at location of
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.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 24 of 30
Q-24.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
Question 25 of 30
Q-25.Who invented the word Algorithm
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.The graph colouringalgorithm’s time can be bounded by _________
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.A problem L is NP-complete iff L is NP-hard and
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.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 30 of 30
Q-30.How many edges are there in a Hamiltonian cycle if the edge cost is ‘c’ and the
Your Answer:Correct
Your Answer:Incorrect