Thursday, January 31, 2019

Today, due to the large number of people out ill this week, we are having a catch up day, continuing to work on the past two days assignments.

We will review the reading and discuss.

Today’s applicable Oklahoma curriculum standards:

L1.DA.S.01 Translate and compare different bit representations of data types, such as characters, numbers, and images.

L1.DA.CVT.01 Use tools and techniques to locate, collect, and create visualizations of small- and large-scale data sets (e.g., paper surveys and online data sets). L1.DA.IM.01 Show the relationships between collected data elements using computational models. L2.AP.A.03 Critically examine and implement classic algorithms (e.g., selection sort, insertion sort, binary search, linear search).

L2.AP.A.04 Evaluate algorithms (e.g., sorting, searching) in terms of their efficiency and clarity.

L2.AP.C.01 Trace the execution of iteration (loops or recursion), illustrating output and changes in values of named variables. L2.AP.M.01 Construct solutions to problems using student-created components (e.g., procedures, modules, objects).

L2.AP.M.03 Create programming solutions by reusing existing code (e.g., libraries, Application Programming Interface (APIs), code repositories).

L2.AP.PD.03 Design software in a project team environment using integrated development environments (IDEs), versioning systems, and collaboration systems.

Wednesday, January 30, 2019

Sorry I am not able to be there today. I hope to be back tomorrow.

Today please:

- Review Unit 3 Outline first 5 minutes of class
- Read and discuss
-     Digitization
-     Variable vs. Fixed-width Encodings
-     Analog vs. Digital Data
-     Approximating Physical Media
-     Digital vs. Analog
-     Perfect Copies
-     Digital Copies
-     Perfect Imperfection

Please email me a written summary, in your own words, of these sections by the end of the hour. Please send the summary in the body of the email, not as an attachment. The summary must be in your own words. No text may be copied and pasted from the book.

If you complete this, you may study for the Unit Quiz coming up on Friday, which will likely be written (not on the computer).

Thank you

Today’s applicable Oklahoma curriculum standards:

L1.DA.S.01 Translate and compare different bit representations of data types, such as characters, numbers, and images.

L1.DA.CVT.01 Use tools and techniques to locate, collect, and create visualizations of small- and large-scale data sets (e.g., paper surveys and online data sets). L1.DA.IM.01 Show the relationships between collected data elements using computational models. L2.AP.A.03 Critically examine and implement classic algorithms (e.g., selection sort, insertion sort, binary search, linear search).

L2.AP.A.04 Evaluate algorithms (e.g., sorting, searching) in terms of their efficiency and clarity.

L2.AP.C.01 Trace the execution of iteration (loops or recursion), illustrating output and changes in values of named variables. L2.AP.M.01 Construct solutions to problems using student-created components (e.g., procedures, modules, objects).

L2.AP.M.03 Create programming solutions by reusing existing code (e.g., libraries, Application Programming Interface (APIs), code repositories).

L2.AP.PD.03 Design software in a project team environment using integrated development environments (IDEs), versioning systems, and collaboration systems.

Tuesday, January 29, 2019

Sorry I cannot be there today. Hope to be back tomorrow. 

On today's class agenda:


- Study vocabulary on Quizlet for first 5 minutes of class

- Read and discuss Floating Point Numbers

- Read and discuss Hardware and Abstraction

- Read and discuss Logic Gates and Hardware

- Play Logic Gates game demonstrating Boolean operators applied to hardware - https://scratch.mit.edu/projects/169465762/embed



Today’s applicable Oklahoma curriculum standards:


L1.DA.S.01 Translate and compare different bit representations of data types, such as characters, numbers, and images.

L1.DA.CVT.01 Use tools and techniques to locate, collect, and create visualizations of small- and large-scale data sets (e.g., paper surveys and online data sets). L1.DA.IM.01 Show the relationships between collected data elements using computational models. L2.AP.A.03 Critically examine and implement classic algorithms (e.g., selection sort, insertion sort, binary search, linear search).

L2.AP.A.04 Evaluate algorithms (e.g., sorting, searching) in terms of their efficiency and clarity.

L2.AP.C.01 Trace the execution of iteration (loops or recursion), illustrating output and changes in values of named variables. L2.AP.M.01 Construct solutions to problems using student-created components (e.g., procedures, modules, objects).

L2.AP.M.03 Create programming solutions by reusing existing code (e.g., libraries, Application Programming Interface (APIs), code repositories).

L2.AP.PD.03 Design software in a project team environment using integrated development environments (IDEs), versioning systems, and collaboration systems.

Monday, January 28, 2019

