Tute 4, CSE2304, CSSE, Monash, Semester 1, 2002
Group A: week 9, 6 - 10 May,
Group B: week 10, 13 - 17 May
Prepare your answers before the tute!
(i) The purpose of the tutorials is not to solve the prac's!
(ii) The purpose of the tutorials is to check answers, and
to discuss particular sticking points, not to simply make answers available.
It will only be possible to cover all questions if the
class has prepared them all in advance.
Provided that the tute has been well prepared,
the tutor may lead a general discussion on graphs
and the current prac'.
- Draw a graph (vertices and edges) representing
at least eight buildings on the University campus
and paths or roads between them.
Should the graph be
- completely connected?
- Draw a graph representing eight CSE subjects,
including the 1st and 2nd year programming subjects.
Draw an edge from p to q if p is a pre-requisite for q.
- Are there / should there be cycles in the graph?
- What is the minimum number of semesters
required to take all of the subjects in your graph?
© L. Allison 2002,
School of Computer Science and Software Engineering,
Monash University, Australia 3800.
Created with "vi (Linux & IRIX)", charset=iso-8859-1