Module Details

Module Code: DATA
Module Title: Data Structures and Algorithms
Title: Data Structures and Algorithms
Module Level:: 6
Credits:: 5
Module Coordinator: Nigel Whyte
Module Author:: Aine Byrne
Domains:  
Module Description: To introduce the student to Data structures and Algorithms, with an emphasis on application to general problem solving.
 
Learning Outcomes
On successful completion of this module the learner will be able to:
# Learning Outcome Description
LO1 Design and implement Abstract Data Types including lists, stacks, queues, rings, maps, etc.. and their corresponding algorithms;
LO2 Implement a variety of structures and algorithms for storing, searching and sorting data;
LO3 Outline a range of algorithms for the basic data structures in the areas of graph theory.
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
No Co Requisites listed
 
Indicative Content
Array Algorithms
Review of vectors and matrices, basic array algorithms
Data Structures and Algorithms
Lists, stacks, queues, rings, maps, Hash tables and collision strategies
Basic Graph Theory
Definitions, Representing and applications of simple graphs, Graph theory algorithms.
Sorting Algorithms
Simple sorting, bubble, selection, insertion, radix algorithms
Searching Algorithms
Linear, binary and hashing. Also Graph searching.
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,2
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,3
Non-marked No
Assessment Description
Group project to design, implement and code the structures and algorithms of a given application (e.g. A Car wash application) and presented in report format
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. Will involve choosing and applying appropriate data structures and algorithms.
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 2.00 24
Tutorial Contact Tutorial exercises 12 Weeks per Stage 1.00 12
Estimated Learner Hours Non Contact Weekly study and assessment completion 15 Weeks per Stage 5.93 89
Total Weekly Contact Hours 3.00
 
Module Resources
Recommended Book Resources
  • Goodrich, Tamassia & Goldwasser. (2014), Data Structures & Algorithms in Java, 6th. Wiley, [ISBN: 9781118808573].
  • Frank M. Carrano, Timothy Henry. (2015), Data Structures and Abstractions with Java, 4th. Pearson, [ISBN: 9780133744057].
Supplementary Book Resources
  • Aditya Y. Bhargava. (2016), Grokking Algorithms, Manning Publications, p.256, [ISBN: 9781617292231].
This module does not have any article/paper resources
Other Resources
Discussion Note: