Scribd Logo
Upload

Welcome to Scribd!

  • DAA 1 Assignment

    Uploaded by

    nina
    6 views2 pages
    The document discusses various algorithm design and analysis topics such as defining algorithms, asymptotic notations, analyzing time complexity of non-recursive algorithms, defining data structures like weighted graphs and dictionaries, solving recursive relations, proving time complexities, defining algorithm specifications, explaining problem types, discussing fundamental data structures, and representing algorithms.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses various algorithm design and analysis topics such as defining algorithms, asymptotic notations, analyzing time complexity of non-recursive algorithms, defining data structures like weighted graphs and dictionaries, solving recursive relations, proving time complexities, defining algorithm specifications, explaining problem types, discussing fundamental data structures, and representing algorithms.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views2 pages

    DAA 1 Assignment

    Uploaded by

    nina
    The document discusses various algorithm design and analysis topics such as defining algorithms, asymptotic notations, analyzing time complexity of non-recursive algorithms, defining data structures like weighted graphs and dictionaries, solving recursive relations, proving time complexities, defining algorithm specifications, explaining problem types, discussing fundamental data structures, and representing algorithms.

    Copyright:

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

    1.

    Defi
    neal
    gor
    ithm?Expl
    ainst
    epsi
    nvol
    vedi
    nal
    gor
    it
    hm desi
    gnandanal
    ysi
    spr
    ocess
    wit
    hneatdi
    agram

    2.Di
    scussv
    ari
    ousAsy
    mpt
    oti
    cNot
    ati
    ons

    3.Li
    stSt
    epsi
    nvol
    vedi
    nanal
    ysi
    ngt
    het
    ime ef
    fi
    ciencyofnon-r
    ecur
    siv
    eal
    gor
    it
    hms

    4.Def
    inef
    oll
    owi
    ng:

    a)Wei
    ght
    edgr
    aphs

    b)Connect
    edgr
    aphs

    c) Or
    der
    edt
    rees

    d)Di
    cti
    onar
    y

    5.Sol
    ver
    ecur
    siv
    erel
    ati
    onanddr
    awat
    reeofr
    ecur
    siv
    ecal
    l
    sfort
    owerofHonai
    probl
    em

    6.Pr
    ove3n2+2n2=O(
    n3)and3n!=O(
    2n)

    7.Outl
    i
    neanal gor
    it
    hm t
    ofi
    ndt
    hemaxi
    mum ofnel
    ement
    sandobt
    aini
    tst
    ime
    complexi
    ty

    8.Pr
    ovet
    het
    hroem

    I
    ff1(
    n)ԐO(
    g,n)andf
    2(n)Ԑ0(
    g2(
    n))t
    henf
    1(n)
    +f2(
    n)ԐO(
    max{
    g1(
    n),
    g2¬(
    n)}
    .

    9.Def
    ineal
    gor
    it
    hm wi
    thspeci
    fi
    cat
    ionsf
    orwr
    it
    ingal
    gor
    it
    hms

    10.Expl
    ainpr
    obl
    em t
    ypes

    a)Sequenci
    ng b)Sor
    ti
    ngc)Combi
    nat
    ori
    alpr
    obl
    ems

    11.Di
    scussf
    undament
    aldat
    ast
    ruct
    ures

    12.Wr
    itet
    heal
    gori
    thmstofi
    nduniquenessofelement
    sinanarr
    ayedgi
    vet
    he
    mat
    hemat
    ical
    anal
    ysi
    softhi
    snonrecursi
    vealgor
    it
    hmswi t
    hsteps

    13.Di
    scussaboutt
    hei
    mpor
    tantpr
    obl
    em t
    ypesandf
    undament
    al
    dat
    ast
    ructur
    es.

    14.Discussadj
    acencymat
    ri
    xandadj
    acencyl
    i
    str
    epr
    esent
    ati
    onof
    graphwithanexample

    15.Designanal gori
    thm tosearchanel ementi nanarrayusi
    ng
    sequenti
    alsearch.DiscusstheBestcasewor stcaseandav erage
    caseeffi
    ciencyofthisalgori
    thm
    16.Whatar ethecr i
    teri
    at hatanal gori
    thm mustsat isf
    y?
    17.Explai
    nt hegener alpl
    anf oranalyzingtheef f
    ici
    encyofa
    recursi
    vealgorithm.Wr i
    tetheal gori
    thm tofindaf actor
    ial
    ofa
    givennumber .Deriveit
    sef fi
    ciency
    18.Expl
    ainpr
    inci
    pal
    way
    sofr
    epr
    esent
    ingt
    heal
    gor
    it
    hms?

    You might also like