Computer graphics dominates young people’s lives. Their worldview is heavily influenced by pixels. This lesson uses age appropriate experiences to explain the difference between bitmap (raster) and vector graphics. The lesson covers how information is lost when it is digitized, and how computer graphics techniques can both enhance images, and provide vehicles for corrupting them. It also introduces some ideas on how to efficiently schedule a task.
In a digital world we take color for granted. Through off-computer activities, students learn the difference between additive and subtractive color, and how images are generated on screen and transferred to physical print.
Sherlock Holmes delighted in saying ‘It’s elementary, my dear Watson’. This lesson provides a brief overview of how Boolean algebra provides the basis for artificial intelligence reasoning. The rules of propositional logic are introduced in the context of the kind of ‘AI’ found in role-playing games both on the computer and off.
Students learn how alphanumeric symbols can be encoded for a multitude of fun purposes. In the first of two sessions (each 2 hours long) they learn about codes, and are asked to make their own with a limited number of symbols. In the second session they are asked to break each other’s codes and discover the relationship among encryption, decryption, and shared keys.
Boolean logic is essential to understanding computer architecture. It is also useful in program construction and Artificial Intelligence. This lesson is a gentle introduction to formal logic using Boolean notation, and Circuits. Students learn the basic rules by playing the role of logic gates in a half adder and full adder. Free logic gate construction software available online can be incorporated optionally.
Young people take the Internet for granted. Through a serious of web-based explorations and kinesthetic exercises students explore the basic principles of graph theory and how it applies not only to their social connections but to how information is passed around.
This lesson introduces how to calculate an arithmetic series, specifically Fibonacci. In the first of two hour-long sessions, using a spreadsheet (e.g. Microsoft Excel or Google Drive Sheets), students are shown how to calculate a series based on two prior values (the iterative solution), and by using a user-defined function (the recursive solution). With a large enough domain, most computers will exhibit real delays in calculating the recursion for values greater than 30. In the second session, they will explore why the iterative solution is faster, and why the recursive solution significantly slows down for large values. This lesson assumes that the teacher is well versed in using spreadsheets, including copy-down formulas.
This lesson provides a number of kinesthetic exercises that illustrate how teamwork can contribute to efficient problem solutions. The lesson includes practice in figuring out how to divide up a problem, and reassemble it. Students also explore how scientists use the Internet and idle computing power to do calculations on volunteer machines. If possible, with sufficient teacher expertise, students set up a computer to contribute to solving such a problem.
This is an introduction to Artificial Intelligence (AI) ‘state-space search.’ The entertaining story line provides necessary background justifying the classic rules. Students will write and perform a skit that solves the problem using pre-made paper props, as they explore the concept of state representation. This is followed by an informal analysis of state-space, state representations, depth- and breadth-first search, and shortest path.
Lesson focuses on algorithmic thinking and programming. Make the students aware of the beauty of simple algorithms and their implementation in real fun games.


Search Lesson Plans


Quickstart: we have resources for Students, Parents, Teachers, and Guidance Counselors