Algorithms & data structures
Textbook errors in binary searching
SIGCSE '88 Proceedings of the nineteenth SIGCSE technical symposium on Computer science education
The stable marriage problem: structure and algorithms
The stable marriage problem: structure and algorithms
Algorithms in C
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A philosophy and example of CS-1 programming projects
SIGCSE '90 Proceedings of the twenty-first SIGCSE technical symposium on Computer science education
A survey course in computer science using HyperCard
SIGCSE '90 Proceedings of the twenty-first SIGCSE technical symposium on Computer science education
An overview course in academic computer science: a new approach for teaching nonmajors
SIGCSE '90 Proceedings of the twenty-first SIGCSE technical symposium on Computer science education
Communications of the ACM
Data Structures, Algorithms and Program Style
Data Structures, Algorithms and Program Style
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Dealing with different levels of abstraction in a data structures course
SIGCSE '93 Proceedings of the twenty-fourth SIGCSE technical symposium on Computer science education
| Hi-index | 0.00 |
The use of real world problems as the basis for assignments in Computer Science courses is attractive for many reasons. At the same time it is difficult to find such a problem that offers the same richness that is found, for example, in sorting or searching. In this paper a problem is presented that has many real-world instances and which is pedagogically attractive at all levels of Computer Science from the level of a non-major's course to that of an advanced algorithms course.