This course covers the Greedy Programming Approach, focusing on concepts, examples, and applications like the Fractional Knapsack problem and Prims Algorithm. Students will learn to implement these algorithms using Java. The teaching method includes theoretical explanations and practical coding sessions. This course is intended for individuals interested in algorithmic problem-solving and programming in Java.
Overview
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
