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.Quick sort is based on divide and conquer paradigm; we divide the problem on base
of pivotelementand:
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.Performance based criteria of algorithm , which has to do with its storage
requirements is _______________
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.Given two non-negative functions f(n)= 6n2+5n+1 and g(n)=n2 . Calculate lower bound
value ,C
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.Which is the logical or mathematical model of a particular organization of a data?
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.Time complexity of given algorithm
Algorithm Display(A)
{
S:=0.0;
For i:=0 to n-1
{
S:=S+A[i];
Return S;
}
}
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.Theasymptotic notation for defining the average time complexity is
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.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 8 of 30
Q-8.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 9 of 30
Q-9.A connected graph T without any cycles is called
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.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 11 of 30
Q-11.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 12 of 30
Q-12.Which data structure allows deleting data elements from front and inserting at rear?
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.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 14 of 30
Q-14. What term is used to describe an O(n) algorithm?
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.The following are the statements regarding the NP problems. Chose the right option
from the following options: I. All NP-complete problems are not NP-hard.
II. SomeNP-hard problems are not known to be NP-complete.
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 Knapsack problem where the objective function is to minimize the profit is
______
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.The function f(n)=o(g(n)) if and only if Limit f(n)/g(n)=0n->∞
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.BFS is best compared to DFS in the case of ________________
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.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 22 of 30
Q-22.What algorithm technique is used in the implementation of Kruskal’ssolution for
theMST?
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.Which of the following is the collection of records of the entities in a given entity set?
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.In a balance binary tree the height of two sub trees of every node can not differ by more than
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.Which of the following is not a limitation of binary search algorithm?
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.For defining the best time complexity, let f (n) = log n and g (n) = √n, _________
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.Time complexity of 4-queen problem
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.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 29 of 30
Q-29.fractional knapsack is based on ____________method
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.Data structure that contains a relationship between a pair of elements, this is not necessarily hierarchical in nature.
Your Answer:Correct
Your Answer:Incorrect