Announcement

Course has ended with the last contest!
Good luck to all of you in your other exams!

Contest #4 (16 Nov, 4-6pm) @PL5 --- [progress]

Homework 8 (due 14 November, 8am)

Contest #3 (26 Oct, 4-6pm) @PL5 --- [progress]

Homework 7 (due 24 October, 8am)

BAP Project Phase 1: (due 13 October, Thu)

Contest #2 (05 Oct, 4-6pm) @PL5 --- [progress]

Project (BAP Problem)

  • Information on proposed BAP project -- | here |
    • Phase 1: Greedy Alg [Due: 13-Oct-2005, Thu]
    • Phase 2: Final Alg [Due: 0310-Nov-2005, Thu]

Homework 6 (due 03 October, 8am)

Homework 5 (due 19 September, 8am)

Homework 4 (due 12 September, 8am)

Contest #1 (31 August, 4-6pm) @PL5 --- [progress]

Homework 3 (due 29 August, 8am)

Homework 2 (due 22 August, 8am)

Homework 1 (due 15 August, 8am)

Course Schedule (Tentative)

  • 08 Aug: w1 first lecture; C1
  • 15 Aug: w2 data structures; C2
  • 22 Aug: w3 string & sorting; C3,C4
  • 29 Aug: w4 backtracking, b&b
        Contest #1 (during tut)
  • 05 Sep: w5 backtracking, b&b
  • 12 Sep: w6 graph traversals -- Meeting the seniors
  • 19 Sep: term-break -- no class
  • 26 Sep: w7 dijkstra and paths
  • 03 Oct: w8 dynamic programming -- Contest #2 (during tut)
  • 10 Oct: w9 dynamic programming II
  • 17 Oct: w10 Heuristic Search Algorithms
  • 24 Oct: w11 geometry -- Contest #3 (during tut, Oct 26)
  • 31 Oct: w12 computational geometry
  • 07 Nov: w13 combinatorics --
  • 16 Nov: w14 Contest #4

About CS3233

  • Modular credits: 4
  • Workload: 2-1-0-3-3
  • Prerequisites: At least grade A- in CS1102 or special permission.
    (Mathematical aptitude and good CS1231 (Discrete Maths) background will help.)
  • Instructor: Leong Hon Wai. email: leonghw.
  • Office: S16 06-01; Office Hours: (to be announced)
  • Lectures: Monday 10am - 12noon, SR1.
  • Tutorials: Wed 4-5pm @TR3 SR16-309

This module aims to prepare students in competitive problem solving. It covers techniques for attacking and solving challenging computational problems. Fundamental algorithmic solving techniques covered include divide and conquer, greedy, dynamic programming, backtracking and branch and bound. Domain specific techniques like number theory, computational geometry, string processing and graph theoretic will also be covered. Advanced AI search techniques like iterative deepening, A* and heuristic search will be included. The module also covers algorithmic and programming language toolkits used in problem solving supported by the solution of representative or well-known problems in the various algorithmic paradigms.

To see if this module is suitable for you, explore around the Spanish Judge site and try out some of the easier problems there.

Assessment

  • 40% Homework (3-4 programming problems per week)
  • 40% Contest (4 contests over the semester)
  • 15% Presentation and Written Assignments
  • 05% Problem Solving Challenge

Textbook

S. Skiena and M. Revilla, Programming Challenges: The Programming Contest Training Manual, Springer-Verlag, 2003.

As far as I know, this book is not available in Singapore. We will order in bulk from Amazon.com (US$35.10 + S&H).
Have ordered it --> track it here | They arrived |

Must Read

Cattywampus? -- MUST READ!
(Since I put this article online, it has found its way to other places.
| My Original | Aaron's site | rtan's site | in a blog! | in a BBS | in Korea
| trung yuechao anders yenan zhengjia | all |

stylesheet modified from MovableType "independence" style