F29YN - Design and Analysis of Computer Algorithms

Course leader(s):

Aims

Students will learn basic concepts in algorithm design which will allow them to analyse algorithms, including recursion and divide-and-conquer strategies. They will also learn how to use raph algorithms, Internet algorithms and random algorithms. The course also covers progress in algorithms of P and NP complexity classes and their applications.

Syllabus

1. Understand basic concepts in algorithm design via examples. (1.1 Design and Analysis of Computer Algorithms Xidian CS265004)

2. Learn how to analyse algorithms, including using recursion and divide-and-conquer strategies (2.1 Design and Analysis of Computer Algorithms Xidian CS265004)

3. Employ graph algorithms/Internet algorithms/random algorithms in numerous scenarios (3.1 Design and Analysis of Computer Algorithms Xidian CS265004)

4. Learn about and apply recent developments in algorithms in the P and NP complexity classes (4.1 Design and Analysis of Computer Algorithms Xidian CS265004)

Learning outcomes

By the end of the course, students should be able to do the following:

Understand basic concepts in algorithm design
Analyse algorithms, including recursion and divide-and-conquer strategies
Use graph algorithms/Internet algorithms/random algorithms
Apply new progress in algorithms of P and NP complexity classes

Further details

Curriculum explorer: Click here

SCQF Level: 9

Credits: 10