Scribd Logo
Upload

Welcome to Scribd!

  • 10 views

    Somashekhar R. Kothiwale Institute of Technology, Nipani: Vidya Samvardhak Mandal's

    Uploaded by

    lavanya
    The document contains an online class report from the Computer Science and Engineering department. It lists 5 topics covered by Professor Vidya Deshpande in her 18CS42 module, including divide and conquer, greedy methods like Dijkstra's and Knapsack algorithms, minimum spanning trees algorithms like Prim's and Kruskal's, Huffman trees and codes, and Heaps and Heap sort. Video links and additional materials were provided for each topic. Notes and remarks were also included.

    Copyright:

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

    You might also like

    Somashekhar R. Kothiwale Institute of Technology, Nipani: Vidya Samvardhak Mandal's

    Uploaded by

    lavanya
    10 views2 pages
    The document contains an online class report from the Computer Science and Engineering department. It lists 5 topics covered by Professor Vidya Deshpande in her 18CS42 module, including divide and conquer, greedy methods like Dijkstra's and Knapsack algorithms, minimum spanning trees algorithms like Prim's and Kruskal's, Huffman trees and codes, and Heaps and Heap sort. Video links and additional materials were provided for each topic. Notes and remarks were also included.

    Original Description:

    Original Title

    DAA.xlsx

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains an online class report from the Computer Science and Engineering department. It lists 5 topics covered by Professor Vidya Deshpande in her 18CS42 module, including divide and conquer, greedy methods like Dijkstra's and Knapsack algorithms, minimum spanning trees algorithms like Prim's and Kruskal's, Huffman trees and codes, and Heaps and Heap sort. Video links and additional materials were provided for each topic. Notes and remarks were also included.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xlsx, pdf, or txt
    10 views2 pages

    Somashekhar R. Kothiwale Institute of Technology, Nipani: Vidya Samvardhak Mandal's

    Uploaded by

    lavanya
    The document contains an online class report from the Computer Science and Engineering department. It lists 5 topics covered by Professor Vidya Deshpande in her 18CS42 module, including divide and conquer, greedy methods like Dijkstra's and Knapsack algorithms, minimum spanning trees algorithms like Prim's and Kruskal's, Huffman trees and codes, and Heaps and Heap sort. Video links and additional materials were provided for each topic. Notes and remarks were also included.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xlsx, pdf, or txt
    of 2

    Vidya Samvardhak Mandal’s

    Somashekhar R. Kothiwale Institute Of Technology, Nipani


    Nipani – 591 237, Dist: Belgaum, Karnataka State

    ONLINE CLASS REPORT NAME OF THE DEPARTMENT: Computer Science and Engineering
    Additional
    Sr Name of Subject Module Module Content as per lesson
    Sem Video Link/ self video online Notes Remarks
    No faculty Code No. plan
    material
    Advantages and Disadvantages of
    2 divide and conquer. Decrease and https://youtu.be/Ziubd1fcbXs
    Conquer Approach: Topological ü
    Sort.

    Greedy Method: General method


    Dijkstra's Algorithm https://www.youtube.com/watch?v=Ziubd1fcbXs&list=PLytG5E__yeCUNbD-pLmOoxRIW9el2B
    ü

    Knapsack Problem https://www.youtube.com/watch?v=3FTTtLvUQIM&list=PLytG5E__yeCUNbD-pLmOoxRIW9el


    ü

    Job sequencing with deadlines https://www.youtube.com/watch?v=Xw4U3cnEoxE&list=PLytG5E__yeCUNbD-pLmOoxRIW9e


    ü

    Prof. Vidya 4 18CS42


    Deshpande Minimum cost spanning trees:
    https://www.youtube.com/watch?v=bEhiTBKS7YU&list=PLytG5E__yeCUNbD-pLmOoxRIW9el2
    ü
    Prim’s Algorithm
    3

    Kruskal’s Algorithm https://www.youtube.com/watch?v=kgwZ_Wpr84g&list=PLytG5E__yeCUNbD-pLmOoxRIW9e


    ü

    Huffman Trees and Codes,Coin


    https://youtu.be/pcInRxiOJDM ü
    Change Problem

    https://youtu.be/P9ZVQsV5EdQ ü
    Heaps and Heap Sort
    1
    Heaps and Heap Sort
    1 https://youtu.be/P9ZVQsV5EdQ ü

    You might also like