Combinatorial and Graph Algorithms
School of Computing, National University of Singapore
(Fall Semester 2001)

CS4234 Course Web-Site
(CS4234 is also cross-listed as CS5234 for grad students)

LATEST UPDATE

  • 16-Nov-2001 @Exam-Hall
    -- Surprise Fun Bonus Questions

  • 15-Nov-2001 --- Winners of TTP Challenge
    • Zhu Wen-bin (45/46 best solutions) -- using Simulated Annealing
    • Tan JingSong (16/46 best solutions)
    • Liu Ming (15/46 best solutions)
  • General Information

    Course Information

  • Latest Announcements --- Always updated!

  • Course Summary ---

  • Schedule of Lectures

  • Homework Information

  • LEDA Project Information -- TTP-Challenge Results are out!

  • Student Roster and Scores --- Scores ARE out!
  • Teaching and Learning

  • Cattywampus?
  • Writing with Proper Style -- Elements of Style by Strunk and White
  • How to Present a Paper in Theoretical Computer Science, by Ian Parberry. (also in [ps])
  • How to be a Good Graduate Student in a US research based university.
    Note: Although this article is based on a US PhD programme, which is slightly different from that in NUS, most of the points made in this article about motivation, attitude, research process are very similar. This article can provide a good starting reference point for beginning graduate students.
  • Other Interesting Places to Visit

  • Course Web Links
  • Halting Problem -- Simple Proof -- | local copy |
  • Fun Diversions for those late Nights

    CS4234 Home Page
    A/P Leong's HomePage

    Total Accesses: 7547 hits since 23-Jun-01. (Over 2633 days, from 2235 hosts)
    Accesses today: 2nd. (Complete statistics.)