CSC933 - Syllabus

Credits

22 credits at SCQF level 8

Prerequisites

CSC932

Instructors

Dr Marwan Fayed (Coordinator), Rm 4B72, 01786 467454,

Claire Maternaghan, Rm 4X1, cma [at] cs [dot] stir [dot] ac [dot] uk

Learning Outcomes

Following this course students should:

Have developed a strong set of problem-solving tools and be able to apply them using Java;
Understand how information can be encapsulated by objects, and the benefits of doing so;
Understand a few of the ways that information systems can support decision-making;
Be able to describe, use, and manipulate basic and fundamental data structures;
Be able to understand and implement a set of fundamental algorithms.

In order to complete the module, you should be able to demonstrate the ability to apply related theory and techniques to unseen problems without reference to notes, to work independently and under a time constraint.

Expectations on the Student

This is a module in computing science fundamentals. As such, it covers a lot of material. While much of the material will be delivered via lectures, practice sessions, and tutorials, the onus will be on the student to use the additional materials to fill in the gaps. Success will largely be determined by the student willingness to attend, engage, and work.

Assessment

Exam - 40% (attendance required for a pass).
Assignments, 4 x 15% each with a written and programming component - 60% total (see caveat below).

Assignment weights are determined by engagement in the following manner:

A minimum checkpoint during practical earns an additional (absolute) 5% on corresponding assignments.
Attendance at all four tutorial sessions earns a multiplier of 1.1 on the exam. eg. 60% => 66%. This is a non-negotiable all-or-nothing scheme.

Students are free to decide their own level of engagement. Clearly, decisions have benefits and consequences.

Unsubmitted assignments will be recorded as a zero (0/5C). Assessed coursework submitted late will be accepted up to five days after the submission date (or expiry of any agreed extension) but the grade will be lowered by one grade point per day or part thereof. After five days the piece of work will be deemed a non-submission, and will result in the award of zero (5C) for that assignment. If a student is unable to attend the Main examination, he/she must apply to the Student Programmes Office for a Deferred examination. If a Deferred examination is not granted, then the Examiners may allow a Repeat examination. Only students who obtain a grade 4A, 4B or 4C for the module, following the main examination, will be eligible for a Repeat examination. The grade awarded following a Repeat examination is capped at 3C.

Textbooks

Required:

Data Structures and Algorithms in Java: International Student Version (5e), Michael T. Goodrich, Roberto Tamassia. ISBN-10: 0470398809, ISBN-13: 978-0470398807

COMPUTING SCIENCE AND MATHEMATICS
University \| Computing Science \| Modules \| CSC933 \| Syllabus	Updated 19/09/11 11:01


	CSC933 - `Computer Science III Syllabus Autumn 2011



	Home Organisation Syllabus Schedule Materials Lectures Practicals Tutorials Assessment Assignments Reference JavaDocs Java API Plagiarism				Credits 22 credits at SCQF level 8 Prerequisites CSC932 Instructors Dr Marwan Fayed (Coordinator), Rm 4B72, 01786 467454, Claire Maternaghan, Rm 4X1, cma [at] cs [dot] stir [dot] ac [dot] uk Learning Outcomes Following this course students should: Have developed a strong set of problem-solving tools and be able to apply them using Java; Understand how information can be encapsulated by objects, and the benefits of doing so; Understand a few of the ways that information systems can support decision-making; Be able to describe, use, and manipulate basic and fundamental data structures; Be able to understand and implement a set of fundamental algorithms. In order to complete the module, you should be able to demonstrate the ability to apply related theory and techniques to unseen problems without reference to notes, to work independently and under a time constraint. Expectations on the Student This is a module in computing science fundamentals. As such, it covers a lot of material. While much of the material will be delivered via lectures, practice sessions, and tutorials, the onus will be on the student to use the additional materials to fill in the gaps. Success will largely be determined by the student willingness to attend, engage, and work. Assessment Exam - 40% (attendance required for a pass). Assignments, 4 x 15% each with a written and programming component - 60% total (see caveat below). Assignment weights are determined by engagement in the following manner: A minimum checkpoint during practical earns an additional (absolute) 5% on corresponding assignments. Attendance at all four tutorial sessions earns a multiplier of 1.1 on the exam. eg. 60% => 66%. This is a non-negotiable all-or-nothing scheme. Students are free to decide their own level of engagement. Clearly, decisions have benefits and consequences. Unsubmitted assignments will be recorded as a zero (0/5C). Assessed coursework submitted late will be accepted up to five days after the submission date (or expiry of any agreed extension) but the grade will be lowered by one grade point per day or part thereof. After five days the piece of work will be deemed a non-submission, and will result in the award of zero (5C) for that assignment. If a student is unable to attend the Main examination, he/she must apply to the Student Programmes Office for a Deferred examination. If a Deferred examination is not granted, then the Examiners may allow a Repeat examination. Only students who obtain a grade 4A, 4B or 4C for the module, following the main examination, will be eligible for a Repeat examination. The grade awarded following a Repeat examination is capped at 3C. Textbooks Required: Data Structures and Algorithms in Java: International Student Version (5e), Michael T. Goodrich, Roberto Tamassia. ISBN-10: 0470398809, ISBN-13: 978-0470398807 Recommended reading includes: Data Structures and Problem Solving Using Java: International Version, Mark A. Weiss (4e). ISBN-10: 0321546229, ISBN-13: 978-0321546227. Data Structures and Algorithms in Java, Robert Lafore (2e) ISBN-10: 0672324539 ISBN-13: 978-0672324536 The New Boston Intro to Java The New Boston Intermediate Java.