Undergraduate Course: Discrete Mathematics (Year 3) (MATH09001)
Course Outline
School |
School of Mathematics |
College |
College of Science and Engineering |
Course type |
Standard |
Availability |
Available to all students |
Credit level (Normal year taken) |
SCQF Level 09 (Year 3 Undergraduate) |
Credits |
10 |
Home subject area |
Mathematics |
Other subject area |
Specialist Mathematics & Statistics (Honours) |
Course website |
http://student.maths.ed.ac.uk |
|
|
Course description |
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. |
Course Delivery Information
|
Delivery period: 2010/11 Semester 1, Available to all students (SV1)
|
WebCT enabled: Yes |
Quota: None |
Location |
Activity |
Description |
Weeks |
Monday |
Tuesday |
Wednesday |
Thursday |
Friday |
No Classes have been defined for this Course |
First Class |
First class information not currently available |
Additional information |
Tutorials: one of Th 1500-1550, 1610-1700, Fr 1000-1050, 1110-1200
|
|
Delivery period: 2010/11 Semester 2, Available to all students (SV1)
|
WebCT enabled: Yes |
Quota: None |
Location |
Activity |
Description |
Weeks |
Monday |
Tuesday |
Wednesday |
Thursday |
Friday |
King's Buildings | Lecture | | 1-11 | 14:00 - 14:50 | | | | | King's Buildings | Lecture | | 1-11 | | | | 14:00 - 14:50 | |
First Class |
First class information not currently available |
Additional information |
Tutorials: one of Th 1500-1550, 1610-1700, Fr 1000-1050, 1110-1200
|
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
|
Assessment Information
Coursework: 15%; Degree Examination: 85%.
|
Please see Visiting Student Prospectus website for Visiting Student Assessment information |
Special Arrangements
Not entered |
Contacts
Course organiser |
Dr Adri Olde-Daalhuis
Tel: (0131 6)50 5992
Email: A.OldeDaalhuis@ed.ac.uk |
Course secretary |
Mrs Katherine Mcphail
Tel: (0131 6)50 4885
Email: k.mcphail@ed.ac.uk |
|
copyright 2010 The University of Edinburgh -
1 September 2010 6:17 am
|