Computer algorithms: introduction to design and analysis
Computer algorithms: introduction to design and analysis
PASCAL: programming and problem solving (4th ed.)
PASCAL: programming and problem solving (4th ed.)
The quest for excellence in designing CS1/CS2 assignments
SIGCSE '96 Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education
Oh! Pascal!
Integrating empirical methods into computer science
SIGCSE '02 Proceedings of the 33rd SIGCSE technical symposium on Computer science education
Introduction to Algorithms
A Java framework for experimentation with steganography
Proceedings of the 36th SIGCSE technical symposium on Computer science education
Data Structures and Other Objects Using Java (3rd Edition)
Data Structures and Other Objects Using Java (3rd Edition)
Engagement and frustration in programming projects
Proceedings of the 38th SIGCSE technical symposium on Computer science education
Minimally invasive programming courses: learning OOP with(out) instruction
Proceedings of the 42nd ACM technical symposium on Computer science education
The gap between knowledge and ability
Proceedings of the 12th Koli Calling International Conference on Computing Education Research
| Hi-index | 0.00 |
Retaining students in Computer Science may be improved by engaging them in the learning process while preventing them from becoming overly frustrated. While engaging students during lecture is certainly important, most students spend a significant amount of time working on programming projects outside of class. Gaining a deep understanding of student engagement in programming is difficult, since the instructor is seldom present during the process. This paper presents the results of student surveys administered after each programming project for multiple sections of two courses: CS2, and Data Structures and Algorithms. We analyze the data in terms of engagement, frustration and niftiness.