Skip to main content
SpringerLink
Log in

The practicality of algorithms in instructional development

  • Articles
  • Published:
Journal of instructional development

Abstract

Two of the most critical issues in instructional development (ID) are cost and time. Algorithmization promises to be a practical technology in optimizing instructional development, reducing costs, and saving development time. The notion of algorithms is briefly examined in this article. The differences between the pure, mathematical algorithms developed and applied in educational endeavors are discussed. Several algorithms employed in ID are spotlighted as examples of the varying roles they can take. The issues which set algorithms apart from other procedural forms are examined in light of available methodology for algorithms development. Some implications for developers of areas of application and research are noted. Finally, conclusions are drawn regarding the practicality of algorithms in instructional development.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Bung, K., & Carrasco, M. J. S. Quasi-algorithms and the teaching of grammar.Educational Technology, 1977,17(10), 48–52.

    Google Scholar 

  • Coscarelli, W. C. Algorithmization in instruction.Educational Technology, 1978,18(2), 18–21.

    Google Scholar 

  • Dick, W. Formative evaluation. In L. J. Briggs (Ed.),Instructional design: Principles and applications. Englewood Cliffs, N.J.: Educational Technology Publications, 1977.

    Google Scholar 

  • Gagné, R. M., & Briggs, L. J.Principles of instructional design. New York: Holt, Rinehart and Winston, 1974.

    Google Scholar 

  • Gerlach, V. S., & Hagin. Algorithms for education and training.Audiovisual Instruction, 1977, 22(6), 46.

    Google Scholar 

  • Gerlach, V.S., Reiser, R. A., & Brecke, F. H. Algorithms in education.Educational Technology, 1977,17(10), 14–18.

    Google Scholar 

  • Good, C. V.Dictionary of education. New York: McGraw-Hill, 1973.

    Google Scholar 

  • Knuth, E. E.The art of computer programing, Vol. 1, Fundamental algorithms. Reading, Mass.: Addison-Wesley, 1968.

    Google Scholar 

  • Kopstein, F. F. Task specifications and diagnosis in educational technology.Educational Technology, 1977,17(10), 26–30.

    Google Scholar 

  • Korfhage, R. R.Logic and algorithms: With applications to the computer and information sciences. New York: Wiley, 1966.

    Google Scholar 

  • Landa, L. N.,Algorithmization in learning and instruction. Englewood Cliffs, N.J.: Educational Technology Publications, 1974.

    Google Scholar 

  • Mager, R. F.Measuring instructional intent. Belmont, Calif.: Fearon, 1973.

    Google Scholar 

  • Markov, A. A.Theory of algorithms. Jerusalem: The Israel Program for Scientific Translations, 1962.

    Google Scholar 

  • Nunnally, J. C.Psychometric theory. New York: McGraw-Hill, 1967.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instructional Development Des Moines Area Community College, 50021, Ankeny, IA

    M. C. Mitchell (Director)

Authors
  1. M. C. Mitchell
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mitchell, M.C. The practicality of algorithms in instructional development. Journal of Instructional Development 4, 10–16 (1980). https://doi.org/10.1007/BF02908817

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02908817

Keywords

Search

Navigation