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)

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…

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)

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)

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

Describes an indexing technique based on overlapping word fragments as reference strings that are linked in a directed graph structure which makes possible exact match-, partial match-, and masked-partial match-retrieval and indicates search strategies for each case. Eight figures, two tables, and nine references are provided. (RBF)

A computer program in BASIC is presented, with the underlying algorithm explained, for multiplying any two multi-digit numbers and obtaining an exact answer. (MP)

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)

Presents a theoretical rationale for employing a form of information retrieval algorithm that helps searchers better navigate through large document collections by continually revising probability estimates for document subsets. The algorithm avoids assumptions of index term independence and predicts relevance more accurately with increasing…

This study assesses the accuracy of ASCAL, a microcomputer-based program for estimating item parameters for the three-parameter logistic model in item response theory. Item responses are generated from a three-parameter model, and item parameter estimates from ASCAL are compared to the generating item parameters and to estimates produced by…

Examines similarities between composition and programming processes, and reviews two studies that linked instruction in computer programming and freshman composition to help students understand writing as a design discipline. Projects at the University of Montana and Bryn Mawr College which improved students' writing abilities are described. (LRW)

Results from the 1979 Minnesota Computer Literacy Assessment show that eighth- and eleventh-grade females perform better than males in some specific areas of programing, i.e., those that involve problem analysis and algorithmic application where the problems are expressed verbally rather than mathematically. (Author/LRW)

Four discussions of test construction based on item response theory (IRT) are presented. The first discussion, "Test Design as Model Building in Mathematical Programming" (T. J. J. M. Theunissen), presents test design as a decision process under certainty. A natural way of modeling this process leads to mathematical programming. General…