The Most Addictive Python and SQL Courses
Master Windows Internals - Kernel Programming, Debugging & Architecture
Overview
Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This introductory course explains greedy programming and contrasts it with dynamic programming. It applies the approach to fractional knapsack and minimal spanning trees, including Java implementations.
Syllabus
Agenda for the session.
Introduction to Greedy Programming.
Examples of Greedy Programming.
Greedy Programming Vs Dynamic Programming.
Fractional Knapsack Problem.
Implementation of Fractional Knapsack using Java.
Prims Minimal Spanning Tree.
Kruskal's Minimal Spanning Tree.
Prims MInimal Spanning Tree in Java - Codes.
Summary.
Taught by
Great Learning