## Assessment 2

Will be held on the Friday of Week 11 (24 November), at 09:00 in B214 (the usual lecture venue). A sample has been emailed and I also have hard copies with me. I strongly advise you that attending the tutorial alone may not be sufficient preparation for this test so you may have to devote extra time outside classes to study.

## Week 10

In Week 10 explored Network Theory, or rather Graph Theory, in more depth. We looked at digraphs, connectedness, valency, walks, and trees.

## Week 11

We will finish our study of Graph Theory by looking at Eulerian graphs, Fleury’s Algorithm, Hamiltonian graphs, and Dirac’s Theorem. We will then begin the last chapter on recursion. We have our test on Friday

## Week 12

In Week 12 we will finish our study of recursion and perhaps do a little revision.

## Week 13

In Week 13, perhaps we will have five tutorials (normal rooms and times) of which you are invited to up to four (your own tutorial slot plus the up to three of the lecture slots).

## Study

Some students need to do extra work outside tutorials. Please feel free to ask me questions about the exercises via email or even better on this webpage.

## Student Resources

Anyone who is missing notes is to email me.

Please see the Student Resources tab on the top of this page for information on the Academic Learning Centre, etc. There are some excellent notes on Blackboard for MATH6055.

## Recent Comments