Parallel program design: a foundation
Parallel program design: a foundation
Algorithms from P to NP (vol. 1): design and efficiency
Algorithms from P to NP (vol. 1): design and efficiency
An introduction to parallel algorithms
An introduction to parallel algorithms
The art of parallel programming
The art of parallel programming
Computer science: through the eyes of potential students
ACSE '98 Proceedings of the 3rd Australasian conference on Computer science education
Thinking parallel: the process of learning concurrency
ITiCSE '99 Proceedings of the 4th annual SIGCSE/SIGCUE ITiCSE conference on Innovation and technology in computer science education
Introducing middle school girls to fault tolerant computing
SIGCSE '03 Proceedings of the 34th SIGCSE technical symposium on Computer science education
Learning concurrency: evolution of students' understanding of synchronization
International Journal of Human-Computer Studies
| Hi-index | 0.00 |
This paper takes the stand that it is never too early to teach so-called “hard” concepts in computer science. Specifically, basic principles in parallel algorithm development and software engineering can be introduced to students first learning about computers. The key is to present ideas in a manner that is simple, fun and suited to the audience. We discuss an interactive exercise developed with this premise in mind, based on sorting algorithms, that we conducted with one hundred minority students aged 14 to 17, on March 19, 1993. Our students, relative neophytes to high level computer science notions, had fun while learning alleged difficult concepts.