Networks MUDDY CITY 11. TODAY WE ARE GOING TO TALK ABOUT NETWORK GRAPHS. JOURNAL WRITE DOWN: “A NETWORK CONNECTS THINGS TOGETHER” e.g. COMPUTERS MOSES.

Slides:



Advertisements
Similar presentations
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 19 Introduction to Computer Networks.
Advertisements

Hub and Spoke vs. Point to Point Evan Demick February 28, 2013.
/8/08 GCF, LCM Using Prime Factors #19
CSE 380 – Computer Game Programming Pathfinding AI
Kids Care for the Earth by Gare Thompson
Lecture 27 CSE 331 Nov 3, Combining groups Groups can unofficially combine in the lectures.
Steiner trees Algorithms and Networks. Steiner Trees2 Today Steiner trees: what and why? NP-completeness Approximation algorithms Preprocessing.
Network Flow Models Chapter 7.
Graphs Chapter 28 Copyright ©2012 by Pearson Education, Inc. All rights reserved.
Lecture 25 CSE 331 Nov 2, Adding teeth to group talk Form groups of size at most six (6) Pick a group leader I will ask group leader(s) to come.
Traveling around the world Zhejiang University of Finance & Economics Dong Fang College Toriano Cook.
Map Scale & Distance L.O: Identify distances on maps of varying scales – Local, national, global. Starter: Draw a quick (really quick) map of the classroom.
Programming for Geographical Information Analysis: Advanced Skills Online mini-lecture: Introduction to Networks Dr Andy Evans.
Chapter 9 – Graphs A graph G=(V,E) – vertices and edges
MJ2 Ch – Circle Graphs. Bellwork Please take out your homework from yesterday and leave it on your desk for me to check 1. Draw a circle. Divide.
SEPTEMBER 11, LT: I CAN GIVE CLEAR AND SPECIFIC FEEDBACK I’m looking for:  Journals out and set up with learning target, habits, do now and explore.
 An artwork that is created, when geometric lines are measured and spaced out so that they will produce a design that is either drawn or sewn. These.
DAY 5 INTRO TO ALG. AND THE SEAHAWKS WON! TURN IN YOUR BLUE SURVEYS TO THE “PLACE WHERE YOU TURN STUFF IF”/INBOX SET UP YOUR JOURNAL BE READY TO SHOW.
Computer Science 112 Fundamentals of Programming II Introduction to Graphs.
Communities By: Kristina Brennan and Jesi Bruchey.
K–12 Session 4.2 Standards for Mathematical Practices Part 2: Student Dispositions & Teacher Actions Module 1: A Closer Look at the Common Core State Standards.
Spanning Trees Introduction to Spanning Trees AQR MRS. BANKS Original Source: Prof. Roger Crawfis from Ohio State University.
Spanning Trees Introduction to Spanning Trees AQR MRS. BANKS Original Source: Prof. Roger Crawfis from Ohio State University.
Please CLOSE YOUR LAPTOPS, and turn off and put away your cell phones, and get out your note- taking materials.
Common Core High School Mathematics: Transforming Instructional Practice for a New Era 1.1.
Using the paper provided for this activity, fold your paper so that it is divided into 14 boxes. The bottom 2 boxes should be wider than the others. In.
Lesson 2A. Bell work You and your friends have decided to go to Mexico. There are miles of beautiful beaches, you will be able to explore a new culture,
SET Brain pop Time mmar/subjectandpredicate/preview.we mlhttp:// mmar/subjectandpredicate/preview.we.
Most of contents are provided by the website Graph Essentials TJTSD66: Advanced Topics in Social Media.
Representing Motion Investigation 4. Part 1 – Complex Motion.
Graphs A ‘Graph’ is a diagram that shows how things are connected together. It makes no attempt to draw actual paths or routes and scale is generally inconsequential.
Bestpowerpointtemplates.com Points of View – Telling a Story with Data Exploring Computer Science – Lesson 1-5.
TODAY WE ARE GOING TO TALK ABOUT NETWORK GRAPHS. JOURNAL WRITE DOWN: “A NETWORK CONNECTS THINGS TOGETHER” e.g. COMPUTERS MUDDY CITY - NETWORKS.
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.
7-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.
Network Problems A D O B T E C
Unit 2 Hamiltonian Circuits. Hamiltonian Circuit: A tour that starts at a vertex of a graph and visits each vertex once and only once, returning to where.
13 strategies to use Powerpoint to support active learning in classroom.
Strategies & Knowledge for Independent Learning individual Work SKIL SKIL cards are sets of cards that explain how to use different learning strategies.
Programming Abstractions Cynthia Lee CS106B. Upcoming Topics Graphs! 1.Basics  What are they? How do we represent them? 2.Theorems  What are some things.
Network Analyst. Network A network is a system of linear features that has the appropriate attributes for the flow of objects. A network is typically.
Graphs Chapter 20.
BackTracking CS255.
Minimal Spanning Trees and Graphs
Network Flow Problems – Shortest Path Problem
Four Points in a Row.
Networks MUDDY CITY 1.
Lesson Objective: I will be able to …
Refresh and Get Ready for More
Three Minute Energiser
Greedy Algorithms / Dijkstra’s Algorithm Yin Tat Lee
Route Optimization Problems and Google Maps
TransCAD Vehicle Routing 2018/11/29.
Graphs Chapter 11 Objectives Upon completion you will be able to:
Chapter 9: Graphs Basic Concepts
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
Network Models 7-1.
Algorithms and data structures
Literature and Mathematical Inquiry: Bringing It All Together
Networks Kruskal’s Algorithm
Graph Theory I In today’s lesson we will look at:
Do Now Heading: How Magnets Work Pt. 2
3.OA.1 Arrays and Multiplication Slideshow
Chapter 6 Network Flow Models.
How students learn Build on previously learned materials
©G Dear 2010 – Not to be sold/Free to use
Minimum spanning trees
Copyright ©2012 by Pearson Education, Inc. All rights reserved
Chapter 9: Graphs Basic Concepts
Presentation transcript:

