CS136 Discrete Mathematics and its Applications 1
We will be adapting the way we teach and assess modules in line with government guidance on social distancing and other protective measures in response to Coronavirus. Teaching will vary between online and on-campus delivery through the year, and you should read the additional information linked on the right hand side of this page for details of how we anticipate this will work. The contact hours shown in the module information below are superseded by the additional information. You can find out more about the University’s overall response to Coronavirus at: https://warwick.ac.uk/coronavirus.
CS136-12 Discrete Mathematics & its Applications 1
Introductory description
The module will introduce central concepts in the area of discrete mathematics.
Module aims
The focus of the module is on basic mathematical concepts in discrete mathematics and on applications of discrete mathematics in algortihms and data structures. To show students how discrete mathematics can be used in modern computer science (with the focus on algorithmic applications).
Outline syllabus
This is an indicative module outline only to give an indication of the sort of topics that may be covered. Actual sessions held may differ.
Foundations: logic, sets, relations, functions.
The concept of algorithms and algorithmic thinking in problem solving
Summation techniques: manipulations of sums and multiple sums; finite calculus
Asymptotics and the big-Oh notation
Manipulations with the floor and ceiling functions
Learning outcomes
By the end of the module, students should be able to:
- - Understand the role of formal definitions, formal and informal mathematical proofs, and underlying algorithmic thinking, and be able to apply them in problem solving.
- - Understand the role of discrete mathematics in applications in computer science.
- - Understand the fundamental concepts of discrete mathematics.
Indicative reading list
Please see Talis Aspire link for most up to date list.
View reading list on Talis Aspire
Subject specific skills
Acquiring basic knowledge in the new area (of discrete mathematics), including learning the key concepts of mathematical rigour and of the formal proof.
Transferable skills
Critical thinking and creativity
Study time
| Type | Required |
|---|---|
| Lectures | 30 sessions of 1 hour (25%) |
| Seminars | 9 sessions of 1 hour (8%) |
| Private study | 81 hours (68%) |
| Total | 120 hours |
Private study description
Inclusive of private study, completion of problem sheets and revision.
Costs
No further costs have been identified for this module.
You do not need to pass all assessment components to pass the module.
Students can register for this module without taking any assessment.
Assessment group D2
| Weighting | Study time | |
|---|---|---|
| Five Assigned Problem Sheets | 20% | |
|
Each problem sheet is marked out of 10 and the overall coursework mark will be calculated as the average of the five marked assignments. |
||
| On-campus Examination | 80% | |
|
Examination ~Platforms - AEP
|
||
Assessment group R1
| Weighting | Study time | |
|---|---|---|
| On-campus Examination - Resit | 100% | |
|
Resit Examination ~Platforms - AEP
|
||
Feedback on assessment
feedback on problem sets in seminars.
Anti-requisite modules
If you take this module, you cannot also take:
- CS130-15 Mathematics for Computer Scientists 1
- CS131-15 Mathematics for Computer Scientists 2
Courses
This module is Core for:
- Year 1 of UCSA-G4G1 Undergraduate Discrete Mathematics
- Year 1 of UCSA-G4G3 Undergraduate Discrete Mathematics
Further Information
Term 1
12 CATS (6 ECTS)
Module Organisers:
Artur Czumaj
Charis Efthymiou