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 Average case occur in linear search algorithm
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.Data structure that contains a relationship between a pair of elements, this is not necessarily hierarchical in nature.
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.BFS is best compared to DFS in the case of ________________
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.When we say an algorithm has a time complexity of O (n), what does it mean?
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.__________ is a step-by-step procedure for calculations
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.Which sorting algorithn is faster :
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.Identify the name of the sorting in which time is not proportional to n2.
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.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 10 of 30
Q-10.The complexity of Bubble sort algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.Who invented the word Algorithm
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.Data by itself is not useful unless
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.Which of the following versions of merge sort algorithm does uses space efficiently?
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.O(n) means computing time is __________________
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.Application of quicksort _________
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.In pseudo-code conventions output express as __________
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.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 18 of 30
Q-18.Identify the correct problem for multistage graph from the list given below.
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.The complexity of merge sort algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.The notation is __________ I. Symmetric.
II. Reflexive.
III. Transitive.
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.In the case of Fibnocci heap the running time of Prim’s algorithm is _________
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.How many edges are there in a Hamiltonian cycle if the edge cost is ‘c’ and the
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.Which is true statement in the following?
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.The total number of comparisons in a bubble sort is
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.In an array representation of binary tree the right child of root will be at location of
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.4 -Queen problem what is the space complexity
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.From the following chose 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 29 of 30
Q-29.Time complexity of 4-queen problem
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.The in order traversal of tree will yield a sorted listing of elements of tree in
Your Answer:Correct
Your Answer:Incorrect