Show/hide contentOpenClose All
Curricular information is subject to change
On completion of this module, you should be able to:
- understand the process for developing and testing algorithms
- be familiar with Big O notation and complexity analysis
- understand various algorithmic strategies for solving problems
- be familiar with the common sorting, searching and string-based algorithms
- be able to implement, as well as both theoretically and empirically analyze, a wide range of algorithms in Java
This module will cover:
* Introduction to Algorithm Analysis
* Pseudo Code
* Simple Recursive Algorithms
* Backtracking Algorithms
* Divide and Conquer Algorithms
* Dynamic Programming Algorithms
* Greedy Algorithms
* Branch and Bound Algorithms
* Brute Force Algorithms
* Randomized Algorithms
* Calculating Upper and Lower Bounds
Student Effort Type | Hours |
---|---|
Lectures | 24 |
Practical | 24 |
Total | 48 |
Not applicable to this module.
Description | Timing | Component Scale | % of Final Grade | ||
---|---|---|---|---|---|
Assignment: The assignments include the implementation of various algorithms covered in the module. | Throughout the Trimester | n/a | Graded | Yes | 20 |
Class Test: In-class quizzes. | Throughout the Trimester | n/a | Graded | No | 10 |
Examination: Paper-based Final Exam. | 2 hour End of Trimester Exam | No | Graded | Yes | 70 |
Resit In | Terminal Exam |
---|---|
Summer | Yes - 2 Hour |
• Feedback individually to students, post-assessment
Feedback on assessments will be provided to each individual with an opportunity to discuss grades in person offered.
Name | Role |
---|---|
Mr Jack Geraghty | Tutor |