Journal: ACM SIGCSE Bulletin

Volume 27, Issue 4

1 -- 4Henry M. Walker. Message from the SIGCSE Secretary/Treasurer
5 -- 8Sally Jo Cunningham. An introduction to research and the CS/IS professional literature for undergraduates
9 -- 12Stephanie A. Robertson, Martin P. Lee. The application of second natural language acquisition pedagogy to the teaching of programming languages - a research agenda
13 -- 20Pieter H. Hartel, Louis O. Hertzberger. Paradigms and laboratories in the core computer science curriculum: an overview
21 -- 26Robert McCloskey, John Beidler. An analysis of algorithms laboratory utilizing the maximum segment sum problem
27 -- 28Franz A. Delahan, William F. Klostermeyer, George Trapp. Another way to solve nine-tails
29 -- 34Kathie A. Yerion, Jane A. Rinehart. Guidelines for collaborative learning in computer science
35 -- 38James W. Benham. A geometric approach to integer condition codes and branch instructions
39 -- 42Christopher J. Van Wyk. Programming as writing: using portfolios
43 -- 50Kaila Katz. The present state of historical content in computer science texts: a concern
51 -- 53Kenneth M. Dawson-Howe. Automatic submission and administration of programming assignments
54 -- 56Joel W. Carissimo. XINU - an easy to use prototype for an operating system course
57 -- 59Peter McKenzie. Using CASE to get to maintenance
60 -- 64W. E. Mattis. An advanced microprocessor course with a design component

Volume 27, Issue 3

3 -- 6Susan M. Haynes. Explaining recursion to the unsophisticated
7 -- 14P. D. Terry. Umbriel - imperative programming for unsophisticated students
15 -- 20Nan C. Schaller, Andrew T. Kitchen. Experiences in teaching parallel computing - five years later
21 -- 26Suzanne Pawlan Levy. Computer language usage in CS1: survey results
27 -- 33Marcelo Zanconi, Norma Moroni, Perla Señas. An educational project in computer science for primary and high school
34 -- 38Harri Klemetti, Ismo Lapinleimu, Erkki Mäkinen, Mika Sieranta. A programming project: trimming the spring algorithm for drawing hypergraphs
39 -- 46H. Altay Güvenir. An object-oriented tutoring system for teaching sets
47 -- 49Koldo Gojenola, Tomás A. Pérez, Arturo Jaime. Integrative assignments for CS1 and CS2 through libraries of abstract data types
50 -- 52M. D. Evans. A methodology for a unified ADT course
53 -- 59Thomas V. Palmer, James C. Pleasant. Attitudes toward the teaching of formal methods of software development in the undergraduate computer science curriculum: a survey
60 -- 64J. Stanley Warford. An experience teaching formal methods in discrete mathematics

Volume 27, Issue 2

2 -- 6Janice E. Huss. Laboratory projects for promoting hands-on learning in a computer security course
7 -- 12Jean-François Brette. Transparent running and contextual help to learn and to teach an imperative language
13 -- 17Simeon Simeonov, G. Michael Schneider. MSIM: an improved microcode simulator
18 -- 24Edward J. O'Neill. Classroom presentation of memory usage with constants, variables, and subprograms in Pascal
25 -- 30Timothy A. Budd, Rajeev K. Pandey. Never mind the paradigm, what about multiparadigm languages?
31 -- 40Ronald A. Olsson, Carole M. McNamee. Tools for teaching CCRs, monitors, and CSP concurrent programming concepts
41 -- 43Ronald J. Leach. Using metrics to evaluate student programs
44 -- 48Tanya Jane McGill, Simone E. Volet. An investigation of the relationship between student algorithm quality and program quality
49 -- 56Óscar Martín-Sánchez, Cristóbal Pareja-Flores. A gentle introduction to algorithm complexity for CS1 with nine variations on a theme by Fibonacci
57 -- 58Julie Tillison, Ching-Kuang Shene. On generating worst-cases for the insertion sort
59 -- 64Lorraine Sherry. A model computer simulation as an epistemic game