Scribd Logo
Upload

Welcome to Scribd!

  • Amity - Mod-1 - L3 - Asymptotic Notation - Numerical

    Uploaded by

    Prajjwal Mehra
    3 views10 pages
    This document is a lecture on asymptotic notations like big O and big Omega for analyzing algorithms. It discusses numerical examples like writing tight asymptotic bounds for functions like n(n+1)/2, 2^n, n!, and √n. Students are given problems to check their understanding of analyzing runtime and determining asymptotic bounds for algorithms.

    Original Description:

    Original Title

    Amity_Mod-1_L3_Asymptotic Notation _Numerical

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document is a lecture on asymptotic notations like big O and big Omega for analyzing algorithms. It discusses numerical examples like writing tight asymptotic bounds for functions like n(n+1)/2, 2^n, n!, and √n. Students are given problems to check their understanding of analyzing runtime and determining asymptotic bounds for algorithms.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    3 views10 pages

    Amity - Mod-1 - L3 - Asymptotic Notation - Numerical

    Uploaded by

    Prajjwal Mehra
    This document is a lecture on asymptotic notations like big O and big Omega for analyzing algorithms. It discusses numerical examples like writing tight asymptotic bounds for functions like n(n+1)/2, 2^n, n!, and √n. Students are given problems to check their understanding of analyzing runtime and determining asymptotic bounds for algorithms.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 10

    Amity School of Engineering & Technology (CSE)

    Analysis and Design of Algorithm(ADA)

    Module-1[Lecture-2]
    Asymptotic Notations-Numerical
    O(Big-Oh), Ω (Big-Omega) and

     
    1
    Amity School of Engineering & Technology (CSE)

    OBJECTIVES
    After completing this section, you will be able to

     Differentiate between ,

     Numerical questions on .

     Check your progress on .

    2
    Amity School of Engineering & Technology (CSE)

    ) …

    • …,,,mm𝑛(𝑛+1)/2

    3
    Amity School of Engineering & Technology (CSE)

    ) …

    •  
    Example2:
    we can write

    4
    Amity School of Engineering & Technology (CSE)

    ) …

    •Example3:
     
    we can write

    Note: Both side not getting same function, so for n! , tight bound
    not possible, so we can write

    5
    Amity School of Engineering & Technology (CSE)

    ) …

    •Example4:
     
    we can write

    Note: Again, Both side not getting same function, so for , tight
    bound not possible, so we can write
    6
    Amity School of Engineering & Technology (CSE)

    Check your progress1:


    •  

    7
    Amity School of Engineering & Technology (CSE)

    Check your progress2


    •  

    8
    Amity School of Engineering & Technology (CSE)

    Check your progress3:


    •  

    9
    Amity School of Engineering & Technology (CSE)
    Check your progress4
    𝑛)/2

    10

    You might also like