MPS VIVA

The efficiency of an algorithm may vary depending on factors such as the _______ of the input.

• a) Complexity

• b) Size

• c) Shape

• d) Formulation

The average-case time complexity of an algorithm is often determined by considering the average _______ of the algorithm over all possible inputs.

When analyzing recursive algorithms, the recurrence relation is used to:

• Describe the efficiency of the algorithm in terms of its worst-case scenario

  
  

• Define the base case of the recursion

•  Calculate the time complexity of the algorithm

  
  

• Determine the maximum depth of recursion

  
  

Which of the following statements about non-recursive algorithms is true?

Which of the following best describes the order of growth of an algorithm?

The Master Theorem provides a solution for recurrence relations of the form:

Which of the following algorithms is not suitable for sorting data in external memory (when the dataset is too large to fit into main memory)?

• Merge sort

• Quick sort

• Radix sort

• Bubble sort

Quick Sort is based on which divide-and-conquer strategy?

• Splitting the array into two halves

• Splitting the array into smaller subarrays

• Splitting the array into equal-sized segments

• Splitting the array into individual elements

Which algorithm is used to solve the all-pairs shortest path problem in a weighted graph?

• Bellman-Ford algorithm

• Floyd-Warshall algorithm

• Johnson's algorithm

• A* algorithm

Which problem-solving technique focuses on making locally optimal choices at each step?

• Dynamic programming

• Greedy technique

• Divide and conquer

• Brute force