- Course Code
- CS 3511
- Credit Points
- 15
- Course Coordinator
- Dr K Van Deemter
Pre-requisites
CS2005 and either i) a Level 1 Mathematics Course (those students who completed Level 1 study in 2004/2005 or earlier) or
ii) CS1512 (those students who completed Level 1 study in 2005/2006 or later).
Notes
(i) Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.
(ii) Non-graduating students would require the following background/experience: knowledge of common data-structures and algorithms; mathematics equivalent to higher level.
Overview
Propositional and predicate logic, proof methods, relations and their applications. Sets, functions, graphs and related algorithms. Graphs, trees and related algorithms.
Structure
12 week course - 2 one-hour lectures, 1 two-hour tutorial per week.
Assessment
1st Attempt: 1 two-hour written examination (75%) and in-course assessment (25%). In order to pass the course, candidates must obtain a pass mark in the examination and in the overall combination of examination and in-course assessment.
Resit: 1 two-hour written examination (75%); 25% carried forward from orginal in-course assessment. Candidates must obtain a pass mark in the examination and in the overall combination of exam and in-course assessment.