Dancing with DynaLab: endearing the science of computing to students

INTRODUCTION How can we entice young students into computer science? How can we convey—much earlier than is common—the excitement of our discipline to students who may only have a passing interest in programming and computing, encouraging them to continue studies in computer science? How can we keep students who have initially committed to computer science enthralled with their chosen discipline? These, of course, are specific questions that echo much broader concerns of education: how do we motivate young people to consider careers as scientists and engineers in general? Much sentiment has been expressed in both professional circles and the popular media regarding the need to excite students about science and engineering at an early age. The hope is that young people will not only acquire a better understanding of the world around them, but that more of them (especially women) will choose careers in science. With respect to the science of computing, these questions imply that the foundations of the discipline of computing be somehow presented in clear fashion early on in a student’s experience. By ‘(foundations of the discipline of computing” we mean what is generally captured by the term aigorithmics (see, for example, [Har92])—the world of interesting problems, algorithms as solutions to problems, unsolvable problems, intractable problems, and efficient solutions to tractable problems. In this paper we present one approach to reaching this objective through the use of DynaLab, a software system designed for performing experiments with programs.

[1]  Alan W. Biermann Great Ideas in Computer Science: A Gentle Introduction , 1990 .

[2]  Susan H. Rodger,et al.  LLparse and LRparse: visual and interactive tools for parsing , 1994, SIGCSE '94.

[3]  John D. McGregor,et al.  A goal-oriented approach to laboratory development and implementation , 1995, SIGCSE '95.

[4]  L NapsThomas,et al.  An object-oriented approach to algorithm visualizationeasy, extensible, and dynamic , 1994 .

[5]  L DershemHerbert,et al.  Finite state machine simulation in an introductory lab , 1994 .

[6]  W. Buxton Human-Computer Interaction , 1988, Springer Berlin Heidelberg.

[7]  Alan W. Biermann,et al.  Great ideas in computer science , 1990 .

[8]  Harriet J. Fell,et al.  Writing across the computer science curriculum , 1996, SIGCSE '96.

[9]  Herbert L. Dershem,et al.  Finite state machine simulation in an introductory lab , 1994, SIGCSE '94.

[10]  RasalaRichard,et al.  From animation to analysis in introductory computer science , 1994 .

[11]  Rockford J. Ross,et al.  DYNALAB: a dynamic computer science laboratory infrastructure featuring program animation (abstract) , 1995, SIGCSE '95.

[12]  Yishai A. Feldman,et al.  Algorithmics: The Spirit of Computing , 1987 .

[13]  David Keith Poole An Ada/CS compiler for the E-machine , 1994 .

[14]  John T. Stasko Tango: A Framework and System for Algorithm Animation , 1990, Computer.

[15]  Susan H. Rodger,et al.  An interactive lecture approach to teaching computer science , 1995, SIGCSE.

[16]  H. Paul Haiduk,et al.  Iconic programming proves effective for teaching the first year programming sequence , 1997, SIGCSE '97.

[17]  Marc Najork,et al.  A library for visualizing combinatorial structures , 1994, Proceedings Visualization '94.

[18]  Douglas W. Namce Pascal: understanding programming and problem solving (2nd ed.) , 1989 .

[19]  Michael J. Powers,et al.  Computer information systems development: Design and implementation , 1985 .

[20]  Michael Leigh Birch AN EMULATOR FOR THE E-MACHINE , 1990 .

[21]  Rockford J. Ross,et al.  Fundamental Programming With Pascal , 1984 .

[22]  RossRocky,et al.  Using visual demonstrations to teach computer science (abstract) , 1995 .

[23]  Torlief James Eneboe An ANSI C compiler for the E-machine , 1995 .

[24]  C. D. Walter Algorithmics–The spirit of computing , 1988 .

[25]  Samuel Dellette Patton The E-machine : supporting the teaching of program execution dynamics , 1989 .

[26]  Frances Wren Goosey A miniPASCAL COMPILER FOR THE E-MACHINE , 1993 .

[27]  Harriet J. Fell,et al.  From animation to analysis in introductory computer science , 1994, SIGCSE '94.

[28]  Rocky Ross,et al.  Using visual demonstrations to teach computer science (abstract) , 1995, SIGCSE '95.

[29]  J.T. Stasko,et al.  Tango: a framework and system for algorithm animation , 1990, Computer.

[30]  Douglas W. Nance Pascal: Understanding Programming and Problem Solving , 1986 .

[31]  Brian Swander,et al.  An object-oriented approach to algorithm visualization—easy, extensible, and dynamic , 1994, SIGCSE '94.

[32]  David M. Pennock,et al.  Teaching a hierarchical model of computation with animation software in the first course , 1994, SIGCSE '94.