NotesFAQContact Us
Collection
Advanced
Search Tips
Education Level
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Showing 1 to 15 of 19 results Save | Export
Voss, David A. – MATYC Journal, 1978
Several algorithms for solving initial value differential equation problems using the definitions of derivative and integral and a computer are discussed. (MN)
Descriptors: Algorithms, College Mathematics, Computer Assisted Instruction, Higher Education
Peer reviewed Peer reviewed
Ritchie, W. A. – Australian Mathematics Teacher, 1975
The use of flow charts in the teaching of college mathematics enhances students' understanding of mathematical processes. Used appropriately in elementary and secondary schools they could also nurture understanding of algorithms. (SD)
Descriptors: Algebra, Algorithms, College Mathematics, Elementary Secondary Education
Peer reviewed Peer reviewed
Curtis, Lorenzo J. – American Journal of Physics, 1978
Presents the historical development of perceptions and applications of the exponential law, tracing it from its ancient origins until the year 1900. Shows that many concepts such as mean life and half life and their relationships to differential equations were known long before their application to nuclear radioactivity. (GA)
Descriptors: Algorithms, College Mathematics, College Science, Higher Education
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
Grimm, C. A. – 1978
This document contains two units that examine integral transforms and series expansions. In the first module, the user is expected to learn how to use the unified method presented to obtain Laplace transforms, Fourier transforms, complex Fourier series, real Fourier series, and half-range sine series for given piecewise continuous functions. In…
Descriptors: Algorithms, Answer Keys, College Mathematics, Higher Education
Engel, Arthur – Mathematics Teaching, 1981
The need for incorporating algorithmics into mathematics instruction is presented. The proliferation of computers is seen to have made the designing of algorithms an essential skill. Examples are given, and the view that mathematics will lose much prestige and importance if algorithmics is not integrated into it is presented. (MP)
Descriptors: Algorithms, Computers, Elementary Secondary Education, Higher Education
Peer reviewed Peer reviewed
Stenger, William – Mathematics Teacher, 1980
A tool to aid elementary calculus students in the computation of unusual limits is reviewed. (MP)
Descriptors: Algorithms, Calculus, College Mathematics, Higher Education
Peer reviewed Peer reviewed
Flanders, Harley – College Mathematics Journal, 1987
Computing pi efficiently has been of great interest to mathematicians for centuries. This article presents an algorithm to solve this problem through skillful computer use. (PK)
Descriptors: Algorithms, College Mathematics, Computation, Computer Assisted Instruction
Peer reviewed Peer reviewed
Newton, Tyre A. – American Mathematical Monthly, 1990
Presented is a method where a quadratic equation is solved and from its roots the eigenvalues and corresponding eigenvectors are determined immediately. Included are the proposition, the procedure, and comments. (KR)
Descriptors: Algebra, Algorithms, College Mathematics, Equations (Mathematics)
Peer reviewed Peer reviewed
Graham, Ron; Yao, Frances – American Mathematical Monthly, 1990
Described is computational geometry which used concepts and results from classical geometry, topology, combinatorics, as well as standard algorithmic techniques such as sorting and searching, graph manipulations, and linear programing. Also included are special techniques and paradigms. (KR)
Descriptors: Algorithms, College Mathematics, Geometric Concepts, Geometry
Wilde, Carroll O. – 1978
Applied mathematics is seen often to involve the solution of single equations or systems of equations. A particular technique for solving equations in the context of functions on the real line is examined. This technique includes an iterative process, which is viewed as an algorithm that can be implemented readily on inexpensive and widely…
Descriptors: Algorithms, Answer Keys, Calculators, College Mathematics
Peer reviewed Peer reviewed
Sorkin, Sylvia J. – Mathematics and Computer Education, 1991
Presented is a way to provide students with a review and an appreciation of the versatility of pointers in data structures by improvising with binary trees. Examples are described using the Pascal programing language. (KR)
Descriptors: Algorithms, College Mathematics, Computer Science Education, Computer Software
Peer reviewed Peer reviewed
Parris, Richard – College Mathematics Journal, 1991
This article, which is organized around a single, well-known algorithm for root extraction, presents a way of incorporating dynamical systems into the teaching of mathematics. Included are sample exercises using complex numbers and the computer where students have the opportunity to do some analysis on this algorithm. (KR)
Descriptors: Algorithms, Chaos Theory, College Mathematics, Equations (Mathematics)
Golledge, R. G.; Rushton, Gerard – 1972
The purpose of this monograph is to show that sufficient achievements in scaling applications have been made to justify serious study of scaling methodologies, particularly multidimensional scaling (MDS) as a tool for geographers. To be useful research, it was felt that the common methodological and technical problems that specialized researchers…
Descriptors: Algorithms, College Instruction, Evaluation Methods, Geographic Distribution
Peer reviewed Peer reviewed
Kalman, Dan – Mathematics Magazine, 1990
Presented is a scheduling algorithm that uses all the busses at each step for any rectangular array. Included are two lemmas, proofs, a theorem, the solution, and variations on this problem. (KR)
Descriptors: Algebra, Algorithms, College Mathematics, Computer Science
Previous Page | Next Page ยป
Pages: 1  |  2