- Course Code
- CS 2007
- Credit Points
- 15
- Course Coordinator
- Dr E Reiter
Pre-requisites
Notes
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.
Overview
This course identifies fundamental data structures and algorithms as the basic building blocks of software systems, and provides experience of their implementation and application using the Java programming language. Introduction to Design of algorithms. Recursion and simple analysis of recursive methods. Data Types & Abstraction. Use of the Java Collection Framework. Stacks, Queues, Deques and Lists. Hash tables. Trees. Search Trees. Heaps. Sets. Algorithmic paradigms and their applications. Implementation issues and efficiency measures.
Structure
12 week course - 2 one-hour lectures, 1 one-hour tutorial and 1 one-hour practical 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 (with the above weights).
Resit: 75% from a two-hour written examination; 25% carried forward from the original in-course assessment. Candidates must obtain a pass mark in the exam and the overall combination of exam and in-course assessment.