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 29 Time Limit 20 Minutes Points 1 Point for each Question
Remaining Time: 0 MINUTES
0 of 29 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
Information
You have already completed the test before. Hence you can not start it again.
0 of 29 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
Question 1 of 29
Q-1.The notation is __________ I. Symmetric.
II. Reflexive.
III. Transitive.
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 29
Q-2.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 3 of 29
Q-3.Upper bound is denoted as _______
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 29
Q-4.A binary tree whose every node has either zero or two children is called
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 29
Q-5.Tight bound is denoted as _______
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 29
Q-6.The time taken by NP-class sorting algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 29
Q-7.lower bound is denoted as _______
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 29
Q-8.The functions f & g are non-negative functions. The function f(n)=θ(g(n)) if and only
if there exist positive constants c1,c2 & n0 such that ________for all n, n≥ n0
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 29
Q-9.Which of the following data structure is not linear data structure?
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 29
Q-10.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 11 of 29
Q-11.Data by itself is not useful unless
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 29
Q-12.Average case time complexity of Quick sort is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 29
Q-13.A connected graph T without any cycles is called
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 29
Q-14.An algorithm that calls itself directly or indirectly is known as
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 29
Q-15.The disadvantage in using a circular linked list is …………………….
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 29
Q-16.The Worst case occur in linear search algorithm when
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 29
Q-17.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 18 of 29
Q-18.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 19 of 29
Q-19.A problem L is NP-complete iff L is NP-hard and
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 29
Q-20.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 21 of 29
Q-21.The function f(n)=o(g(n)) if and only if Limit f(n)/g(n)=0n->∞
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 29
Q-22.The complexity of Binary search algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 29
Q-23.The dummy header in linked list contain
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 29
Q-24.The complexity of Bubble sort algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 29
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 29
Q-26.The complexity of linear search algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 29
Q-27.Let there be an array of length ‘N’, and the selection sort algorithm is used to sort it,
how many times a swap function is called to complete the execution?
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 29
Q-28.Who invented the word Algorithm
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 29
Q-29.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