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.
Prerequisite graph
Available indexes
| Mon | Tue | Wed | Thu | Fri | Sat | |
|---|---|---|---|---|---|---|
| 1330 | 14548 TUT (COMP2) 1330-1620 Sat Wk8-13 | |||||
| 1400 | ||||||
| 1430 | ||||||
| 1500 | ||||||
| 1530 | ||||||
| 1600 |
Other offerings
Other relevant mods
Planning guides
View all articlesSTARS · 9 min read
NTU STARS Guide 2026: Registration Rounds, Bidding & Planner Tips
NTU STARS planner guide — how bidding rounds work, how to prepare a shortlist before registration opens, and what to do when a module fills up. Includes a free STARS planner tool.
Module Planning · 6 min read
NTU Degree Audit: How to Check Your Graduation Requirements
How the NTU degree audit works, where to find it, and how to read it against your programme's core, BDE, UE, and AU requirements before you register for modules.
Module Planning · 6 min read
How to Plan NTU Modules Before STARS Opens: Step-by-Step
Step-by-step guide to planning NTU modules using NTUMods — map degree requirements, build your timetable, check prerequisites, balance workload, and lock in your plan before STARS bidding starts.