Descriptor
Source
Author
Pizarro, Antonio | 2 |
Austin, Joe Dan | 1 |
Bell, C. L. M. | 1 |
Boody, Charles G., Ed. | 1 |
Brumbaugh, Doug | 1 |
Dewdney, A. K. | 1 |
Duncan, David R. | 1 |
Goldberg, Adele | 1 |
Gonzales, Michael G. | 1 |
Grady, M. Tim | 1 |
Harden, Richard C. | 1 |
More ▼ |
Publication Type
Reports - Descriptive | 20 |
Journal Articles | 19 |
Computer Programs | 2 |
Opinion Papers | 2 |
Speeches/Meeting Papers | 1 |
Education Level
Audience
Practitioners | 6 |
Teachers | 5 |
Researchers | 2 |
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating

Harden, Richard C.; Simons, Fred O., Jr. – CoED, 1983
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)
Descriptors: Algorithms, Calculators, Engineering Education, Higher Education

Bell, C. L. M.; Jones, K. P. – Information Processing and Management, 1980
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)
Descriptors: Algorithms, Flow Charts, Information Retrieval, Minicomputers
Petry, Frederick E.; And Others – Proceedings of the ASIS Annual Meeting, 1993
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…
Descriptors: Algorithms, Information Retrieval, Mathematical Formulas, Online Systems

Goldberg, Adele – Computers and Education, 1979
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)
Descriptors: Algorithms, Computer Assisted Instruction, Computer Science Education, Computer Software

Plett, Stephen – AMATYC Review, 1989
Presents a theorem and its converse to generate all of the primitive Pythagorean quadruples. Provides a BASIC program generating them. (YP)
Descriptors: Algorithms, College Mathematics, Equations (Mathematics), Higher Education
Reeker, Larry H.; And Others – 1985
To demonstrate to computer programmers that the programming language Ada provides superior facilities for use in artificial intelligence applications, the three papers included in this report investigate the capabilities that exist within Ada for "pattern-directed" programming. The first paper (Larry H. Reeker, Tulane University) is…
Descriptors: Algorithms, Artificial Intelligence, Computer Software, Computers

Gonzales, Michael G. – Computer Education, 1984
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)
Descriptors: Algorithms, Classification, College Mathematics, Computer Programs

Pizarro, Antonio – Mathematics Teacher, 1989
Develops a general computer algorithm to obtain a magic square having a number of rows that is a multiple of four. Presents a BASIC program and sample runs. (YP)
Descriptors: Algebra, Algorithms, College Mathematics, Computer Software

Tomek, Ivan – Computers and Education, 1982
Describes "Josef," a robot programing language similar to the LOGO turtle language, which has been designed as an instructional system through which the algorithmic problem-solving skills required in computer programing can be developed and tested in a controlled learning environment. Four figures and a reference list are included. (JL)
Descriptors: Algorithms, Computer Assisted Instruction, Computer Science Education, Higher Education

Grady, M. Tim; Brumbaugh, Doug – Journal of Computers in Mathematics and Science Teaching, 1988
Explores the use of computers for teaching mathematical models of transposition ciphers. Illustrates the ideas, includes activities and extensions, provides a mathematical model and includes computer programs to implement these topics. (MVL)
Descriptors: Algorithms, Cryptography, Instructional Materials, Integrated Activities
Kahin, Brian – EDUCOM Review, 1989
Discusses issues involved in obtaining patents for computer software. Topics discussed include copyright protection; algorithms and other software processes within programs; the software industry and the effects of patenting; perspectives on software patents within higher education; cost factors; and the use of patents to control information…
Descriptors: Algorithms, Computer Software, Copyrights, Costs

Duncan, David R.; Litwiller, Bonnie H. – School Science and Mathematics, 1984
Describes eight increasingly sophisticated and efficient sorting algorithms including linear insertion, binary insertion, shellsort, bubble exchange, shakersort, quick sort, straight selection, and tree selection. Provides challenges for the reader and the student to program these efficiently. (JM)
Descriptors: Algorithms, Classification, College Mathematics, High Schools

Selim, S. M. – Computers and Education, 1983
Describes an improved method for solving typical timetabling problems which was developed for the American University in Cairo. The article outlines the 26-step algorithm, indicates computer storage requirements, shows how the algorithm copes with conflicts, and explains how to obtain the final output in convenient format. (EAO)
Descriptors: Algorithms, Computer Oriented Programs, Foreign Countries, Higher Education

Austin, Joe Dan – Mathematics and Computer Education, 1990
Shows a series of Euclidean equations using the Euclidean algorithm to get the greatest common divisor of two integers. Describes the use of the equations to generate a series of circles. Discusses computer generation of Euclidean circles and provides a BASIC program. (YP)
Descriptors: Algorithms, College Mathematics, Computer Graphics, Computer Software
Dewdney, A. K. – Scientific American, 1989
Discussed are three examples of computer graphics including biomorphs, Truchet tilings, and fractal popcorn. The graphics are shown and the basic algorithm using multiple iteration of a particular function or mathematical operation is described. An illustration of a snail shell created by computer graphics is presented. (YP)
Descriptors: Algorithms, Computer Graphics, Computer Simulation, Computers
Previous Page | Next Page ยป
Pages: 1 | 2