Version 1 A review of COMP7500 2019-12-03 Dynamic programming step 1 recurrence: 1) Base case (0,0) 2) General case 1) (0,j) 2) (i,j) step 2 pseudocode 1) table 2) fill from [0][j]
2019-12-04 Go through Amortised analysis three method 1) Aggregate method 2) Accounting method 3) Potential method
2019-12-05 Go through Graph NP
2019-12-09 Go through Graph 1/2
Practise Big-O & recurence (past years questions)
2019-12-10 TODO: cheat sheet Dynamic programming execise step 2 time complexity
Go through Graph NP
Practise all tutorials DP AB Re
2019-12-11 practise t2
2019-12-12 TODO list script sheet check notibility 2018-final-video Dynamic programming Amortised analysis NP graph 6 algorithms
2019-mid Q1&2
2019-12-14 TODO restart
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent