Explore UCD

UCD Home >

COMP2014J

Academic Year 2024/2025

Data Structs & Algs II (S/E) (COMP2014J)

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

Curricular information is subject to change.

This module extends the set of standard algorithms addressed in Data Structures and Algorithms I. It covers tree structures, linked structures (graphs), text processing and representation, as well as the core algorithms that complement each structure. A range of implementation techniques are examined, with emphasis being given to the complexity of the various solutions and their applicability to different problem domains.

About this Module

Learning Outcomes:

On completion of this module, students will be able to:
- Implement tree data structures and use them in programs.
- Explain how tree balance affects the efficiency of various binary search tree operations.
- Show how different approaches to tree balancing affect the tree structure.
- Describe the heap property and the use of heaps as an implementation of priority queues.
- Solve problems using graph algorithms, including depth-first and breadth-first search, shortest paths, and minimum spanning trees.
- Discuss and contrast how the the runtime and memory efficiency an abstract data type is affected by the choice of implementation strategy.
- Implement simple search algorithms and explain the differences in their time complexities.
- Explain how multiple data structures can be used in concert to solve problems.

Student Effort Hours:
Student Effort Type Hours
Lectures

30
Laboratories

26
Autonomous Student Learning

69
Total

125

Approaches to Teaching and Learning:
Lectures, Laboratory Worksheets, Take-home Assignments.

Requirements, Exclusions and Recommendations

Not applicable to this module.


Module Requisites and Incompatibles
Incompatibles:
COMP2003J - Data Struc and Algorithms 2

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 Component Scale Must Pass Component % of Final Grade In Module Component Repeat Offered
Assignment(Including Essay): Programming Assignment. Week 8, Week 9, Week 10 Graded No
20
 No
Assignment(Including Essay): Programming Assignment. Week 11, Week 12, Week 14 Graded No
20
 No
Exam (In-person): Final Written Exam. Takes place during BDIC Exam Period (Week 17/18). End of trimester
Duration:
2 hr(s)
 Graded No
60
 No

Carry forward of passed components
No
 

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.

Name Role
Mr Congcong Wang Tutor
Gechuan Zhang Tutor
Print this page
Fill in the following details:
Enter the body of your query here.

From time to time UCD would like to send you further information that we feel, based on your enquiry, would be of interest to you.