Advanced Algorithmic Techniques With Applications

Training Provider: NANYANG TECHNOLOGICAL UNIVERSITY
Course Reference: TGS-2017505353
S$780

About This Course

The theory of algorithms is an important foundation of both Computer Science and Computer Engineering. This is a third course on algorithms to provide students with additional algorithmic techniques and expose them to the theory of computational complexity, which offers a deeper understanding of the demarcation between hard and easy problems.

What You'll Learn

DAY 1

Hard Problems and Complexity Theory

- Key ideas: Decision and optimization problems, P and NP, NP

- Completeness and reductions

- Sample Applications



Approximation Algorithms and Heuristics

- Key ideas: Heuristic vs approximation algorithms.

- Sample Applications: Set covering, TSP, scheduling.



DAY 2

Randomized Algorithms

- Key ideas: Monte Carlo and Las Vegas algorithms.

- Sample Applications: Hashing and Bloom filters



Introduction to Lower Bounds

- Key ideas: Lower bound theory

- Sample Applications: searching, sorting, etc.

Course Details

Duration 16 hours
Language English
Training Commitment Full Time
Total Enrolled New course
Back to All Courses
Note: To apply for this course, visit the SkillsFuture website or contact the training provider directly.

More Courses from NANYANG TECHNOLOGICAL UNIVERSITY

• Lead Sustainable Urban Projects – Apply leadership skills, strategically manage initiatives in...
Duration 135 hours
Fee After Subsidy S$5,100
Trainees will gain well-rounded employment opportunities with tech companies by providing them with ...
Duration 390 hours
Fee After Subsidy S$4,500
This 3-month course has been designed by industry professionals and practitioners to upgrade existin...
Duration 170 hours
Fee After Subsidy S$2,250