This course aims to (i) teach the concepts, implementations and applications of data structures such as arrays, linked lists, stacks, queues and trees that are important for building efficient algorithms; (ii) provide an introduction to algorithm analysis and design. These are essential for future computer science and computer engineering courses.
Prerequisite graph
Available indexes
| Mon | Tue | Wed | Thu | Fri | |
|---|---|---|---|---|---|
| 1430 | 10410 LAB (SR2) 1430-1620 Thu SWLAB2 | ||||
| 1500 | |||||
| 1530 | 10410 TUT (SR2) 1530-1620 Mon TR+16, ONLINE Wk2-9,11-13, Teaching Wk10 | ||||
| 1600 | |||||
| 1630 | COMMON LEC (SCL2) 1630-1820 Fri LT3, ONLINE Wk1-9,11-13, Teaching Wk10 | ||||
| 1700 | |||||
| 1730 | |||||
| 1800 |
Other offerings
Other relevant mods
Planning guides
View all articlesBDE · 17 min read
Complete NTU BDE List: Every BDE Category and Module (AY2026/2027 Semester 2)
A complete NTU BDE list by category: languages, business, computing, humanities, arts, science, engineering, and more. Updated for AY2026/2027 Semester 2. Browse all 780+ BDE modules on NTUMods.
STARS · 9 min read
How to Bid for a BDE at NTU (STARS Registration Guide)
Step-by-step: how NTU STARS bidding works, what to do in Round 1 vs Round 2, and how to still get your BDE during add/drop if your first choice fills up.
STARS · 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.