Explore UCD

UCD Home >

COMP20280

Academic Year 2024/2025

Data Structures (COMP20280)

Subject:
Computer Science
College:
Science
School:
Computer Science
Level:
2 (Intermediate)
Credits:
5
Module Coordinator:
Dr Aonghus Lawlor
Trimester:
Spring
Mode of Delivery:
On Campus
Internship Module:
No
How will I be graded?
Letter grades

Curricular information is subject to change.

The key objective of this module is to provide students with a grounding in essential data structures through Java.

Students will build their own repository of data structures including linked lists, stacks, queues, deques, trees, hashtables. Designing and building the data structures in Java will provide insight into how the data structures are constructed, their performance characteristics, and their wider use in computer science.

This module requires a reasonable level of Java ('Introducton to Java' is essential).

About this Module

Learning Outcomes:

On completion of this module, students will be able to:

1) Program competently using Java.
2) Understand the inner workings of core data structures from linked structures to non-linear structures.
3) Analyse the performance characteristics of data structures (space complexity and time complexity)
4) Know how to use the most appropriate data structures for a particular algorithm.

Indicative Module Content:


1. Java Collections, Generics, Iterators
2. Linked Lists (singly, doubly, circularly)
3. Algorithm Analysis
4. Recursion
5. Stacks, Queues, Deques
6. Trees
7. Priority Queues
8. Maps, Hashtables, Skip Lists
9. Binary Search Trees, AVLTrees, Splay Trees
10. Red-Black Trees

Student Effort Hours:
Student Effort Type Hours
Lectures

24

Practical

24

Autonomous Student Learning

80

Total

128


Approaches to Teaching and Learning:
1. Practical Lab Sessions
2. Continuous assessment
3. Lectures

Requirements, Exclusions and Recommendations

Not applicable to this module.


Module Requisites and Incompatibles
Required:
COMP20250 - Introduction to Java, COMP20300 - Java Programming (Mixed Delive, COMP20350 - Object-Oriented Programming

Incompatibles:
COMP20230 - Data Struc & Algorithms (Conv)

Additional Information:
Students must have attempted COMP20350 *OR* COMP20300 *OR* COMP20250 prior to taking this module.


 

Assessment Strategy
Description Timing Component Scale Must Pass Component % of Final Grade In Module Component Repeat Offered
Assignment(Including Essay): Assignment involving solution of data structure problems. Week 11 Other No
40
No
Exam (In-person): In person end of semester exam End of trimester
Duration:
2 hr(s)
Other No
60
No

Carry forward of passed components
Yes
 

Resit In Terminal Exam
Summer Yes - 2 Hour
Please see Student Jargon Buster for more information about remediation types and timing. 

Feedback Strategy/Strategies

• Feedback individually to students, post-assessment
• Group/class feedback, post-assessment

How will my Feedback be Delivered?

Not yet recorded.

Timetabling information is displayed only for guidance purposes, relates to the current Academic Year only and is subject to change.
Spring Lecture Offering 1 Week(s) - 20, 21, 23, 24, 25, 26, 29, 30, 31, 32 Mon 09:00 - 09:50
Spring Lecture Offering 1 Week(s) - 20, 21, 22, 23, 24, 25, 26, 29, 30, 31, 32, 33 Wed 10:00 - 10:50
Spring Practical Offering 1 Week(s) - 21, 22, 23, 24, 25, 26, 29, 30, 31, 32, 33 Wed 14:00 - 15:50
Spring Practical Offering 2 Week(s) - 21, 22, 23, 24, 25, 26, 29, 30, 31, 33 Fri 14:00 - 15:50