ADA notes
UNIT 1 Algorithms: The Blueprint of Computer Science An algorithm is essentially a step-by-step procedure or set of rules designed to accomplish a specific task. It's the core of computer science, forming the foundation for everything from simple calculations to complex AI systems. Key Characteristics of Algorithms: Well-defined: Each step is clear and unambiguous. Finite: The algorithm must eventually terminate. Input: It takes zero or more inputs. Output: It produces at least one output. Effective: The steps are feasible and can be executed. Types of Algorithms: While there are countless algorithms, they can be categorized based on various criteria: By Design: Greedy Algorithms: Make locally optimal choices at each step, hoping for a global optimum. Dynamic Programming: Breaks down a problem into subproblems, solving them once and storing the results for reuse. Divide and Conquer: Divides a problem into smaller subproblems, solves them recursively, and combines the resu...