Descriptor
Publication Type
Guides - Classroom - Teacher | 4 |
Journal Articles | 4 |
Computer Programs | 1 |
Opinion Papers | 1 |
Reports - Descriptive | 1 |
Education Level
Audience
Practitioners | 5 |
Teachers | 3 |
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Falkenhainer, Brian; And Others – 1986
This paper describes the Structure-Mapping Engine (SME), a cognitive simulation program for studying human analogical processing. SME is based on Gentner's Structure-Mapping theory of analogy, and provides a "tool kit" for constructing matching algorithms consistent with this theory. This flexibility enhances cognitive simulation studies by…
Descriptors: Algorithms, Artificial Intelligence, Cognitive Processes, Cognitive Structures

Jones, Ronald D.; And Others – Business Education Forum, 1979
Proposes that the first computer language course for students of management should teach the reading of the language rather than the writing of programs in that language. "Reading" means the study of the programing language literature, including a variety of algorithms, to understand the language, inputs, and program use. (MF)
Descriptors: Administrator Education, Algorithms, Business Education, Computer Programs
Magel, E. Terry – Computing Teacher, 1989
Discusses problems associated with teaching non-recursive binary searching in computer language classes, and describes a teacher-directed dialog based on dictionary use that helps students use their previous searching experiences to conceptualize the binary search process. Algorithmic development is discussed and appropriate classroom discussion…
Descriptors: Algorithms, Computer Science Education, Concept Formation, Dialogs (Language)

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

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