The case for case studies of programming problems
Communications of the ACM
Do algorithm animations assist learning?: an empirical study and analysis
CHI '93 Proceedings of the INTERACT '93 and CHI '93 Conference on Human Factors in Computing Systems
A top-down approach to teaching an introductory computer science course
SIGCSE '93 Proceedings of the twenty-fourth SIGCSE technical symposium on Computer science education
Design patterns: elements of reusable object-oriented software
Design patterns: elements of reusable object-oriented software
Engaging students and teaching modern concepts: literate, situated, object-oriented programming
SIGCSE '94 Proceedings of the twenty-fifth SIGCSE symposium on Computer science education
AAA and CS 1: the applied apprenticeship approach to CS 1
SIGCSE '95 Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education
A top-down approach to teaching programming
SIGCSE '95 Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education
Algorithms, data structures, and problem solving with C++
Algorithms, data structures, and problem solving with C++
Toward a first course based on object-oriented patterns
SIGCSE '96 Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education
Cool: a portable project for teaching compiler construction
ACM SIGPLAN Notices
Video games challenge and motivate data structure students
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
Designing Pascal Solutions: Case Studies Using Data Structures
Designing Pascal Solutions: Case Studies Using Data Structures
Design patterns: an essential component of CS curricula
SIGCSE '98 Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education
Toolkits in first year computer science: a pedagogical imperative
Proceedings of the thirty-first SIGCSE technical symposium on Computer science education
Enhancing apprentice-based learning of Java
Proceedings of the 35th SIGCSE technical symposium on Computer science education
Components-first approaches to CS1/CS2: principles and practice
Proceedings of the 35th SIGCSE technical symposium on Computer science education
In-person grading: an evaluative experiment
Proceedings of the 36th SIGCSE technical symposium on Computer science education
Proceedings of the 41st ACM technical symposium on Computer science education
| Hi-index | 0.00 |
A typical Data Structures (CS 2) course covers a wide variety of topics: elementary algorithm analysis; data structures including dynamic structures, trees, tables, graphs, etc.; large programming projects; and more advanced object-oriented concepts. Integrating these topics into assignments is a challenging task; educators often duplicate work done by others in re-inventing such assignments. At the same time, these assignments and large programs take time to develop and are often changed from semester to semester to preclude cheating. We report on a project that provides modules containing many kinds of programming and lab assignments which can be re-used across semesters with accessible and exciting application-oriented materials. Our project is a collaboration between a research and teaching oriented private university, a teaching oriented public university, and a teaching oriented historically black university. This helps ensure that the modules will be accessible to nearly all student populations. The modules developed are available electronically as hyper-text documents.