Anthony Ralston
Pages 397-398
Based on the study of expenditures for data processing, a descriptive stage hypothesis is presented. It is suggested that the planning, organizing, and controlling activities associated with managing the computer resource will …
Richard L. Nolan
Pages 399-405
Since the logical structure of a data base can be represented by a tree or graph, it is quite natural for us to view the process of designing a data base as that of constructing a tree or a graph. A general method for constructing …
J. C. Huang
Pages 406-410
OKO III is a chess player written entirely in Fortran. On the IBM 360-65, COKO III plays a minimal chess game at the rate of .2 sec cpu time per move, with a level close to lower chess club play. A selective tree searching procedure …
Edward W. Kozdrowicki, Dennis W. Cooper
Pages 411-427
Mixtures of detection, avoidance, and prevention provide more effective and practical solutions to the deadlock problem than any one of these alone. The individual techniques can be tailored for subproblems of resource allocation …
John H. Howard
Pages 427-430
A virtual memory computer system with a fast buffer (cache) memory between primary memory and the central processing unit is considered. The optimal distribution of a program between the buffer and primary memory is studied using …
Erol Gelenbe
Pages 431-434
An addendum to the Report of the ACM Curriculum Committee on Computer Education for Management is proposed. The proposed addendum is to include in the curriculum a course on Information Systems Administration. It is important …
F. Warren McFarlan, Richard L. Nolan
Pages 439-441
For several years, there has been discussion about the use of the
goto statement in programming languages [1, 2]. It has been pointed out that
goto free programs tend to be easier to understand, allow better optimization by the …
G. V. Bochmann
Pages 443-444
Recent research in artificial intelligence has led to AND/OR graphs as a model of problem decomposition (Nilsson [3]; Simon and Lee [4]). However, AND/OR graphs of a restricted type are equivalent to context-free grammars. This …
Patrick A. V. Hall
Pages 444-445
This subroutine solves the linear zero-one programming problem of the following form.
František Fiala
Pages 445-447
Paul J. Nikolai
Page 448
I. D. G. Macleod, A. M. Collins
Page 448
Robert L. Ashenhurst
Pages 453-455
This paper presents the goals and organization of a course about programming designed to provide entering students in a graduate program with a cultural enrichment in their professional lives. The students are expected to have …
Robert F. Rosin
Pages 435-439
In recent years a number of curricula for computer science education have been proposed. Most notable among these are [1-4]. The results from these four studies were unbalanced oriented educational programs each with a different …
Abraham Kandel
Page 442
