1994 · 12 citations · 2 references
ComputingComputer ScienceParallel AlgorithmsParallel ComputingSoftware EngineeringComputer Science EducationConcurrent ProgrammingParallel Algorithm DesignParallel ComputationParallel SortingComputer Science CurriculumComputer Science PedagogyParallel ProgrammingParallel Sort AlgorithmsProgramming ConceptsProgramming InstructionSoftware Engineering EducationUndergraduate Computer Science Education
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.
2
Parallel program design: a foundation
Chris Jesshope · Microprocessors and Microsystems · 1989 · 845 citations
Parallel program design — A foundation
W.F. Ames · Mathematics and Computers in Simulation · 1990 · 84 citations