Friday, February 14th

Girl Code @Stanford - A Free Programming Workshop Offered By Stanford University July 6 - 10 and 13 - 17, 2020
Deadline to apply for this program is Today!

Intractable Problems - can solve them but it would just take too long for large N values (exponential algorithms)
Useful in cryptography
Exponential problems are intractable.
Traveling Salesman Problem - is intractable but you can create a heuristic algorithm - produces an answer but may not be the correct answer but it will produce an answer that is good enough!
Unsolvable Problems

Show me the blue dot for 5.8 questions and then complete the reflections.

Literacy.SL.11-12.2 Integrate multiple sources of information presented in diverse formats and media in order to make informed decisions and solve problems, evaluating the credibility and accuracy of each source and noting any discrepancies among the data.

Gender Shades - answer these questions as you view this video

AI, Ain't I A Woman? - Joy Buolamwini

How I am Fighting Bias in Algorithms

Microsoft Facial Recognition Demo - copy two face pictures of the same person and see if the program can determine if they are the same person. Copy the face images of people of various ethnicities to see if the system detects their face.

The Evolution of Search! - answer these questions as you view this video

5.9 Blown to Bits: Web Searches

On your web site create a new page under your Blown To Bits section called Chapter 4: Web Searches.

Before you start the reading consider the following questions:

• What do you notice about your own INTERNET searches?
• What search engines have you tried?
• Does Google predict your searches?
• If you use another search engine besides Google, do you get the same results?
• Which search engine is “right”? Which is “better”?

Now copy these questions to your Google drive and answer them as you read through chapter 4 of Blown to Bits

Do NOT do the reflections questions for 5.9 - you will do the above questions instead. Show me your answers when you are finished.

Complete all section questions and reflections.

5.10 Wrap Up - read the introduction to Procedures and Functions and then complete the drills for this section. As you complete each drill save your app with the following names so they can be checked later:

1. Procedural Abstraction
2. Error Message Procedure
3. isValidIndex
4. isValidIndex with Parameter
5. SumTheList

Each time you have a pair of apps working get them checked off them move to the next two apps.

 

 

Homework

Have a wonderful holiday.