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.
| AUs | 3.0 AUs |
| Grade Type | |
| Prerequisite | PS0001, BS1009, BG2211, CB0494(Corequisite), CH2107, CV1014, MS1008, 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, PESC, PHIL, PHY, PLCN, PLHS, PPGA, PSLM, PSMA, PSY, REP, ROBO, SCED, SOC, SPPE, SSM |
| Not Available To All Programme With | (Admyr 2011-2017) |
| Not Available As BDE/UE To Programme | |
| Not Available As Core To Programme | |
| Not Available As PE To Programme | |
| Mutually Exclusive With | |
| Not Offered As BDE | |
| Not Offered As Unrestricted Elective | |
| Exam |
Total hours per week: 5 hrs
Available Indexes
| Mon | Tue | Wed | Thu | Fri | |
|---|---|---|---|---|---|
| 930 | |||||
| 1000 | |||||
| 1030 | |||||
| 1100 | |||||
| 1130 | |||||
| 1200 | |||||
| 1230 | |||||
| 1300 | |||||
| 1330 | |||||
| 1400 | |||||
| 1430 | |||||
| 1500 | |||||
| 1530 | |||||
| 1600 | |||||
| 1630 | |||||
| 1700 | |||||
| 1730 | |||||
| 1800 |
Other offerings
AY24/25
AY23/24
AY22/23
AY21/22
AY20/21
AY19/20
AY18/19