Scribd Logo
Upload

Welcome to Scribd!

  • 24 views

    Design Analysis Algorithm Aug Sep2023

    Uploaded by

    Sherin Dorothy
    2023 question paper of ADA

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Design Analysis Algorithm Aug Sep2023

    Uploaded by

    Sherin Dorothy
    24 views2 pages
    2023 question paper of ADA

    Original Title

    Design_Analysis_Algorithm_Aug_Sep2023

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    2023 question paper of ADA

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    24 views2 pages

    Design Analysis Algorithm Aug Sep2023

    Uploaded by

    Sherin Dorothy
    2023 question paper of ADA

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    I llillilr llllr rlr ililt ilIfl ilfl fiil NP - 321

    3o
    lV Semester B.C.A, Examination, AugusUSeptember 2023

    4.2 :,",?ffi m ig: 1,"L n",* h m

    Time '.2Y2 Haurs Max. Marks:60

    Instruction : Answer all the Secfions.

    SECTION _ A
    $-d
    Answer any four questions. Each question carries two marks. (4x2=8)

    1. Define an algorithm and mention its characteristics.

    2. List efficiency classes used in analysis of algorithm.

    3. State the Brute-Force method.

    4. Define topological sorting with example.

    5. What is minimum cost spanning tree of a graph ? Give example.

    6. What are NP and NP complete problems ?

    SECTION * B

    Answer any four questions. Each question carries five marks. (4x5=20)

    7 " Explain the mathematical analysis of non-recursive algorithm with example.

    8. Write an algorithm to sort the array using bubble soft and obtain its time
    complexity.

    9. Explain Breadth first search with suitable example.

    10. Find the value of 8Cu using dynamic programming.

    P.T.O.
    I llllllll lllll lll lllll illll llll lllt
    NP - 321

    minimum cost spanning tree for the


    11. Apply Prim's algorithm to obtain the
    foltowing graPh' 1

    l2.Explainhorr+4-queen,sproblerncanbesolvedusingbacktracking.
    SECTION _ C
    question carries eight rnarks' (4x8=32)
    Answer any four questions. Each
    in detail'
    13. Exptain different asymptotic notations
    14. a) Discuss important problem types' (a+a)
    b) Explain empirical analysis of algorithm'
    matching algorithm'
    15. a) Discuss the Brute-Force string
    rs qvrrlv,
    and conquer method is apptied to - - the elements
    -- sort
    '- ! Exotain how decrease
    h) (A+a)
    of tfre array using insertion sott.'
    l6.Exptaindifferenttreetraversalatgorithmwithexample' graph'
    transitive closure of a directed
    17. write warshall algorithm to compute
    graph'
    Apply the same on the tollowing

    Knapsack problem
    what is Knapsack problem ? solve the following instance of
    18. p (40, 42,25' 12) and
    method *h*r. n - 4,In = 10, =
    using Branch-ano-'gound
    W = (4, 7, 5, 3).

    You might also like