 |
 |
 |
 |
Each of the graphs above lists a number of exams, represented by nodes. Edges represent scheduling conflicts — for each pair of exams connected by an edge, there's at least one student who is taking both exams. All exams with the same color can occur on the same day because they are not directly connected to each other. All images © N. Ayewah, Southern Methodist University, Dallas, TX.
It does not take much foresight to recognize the need for
sophisticated and advanced programs that schedule the exams for students
at all levels. In addition to making sure a student does not get two exams
scheduled at the same time, these programs may provide advance services by
ensuring that students do not have two exams on the same day, which
is a great selling point for an institution.
Through our exam scheduling project we aim to answer the following questions:
- What conditions (number of students, exams and exam slots) make it feasible to use an exam scheduling algorithm to organize the exam period?
- What metrics can we give to learning institutions to measure how effective a system like this would be to them?
- How efficiently can we generate exam schedules in which no students have conflicts?
Our implementation depends only on information about
the exams each student is taking. We are able to successfully use this
information to schedule exams such that no student has two exams on the
same day. Our bench mark results illustrate this by 
presenting actual
schedules created by the system using only information about what exams
the students have.
Nathaniel Ayewah, SMU, Dallas, TX.
» White paper: Exam Scheduling Report (PDF, 2MB)
» About aiSee's force-directed layout algorithm
» More from aiSee users in the US
Last modified on 1 February 2005 by webmaster.
© 2005 AbsInt.
Graphs © N. Ayewah.
URL: http://www.aisee.com/graph_of_the_month/exams.htm
Home
About
Examples
Free trial
Support
Store
Legal
Contact
Extras
the month
02/2005
» Polls
» Memory
» Puzzle
» GDLedit
» Desktop
» Logos
» Papers
» Links
Sitemap