ALGORITHMS & DATA STRUCTURES 2
- Module code: CS211
- Credits: 5
- Semester: 2
- Department: COMPUTER SCIENCE
Fundamentals and implementation of Binary Search Trees; Balancing Binary Search Trees; Tree traversals (depth and breadth-first); Graph representations; Hash Tables; Algorithm analysis: upper and average complexity bounds, best, average and worst case algorithm behaviour; Algorithm strategies: brute force, greedy, divide and conquer and backtracking algorithms. Selected advanced topics in Algorithms and Data Structures.
On successful completion of the module, students should be able to:
|Teaching & Learning methods|
Timetable under review
The Lectures timetable allows you to search by most courses that are offered by the University.
The Venues timetable allows you to search the timetable by venue.
The Departments timetable allows you to search the timetable by department.
The Students timetable is a personalised timetable. The student is required to login using their Student ID and Password.