Algorithm Strategies

This course prepares students to analyse the time and space complexity of algorithms, apply brute force, divide and conquer, greedy and dynamic programming strategies, and explain backtracking and branch and bound strategies in problem solving. Study materials: Algorithmic Foundations (AL), Mathematical and Statistical Foundations (MSF).

Topics

1. Time and space complexity of algorithms
2. Brute force, divide and conquer, greedy and dynamic programming strategies
3. Backtracking and branch and bound strategies in problem solving

Each course outcome derives from one programme outcome.

1. CPMK0601

   Students are able to perform computational analysis using a computational thinking approach

   CPL06
2. CPMK0602

   Students are able to explain computing concepts using a computational thinking approach

   CPL06

CPL06

Analyse and implement fundamental concepts of mathematics, statistics, algorithms and computer systems as the foundation of computing.

–

Prerequisite for

• IF25-22016 Artificial Intelligence · 3 credits · Semester 4

• IF2211 Strategi Algoritma · 3 credits · Kode, semester 4→3