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.Binpackingproblem is the application of ____________
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.Worst case time complexity of binary search is ______________
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.___________ is the process of executing a correct program on data sets and
measuring the time and space it takes tocompute the results.
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.For defining the best time complexity, let f (n) = log n and g (n) = √n, _________
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.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 7 of 30
Q-7.The Average case occur in linear search algorithm
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.____________ is an algorithm design method that can be used when the solution
to a problem can be viewed as the result of a sequence of decisions
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.job sequencing with deadline is based on ____________method
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.Performance based criteria of algorithm , which has to do with its computing time is
_______________
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.The complexity of linear search algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.The complexity of linear search algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.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 14 of 30
Q-14.To represent hierarchical relationship between elements, which data structure is suitable?
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.The time complexity of the shortest path algorithm can be bounded by
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.Breadth first search
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.Dijkstra’s algorithm :
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.The optimal merge pattern is based on _________ method
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19.The Worst case occur in linear search algorithm when
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.LIFO mechanism is used in
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.Merge sort invented by _____________
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.O(n^2) means computing time is __________________
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.Testing of a program consists of 2 phases which are ______________________
and ____________
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.When we say an algorithm has a time complexity of O (n), what does it mean?
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.A binary tree can easily be converted into q 2-tree
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.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 27 of 30
Q-27.Which of the following is not a primitive data structure?
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.Which of the following operations combined record into different sorted files into a single sorted file?
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.The time factor when determining the efficiency of algorithm is measured by
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.The notation is __________ I. Symmetric.
II. Reflexive.
III. Transitive.
Your Answer:Correct
Your Answer:Incorrect