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 Array |
|||||||||||||||||||||||||||||||||||||||||||
Description To introduce the student to more advanced programming concepts and their implementation in C. To introduce very simple algorithms. To show how simple systems can be implemented in C. | |||||||||||||||||||||||||||||||||||||||||||
Learning Outcomes 1. Design solutions to problems using a top-down approach 2. Implement solutions to problems using the advanced features of the C programming language. 3. Apply problem-solving techniques to novel problems 4. Design and implement simple systems. 5. investigate online and other available resources to ascertain the most appropriate software library to use in a given situation. | |||||||||||||||||||||||||||||||||||||||||||
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
Memory ManagementWhy use memory management? Introduction to pointers. Using pointers effectively. Pointers and arrays, including one and two-demensional arrays.Advanced FunctionsPassing parameters revisited. pass-by-value, and pass-by-reference returning data from functions. using pointers with functions.Simple AlgorithmsIntroduction to recursion. Searching through arrays. Sorting arrays (e.g. SelectionSort, Insertion sort, Quicksort). | |||||||||||||||||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||||||||||||||||
Indicative Reading List
| |||||||||||||||||||||||||||||||||||||||||||
Other Resources None | |||||||||||||||||||||||||||||||||||||||||||