A method for checking college students' completion of program and graduation requirements by computer is outlined. The procedure operates by having degree programs defined in tables and is simple enough to be achieved by junior program staff without the need for programmers and analysts. (MSE)

Discusses an algorithm for developing problem solving simulations using microcomputers, and describes both the components of the simulation algorithm and the user interface. Examples of simulation and programming methods are presented. (MBR)

Built-in data structures are the registers and memory words where binary values are stored; hard-wired algorithms are the fixed rules, embodied in electronic logic circuits, by which stored data are interpreted as instructions to be executed. Various topics related to these two basic elements of every computer program are discussed. (JN)

Presents model of algorithm design (activity in software development) based on analysis of protocols of two subjects designing three convex hull algorithms. Automation methods, methods for studying algorithm design, role of discovery in problem solving, and comparison of different designs of case study according to model are highlighted.…

Proposes a programing design curriculum based on three conceptual areas: process, symbolic representation, and methods of interpretation; and describes computer games and simulations in which design skills of simple and conditional sequencing, rule or constraint specification, hypothesis testing, and modeling are employed. (Author/CMV)

Four methods of filling a square using programing with Logo are presented, with comments on children's solutions. Analysis of the mathematical or programing concepts underlying a few simple algorithms is the focus. (MNS)

The Bock and Aitkin Marginal Maximum Likelihood/EM (MML/EM) approach to item parameter estimation is an alternative to the classical joint maximum likelihood procedure of item response theory. This paper provides the essential mathematical details of a MML/EM solution and shows its use in obtaining consistent item parameter estimates. (TJH)

To demonstrate to computer programmers that the programming language Ada provides superior facilities for use in artificial intelligence applications, the three papers included in this report investigate the capabilities that exist within Ada for "pattern-directed" programming. The first paper (Larry H. Reeker, Tulane University) is…

A program for drawing a line segment is developed. (MNS)

Develops a general computer algorithm to obtain a magic square having a number of rows that is a multiple of four. Presents a BASIC program and sample runs. (YP)

In order to estimate the classical coefficient of test reliability, parallel measurements are needed. H. Gulliksen's matched random subtests method, which is a graphical method for splitting a test into parallel test halves, has practical relevance because it maximizes the alpha coefficient as a lower bound of the classical test reliability…

The process of developing a computer program that can turn French text into speech is described. The program is designed to change a conventionally-spelled text into a phonemic transcription with an accuracy level of over 99.9%, divide the text into breath-groups that are syntactically correct and not over 14 syllables long, treat the unstable…

Discusses issues involved in obtaining patents for computer software. Topics discussed include copyright protection; algorithms and other software processes within programs; the software industry and the effects of patenting; perspectives on software patents within higher education; cost factors; and the use of patents to control information…

Shows a series of Euclidean equations using the Euclidean algorithm to get the greatest common divisor of two integers. Describes the use of the equations to generate a series of circles. Discusses computer generation of Euclidean circles and provides a BASIC program. (YP)

One college writing teacher engaged his class in the revision of a computer program to check grammar, focusing on improvement of the algorithms for identifying inappropriate uses of the passive voice. Process and problems of constructing new algorithms, effects on student writing, and other algorithm applications are discussed. (MSE)