Undergraduate Course: Discrete Mathematics (Year 2) (MATH08010)
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 8 (Year 2 Undergraduate) |
Credits | 10 |
| Home subject area | Mathematics |
Other subject area | Specialist Mathematics & Statistics (Year 2) |
| Course website |
https://info.maths.ed.ac.uk/teaching.html |
Taught in Gaelic? | No |
| Course description | Optional second year course for Honours Degrees in 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. |
Information for Visiting Students
| Pre-requisites | None |
| Displayed in Visiting Students Prospectus? | Yes |
Course Delivery Information
|
| Delivery period: 2012/13 Semester 1, Available to all students (SV1)
|
WebCT enabled: Yes |
Quota: None |
| Location |
Activity |
Description |
Weeks |
Monday |
Tuesday |
Wednesday |
Thursday |
Friday |
| King's Buildings | Lecture | Th B, JCMB | 1-11 | | | 09:00 - 09:50 | | | | King's Buildings | Lecture | Th C, JCMB | 1-11 | | | | | 09:00 - 09:50 |
| First Class |
First class information not currently available |
| Additional information |
Tutorials: Th 1500 or 1610, Fri 1000 |
| Exam Information |
| Exam Diet |
Paper Name |
Hours:Minutes |
|
|
| Main Exam Diet S1 (December) | Discrete Mathematics | 2:00 | | | | Main Exam Diet S2 (April/May) | | 2:00 | | | | Resit Exam Diet (August) | | 2:00 | | |
Summary of Intended Learning Outcomes
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%. |
Special Arrangements
| None |
Additional Information
| Academic description |
Not entered |
| Syllabus |
Not entered |
| Transferable skills |
Not entered |
| Reading list |
Not entered |
| Study Abroad |
Not entered |
| Study Pattern |
Not entered |
| Keywords | DiM2 |
Contacts
| Course organiser | Dr Chris Smyth
Tel: (0131 6)50 5054
Email: |
Course secretary | Mr Martin Delaney
Tel: (0131 6)50 6427
Email: |
|
© Copyright 2012 The University of Edinburgh - 6 March 2012 6:16 am
|
University Homepage