**Classes**

**Lectures:** you should attend both lectures on each of two days each week, making a total of four hours.

**Tutorials:** you should attend one 1-hour tutorial each week.

**Workshops:** the Numeracy Centre runs regular workshops for students in this unit.

**Required and Recommended Texts and/or Materials**

The designated text for DMTH137 is

RECOMMENDED READING

Many of the unit’s topics are covered (perhaps going to a deeper level) in other books, such as:

- Grimaldi,
*Discrete and Combinatorial Mathematics* (Addison-Wesley-Longman, 2003)
- RL Graham, DE Knuth, O Patashnik,
*Concrete mathematics: a foundation for computer science* (Addison-Wesley, 1994)
- WD Hillis,
*The pattern on the stone. The simple ideas that make computers work.* (Weidenfeld Nicolson, 1998)
- A Hodges,
*Alan Turing: the enigma* (Vintage, 1992)
- DR Hofstadter,
*Godel, Escher, Bach: an eternal braid* (The Harvester Press, 1979)
- DE Knuth,
*The art of computer programming – Fundamental algorithms* (Addison-Wesley, 1973)
- M Minsky,
*Computation: finite and infinite machines* (Prentice-Hall, 1967)
- S Singh,
*The Code Book* (Fourth Estate, 1999)
- CDH Cooper,
*Mathematics at the Edge of the Rational Universe*

These and similar texts are available in the Library.

**Technology Used and Required**

Students are expected to have access to an internet-enabled computer with a web browser and Adobe Reader software. Most areas of the university provide wireless access for portable devices. There are computers for student use in the Library.

**Difficulties with your home computer or internet connection do not constitute a reasonable excuse for lateness of, or failure to submit, assessment tasks. **