Show/hide contentOpenClose All
Curricular information is subject to change
Upon successful completion of this module, students will have a good understanding of important mathematical concepts such as permutations, urn models, and advanced counting principles. Applications of these ideas that are prevalent in mathematical computer science include ordered and unordered selections of objects out of a set. Students will have a concrete understanding of important counting principles and standard techniques including the use of generating functions and cycle indices of symmetry groups.
Student Effort Type | Hours |
---|---|
Lectures | 24 |
Practical | 12 |
Specified Learning Activities | 40 |
Autonomous Student Learning | 40 |
Total | 116 |
MATH10210 Discrete Mathematics for Computer Scientists I
Description | Timing | Component Scale | % of Final Grade | ||
---|---|---|---|---|---|
Continuous Assessment: Homework/Tutorial/Webwork/Midterm | Varies over the Trimester | n/a | Standard conversion grade scale 40% | No | 30 |
Examination: End of Semester Examination | 2 hour End of Trimester Exam | No | Standard conversion grade scale 40% | No | 70 |
Resit In | Terminal Exam |
---|---|
Autumn | Yes - 2 Hour |
• Group/class feedback, post-assessment
Not yet recorded.