The concept of an algorithm. The basic structures of a C/C++ program: variables, types, declarations, expressions, input/output structures, flow control structures. Debugging and good programming style. Vectors and arrays. Algorithms to search and sort vectors and arrays. Basic concepts of efficiency of algorithms. Functions in C/C++. Recursion and the divide-and-conquer paradigm. Classes and libraries in C/C++.
Prerequisite graph
Available indexes
| Mon | Tue | Wed | Thu | Fri | |
|---|---|---|---|---|---|
| 1130 | 70190 LAB (LA) 1130-1330 Mon COMP LAB 1 Wk4,7,10,12 | ||||
| 1200 | |||||
| 1230 | |||||
| 1300 | |||||
| 1330 | COMMON LEC (LE) 1330-1430 Mon SPMS-LT5 | ||||
| 1400 | |||||
| 1430 | 70190 TUT (T) 1430-1530 Fri SPMS-LT5 Wk2-13 | ||||
| 1500 |
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.