New: hide modules, set class colours and see S1 and S2 exams together

You are viewing an old semester: AY2024/2025 Semester 2
Class times, venues and exams may have changed since. View current offering
ModsCT2006AY2024/2025 Semester 2

Algorithm Design Analysis

AY2024/2025 Semester 2

This course aims to teach you how to conduct complexity analysis of simple algorithms. It will further develop your knowledge and skills about algorithm design. You will learn to design algorithms using approaches like greedy and dynamic programming to solve various problems. For examples, shortest-path, minimum spanning tree, the longest common subsequence, 0/1 Knapsack problem. You will understand the concept and implementation of finite state machines and use regular expressions to specify sets of strings. You will also learn the concepts of complexity classes P & NP and apply greedy heuristic approach to solve NP-complete problems.

AUs3.0 AUs
Categories
Core
Mutually Exclusive WithSC2301
Exam

Available indexes

These class times are for AY2024/2025 Semester 2 only. See the current timings
MonTueWedThuFriSat
1330

14546 TUT (COMP2)

1330-1620 Sat

N4-1C-09A

Wk1-6

1400
1430
1500
1530
1600

Found something wrong?

NTUMods is built and maintained by one person, so a short note goes a long way. Pick what fits, add the details, and I will look at it.

I'll use this to follow up with you.

Attaches your saved timetables and settings to help debug the issue. On by default, turn off to exclude it.

Developer? Open an issue or PR.