Difference between revisions of "SKE Algo II (Winter 2019)"

From srakrn | Wiki
Jump to navigation Jump to search
Line 30: Line 30:
  
 
{|class="wikitable sortable"
 
{|class="wikitable sortable"
!data-sort-type="date"|Date!!Class!!Video!!Homeworks!!Notes
+
!data-sort-type="date"|Date!!Class!!Annoucements!!Homeworks!!Notes
 
|-
 
|-
 
|17/01/2020||Introduction to Algorithm, Stable Marriage Problem||-||-||Video will not be provided.
 
|17/01/2020||Introduction to Algorithm, Stable Marriage Problem||-||-||Video will not be provided.

Revision as of 23:42, 31 January 2020

This is the course homepage offered by teaching assistant. For discussions and public announcements, please kindly join the course's Facebook group.

Instructor and TA

Instructor

Asst. Prof. Dr. Thanawin Rakthanmanon [1]
Data Analysis and Knowledge Discovery Laboratory, Kasetsart University

Contact

E-mail: [email protected], [email protected]

TA

Sirakorn Lamyai [2]
Theory Research Group, Kasetsart University

Contact

E-mail: [email protected]
Facebook: Observe my real name

Office hours

Office hours are offered by appointment, with the suggested time on Wednesdays afternoon. However, this is flexible.

Main textbooks

Jon Kleinberg, Éva Tardos. Algorithm Design. Pearson.

Main textbook available for purchase as an online e-book format at [3]

Course contents

Note: You need to be the member of this course's Facebook group in order to access files or videos.

Date Class Annoucements Homeworks Notes
17/01/2020 Introduction to Algorithm, Stable Marriage Problem - - Video will not be provided.
24/01/2020 Greedy Algorithm: Job Scheduling (Minimised Maximum Lateness)
31/01/2020 Class dismissed: Kaset Faire - -
07/02/2020 Graph Algorithm: MST, Union-Find (Disjoint set)
14/02/2020 Divide and Conquer I: Merge sort, Counting inversions
21/02/2020 Divide and Conquer II: Closest pair, Amortised analysis
28/02/2020 Dynamic Programming I: Weighted interval scheduling
Midterm Examination
13/03/2020 Dynamic Programming II: Longest common sub-sequence, Matrix multiplication, Knapsacks
20/03/2020 Dynamic Programming III: Shortest pairs without negative cycles, All-pair shortest paths
27/03/2020 Network Flow I: Maximum flow, Minimum cut, Ford-Fulkerson
03/04/2020 Network Flow II: Edmon-Karp, Applications
10/04/2002 NP Completeness I
17/04/2020 NP Completeness II
24/04/2020 Interesting Data Structures
1/5/2020 Introduction to Approximate Algorithms
Final Examination

Score announcements

This section is currently empty, waiting for contents to be added.

Grading rubrics along with quiz scores will be announced here.