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 element which is inserted first will be removed last in the
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.The complexity of Binary search algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.A problem L is NP-complete iff L is NP-hard and
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.The complexity of linear search algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5. From the following pick the one which does not belongs to the same paradigm to which
others belongs to.
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.Identify the name of the sorting in which time is not proportional to n2.
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.The functionf(n)=o(g(n)) if and only if Limit g(n)/f(n)=0 n->∞
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.How many minimum number of spanning trees, one can have from a given
connected graph with N nodes is having different weights for the edges.
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.For defining the best time complexity, let f (n) = log n and g (n) = √n, _________
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.The values in which field uniquely determine the record in a file
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.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 13 of 30
Q-13.Which of the following is an application of stack?
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.The general criteria of algorithm; Each instruction is clear and unambiguous ______
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.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 16 of 30
Q-16.To calculatec(i, j )’s, w( i, j)’s and r(i, j)’s; the OBST algorithm in worst case takes
the following time.
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.The general criteria of algorithm; algorithm must terminates after a finite number
of steps ______
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 divide and conquer merge sort algorithm’s time complexity can be defined as
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.In analysis of algorithm, approximate relationship between the size of the job and
the amount of work required to do it is expressed by using
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.The timecomplexity of Strassen’s algorithm is ___________
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.4 -Queen problem what is the space complexity
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.How many nodes are there in a full state space tree with n = 6?
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.Which of the following is not a limitation of binary search algorithm?
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.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 26 of 30
Q-26.Identify the data structure which allows deletions at both ends of the list but insertion at only one enD
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.which isoptimal value in the case of job sequence problem
item : 1 2 3 4 5
profit : 20 15 10 5 1
deadline : 2 2 3 3 3
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.Binpackingproblem is the application of ____________
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.In the case ofsub problems share sub problems ,which method is suitable
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.If every node u in G is adjacent to every other node v in G, A graph is said to be
Your Answer:Correct
Your Answer:Incorrect