Paradigms and laboratories in the core computer science curriculum: an overview

ABSTRACT

Recent issues of the bulletin of the ACM SIGCSE have been scrutinised to find evidence that the use of laboratory sessions and different programming paradigms improve learning difficult concepts and techniques, such as recursion and problem solving.Many authors in the surveyed literature believe that laboratories are effective because they offer a mode of learning that complements classroom teaching. Several authors believe that different paradigms are effective when used to support teaching mathematics (logic and discrete mathematics) and computer science (programming, comparative programming languages and abstract machines).Precious little evidence by way of reported results of surveys, interviews and exams was found in the ACM SIGCSE bulletins to support these beliefs.

REFERENCES

• 1: Harold Abelson , Gerald Jay Sussman , Julie Sussman, Structure and interpretation of computer programs, MIT Press, Cambridge, MA, 1985
• 2: Martin J. Biernat, Teaching tools for data structures and algorithms, ACM SIGCSE Bulletin, v.25 n.4, p.9-12, Dec. 1993 [doi>10.1145/164205.164211]
• 3: Michael J. Clancy , Marcia C. Linn, Functional fun, ACM SIGCSE Bulletin, v.22 n.1, p.63-67, Feb. 1990
• 4: D. Crookes, Using Prolog to present abstract machines, ACM SIGCSE Bulletin, v.20 n.3, p.8-12, Sept. 1988 [doi>10.1145/51594.51597]
• 5: Bruce S. Elenbogen , Martha R. O'Kennon, Teaching recursion using fractals in Prolog, ACM SIGCSE Bulletin, v.20 n.1, p.263-266, Feb. 1988
• 6: James L. Hein, A declarative laboratory approach for discrete structures, logic, and computability, ACM SIGCSE Bulletin, v.25 n.3, p.19-25, Sept. 1993 [doi>10.1145/165408.165414]
• 7: Peter B. Henderson, Discrete mathematics as a precursor to programming, ACM SIGCSE Bulletin, v.22 n.1, p.17-21, Feb. 1990
• 8: Peter B. Henderson , Francisco J. Romero, Teaching recursion as a problem-solving tool using standard ML, ACM SIGCSE Bulletin, v.21 n.1, p.27-31, Feb. 1989
• 9: Hartmut Höft, Implementation of a non-deterministic loop, ACM SIGCSE Bulletin, v.23 n.2, p.24-28, June 1991 [doi>10.1145/122106.122111]
• 10: Duane J. Jarc, Data structures: a unified view, ACM SIGCSE Bulletin, v.26 n.2, p.2-4, June 1994 [doi>10.1145/181648.181651]
• 11: K. N. King, The evolution of the programming languages course, ACM SIGCSE Bulletin, v.24 n.1, p.213-219, March 1992
• 12: K. Louden, Logo as a prelude to LISP: some surprising results, ACM SIGCSE Bulletin, v.21 n.3, p.35-38, Sep. 1989 [doi>10.1145/70593.70601]
• 13: P. A. Luker, Never mind the language, what about the paradigm?, ACM SIGCSE Bulletin, v.21 n.1, p.252-256, Feb. 1989
• 14: Daniel D. McCracken, Three “lab assignments” for an algorithms course, ACM SIGCSE Bulletin, v.21 n.2, p.61-64, June 1989 [doi>10.1145/65738.65750]
• 15: J. Paul Myers, Jr., The central role of mathematical logic in computer science, ACM SIGCSE Bulletin, v.22 n.1, p.22-26, Feb. 1990
• 16: R. P. Mody, C in education and software engineering, ACM SIGCSE Bulletin, v.23 n.3, p.45-56, Sept. 1991 [doi>10.1145/126459.126471]
• 17: Pavol Návrat, Hierarchies of programming concepts: abstraction, generality, and beyond, ACM SIGCSE Bulletin, v.26 n.3, p.17-21, Sept. 1994 [doi>10.1145/187387.187397]
• 18: Jan Newmarch, A plan-based approach to Prolog recursion, ACM SIGCSE Bulletin, v.25 n.2, p.12-18, June 1993 [doi>10.1145/152751.152755]
• 19: Hanne Riis Nielson , Flemming Nielson, Semantics with applications: a formal introduction, John Wiley & Sons, Inc., New York, NY, 1992
• 20: J. A. Piotrowski, Abstract machines in miranda, ACM SIGCSE Bulletin, v.21 n.3, p.44-47, Sep. 1989 [doi>10.1145/70593.70603]
• 21: Jerzy A. Piotrowski, Translation—an introductory exercise, ACM SIGCSE Bulletin, v.24 n.2, p.20-28, June 1992 [doi>10.1145/130962.130966]
• 22: Ronald E. Prather, Computer science in an undergraduate liberal arts and sciences setting, ACM SIGCSE Bulletin, v.24 n.2, p.59-64, June 1992 [doi>10.1145/130962.130972]
• 23: Angel Sánchez-Calle , J. Angel Velázquez-Iturbide, Fun, rigour and pragmatism in functional programming, ACM SIGCSE Bulletin, v.23 n.3, p.11-16, Sept. 1991 [doi>10.1145/126459.126464]
• 24: Dale A. Schoenefeld , Roger L. Wainwright, Integration of discrete mathematics topics into the secondary mathematics curriculum using Mathematica: a summer institute for high school teachers, ACM SIGCSE Bulletin, v.25 n.1, p.78-82, March 1993
• 25: [25] W. Schreiner. Parallel functional programming--an annotated bibliography. Technical Report 93-24, RISC-Linz, Johannes Kepler Univ, Linz, Austria, May 1993.
• 26: Steven Skiena, Implementing discrete mathematics: combinatorics and graph theory with Mathematica, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1991
• 27: Svetlin Stanchev , Atanas Radensky, Teaching some modern functional programming concepts: an approach based on an extended FP-like language, ACM SIGCSE Bulletin, v.23 n.4, p.31-36, Dec. 1991 [doi>10.1145/122697.122702]
• 28: [28] S. Thompson and P. L. Wadler. Functional programming in education. J. functional programming , 3(1):1-115, Jan 1993.
• 29: Allen B. Tucker, Computing Curricula 1991, Communications of the ACM, v.34 n.6, p.68-84, June 1991 [doi>10.1145/103701.103710]
• 30: John F. Čigas, The art of the state, ACM SIGCSE Bulletin, v.24 n.1, p.153-156, March 1992
• 31: Roger L. Wainwright, Introducing functional programming in discrete mathematics, ACM SIGCSE Bulletin, v.24 n.1, p.147-152, March 1992
• 32: Susan Wiedenbeck, Learning recursion as a concept and as a programming technique, ACM SIGCSE Bulletin, v.20 n.1, p.275-278, Feb. 1988

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:
  K. Computing Milieux
  K.3 COMPUTERS AND EDUCATION
      K.3.2 Computer and Information Science Education
          Subjects: Curriculum

General Terms:
Design, Human Factors, Management, Performance, Theory