Module Specifications.
Current Academic Year 2024 - 2025
All Module information is indicative, and this portal is an interim interface pending the full upgrade of Coursebuilder and subsequent integration to the new DCU Student Information System (DCU Key).
As such, this is a point in time view of data which will be refreshed periodically. Some fields/data may not yet be available pending the completion of the full Coursebuilder upgrade and integration project. We will post status updates as they become available. Thank you for your patience and understanding.
Date posted: September 2024
| |||||||||||||||||||||||||||||||||||||||||||||
Repeat examination Resits will be available for both the continuous assessment and the written exam. |
|||||||||||||||||||||||||||||||||||||||||||||
Description This is a second course on computer programming. Students will learn to use structured data types including arrays (known as lists in some programming languages) and dictionaries (known as hash-maps in some programming languages). Students will be able to design simple algorithms using these structures, and write and debug computer programs requiring these data structures. Students will also learn how to write procedures/functions. | |||||||||||||||||||||||||||||||||||||||||||||
Learning Outcomes 1. write, debug and test computer programs using structured data types (arrays and dictionaries). 2. write, debug and test computer programs using functions/procedures. 3. design algorithms for solving computational problems requiring structured data types and functions/procedures. 4. estimate the complexity of computer programs involving structured data types and functions/procedures. | |||||||||||||||||||||||||||||||||||||||||||||
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
Arrays/listsArrays/lists: basics, iteration, algorithmsDictionaries/hash-mapsdictionary properties, using dictionaries in algorithmsFunctionsWriting functions, designing good functions, using functions, computational costsAlgorithmsAlgorithms using arrays and dictionaries, properties of those algorithms, implementation of those algorithmsSorting, searchingselection sort, insertion sort and binary search | |||||||||||||||||||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||||||||||||||||||
Indicative Reading List | |||||||||||||||||||||||||||||||||||||||||||||
Other Resources None | |||||||||||||||||||||||||||||||||||||||||||||