Search Modules > CS3108_ACM_ICPC

Learning Outcomes

TopThis is an independent work module to train for the ACM ICPC regional in Singapore on December 14.

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. 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.

Prerequisites

TopBasic knowledge of data structures and algorithms at least at the level of CS1102 or equivalent. Otherwise, you may find it difficult to complete the course.

Teaching Modes

TopStudents will learn the material independently and through discussion (as opposed to being taught by the lecturer).

Students will read and understand chapters of the textbook.
Students will take turn presenting material and leading discussion on the topics.
Students will solve problems on the Spanish judge.

Schedule

TopSee the lesson plan.

Assessment

TopThis module is assessed as CS/CU (completed satisfactorily/completed unsatisfactorily). For SoC students, you are allowed 12 MC CS/CU modules. This is separate from 12 MC S/U limit. However, if you do other CS/CU modules like ATAP, you may exceed the limit and be unable to use it for your degree requirement. For students in other faculties, you need to check the CS/CU limit for your faculty.

To complete the course satisfactorily, the student should do one group presentation, successfully solve at least 15 of the assigned problems on the Spanish judge and write a short report (5 to 10 pages) documenting the work. The time spent should add up to 130 hours or more.