1. What is the primary goal of algorithm analysis?

• To optimize code length

• To improve code readability

• To determine algorithm efficiency

• To reduce memory usage

1. Which of the following is a characteristic of an algorithm?

• Finite input size

• Infinite loop

• Well-defined output

• No clear termination

1. What does Big O notation represent?

• Best-case scenario

• Average-case scenario

• Worst-case scenario

• Exact running time

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

• Big O

• Big Ω

• Big Θ

• Big σ

1. What does Big Θ notation represent?

• Upper and lower bounds

• Only upper bound

• Only lower bound

• Average-case scenario

1. What is the time complexity of a simple for loop?

• O(n)

• O(n^2)

• O(log n)

• O(1)

1. How do you analyze the time complexity of a non-recursive algorithm?

• Using recursion tree method

• Using master theorem

• Counting basic operations

• Using substitution method

1. What is the time complexity of a recursive algorithm with two recursive calls?

• O(n)

• O(n^2)

• O(2^n)

• O(log n)

1. Which method is used to analyze recursive algorithms?

• Substitution method

• Recursion tree method

• Iteration method

• All of the above

1. What is the time complexity of the Floyd-Warshall algorithm for finding shortest paths in a weighted graph?

• O(n^2)

• O(n^3)

• O(n^4)

• O(2^n)