Discrete Mathematics (Year 3) (U01607)

? Credit Points : 10 ? SCQF Level : 9 ? Acronym : MAT-3-DiM

Optional course for Honours Degrees involving Mathematics and/or Statistics. Syllabus summary: Graphs (bipartite, Euler, Hamiltonian, Planar), Euler's V-E+F=2 Theorem, subdivisions, Kuratowski's Theorem, matching, Hall's Marriage Theorem, assignment problems, counting sets, subsets, multisets, inclusion/exclusion, applications, Stirling numbers of second kind, Bell numbers, designs, Fisher's inequality, Steiner triple systems, error-correcting codes, minimum distance, binary linear codes, Hamming codes, Sphere-packing and sphere-covering bound.

Entry Requirements

? Pre-requisites : MAT-2-FoC, MAT-2-SVC, MAT-2-LiA, MAT-2-MAM

? Prohibited combinations : MAT-2-mi3, MAT-2-DiM, similar courses from Mathematics 3 (Hons) prior to 2004-05

Variants

? This course has variants for part year visiting students, as follows

Discrete Mathematics (Year 3)(VS1) (Semester 1 (Blocks 1-2))

Subject Areas

Home subject area

Specialist Mathematics & Statistics (Honours), (School of Mathematics, Schedule P)

Delivery Information

? Normal year taken : 3rd year

? Delivery Period : Semester 1 (Blocks 1-2)

? Contact Teaching Time : 2 hour(s) 30 minutes per week for 11 weeks

First Class Information

Date	Start	End	Room	Area	Additional Information
21/09/2006	15:00	15:50	Lecture Theatre A, JCMB	KB

All of the following classes

Type	Day	Start	End	Area
Lecture	Monday	15:00	15:50	KB
Lecture	Thursday	15:00	15:50	KB

? Additional Class Information : Tutorials: at times to be arranged.

Summary of Intended Learning Outcomes

The following are to be achieved at a higher level than for MAT-2-DiM; this will be assessed by a more demanding examination.

1. Ability to solve "counting" problems
2. Understanding of elements of Graph Theory
3. Ability to apply counting techniques and Graph Theory to problems in Engineering and Informatics