Registry

Module Specifications

Current Academic Year 2012 - 2013
Please note that this information is subject to change.

Module Title	Computer Programming II
Module Code	CA166
School	School of Computing
Online Module Resources
Module Co-ordinator	Semester 1: Joseph Morris Semester 2: Joseph Morris Autumn: Joseph Morris
NFQ level	8	Credit Rating	10
Pre-requisite	None
Co-requisite	None
Compatibles	None
Incompatibles	None

Description

The module is a follow-up to CA165. It introduces the student to a more advanced handling of programming concepts in Java, especially object-oriented programming through designing and using classes; it enhances familiarity with the Java API, especially those parts associated with data structures and file handling; and it explains techniques for designing and analysing elementary algorithms. It further develops participants’ programming and problem-solving abilities, and fosters good programming discipline. Students are expected to attend lectures, participate in tutorials, carry out practical exercises in a programming laboratory, and engage extensively in hands-on programming.

Learning Outcomes

1. Demonstrate mastery of formal and actual parameters in Java and their use in static methods.
2. Define instance methods and classes in Java, and use them in writing programs of small to moderate size.
3. Use the Java API and in particular those parts of it dealing with files and collections.
4. Write programs that employ reading and writing text files, reading and writing sequential and random binary files, and accessing the web.
5. Design and write simple algorithms for searching, sorting, text handling, and arithmetic using elementary techniques including recursion, and assess their time complexity.
6. Write programs that use the most important data structures in the Java library including lists, sets, and maps.
7. Proceed from informal descriptions of simple problems to design and implementation of programming solutions.
8. Comply with good software engineering principles in making programs, such as readability, maintainability, information hiding, and levels of abstraction.

Workload	Full-time hours per semester
*Type*	*Hours*	*Description*
Lecture	36	No Description
Tutorial	12	No Description
Laboratory	24	No Description
Directed learning	48	Completion of problem sets
Assignment	16	Assessed exercises/projects
Independent learning	144	Library work, reading, self-assessment
Total Workload: 280

All module information is indicative and subject to change. For further information,students are advised to refer to the University's Marks and Standards and Programme Specific Regulations at: http://www.dcu.ie/registry/examinations/index.shtml

Indicative Content and Learning Activities

Java.
More on arrays, strings, static methods, and standard input/output. Classes and objects. Instance variables and methods; visibility and scope; overloading. Initialisation and finalisation; garbage collection. Object composition. Public vs private. Exceptions. Text files. Binary files; sequentaial and ramdon access..

Algorithms.
Recursion. Binary and linear search. String handling. Simple arithmetic algorithms. Elementary sorting. Elementary complexity theory; Big-Oh notation..

Data Structures.
Sets, lists, and general collections. Array implementations. Introduction to Java's Collections framework..

Design.
Elementary modelling with objects. Information hiding and object composition Case studies in designing with classes..

Assessment Breakdown
Continuous Assessment	20%	Examination Weight	80%

Course Work Breakdown
Type	Description	% of total	Assessment Date

Reassessment Requirement
Resit arrangements are explained by the following categories; 1 = A resit is available for all components of the module 2 = No resit is available for 100% continuous assessment module 3 = No resit is available for the continuous assessment component
This module is category 3

Indicative Reading List