Learning Outcomes:
On completion of this module students should be able to:
- Understand how to determine the amount of resources (such as time and storage) necessary to execute a particular algorithm (algorithm analysis)
- Describe the object-oriented programming constructs needed to encode an algorithm
- Understand the structure, nature and use of fundamental data structures including, Arrays, Linked Lists, Stacks, Queues, Lists, Trees, Priority Queues
- Understand the object-oriented programming constructs needed to encode a data structure and its access algorithms
- Design programs using these constructs to solve large problems.
- Successfully write, compile, debug and run programs using these constructs.