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 not a primitive data structure?
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.Time complexity of 4-queen problem
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.Readthe following statements carefully, and choose the correct answer. I. The Ω notation is Anti Symmetric.
II. The big Oh notation is Semi Equivalence.
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.The general criteria of algorithm; at least one quantity is produced ______
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.The time factor when determining the efficiency of algorithm is measured by
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.The depth of a complete binary tree is given by
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.Which of the following refers to a single unit of values?
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.The method which return different solutions from a single point ,which is
_________
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.Which of following algorithm scans the list by swapping the entries whenever pair
of adjacent keys are out of desired order?
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.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 11 of 30
Q-11.Which of the following operations combined record into different sorted files into a single sorted file?
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.How do you determine the cost of a spanning tree?
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.The time complexity of the normal quick sort, randomized quick sort algorithms in the
worst case is
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.Huffmancodes are the applications of _________ with minimal weighted external
path length obtained by an optimal set.
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.For analyzing an algorithm, which is better computing time?
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.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 17 of 30
Q-17.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 18 of 30
Q-18.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 19 of 30
Q-19.For 0/1 KNAPSACK problem, the algorithm takes ________ amount of time for
memory table, and ______time to determine the optimal load, for N objects and
W as the capacity of KNAPSACK.
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.Application of quicksort _________
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.Which of thefollowing sorting algorithm is of divide-and-conquer type?
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.The function f(n)=o(g(n)) if and only if Limit f(n)/g(n)=0n->∞
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.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 24 of 30
Q-24.O(1) means computing time is __________________
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.BFS is best compared to DFS in the case of ________________
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.Which is not in general criteria of algorithm
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.Which of the following is the collection of records of the entities in a given entity set?
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.Merge sort is _________.
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.Best case time complexity of binary search is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.LIFO mechanism is used in
Your Answer:Correct
Your Answer:Incorrect