^CSE2304^

# Tute 5, CSE2304, CSSE, Monash, Semester 1, 2002

## Group A: week 11, 20 - 24 May,

Group B: week 12, 27 - 31 May

**Class**:
Prepare your answers before the tute!

**Tutors**:
(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.

- Use
[Simpson's]
rule, with 2 intervals and 3 values,
to integrate numerically a curve through
(1,3), (2,3) and (3,5) between x=1 and x=3.

- Analytically integrate
x
^{2}-x+3 between x=0 and x=2.

- Draw an undirected, weighted graph
representing the following cities and the air-routes
between them flown by jet aircraft (as far as you know
or estimate):
London, Los Angeles,
New York, Rome, Singapore, Sydney, Tokyo.
- Find a minimum spanning tree of the cities
in
*your* graph using:
- (a) Kruskal's algorithm
- (b) Prim's algorithm.
- Find the shortest path from London to Tokyo
in
*your* graph using:
- (c) Dijkstra's algorithm.

© L. Allison 2002,
School of Computer Science and Software Engineering,
Monash University, Australia 3800.
Created with "vi (Linux & IRIX)", charset=iso-8859-1