Centralised Online Undergraduates Registration System (CORS)

      


Module Detailed Information for [CS3233R]
Academic Year : 2017/2018 Semester : 2
Correct as at 30 Mar 2018 04:27

Back to Module Information Listing
Module Information
Module Code :
CS3233R IVLE
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 : 1
Pre-requisite : Co-read with host module in current semester or pass host module in previous semester. Student selection process is enforced.
Preclusion : NIL
Module Workload (A-B-C-D-E)* : 0-0-0-2-1
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
1 LECTURE There are no lectures for this module.

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