DECEMBER 7 TH – 12 TH Newark High School.  What is your favorite app?  If you could invent ANY app, what problem would it solve?

Slides:



Advertisements
Similar presentations
Lecture 5: Network Flow Algorithms Max-Flow Min-Cut Single-Source Shortest-Path (SSSP) Job Sequencing.
Advertisements

Georgia Department of Education. Information Technology Pathways.
How to Graph a Linear Inequality. Linear Inequalities linear inequality  A linear inequality describes a region of the coordinate plane that has a boundary.
Given Connections Solution
Computer Coding for Our Youngest Learners Brendan French Technology Facilitator Indian Head Elementary School Simone Young Coordinator for STEM Education.
Map Coloring to Graph Coloring Part of a unit on discrete mathematics.
GOOGLE TIPS. TO FIND AN EXACT QUOTE Put quotation marks around the words "Ask not what your country can do for you"
Computer Lab Presentation for PAC by Karyn Kemmerer Monday, May 11, 2015.
Introdution to Computer Science ICS3U/4U.  New room!!!  Respect it  Wooden tables  No food/drink  Bathroom – one at a time  Course outline – coming.
Job Aids video storyboard Matt Boardman, Chiao-Ling Lu.
Title of Your Invention Challenge # First Name, Last Initial Age State or Country.
Coding in the Classroom
Lecture 5: Network Flow Algorithms Single-Source Shortest-Path (SSSP) (Dijkstra's Algorithm) Max Flow - Min Cut (Ford-Fulkerson) Job Sequencing.
S3 Term 1 Climate Change (G1) Explain the physical and human causes of climate change 6 Explain the effects of climate change 6 Explain the solutions adopted.
Compound Inequalities “And” & “Or” Graphing Solutions.
Set Operations and Compound Inequalities. 1. Use A = {2, 3, 4, 5, 6}, B = {1, 3, 5, 7, 9}, and C = {2, 4, 6, 8} to find each set.
Sharing Google Docs. Open Google Chrome Open your dashboard.
Inequalities and their Graphs Objective: To write and graph simple inequalities with one variable.
UNIT 2 LESSON 6 CS PRINCIPLES. UNIT 2 LESSON 6 OBJECTIVES Students will be able to: Write an algorithm for solving the minimum spanning tree (MST) problem.
Types of Maps Political Physical Relief Elevation Historical Road Resources Climate Time Zone.
Grace enjoys baby-sitting, but it only pays $4 an hour. She has been offered a job as a tutor that pays $8 an hour. She can must work less than 15 hours.
David Evans CS200: Computer Science University of Virginia Computer Science Lecture 15: Intractable Problems (Smiley.
Activity © Snapshot Science, 2010 How was the first man-made cell created? Step1: The scientists choose a bacteria that has one chromosome made up of many.
To change the sample image, select the picture and delete it. Now click the Pictures icon in the placeholder to insert your own image. Click Send to.
David Evans CS200: Computer Science University of Virginia Computer Science Lecture 23: Intractable Problems (Smiley Puzzles.
Graph Theory and Algorithms 1 DM Notes1CMrsLenox.
CS Educators Summit Jenna Garcia District Manager May 4, 2016.
Chapter 4 Review Solving Inequalities.
How to access the online textbook. Go to mehlvilleschooldistrict.com.
My Online Trip to London Our teacher had us learn a lesson about London yesterday. He took us to the computer room and made us take an online trip to London.
Leitch Elementary School
AP Computer Science Principles
Computer Science A-level
Algorithms Detour - Shortest Path
Hour of Code iPad Activities
Welcome to Computer Science!
LG: To identify features of online texts SC:
Minimal Spanning Trees and Graphs
Exploring Computer Science
Color These Maps with Four Colors

You will need a highlighter today!
How to your WhiteBox Bridge design
Graphs Chapter 13.
Welcome to <INSERT school name>’s
Territories.
Making a Useful Resource
Inequalities and their Graphs
Hour of Code.
I THINK I CAN DRAW August 8th and 9th Common Core Connection
Day 18 - Solving simple systems
Warm-Up 1) Write the Now-Next equation for each sequence of numbers. Then find the 10th term of the sequence. a) – 3, 5, 13, 21, … b) 2, – 12, 72, – 432,
21 Elephants and Still Standing
Solving and graphing Compound Inequalities
2nd 9 Weeks MidPoint Review
The largest learning event in history during Computer Science Education Week: December 4-10, 2017.
Introduction to programming
Period 1 Sign into your computer Kyrene.org Educational Resources
Welcome to Mountain View Elementary School!
Bellwork!! 8/14/17 New Week, New Sheet!
Territories.
A Few Sample Reductions
Find your house and make a map of your neighborhood.
Weekly Writing Prompt #6
Getting Loopy Unplugged Lesson 7
My Life Map Name: ______________.
Iggy Peck Architect “Using Engineering Design to Increase Literacy and STEM Interest Among Third Graders” This material is based upon work supported by.
Intersection Method of Solution
Computer Science A-level
Presentation transcript:

DECEMBER 7 TH – 12 TH Newark High School

 What is your favorite app?  If you could invent ANY app, what problem would it solve?

 Copy and paste into Google Chrome Copy and paste into Google Chrome 

 …Participate in the HOUR OF CODE during Science and Advisory class this week.  Sign up to take a Computer Science class next year at Newark High School  Look for opportunities online or through a local program ◦ Code.org ◦ Codeacademy.org ◦ Zip Code Wilmington (offers guaranteed job placement after completing the 12 week program)

Instructions: : Find the minimum number of paving stones that need to be used so that you can get from any house to any other house. (The bridge doesn’t need to be paved.)

 Computer scientists often use this sort of diagram to represent these problems. They call it a graph.  Can you find out a rule to describe how many roads or connections are needed for a best solution? Does it depend on how many houses there are in the city?

Instructions: Color in the countries on this map with as few colors as possible, but make sure that no two bordering countries are the same color.

Instructions: Color in the countries on this map with as few colors as possible, but make sure that no two bordering countries are the same color.

 Computer Science is full of unsolved problems. For instance, it took 120 years for researchers to prove that any map can be colored with 4 colors.