Considers three powerful techniques--heuristics, context trees, and search via backward chaining--that a knowledge engineer might employ to develop an expert system to automate performance engineering, i.e., the branch of instructional technology that focuses on the problems of business and industry. (MBR)

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)

How set theory, combinatorics, probability, and the study of algorithms can be used in solving two problems is described in detail. Three computer programs are listed. (MNS)

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)

Provides several algorithms that use extended precision methods to compute large factorials exactly. The programs are written in BASIC and PASCAL. The approach used for computing N considers how large N is, how the built-in limitation on exact integer representation can be bypassed, and how long it takes to compute N. (JN)

Presents an example of mathematics from an algorithmic point of view, with emphasis on the design and verification of this algorithm. The program involves finding roots for algebraic equations using the half-interval search algorithm. The program listing is included. (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)

A procedure is described that enables students to perform operations on fractions with a calculator, expressing the answer as a fraction. Patterns using paper-and-pencil procedures for each operation with fractions are presented. A microcomputer software program illustrates how the answer can be found using integer values of the numerators and…

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)

Described is a simple algorithm that can be used for the input, arithmetic manipulation, and output of large integers in their exact representations. Three BASIC programs are included that apply this method to the problem of multiplication of large integers, computation of factorials, and the generation of palindromic integers. (MNS)

Provides an applications-oriented view of algorithmic historiography and how it relates to understanding scientific paradigms. Discusses HistCite[TM], a program that allows scholars to identify significant works on a given topic; paradigm shifts; a genealogic approach; citation analyses; correcting variations in citations; and bibliographic…

Describes the software architecture and application of SABRE (Semi-Automated Bibliographic Environment), which is one of the first products to provide a semi-automatic environment for relevancy ranking of citations obtained from searches of bibliographic databases. Features designed to meet the review, categorization, culling, and reporting needs…

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)