Difference between revisions of "D1"
| Line 1: | Line 1: | ||
| − | [[D1 Algorithms|Algorithms]] | + | ==[[D1 Algorithms|Algorithms]]== |
| − | + | {{:D1 Algorithms}} | |
| − | [[D1 Critical Path Analysis|Critical Path Analysis]] | + | ==[[D1 Critical Path Analysis|Critical Path Analysis]]== |
| − | + | {{:D1 Critical Path Analysis}} | |
| − | [[D1 Linear Programming|Linear Programming]] | + | ==[[D1 Linear Programming|Linear Programming]]== |
| − | + | {{:D1 Linear Programming}} | |
| − | [[D1 Matchings|Matchings]] | + | ==[[D1 Matchings|Matchings]]== |
| − | + | {{:D1 Matchings}} | |
| − | [[D1 Networks|Networks]] | + | ==[[D1 Networks|Networks]]== |
| − | + | {{:D1 Networks}} | |
| − | [[D1 Route Inspection|Route Inspection]] | + | ==[[D1 Route Inspection|Route Inspection]]== |
| + | {{:D1 Route Inspection}} | ||
Revision as of 08:43, 18 June 2014
Contents
Algorithms
- Idea of an algorithm and implementation by flowchart
- Bin packing (first fit, first fit decreasing, full bin)
- Bubble sort
- Quick sort
- Binary search
Critical Path Analysis
- Modelling of a project by an activity network, from a precedence table
- Completion of precedence table for a given activity network
- Algorithm for finding the critical path
- Total float. Gantt (cascade) charts. Scheduling
Linear Programming
- Formulation of linear programming problems
- Solution of two variable linear programming problems by ruler or vertex methods
- Consideration of problems with integer solutions
Matchings
- Use of bipartite graphs for modelling matchings
- Complete matchings and maximal matchings
- Algorithm for obtaining a maximum matching
Networks
- The minimum connector (minimum spanning tree) problem
- Prim's algorithm (on graph or on matrix)
- Kruskal's algorithm
- Dijkstra's shortest path algorithm
Route Inspection
- Algorithm for finding the shortest route around a network, travelling along every edge at least once and ending at the start vertex. The network will have up to four odd nodes
