|
School City of Hobart |
School City of Hobart Mathematics |
Mathematics - Discrete Mathematics |
|
Counting Techniques
The learner will be able to
use counting techniques.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
DM.1.1
The learner will be able to
use networks, traceable paths, tree diagrams, Venn diagrams, and other pictorial representations to find the number of outcomes in a problem situation.
Example: In a motel there are 4 different elevators that go from Joan's room to the pool and 3 different doors to the pool area. Use a tree diagram to show how many different ways Joan can get from her room to the pool.
.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
DM.1.2
The learner will be able to
use the fundamental counting principle to find the number of outcomes in a problem situation.
Example: You are getting dressed one morning when you realize that you have far too many choices. You have 6 shirts to choose from, 4 pairs of jeans, and 3 pairs of shoes. Ignoring color coordination, construct a tree diagram or other pictorial representation to show how many different outfits you could assemble.
.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
DM.1.3
The learner will be able to
use combinatorial reasoning to solve problems.
Example: You know that your locker combination contains the numbers 2, 4, 6, and 8, but you have forgotten the order in which they occur. What is the maximum number of combinations you need to try before your locker opens?
.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
DM.1.4
The learner will be able to
use counting techniques to solve probability problems.
Example: In the last example, what is the probability that your locker opens with the first combination you try?
.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
DM.1.5
The learner will be able to
use simulations to solve counting and probability problems.
Example: A panel of 12 jurors was selected from a large pool that was 70% male and 30% female. The jury turned out to be 11 men and 1 woman. Suspecting gender bias, the defense attorneys asked how likely is it that this situation, or worse, would occur purely by chance. Simulate this situation using a random number generator to select 12 numbers, letting 0, 1, and 2 represent women and 3, 4, 5, 6, 7, 8, and 9 represent men. Note the number of times that 11 or 12 men are chosen.
.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
Matrices
The learner will be able to
use matrices.
Strand |
Scope |
Source |
Matrices |
Master |
IDOE |
|
DM.2.1
The learner will be able to
use matrices to organize and store data.
Example: Central High School offers three different styles of class rings - standard, classic, and deluxe. Each style is available in a girl's ring and a boy's ring. Make up your own data to show how many of each variety was sold and store it in a matrix with rows and columns labeled.
.
Strand |
Scope |
Source |
Matrices |
Master |
IDOE |
|
DM.2.2
The learner will be able to
use matrix operations to solve problems.
Example: Suppose the rings in the previous problem cost $90, $120, and $135 for the girls' rings and $110, $140, and $165 for the boys' rings. Display this information in a matrix and use matrix multiplication to find the total revenue from the sale of girls' rings and boys' rings.
.
Strand |
Scope |
Source |
Matrices |
Master |
IDOE |
|
DM.2.3
The learner will be able to
use row-reduction techniques to solve problems.
Example: Solve this system of equations using an augmented matrix and row reduction:
x - 2y + 3z = 5
x + 3z = 11
5y - 6z = 9
.
Strand |
Scope |
Source |
Matrices |
Master |
IDOE |
|
DM.2.4
The learner will be able to
use the inverse of a matrix to solve problems.
Example: Solve the system of equations in the last example using an inverse matrix.
.
Strand |
Scope |
Source |
Matrices |
Master |
IDOE |
|
DM.2.5
The learner will be able to
use Markov chains to solve problems.
Example: If a student does homework one day, there is a 70% probability that he or she will do it again the next day. If a student does not do homework one day, there is a 60% probability that he or she will not do it again the next day. On Thursday, 75% of the students did their homework. What can you expect to happen on Friday?
.
Strand |
Scope |
Source |
Matrices |
Master |
IDOE |
|
Recursion
The learner will be able to
use recursive techniques.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
DM.3.1
The learner will be able to
use recursive thinking to solve problems.
Example: How many handshakes would occur in this room if everyone shook hands with everyone else? Create a spreadsheet that will find the number of handshakes starting with one person and increasing the number to 15.
.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
DM.3.2
The learner will be able to
use finite differences to solve problems.
Example: Add two columns to the spreadsheet from the previous example and create appropriate formulas for each to calculate first and second differences.
.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
Graph Theory
The learner will be able to
use graph theory techniques.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
DM.4.1
The learner will be able to
use graphs consisting of vertices and edges to model a problem situation.
Example: There are two islands in the River Seine in Paris. The city wants to construct four bridges that connect each island to each side of the riverbank and one bridge that connects the two islands directly. The city planners want to know if it is possible to start at one point, cross all five bridges, and end up at the same point without crossing a bridge twice. Use a graph to help solve this problem.
.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
DM.4.2
The learner will be able to
use critical path analysis to solve scheduling problems.
Example: Write a critical task list for redecorating your room. Some tasks depend on the completion of others and some may be carried out at any time. Use a graph to find the least amount of time needed to complete your project.
.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
DM.4.3
The learner will be able to
use graph coloring techniques to solve problems.
Example: Color a map of the Midwestern states of the United States so that no adjacent states are the same color. What is the minimum number of colors needed?
.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
DM.4.4
The learner will be able to
use minimal spanning trees to solve problems.
Example: The telephone company wants to connect cities with new telephone lines. They calculate the cost of connecting each pair of cities, but want to reduce costs by connecting cities through others. Given a graph showing the cost of connecting each pair of cities, find the minimum cost for connecting all the cities with new telephone lines.
.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
DM.4.5
The learner will be able to
use bin-packing techniques to solve problems.
Example: Six large crates of electronic equipment are to be shipped to a warehouse. The crates weigh 2,800, 6,000, 5,400, 1,600, 6,800, and 5,000 pounds. Each delivery truck has a capacity of 10,000 pounds. What is the minimum number of trucks needed to send all the crates?
.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
Social Choice
The learner will be able to
use the mathematics of social choice.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
DM.5.1
The learner will be able to
use election theory techniques to analyze election data.
Example: Each student in your class ranks four kinds of pop from the most preferred to least preferred. Discuss the merits of various methods for deciding on the overall ranking by the class.
.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
DM.5.2
The learner will be able to
use weighted voting techniques to decide voting power within a group.
Example: Company stockholders have different numbers of votes according to their holdings. For given holdings, find the power index of each stockholder.
.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
DM.5.3
The learner will be able to
use fair division techniques to divide continuous objects.
Example: Find a method for dividing a piece of cake among three people so that each person feels they have received a fair share.
.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
DM.5.4
The learner will be able to
use fair division techniques to solve apportionment problems.
Example: Find the enrollment of seniors, juniors, sophomores, and freshmen at your high school. If there are 20 seats on the Student Council, how should the representatives be apportioned so that the voting power of each class is proportional to its size?
.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
Linear Programming
The learner will be able to
use linear programming techniques.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
DM.6.1
The learner will be able to
use geometric techniques to solve optimization problems.
Example: A company produces two varieties of widgets - standard and deluxe. A standard widget takes 3 hours to assemble and 6 hours to finish. A deluxe widget takes 5 hours to assemble and 5 hours to finish. The assemblers can work no more than 45 hours per week and the finishers can work no more than 60 hours per week. The profit is $32 on a standard widget and $40 on a deluxe widget. Use a graph to find how many of each model should be produced each week to maximize profit.
.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
DM.6.2
The learner will be able to
use the Simplex method to solve optimization problems with and without technology.
Example: Use the Simplex method to solve the problem in the last example.
.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
Game Theory
The learner will be able to
use game theory.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
DM.7.1
The learner will be able to
use game theory to solve strictly determined games.
Example: Consider a card game where John gets a 4 of Hearts and a 5 of Clubs, and Susan gets a 3 of Clubs and a 6 of Hearts. The players each show one card simultaneously. The player who shows the card of larger value receives the sum of the numbers on the two cards shown. Set up the game matrix and find the optimal strategy and the value of the game.
.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
DM.7.2
The learner will be able to
use game theory to solve non-strictly determined games.
Example: In the game "Two-Finger Morra," each of two players shows either one or two fingers. If the total number of fingers shown is even, Player A collects a dollar for each finger shown from Player B. If the total number of fingers is odd, Player A pays $3 to Player B. Set up the game matrix and find the optimal strategy and the value of the game.
.
Strand |
Scope |
Source |
Discrete Mathematics |
Master |
IDOE |
|
|