NotesFAQContact Us
Collection
Advanced
Search Tips
Laws, Policies, & Programs
What Works Clearinghouse Rating
Showing 121 to 135 of 328 results Save | Export
Peer reviewed Peer reviewed
Bohannon, Barbara; Michaels, Aileen – AMATYC Review, 1990
Provides four examples for testing the validity of logical arguments by using the method of truth trees. (YP)
Descriptors: Algorithms, College Mathematics, Higher Education, Logic
Peer reviewed Peer reviewed
Wilcocks, Derek; Sanders, Ian – Computers & Education, 1994
Discussion of how to teach programming skills to novice programmers focuses on the use of a program animator that uses a copies model of recursion to teach the recursive function. Various mental models are reviewed; testing the recursion animator is described; and possibilities for further research are suggested. (12 references) (LRW)
Descriptors: Algorithms, Computer Assisted Instruction, Computer Science Education, Courseware
Machovec, George S. – Online Libraries and Microcomputers, 1993
Discusses the development of successful pricing algorithms for cooperative library automation projects. Highlights include desirable characteristics of pricing measures, including simplicity and the ability to allow for system growth; problems with transaction-based systems; and a review of the pricing strategies of seven library consortia.…
Descriptors: Academic Libraries, Algorithms, Consortia, Higher Education
Peer reviewed Peer reviewed
Nakhleh, Mary B.; And Others – Journal of Chemical Education, 1996
Reports on a study, Project REMODEL, that implemented and evaluated innovations in lecture, laboratory, and assessment for students in the introductory sequence for undergraduate chemistry. Results indicate that special sessions and conceptual exam questions can improve students' abilities to work successfully with both concepts and algorithms.…
Descriptors: Algorithms, Chemistry, Educational Change, Educational Innovation
Board, Raymond Acton – 1990
This thesis addresses problems from two areas of theoretical computer science. The first area is that of computational learning theory, which is the study of the phenomenon of concept learning using formal mathematical models. The goal of computational learning theory is to investigate learning in a rigorous manner through the use of techniques…
Descriptors: Algorithms, Computer Science, Computer Science Education, Higher Education
Peer reviewed Peer reviewed
Sowder, Larry – Journal for Research in Mathematics Education, 1975
Two studies investigated the effects of verbalization of discovered generalizations on the retention of those principles. (SD)
Descriptors: Algorithms, Discovery Learning, Generalization, 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
Horwitz, Lucy – 1981
One difficulty that mathematically naive subjects encounter in solving arithmetic word problems involves the limitation on short term memory (STM) capacity. It is hypothesized that naive subjects, not having access to formal problem solving strategies, may find visualization useful in reducing strain on STM. Two experiments are reported. The…
Descriptors: Algorithms, Cognitive Processes, College Mathematics, Computation
Kletsky, E. J. – 1975
This paper describes a student project in digital simulation techniques that is part of a graduate systems analysis course entitled Biosimulation. The students chose different simulation techniques to solve a problem related to the neuron model. (MLH)
Descriptors: Algorithms, Biophysics, Computers, Engineering
Peer reviewed Peer reviewed
Remillard, Wilfred J. – American Journal of Physics, 1978
Studies the relationship between Eulerian and Lagrangian coordinate systems with the help of computer plots of variables such as density and particle displacement. Gives examples which illustrate the differences in the shape of a traveling wave as seen by observers in the two systems. (Author/GA)
Descriptors: Algorithms, College Science, Diagrams, Higher Education
Peer reviewed Peer reviewed
Smith, Donald A.; Jacquot, Raymond G. – CoED, 1984
Presents algorithms for the simulation and motion display of the three basic kinematic devices: (1) four bar linkages; (2) the slider crank; and (3) the inverted slider crank mechanisms. The algorithms were implemented on a Commodore-VIC 20 microcomputer system with 6500 bytes of available memory. (Author/JN)
Descriptors: Algorithms, Computer Graphics, Computer Simulation, Computer Software
Peer reviewed Peer reviewed
Kail, Robert; And Others – Intelligence, 1984
Sex differences in speed of solving mental rotation problems were replicated but college men and women were alike in frequency of use of algorithms to solve problems. The most frequent algorithm involved encoding stimuli in working memory, mental rotation of one to orientation of the other, comparison, and response. (Author/RD)
Descriptors: Algorithms, Cognitive Processes, Higher Education, Mathematical Models
Peer reviewed Peer reviewed
Naveh-Benjamin, Moshe; And Others – Journal of Educational Psychology, 1986
This article presents a new method of inferring students' cognitive structures and their development. A modification of Reitman and Rueter's "ordered tree technique," the method generates a structure that displays important relationships assumed to be in a student's memory about concepts taken from a specific field of study. (Author/LMO)
Descriptors: Algorithms, Analysis of Variance, Cognitive Development, Cognitive Structures
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
Pages: 1  |  ...  |  5  |  6  |  7  |  8  |  9  |  10  |  11  |  12  |  13  |  ...  |  22