JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech II DESIGN AND ANALYSIS OF ALGORITHMS Previous Question Paper (August/September - 2022 - R15)

Time Complexity is a measure of the amount of time an algorithm takes to run as a function of the length of the input. It is typically expressed using asymptotic notation, which describes the growth rate of the algorithm's running time as the input size approaches infinity.

The common notations used are:

• Big O Notation (O): Provides an asymptotic upper bound on the growth rate of a function, representing the worst-case time complexity.
• Omega Notation (Ω): Provides an asymptotic lower bound on the growth rate of a function, representing the best-case time complexity.
• Theta Notation (Θ): Provides an asymptotic tight bound, indicating that the function grows at the same rate as the given expression, representing the average-case complexity.
• Little o Notation (o): Represents an upper bound that is not asymptotically tight.
• Little omega Notation (ω): Represents a lower bound that is not asymptotically tight.

An algorithm is a finite, unambiguous, and step-by-step sequence of instructions designed to perform a specific task or solve a particular computational problem. It must satisfy properties such as input, output, definiteness, finiteness, and effectiveness.

The process of validating an algorithm involves ensuring that it correctly solves the intended problem and performs efficiently. This process consists of two primary stages:

1. Correctness Proof (Proving): This involves using mathematical techniques, such as induction or loop invariants, to formally demonstrate that the algorithm produces the correct output for every valid input.
2. Performance Analysis (Testing): This involves empirical testing and theoretical analysis. Testing includes executing the algorithm with various test cases (including boundary and edge cases) to verify output accuracy and identify runtime errors. Theoretical analysis involves determining the time and space complexity to ensure the algorithm meets resource constraints.