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 sorting , which works very well for small file is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.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 3 of 30
Q-3.The dummy header in linked list contain
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.Time complexity of 4-queen problem
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.A list which displays the relationship of adjacency between elements is said to be
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.Which of the following versions of merge sort algorithm does uses space efficiently?
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.job sequencing with deadline is based on ____________method
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.By Strassen’s equation what is wrong in the following equation
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.The general criteria of algorithm; algorithm must terminates after a finite number
of steps ______
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.A connected graph T without any cycles is called
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.For the bubble sort algorithm, what is the time complexity of the best/worst case?
(assume that the computation stops as soon as no more swaps in one pass)
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.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 15 of 30
Q-15.Greedy job scheduling with deadlines algorithms’ complexity is defined as
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.__________ is the maximum number of steps that can executed for the given
parameters
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.The function f(n)=o(g(n)) if and only if Limit f(n)/g(n)=0n->∞
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 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.Best case time complexity of binary search is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.Worst case time complexity of binary search is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.The element which is inserted first will be removed last in the
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.The complexity of merge sort algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.The timecomplexity of Strassen’s algorithm is ___________
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.The general criteria of algorithm; at least one quantity is produced ______
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.The method will choosing when sub problems share sub problems
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.Which of the following is is also called last in first out LIFO system?
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.The time complexity of the shortest path algorithm can be bounded by
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.Which of the following is a set of data values and associated operations that are specified accurately, independent of any particular implementation?
Your Answer:Correct
Your Answer:Incorrect