Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    AD8351 Cycle Test 2 QP

    Uploaded by

    Harul Ganesh S B
    Important Questions of DAA unit 3

    Copyright:

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

    AD8351 Cycle Test 2 QP

    Uploaded by

    Harul Ganesh S B
    7 views1 page
    Important Questions of DAA unit 3

    Original Title

    AD8351 Cycle test 2 QP

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Important Questions of DAA unit 3

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    7 views1 page

    AD8351 Cycle Test 2 QP

    Uploaded by

    Harul Ganesh S B
    Important Questions of DAA unit 3

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 1

    R.M.D.

    Engineering College
    (An Autonomous Institution)
    Department of Computer Science and Business Systems
    Academic year 2021-2022 - Odd Semester
    Subject Name: Design and Analysis of Algorithm Subject Code: AD8351
    Date of exam: 11.10.2021 Marks: 20

    Part A (2*2=4)

    1. What does dynamic programming have in common with divide-and-conquer? What is a principal
    difference between them? (CO3, K2)
    2. What is iterative deepening search (CO3, K1)

    PART B(1*6=6)

    3. i) Apply the bottom-up dynamic programming algorithm to the following instance of the knapsack
    problem: (CO3,K4)

    Item Weight Cost


    1 3 $25
    2 2 $20
    3 1 $15
    4 4 $40
    5 5 $50

    ii) Compute C(6,3) by applying the dynamic programming algorithm (2) (CO3 ,K3)
    (or)

    4. i) Explain in detail about state space approach(3) (CO3,K2)


    ii) Martix A of order 5*30, Matrix B of order 30*10 and matrix c of order 10*20 using dynamic
    programming compute the minimized matrix ordered chain(3) (CO3,K4)

    PART C ( 1*10=10)

    5. (i) Explain in detail about Floyd’s Algorithm for the All-Pairs Shortest-Paths Problem.(5)
    (CO3 ,K2)
    (ii) Apply Warshall’s algorithm to find the transitive closure of the digraph defined by the
    following adjacency matrix.(3) (CO3,K3)

    (ii)Compare and differentiate BFS & DFS(2) (CO3,K3)

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy