Class Scheduler v3.0
A Fully Automated Class Schedule Planner [Mirror in the U.S.] [Bored? Play a Game! (also developed by Jack)]


Opps! Your Browser Does Not Support Java!
Try another browser!




Click here for screenshotClass Scheduler 3.0 (CS3) is a fully automated tool helping NTU students making their class schedules. All you need to do is to specify your subject codes and preference, CS3 will generate multiple scheduling solutions in seconds, available for you to choose. Currently, it only supports NTU's class scheduling.

Realtime information guaranteed: All the class information is retrieved from NTU web site in realtime.

WARNING: THIS SOFTWARE IS FREE, COMES WITH NO WARRANTY.

Notice - by Jack - Jun 14, 2007

Thank you for visiting. It has been quite a few years since I graduated from NTU. Work, life any many other aspects keep me busy, so I can not offer any time to support CS3. Your understanding is appreciated. - jack.asprise.net


You can help - by Jack - Oct 11, 2006

Quite some time ago, few students from NTU sent me the updated URL list. Could you guys please re-send? My email/MSN: jackliguojie@coldmail.com (change 'cold' to 'hot', pls) Thanks. It's really an embarrassment that I lost the list.

Thanks, the Executor, for providing the updated URL list for 2006 Sem 2. [16 Oct 2006]

For those who can write Java programs: please help to fix the dependency on Java v1.2.

if you are sick of the try-and-clash way to schedule classes, try CS3!
Three easy steps:
  1. Tell CS what subjects you'd like to register
  2. Optionally specify your preferences
  3. Bingo! The system will list out all possible plans for you to choose
The Class Scheduler Advantage

Using CS 3 Wisely: You can always modify your configurations, selections and preference to re-run to get new schedules (No need to restart the applet!). This feature enables you to gain a significant advantage during registration when your desired indexes have no vacancy. (Read the manual and find how to do this.)

Trouble Shooting

If you have problems to run this Java applet, please download and install Sun Java Plug-in. Use NTU public folder to ask questions/seek answers. If you still got problem, you might contact me - it might take many days for you to receive my reply.

Open Source!

This software is licensed as an open source software. Download the full source + binary + resources + web here. To build, use >ant. License:

THE BEER-WARE LICENSE:
http://jack.asprise.net wrote this file. As long as you retain this notice you can do whatever you want with this stuff. If we meet some day, and you think this stuff is worth it, you can buy me a beer in return JACK LI

Please be informed that I do not answer basic questions about programming, like how to convert HTML to XML, or how to render a panel properly. Google your questions for answers before asking me, thanks!

Pass it on ...

If you like this software, do share it with your friends.

About Architecture

Architecture is everything. The superior distributed architecture of CS3.0 enables thousands of users to plan their perfect class schedules simultaneously. With the knowledge of 10+ computing languages, 5+ OSs, I chose Java + XML + HTTP technologies to implement CS so that you can use CS 3.0 on any OS at any time. THINK ARCHITECTURE.

History/Change log

2005: Move out from NTU web server. New retrieval strategy implemented.
2002: CS 3.0 Final. Maybe this is the final version of CS. This version is highly customizable, with new lookandfeel.
2001: CS 2.0 went open source. Well, opensoucing CS was a failure. Source code downloading was suspended soon.
2001: CS 2.0 got its new Applet interface, very usefriendly. Printing features were removed then. Line-Of-Code went as long as 4,000+.
2000: CS 1.0 came with console interface, supporting class schedule printing. Few of us used it.
2000 CS 1.0: When i was in my 3rd year, i found that finding a suitable class schedule was very time-consuming. I wrote this small piece of software. I tried to use Genetic Algorithms(GA) to solve this problem (Note: class scheduling problem is a typical NP problem). Later, i found that GA is not necessary at all, because the search space is not very large, less than 1,000,000. Greedy algorithms were used as implementation. [Also, sorting, tree traversing, prunning algorithms were used]

Feedback | Jack Li's homepage