## Tuesday, 1st October 2002

### Applications

The above (badly drawn) ASCII diagram shows a traffic system. Traffic flows from A to B to C to D and back to A again, with new items flowing in to A, B and D at 10, 20 and 40 items per timeunit respectively. Items flow out of the system at point C at the rate of 70 items per timeunit. We assume that the flow in to each of the nodes on the system is equal to the flow out of that node.

[... 933 words]### Gauss Jordan Elimination

The steps of the Gauss-Jordan elimination process are as follows:

[... 870 words]