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 complexity of Binary search algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.Two main measures for the efficiency of an algorithm are
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.job sequencing with deadline is based on ____________method
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.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 5 of 30
Q-5.Write the out put of the following program: int a[] = {1,2,3}*P;
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6. Primsalgorithm is based on _____________ method
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.A binary tree whose every node has either zero or two children is called
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.The complexity of linear search algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.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 10 of 30
Q-10.Worst case efficiency of which search is O(n)?
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.In an array representation of binary tree the right child of root will be at location of
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.The name backtrack was first coined by _________
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.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 14 of 30
Q-14.A linear list in which each node has pointers to point to the predecessor and successors nodes
is called as ..
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.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 16 of 30
Q-16.Find the odd one out.
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.The time complexity of the normal quick sort, randomized quick sort algorithms in the
worst case is
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.In Quick sort algorithm,constants hidden in T(n lg n) are
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.The Average case occur in linear search algorithm
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.The total number of comparisons in a bubble sort is
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.In Algorithm Specification the blockes are indicated with matching _______
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.Which is not a criteria of algorithm
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.The disadvantage in using a circular linked list is …………………….
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.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 25 of 30
Q-25.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 26 of 30
Q-26.In pseudo-code conventions input express as __________
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.The notation is __________ I. Symmetric.
II. Reflexive.
III. Transitive.
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.Which of the following formulas in Omega notation best represent the expression
n²+35n+6?
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.If the graph is represented as an adjacency matrix then the time complexity
of Kruskal’s algorithm is ____________
Your Answer:Correct
Your Answer:Incorrect