Clever Counting Investigation 3. Making Rounds A. How many paths are there from A to B? How many paths are there from B to C? B. How many paths are there.

Slides:

Advertisements

Similar presentations

1 Senn, Information Technology, 3 rd Edition © 2004 Pearson Prentice Hall James A. Senns Information Technology, 3 rd Edition Chapter 7 Enterprise Databases.

Advertisements

2-3C Finding an Equation of a Line 2-3C Finding an Equation of a Line Objectives: To write an equation of a line using the slope-intercept equation.

Deciding Whether Order Is Important Clever Counting Investigation 4.

Information Theory in Software Metrics (Assessment and Issues) Steve Counsell, (Brunel University and CREST)

Iterative Rounding and Iterative Relaxation

Objective - To simplify expressions using the order of operations. Simplify each expression below. 1) 6 + 5(8 - 2) 2) 3) 4)

Learning outcomes ALL MUST be able to MOST SHOULD be able to SOME COULD.

7 th Grade NJ Standards Presentation. A B Draw on the number line above where the product of A and B would fall. Label your point C Explain your.

Means from Frequency Tables A Learning Object produced by Sidney Tyrrell, Coventry University, as part of her National Teaching Fellowship project.

Lets Think Through Maths! Activity 10 Money-Go-Round.

Warm Up Simplify each expression. Round to the nearest whole number if necessary (3) –5(2)5 – – (0.5)2.

Connection Patterns & Functions.2

Mathematical Induction (cont.)

ECE Longest Path dual 1 ECE 665 Spring 2005 ECE 665 Spring 2005 Computer Algorithms with Applications to VLSI CAD Linear Programming Duality – Longest.

AB 11 22 33 44 55 66 77 88 99 10  20  19  18  17  16  15  14  13  12  11  21  22  23  24  25  26  27  28.

Network exercise (P2) Consider the PERT/CPM network shown below. D A 2

A man and his dog. An investigation A man and his dog breadth length field A B Each day a man takes his dog out for a walk. They walk along the side.

15C Backward scanning and crashing

Introduction of Probabilistic Reasoning and Bayesian Networks

Advanced Internet Application Group 6 JunHee Park, Unkyong Lee.

Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.

Global Approximate Inference Eran Segal Weizmann Institute.

A tree is a simple graph satisfying: if v and w are vertices and there is a path from v to w, it is a unique simple path. a b c a b c.

CS541 Advanced Networking 1 Routing and Shortest Path Algorithms Neil Tang 2/18/2009.

The Mathematics of Networks Chapter 7. Trees A tree is a graph that –Is connected –Has no circuits Tree.

Chapter 11 Graphs and Trees This handout: Terminology of Graphs Eulerian Cycles.

Consecutive Numbers Unit 5 – Activity 1 0, 1, 2, 4, 6, 8, 9, 11, Can you find any consecutive numbers?

UNDERSTANDING PHINEAS Building a 3D Neural Network.

Written Practice Lesson 20.

Team Building. Team Building Activity (Timer min) Magazine Picture Explain why this magazine picture represent you? Explain why this magazine picture.

7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.

Clever Counting Investigation 2. Mathematical and Problem-Solving Goals To further explore counting situations in which multiplication provides an answer.

Coverage Criteria for Testing of Object Interactions in Sequence Diagrams Atanas (Nasko) Rountev Scott Kagan Jason Sawin Ohio State University.

Find the equation of the line that has... A B C D E F

Investigation 3 Networks. Problem of The Day A man has to get a fox, a chicken, and a sack of corn across a river. He has a rowboat, and it can only carry.

Graph Theory. A branch of math in which graphs are used to solve a problem. It is unlike a Cartesian graph that we used throughout our younger years of.

. Now try this one Challenge:  Is this even possible?  One gets stuck….

Multi-Source Latency Variation Synchronization for Collaborative Applications Abhishek Bhattacharya, Zhenyu Yang & Deng Pan.

Graph theory and networks. Basic definitions  A graph consists of points called vertices (or nodes) and lines called edges (or arcs). Each edge joins.

1 Local Hashing for ECMP Ali Sajassi September 21, 2011 IEEE Interim Meeting.

Networks are connections and interactions. Networks are present in every aspect of life. Examples include economics/social/political sciences. Networks.

15B Critical path analysis. In a critical path analysis, edges represent activities. Nodes (vertices) represent the end of one activity and the start.

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.

Facility Location and Network Design Models. Facility Location Assumptions Based on graph G=(V,E) Demand nodes, I  V, are known and fixed Set J  V of.

Importance Measures on Nodes Lecture 2 Srinivasan Parthasarathy 1.

Constraint-Based Routing

Last Week of February! Warm-Up… Quickwrite… Simplify 128 Simplify 4 5

Spanning Trees Discrete Mathematics.

CS223 Advanced Data Structures and Algorithms

Network Notes Ms Allan 2012 AS91260 (2.5) Designed to teach from,

Transportation, Assignment and Network Models

In-Class Exercises: Interpretations of Probability

Simplifying Expressions

Nodes, Branches, and Loops

Running example The 4-houses puzzle:

Pairwise Markov Networks

Warm Up – Wednesday.

ELECTRICAL CIRCUITS AND CONSTRUCTIONS An electrical circuit is a network consisting of a closed loop, giving a return path for the current 2.

Route Inspection The first method mark is for three distinct pairings of the correct four odd nodes. Get this wrong and you lose all say (five) marks.

Check it out! 1.5.1: Estimating Sample Proportions

CS224w: Social and Information Network Analysis

QUESTION 1 Simplify a7 x a2 A: a14 B: a9 C: a72 D: a5.

Network Flow CSE 373 Data Structures.

Maximum Flow Neil Tang 4/8/2008

Warm Up – Tuesday Find the critical times for each vertex.

QUESTION 1 Simplify a7 x a2 A: a14 B: a9 C: a72 D: a5.

Chapter 10 Graphs and Trees

Chapter 14 Graphs © 2011 Pearson Addison-Wesley. All rights reserved.

Presentation transcript:

Clever Counting Investigation 3

Making Rounds

A. How many paths are there from A to B? How many paths are there from B to C? B. How many paths are there from A to C through B? Explain your reasoning. C. If Rodney has a small locker, how many paths from A to C pass by his locker? D. If Rodney has a large locker, how many paths from A to C pass by his locker? E. If Rodney has a small locker, what is the probability that the guard will not pass his locker on one of her rounds? F. If Rodney has a large locker, what is the probability that the guard will not pass his locker on one of her rounds?

Networking A, B, and C are nodes. A path from node A to node C consists of an edge from node A to node B followed by a edge from node B to node C. AB C Edge Path

This network models the warehouse floor plan because it contains all the important information in a simplified form.

1 x 8 = 8 paths

2 x 5 = 10 paths

For each edge that connects nodes A and B, there are 32 ways to complete the path to node C, for a total of 25 x 32 = 800 paths.

You have found the number of paths through several networks. In problem 3.3, you will design networks that satisfy given constraints.