On today's class agenda:

- Study Unit 3 vocabulary first 5 minutes of class on Quizlet

- Review student progress on The Amazing Binari coding project

- Discuss coding The Amazing Binari and Binary Birthday Cake using mod as explained in last week's worksheet and discussion on modulus -- https://scratch.mit.edu/projects/238552178/editor/


Today's applicable Oklahoma curriculum standards


L1.DA.S.01 Translate and compare different bit representations of data types, such as characters, numbers, and images.

L1.DA.CVT.01 Use tools and techniques to locate, collect, and create visualizations of small- and large-scale data sets (e.g., paper surveys and online data sets). L1.DA.IM.01 Show the relationships between collected data elements using computational models. L2.AP.A.03 Critically examine and implement classic algorithms (e.g., selection sort, insertion sort, binary search, linear search).

L2.AP.A.04 Evaluate algorithms (e.g., sorting, searching) in terms of their efficiency and clarity. 

L2.AP.C.01 Trace the execution of iteration (loops or recursion), illustrating output and changes in values of named variables. L2.AP.M.01 Construct solutions to problems using student-created components (e.g., procedures, modules, objects).

L2.AP.M.03 Create programming solutions by reusing existing code (e.g., libraries, Application Programming Interface (APIs), code repositories).

L2.AP.PD.03 Design software in a project team environment using integrated development environments (IDEs), versioning systems, and collaboration systems.

Friday, January 25, 2019

On today's class agenda:

- Study vocabulary on the materials on Modulus for today's vocabulary test and unit quiz for first 10 minutes of class

- Unit 3 vocabulary test - www.testmoz.com/1994569

- Unit 3 quiz on Modulus and Scratch Wiki on Modulus (relating to Amazing Binari) - www.testmoz.com/1994587

Today's applicable Oklahoma curriculum standards:


L2.AP.A.03 Critically examine and trace classic algorithms (e.g., selection sort, insertion sort, binary search, linear search).
L2.AP.C.01 Trace the execution of repetition (e.g., loops, recursion), illustrating output and changes in values of named variables.
L2.AP.M.03 Create programming solutions by reusing existing code (e.g., libraries, Application Programming Interface (APIs), code repositories).
L2.AP.PD.04 Systematically check code for correctness, usability, readability, efficiency, portability, and scalability through peer review.

Wednesday, January 23, 2019

On today's class agenda:

- Study the Unit 3 section on Binary Birthday Cake and Modulus, including the link for further explanation at 
https://en.scratch-wiki.info/wiki/%28%29_Mod_%28%29_%28block%29

- Do the Modulus worksheet (open book) at https://testmoz.com/1991519


- Discuss The Amazing Binary coding exercise and continue coding - consider today's topic of study, the online worksheet, and previously coded exercises Quiz Show and Regular Polygon for clues how to proceed

Today's applicable Oklahoma curriculum standards:


L2.AP.A.03 Critically examine and trace classic algorithms (e.g., selection sort, insertion sort, binary search, linear search).

L2.AP.C.01 Trace the execution of repetition (e.g., loops, recursion), illustrating output and changes in values of named variables.

L2.AP.M.03 Create programming solutions by reusing existing code (e.g., libraries, Application Programming Interface (APIs), code repositories).

L2.AP.PD.04 Systematically check code for correctness, usability, readability, efficiency, portability, and scalability through peer review.

Tuesday, January 22, 2019

On today's class agenda:

- Study vocabulary on Quizlet for first 10 minutes of class
- Review Unit 3 Outline for 5 minutes
- Partner Coding Exercise – The Amazing Binary (continued from Friday)
- Discussing breaking down big problems into smaller chunks – Coding in chunks

Today's applicable Oklahoma curriculum standards:

L2.AP.A.03 Critically examine and trace classic algorithms (e.g., selection sort, insertion sort, binary search, linear search).

L2.AP.C.01 Trace the execution of repetition (e.g., loops, recursion), illustrating output and changes in values of named variables.

L2.AP.M.03 Create programming solutions by reusing existing code (e.g., libraries, Application Programming Interface (APIs), code repositories).
L2.AP.PD.04 Systematically check code for correctness, usability, readability, efficiency, portability, and scalability through peer review.

Friday, January 18, 2019

Today in class -- 

- Study vocabulary and text for Unit 3 section quiz for first 10 minutes of class

- Unit 3 Vocabulary Test 2 – www.testmoz.com/1986303 -- Password -- Strawberries

- Closed Book Unit 3 Quiz on State Space, Base Conversions, and ASCII v. Unicode – www. testmoz.com/1986319 – Password -- Salad

