Latest Module Specifications
Current Academic Year 2025 - 2026
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
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/lists Arrays/lists: basics, iteration, algorithms Dictionaries/hash-maps dictionary properties, using dictionaries in algorithms Functions Writing functions, designing good functions, using functions, computational costs Algorithms Algorithms using arrays and dictionaries, properties of those algorithms, implementation of those algorithms Sorting, searching selection sort, insertion sort and binary search | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Indicative Reading List Books: None Articles: None | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Other Resources None | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||