Annoucements

To come.

About this Module

Credit Weighting: 5

Pre-requisite(s): None

Co-requisite(s): None

Teaching Method(s): 24 x 1hr(s) Lectures; 11 x 2hr(s) Tutorials.

Module Objective: Students should develop skills in the foundational techniques needed to analyse, design, implement and communicate computational problems and solutions.

Module Content: Predicate logic; representing and solving computational problems with trees and graphs; analysis of simple data structures, algorithms and problem spaces.

Learning Outcomes: On successful completion of this module, students should be able to: Formulate computational problems using predicate logic specifications; Represent and solve computational problems with trees and graphs; Analyse simple data structures and algorithms.

Assessment: Total Marks 100: Formal Written Examination 80 marks; Continuous Assessment 20 marks (In-Class Tests 20 marks).

Compulsory Elements: Formal Written Examination; Continuous Assessment.

Penalties (for late submission of Course/Project Work etc.): Work which is submitted late shall be assigned a mark of zero (or a Fail Judgement in the case of Pass/Fail modules).

Pass Standard and any Special Requirements for Passing Module: 40\%.

Formal Written Examination: 1 x 1.5 hr(s) paper(s) to be taken in Summer 2016.

Requirements for Supplemental Examination: 1 x 1.5 hr(s) paper(s) (which incorporates assessment of both End of Semester Written Examination and Continuous Assessment) to be taken in Autumn 2016.