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:

  1. Describe the basic characteristics of declarative programming in general and Prolog in particular;
  2. Compare declarative and imperative programming;
  3. Design, construct and analyze Prolog programs of moderate complexity;
  4. Evaluate the suitability of Prolog for simple tasks;
  5. Identify and use the different forms of recursion;
  6. Describe simple finite automata and models.

Module Content

Basic introduction to Prolog (including recursion, definite clause grammars, cuts and negation), and to finite models and automata, contrasting declarative and procedural methods.

Teaching and Learning Methods

Lectures, labs and tutorials.

Assessment Details

2 hour real-time examination and homework assignments.

Assessment ComponentBrief Description Learning Outcomes Addressed% of TotalWeek SetWeek Due
Examination2 hour In-person
LO1, LO2, LO3,
LO4, LO5, LO6
Homeworks2 Problem SetsL01,L02,L03,
L04, LO5, LO6
20%Week 4, 8
The following 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 applicable)36 hours
Completion of assessments (including examination, if applicable)36 hours
Total Hours116 hours

Recommended Reading List


Module Pre-requisites

Prerequisite modules: N/A

Other/alternative non-module prerequisites: N/A

Module Co-requisites


Module Website