The course scheduling problem as a source of student projects

Authors:
William Combs;Robert Hawkins;Thomas Pore;Arik Schechet;Tim Wahls;Louis Ziantz
Affiliations:
Dickinson College, Carlisle, PA;Dickinson College, Carlisle, PA;Dickinson College, Carlisle, PA;Dickinson College, Carlisle, PA;Dickinson College, Carlisle, PA;Dickinson College, Carlisle, PA
Venue:
Proceedings of the 36th SIGCSE technical symposium on Computer science education
Year:
2005

Citing 2
Cited 4

The Complexity of Timetable Construction Problems

Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Concepts, Techniques, and Models of Computer Programming

Concepts, Techniques, and Models of Computer Programming

New algorithms research for first year students

Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education
Ontology-based curriculum content sequencing system with semantic rules

Expert Systems with Applications: An International Journal
Designing Project-Based Courses with a Focus on Group Formation and Assessment

ACM Transactions on Computing Education (TOCE)
A hybrid particle swarm optimization for a university course scheduling problem with flexible preferences

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

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.