NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 5 results Save | Export
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
Dence, Joseph B.; Dence, Thomas P. – Mathematics Teacher, 1993
Presents an algorithm to estimate pi by approximating a unit circle with a sequence of inscribed regular polygons. Demonstrates the application of the algorithm with a hand-held calculator and an Apple computer. Provides a program to calculate pi in Pascal programing language. (12 references) (MDH)
Descriptors: Algorithms, Area, Calculators, Computation
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)
Eckert, Paul; And Others – 1989
The objective of this presentation is to focus on the use of a hand-held graphics calculator. The specific machine referred to in this monograph is the Casio fx-7000G, chosen because of its low cost, its large viewing screen, its versatility, and its simple operation. Sections include: (1) "Basic Operations with the Casio fx-7000G"; (2) "Graphical…
Descriptors: Algorithms, Computation, Computer Uses in Education, Educational Technology
Peer reviewed Peer reviewed
Aslan, Farhad; Duck, Howard – School Science and Mathematics, 1992
P-adic or g-adic sets are sets of elements formed by linear combinations of powers of p, a prime number, or g, a counting number, where the coefficients are whole numbers less than p or g. Discusses exercises illustrating basic numerical operations for p-adic and g-adic sets. Provides BASIC computer programs to verify the solutions. (MDH)
Descriptors: Addition, Algebra, Algorithms, College Mathematics