JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B. Tech III Year DESIGN AND ANALYSIS OF ALGORITHMS Previous Question Paper (March - 2024 - R16)

Time complexity is a computational concept that quantifies the amount of time an algorithm takes to complete as a function of the length of the input. It provides a theoretical estimate of the growth rate of an algorithm's execution time rather than measuring the exact clock time, which depends on hardware and implementation details.

It is typically expressed using Asymptotic Notation, such as Big O notation, which describes the upper bound of the algorithm's running time. For an input size denoted by n, the time complexity represents the number of elementary operations performed by the algorithm.

This measure is crucial for evaluating the efficiency and scalability of an algorithm, allowing developers to predict how performance will degrade as the input size increases.

A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic. Unlike deterministic algorithms, which always produce the same output for a given input and follow a fixed sequence of operations, a randomized algorithm makes decisions based on random numbers generated during its execution.

Key characteristics and classifications include:

• Non-deterministic behavior: The running time or the output of the algorithm depends on the random choices made, meaning the performance can vary across different runs for the same input.
• Las Vegas Algorithms: These algorithms always produce the correct result, but their running time is a random variable. A classic example is Randomized QuickSort, where the pivot is chosen randomly to ensure an expected time complexity of
  O(n log n)
  regardless of the input distribution.
• Monte Carlo Algorithms: These algorithms have a deterministic running time, but there is a non-zero probability that the output may be incorrect. The probability of error can often be reduced to an arbitrarily small value by repeating the algorithm multiple times.

Randomized algorithms are frequently used to simplify complex problems, improve average-case performance, or break symmetry in distributed systems where deterministic approaches might suffer from worst-case scenarios.