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.lower bound is denoted as _______
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.Which of the following operations accesses each record exactly once so that certain items may be processed?
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.If every node u in G is adjacent to every other node v in G, A graph is said to be
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.The output of Kruskal and Prims algorithm is ________________
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.The amount of memory needs to run to completion is known as_____________
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.Advantage of finding maximum and minimum using divide and conquer method
instead of using conditional operators is __________________
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.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 8 of 30
Q-8.___________ 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 9 of 30
Q-9.When converting binary tree into extended binary tree, all the original nodes in binary tree
are
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.In Algorithm Specification the blockes are indicated with matching _______
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.The running time of quick sort depends heavily on the selection of
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.Choose the correct answer for the following statements: I. The theory of NP–completeness provides a method of obtaining a
polynomial time for NPalgorithms.
II. All NP-complete problem are NP-Hard.
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.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 14 of 30
Q-14.Worst case efficiency of binary search is
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.A binary tree whose every node has either zero or two children is called
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.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 17 of 30
Q-17.By Strassen’s equation what is wrong in the following equation
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.Which of the following case does not exist in complexity theory
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.The Average case occur in linear search algorithm
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.Huffmancodes are the applications of _________ with minimal weighted external
path length obtained by an optimal set.
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.The application of heap tree is
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.Worst case time complexity of binary search is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.In the case ofsub problems share sub problems ,which method is suitable
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.Which of the following is a non linear data structure?
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.The advantage of selecting maxmin algorithm using divide and conquer
method compared to staightmaxmin algorithm is _____
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.In a Stack the command to access nth element from the top of the stacks will be
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.This 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 28 of 30
Q-28.What is the type of the algorithm used in solving the 8 Queens problem?
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.Merge sort invented by _____________
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.The depth of a complete binary tree is given by
Your Answer:Correct
Your Answer:Incorrect