CSC1025 : Mathematics for Computer Science (Inactive)
- Inactive for Year: 2021/22
- Module Leader(s): Dr Jason Steggles
- Demonstrator: Miss Laura Heels
- Lecturer: Dr Victor Khomenko
- Other Staff: Dr Jennifer Warrender
- Owning School: Computing
- Teaching Location: Newcastle City Campus
Semesters
Semester 1 Credit Value: | 20 |
ECTS Credits: | 10.0 |
Aims
To develop confidence in the use of simple mathematics.
To provide a knowledge of the mathematical concepts essential for study and professional practice in Computing Science and Software Engineering.
To revise key areas of basic mathematics.
To practice the basic techniques of mathematics for modelling and solving computing problems.
To prepare students for the more advanced mathematics they will encounter on their degree.
To develop an awareness of the role of mathematics in Computing Science.
This module introduces the key mathematical skills needed in computing science. It revises key areas of basic mathematics and covers important topics in discrete mathematics. The module aims to develop the students confidence in using basic mathematical techniques.
Outline Of Syllabus
Discrete Structures – functions relations and sets
- Functions (surjections, injections, inverses, composition)
- Relations (reflexivity, symmetry, transitivity, equivalence relations)
- Sets (Venn diagrams, complements, Cartesian products, power sets)
- Pigeonhole principle
Discrete Structures – basic logic
- Propositional logic
- Logical connectives
- Truth tables
- Normal forms (conjunctive and disjunctive)
- Validity
- Predicate logic
- Universal and existential quantification
- Modus ponens and modus tollens
- Limitations of predicate logic
Discrete Structures – proof techniques
- Notions of implication, converse, inverse, contrapositive, negation, and contradiction
- The structure of mathematical proofs
- Direct proofs
- Proof by counterexample
- Proof by contradiction
- Mathematical induction
- Recursive mathematical definitions
Discrete Structures – basics of counting
- Counting arguments
- Sum and product rule
- Arithmetic and geometric progressions
- Fibonacci numbers
- Permutations and combinations
- Basic definitions
- Pascal’s identity
- The binomial theorem
Discrete Structures – graphs and trees
- Trees
- Undirected graphs
- Directed graphs
Other
- Matrices and vectors.
- Real-valued functions, exponential growth/decay, logarithms, derivative, min/max, equations.
- Number representations, binary conversion, GCD, Euclid’s algorithm.
Teaching Methods
Teaching Activities
Category | Activity | Number | Length | Student Hours | Comment |
---|---|---|---|---|---|
Scheduled Learning And Teaching Activities | Lecture | 40 | 1:00 | 40:00 | Lectures |
Guided Independent Study | Assessment preparation and completion | 40 | 1:00 | 40:00 | Lecture follow-up |
Guided Independent Study | Assessment preparation and completion | 44 | 0:30 | 22:00 | Revision for end of semester exam |
Guided Independent Study | Assessment preparation and completion | 1 | 2:00 | 2:00 | End of semester examination |
Scheduled Learning And Teaching Activities | Small group teaching | 24 | 1:00 | 24:00 | Tutorials |
Guided Independent Study | Project work | 22 | 1:00 | 22:00 | Coursework |
Guided Independent Study | Independent study | 50 | 1:00 | 50:00 | Background reading |
Total | 200:00 |
Teaching Rationale And Relationship
Lectures will be used to introduce the learning material and for demonstrating the key concepts by example. Students are expected to follow-up lectures within a few days by re-reading and annotating lecture notes to aid deep learning.
Tutorials will be used to emphasise the learning material and its application to the solution of problems and exercises set as coursework, during which students will analyse problems as individuals and in teams.
Students aiming for 1st class marks are expected to widen their knowledge beyond the content of lecture notes through background reading.
Students should set aside sufficient time to revise for the end of semester exam.
Assessment Methods
The format of resits will be determined by the Board of Examiners
Exams
Description | Length | Semester | When Set | Percentage | Comment |
---|---|---|---|---|---|
PC Examination | 120 | 1 | A | 80 | N/A |
Other Assessment
Description | Semester | When Set | Percentage | Comment |
---|---|---|---|---|
Prob solv exercises | 1 | M | 20 | 2 pieces worth 8% each and one worth 4% (up to 20 hours total) |
Assessment Rationale And Relationship
The PC exam will be used to assess students' knowledge, understanding and ability to apply the key mathematical topics covered in the course.
The coursework assignments will be used to help develop and assess students' understanding of and abilities to apply core mathematical techniques introduced within the course.
Study abroad students considering this module should contact the School to discuss its availability and assessment.
N.B. This module has both “Exam Assessment” and “Other Assessment” (e.g. coursework). If the total mark for either assessment falls below 35%, the maximum mark returned for the module will normally be 35%.
Reading Lists
Timetable
- Timetable Website: www.ncl.ac.uk/timetable/
- CSC1025's Timetable