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 complexity of the average case of an algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.The time factor when determining the efficiency of algorithm is measured by
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.How many nodes are there in a full state space tree with n = 6?
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.In pseudo-code conventions input express as __________
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.Which of the following data structure is linear type?
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.The optimal solution to a problem is a combination of optimal solutions to its subproblems. This is known as
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.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 8 of 30
Q-8.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 9 of 30
Q-9.Which of thefollowing sorting algorithm is of divide-and-conquer type?
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.What do you call the selected keys in the quick sort method?
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.The worst case time complexity of the nondeterministic dynamic knapsack
algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.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 14 of 30
Q-14.Testing of a program consists of 2 phases which are ______________________
and ____________
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.The complexity of the average case of an algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.job sequencing with deadline is based on ____________method
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.The functions f &g are non-negative functions. The function f(n)=O(g(n)) if and only
if there exist positive constants c& n0 such that __________ for all n, n≥ n0
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.Upper bound is denoted as _______
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.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 20 of 30
Q-20.The mathematical definition for Omega can be defined as, provided f,g:NR+ and c is
a positive constant and n > n0,
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 a balance binary tree the height of two sub trees of every node can not differ by more than
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.___________ 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 24 of 30
Q-24.In a priority queue, insertion and deletion takes place at ………………
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.Thegeneralcriteriaof algorithm;zero or more quantities are externally supplied is
______
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.Performance based criteria of algorithm , which has to do with its computing time is
_______________
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.A binary tree whose every node has either zero or two children is called
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.Which is not a criteria of algorithm
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.The method which return different solutions from a single point ,which is
_________
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.Which of the following formulas in Omega notation best represent the expression
n²+35n+6?
Your Answer:Correct
Your Answer:Incorrect