Autonomous Driving Intelligence
Team up to simulate how autonomous vehicles detect and react to pedestrians using computer vision and AI! Students will program Ozobot to analyze the road ahead and make decisions about when it’s safe to cross.
The Euclidean Algorithm
Evo helps students learn how to compute the greatest common divisor (GCD) of a pair of positive integers by use of the Euclidean algorithm.
“Three by 33⅓” OzoBlockly Challenge
Students are challenged to design a program that forces Evo to randomly select three different paths with equal probabiities of 33⅓% each.
Evo OzoBlockly Challenge: Morse Code Generator
Attachments: Evo OzoBlockly Challenge – Morse Code GeneratorEvo OzoBlockly Challenge Solution Share CodeEvo Morse Code Example More Properties: Grades: 10, 11, 12, 9 Subjects: Computer Science Academic Standards: CSTA.3A-AP-13, CSTA.3A-AP-15, CSTA.3A-AP-17, CSTA.3A-DA-12, CSTA.3B-AP-14, CSTA.3B-AP-21
Challenge Lesson: Ozobot Evo – Decimal to Binary Converter
Attachments: EvoDecimalToBinaryConverterChallengeEvo Decimal to Binary Conversion Challenge SolutionEvo Decimal to Binary Converter More Properties: Grades: 10, 11, 12, 9 Subjects: Computer Science Academic Standards: CSTA.3A-AP-13, CSTA.3A-AP-17, CSTA.3A-DA-11, CSTA.3A-DA-12, CSTA.3B-AP-14, CSTA.3B-AP-21
OzoBlockly Challenge: Use Evo to Convert Numbers to Roman Numerals
Attachments: OzoBlockly Challenge – Use Evo to Convert Numbers to Roman NumeralsOzoBlockly Challenge SOLUTION – Use Evo to Convert Numbers to Roman NumeralsEvo Converts Numbers to Roman Numerals More Properties: Grades: 10, 11, 12, 9 Subjects: Computer Science Academic Standards: CSTA.3A-AP-13, CSTA.3A-AP-17, CSTA.3A-AP-18, CSTA.3A-DA-10, CSTA.3A-DA-11, CSTA.3A-DA-12, CSTA.3B-AP-10, CSTA.3B-AP-14, CSTA.3B-AP-21