SLIDES

You can download the slides that’s been used in class from the links bellow:

Lecture 1a Intro To SE Concept

Lecture 1b Correctness

Lecture 2 Introduction of Complexity

Lecture 3 Asymptotic Time Complexity

Lecture 4 Mathematical Analysis of Recursive Algorithm

Lecture 5 Mathematical Analysis of Non-recursive Algorithm

Lecture 6 Brute Force

Lecture 7 Greedy Technique

Lecture 8 Divide and Conquer

Lecture 9 Backtracking

Lecture 10 Branch Bound

Lecture 11 Dynamic Programming

Lecture 12 String Matching