CSU34011 – Symbolic Programming

Module CodeCSU34011
Module Name Symoblic Programming
ECTS Weighting[1]5 ECTS
Semester taughtSemester 1
Module Coordinator/s  Tim Fernando

Module Learning Outcomes

On successful completion of this module, students will be able to:

LO1. Describe the basic characteristics of declarative programming in general and Prolog in particular.
LO2. Compare declarative and imperative programming
LO3. Design, construct and analyze Prolog programs of moderate complexity
LO4. Evaluate the suitability of Prolog for simple tasks
LO5. Identify and use the different forms of recursion

L06. Describe simple finite automata and models

Module Content

Basic introduction to Prolog (including recursion, definite clause grammars, cuts and
negation), and to finite automata and models

Teaching and learning Methods

22 hours of lectures, 11 hours of laboratories/tutorials

Assessment Details

2-hour real time examination + homeworks

Assessment ComponentBrief Description Learning Outcomes Addressed% of totalWeek setWeek Due
Examination2-hour Real time examinationLO1, LO2, LO3,
LO4, LO5, LO6
Homeworks2 problem setsL01,L02,L03,
L04, LO5, LO6
1 week

Reassessment Details

Real time examination (2 hours, 100%)

Contact Hours and Indicative Student Workload

Contact Hours (scheduled hours per student over full module), broken down by: 44 hours
Lecture22 hours
Laboratory11 hours
Tutorial or seminar11 hours
Other0 hours
Independent study (outside scheduled contact hours), broken down by:72  hours
Preparation for classes and review of material (including preparation for examination, if applicable36 hours
completion of assessments (including examination, if applicable)36 hours
Total Hours116 hours

Recommended Reading List

Module Pre-requisites

Prerequisite modules:

Other/alternative non-module prerequisites:

Module Co-requisites


Module Website