Registry

Module Specifications

Archived Version 2022 - 2023

Module Title
Module Code
School
Online Module Resources
NFQ level	8	Credit Rating	5
Pre-requisite	None
Co-requisite	None
Compatibles	None
Incompatibles	None

Description

This is a continuing course on computer programming. Students will consolidate their knowledge of fundamental data structures and algorithms: how and when to use them in computational problem solving. Students will also learn to use the technique of recursion. They will also be introduced to the concepts of object-oriented programming (classes, objects, methods and attributes, etc.), and will learn how to design and write object-oriented programs.

Learning Outcomes

1. Demonstrate an understanding of the properties of fundamental algorithms and data structures
2. Solve computational problems using the technique of recursion
3. Implement fundamental algorithms and data structures in a computer programming language
4. Design algorithms requiring the use of fundamental algorithms and data structures
5. Demonstrate an understanding of the fundamental concepts of object-oriented programming
6. Solve computational problems using object-oriented programming techniques

*Type*	*Hours*	*Description*
Workload	Full-time hours per semester
Lecture	24	Twice weekly lecture
Laboratory	24	2 hour lab once a week
Assignment Completion	30	Project work
Independent Study	47	This reflects the work carried out by students outside the lecture (reading background material, finishing lab assignments)
Total Workload: 125

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

Data structures
How to use basic data structures in a program, and how to choose the appropriate data structure

Recursion
How to write functions which call themselves

Object-oriented Programming
Introductory object-oriented programming. How to write classes, how to create objects of a particular class, how to invoke methods on objects

Assessment Breakdown
Continuous Assessment	%	Examination Weight	%

Type	Description	% of total	Assessment Date
Course Work Breakdown

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
Unavailable

Indicative Reading List

John M. Zelle: 2004, Python Programming, Franklin, Beedle & Associates, Inc., 9781887902991

Other Resources

0, Website, 0, Python 3 Tutorial, https://docs.python.org/3/tutorial/,

Programme or List of Programmes

Archives: