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

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.

Show/hide contentOpenClose All

Curricular information is subject to change

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
Autonomous Student Learning

69

Lectures

30

Laboratories

26

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

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
Examination: End-of-trimester closed-book examination. 2 hour End of Trimester Exam No Graded No

60

Continuous Assessment: Programming assignments. Varies over the Trimester n/a Graded No

40

Carry forward of passed components
No

Resit In Terminal Exam
Summer Yes - 2 Hour
Feedback Strategy/Strategies

• Group/class feedback, post-assessment
• Self-assessment activities

How will my Feedback be Delivered?

Not yet recorded.

Name Role
Mr Congcong Wang Tutor
Gechuan Zhang Tutor
Timetabling information is displayed only for guidance purposes, relates to the current Academic Year only and is subject to change.

There are no rows to display