The course material will be delivered by laboratory based lectures where learners can use a programming environment to explore data structures as they are introduced. Learners will undertake worksheets on topics and problems discussed in class. Students will also be assigned a project to implement an application related to the material covered. They will be expected to participate in class discussions on the materials covered and describe their methods used to solve problems.
Module Aim:
To develop further the language of computational structures with emphasis on the design and analysis of a range of algorithms.
Learning Outcomes
On successful completion of this module the learner should be able to:
LO1
Design and implement a variety of non-linear structures for storing data and their corresponding algorithms;
LO2
Use recursion in algorithmic implementations;
LO3
Recognise the importance of algorithm complexity along with techniques of Algorithms Design.
Pre-requisite learning
Module Recommendations
This is prior learning (or a practical skill) that is recommended before enrolment in this module.
No recommendations listed
Incompatible Modules
These are modules which have learning outcomes that are too similar to the learning outcomes of this module.
No incompatible modules listed
Co-requisite Modules
No Co-requisite modules listed
Requirements
This is prior learning (or a practical skill) that is mandatory before enrolment in this module is allowed.
1st year Programming or equivalent.
2nd year Data Structures and Algorithms I
Module Content & Assessment
Indicative Content
Review and Introduction
Review basic ADTs with Introduction Dynamic storage
Individual project to design, implement and code a given application, presented in report format. Involves choosing and designing custom structures and algorithms. Collaboration project with Advanced programming
1,2
50.00
Week 9
Project
Take Home sheet : to solve a set of unseen problems.
Some will involve choosing and applying appropriate data structures and algorithms. Others will involve critically choosing, analysing and designing custom data structures and efficient algorithmic solutions.
1,2,3
30.00
Week 12
No Practical
No End of Module Formal Examination
SETU Carlow Campus reserves the right to alter the nature and timings of assessment