1. The CS Principles definition of algorithm is: Algorithms are precise sequences of instructions for processes that can be executed by a computer and are implemented using programming languages.
>One way to think of the study of algorithms is that it is the study of processes....we are going to continue this study.
2. Using the "Human Machine-Minimum Card" Activity Guide, complete the activity with a classmate.
>some questions to think about are:
"How do you know when to stop?"
"Do your instructions state where and how to start?"
"Is it clear where to put cards back down after you've picked them up?"
>record your algorithm on the activity guide as a google doc
3. As a whole group discuss the following and come up with a common set of commands:
"As we look at these algorithms you came up with, we can see they are not all the same. However, there are common things that you are all making the human machine do and commonalities in some of your instructions. Can we define a language of common Human Machine commands for moving cards around? What are the commands or actions most of these instructions have in common?"
>record your class's common set of commands in your code journal
4. Now use the "Human Machine Language" activity guide to complete the activity
>complete the charts on the activity guide in google docs
>record your algorithm and compare it to your classmates'
5. Notice two things about algorithms and programming...
>Different algorithms can be developed to solve the same problem
>Different code can be written to implement the same algorithm
Extra Credit (optional): CHALLENGE on the activity guide
>complete and record the information in google docs (up to 5 extra credit points)