Registry

Module Specifications

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

Module Title Fundamentals of Computer Programming
Module Code CA211
School School of Computing
Online Module Resources

Module Co-ordinatorSemester 1: Jennifer Foster
Semester 2: Jennifer Foster
Autumn: Jennifer Foster
Module TeacherJennifer Foster
NFQ level 8 Credit Rating 10
Pre-requisite None
Co-requisite None
Compatibles None
Incompatibles None
Description
The aim of this module is to introduce the student to fundamental programming concepts and to enhance their problem-solving skills

Learning Outcomes
1. Explain how a problem solution can be expressed as a program and how programs can be compiled and executed by computers
2. Write programs that use control statements to coordinate problem solving
3. Select a data structure suitable for solving a given problem
4. Explain the concept of an algorithm
5. Implement algorithms in terms of data structures and methods
6. Write programs that process files
7. Discuss the importance of writing well-structured programs
8. Be familiar with the main principles of object-oriented programming



Workload Full-time hours per semester
Type Hours Description
Lecture48Classroom lecture
Lab40Computer lab
Examination2Lab exam 1
Examination2Lab exam 2
Examination2Final exam
Examination2Lab exam 3
Independent learning152Independent learning
Group work2Group Project
Total Workload: 250

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
Basics.
Program structure, simple I/O.

Variables.
Primitive data types, variable declarations, assignment and scope.

Control statements.
if statements, for loops, while loops, do-while loops.

Basic Algorithms.
Linear and binary search; greatest common divisor;random number generation; elementary string algorithms.

Methods.
Why are methods useful; defining methods; parameter passing.

Classes.
Writing classes; defining field variables and methods; creating objects; static vs non-static fields and methods.

Introduction to Arrays.
Creating and manipulating arrays.

Assessment Breakdown
Continuous Assessment50% Examination Weight50%
Course Work Breakdown
TypeDescription% of totalAssessment Date
Computerised test/examLab exam10%Week 6
Computerised test/examLab exam10%Week 12
Computerised test/examLab exam10%Week 24
ProjectGroup project10%Week 30
LaboratoryParticipation in weekly lab sessions10%Every Week
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 1
Indicative Reading List
    Other Resources
    None
    The module teacher should be listed as Jennifer Foster rather than Donal Fitzpatrick.
    Programme or List of Programmes
    BSSAStudy Abroad (DCU Business School)
    ECBSc in Enterprise Computing
    SHSAStudy Abroad (Science & Health)
    Timetable this semester: Timetable for CA211
    Date of Last Revision04-MAY-12
    Archives: