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 of the following is the collection of records of the entities in a given entity set?
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.In the case of Fibnocci heap the running time of Prim’s algorithm is _________
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.The functionf(n)=o(g(n)) if and only if Limit g(n)/f(n)=0 n->∞
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.The general criteria of algorithm; algorithm must terminates after a finite number
of steps ______
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.Express the formula (n – 2)*(n – 4) using θ notation:
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.What do you call the selected keys in the quick sort method?
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.Which of the following formulas in Omega notation best represent the expression
n²+35n+6?
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.The result of evaluating prefix expression */b+-dacd, where a = 3, b = 6, c = 1, d = 5 is
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.Sequential search has a time complexity of O(n), and binary search has a time
complexity of O(log(n)). What difference will it make when the size n is 1000?
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.__________ is the maximum number of steps that can executed for the given
parameters
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.If the out degree of every node is exactly equal to M or 0 and the number of nodes at level K is Mk-1 [consider root at level 1], then tree is called as (i) Full m-ary try
(ii) Complete m-ary tree
(iii)Positional m-ary tree
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.Which of thefollowing sorting algorithm is of divide-and-conquer type?
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.Consider the usual algorithm for determining whether a sequence of parentheses is
balanced. What is the maximum number of parentheses that will appear on the stack
AT ANY ONE TIME when the algorithm analyzes: (()(())(()))
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.In an array representation of binary tree the right child of root will be at location of
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.Which is not return optimal solution from the following methods
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.In the case ofsub problems share sub problems ,which method is suitable
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.For analyzing an algorithm, which is better computing time?
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.A __________ is a round trip path along n edges of G that visits every vertex once
and returns to its starting position.
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.In linked lists there are no NULL links in:
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.The method which stops the execution ,if it find the solution. Otherwise it start from
the top
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.The mathematical definition for Omega can be defined as, provided f,g:NR+ and c
is a positive constant and n > n0,
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.0/1 knapsack is based on ____________method
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.Breadth first search uses __________ as an auxiliary structure to hold nodes for
future processing.
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.Identify the correct problem for multistage graph from the list given below.
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.Two main measures for the efficiency of an algorithm are
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.A binary tree can easily be converted into q 2-tree
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.By Strassen’s equation what is wrong in the following equation
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.kruskal algorithm is based on ___________method
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.Application of mergesort _________
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