CS3230R: Design and Analysis of Algorithms - R

Basic Information:

Modular credits: 1

Prerequisite: CS3230-R

This 1-MC module adds a research component to the host module, enabling students to acquire more in-depth understanding of the research issues pertaining to the subject matter.

Lecturer:

Name : Rahul Jain

Office : S15-04-01

Email: first name at comp.nus.edu.sg

Phone: 65168826 (off).

Evaluations:

Students are required to read, understand and present materials on algorithms (approximately equal to a chapter in a book). They are evaluated on the clarity of their understanding and presentation.

Presentations:

2011-2012 : Term 2

Presentation on ‘Text Searching’ (source: Book “Algorithms” by R. Johnsonbaugh and M. Schaefer) by Aldrian Obaja: slides

Presentation on ‘Local Search’ (source: Book “Algorithm Design” by Jon Kleinberg and Eva Tardos) by Joe Chee: report

Presentation on ‘Network Flows’ (source : Book “Algorithm Design” by Jon Kleinberg and Eva Tardos) by Koh Zi Chun: slides

Presentation on ‘Approximation Algorithms’ (source: Book “Algorithm Design” by Jon Kleinberg and Eva Tardos) by Ong Jit Sheng, Jonathan: slides

Presentation on ‘Extending the limit of tractability’ (source: Book “Algorithm Design” by Jon Kleinberg and Eva Tardos) by Ye Kaiqi: slides

Presentation on ‘Randomized Algorithms’ (source: Book “Algorithm Design” by Jon Kleinberg and Eva Tardos) by Zhou Jun: slides

2011-2012 : Term 1

Presentation on ‘Online algorithms’ (source: Book “Introduction to Algorithms” by Cormen, Leiserson and Rivest) by Shawn Tan: slides