Heritage University & Seminary | Stirring Hearts, Educating Minds

General description: This lesson is an introduction to a family of hard problems. These problems need an enormous amount of computational power if we seek for the best available solution.Alternatively, there are heuristic alternatives that offer good (but often not optimal) solutions.

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

Language: english

Professors: Professor Example

Total units: 14

Total tests: 1

Total projects: 1

Lesson content

Hide all / Show all

Introduction
Greed (and hill elevation)
Order projects by deadlines
Minimum genetic tree
- Prim algorithm
  - Adjoining Array
- Kruskal algorithm
Heuristic algorithms
- TSP (Travelling Salesman Problem)
Dynamic programming
Minimoum routes
- Dijkstra algorithm
- Floyd algorithm
Backtracking
General concepts test

Get the course "Test course 01", $200 / 12 Month(s)

This lesson is part of the courses: Test course 01



Sorry, but your browser needs to support iframes to see this