- Code an Amazing Binari program with a partner (do not remix) – Watch how the Amazing Binari (https://scratch.mit.edu/projects/11914704/embed) transmutes decimal numbers to binary numbers to determine the procedure being used. (To understand how it works, use the program. Start with the number 1. Then try the number 2. Then try 3. Continue trying each number through 10. Does Binari put the first digit on the left or the right? What is his process?) Then, using the same method, write a program in Scratch that gives the binary number for any whole number 1 through 20 that the user enters. Use at least one sprite, at least one background, and at least one variable. Be sure to include instructions for users. 
**EMAIL ME A COPY OF WHAT YOU HAVE CODED BEFORE LEAVING CLASS TODAY**  (You may not remix.)

***Do not work on Binary Birthday Cake today. We are doing the Amazing Binari program instead.***



Today’s applicable Oklahoma curriculum standards:

L2.AP.A.03 Critically examine and trace classic algorithms (e.g., selection sort, insertion sort, binary search, linear search).

L2.AP.C.01 Trace the execution of repetition (e.g., loops, recursion), illustrating output and changes in values of named variables.

L2.AP.M.03 Create programming solutions by reusing existing code (e.g., libraries, Application Programming Interface (APIs), code repositories).

L2.AP.PD.04 Systematically check code for correctness, usability, readability, efficiency, portability, and scalability through peer review.

Technology News - Hacked Emails and Passwords

Was your email hacked? Learn more here -- https://www.msn.com/en-us/money/technology/nearly-773-million-email-accounts-have-been-exposed-in-a-massive-data-breach-heres-how-to-check-if-you-were-affected/ar-BBSnsJ7?ocid=spartanntp

Thursday, January 17, 2019

On today's class agenda:

- Study vocabulary on Quizlet for first 10 minutes of class
- Review Unit 3 Outline for 5 minutes
- Read and discuss ASCII v. Unicode
- Discuss digital Scavenger Hunt exercise 
- Discuss Binary/ASCII Note Writing exercise
- Discuss Binary Birthday Cake exercise

Today's applicable Oklahoma curriculum standards:



L2.AP.A.03 Critically examine and trace classic algorithms (e.g., selection sort, insertion sort, binary search, linear search).

L2.AP.C.01 Trace the execution of repetition (e.g., loops, recursion), illustrating output and changes in values of named variables.

L2.AP.M.03 Create programming solutions by reusing existing code (e.g., libraries, Application Programming Interface (APIs), code repositories).

L2.AP.PD.04 Systematically check code for correctness, usability, readability, efficiency, portability, and scalability through peer review.

Wednesday, January 16, 2019

On today's class agenda:

- Discuss direction exercise, high low guessing game, and binary search process described here -- https://www.thejournal.ie/guess-number-binary-search-1181370-Nov2013/
- Review the Binary Counting video posted yesterday
- Read and discuss Base Conversions – The Amazing Binary and Binary Finger Counting
- Discuss Binary Birthday Cake exercise 

Today's applicable Oklahoma curriculum standards:

L2.AP.A.03 Critically examine and trace classic algorithms (e.g., selection sort, insertion sort, binary search, linear search).
L2.AP.C.01 Trace the execution of repetition (e.g., loops, recursion), illustrating output and changes in values of named variables.

Counting In Binary -- A Video Explanation

Tuesday, January 15, 2019

On today's class agenda:


- Study vocabulary on Quizlet for first 10 minutes of class

- Review Unit 3 Outline for 5 minutes

- Discuss yesterday's class assignment to find direction considering state space

- Read and discuss Base Conversions – The Amazing Binary and Binary Finger Counting

- Discuss Binary Birthday Cake exercise for later assignment

Today's applicable Oklahoma curriculum standards:



L2.AP.A.03 Critically examine and trace classic algorithms (e.g., selection sort, insertion sort, binary search, linear search).


L2.AP.C.01 Trace the execution of repetition (e.g., loops, recursion), illustrating output and changes in values of named variables.


L2.AP.M.03 Create programming solutions by reusing existing code (e.g., libraries, Application Programming Interface (APIs), code repositories).


L2.AP.PD.04 Systematically check code for correctness, usability, readability, efficiency, portability, and scalability through peer review.

Monday, January 14, 2018

On today's class agenda:

- Study vocabulary on Quizlet for first 10 minutes of class

- Review Unit 3 Outline for 5 minutes

- Read and discuss State Space and view video

- Discuss High Low Guessing Game 

- Draft directional questions algorithm together in pairs


Today's applicable Oklahoma curriculum standards:

L2.AP.A.03 Critically examine and trace classic algorithms (e.g., selection sort, insertion sort, binarysearch, linear search).

L2.AP.C.01 Trace the execution of repetition (e.g., loops, recursion), illustrating output and changes in values of named variables.

L2.AP.M.03 Create programming solutions by reusing existing code (e.g., libraries, Application  programming Interface (APIs), code repositories).

L2.AP.PD.04 Systematically check code for correctness, usability, readability, efficiency, portability, and scalability through peer review.

Friday, January 11, 2019

On today's class agenda:

- Submit Completed Unit 3 Outline by 8:00 a.m.

- Study vocabulary on Quizlet for first 10 minutes of class

- Vocabulary Test at testmoz.com/1977411

- Study for section quiz for 10 minutes 

- Section Quiz – Binary Encoding of Information at testmoz.com/1977423


Today's applicable Oklahoma curriculum standards:


L2.AP.A.03 Critically examine and trace classic algorithms (e.g., selection sort, insertion sort, binary search, linear search).


L2.AP.C.01 Trace the execution of repetition (e.g., loops, recursion), illustrating output and changes in values of named variables.


L2.AP.M.03 Create programming solutions by reusing existing code (e.g., libraries, Application Programming Interface (APIs), code repositories).


L2.AP.PD.04 Systematically check code for correctness, usability, readability, efficiency, portability, and scalability through peer review.

Thursday, January 10, 2019

On today's class agenda:


- Study vocabulary on Quizlet for first 10 minutes of class


- Work on Unit 3 Outline for the remainder of class


(Today's lesson plans are adapted due to a large number of students being out for extracurricular activities. We will continue where we left off upon their return.)

Today's Oklahoma curriculum standards:



L2.AP.A.03 Critically examine and trace classic algorithms (e.g., selection sort, insertion sort, binary search, linear search).


L2.AP.C.01 Trace the execution of repetition (e.g., loops, recursion), illustrating output and changes in values of named variables.


L2.AP.M.03 Create programming solutions by reusing existing code (e.g., libraries, Application Programming Interface (APIs), code repositories).


L2.AP.PD.04 Systematically check code for correctness, usability, readability, efficiency, portability, and scalability through peer review.

Wednesday, January 9, 2019

On today's class agenda:

- Study vocabulary on Quizlet for first 10 minutes of class


- 20 Questions exercise and discussion


- High-Low Guessing exercise and discussion


- Work on Unit 3 Outline for 10 minutes of class

Today's applicable Oklahoma curriculum standards:



L2.AP.A.03 Critically examine and trace classic algorithms (e.g., selection sort, insertion sort, binary

search, linear search).

L2.AP.C.01 Trace the execution of repetition (e.g., loops, recursion), illustrating output and changes in values of named variables.

L2.AP.M.03 Create programming solutions by reusing existing code (e.g., libraries, Application Programming Interface (APIs), code repositories).

L2.AP.PD.04 Systematically check code for correctness, usability, readability, efficiency, portability, and

scalability through peer review.

Tuesday, January 8, 2019

On today's class agenda:

- Study vocabulary on Quizlet for first 10 minutes of class

- Work on Unit 3 Outline for 10 minutes of class

- Read and discuss Section on Binary Coding of Information

Today's applicable Oklahoma curriculum standards:

L2.AP.A.03 Critically examine and trace classic algorithms (e.g., selection sort, insertion sort, binary
search, linear search).

L2.AP.C.01 Trace the execution of repetition (e.g., loops, recursion), illustrating output and changes in values of named variables.

L2.AP.M.03 Create programming solutions by reusing existing code (e.g., libraries, Application Programming Interface (APIs), code repositories).

L2.AP.PD.04 Systematically check code for correctness, usability, readability, efficiency, portability, and scalability through peer review.

Monday, January 7, 2019

Welcome back!

On today's class agenda:

- Begin Unit 3 – Data Representation
- Study Unit 3 Vocabulary on Quizlet first ten minutes of class
- Vocabulary worksheet
- Begin Unit 3 Outline - Due 8:00 a.m. Friday, January 11
- Discuss updated access to online textbook materials

Today's applicable Oklahoma curriculum standards:

L2.DA.CVT.01 Use data analysis tools and techniques to identify patterns from complex real world phenomena. L2.DA.CVT.02 Generate data sets that support a claim or communicates information using a variety of data collection tools and analysis techniques.

L2.DA.IM.01 Use models and simulations to help formulate, refine, and test scientific hypotheses.