An interactive lecture approach to teaching computer science

ABSTRACT

Students get more out of an interactive lecture than a passive lecture because they are given time to think. This time allows them to determine if they understand a concept, and if not to ask questions. This understanding is crucial when concepts build on one another. We describe our positive experiences in teaching sophomore-level computer science courses in an interactive lecture format with a computer in the classroom.

REFERENCES

• 1: J. Barwise and J. Etchemendy, Turing's World, Kinko's Academic Courseware Exchange, Santa Barbara, CA, 1986.
• 2: Dave Berque , Jeff Bogda , Brian Fisher , Tim Harrison , Nick Rahn, The KLYDE workbench for studying experimental algorithm analysis, Proceedings of the twenty-fifth SIGCSE symposium on Computer science education, p.83-87, March 10-12, 1994, Phoenix, Arizona, United States
• 3: M. Brown, ZEUS: A System for algorithm animation and multi-view editing. Proceedings o/the IEEE 1991 Workshop on Visual Languages, p. 4-9, Kobe, Japan, Oct. 1991.
• 4: Stephen A. Blythe , Michael C. James , Susan H. Rodger, LLparse and LRparse: visual and interactive tools for parsing, Proceedings of the twenty-fifth SIGCSE symposium on Computer science education, p.208-212, March 10-12, 1994, Phoenix, Arizona, United States
• 5: N. Dean, G. E. Shannon, eds. DIMACS Series in Discrete Mathematics and Theoretical Computer Science: Computational Support/or Discrete Mathematics, Vol. 15, American Mathematical Society, 1994.
• 6: P. Gloor, AA CE- Algorithm Animation }or Computer Science Education, IEEE Workshop on Visual Languages, p. 25-31, 1992.
• 7: David G. Hannay, Hypercard automata simulation: finite-state, pushdown and Turing machines, ACM SIGCSE Bulletin, v.24 n.2, p.55-58, June 1992 [doi>10.1145/130962.130971]
• 8: Peter Linz, An introduction to formal languages and automata, D. C. Heath and Company, Lexington, MA, 1990
• 9: M. LoSacco, and S. H. Rodger, FLAP: A Tool for Drawing and Simulating Automata, ED-MEDIA 93, World Conference on Educational Multimedia and Hypermedia, p. 310-317, June 1993.
• 10: T. Naps, C. Hundhausen, and B. Swander, GAIGS User Manual, Vet. 3.0. Lawrence Computing Center Publications, Appleton, WI, 1993.
• 11: Robert Sedgewick, Algorithms in C, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
• 12: K. Smith, The Craft of Teaching Cooperative Learning: An Active Learning Strategy, Frontiers i~ Edz~catiorb Go~}crc~cc Proceedings, p.188-192, 1989.
• 13: John T. Stasko, Tango: A Framework and System for Algorithm Animation, Computer, v.23 n.9, p.27-39, September 1990 [doi>10.1109/2.58216]
• 14: K. Sutner, Implementing Finite State Machines, DIMA CS Workshop on Computational Support/or Discrete Mathematics, 1992.

INDEX TERMS

Primary Classification:
  K. Computing Milieux
  K.3 COMPUTERS AND EDUCATION
      K.3.2 Computer and Information Science Education
          Subjects: Computer science education

Additional Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.1 Models of Computation
          Subjects: Automata (e.g., finite, push-down, resource-bounded)
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
      F.4.2 Grammars and Other Rewriting Systems
          Subjects: Parsing

  H. Information Systems
  H.1 MODELS AND PRINCIPLES
      H.1.2 User/Machine Systems
          Subjects: Human factors

General Terms:
Algorithms, Human Factors