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 PROGRAMMING LANGUAGE PARADIGMS
Code COMP105
Coordinator Dr JS Fearnley
Computer Science
John.Fearnley@liverpool.ac.uk
Year CATS Level Semester CATS Value
Session 2019-20 Level 4 FHEQ First Semester 15

Aims

To introduce the functional programming paradigm, and to compare and contrastit with the imperative programming paradigm.
To explore the common techniques that are employed to solve problems in a functional way.


Learning Outcomes

(LO1) Describe the imperative and functional programming paradigms including the differences between them.

(LO2) Apply recursion to solve algorithmic tasks.

(LO3) Apply common functional programming idioms such as map, filter and fold.

(LO4) Write programs using a functional programming language.

(S1) Time and project management - Personal organisation

(S2) Communication (oral, written and visual) - Report writing

(S3) Critical thinking and problem-solving - Critical analysis

(S4) Numeracy/computational skills - Reason with numbers/mathematical concepts


Syllabus

 

An overview of modern programming paradigms.  
Imperative and functional programming (3 lectures)
Functional programming: introduction, compiling programs, using the interpreter (2 lectures)
Types in functional programming: tuples, lists, type inference, pattern matching (3 lectures)
Recursion: Using recursion to solve problems in a functional way (8 lectures)
Models of execution: eager and lazy evaluation (2 lectures)
Higher-order functions: currying, lambda functions, function composition (3 lectures)
Common functional programming idioms: map, filter, reduce, fold, etc. (6 lectures)
Non-pure aspects of functional programming: I/O, manipulating files (3 lectures)


Teaching and Learning Strategies

Teaching Method 1 - Lecture
Description: Three lectures per week during the semester.
Attendance Recorded: Yes

Teaching Method 2 - Laboratory Work
Description: One laboratory session per week
Attendance Recorded: Yes


Teaching Schedule

  Lectures Seminars Tutorials Lab Practicals Fieldwork Placement Other TOTAL
Study Hours 30

    10

    40
Timetable (if known)              
Private Study 110
TOTAL HOURS 150

Assessment

EXAM Duration Timing
(Semester)
% of
final
mark
Resit/resubmission
opportunity
Penalty for late
submission
Notes
Class Test There is a resit opportunity. Non-standard penalty applies for late submission - Late submission is not possible for a class test. This is an anonymous assessment. Assessment Schedul  1 hour    25       
CONTINUOUS Duration Timing
(Semester)
% of
final
mark
Resit/resubmission
opportunity
Penalty for late
submission
Notes
Programming Assignment 1 There is a resit opportunity. Standard UoL penalty applies for late submission. This is an anonymous assessment. Assessment Schedule (When) :First semester  10 hours    25       
Programming Assignment 2 There is a resit opportunity. Standard UoL penalty applies for late submission. This is an anonymous assessment. Assessment Schedule (When) :First semester  10 hours    25       
Programming Assignment 3 There is a resit opportunity. Standard UoL penalty applies for late submission. This is an anonymous assessment. Assessment Schedule (When) :First semester  10 hours    25       

Recommended Texts

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