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.which isoptimal value in the case of job sequence problem
item : 1 2 3 4 5
profit : 20 15 10 5 1
deadline : 2 2 3 3 3
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.If yyy, xxx and zzz are the elements of a lexically ordered binary tree, then in preorder traversal which node will be traverse first
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.In an arbitrary tree ( not a search tree) of order M. Its size is N, and its height is K.
The computation time needed to find a data item on T is
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.In a Stack the command to access nth element from the top of the stacks will be
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.For defining the best time complexity, let f (n) = log n and g (n) = √n, _________
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.In linked lists there are no NULL links in:
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.The complexity of Bubble sort algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.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 9 of 30
Q-9.Which of the following is not a primitive data structure?
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.Which is not in general criteria of algorithm
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.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 12 of 30
Q-12.The functionf(n)=o(g(n)) if and only if Limit g(n)/f(n)=0 n->∞
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.The amount of time needs to run to completion is known as____________
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.Graph Coloring is which type of algorithm design strategy
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.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 16 of 30
Q-16.The element which is inserted first will be removed last in the
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.Which sorting algorithn is faster :
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.The dummy header in linked list contain
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.The graph colouringalgorithm’s time can be bounded by _________
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.The name backtrack was first coined by _________
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.O(1) means computing time is __________________
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.From the following which is not return optimal solution
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.The complexity of Binary search algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.Binary Search Algorithm cannot be applied to
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.which is not feasible solution in the case of job sequence problem
item : 1 2 3 4
profit : 100 10 15 27
deadline : 2 1 2 1
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.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 27 of 30
Q-27.An algorithm that calls itself directly or indirectly is known as
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.Merge sort invented by _____________
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.A connected graph T without any cycles is called
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.Which of the following is also called first in first out FIFO system?
Your Answer:Correct
Your Answer:Incorrect