Centralised Online Undergraduates Registration System (CORS)


Module Detailed Information for [CS3233]
Academic Year : 2018/2019 Semester : 2
Correct as at 21 Feb 2019 05:00

Back to Module Information Listing
Module Information
Module Code :
Module Title : Competitive Programming
Module Description : 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.
Module Examinable : -
Exam Date : No Exam Date.
Modular Credits : 4
Pre-requisite : At least grade A- in (CS2010 or CS2020 or (both CS2030 and CS2040)) or special permission
Preclusion : Nil
Module Workload (A-B-C-D-E)* : 2-1-0-3-3
Remarks : Nil
* A: no. of lecture hours per week
B: no. of tutorial hours per week
C: no. of laboratory hours per week
D: no. of hours for projects, assignments, fieldwork etc per week
E: no. of hours for preparatory work by a student per week

Lecture Time Table
Class TypeWeek TypeWeek DayStartEndRoom

Tutorial Time Table
Attention: The tutorial timetables could be updated from time to time. Students are advised to check regularly for the latest update on the change of tutorial timing.
No Tutorial Class or to be announced. Please check with the department offering this module.

  NUS Help NUS Home Search Site Map Contact NUS Legal