This course aims to give you a systematic introduction to data structures and algorithms for constructing efficient computer programs. Emphasis is on data abstraction issues in the program development process, and on the design of efficient algorithms. Simple algorithmic paradigms such as greedy algorithms, divide-and-conquer algorithms and dynamic programming will be introduced. Elementary analyses of algorithmic complexities will also be taught.
| Academic Units | 3 |
| Exam Schedule | Tue May 06 2025 00:00:00 GMT+0000 (Coordinated Universal Time) 09:00-11:00 |
| Grade Type | Letter Graded |
| Department Maintaining | MATH(SPS) |
| Prerequisites | PS0001 OR BS1009 OR BG2211 & CB0494(Corequisite) OR CB0494(Corequisite) & CH2107 OR CV1014 OR MS1008 OR MA1008 |
| Not Available to Programme | ACBS, ACC, ACDA, ADM, AERO, AISC, ARED, ASEC, BACF, BASA, BCE, BCG, BEEC, BIE, BMS, BS, BSB, BSPY, BUS, CBE, CBEC, CE, CEE, CEE 1, CEEC, CHEM, CHIN, CMED, CNEL, CNLM, COMP, CS, CSC, CSEC, CVEC, DSAI, ECDS, ECMA, ECON, ECPP, ECPS, EEE, EEE 1, EEEC, EESS, ELAH, ELH, ELHS, ELPL, ENE, ENE 1, ENEC, ENG, ESPP, HIST, HSCN, HSLM, IEEC, IEM, LMEL, LMPL, LMS, MACS, MAT, ME 1, ME(DES), ME(IMS), ME(NULL), ME(RMS), MEEC(DES), MEEC(IMS), MEEC(NULL), MEEC(RMS), MS, MS-2ndMaj/Spec(MSB), MTEC, PHIL, PHY, PLCN, PLHS, PPGA, PSLM, PSMA, PSY, REP, SCED, SOC, SPPE, SSM |
| Not Available to All Programme | (Admyr 2011-2017) |
| Index | Type | Group | Day | Time | Venue | Remark |
|---|
0930
1030
1130
1230
1330
1430
1530
1630
1730
We would encourage you to review with the following template.
AY Taken: ...
Assessment (Optional): ...
Topics (Optional): ...
Lecturer (Optional): ...
TA (Optional): ...
Review: ...
Final Grade (Optional): ...