ACM SIGCSE Bulletin - researchr journal

2	--	10	J. R. Ullrich, Curtis R. Cook. An experimental investigation of the close procedure as a measure of program understanding
11	--	12	James Hays. An operating systems course using MINIX
13	--	14	Donald J. Bagert. On teaching computer science using the three basic processes from the Denning report
15	--	19	Neil Dunstan. Synchronization problems and UNIX System V
20	--	24	G. Michael Schneider. A quantitative evaluation of graduate programs in computer science in the United States and Canada
25	--	26	R. Raymond, E. Jaede, S. Standiford. In support of Scraggs: the issue of research
27	--	30	Sidney L. Sanders. Teaching load and the quality of education
31	--	36	Elmer R. Richmond. Software engineering education in the associate-degree-level vocational/technical computer science program
37	--	42	Don C. Stone. Using cumulative graphic traces in the visualization of sorting algorithms
43	--	51	Jim S. Briggs. Teaching programming to conversion course students
52	--	56	Gretchen L. Van Meer, Charles D. Sigwart. Effective group interactions: some aspects of group projects in computer science courses
57	--	59	Richard Foss 0001. Music in computer science courses using inexpensive, exciting technology to teach programming principles
60	--	64	David J. Weiner. Teaching of assembly language as a laboratory science

2	--	7	Kenneth G. Schweller, A. L. Plagman. Neural nets and alphabets: introducing students to neural networks
8	--	10	Kwok-bun Yue. Using the game cube-4 as an example in an introductory artificial intelligence course
11	--	14	Yun-Lin Su. On teaching operating systems
15	--	18	David A. Sewry. A computer graphics course
19	--	25	R. Morales-Fernandez, J. J. Moreno-Navarro. CC-modula: a modula-2 tool to teach concurrent programming
26	--	29	Dennis R. Goldenson. The impact of structured editing on introductory computer science education: the results so far
30	--	34	Richard Aukerman, Robert E. Schooley, G. Daryl Nord, Jeretta Horn Nord. The importance of selected systems analysis and design tools and techniques as determined by industry systems analysts and university educators
35	--	38	Kenneth C. Louden. Logo as a prelude to LISP: some surprising results
39	--	43	Alan Dunworth, Viriya Upatising. UMAC: a simulated microprogrammable teaching aid
44	--	47	Jerzy A. Piotrowski. Abstract machines in miranda
48	--	50	Philip M. Dorin. Discrete-event simulation - a timley problem
51	--	53	Susan T. Dean. Using the georgia tech "freshman shell"
54	--	57	Ali Behforooz, Onkar P. Sharma. A comprehensive mathematics curriculum for the computer science undergraduate program
58	--	59	Michael Bozonie. An alternative to regular lecture classes: a theory seminar in computer algorithms
60	--	64	J. Mohr. Using modula-2 to teach data abstraction

2	--	7	Frank G. Pagan. Partial computation as a practical aid in the compiler construction course
8	--	14	Virginia Z. Ogozalek. A comparison of male and female computer science students' attitudes toward computers
15	--	22	Peter C. Isaacson, Terry A. Scott. Automating the execution of student programs
23	--	28	Kay A. Robbins, Neal R. Wagner, Dennis J. Wenzel. Virtual rings: an introduction to concurrency
29	--	33	Kenneth A. Lambert. Parsing tinyada in a programming language design course
34	--	39	Roger E. Lessman. Changes and extensions in the C family of languages
40	--	45	Hubert E. Dunsmore, David P. Moffet, Steven T. Ward. Software engineering team project group member evaluations: some empirical results
46	--	48	Ronald L. Danilowicz. Demonstrating the dangers of Pseudo-random numbers
49	--	50	Barbara Plumblee. Teaching about complexity in the introductory programming course
51	--	56	Kenneth G. Schweller. Scheduling concurrent procedures using modula-2
57	--	60	William J. Pervin. Verification of Ada 1/0 statements
61	--	64	Daniel D. McCracken. Three "lab assignments" for an algorithms course

External Links