Scribd Logo
Upload

Welcome to Scribd!

  • (Autonomous) : Bapatla Engineering College::Bapatla

    Uploaded by

    siva1987d
    5 views6 pages
    This document contains an assignment from the Department of IT at Bapatla Engineering College for students in class 4/4 IT Section-A. The assignment, dated September 24, 2014, includes writing algorithms to solve six problems: finding the shortest path in a graph, finding the best matrix chain multiplication, solving the travelling salesman problem using dynamic programming, solving the N-queens problem using backtracking, solving the 0/1 knapsack problem using backtracking, and finding bi-connected components in a graph.

    Original Description:

    DAA Assignment

    Original Title

    DAA Assignment2

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains an assignment from the Department of IT at Bapatla Engineering College for students in class 4/4 IT Section-A. The assignment, dated September 24, 2014, includes writing algorithms to solve six problems: finding the shortest path in a graph, finding the best matrix chain multiplication, solving the travelling salesman problem using dynamic programming, solving the N-queens problem using backtracking, solving the 0/1 knapsack problem using backtracking, and finding bi-connected components in a graph.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    5 views6 pages

    (Autonomous) : Bapatla Engineering College::Bapatla

    Uploaded by

    siva1987d
    This document contains an assignment from the Department of IT at Bapatla Engineering College for students in class 4/4 IT Section-A. The assignment, dated September 24, 2014, includes writing algorithms to solve six problems: finding the shortest path in a graph, finding the best matrix chain multiplication, solving the travelling salesman problem using dynamic programming, solving the N-queens problem using backtracking, solving the 0/1 knapsack problem using backtracking, and finding bi-connected components in a graph.

    Copyright:

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

    BAPATLA ENGINEERING COLLEGE::BAPATLA

    (Autonomous)
    Department of IT

    Assignment-II

    Sub: DAA(IT414)
    Class: 4/4 IT Section-A
    1)Write the algorithm to find shortest path in a graph.

    Date: 24-09-2014 .

    BAPATLA ENGINEERING COLLEGE::BAPATLA

    (Autonomous)
    Department of IT

    Assignment-II

    Sub: DAA(IT414)
    Class: 4/4 IT Section-A

    Date: 24-09-2014 .

    2)Write an algorithm to find the best combination of matrix chain multiplication

    ..

    BAPATLA ENGINEERING COLLEGE::BAPATLA

    (Autonomous)
    Department of IT

    Assignment-II

    Sub: DAA(IT414)
    Class: 4/4 IT Section-A

    Date: 24-09-2014 .

    3) write an algorithm to solve Travelling salesman problem using dynamic programming.

    BAPATLA ENGINEERING COLLEGE::BAPATLA

    (Autonomous)
    Department of IT

    Assignment-II

    Sub: DAA(IT414)
    Class: 4/4 IT Section-A
    4)Write an algorithm to solve N-queens problem using Backtracking

    Date: 24-09-2014 .

    BAPATLA ENGINEERING COLLEGE::BAPATLA

    (Autonomous)
    Department of IT

    Assignment-II

    Sub: DAA(IT414)
    Class: 4/4 IT Section-A

    Date: 24-09-2014 .

    5)Write an algorithm to solve 0/1 knapsack problem using Backtracking approach

    BAPATLA ENGINEERING COLLEGE::BAPATLA

    (Autonomous)
    Department of IT

    Assignment-II

    Sub: DAA(IT414)
    Class: 4/4 IT Section-A

    Date: 24-09-2014 .

    6)Write an algorithm to find Bi-Connected components in a graph.

    You might also like