Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 342 views

    DAA Lab File

    Uploaded by

    ashsingh536
    This document contains information about the Design and Analysis of Algroithm Lab course for B.Tech students at Krishna Engineering College. It includes the course outcomes, which are to implement various algorithm approaches like iterative, divide and conquer, greedy, dynamic programming, backtracking, and branch and bound. It also includes a list of 10 practical assignments involving algorithms like heap sort, merge sort, knapsack problem, traveling salesman problem, and minimum spanning tree.

    Copyright:

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

    DAA Lab File

    Uploaded by

    ashsingh536
    342 views3 pages
    This document contains information about the Design and Analysis of Algroithm Lab course for B.Tech students at Krishna Engineering College. It includes the course outcomes, which are to implement various algorithm approaches like iterative, divide and conquer, greedy, dynamic programming, backtracking, and branch and bound. It also includes a list of 10 practical assignments involving algorithms like heap sort, merge sort, knapsack problem, traveling salesman problem, and minimum spanning tree.

    Original Description:

    Aktu notes

    Original Title

    DAA lab file

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains information about the Design and Analysis of Algroithm Lab course for B.Tech students at Krishna Engineering College. It includes the course outcomes, which are to implement various algorithm approaches like iterative, divide and conquer, greedy, dynamic programming, backtracking, and branch and bound. It also includes a list of 10 practical assignments involving algorithms like heap sort, merge sort, knapsack problem, traveling salesman problem, and minimum spanning tree.

    Copyright:

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

    DAA Lab File

    Uploaded by

    ashsingh536
    This document contains information about the Design and Analysis of Algroithm Lab course for B.Tech students at Krishna Engineering College. It includes the course outcomes, which are to implement various algorithm approaches like iterative, divide and conquer, greedy, dynamic programming, backtracking, and branch and bound. It also includes a list of 10 practical assignments involving algorithms like heap sort, merge sort, knapsack problem, traveling salesman problem, and minimum spanning tree.

    Copyright:

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

    Design and Analysis of Algroithm Lab

    (KCS-553)

    B.Tech ( Session 2021-22)


    Odd Semester

    Student Name:-
    Roll no.:-
    Branch & Section:-
    Faculty Incharge:-

    Department of Computer Science and Engineering KRISHNA


    ENGINEERING COLLEGE
    95, Loni Road, Mohan Nagar, Ghaziabad (Uttar Pradesh), Pin-
    201007
    Course Outcomes of Design and Analysis of Algroithm Lab
    (KCS-553)

    1. Implement algorithm to solve problems by iterative approach.

    2. Implement algorithm to solve problems by divide and conquer approach.

    3. Implement algorithm to solve problems by Greedy algorithm approach.

    4. Implement algorithm to solve problems by Dynamic programming,


    backtracking, branch and bound approach.

    5. Implement algorithm to solve problems by branch and bound approach.

    KRISHNA ENGINEERING COLLEGE


    Department of Computer Science & Engineering List of
    Practical’s
    Design and Analysis of Algroithm Lab
    (KCS-553)
    S. No. Name of Practical Date Grade Signature
    1 Program for Heap Sort

    2 Program for Merge Sort

    3 Program for Selection Sort

    4 Program for Insertion Sort

    5 Program for Quick Sort

    6 Knapsack Problem using Greedy Solution

    7 Perform Travelling Salesman Problem

    8 Find Minimum Spanning Tree using Kruskal's


    Algorithm

    9 Implement N Queen Problem using


    Backtracking

    10 Find Minimum Cost Spanning Tree of a given


    connected undirected graph using Kruskal's
    algorithm. Use Union-Find algorithms in your
    program.

    You might also like