Design and Analysis of Algorithm Quiz

CO1 : Which of the following is NOT a step in algorithmic problem-solving?

• Understanding the problem

• Designing the algorithm

• Choosing a programming language

• Testing the algorithm

CO1 : An algorithm must have the following characteristics EXCEPT:

• Finiteness

• Definiteness

• Infiniteness

• Input

CO1 : Which of the following is an example of a divide-and-conquer algorithm?

• Binary Search

• Greedy Algorithm

• Bellman-Ford Algorithm

• Breadth-First Search

CO1 :In algorithm analysis, what is typically used to measure an algorithm's time complexity?

• Number of lines in the program

• Number of variables used

• Number of basic operations as a function of input size

• Time taken to compile the program

CO1 : Space complexity of an algorithm is concerned with:

• The amount of disk space required

• The number of input variables

• The amount of memory required by the algorithm

• The size of the output

CO 1 Which asymptotic notation is used to describe the upper bound of an algorithm's time complexity?

• O (Big-O)

• Ω (Omega)

• Θ (Theta)

• π (Pi)

Which of the following is the correct hierarchy in terms of asymptotic growth rates (smallest to largest)?

• O(1) < O(log n) < O(n) < O(n log n) < O(n^2)

• O(log n) < O(1) < O(n) < O(n log n) < O(n^2)

• O(n^2) < O(n) < O(log n) < O(n log n)

• O(n log n) < O(n) < O(1) < O(log n)

CO 1 : In recursive algorithms, what is a base case?

• The simplest instance of the problem where the solution is known

• The recursive function call itself

• The case where recursion stops but the solution is not yet found

• The most complex instance of the problem

CO 1 : For a recursive function calculating the factorial of n, what is the first recursive call made for n = 5?

• fact(5)

• fact(4)

• fact(3)

• fact(2)

CO 1 : What is the time complexity of the recursive factorial algorithm?

• O(n^2)

• O(log n)

• O(n)

• O(2^n)