ALGORITHMS & DATA STRUCTURES 2
- Module code: CS211
- Credits: 5
- Semester: 2
- Department: COMPUTER SCIENCE
- International:
 | Overview |
| | 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. |
 | Learning Outcomes |
| | On successful completion of the module, students should be able to: - Describe a variety of structures for storing data such as binary search trees, balanced binary trees and hash tables
- Outline a range of algorithms in the areas of data compression, cryptography and graph theory
- Explain various object-oriented programming concepts such as encapsulation, inheritance and polymorphism
- Design, develop, test and debug object-oriented programs in Java
- Apply knowledge of algorithm complexity and data structuring techniques to problem solving
|
| | Assessment |
| | - Continuous Assessment detail(s): Continuous Assessment up to 50%.
| Assessment type | Weighting | Duration | | Continuous Assessment | 50% | | | University scheduled written examination | 50% | 120 minutes | | Other | 0% | | | Total | 100% | 120 minutes | |
| | Repeat options |
| | - University scheduled written examination (Autumn): 120 minutes
|
Add to Memo | 
Print | 
Quick Link 
