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.When converting binary tree into extended binary tree, all the original nodes in binary tree
are
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 29
Q-2.Which of the following is the collection of records of the entities in a given entity set?
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 29
Q-3.Breadth first search uses __________ as an auxiliary structure to hold nodes for
future processing.
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 29
Q-4.A linear list in which each node has pointers to point to the predecessor and successors nodes
is called as ..
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 29
Q-5.Which of the following involves arranging the records in a logical order?
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 29
Q-6.A binary tree whose every node has either zero or two children is called
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 29
Q-7.__________ is the maximum number of steps that can executed for the given
parameters
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 29
Q-8.By Strassen’s equation what is wrong in the following equation
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 29
Q-9.The values in which field uniquely determine the record in a file
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 29
Q-10.The running time of quick sort depends heavily on the selection of
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 29
Q-11.In an arbitrary tree ( not a search tree) of order M. Its size is N, and its height is K.
The computation time needed to find a data item on T is
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 29
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 29
Q-13.In a Stack the command to access nth element from the top of the stacks will be
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 29
Q-14.Breadth first search
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 29
Q-15.A binary tree whose every node has either zero or two children is called
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 29
Q-16.Data structure that contains a relationship between a pair of elements, this is not necessarily hierarchical in nature.
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 29
Q-17.From the following which is not return optimal solution
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 29
Q-18.Data by itself is not useful unless
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 29
Q-19.In Quick sort algorithm,constants hidden in T(n lg n) are
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 29
Q-20.From the following choose 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 21 of 29
Q-21.Which of the following are essential statement types for describing algorithms?
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 29
Q-22.What algorithm technique is used in the implementation of Kruskal’ssolution for
theMST?
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 29
Q-23.Worst case time complexity of Quick sort is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 29
Q-24.which is optimal value in the case of fractional knapsack problem, capacity of
knapsack is 10
item : 1 2 3 4 5
profit : 12 32 40 30 50
weight : 4 8 2 6 1
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 29
Q-25.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 26 of 29
Q-26.An algorithm that calls itself directly or indirectly is known as
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 29
Q-27.Which of the following is a set of data values and associated operations that are specified accurately, independent of any particular implementation?
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 29
Q-28.Which of the following is not a primitive data structure?
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 29
Q-29.The deletion mechanism in the stack is called as
Your Answer:Correct
Your Answer:Incorrect