ADA Module-1

What is the primary goal of analyzing an algorithm?

• • To determine its correctness

• To measure its efficiency in terms of time and space

• To ensure it is easy to implement

• To verify its usability

What is the time complexity of the Selection Sort algorithm?

• O(n)

• O(n²)

• O(nlogn)

• O(logn)

Which notation is used to describe the upper bound of an algorithm's running time?

• 
  Θ-notation

• Ω-notation

• O-notation

• None of the above

The best-case time complexity for Sequential Search is:

• O(n)

• O(1)

• O(logn)

• O(n²)

What does asymptotic analysis focus on?

• The exact runtime of an algorithm

• The input size for which the algorithm fails

• The growth rate of an algorithm's running time as input size increases

• The hardware efficiency during execution

Which sorting algorithm has the same worst-case and best-case time complexity?

• Selection Sort

• Quick Sort

• • Bubble Sort

• Merge Sort

What is the worst-case time complexity of Quicksort ?

• O(n)

• O(n²)

• O(nlogn)

• O(logn)

Which factor does not affect the efficiency analysis of an algorithm?

• Input size

• Programming language used

• Time complexity

• Space complexity

Which of the following best describes the purpose of analyzing algorithms?

• To determine the exact number of basic operations an algorithm performs

• To compare the efficiency of different algorithms

• To measure the physical resources consumed by an algorithm

• To implement the algorithm in a programming language

​Consider an algorithm with a time complexity of O(log₂ n). Which of the following scenarios best describes its behavior?

• The algorithm's execution time doubles as the input size doubles

• • The algorithm's execution time increases logarithmically as the input size increases​

• The algorithm's execution time remains constant regardless of the input size

• • The algorithm's execution time decreases as the input size increases​