Skip to main content

Module

CSC2032 : Algorithm Design and Analysis

  • Offered for Year: 2020/21
  • Module Leader(s): Dr Jason Steggles
  • Owning School: Computing
  • Teaching Location: Newcastle City Campus
Semesters
Semester 1 Credit Value: 10
ECTS Credits: 5.0

Aims

Knowledge of a range of key application areas where algorithmic solutions are required.
Understand the key issues in algorithm design.
Understand what makes a "good" algorithm.
Explore a range of techniques for algorithm design.
Ability to analyse an algorithm’s complexity.

Outline Of Syllabus

Introduction to Algorithms:
•       Introduce the idea of an algorithm
•       Documenting an algorithm and the use of pseudo code
•       Introduction to algorithm analysis

Fundamental Algorithmic Problems:
•       Searching
•       Sorting
•       String searching
•       Graph problems

Algorithm Analysis:
•       Asymptotic analysis of upper and average complexity bounds
•       Identifying differences among best, average, and worst case behaviours
•       Standard complexity classes
•       Using recurrence relations to analyze recursive algorithms
•       NP Complete problems

Algorithm Design Techniques:
•       General ideas for algorithm development
•       Brute-force algorithms
•       Greedy algorithms
•       Divide-and-conquer
•       Backtracking

Teaching Methods

Module leaders are revising this content in light of the Covid 19 restrictions.
Revised and approved detail information will be available by 17 August.

Assessment Methods

Module leaders are revising this content in light of the Covid 19 restrictions.
Revised and approved detail information will be available by 17 August.

Reading Lists

Timetable