VTU Notes | 18CS42 | Design and Analysis of Algorithms.

Greedy Technique

Module 3

  • 4.9
  • 2018 Scheme | CSE Department

18CS42 | Design and Analysis of Algorithms. Module 3 VTU Notes

Greedy Method:General method, Coin Change Problem, Knapsack Problem, Job sequencing with deadlines 

Minimum cost spanning trees: Prim’s Algorithm, Kruskal’s Algorithm

Single source shortest paths: Dijkstra's Algorithm 

Optimal Tree problem: Huffman Trees and Codes .

Transform and Conquer Approach: Heaps and Heap Sort

Powered by Froala Editor

Course Faq



Admin 1 year ago

Upcomming Updates of the AcquireHowTo

  • -- CGPA/SGPA Calculator with University Filter.
  • -- Student Projects Guide and Download.
  • -- Article Publishing platform for different categories.
  • -- Courses for students on different topics.
  • -- Student Dashboard for AcquireHowTo Products.
  • -- Online Portal to buy Minor Projects and Major Projects.
  • -- Last year Exams Question paper .
  • These all updates are comming soon on our portal. Once the updates roll out you will be notified.

© copyright 2021 AcquireHowTo