default search action
inroads (ACM SIGCSE Bulletin), Volume 17
Volume 17, Number 1, March 1985
- Norman E. Gibbs, Harriet G. Taylor, Della T. Bonnette, James E. Miller:
Proceedings of the 16th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 1985, New Orleans, Louisiana USA, March 14-15, 1985. ACM 1985, ISBN 978-0-89791-152-8 [contents]
Volume 17, Number 2, June 1985
- Edward H. Nemeth:
Response to Archibald's article. 2 - David L. Travis:
Open letter to a young master's degree computer scientist. 3-4 - Lionel E. Deimel:
The uses of program reading. 5-14 - Vicki M. Hightower:
Teaching honor students: how do they measure up. 15-20 - Dave Oliver:
Off campus computing. 21-26 - B.-F. Wu:
Requirements of a real-time microcomputer embedded laboratory project. 27-28 - John S. Mallozzi:
A course in programming languages for educational computing. 29-31 - Charles D. Sigwart, Gretchen L. Van Meer:
Evaluation of group projects in a software engineering course. 32-35 - Mark C. Kerstetter:
A KWIC permuted list of articles in the SIGCSE Bulletin 1984. 36-43
Volume 17, Number 3, September 1985
- Norman E. Gibbs:
The LameDuck SIG chairman's message: a parting shot at accreditation. 1-2 - Rosemary Schmalz:
Some thoughts on retraining and the lack thereof a mathematics educator teaching computer science. 3-4 - James H. Blaisdell, Ann Burroughs:
How to tell if a programming language is OK: what's wrong with basic for teaching business students how to program? 5-8 - Gayle J. Yaverbaum:
A decision making environment in the classroom. 9-11 - Roy J. Daigle:
Teaching COBOL with generic design. 12-16 - Julia E. Hodges:
An advanced readings course in database systems. 17-18 - Nicholas Ourusoff:
The physical symbol system hypothesis of Newell and Simon: a classroom demonstration of artificial intelligence. 19-23 - Maurice W. Benson:
Machine assisted marking of programming assignments. 24-25 - Gretchen L. Van Meer, Charles D. Sigwart:
Beyond a first course in software engineering. 26-29 - Joseph S. Fulda:
Verbal skills in computer science education. 30-31 - David L. Feinstein, David Langan:
Computers and society - another look at that general purpose course. 32-33 - Brian Lees:
Introductory concurrent programming with Modula-2. 34-41 - Bruce W. Mielke:
A course in computer graphics. 42-43 - Ted Tenny:
Procedures and comments vs. the banker's algorithm. 44-53
Volume 17, Number 4, December 1985
- Stewart A. Denenberg:
A service project for an introductory artificial intelligence course: implementing SOLO in LOGO. 8-20 - Norman C. Lyster:
A problem of integration. 21-29 - Cloyd L. Ezell:
A visible assembler for a course in introductory system software. 26-29 - David Ballew:
More thoughts on the need for retraining to teach undergraduate computer science. 30-31 - Con Tran, Pierre N. Robillard:
Teaching structured assembler programming. 32-44 - William F. Decker:
A modern approach to teaching computer organization and assembly language programming. 38-44 - Donald L. Byrkett, Yuksel Uckan:
A curriculum model for a graduate degree program in systems analysis. 45-53 - Richard J. Maresh:
Sorting out basic sorting algorithms. 54-64 - Yale Magrass:
Computer science curriculum: technography, technocracy, technology, or theology? 59-64 - Ralph Czerwinski:
Programming concepts and principles in the introductory computer science textbook. 65-68 - Grady G. Early, Donald F. Stanat:
Chinese Rings and recursion. 69-82 - Warwick B. Mugridge, John G. Hosking:
A method for introducing schemas. 76-82 - Patrick J. Ryan, Lionel E. Deimel:
Contest problems from the 1985 ACM scholastic programming contest. 83-91 - Neil Dunstan:
Continuity of student software development in tertiary institutions. 92-93 - D. L. Ogbokor:
LISP language as part of "advanced programming techniques" for computer science, computer mathematics, and computer economics students. 94-95
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.