Module Details

Module Code: DATA
Module Title: Advanced Data Structures and Algorithms
Title: Advanced Data Structures and Algorithms
Module Level:: 7
Credits:: 5
Module Coordinator: Nigel Whyte
Module Author:: Aine Byrne
Domains:  
Module Description: 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 will be able to:
# Learning Outcome Description
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.
Dependencies
Module Recommendations

This is prior learning (or a practical skill) that is recommended before enrolment in this module.
No recommendations listed
Co-requisite Modules
No Co-requisite modules listed
Additional Requisite Information
Advanced Programming or equivalent
 
Indicative Content
Review and Introduction
Review basic ADTs with Introduction Dynamic storage
Non-linear Structures and Applications
Trees, Balanced trees, Tries, Heaps
Recursion
Recursive algorithms and their implementation
Complexity and Design techniques
Algorithm complexity, Algorithm Strategies, Analysis of simple algorithms, Design techniques, Advanced Sorting algorithms
Module Content & Assessment
Assessment Breakdown%
Continuous Assessment20.00%
Project80.00%

Assessments

Full Time

Continuous Assessment
Assessment Type Other % of Total Mark 20
Timing Week 4 Learning Outcomes 1,3
Non-marked No
Assessment Description
Class test either online or in-class
Project
Assessment Type Project % of Total Mark 50
Timing Week 9 Learning Outcomes 1,2
Non-marked No
Assessment Description
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
Assessment Type Project % of Total Mark 30
Timing Week 12 Learning Outcomes 1,2,3
Non-marked No
Assessment Description
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.
No Practical
No End of Module Formal Examination
Reassessment Requirement
Coursework Only
This module is reassessed solely on the basis of re-submitted coursework. There is no repeat written examination.
Reassessment Description
The module can be reassessed by repeating the original or new similar pieces of coursework as appropriate

SETU Carlow Campus reserves the right to alter the nature and timings of assessment

 

Module Workload

Workload: Full Time
Workload Type Workload Category Contact Type Workload Description Frequency Average Weekly Learner Workload Hours
Lecture Contact Lecture 12 Weeks per Stage 3.00 36
Laboratory Contact Laboratory 12 Weeks per Stage 1.00 12
Tutorial Contact Tutorial Exercises 12 Weeks per Stage 1.00 12
Estimated Learner Hours Non Contact Weekly Study 15 Weeks per Stage 4.33 65
Total Weekly Contact Hours 5.00
 
Module Resources
Recommended Book Resources
  • Wisnu Anggoro. (2018), C++ Data Structures and Algorithms, Packt Publishing, [ISBN: 9781788835213].
  • Michael Main, Walter Savitch. (2011), Data Structures and Other Objects Using C++, Addison Wesley, p.848, [ISBN: 9780132129480].
  • Frank M. Carrano, Timothy Henry. (2015), Data Structures and Abstractions with Java, 4th. Pearson, [ISBN: 9780133744057].
Supplementary Book Resources
  • Michael T. Goodrich,Roberto Tamassia,Michael H. Goldwasser. (2014), Data Structures and Algorithms in Java, 6th. John Wiley & Sons, p.736, [ISBN: 9781118771334].
This module does not have any article/paper resources
Other Resources
Discussion Note: