Greedy Programming in Java

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!

Grab it

Explore the Greedy Programming approach in Java through this comprehensive video tutorial. Learn key concepts, compare greedy programming to dynamic programming, and dive into practical applications like the Fractional Knapsack problem and Prim's Algorithm for minimal spanning trees. Gain hands-on experience with Java implementations and understand when to apply greedy techniques effectively. Master this powerful problem-solving strategy to optimize your programming skills and tackle complex algorithmic challenges.

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.