SIGCSE
2008
ACM
13 years 4 months ago
2008
ACM
Blind students are an underrepresented group in computer science. In this paper, we describe our experience preparing and leading the computer science track at the National Federa...
SIGCSE
2008
ACM
13 years 4 months ago
2008
ACM
This paper describes some unusual patterns that emerged from a statistical analysis of the 1988 Advanced Placement Exam in Computer Science. Most multiple-choice questions on the ...
SIGCSE
2008
ACM
13 years 4 months ago
2008
ACM
There are often problems when students enter a course with widely different experience levels with key course topics. If the material is covered too slowly, those with greater exp...
SIGCSE
2008
ACM
13 years 4 months ago
2008
ACM
Generating interest in specialized areas of Computer Science (CS) is one of the goals of the department of Computer and Information Science at Spelman College as with most departm...
SIGCSE
2008
ACM
13 years 4 months ago
2008
ACM
Computer science is seeing a decline in enrollment at all levels of education. One key strategy for reversing this decline is to improve methods of student retention. This paper, ...
SIGCSE
2008
ACM
13 years 4 months ago
2008
ACM
This paper presents a thorough evaluation of CS for Scientists, a CS 1 course designed to provide future scientists with an overview of the discipline. The course takes a breadth-...
IIE
2007
13 years 4 months ago
2007
Two years ago the Faculty of Mathematics and Informatics at Sofia University makes a decision to design a new series of Logo-based courses which make use of the modern technology....
JUCS
2006
13 years 4 months ago
2006
: Our aim is to discuss what, when and, how deep logic should be taught in the computer science education in connection with the so called "Bologna process". We survey th...
ENTCS
2007
13 years 4 months ago
2007
bstractions for a Jazz Improvisation Assistant Robert Keller1 Martin Hunt, Stephen Jones, David Morrison, Aaron Wolin Computer Science Harvey Mudd College Claremont, California, US...
JDA
2008
13 years 4 months ago
2008
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...