Module Specification

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.
1. Module Title Foundations of Computer Science
2. Module Code COMP109
3. Year Session 2023-24
4. Originating Department Computer Science
5. Faculty Fac of Science & Engineering
6. Semester First Semester
7. CATS Level Level 4 FHEQ
8. CATS Value 15
9. Member of staff with responsibility for the module
Professor B Konev Computer Science Boris.Konev@liverpool.ac.uk
10. Module Moderator
11. Other Contributing Departments  
12. Other Staff Teaching on this Module
Mrs J Birtall School of Electrical Engineering, Electronics and Computer Science Judith.Birtall@liverpool.ac.uk
13. Board of Studies
14. Mode of Delivery
15. Location Main Liverpool City Campus
    Lectures Seminars Tutorials Lab Practicals Fieldwork Placement Other TOTAL
16. Study Hours 30

  12

    10

52
17.

Private Study

98
18.

TOTAL HOURS

150
 
    Lectures Seminars Tutorials Lab Practicals Fieldwork Placement Other
19. Timetable (if known)            
 
20. Pre-requisites before taking this module (other modules and/or general educational/academic requirements):

 
21. Modules for which this module is a pre-requisite:

 
22. Co-requisite modules:

 
23. Linked Modules:

 
24. Programme(s) (including Year of Study) to which this module is available on a mandatory basis:

25. Programme(s) (including Year of Study) to which this module is available on a required basis:

26. Programme(s) (including Year of Study) to which this module is available on an optional basis:

27. Aims
 

To introduce the notation, terminology, and techniques underpinning the discipline of Theoretical Computer Science.
To provide the mathematical foundation necessary for understanding datatypes as they arise in Computer Science and for understanding computation.
To introduce the basic proof techniques which are used for reasoning about data and computation.
To introduce the basic mathematical tools needed for specifying requirements and programs

 
28. 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.

 
29. Teaching and Learning Strategies
 

Teaching Method 1 - Lecture
Description: Students will be expected to attend three hours of formal lectures in a typical week.
Attendance Recorded: Yes
Notes: Students are expected to spend at least one hour per week for completion of practical exercises
Unscheduled Directed Student Hours (time spent away from the timetabled sessions but directed by the teaching staff): 10

Teaching Method 2 - Tutorial
Description: One hour of tutorials accompany lectures in a typical week
Attendance Recorded: Yes

Standard on-campus delivery
Teaching Method 1 - Lecture
Description: Mix of on-campus/on-line synchronous/asynchronous sessions
Teaching Method 2 - Tutorial
Description: On-campus synchronous sessions

 
30. Syllabus
   

Number systems and proof techniques: natural numbers, integers, rationals, real numbers, prime numbers, proof by contradiction and proof by induction.
Approaches to describing collections of objects: sets and set operations, unary and binary relations, properties of binary relations, partial orders and equivalence relations, inverse relations, and compositions of relations.
Functions: properties of functions, inverse functions and compositions of functions, the pigeonhole principle.
Propositional logic: syntax and construction of formulas, semantics, interpretations and truth  tables, tautologies, contradictions, semantic consequence and logical equivalence.
Combinatorics: notation for sums, products, and factorials, Binomial coefficients, counting permutations, subsets, subsequences and functions.
Discrete Probability: sample spaces, events, conditional probability, independence, random variables and expectation.

 
31. Recommended Texts
  Reading lists are managed at readinglists.liverpool.ac.uk. Click here to access the reading lists for this module.
 

Assessment

32. EXAM Duration Timing
(Semester)
% of
final
mark
Resit/resubmission
opportunity
Penalty for late
submission
Notes
  (109) Final Exam There is a resit opportunity. Standard UoL penalty applies for late submission. This is an anonymous assessment. Assessment Schedule (When) :1 120 70
33. CONTINUOUS Duration Timing
(Semester)
% of
final
mark
Resit/resubmission
opportunity
Penalty for late
submission
Notes
  (109.3) Class Test 2 There is a resit opportunity. Standard UoL penalty applies for late submission. This is an anonymous assessment. Assessment Schedule (When) :Semester 1 0 10
  (109.2) Class Test 1 There is a resit opportunity. Standard UoL penalty applies for late submission. This is an anonymous assessment. Assessment Schedule (When) :Semester 1 0 10
  (109.1) Tutorial contribution 0 10