Networks MUDDY CITY 11

TODAY WE ARE GOING TO TALK ABOUT NETWORK GRAPHS. JOURNAL WRITE DOWN: “A NETWORK CONNECTS THINGS TOGETHER” e.g. COMPUTERS MOSES Jrnal iPad Slide #1 MUDDY CITY - NETWORKS 15 SEC WHAT IS A NETWORK?

ON A STICKY NOTE: 1. MAKE A LIST OF NETWORKS YOU COULD FIND IN A CITY 13 1 MINUTE RACHEL (Think) iPad Slide #2

WITH YOUR ELBOW-PARTNER: WITH YOUR ELBOW-PARTNER: 2. COMBINE YOUR LISTS ONTO A SINGLE STICKY NOTE. A SINGLE STICKY NOTE. 3. AND THEN PICK ONE FAVORITE NETWORK. NETWORK MINUTE RACHEL (Pair) iPad Slide #2

RAPID-FIRE 4. AS GORDON POINTS TO YOUR PAIR SHOUT- OUT YOUR NETWORK CHOICE. 15 RACHEL (Share) Type iPad Slide #2 3 MINUTES

16 RACHEL (Share) Jrnal iPad Slide #2 1 MINUTE JOURNAL WRITE DOWN: 5. WRITE THE LIST OF NETWORKS ON THE BOARD (FOR FUTURE REFERENCE.)

GRAPH 6.A VISUAL REPRESENTATION OF A NETWORK IS CALLED A GRAPH. 17 RACHEL (Share) iPad Slide #3 2 MINUTES

I HAVE A MATHEMATICAL STORY PROBLEM FOR YOU. DON’T WRITE ANYTHING DOWN. DO IT ALL IN YOUR HEAD. SO LISTEN CLOSELY. MOSES iPad Slide #3 MUDDY CITY - NETWORKS

YOU’RE A PILOT OF A COMMUTER AIRLINE JET WHICH LEAVES PORTLAND AIRPORT WITH 100 PASSENGERS ON-BOARD. MOSES iPad Slide #3 MUDDY CITY - NETWORKS

IT LANDS IN SLC. 5 DEBARK, 10 EMBARK. (1) IT LANDS IN PHOENIX. 6 DEBARK, 8 EMBARK. (2) MOSES iPad Slide #3 MUDDY CITY - NETWORKS

