Show/hide contentOpenClose All
Curricular information is subject to change
On completion of this module the student should be able to demonstrate an adeptness with structures and concepts in discrete mathematics; solve enumeration problems related to these discrete structures; demonstrate a proficiency with the theory of partially ordered sets; state and prove results in discrete mathematics; solve a variety of problems in discrete mathematics such as characterisation theorems and recursive decompositions.
Indicative Module Content:Principles and techniques of counting; discrete structures that include graphs, words, permutations, and lattice paths; recursion and generating functions; the theory of partially ordered sets; Young tableaux and the RSK Correspondence; permutation statistics and permutation patterns.
Student Effort Type | Hours |
---|---|
Lectures | 24 |
Tutorial | 11 |
Specified Learning Activities | 30 |
Autonomous Student Learning | 50 |
Total | 115 |
The student should already have a solid foundation university-level mathematics and have completed some level 1 or 2 modules related to algebra, analysis, or elementary discrete mathematics. In particular, the student should not be unfamiliar with producing and writing mathematics proofs.
Description | Timing | Component Scale | % of Final Grade | ||
---|---|---|---|---|---|
Not yet recorded. |
Resit In | Terminal Exam |
---|---|
Spring | Yes - 2 Hour |
• Group/class feedback, post-assessment
Not yet recorded.