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 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 2 of 30
Q-2.Graph Coloring is which type of algorithm design strategy
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.Identify the correct problem for multistage graph from the list given below.
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.When converting binary tree into extended binary tree, all the original nodes in binary tree
are
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.O(n) means computing time is __________________
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.What is the type of the algorithm used in solving the 4 Queens problem?
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.Which of the following is an application of stack?
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.From the following chose the one which belongs to the algorithm paradigm
other than to which others from the following belongs to.
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.Average case time complexity of Quick sort is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.The name backtrack was first coined by _________
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.The method which return different solutions from a single point ,which is
_________
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.Worst case time complexity of Quick sort is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.Quick sort is based on divide and conquer paradigm; we divide the problem on base
of pivotelementand:
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.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 15 of 30
Q-15.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 16 of 30
Q-16.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 17 of 30
Q-17.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 18 of 30
Q-18.Worst case efficiency of binary search is
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.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 20 of 30
Q-20.The space factor when determining the efficiency of algorithm is measured by
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.In a graph if e=(u, v) means
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.Who invented the word Algorithm
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.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 24 of 30
Q-24.The element which is inserted first will be removed last in the
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.Testing of a program consists of 2 phases which are ______________________
and ____________
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.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 27 of 30
Q-27.Let G be a graph with ‘n’ nodes and let ‘m’ be the chromatic number of the graph.
Then the time taken by the backtracking algorithm to color it is
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.A connected graph T without any cycles is called
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.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 30 of 30
Q-30.In Algorithm Specification the blockes are indicated with matching _______
Your Answer:Correct
Your Answer:Incorrect