Registry
Module Specifications
Archived Version 2016 - 2017
| |||||||||||||||||||||||||||||||||||||
|
Description This is a continuing course on computer programming. Students will learn fundamental data structures and algorithms: their properties, their implementation and how and when to use them in computational problem solving. The material will include linked lists, stacks, queues, binary-search trees, quicksort, and other techniques, as appropriate). Students will also learn to use the technique of recursion. | |||||||||||||||||||||||||||||||||||||
|
Learning Outcomes 1. understand 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. estimate the complexity of fundamental algorithms and data structures, and of computer programs using them. | |||||||||||||||||||||||||||||||||||||
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 ClassesIntroductory object-oriented programmingBasic data structuresLinked lists, stacks, queuesSortingQuicksort, mergesortTreesBinary trees, binary search trees, heapsHashingPrinciples of hash tables, their use in dictionariesRecursionUsing functions which call themselves | |||||||||||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||||||||||
|
Indicative Reading List | |||||||||||||||||||||||||||||||||||||
|
Other Resources None | |||||||||||||||||||||||||||||||||||||
| Programme or List of Programmes | |||||||||||||||||||||||||||||||||||||
| Archives: |
| ||||||||||||||||||||||||||||||||||||