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…

A brief, general discussion of the application of algorithms to instruction. (HB)

The algo-heuristic theory is concerned with identifying unobservable cognitive processes and their unconscious component cognitive operations, including learning how to describe them algorithmically and heuristically, and how to devise specific instructional tools (algorithmic and heuristic) to develop cognitive processes much faster. (BW)

Approaches the development of the algorithm from a holistic, spiraling perspective in which students can avoid many of the common mistakes and misunderstandings associated with long division. (CCM)

A modified method of regrouping the minuend for subtraction is described. This more flexible method decreases the number of steps in the subtraction process and in checking the regrouping. (SD)

This paper discusses several instructional issues, defines the benefits of algorithmic prescriptions, and examines their effectiveness and efficiency. An experimental study asked 77 undergraduates to master and utilize one of three forms of an algorithm: a prose discourse, a flowchart procedure, or a mastery-inducing flowchart technique. Also…

The mathematics associated with division is discussed, working from a theorem for the real division algorithm. Real-world, geometric, and algebraic approaches are discussed, as are related topics. (MNS)

The construction of algorithms to present grammatical rules is advocated on the basis of clarity and ease of memorization. Algorithmic procedure is demonstrated for the introduction of subordinate clauses by conjunctions in German, and the formation of plural nouns in English. (AF)

Two difficulties that students have in computing with fractions are idenfitied. Then a procedure is described, stressing the identity element, that resolves these difficulties and increases students' understanding and retention. (MNS)