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

From srakrn | Wiki
Jump to navigation Jump to search
 
(23 intermediate revisions by the same user not shown)
Line 1: Line 1:
 +
This is the course homepage offered by teaching assistant. For discussions and public announcements, please kindly join the [https://www.facebook.com/groups/1968875023227388/ course's Facebook group].
 +
 +
Assigments will be assigned with Edufarm (Moodle). [https://edufarm.ku.ac.th/course/view.php?id=1192 Please visit the course's Edufarm website here].
 +
 
== Instructor and TA ==
 
== Instructor and TA ==
  
 
=== Instructor ===
 
=== Instructor ===
−
'''Asst. Prof. Dr. Thanawin Rakthanmanon'''
+
'''Asst. Prof. Dr. Thanawin Rakthanmanon''' [https://www.cpe.ku.ac.th/~fengtwr/]<br/>
 +
''Data Analysis and Knowledge Discovery Laboratory, Kasetsart University''
 +
 
 +
==== Contact ====
 +
 +
 
 +
=== TA ===
 +
'''Sirakorn Lamyai''' [https://srakrn.me/bio]<br/>
 +
''Theory Research Group, Kasetsart University''
 +
 
 +
==== Contact ====
 +
E-mail: [email protected]<br/>
 +
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 [https://www.pearson.com/us/higher-education/program/Kleinberg-Algorithm-Design/PGM319216.html]
 +
 
 +
== Course contents ==
 +
Note: You need to be the member of this course's Facebook group in order to access some files. Lecture videos posted to Google Drive requires University's Google Apps login.
 +
 
 +
{|class="wikitable sortable"
 +
!data-sort-type="date"|Date!!Class!!Video!!Homeworks!!Announcement/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)||-||-||''Class dismissed: Kaset Faire''
 +
|-
 +
|31/01/2020||''Class dismissed: Kaset Faire''||-||-||''Class dismissed: Kaset Faire''
 +
|-
 +
|07/02/2020||Graph Algorithm: MST, Union-Find (Disjoint set)||-||[[SKE_Algo_II_(Winter_2019)/Homework_0|Homework 0]]||''Class dismissed: Kaset Faire''
 +
|-
 +
|14/02/2020||Divide and Conquer I: Merge sort, Counting inversions||[https://drive.google.com/file/d/1-bEK7n-HkchIItTqGE1GfiRl7qOWGSa3/view?usp=sharing Google Drive]||[https://edufarm.ku.ac.th/mod/quiz/view.php?id=24304 Homework 1]||[https://www.facebook.com/groups/1968875023227388/permalink/2676900255758191/ Homework 0 submission list]
 +
|-
 +
|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 ==
 +
 
 +
=== Privacy codename form ===
 +
 
 +
By default, your score announcement will be identified with your (non-secret) student ID.
  
−
Data Analysis and Knowledge Discovery Laboratory, Kasetsart University
+
To preserve your privacy, you can opt-out score announcements or choose to get your score announced with anonymised codename instead of your student ID. To do that, fill the form [https://docs.google.com/forms/d/e/1FAIpQLSccEPjtPmXPNVcxnxM0O29zsEGRMSNRXMyxJl9cPab4IDmepQ/viewform?usp=sf_link here].
  
−
E-mail: fengtwr@ku.ac.th; [email protected]
+
=== Score announcement sheet ===
 +
To be added.

Latest revision as of 16:37, 20 February 2020

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

Assigments will be assigned with Edufarm (Moodle). Please visit the course's Edufarm website here.

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 some files. Lecture videos posted to Google Drive requires University's Google Apps login.

Date Class Video Homeworks Announcement/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) - - Class dismissed: Kaset Faire
31/01/2020 Class dismissed: Kaset Faire - - Class dismissed: Kaset Faire
07/02/2020 Graph Algorithm: MST, Union-Find (Disjoint set) - Homework 0 Class dismissed: Kaset Faire
14/02/2020 Divide and Conquer I: Merge sort, Counting inversions Google Drive Homework 1 Homework 0 submission list
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

Privacy codename form

By default, your score announcement will be identified with your (non-secret) student ID.

To preserve your privacy, you can opt-out score announcements or choose to get your score announced with anonymised codename instead of your student ID. To do that, fill the form here.

Score announcement sheet

To be added.

Retrieved from "https://srakrn.me/mediawiki/index.php?title=SKE_Algo_II_(Winter_2019)&oldid=113"