Gulliksen's matched random subtests method is a graphical method to split a test into parallel test halves, allowing maximization of coefficient alpha as a lower bound to the classical test reliability coefficient. This problem is formulated as a zero-one programing problem solvable by algorithms that already exist. (TJH)

Most optimization problems of any degree of complexity must be solved using a computer. In the teaching of dynamic programing courses, it is often desirable to use a computer in problem solution. The solution process involves conceptual formulation and computational Solution. Generalized computer codes for dynamic programing problem solution…

Six control structures are used in teaching a college Fortran programing course: (1) simple sequences of instruction without any control statement, (2) IF-THEN selection, (3) IF-THEN-ELSE selection, (4) definite loop, (5) indefinite loop, and (6) generalized IF-THEN-ELSE case structure. Outlines, instead of flowcharts, are employed for algorithm…

This article is a tutorial on writing a simulator--the example used is a casino. The nontechnical, step by step approach is designed to enable even non-programmers to understand the design of such a simulation. (Author)

Sketchcode is a metaprograming pseudo-language documentation technique intended to simplify the process of program writing and debugging for both high and low-level users. Helpful hints and examples for the use of the technique are included. (CMV)

In negotiating to obtain a sample of records from a computer file, it is important to be able to present a simple program that will produce a representative and valid sample. This article describes two procedures: (1) an interval selection method; and (2) a random numbers file. (JAZ)

Useful programming tricks are suggested to allow the reduction of many equations and non-polynomial-like expressions and the subsequent application of the mathematical algorithms. (Author)

The production of high quality Arabic-English text poses technical problems that are caused mainly by the high degree of syntactical flexibility which characterizes the Arabic language. This article describes a system which offers some solutions to the problems encountered in processing bilingual Arabic-English text. (Author/EM)

A previously developed program for the HP-41C programmable calculator is extended to handle models of differential and difference equations with multiple eigenvalues. How to obtain difference equation solutions via the Z transform is described. (MNS)

The repetitious nature of music is thought to be very similar to the repetitious nature of computer algorithms. Subroutines are seen to be very effectively applied to music notation, through reducing repetitious entry and the amount of memory required to represent a musical score. Examples of subroutine use are provided. (MP)

A few examples are discussed of situations where some solution to writing a computer program for an algorithmic problem is immediately evident, but the best solution is some distance away. (MP)

Explains, with supporting figures and flowcharts of programing logic, two search strategies introduced to the MORPHS System since 1976: one that employs the normal Boolean operators in strings without bracketing or in the form of marked steps, and one that treats a string of keywords as a compound word. (Author/JD)

Describes an approach that combines concepts from information retrieval, fuzzy set theory, and genetic programing to improve weighted Boolean query formulation via relevance feedback. Highlights include background on information retrieval systems; genetic algorithms; subproblem formulation; and preliminary results based on a testbed. (Contains 12…

Criteria were developed for deciding the fraction of course attendance time that students should spend on a computer-assisted instruction (CAI) course in order to maximize the average final achievement of the class, subject to constraints on the probability of individual student failure and on the available console capacity. The major elements of…