1 / 10

Clever Counting

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?

kele
Télécharger la présentation

Clever Counting

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Clever Counting Investigation 3

  2. Making Rounds

  3. 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?

  4. 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. Edge C A B Path

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

  6. 1 x 8 = 8 paths

  7. 2 x 5 = 10 paths

  8. 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.

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

More Related