production
Skip to Content

Log In

  1. University Home
  2. Catalogue of Courses
  3. Undergraduate
  4. 2016-2017
  5. Computing Science
  6. CS2013: MATHEMATICS FOR COMPUTING SCIENCE

CS2013: MATHEMATICS FOR COMPUTING SCIENCE (2016-2017)

Last modified: 28 Jun 2018 10:27


Course Overview

This course provides a basic-level introduction to some areas of Discrete Mathematics that are of particular relevance to Computing. The course starts with a simple introduction to formal languages (starting from Regular Expressions and Finite-State Automata); it continues with an introduction to Predicate Logic (assuming basic familiarity with Propositional Logic); it concludes with an introduction to probability, focussing on Bayesian reasoning.



Course Details

Study Type Undergraduate Level 2
Term First Term Credit Points 15 credits (7.5 ECTS credits)
Campus None. Sustained Study No
Co-ordinators
  • Professor Kees Van Deemter
  • Dr Frank Guerin

Qualification Prerequisites

None.

What courses & programmes must have been taken before this course?

  • One of CS1014 Foundations of Computing Science 1 (Passed) or CS1016 Foundations of Computing Science 1 (Passed) or CS1022 Computer Programming and Principles (Passed)
  • Any Undergraduate Programme (Studied)

What other courses must be taken with this course?

None.

What courses cannot be taken with this course?

None.

Are there a limited number of places available?

No

Course Description

Three main topics will be covered: 1. Introduction to formal languages: finite-state machines, regular expressions, Kleene's theorem, pushdown automata, context-free languages. 2. Introductory statistics for computing: Probability, Combinations, Permutations, Bayes' rule; the noisy channel model; principles of descriptive and inferential statistics; principles of hypothesis testing (null hypothesis, type-1 and type-2 errors, etc). 3. Topics in logic and set theory, including and introduction to predicate logic; the cardinality of Infinite sets; Cantor's diagonal argument; simple abstract applications to computability. Throughout the course, there will be an emphasis on proof methods, including methods such as proof by mathematical induction, and proof by contradiction.

Further Information & Notes

Even though this course does not replace any now-existing course, it does teach elements of earlier courses on Formal Languages and Discrete Methods. It will allow other existing courses, such as the present CS3518 (Languages and Computatibility), to be substantially upgraded. The course will build on the new course in Principles of Programming (CS1022).

Contact Teaching Time

Information on contact teaching time is available from the course guide.

Teaching Breakdown

More Information about Week Numbers


Details, including assessments, may be subject to change until 30 August 2024 for 1st term courses and 20 December 2024 for 2nd term courses.

Summative Assessments

1st Attempt: 2-hour written exam (75%). Continuous assessment, consisting of maths problems (25%) Resit: 2-hour written exam (75%). The continuous assessment mark will be carried forward. (25%)

Formative Assessment

Marked coursework will be returned to students within 2 weeks of submission. Consequently, this will play a role as formative (as well as summative) asessment.

Feedback

Marked coursework will be returned to students. Further explanations will be offered in class.

Course Learning Outcomes

None.
 

Compatibility Mode

We have detected that you are have compatibility mode enabled or are using an old version of Internet Explorer. You either need to switch off compatibility mode for this site or upgrade your browser.