COMP2003J Data Struc and Algorithms 2

Academic Year 2019/2020

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
Lectures

30

Laboratories

24

Autonomous Student Learning

71

Total

125

Approaches to Teaching and Learning:
Lectures
Active/task-based learning
Reflective learning
Lab/studio work
Enquiry & problem-based learning 
Requirements, Exclusions and Recommendations

Not applicable to this module.


Module Requisites and Incompatibles
Incompatibles:
COMP2014J - Data Structs & Algs II (S/E)

 
Assessment Strategy  
Description Timing Open Book Exam Component Scale Must Pass Component % of Final Grade
Continuous Assessment: Quizzes, Programming Assignment, Written Assignments Throughout the Trimester n/a Graded No

100


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, on an activity or draft prior to summative assessment
• Feedback individually to students, post-assessment
• Self-assessment activities

How will my Feedback be Delivered?

Not yet recorded.

Data Structures and Algorithms in Java (by Goodrich and Tamassia)
Name Role
Dr David Lillis Lecturer / Co-Lecturer
Mr John O'Connor Lecturer / Co-Lecturer
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