Module Details |
The information contained in this module specification was correct at the time of publication but may be subject to change, either during the session because of unforeseen circumstances, or following review of the module at the end of the session. Queries about the module should be directed to the member of staff with responsibility for the module. |
Title | FOUNDATIONS OF COMPUTER SCIENCE | ||
Code | COMP109 | ||
Coordinator |
Prof B Konev Computer Science Boris.Konev@liverpool.ac.uk |
||
Year | CATS Level | Semester | CATS Value |
Session 2019-20 | Level 4 FHEQ | First Semester | 15 |
Aims |
|
To introduce the notation, terminology, and techniques underpinning the discipline of Theoretical Computer Science. |
Learning Outcomes |
|
(LO1) Understand how a computer represents simple numeric data types; reason about simple data types using basic proof techniques; |
|
(LO2) Interpret set theory notation, perform operations on sets, and reason about sets; |
|
(LO3) Understand, manipulate and reason about unary relations, binary relations, and functions; |
|
(LO4) Apply logic to represent mathematical statement and digital circuit, and to recognise, understand, and reason about formulas in propositional and predicate logic; |
|
(LO5) Apply basic counting and enumeration methods as these arise in analysing permutations and combinations. |
|
(S1) Application of numeracy – manipulation of numbers, general mathematical awareness and its application in practical contexts. |
|
(S2) Problem-solving – analysing facts and situations and applying creative thinking to develop appropriate solutions. |
Syllabus |
|
Number systems and proof techniques: natural numbers, integers, rationals, real numbers, prime numbers, proof by contradiction and proof by induction. |
Teaching and Learning Strategies |
|
Teaching Method 1 - Lecture Teaching Method 2 - Tutorial |
Teaching Schedule |
Lectures | Seminars | Tutorials | Lab Practicals | Fieldwork Placement | Other | TOTAL | |
Study Hours |
30 |
12 |
10 |
52 | |||
Timetable (if known) | |||||||
Private Study | 98 | ||||||
TOTAL HOURS | 150 |
Assessment |
||||||
EXAM | Duration | Timing (Semester) |
% of final mark |
Resit/resubmission opportunity |
Penalty for late submission |
Notes |
Final Exam There is a resit opportunity. Standard UoL penalty applies for late submission. This is an anonymous assessment. Assessment Schedule (When) :1 | 2 hours | 80 | ||||
CONTINUOUS | Duration | Timing (Semester) |
% of final mark |
Resit/resubmission opportunity |
Penalty for late submission |
Notes |
A combination of assessed homework and in-class coursework 1 There is a resit opportunity. Standard UoL penalty applies for late submission. This is not an anonymous assessment. Assessment Sche | 6 hours | 10 | ||||
A combination of assessed homework and in-class coursework 2 There is a resit opportunity. Standard UoL penalty applies for late submission. This is not an anonymous assessment. Assessment Sche | 6 hours | 10 |
Recommended Texts |
|
Reading lists are managed at readinglists.liverpool.ac.uk. Click here to access the reading lists for this module. |