| MATH 214 |
CRN 525, 22 Points (2009 1/3) |
| Coordinator: |
Prof Geoff Whittle
|
| Lecturer: |
AProf Dillon Mayhew
|
| Prerequisites: |
MATH 114, (or QUAN 203). |
| Lectures: |
Mon Wed Fri 2-3 timetable |
| Tutorials: |
1 hour per week, to be arranged |
| Assignments: |
Weekly |
| Assessment: |
Either 70% final exam, 20% terms test and 10% assignments, or 100% final exam. |
| Textbook: |
Grimaldi, Ralph P., Discrete and Combinatorial Mathematics, 4th ed., Addison-Wesley, $85 approximately. |
| Prescription: |
Sets and logic, combinatorics, posets, lattices, Boolean algebras and circuits, recurrence relations, functions, algebraic structures, network flows, introduction to graph theory. |
| Description: |
The course introduces students to a range of techniques and structures in discrete mathematics. This is an area that is playing an increasingly important role in modern mathematics, so MATH214 adds value to any mathematics major. Discrete mathematics has fundamental applications in Computer Science and Operations Research. |
|
Home Page
|
