Pracs 5(A) and 5(B), CSE2304, CSSE, Monash, Semester 1, 2004

The [on-line] versions of the prac's may include [links], corrections and supplementary material and are to be taken as the reference documents. Check the on-line material regularly.

Candidate: You must prepare your solution to this programming exercise in advance (a 6pt subject => 12-hours work per week, every week). The designated platform, on which your solution must be demonstrated and on which it will be marked, is the `gcc' compiler running on `Linux'. If you develop a solution on another platform, it is your responsibility to ensure that it works correctly on the designated platform. Read the information under the [prac' guide], [on C and code modularity], [missed pracs] and [plagiarism] links on the [home page]. It is better to have a program that does only part of the prac' but compiles and runs rather than to have a more complex program that crashes or, even worse, does not compile. So keep copies of old working partial solutions.

Prac's are marked on the performance of your program and also on your understanding of the program. I.e. Perfect program with zero understanding => zero marks! ``Forgetting'' is not an acceptable explanation for lack of understanding. Unless otherwise noted, you must write all the code yourself, and may not use any external library routines, the usual I/O (e.g. printf) and mathematical (e.g. log) routines excepted.

NB. Remember that, from prac1, each week's prac' groups are set their own specific problems. Make sure that you do the correct problem for your prac'! You will get zero marks if you solve the wrong problem. The exam, and the prac' work, are both hurdles (half-marks) for the subject. If you fail one, or the other, or both, the highest mark that you can get for the subject is 44%(N).

Demonstrators are not obliged to mark programs that do not compile or that crash. Time allowing, they will try to help in tracking down errors, but they are not required to mark programs in such a state, particularly those that do not compile. Therefore keep backup copies of working partial-solutions (also see above).

Objectives: Graph algorithms.

Prac 5(A), week 12, 24-28 May 2004

[some data]

Starting with your program from prac4A, write a program

prac5a f1 f2 ... fn

to compute the [minimum spanning tree] of files,   f1 f2 ... fn,   for the symmetric adjacency matrix and graph as defined in [prac4A].

Print the minimum spanning tree in some simple, non-graphical way.

Marking

Prac 5(B), week 13, 31 May - 4 June 2004

[some data]

Starting with your program   prac4b t1 t2 ... tn

which computes the non-symmetric adjacency matrix and graph over   t1 t2 ... tn,   as defined in [prac4B],

write a program

prac5b t1 t2 ... tn

to compute the [shortest path] from t_i to t_j for all i and all j.

Print the shortest path (including the edges of the path and the length) from t_i to t_j for every i and every j.

Marking