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

Historical snapshot — AY2022/2023 Semester 1 · View current offering →
ModsCE2101AY2022/2023 Semester 1

Algorithm Design Analysis

AY2022/2023 Semester 1

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 ProgrammeBCG, 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

10498 LAB (SE1)

0830-1020 Thu

HWLAB1

Odd Weeks

900
930
1000
1030

10364 LAB (SE4)

1030-1220 Tue

HWLAB2

Odd Weeks

10503 LAB (SE3)

1030-1220 Tue

HWLAB1

Even Weeks

1100
1130
1200
1230

COMMON LEC (L2)

1230-1320 Mon

LT1

10489 LAB (SS9)

1230-1420 Wed

HWLAB2

Even Weeks

1300
1330

10562 TUT (SSP5)

1330-1420 Wed

TR+21

Wk2-13

1400
1430

10498 TUT (SE1)

1430-1520 Wed

TR+29

Wk2-13

10562 LAB (SSP5)

1430-1620 Thu

HWLAB1

Even Weeks

1500
1530
1600
1630

10364 TUT (SE4)

1630-1720 Tue

TR+37

Wk2-13

10489 TUT (SS9)

1630-1720 Wed

TR+16

Wk2-13

10503 TUT (SE3)

1630-1720 Thu

TR+15

Wk2-13

COMMON LEC (L2)

1630-1720 Fri

LT1

1700