Networks MUDDY CITY 1.

Slides:



Advertisements
Similar presentations
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.
Advertisements

Graphs Chapter 20 Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013.
CSE 380 – Computer Game Programming Pathfinding AI
Anecdote An anecdote is a short and amusing or interesting story about a real event or person. an anecdote.
Network Flow Models Chapter 7.
Graphs Chapter 28 Copyright ©2012 by Pearson Education, Inc. All rights reserved.
Tools for Game Making Animal Morphs- City Designs – Digital Art – Microsoft.
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
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.
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.
Graph Dr. Bernard Chen Ph.D. University of Central Arkansas.
Using Sample Characters.  On one sheet of lined paper for your pair, write a dialogue involving the characters.  Take turns writing in response to each.
Introduction to Piecewise Functions Unit 8.05 I can write a story based on the graph of a piecewise function. I can create a piecewise function graph based.
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.
The Power of the Recommended Text List Grades 6-8
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,
Most of contents are provided by the website Graph Essentials TJTSD66: Advanced Topics in Social Media.
Representing Motion Investigation 4. Part 1 – Complex Motion.
Source: Complete the Ageism Survey.
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.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
February 11, 2016 Warm-Up:Warm-Up:. Homework Checking the Connections Homework Worksheet.
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.
Strategies & Knowledge for Independent Learning individual Work SKIL SKIL cards are sets of cards that explain how to use different learning strategies.
Representing: Road RaceProjector Resources Representing: Road Race Projector Resources.
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.
Math 6-8: The Standards in Practice: A Common Core Lesson
Ask students to write on an index card individually
BackTracking CS255.
Minimal Spanning Trees and Graphs
Four Points in a Row.
Proportion and Non-Proportion Situations
Science Starter: Science Starter: gas Oxygen.
Lesson Objective: I will be able to …
Minimum Spanning Trees
Three Minute Energiser
Welcome SOAR means….
Greedy Algorithms / Dijkstra’s Algorithm Yin Tat Lee
Route Optimization Problems and Google Maps
Discourse Measurement
TransCAD Vehicle Routing 2018/11/29.
Graphs Chapter 11 Objectives Upon completion you will be able to:
An Introduction to VEX IQ Programming with Modkit
Activator Complete the table and write the function rule:
Chapter 9: Graphs Basic Concepts
Science Fair Final Checklist and Oral Presentation
Discourse Measurement
Activator Complete the table and write the function rule:
Literature and Mathematical Inquiry: Bringing It All Together
Last Class Made websites Finished stencils
Pair work – Do you want to change seats??
Graph Theory I In today’s lesson we will look at:
Ask students to write on an index card individually
Do Now Heading: How Magnets Work Pt. 2
©G Dear 2010 – Not to be sold/Free to use
Graphs.
You say we pay.
Minimum spanning trees
Copyright ©2012 by Pearson Education, Inc. All rights reserved
Laboratory Do’s and Don’ts
Journal Entry 7 Vector Analysis
Chapter 9: Graphs Basic Concepts
Stations May 20th- May 24th.
Welcome SOAR means….
Representing Data Using Frequency Graphs
Presentation transcript:

Networks MUDDY CITY 1

MUDDY CITY - NETWORKS TODAY WE ARE GOING TO TALK ABOUT NETWORK GRAPHS. Jrnal Slide #1 15 SEC WHAT IS A NETWORK? To view this presentation, first, turn up your volume and second, launch the self-running slide show. JOURNAL WRITE DOWN: “A NETWORK CONNECTS THINGS TOGETHER” e.g. COMPUTERS 1

1 MINUTE ON A STICKY NOTE: MAKE A LIST OF NETWORKS YOU COULD FIND IN A CITY To view this presentation, first, turn up your volume and second, launch the self-running slide show. (Think) Slide #2 1 1

