Senior: Topological Sort Section A
| Basic Requirements | ||
| Instructions to run program were adequate | 5 |
|
| Title, names and team number are printed at beginning of program | 5 |
|
| Does it ask for another run? | 5 |
|
15 |
||
| Minimal Functionality | ||
| Does it accept tasks and dependencies | 5 |
|
| Does it stop taking tasks and move to the calculation when done (or equivalent?) | 5 |
|
| When it prints the levels, does it print the same tasks as were entered (i.e., it shouldn’t miss any and it shouldn’t include any more than once – check while doing the test suite) | 10 |
|
20 |
||
| Test Suite a:b means that ‘a’ depends on ‘b’. Enter this in whatever way the program requires. The default is to enter "Done" after the last dependency, but different programs may have different methods. |
||
| a:b, b:c, c:d à Level 1: d, Level 2: c, Level 3: b, Level 4: a | 10 |
|
| a:b, a:c, b:d, d:f, e:f, c:e à Level 1: f, Level 2: d e, Level 3: b c, Level 4: a | 15 |
|
| f:e, f:b, e:d, d:c, c:a, b:a à Level 1: a, Level 2: b c, Level 3: d, Level 4: e, Level 5: f | 15 |
|
40 |
||
| Error checking and misc. points | ||
| a:a à Indication that this is impossible to calculate or that a cycle exists | 10 |
|
| <Nothing> à Should not crash | 5 |
|
| Extra creativity and completeness | 10 |
|
25 |
||
| Grand Total | 100 |
S
Last Modified:- 1999, February 11, 03:38 PM by M. Smith