Computer applications and algorithms
Computer applications and algorithms
Introduction to computing and computer science with Pascal
Introduction to computing and computer science with Pascal
Algorithms, programming, Pascal
Algorithms, programming, Pascal
SIGCSE '87 Proceedings of the eighteenth SIGCSE technical symposium on Computer science education
Teaching documentation and style in Pascal
ACM SIGCSE Bulletin
The reliability of analytic and holistic methods in rating students' computer programs
SIGCSE '88 Proceedings of the nineteenth SIGCSE technical symposium on Computer science education
Introduction to computer science: an algorithmic approach (2nd ed.)
Introduction to computer science: an algorithmic approach (2nd ed.)
Designing introductory computing assignments: The view from the computing center
SIGCSE '82 Proceedings of the thirteenth SIGCSE technical symposium on Computer science education
SIGCSE '79 Proceedings of the tenth SIGCSE technical symposium on Computer science education
Recursion in gradual steps (is recursion really that difficult?)
Proceedings of the thirty-first SIGCSE technical symposium on Computer science education
Proceedings of the 6th Baltic Sea conference on Computing education research: Koli Calling 2006
| Hi-index | 0.00 |
This paper presents a method of design for projects in computer courses that tends to enable all students in the class to achieve their maximum potential. Each project is structured at three progressive levels of difficulty corresponding to three prospective grades A, B, and C. The B-level is an extension of the C-level and the A-level is an extension of the B-level. Each student starts at the C-level and progresses as far as possible and is scored accordingly.