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)

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)

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…

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)

Results of study investigating human memory organization in processing of computer programming languages indicate that algorithmic logic segments form a cognitive organizational structure in memory for programs. Statement indentation and internal program documentation did not enhance organizational process of recall of statements in five Fortran…

Discusses difficulties of producing computer assisted learning (CAL) software economically. Proposed as a solution, modular programing is illustrated by describing production of a matrix algebra package. Use of special CAL modules and facilities provided by subroutine libraries are cited, and development of a package to teach matrix theory is…

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.…

There are many uses for the shortest path algorithm presented which are limited only by our ability to recognize when a problem may be converted into the shortest path in a graph representation. (Author/TG)