Module manager: Prof Dillon Mayhew
Email: D.Mayhew@leeds.ac.uk
Taught: Semesters 1 & 2 (Sep to Jun) View Timetable
Year running 2025/26
| COMP1850 | Programming |
| COMP1860 | Building our Digital World: Computer Systems & Architecture |
This module is not approved as a discovery module
Computer Science, at its foundation, is a mathematical and engineering discipline. This module lays the foundation of the mathematical and theoretical concepts in Computer Science and forms part of the core of the Computer Science curriculum. This module will equip students with core skills and knowledge and enable them to view real world problems algorithmically while applying rigorous mathematical approaches to solve them.
To develop an appreciation of, and familiarity with, mathematical concepts and their application in computer science. To equip students with the appropriate problem-solving techniques and transferable skills to tackle real world problems computationally.
On successful completion of this module a student will have demonstrated the ability to:
1. recall and apply definitions and theorems to well-specified problems relating to topics relevant to Computer Science. (C1, M1)
2. effectively communicate complex topics at the foundation of Computer Science to technical and non-technical audiences. (C17, M17)
3. select and apply appropriate computational and analytical techniques to model and solve complex real-world problems. (C3, M3)
4. select and interpret relevant information from multiple sources to solve complex real-world problems. (C4, M4)
5. identify and analyse ethical concerns when applying techniques to model real world problems and make reasoned decisions informed by ethical frameworks and codes of conduct. (C8, M8)
6. effectively use appropriate computing machinery and technologies to investigate complex real-world problems, identifying limitation where they occur. (C12, M12, C13, M13)
7. reflect on their level of mastery of subject knowledge and skills and plan for personal development. (C18, M18)
Skills Learning Outcomes
a) Technical writing,
b) Communication,
c) Teamwork,
d) Time management,
e) Problem solving,
f) Active learning,
g) Reflection,
h) Critical thinking,
g) Ethical thinking.
- Logic:
Truth tables
Arguments
Rules of inference
Proof techniques
Induction
- Discrete Mathematics:
Sets
Functions
Relations
Enumeration
Number representations
Algorithms for arithmetic
Number theory
- Graph theory
Paths
Walks
Cycles
Trees
Eulerian tours
Modelling computational problems
- Linear algebra
Vectors
Vector operations
Matrices
Matrix multiplication
Linear transformations
- Calculus
Sequences
Limits
Derivatives
Integration
- Probability
Sample spaces
Conditional probability
Bayes’ rule
Discrete random variables
Conditional distributions
- Data structures
Arrays
Stacks
Queues
Heaps
Lists
Graphs
- Basic algorithms
Iterative and recursive algorithms
Searching
Sorting
- Graph algorithms
Breadth-first search
Depth-first search
Topological sorting
- Algorithm paradigms
Brute force
Decrease-and-conquer
Divide-and-conquer
Transform-and-conquer
- Complexity theory
Asymptotic notation
Worst-case analysis
Best-case analysis
Time and space trade-offs
Empirical measurements of performance
Methods of Assessment
We are currently refreshing our modules to make sure students have the best possible experience. Full assessment details for this module are not available before the start of the academic year, at which time details of the assessment(s) will be provided.
Assessment for this module will consist of:
1 x Coursework
1 x Exam
1 x In-Class Test
| Delivery type | Number | Length hours | Student hours |
|---|---|---|---|
| Private study hours | 0 | ||
| Total Contact hours | 0 | ||
| Total hours (100hr per 10 credits) | 0 | ||
Students will have an opportunity for continuous feedback on all components of the portfolio via tutorials, personal tutorials and via additional support activities. Students will have regular portfolio checkpoints to ensure students are progressing towards the assessment objectives.
The reading list is available from the Library website
Last updated: 30/04/2025
Errors, omissions, failed links etc should be notified to the Catalogue Team