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.What is the type of the algorithm used in solving the 4 Queens problem?
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.Testing of a program consists of 2 phases which are ______________________
and ____________
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.Application of mergesort _________
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.Find the odd one out.
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.The function f(n)=o(g(n)) if and only if Limit f(n)/g(n)=0n->∞
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.The time factor when determining the efficiency of algorithm is measured by
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 values in which field uniquely determine the record in a file
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.Breadth first search __________
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.Merge sort invented by _____________
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.If the out degree of every node is exactly equal to M or 0 and the number of nodes at level K is Mk-1 [consider root at level 1], then tree is called as (i) Full m-ary try
(ii) Complete m-ary tree
(iii)Positional m-ary tree
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.The complexity of the average case of an algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.Which of the following operations combined record into different sorted files into a single sorted file?
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.Let there be an array of length ‘N’, and the selection sort algorithm is used to sort it,
how many times a swap function is called to complete the execution?
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.The ___________ of an algorithm is the amount of memory it needs to run to
completion.
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.Which of the following data structure is linear type?
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.Which of the following versions of merge sort algorithm does uses space efficiently?
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.Which of the following refers to a single unit of values?
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.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 20 of 30
Q-20.fractional knapsack is based on ____________method
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.Express the formula (n – 2)*(n – 4) using θ notation:
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.The number of comparisons of elements for average case is ____________ in the
case of maxmin algorithm based on divide and conquer method
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.Which of the following is the collection of records of the entities in a given entity set?
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.By Strassen’s equation what is wrong in the following equation
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25. What term is used to describe an O(n) algorithm?
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.The functions f & g are non-negative functions. The function f(n)=Ω(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 27 of 30
Q-27.Quick sort is based on divide and conquer paradigm; we divide the problem on base
of pivotelementand:
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.A __________ is a round trip path along n edges of G that visits every vertex once
and returns to its starting position.
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 is expressed by using _________
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.In a graph if e=(u, v) means
Your Answer:Correct
Your Answer:Incorrect