Scribd Logo
Upload

Welcome to Scribd!

  • 22 views

    Assignment 2 (BCSE6) : Q1) Write A Short Note For The Following

    Uploaded by

    Abidullah
    This document contains instructions for an assignment involving algorithms. It asks the student to write short notes on divide and conquer, dynamic programming, and greedy approaches. It also asks the student to find the minimum spanning tree using Prim's algorithm and to sort a given list using heap sort.

    Copyright:

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

    Assignment 2 (BCSE6) : Q1) Write A Short Note For The Following

    Uploaded by

    Abidullah
    22 views1 page
    This document contains instructions for an assignment involving algorithms. It asks the student to write short notes on divide and conquer, dynamic programming, and greedy approaches. It also asks the student to find the minimum spanning tree using Prim's algorithm and to sort a given list using heap sort.

    Original Title

    COMPABTech68704kDeskAP__Assignment 2__on__Assignment 2

    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 instructions for an assignment involving algorithms. It asks the student to write short notes on divide and conquer, dynamic programming, and greedy approaches. It also asks the student to find the minimum spanning tree using Prim's algorithm and to sort a given list using heap sort.

    Copyright:

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

    Assignment 2 (BCSE6) : Q1) Write A Short Note For The Following

    Uploaded by

    Abidullah
    This document contains instructions for an assignment involving algorithms. It asks the student to write short notes on divide and conquer, dynamic programming, and greedy approaches. It also asks the student to find the minimum spanning tree using Prim's algorithm and to sort a given list using heap sort.

    Copyright:

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

    Assignment 2 (BCSE6)

    Q1) Write a short note for the following:

    a. Divide and conquer technique


    b. Dynamic Programming
    c. Greedy Approach

    Q2) Find the minimum spanning tree by applying Prim’s algorithm

    Q3) Sort the given list using Heap sort algorithm:

    12 4 8 13 3 10 7

    You might also like