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 08 (Year 2 Undergraduate) |
Credits |
10 |
Home subject area |
Mathematics |
Other subject area |
Specialist Mathematics & Statistics (Year 2) |
Course website |
http://student.maths.ed.ac.uk |
|
|
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. |
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: No |
Quota: 0 |
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 |
Week 1, Monday, 14:00 - 14:50, Zone: King's Buildings. JCMB, Lecture Theatre B |
Additional information |
Tutorials: one of Th 1500-1550, 1610-1700, Fr 1000-1050, 1110-1200 |
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%. |
Please see Visiting Student Prospectus website for Visiting Student Assessment information |
Special Arrangements
Not entered |
Contacts
Course organiser |
Dr Nikolaos Bournaveas
Tel: (0131 6)50 5063
Email: N.Bournaveas@ed.ac.uk |
Course secretary |
Mr Martin Delaney
Tel: (0131 6)50 6427
Email: Martin.Delaney@ed.ac.uk |
|
copyright 2010 The University of Edinburgh -
1 September 2010 6:17 am
|