NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 5 results Save | Export
Peer reviewed Peer reviewed
Technology Teacher, 1991
This learning activity develops algorithms to ensure that the process of selecting materials is well defined and sound. These procedures require the use of many databases to provide the designer with information such as physical, mechanical, and chemical properties of the materials under consideration. A design brief, student quiz, and five…
Descriptors: Algorithms, Engineering Education, Evaluation Criteria, Media Selection
Yelon, Stephen – Performance and Instruction, 1992
Guidelines for the integration of effective and efficient practice into the lecture format of higher education curricula are outlined and discussed. An algorithm for incorporating active learning into lecture courses is provided, with examples and discussion of possible constraints. (four references) (EA)
Descriptors: Algorithms, Experiential Learning, Flow Charts, Guidelines
Peer reviewed Peer reviewed
Donohoe, L. Joyce – AMATYC Review, 1992
Presents a public-key cryptosystem application to introduce students to several topics in discrete mathematics. A computer algorithms using recursive methods is presented to solve a problem in which one person wants to send a coded message to a second person while keeping the message secret from a third person. (MDH)
Descriptors: Algorithms, Coding, Computer Assisted Instruction, Mathematical Applications
Peer reviewed Peer reviewed
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
Peer reviewed Peer reviewed
Keeports, David – Mathematics Teacher, 1991
The four-color theorem stating that any map in a plane can be colored using no more than four colors represents a problem suitable for the liberal arts student. Presented is an algorithm for coloring familiar maps through the temporary removal of states bordering three or fewer states. (MDH)
Descriptors: Algorithms, College Mathematics, Enrichment Activities, Mathematical Enrichment