Scribd Logo
Upload

Welcome to Scribd!

  • Design and Analysis of Algorithms

    Uploaded by

    Paresh Patil
    7 views1 page
    This document outlines topics covered in a course on design and analysis of algorithms. It introduces basics of algorithms and mathematics, asymptotic notation for analyzing algorithms, divide and conquer algorithms including binary search and merge sort, and greedy algorithms such as activity selection, minimum spanning trees, shortest paths, knapsack problem and job scheduling.

    Original Description:

    Original Title

    Daa

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document outlines topics covered in a course on design and analysis of algorithms. It introduces basics of algorithms and mathematics, asymptotic notation for analyzing algorithms, divide and conquer algorithms including binary search and merge sort, and greedy algorithms such as activity selection, minimum spanning trees, shortest paths, knapsack problem and job scheduling.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views1 page

    Design and Analysis of Algorithms

    Uploaded by

    Paresh Patil
    This document outlines topics covered in a course on design and analysis of algorithms. It introduces basics of algorithms and mathematics, asymptotic notation for analyzing algorithms, divide and conquer algorithms including binary search and merge sort, and greedy algorithms such as activity selection, minimum spanning trees, shortest paths, knapsack problem and job scheduling.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Design and Analysis of Algorithms

    1. Basics of Algorithms and Mathematics:


    What is an algorithm?, Mathematics for Algorithmic Sets, Functions and Relations, Vectors and Matrices, Linear Inequalities and Linear Equations.

    2. Analysis of Algorithm:
    Asymptotic Notation Derive O,, . Analyzing control statement Sorting algorithms (insertion sort)

    3. Divide and Conquer Algorithm:


    Introduction, Multiplying large Integers Problem, Problem Solving using divide and conquer algorithm - Binary Search, Merge-sort, general template of divide & conquer

    4. Greedy Algorithm
    General Characteristics of greedy algorithms, Problem solving using Greedy Algorithm- Activity selection problem, Elements of Greedy Strategy, Minimum Spanning trees (Kruskals algorithm, Prims algorithm), Graphs: Shortest paths, The Knapsack Problem, Job Scheduling Problem.

    You might also like