IT LANDS IN ST. LOUIS 4 DEBARK, 4 DEBARK, 12 EMBARK. (3) IT LANDS IN ATLANTA. 2 DEBARK, 8 EMBARK. (4) MOSES iPad Slide #3 MUDDY CITY - NETWORKS

IT STOPS AT ITS FINAL DESTINATION IN MIAMI. (5) I HAVE 2 QUESTIONS: 1. WHAT IS THE NAME OF THE PILOT? 2. HOW MANY STOPS DID THE PLANE MAKE? (5) MOSES iPad Slide #3 MUDDY CITY - NETWORKS

MINIMIZE FUEL COST PER PASSENGER MAKES MULTIPLE STOPS TO PICK UP MORE PAYING PASSENGERS. *NOT SHORTEST ROUTE FOR PASSENGER! 113 RACHEL (Instruction) iPad Slide #4 4 MINUTES MOSES DRAWS

ROADS ARE ONE NETWORK TO CONSIDER. MOSES Jrnal iPad Slide #5 MUDDY CITY - NETWORKS JOURNAL WRITE DOWN: “A NETWORK WITH MINIMAL TOTAL LENGTH IS CALLED A MINIMAL SPANNING TREE” [3 PHONES]

REMOVE ENVELOPE CONTENTS 1.MAP OF MUDDY CITY 2.BAG OF M&Ms 3.BLANK PIECE OF PATER 115 RACHEL (Story) iPad Slide 2 MINUTES ONCE UPON A TIME…

116 RACHEL (Inquiry) iPad Slide 3 MINUTES ON A STICKY NOTE: WITH YOUR PARTNER, DESIGN ONE OR TWO APPROACHES YOU COULD USE TO CREATE THE MINIMAL SPANNING TREE.

117 RACHEL (Inquiry) iPad Slide 1 MINUTES JOURNAL WRITE DOWN: WRITE DOWN THE DESIGN PLAN YOU AGREED UPON. MAKE SURE THAT EVERY HOUSE CAN BE REACHED BY A ROAD!

FIST TO 5 DO YOU UNDERSTAND YOUR ASSIGNMENT? MOSES (0-5) iPad Slide #5 0 FIST = DON’T UNDERSTAND 1 – 4 = KIND OF, TO PRETTY SURE 5 = FULLY UNDERSTAND

10 MINUTES GO TO WORK MOSES (0-5) iPad Slide #5 VISIT ANY TABLES WITHOUT 5s

120 RACHEL (Share) iPad Slide 1 MINUTE JOURNAL WRITE DOWN: 1.HOW MANY M&Ms DID USE? 2.HOW MANY ROADS DO YOU HAVE?

121 RACHEL (Extension) iPad Slide 10 MINUTES EXTENSION ACTIVITY: NOTE: THE NUMBER WRITTEN ON EACH BLANK PAPER IS THE NUMBER OF HOUSES YOU WILL HAVE IN YOUR CITY.

122 RACHEL (Extension) iPad Slide 1.DRAW SIMPLE HOUSES. 2.DESIGN A MINIMAL SPANNING TREE FOR YOUR CITY. 3.MAKE SURE THAT EVERY HOUSE CAN BE REACHED BY A ROAD.

123 RACHEL (Share) iPad Slide 1 MINUTE JOURNAL: WRITE DOWN: 1.HOW MANY HOUSES YOU HAD? 2.HOW MANY ROADS DO YOU NEED?

124 RACHEL (Share) iPad Slide 1 MINUTE ON A STICKY NOTE: 1.ADD ALL HOUSES AT YOUR TABLE 2.ADD UP ALL ROADS AT TABLE.

RAPID-FIRE AS GORDON POINTS TO YOUR TABLE AS GORDON POINTS TO YOUR TABLE SHOUT- OUT 1. NUMBER OF HOUSES 2. NUMBER OF ROADS. 125 RACHEL (Share) Type iPad Slide #2 1 MINUTES

126 RACHEL (Share) iPad Slide 2 MINUTES JOURNAL WRITE DOWN: THE RELATIONSHIP BETWEEN THE NUMBER OF HOUSES AND THE NUMBER OF ROADS. USING THE DATA ON THE BOARD: 46 min

NEXT TIME: 127 NEXT TIME: WE WILL LOOK AT OTHER TYPES OF NETWORKS