Scribd Logo
Upload

Welcome to Scribd!

  • School of Computer Science and Engineering Winter Semester-2020-21

    Uploaded by

    SHIVAM NARESHCHANDRA PATWA 20BCE0801
    8 views1 page
    The document provides instructions for Experiment 6 of the Data Structures and Algorithms Lab course. Students must implement heap sort to organize a sample input list, implement a priority queue using a max heap with their own inputs, and code Dijkstra's algorithm to find the shortest path from node A to F in a weighted graph G. They must hand write their aim, input, output, and results then scan it with screenshots of their code and output, and upload the final document to the student portal by the due date.

    Original Description:

    Original Title

    VL2020210507436_AST06

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document provides instructions for Experiment 6 of the Data Structures and Algorithms Lab course. Students must implement heap sort to organize a sample input list, implement a priority queue using a max heap with their own inputs, and code Dijkstra's algorithm to find the shortest path from node A to F in a weighted graph G. They must hand write their aim, input, output, and results then scan it with screenshots of their code and output, and upload the final document to the student portal by the due date.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    8 views1 page

    School of Computer Science and Engineering Winter Semester-2020-21

    Uploaded by

    SHIVAM NARESHCHANDRA PATWA 20BCE0801
    The document provides instructions for Experiment 6 of the Data Structures and Algorithms Lab course. Students must implement heap sort to organize a sample input list, implement a priority queue using a max heap with their own inputs, and code Dijkstra's algorithm to find the shortest path from node A to F in a weighted graph G. They must hand write their aim, input, output, and results then scan it with screenshots of their code and output, and upload the final document to the student portal by the due date.

    Copyright:

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

    School of Computer Science and Engineering

    Winter Semester-2020-21
    Course Code : CSE 2011
    Course: Data Structures and Algorithms Lab
    Class Number: VL2020210507437 / VL2020210507436
    Slot: L37+L38 / L23+L24

    Experiment-6
    Instructions:
    Step1: Aim, Sample input, Output and results must be hand written and then
    scanned.
    Step2: Coding and Output screenshot must be included.
    Step3: Prepare a document as instructed(conatins both step 1 and 2) and upload
    (Final Version) in VTOP student's log in on-time.

    1. Implement the Heap Sort to organize the following input using heap sort technique.
    6, 5, 3, 1, 8, 7, 2, 4

    2. Implement the priority queue using heap(Max heap) , assume own inputs.

    3. For the given weighted graph G=(V,E) Implement the coding for finding the shortest
    path from the source node A to node F in the graph G using Dijkstra’s Algorithm.

    You might also like