CP5150 - Algorithms and Complexity
| Credit points: | 03 |
| Year: | 2006 |
| Student Contribution Band: | Band 2 |
| Administered by: |
Measures of complexity; design of efficient algorithms; graph algorithms; matrix algorithms; arithmetic; NP-complete problems.
Learning Outcomes
- apply basic design strategies such as divide and conquer, dynamic programming and greedy methods in creating algorithms to solve problems;
- define complexity measures;
- determine algorithmic complexity;
- establish the correctness of algorithms;
- identify complexity measures with actual computing resources;
- recognise a basic set of NP-complete problems.
| Prerequisites: | CP2001 |
| Inadmissible Subject Combinations: | CP3050 |
Availabilities | |
| , , Study Period 2 | |
| Census Date 08-Sep-2006 | |
| Coord/Lect: | Assoc. Professor Hossein Ghodosi. |
| Contact hours: |
|
| , , Study Period 2 | |
| Census Date 08-Sep-2006 | |
| Coord/Lect: | Assoc. Professor Hossein Ghodosi. |
| Contact hours: |
|
Note: Minor variations might occur due to the continuous Subject quality improvement process, and in case of minor variation(s) in assessment details, the Subject Outline represents the latest official information.