Efron's Monte Carlo bootstrap algorithm is shown to cause degeneracies in Pearson's r for sufficiently small samples. Two ways of preventing this problem when programing the bootstrap of r are considered. (Author)

Six different algorithms to generate widely different non-normal distributions are reviewed. These algorithms are compared in terms of speed, simplicity, and generality of the technique. The advantages and disadvantages of using these algorithms are briefly discussed. (Author)

Results of analysis of 1,377 spelling error forms including three categories of spelling errors (consonantal, vowel, and sequential) demonstrate that majority of spelling errors are highly predictable when set of predefined rules based on phonological and sequential considerations are followed algorithmically. Eleven references and equivalent…

How to use the electronic spreadsheet (e.g., VisiCalc) creatively is discussed, with computer printouts for a number of algorithms. (MNS)

Considers problem of optimal scheduling of Boolean expression (each Boolean variable represents binary outcome of program module) on single-processor system. Optimization discussed consists of finding operand arrangement that minimizes average execution costs representing consumption of resources (elapsed time, main memory, number of…

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…

Following a discussion of derivative versus assignment indexing, use of roles, and concept behind Preserved Concept Indexing System, features of PERMDEX (microcomputer program to assist in creation of permuted printed index) are described including indexer input and prompts, the shunting algorithm, and sorting and printing routines. Fourteen…

A traditional question is whether or not computers shall ever think like humans. This question is redirected to a discussion of whether computers shall ever be truly creative. Creativity is defined and a program is described that is designed to complete creatively a series problem in mathematics. (MP)

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)

A statistical method for testing the agreement between a judge's assessment of an object or subject and a known standard is developed and shown to be superior to two other methods which appear in the literature. (Author/JKS)

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)

A class's struggle with the computer solution of a nontrivial problem is related. The use of algorithms allowed a trial-and-error approach.

Suggests a moving pictorial tool to help teach principles in the bubble sort algorithm. Develops such a tool applied to an unsorted list of numbers and describes a method to derive the run time of the algorithm. The method can be modified to run the times of various other algorithms. (JN)

This paper describes an intelligent spelling error correction system for use in a word processing environment. The system employs a dictionary of 93,769 words and, provided the intended word is in the dictionary, it identifies 80 percent to 90 percent of spelling and typing errors. Nine references are cited. (Author/EJS)