WITH YOUR ELBOW-PARTNER: 2. COMBINE YOUR LISTS ONTO 1 MINUTE WITH YOUR ELBOW-PARTNER: 2. COMBINE YOUR LISTS ONTO A SINGLE STICKY NOTE. 3. AND THEN PICK ONE FAVORITE NETWORK. To view this presentation, first, turn up your volume and second, launch the self-running slide show. (Pair) Slide #2 1 1

AS GORDON POINTS TO YOUR PAIR SHOUT- OUT YOUR NETWORK CHOICE. 3 MINUTES RAPID-FIRE AS GORDON POINTS TO YOUR PAIR SHOUT- OUT YOUR NETWORK CHOICE. To view this presentation, first, turn up your volume and second, launch the self-running slide show. (Share) Type Slide #2 1 1

NETWORKS ON THE BOARD (FOR FUTURE REFERENCE.) 1 MINUTE JOURNAL WRITE DOWN: WRITE THE LIST OF NETWORKS ON THE BOARD (FOR FUTURE REFERENCE.) To view this presentation, first, turn up your volume and second, launch the self-running slide show. (Share) Jrnal Slide #2 1 1

A VISUAL REPRESENTATION OF A NETWORK IS CALLED A GRAPH. 2 MINUTES GRAPH A VISUAL REPRESENTATION OF A NETWORK IS CALLED A GRAPH. To view this presentation, first, turn up your volume and second, launch the self-running slide show. (Share) Slide #3 1 1

MUDDY CITY - NETWORKS I HAVE A MATHEMATICAL STORY PROBLEM FOR YOU. Slide #3 To view this presentation, first, turn up your volume and second, launch the self-running slide show. DON’T WRITE ANYTHING DOWN. DO IT ALL IN YOUR HEAD. SO LISTEN CLOSELY. 1

MUDDY CITY - NETWORKS YOU’RE A PILOT OF A COMMUTER AIRLINE JET WHICH LEAVES PORTLAND AIRPORT WITH 100 PASSENGERS ON-BOARD. To view this presentation, first, turn up your volume and second, launch the self-running slide show. 1

MUDDY CITY - NETWORKS IT LANDS IN SLC. 5 DEBARK, 10 EMBARK. (1) To view this presentation, first, turn up your volume and second, launch the self-running slide show. IT LANDS IN PHOENIX. 6 DEBARK, 8 EMBARK. (2) 1

MUDDY CITY - NETWORKS IT LANDS IN ST. LOUIS 4 DEBARK, 12 EMBARK. (3) To view this presentation, first, turn up your volume and second, launch the self-running slide show. IT LANDS IN ATLANTA. 2 DEBARK, 8 EMBARK. (4) 1

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) To view this presentation, first, turn up your volume and second, launch the self-running slide show. 1

MAKES MULTIPLE STOPS TO PICK UP MORE PAYING PASSENGERS. 4 MINUTES MINIMIZE FUEL COST PER PASSENGER MAKES MULTIPLE STOPS TO PICK UP MORE PAYING PASSENGERS. *NOT SHORTEST ROUTE FOR PASSENGER! To view this presentation, first, turn up your volume and second, launch the self-running slide show. MOSES DRAWS (Instruction) Slide #4 1 1

MUDDY CITY - NETWORKS ROADS ARE ONE NETWORK TO CONSIDER. Jrnal Slide #5 JOURNAL WRITE DOWN: “A NETWORK WITH MINIMAL TOTAL LENGTH IS CALLED A MINIMAL SPANNING TREE” [3 PHONES] To view this presentation, first, turn up your volume and second, launch the self-running slide show. 1

REMOVE ENVELOPE CONTENTS MAP OF MUDDY CITY BAG OF M&Ms 2 MINUTES REMOVE ENVELOPE CONTENTS MAP OF MUDDY CITY BAG OF M&Ms BLANK PIECE OF PAPER ONCE UPON A TIME… To view this presentation, first, turn up your volume and second, launch the self-running slide show. (Story) Slide 1 1

