Skip to main content

Unit information: Mathematics for Computer Science A in 2020/21

Please note: you are viewing unit and programme information for a past academic year. Please see the current academic year for up to date information.

Unit name Mathematics for Computer Science A
Unit code COMS10014
Credit points 20
Level of study C/4
Teaching block(s) Teaching Block 1 (weeks 1 - 12)
Unit director Dr. Bernhard
Open unit status Not open
Pre-requisites

A* in A-level mathematics, or equivalent.

Co-requisites

COMS10013 Mathematics for Computer Science B

School/department Department of Computer Science
Faculty Faculty of Engineering

Description

This unit and its companion, COMS10013 “Mathematics for Computer Science B”, provide the mathematical foundations for the rest of the programme.

It assumes an A* in A-level mathematics or equivalent knowledge as a prerequisite, which is part of our entry requirements.

This unit introduces students to two main areas of mathematics:

  1. Discrete Mathematics, which is often called “the Mathematics of Computer Science”.
  2. Probability Theory, the area of mathematics that deals with uncertainty and that is essential for scientific modelling. A particular application of this in computing is the field of Machine Learning.

Cutting across all these topics, students will be introduced to principles of mathematical reasoning, for example: creating a mathematical model of a problem, being precise and formal where necessary (and knowing when this is necessary), using abstraction to focus on the important aspects of a problem, dealing with uncertainty, employing mathematical methods of reasoning (for example, inductive and deductive arguments).

Intended learning outcomes

After completing this unit, a student will be able to:

  1. Perform the calculations, algorithms and other techniques taught in the unit.
  2. Recognise and apply mathematical precision and abstraction.
  3. Select appropriate mathematical tools and methods of reasoning to create models and solve problems.
  4. Recognise a correct mathematical proof.
  5. Solve problems in the areas of logic, set theory, combinatorics, and probability theory.

Teaching details

Teaching will be delivered through a combination of synchronous and asynchronous sessions, including lectures, practical activities supported by drop-in sessions, problem sheets and self-directed exercises.

Assessment Details

100% January Timed Assessment.

In addition to the assessment, this unit has a “must pass” hurdle: students are required to attend and sign in to at least 75% of the workshop classes.

Reading and References

This unit covers topics that are not found in this particular configuration in any one textbook, so the list below gives examples of books that cover different sections of the unit. Students are highly recommended to not buy any textbooks up front, and certainly not all of the books on the list – rather, they should use them as reference material as and when needed, and only to spend money on a book if it has repeatedly proved useful to them.

  • Nissanke, Nimal, Introductory Logic and Sets for Computer Science (Addison Wesley, 1998) ISBN: 978-0201179576
  • James, Glyn et al, Modern Engineering Mathematics (Pearson, 2015) ISBN: 978-1292080826
  • Rosen, Kenneth, Discrete Mathematics and Applications (McGraw-Hill, 2019) ISBN: 978-1259676512
  • Lehman, Eric et al, Mathematics for Computer Science – free PDF available online from MIT. (Rather than buy copies from the library, this is the book for students who want a free PDF of something on their tablet.)

Feedback