Details
This lesson is an introduction to a family of hard problems. They need an enormous amount of computational power, for the best available solution. Also, there are heuristic alternatives that offer good, but often not "optimal" solutions. A greedy algorithm,
follows the problem solving heuristic of making a locally optimal choice at each stage, finding a global optimum. In many problems, a greedy strategy does not, produce an optimal solution, nonetheless a greedy heuristic may yield locally optimal solutions
that approximate a global optimal solution with in a reasonable time. #greedy #algorithms
Objectives: To get to know and experiment with several known algorithms
Assessment: A simple three questions test
Resources: This lesson uses extensive java based demonstrations. OpenCourseware from NPTEL (India), Sheridan College, MIT, UC Berkeley, Stanford & many other of the World's finest University's.
Language: English
Professors: Javier Thayer, Don Brooks
Units: 13, Tests: 1
Lesson content
- Introduction
- Order projects by deadlines
- Minimum genetic tree
- Prim algorithm
- Adjoining Array
- Kruskal algorithm
- Prim algorithm
- Heuristic algorithms
- TSP (Travelling Salesman Problem)
- Dynamic programming
- Minimoum routes
- Dijkstra algorithm
- Floyd algorithm
- Backtracking
- General concepts test
Reviews
Be the first to write a review about this event.
Write a Review
World Mentoring Academy is offering FREE Open Courseware. Setup a free user account & select courses with video lectures, Syllabus, Free textbooks when avail., assignments/homework, testing from MIT, Harvard, UC Berkeley, Stanford, U of Mich, Yale along with many of the World's finest University's (700+courses/24-48+ Lectures)
Related Courses
Saylor Academy
World Mentoring Academy
Udacity
World Mentoring Academy
