Analysis and Design of Algorithm MCQs Model Test Paper – I
1. The rules for performing arithmetic using Arabic numerals were originally known as ___.
2. The efficiency of algorithms depends upon ___, ___ and ___ consumption.
Ans. Speed, size, resources
3. An algorithm is considered as the cornerstone of ___.
Ans. Good programming
4. To analyze an algorithm is to determine the number of ___ necessary to execute it.
5. ___ algorithms are used to combine sets of elements to form a single set according to some criteria.
6. ___ is the expression of an algorithm in a programming language with all the language-specific codes.
7. An algorithm that invokes itself within the process is called ___.
Ans. Direct recursive
8. ___ is the method of expressing the upper bound of an algorithm’s running time.
Ans. Big – O
9. ___ is defined as the number of memory cells which an algorithm needs.
Ans. Space complexity
10. A ___ algorithm converts the solution to a simpler subproblem to arrive at the correct solution.
Ans. Simple recursive
11. A ___ algorithm simply tries all possibilities until a satisfactory solution is found.
Ans. Brute force
12. ___ algorithms are based on a depth-first recursive search.
13. A ___ is a set of data elements grouped together under one name.
Ans. Data structure
14. ___ data structure has all the elements of the same data type in it.
15. For ___ data structure, the memory is allocated at the compile time itself.
16. The ___ of an algorithm can be determined by calculating its performance.
17. ___ of an algorithm is the amount of time required by an algorithm to execute.
Ans. Time complexity
18. If an algorithm takes the least amount of time to execute a specific set of input then it is called ___ time complexity.
Ans. Best case
19. The method of calculating primitive operations produces a computational model called___.
Ans. Random assess machine
20. ___ describes how to count the maximum number of primitive operations an algorithm executes.
Ans. Counting primitive operations
21. ___ is more accurate than Big-Oh notation and Omega notation.
Ans. Theta notation
22. ___ asymptotic notation is simple notational convenience.
23. ___ depicts the running time between the upper bound and lower bound.
Ans. Theta notation
24. Tower of Hanoi is a ___ puzzle.
25. The time required to perform a step should always bound above by a ___.
26. ___ is of no importance between two operations for the algorithm’s basic operation.
27. ___ technique is used to perform an amortized analysis method based on a financial model.
Ans. Accounting method
28. If you can set up such a scheme called an amortization scheme then each operation in the series has an ___.
Ans. Amortised running time O(a)
29. ___ technique is used to perform an amortized analysis method based on an energy model.
Ans. Potential function method
30. The running time of the algorithm prefixAverages1 is ___.
31. The running time of the algorithm prefixAverages2 is ___.
32. In prefixAverages2 algorithm ___ is the time taken for initiating the variables.
33. Recursive procedure should define a ___ which is small enough to solve without using recursion.
Ans. Base case
34. ___ of the algorithm means analyzing the behaviour of the algorithm with a specific set of inputs.
Ans. Empirical analysis
35. We can measure the efficiency of algorithms using ___ and ___ methods.
Ans. Counters, system clocking
36. The ___ analysis of the algorithm makes it easy to study.
37. ___ is defined as a technique that uses images to convey information about algorithms.
Ans. Algorithm visualization
38. ___ visualization is the type of visualization that uses still images to illustrate the algorithm.
Ans. Static algorithm
39. ___ visualization is the type of visualization that uses animations to illustrate the algorithm. This is also known as algorithm animation.
Ans. Dynamic algorithm
40. ___ is defined as the process that refers itself to simplify a problem.
41. A value that satisfies the constraint is called a ___.
Ans. Feasible solution
42. ___ is a function that is associated with an optimization problem determining how good a solution is.
Ans. Objective function
43. The running time needed to determine whether a possible value of a feasible solution is O(n) and the time required to compute the objective function is also O(n) is ___.
44. Selection sort is one of the simplest and ___ sorting techniques.
45. Bubble sort has ___, best and average case run-time of O(n2).
46. ___ is the simplest sorting algorithm.
Ans. Bubble sort
47. ___ is also known as a linear search.
Ans. Sequential search
48. We program sequential search in an array by ___an index variable until it reaches the last index.
Ans. Stepping up
49. In this pseudocode implementation, we execute the ___ only after all list items are examined with none matching.
Ans. Last line
50. Exhaustive search implementation is more important than ___.
51. Exhaustive search algorithm gives the ___ for every candidate that is a solution to the given instance P.
52. Exhaustive search is typically used when the problem size is ___.
53. ___ need very few lines of code as it performs the same process again and again on different data.
Ans. Recursive algorithms
54. In the towers of Hanoi problem, if the numbers of disks is n, the number of steps will be___.
55. Unlike the merge sort, which breaks up its input elements according to their position in the array, quick sort breaks them according to their ___.
56. After the partition, if the pivot is inserted at the boundary between the ___ sub-arrays, it will be in its final sorted position.
Ans. Left and right
57. Binary search is an algorithm for identifying the position of an element in a ___ array.
58. Say if the following statement is true or false. To find a value in an unsorted array, we need to scan through only half the elements of an array.
59. Say if the following statement is true or false. The benefit of binary search is that its complexity depends on the array size logarithmically.
60. ___ methodology can solve most of the problems regarding binary trees.
Ans. Divide and Conquer
61. The three typical traversals: ___, ___, and ___ are the most important Divide and Conquer algorithms of binary trees.
Ans. Pre-order, in-order, post-order
62. Two kinds of traversal are ___ and ___.
Ans. Breadth-first traversal, depth-first traversal
63. At the expense of a slight increase in the number of additions, the strassen’s matrix multiplication algorithm will ___ the total number of multiplications performed.
64. The normal method of matrix multiplication of two n X n matrices takes ___ operators.
65. By Strassen’s matrix multiplication algorithm, two 2 X 2 matrices takes 2 only 7 multiplicators and ___ adders.
66. Mergesort is a perfect example of a successful application of the ___ and ___ methodology.
Ans. Divide, Conquer
67. ___ is a comparison-based sorting.
68. What are the three steps involved in mergesort?
Ans. Divide, recur, conquer
69. If the array has two or more cells, the algorithm calls the ___ method.
70. Decrease and conquer can be implemented by a ___ or ___ approach.
Ans. Top-down or Bottom-up
71. ___, ___ & ___ are three instances of the transform and conquer technique.
Ans. Instance simplification, problem reduction, representation change
72. Decrease and conquer is also known as ___ approach.
73. Decrease and conquer is a method by which we find a solution to a given problem based upon the ___ of a number of problems.
74. There are ___ major categories in insertion sort.
75. In insertion sort, the best case input is an array that is already ___.
Test Your IQ on Analysis and Design of Algorithms MCQs
Thanks for visiting our website, if you like the post on the Analysis and Design of Algorithm MCQs share it on social media. Link to download pdf file.