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. From the following pick the one which does not belongs to the same paradigm to which
others belongs to.
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.Thegeneralcriteriaof algorithm;zero or more quantities are externally supplied is
______
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.Theasymptotic notation for defining the average time complexity is
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.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 5 of 30
Q-5.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 6 of 30
Q-6.The data structure which is one ended is ………………
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.The notation is __________ I. Symmetric.
II. Reflexive.
III. Transitive.
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.Which is not return optimal solution from the following methods
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.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 10 of 30
Q-10.The disadvantage in using a circular linked list is …………………….
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.Which of the following is the collection of records of the entities in a given entity set?
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.Tight bound is denoted as _______
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.If f,t: N→ R+, then t (n) Ω (f (n)), iff f(n) O (t (n)) is known as
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.Worst case time complexity of binary search is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.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 16 of 30
Q-16.BFS is best compared to DFS in the case of ________________
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.In a priority queue, insertion and deletion takes place at ………………
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.Prims algorithm is based on _____________ method
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.The total number of comparisons in a bubble sort is
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.The time complexity of the shortest path algorithm can be bounded by
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.Let f, t: N→R 0, and t (n) O (f (n)) iff t(n)≤ c.f (n) where cis positive real
constant andn≥ no, then no is ___________
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.An algorithm that calls itself directly or indirectly is known as
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.Worst case efficiency of binary search is
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.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 25 of 30
Q-25.In stable sorting algorithm
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.O(n) means computing time is __________________
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.What would be the cost value for any answering node of a sub tree with root ‘r’
using branch-bound algorithm?
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.Which of the following case does not exist in complexity theory
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.If all c(i, j )’s and r(i, j)’s are calculated, then OBST algorithm in worst case takes
one of the following time.
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.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