3 MINUTES ON A STICKY NOTE: WITH YOUR PARTNER, DESIGN ONE OR TWO APPROACHES YOU COULD USE TO CREATE THE MINIMAL SPANNING TREE. To view this presentation, first, turn up your volume and second, launch the self-running slide show. (Inquiry) Slide 1 1

WRITE DOWN THE DESIGN PLAN YOU AGREED UPON. 1 MINUTES JOURNAL WRITE DOWN: WRITE DOWN THE DESIGN PLAN YOU AGREED UPON. MAKE SURE THAT EVERY HOUSE CAN BE REACHED BY A ROAD! To view this presentation, first, turn up your volume and second, launch the self-running slide show. (Inquiry) Slide 1 1

DO YOU UNDERSTAND YOUR ASSIGNMENT? FIST TO 5 DO YOU UNDERSTAND YOUR ASSIGNMENT? (0-5) Slide #5 0 FIST = DON’T UNDERSTAND 1 – 4 = KIND OF, TO PRETTY SURE 5 = FULLY UNDERSTAND To view this presentation, first, turn up your volume and second, launch the self-running slide show. 1

VISIT ANY TABLES WITHOUT 5s 10 MINUTES GO TO WORK (0-5) Slide #5 To view this presentation, first, turn up your volume and second, launch the self-running slide show. VISIT ANY TABLES WITHOUT 5s 1

HOW MANY ROADS DO YOU HAVE? 1 MINUTE JOURNAL WRITE DOWN: HOW MANY M&Ms DID USE? HOW MANY ROADS DO YOU HAVE? To view this presentation, first, turn up your volume and second, launch the self-running slide show. (Share) Slide 1 1

10 MINUTES EXTENSION ACTIVITY: NOTE: THE NUMBER WRITTEN ON EACH BLANK PAPER IS THE NUMBER OF HOUSES YOU WILL HAVE IN YOUR CITY. To view this presentation, first, turn up your volume and second, launch the self-running slide show. (Extension) Slide 1 1

DESIGN A MINIMAL SPANNING TREE FOR YOUR CITY. DRAW SIMPLE HOUSES. DESIGN A MINIMAL SPANNING TREE FOR YOUR CITY. MAKE SURE THAT EVERY HOUSE CAN BE REACHED BY A ROAD. To view this presentation, first, turn up your volume and second, launch the self-running slide show. (Extension) Slide 1 1

HOW MANY ROADS DO YOU NEED? 1 MINUTE JOURNAL: WRITE DOWN: HOW MANY HOUSES YOU HAD? HOW MANY ROADS DO YOU NEED? To view this presentation, first, turn up your volume and second, launch the self-running slide show. (Share) Slide 1 1

ADD ALL HOUSES AT YOUR TABLE ADD UP ALL ROADS AT TABLE. 1 MINUTE ON A STICKY NOTE: ADD ALL HOUSES AT YOUR TABLE ADD UP ALL ROADS AT TABLE. To view this presentation, first, turn up your volume and second, launch the self-running slide show. (Share) Slide 1 1

AS I POINT TO YOUR TABLE SHOUT- OUT 1 MINUTES RAPID-FIRE AS I POINT TO YOUR TABLE SHOUT- OUT 1. NUMBER OF HOUSES 2. NUMBER OF ROADS. To view this presentation, first, turn up your volume and second, launch the self-running slide show. (Share) Type Slide #2 1 1

THE RELATIONSHIP BETWEEN THE NUMBER OF HOUSES AND THE NUMBER OF ROADS. 2 MINUTES USING THE DATA ON THE BOARD: JOURNAL WRITE DOWN: THE RELATIONSHIP BETWEEN THE NUMBER OF HOUSES AND THE NUMBER OF ROADS. To view this presentation, first, turn up your volume and second, launch the self-running slide show. 46 min (Share) Slide 1 1

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