Algorithms defined as precise step-by-step plans with four characteristics: finite, inputs and outputs, effective, definite¶

Theory · All theories
Evidence · no claims cited

Description¶

The webinar defines algorithms as "precise step-by-step plans or procedures to meet an end goal or to solve a problem" and presents four defining characteristics teachers can use when introducing the concept to young learners. It grounds the definition in Grover's K-12 CS handbook and Knuth's advice that "the best way to learn what an algorithm is all about is to try it." Everyday examples include maps and directions, cooking and baking, and sorting algorithms from Computer Science Unplugged.

Design Implications¶

Context¶

Requirements¶

• Instruction must include something that tells the algorithm to stop, since every algorithm must end after a finite number of steps

Constraints¶

• Presented for K-2 (primary grades) teachers within Kentucky technology standards

Target Learners¶

• K-2 students

Target Learning Objectives¶

• Understanding what an algorithm is
• Algorithmic thinking

Claims¶

Related Theories¶

• Five defining characteristics of algorithms: finite, input, outputs, effective, definiteness
• Well-Structured vs. Ill-Structured Problems
• Explicit step-by-step problem-solving plans operationalizing Polya's phases for middle-grade word problems

Examples¶

• Sequencing familiar everyday tasks to teach order of instructions
• Ten-term algorithm vocabulary set for grades 3-8

Key Sources¶

• Computational Thinking Boosters: Algorithms in K-2. (2021). Webinar presentation, NSF grant #1923314. https://www.nsf.gov/awardsearch/showAward?AWD_ID=1923314