The course scheduling problem as a source of student projects

ABSTRACT

The course scheduling problem is simple to understand, yet complex enough to admit a wide range of solutions at varying levels of difficulty in implementation. In this work, we outline four types of student projects based on this problem, discuss how these projects can be approached and how they might integrate into a computer science curriculum, and describe two example projects that we have used.

REFERENCES

• 1: S. Abdennadher, T. Frühwirth, E. Krämer, M. Saft, and M. Schmauss. Java Constraint Kit website, 2004. http://www.pms.ifi.lmu.de/software/jack/index.html.
• 2: S. Abdennadher, E. Krämer, M. Saft, and M. Schmauss. JACK: A Java constraint kit. In M. Hanus, editor, Electronic Notes in Theoretical Computer Science, volume~64. Elsevier, 2002.
• 3: Tim B. Cooper , Jeffrey H. Kingston, The Complexity of Timetable Construction Problems, Selected papers from the First International Conference on Practice and Theory of Automated Timetabling, p.283-295, August 29-September 01, 1995
• 4: D. Diaz. clp(FD) 2.21 User's Manual. INRIA-Rocquencourt, Domaine de Voluceau, 78153 Le Chesnay, France, July 1994.
• 5: IBM Corporation. Cloudscape website, 2004. http://www-306.ibm.com/software/data/cloudscape/.
• 6: K. Marriott and P. J. Stuckey. Programming with Constraints: An Introduction. The MIT Press, Cambridge, Massachusetts, 1998.
• 7: Mozart Consortium. Mozart Programming System website, 2004. http://www.mozart-oz.org.
• 8: Peter Van Roy , Seif Haridi, Concepts, Techniques, and Models of Computer Programming, MIT Press, Cambridge, MA, 2004

INDEX TERMS

Primary Classification:
  K. Computing Milieux
  K.3 COMPUTERS AND EDUCATION
      K.3.2 Computer and Information Science Education
          Subjects: Computer science education

Additional Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications
          Subjects: Constraint and logic languages

  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Sequencing and scheduling

  K. Computing Milieux
  K.3 COMPUTERS AND EDUCATION
      K.3.2 Computer and Information Science Education
          Subjects: Curriculum

General Terms:
Algorithms, Languages

Keywords:
constraint programming, curriculum development, scheduling, search, student projects, user interface design