Bachelor of Science (BSc)
BSc Computer Science
- Typical A-level offer: A*AA including specific subjects
- Typical contextual A-level offer: AAA including specific subjects
- Care experienced/sanctuary/carer offer: AAB including specific subjects
- Typical International Baccalaureate offer: 37 points overall with 7,6,6 at HL, including specific requirements
Book an open day
Explore our campus, meet lecturers and current students, and learn more about what it's like to study at Manchester.
Meet us
Join us online or in person to learn more about the University and our courses.
Discover more about Computer Science at Manchester
Learn about your subject of interest and what you'll experience as a student in that community.
Discover more about Computer Science at Manchester
Download our course brochure
Get to know us better with our guide to studying your subject of choice.
Download our course brochure
Course unit details:
Mathematical Techniques for Computer Science
| Unit code | COMP11120 |
|---|---|
| Credit rating | 20 |
| Unit level | Level 1 |
| Teaching period(s) | Full year |
| Offered by | Department of Computer Science |
| Available as a free choice unit? | No |
Overview
This course covers the fundamental mathematics required by Computer Science students in order to successfully complete the reminder of their courses as well as for a career in computer science. Specifically the unit aims to
• introduce mathematical notions relevant to computer science and their applications;
• illustrate how abstraction allows the formulation and proof of properties for real-world and computational phenomena, and enable students to apply this technique;
• give an understanding and some practice in the fundamental notion of proof.
Underlying everything we do on this unit is the idea that we need to provide formal definitions of concepts, which then enable us to rigorously establish properties of these. At the start we introduce this new way of engaging with mathematics by studying notions already familiar to students, such as functions or operations such as addition of numbers in this style. Further topics covered include logic, probability, recursion and induction, relations, vectors, matrices and transformations.
Pre/co-requisites
Aims
This is a full year course that focuses on areas of mathematics required to model and analyse the kind of problems that arise in computer science. Probabilities are used for example in artificial intelligence, and play a vital role in machine learning, while the combinatorics required here also plays a role in the field of computational complexity. Vectors and matrices are the mathematical model underlying computer graphics. Logic is a tool used to reason about computer programs as well as the real world. Recursion is an important programming principle that comes with an associated proof rule, and other mathematical notions such as functions and relations are used routinely in computer science, for example when talking about database systems. Theoretical computer science can be considered an area of mathematics, and the unit also provides an introduction to the fundamental notions of this area.
Learning outcomes
ILO 1: employ abstraction to move from concrete phenomena to ones amenable to the application of mathematical techniques;
ILO 2: apply concepts from the mathematical theory of probability to describe and analyse a variety of situations;
ILO 3: use Bayesian reasoning to construct a simple algorithm for learning in a variety of situations;
ILO 4: choose suitable mathematical techniques to analyse questions from computer science and devise approaches to solving them;
ILO 5: construct and manipulate logical formulae and derivations and compute their semantics in different frameworks;
ILO 6: analyse vector spaces and linear transformations, making use of conceptual techniques or bases as appropriate;
ILO 7: define recursive operations satisfying a given specification, as well as construct inductive arguments to prove a given property for such operations;
ILO 8: apply formal definitions and construct formal arguments for these.
Syllabus
This course covers the fundamental mathematics required by Computer Science students in order to successfully complete the reminder of their courses as well as for a career in computer science. Specifically the unit aims to
• introduce mathematical notions relevant to computer science and their applications;
• illustrate how abstraction allows the formulation and proof of properties for real-world and computational phenomena, and enable students to apply this technique;
• give an understanding and some practice in the fundamental notion of proof.
Underlying everything we do on this unit is the idea that we need to provide formal definitions of concepts, which then enable us to rigorously establish properties of these. At the start we introduce this new way of engaging with mathematics by studying notions already familiar to students, such as functions or operations such as addition of numbers in this style. Further topics covered include logic, probability, recursion and induction, relations, vectors, matrices and transformations.
Teaching and learning methods
This unit is delivered in blended manner. At the start of the week there is an examples class for students to engage with new concepts in groups with feedback given by unit staff. Students then move to self-study materials in the form of detailed notes, teaching videos and formative self-assessment quizzes. Towards the end of each week there is a session that allows students to ask questions about the materials and beyond, and discuss the ideas underlying the taught material.
Employability skills
- Analytical skills
- Problem solving
Assessment methods
| Method | Weight |
|---|---|
| Written exam | 80% |
| Written assignment (inc essay) | 20% |
Feedback methods
Feedback is provided in the examples classes, via published solutions to exercises, via self-assessment quizzes and the discussion board.
Semester 1 exam: 40%
Semester 2 exam: 40%
Exercise Sheets: 20%
Recommended reading
- Epp, Susanna S. (2019). Discrete mathematics with applications. Cengage Learning. ISBN: 9781337694193
- Angel, Edward, author. (2015). Interactive computer graphics: a top-down approach with WebGL. Pearson. ISBN: 9781292019345
- Garnier, Rowan. (2002). Discrete mathematics for new technology. Institute of Physics. ISBN: 0750306521
- Houston, Kevin, 1968-. (2009). How to think like a mathematician a companion to undergraduate mathematics. Cambridge University Press. ISBN: 9781139129718
- Jordan, D. W. (Dominic William). (2008). Mathematical techniques: an introduction for the engineering, physical, and mathematical sciences. Oxford University Press. ISBN: 9780199282012
- Poole, David, 1955- author. (2015). Linear algebra: a modern introduction. Cengage Learning. ISBN: 9781285463247
- Truss, J. K. (1999). Discrete mathematics for computer scientists. Addison-Wesley. ISBN: 0201360616
Study hours
| Scheduled activity hours | |
|---|---|
| Assessment written exam | 4 |
| Lectures | 22 |
| Practical classes & workshops | 22 |
| Independent study hours | |
|---|---|
| Independent study | 152 |
Teaching staff
| Staff member | Role |
|---|---|
| Andrea Schalk | Unit coordinator |
Fees and funding
Fees
Tuition fees for home students commencing their studies in September 2027 will be £10,050 per annum. Tuition fees for international students will be £39,700 per annum.
For general information please see the undergraduate finance pages.
Policy on additional costs
All students should normally be able to complete their programme of study without incurring additional study costs over and above the tuition fee for that programme. Any unavoidable additional compulsory costs totalling more than 1% of the annual home undergraduate fee per annum, regardless of whether the programme in question is undergraduate or postgraduate taught, will be made clear to you at the point of application. Further information can be found in the University's Policy on additional costs incurred by students on undergraduate and postgraduate taught programmes (PDF document, 91KB).
Scholarships/sponsorships
The University of Manchester is committed to attracting and supporting the very best students. We have a focus on nurturing talent and ability and we want to make sure that you have the opportunity to study here, regardless of your financial circumstances.
For information about scholarships and bursaries please visit our undergraduate student finance pages .
Regulated by the Office for Students
The University of Manchester is regulated by the Office for Students (OfS). The OfS aims to help students succeed in Higher Education by ensuring they receive excellent information and guidance, get high quality education that prepares them for the future and by protecting their interests. More information can be found at the OfS website.
You can find regulations and policies relating to student life at The University of Manchester, including our Degree Regulations and Complaints Procedure, on our regulations website.
