NotesFAQContact Us
Collection
Advanced
Search Tips
Education Level
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Showing 1 to 15 of 28 results Save | Export
Peer reviewed Peer reviewed
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
Peer reviewed Peer reviewed
Wilf, Herbert S. – American Mathematical Monthly, 1979
A few examples are discussed of situations where some solution to writing a computer program for an algorithmic problem is immediately evident, but the best solution is some distance away. (MP)
Descriptors: Algorithms, College Mathematics, Higher Education, Instruction
Peer reviewed Peer reviewed
Darling, Alexander L. – College and University, 1987
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)
Descriptors: Algorithms, College Administration, Computer Software, Degree Requirements
Wirth, Niklaus – Scientific American, 1984
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)
Descriptors: Algorithms, Computer Science, Computer Software, Data
Peer reviewed Peer reviewed
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
Peer reviewed Peer reviewed
Flanders, Harley – College Mathematics Journal, 1987
A program for drawing a line segment is developed. (MNS)
Descriptors: Algorithms, College Mathematics, Computer Graphics, Computer Software
Peer reviewed Peer reviewed
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
Peer reviewed Peer reviewed
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
Peer reviewed Peer reviewed
Boyd, James N. – Mathematics and Computer Education, 1982
Details are given of a simple computer program written in BASIC which calculates the sine of an angle through an application of DeMoivre's Theorem. The program is included in the material, and the program's success is discussed in terms of why the approximation works. (MP)
Descriptors: Algorithms, College Mathematics, Computer Programs, Higher Education
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
Peer reviewed Peer reviewed
Henriksen, Melvin, Ed.; Wagon, Stan, Ed. – American Mathematical Monthly, 1991
The discrete mathematics topics of trees and computational complexity are implemented in a simple reliability program which illustrates the process advantages of the PASCAL programing language. The discussion focuses on the impact that reliability research can provide in assessment of the risks found in complex technological ventures. (Author/JJK)
Descriptors: Algorithms, College Mathematics, Higher Education, Instructional Materials
Peer reviewed Peer reviewed
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
Peer reviewed Peer reviewed
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
Peer reviewed Peer reviewed
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
Peer reviewed Peer reviewed
Gunzenhauser, R. – International Journal of Mathematical Education in Science and Technology, 1975
In this paper, prepared for a European conference on mathematics education, the author examines three types of computer use in undergraduate and high school classrooms: Using the computer as an instructional tool for student development of algorithms, teaching about the computer itself, and use of computer-assisted instruction. (SD)
Descriptors: Algorithms, College Mathematics, Computer Assisted Instruction, Computer Science Education
Previous Page | Next Page ยป
Pages: 1  |  2