We've improved performance — pages load faster than before →

Historical snapshot — AY2021/2022 Semester 2 · View current offering →
ModsCE2101AY2021/2022 Semester 2

Algorithm Design Analysis

AY2021/2022 Semester 2

This course aims to develop your knowledge, understanding and skills about algorithm design and analysis. Upon the successful completion of this course, students shall be able to (i) apply additional analysis techniques in complexity analysis of recursive algorithms; (ii) apply, design and analyse algorithms using a number of approaches to solve various problems like sorting, shortest-path, minimum spanning tree, optimal sequencing for matrix multiplication, the longest common subsequence, string matching. Students will also learn the concepts of complexity classes P & NP and apply greedy heuristic approach to solve NP-complete problems.

AUs3.0 AUs
CategoriesCoreMinorsBDE
Not Available To ProgrammeBCE(2011-2019), BCG, CE(2011-2019), CEEC(2011-2019), CSC, CSEC, DSAI, EEE, EEEC, IEEC, IEM, MACS, REP(CSC)
Not Available To All Programme With(Admyr 2021-onwards),
Mutually Exclusive WithCE2001, CZ2001, CZ2101, SC2001
Exam

Available Indexes

MonTueWedThuFri
830

10209 LAB (SE1)

0830-1020 Mon

HWLAB1

Even Weeks

10499 LAB (SE1)

0830-1020 Mon

HWLAB1

Even Weeks

10506 LAB (SE1)

0830-1020 Mon

HWLAB1

Even Weeks

10491 LAB (REPA)

0830-1020 Wed

HWLAB3

Even Weeks

10498 LAB (BMS1)

0830-1020 Wed

HWLAB3

Even Weeks

900
930

10498 TUT (BMS1)

0930-1020 Thu

TR+5

Wk2-13

10497 TUT (SS2)

0930-1020 Fri

TR+31

Wk2-13

10499 TUT (SS2)

0930-1020 Fri

TR+31

Wk2-13

1000
1030

10497 LAB (BCS2)

1030-1220 Mon

HWLAB3

Even Weeks

1100
1130

COMMON LEC (CE2)

1130-1220 Tue

ONLINE

1200
1230
1300
1330

10209 TUT (SE1)

1330-1420 Mon

TR+9

Wk2-13

1400
1430

COMMON LEC (CE2)

1430-1520 Thu

ONLINE

1500
1530

10491 TUT (REPA)

1530-1620 Tue

TR+15

10506 TUT (REPA)

1530-1620 Tue

TR+15

1600