COMP2002J Data Struc and Algorithms 1

Academic Year 2022/2023

This module is suitable for students interested in the design and analysis of efficient algorithms and data structures. In this module students learn how to analyse, design and implement a finite set of well-defined instructions for accomplishing some task (an algorithm) along with introductory ways of storing data in a computer so that it can be used efficiently (a data structure). A well-designed data structure or algorithm allows a variety of critical operations to be performed using minimal resources, both in terms of execution time and memory space. Students will use an object-oriented paradigm as the framework of choice for building robust and reusable algorithms and data structures in this module.

Show/hide contentOpenClose All

Curricular information is subject to change

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)- Understand 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.

Student Effort Hours: 
Student Effort Type Hours
Lectures

28
Laboratories

24
Autonomous Student Learning

73
Total

125
Approaches to Teaching and Learning:
active/task-based learning; peer and group work; lectures; lab work; 
Requirements, Exclusions and Recommendations

Not applicable to this module.


Module Requisites and Incompatibles
Additional Information:
This module is delivered overseas and is not available to students based at the UCD Belfield or UCD Blackrock campuses.


 
Assessment Strategy  
Description Timing Open Book Exam Component Scale Must Pass Component % of Final Grade
Continuous Assessment: This includes a series of in module assessments such as quizzes, group assignments, and projects. Varies over the Trimester n/a Graded Yes

100

Carry forward of passed components
Yes
 
Remediation Type Remediation Timing
In-Module Resit Prior to relevant Programme Exam Board
Please see Student Jargon Buster for more information about remediation types and timing. 
Feedback Strategy/Strategies

• Feedback individually to students, post-assessment
• Online automated feedback

How will my Feedback be Delivered?

Not yet recorded.

Name Role
Dr Fatemeh Golpayegani Lecturer / Co-Lecturer
Dr Seán Russell Lecturer / Co-Lecturer