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.In Knapsack problem, the best strategy to get the optimal solution, where Pi, Wi is the
Profit, Weight associated with each of the Xith object respectively is to
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.which is optimal value in the case of job sequence problem
item : 1 2 3 4 5 6 7
profit : 3 5 20 18 1 6 30
deadline : 1 3 4 3 2 1 2
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.Given two non-negative functions f(n)= 6n2+5n+1 and g(n)=n2 . Calculate lower bound
value ,C
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.Which of the following is not a limitation of binary search algorithm?
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.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 7 of 30
Q-7.The functionf(n)=o(g(n)) if and only if Limit g(n)/f(n)=0 n->∞
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.By Strassen’s equation what is wrong in the following equation
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.The time complexity of binary search in best, worst cases for an array of size N is
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.The ___________ of an algorithm is the amount of memory it needs to run to
completion.
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.Greedy job scheduling with deadlines algorithms’ complexity is defined as
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.Read the following statements carefully and pick the correct option:
I. The worst time complexity of the Floyd’s algorithm is O(n3). II.
The worst time complexity of the Warshall’s algorithm is O(n3).
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.Quick sort is based on divide and conquer paradigm; we divide the problem on base
of pivotelementand:
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.Worst case time complexity of Quick sort is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.Sorting is not possible by using which of the following methods?
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.Which of the following involves arranging the records in a logical order?
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.job sequencing with deadline is based on ____________method
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.In linked lists there are no NULL links in:
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.In a Stack the command to access nth element from the top of the stacks will be
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.Worst case efficiency of binary search is
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.Which of thefollowing sorting algorithm is of divide-and-conquer type?
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.The complexity of Bubble sort algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.For defining the best time complexity, let f (n) = log n and g (n) = √n, _________
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.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 26 of 30
Q-26.Which of the following versions of merge sort algorithm does uses space efficiently?
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.The application of heap tree is
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.In Quick sort algorithm,constants hidden in T(n lg n) are
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.Which of the following data structure is non-linear type?
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30. What term is used to describe an O(n) algorithm?
Your Answer:Correct
Your Answer:Incorrect