|
MA2144 Discrete Mathematics
Part I Course Duration: One semester Credit Units: 4 Level: B2 Medium of Instruction: English Prerequisites: Nil Precursors: Nil Equivalent Courses: Nil Exclusive Courses: MA2184 MA2504
Part II Course Aims This course aims to introduce basic ideas of discrete mathematics such as formal mathematical reasoning techniques, basic counting techniques and their applications for computer science students. The objective is intended for students to understand the basic theory and some applications of discrete mathematics. The course gives students training in the ability to think quantitatively and analyse problems critically. Course Intended Learning Outcomes (CILOs) Upon successful completion of this course, students should be able to: No. | CILOs | Weighting (if applicable) | | 1. | explain at high levels concepts from discrete mathematics. | 1 | | 2. | implement basic operations in discrete mathematics. | 3 | | 3. | use formal mathematical reasoning techniques and basic counting techniques. | 3 | | 4. | develop mathematical models through relations,combinatorics, and functions, and apply mathematical methods to a range of problems in computer sciences. | 2 | | 5. | the combination of CILOs 1-4 | 3 |
Teaching and Learning Activities (TLAs) (Indicative of likely activities and tasks designed to facilitate students’ achievement of the CILOs. Final details will be provided to students in their first week of attendance in this course) TLAs | ILO No. | Hours/week | | Learning through teaching is primarily based on lectures. | 1--5 | 40 hours in total | | Learning through tutorials is primarily based on interactive problem solving allowing instant feedback. | 2 | 4 hours | | 3 | 4 hours | | 1 | 1 hour | | 4 | 3 hours | | Learning through take-home assignments helps students understand basic mathematical concepts and techniques of discrete mathematics, and apply mathematical methods to some problems in computer sciences. | 1--5 | after-class | | Learning through online examples for applications helps students apply discrete mathematics to some problems in computer sciences. | 4 | after-class | | Learning activities in Math Help Centre provides students extra help. | 2--4 | after-class |
Assessment Tasks/Activities (Indicative of likely activities and tasks designed to assess how well the students achieve the CILOs. Final details will be provided to students in their first week of attendance in this course) 20% Coursework 80% Examination (Duration : 2 hours, at the end of the semester)
For a student to pass the course, at least 30% of the maximum mark for the examination must be obtained. Assessment Tasks/Activities | ILO No. | Weighting (if applicable) | Remarks | | Test | 2, 3 | 15-30% | Questions are designed for the first part of the course to see how well the students have learned the basic concepts, techniques and some applications of discrete mathematics. | | Hand-in assignments | 1--4 | 0-15% | These are skills based assessment to see whether the students are familiar with the basic concepts, techniques of discrete mathematics and some applications in computer sciences. | | Examination | 5 | 70% | Examination questions are designed to see how far students have achieved their intended learning outcomes. Questions will primarily be skills and understanding based to assess the student’s versatility in discrete mathematics. | | Formative take-home assignments | 1--4 | 0% | The assignments provide students chances to demonstrate their achievements on discrete mathematics learned in this course. |
Grading of Student Achievement: Refer to Grading of Courses in the Academic Regulations
Part III Keyword Syllabus Mathematical logic. Methods of mathematical proof. Predicate calculus. Sets and relations. Castesian product. Functions. Permutations and combinations. Inclusion-exclusion principle. Recurrence relations. Complexity analysis of algorithms.
Related Links
Department of Mathematics
|