| A. Data Analysis
[4.4.4.A] |
|
- Collect, generate, organize, and display data in response
to questions, claims, or curiosity.
- Data collected from the school environment
- Read, interpret, construct, analyze, generate questions about,
and draw inferences from displays of data.
- Pictograph, bar graph, line plot, line graph, table
- Average (mean), most frequent (mode), middle term (median)
- Use everyday events and chance devices, such as dice, coins,
and unevenly divided spinners, to explore concepts of probability.
- Likely, unlikely, certain, impossible, improbable, fair,
unfair
- More likely, less likely, equally likely
- Probability of tossing "heads" does not depend
on outcomes of previous tosses
- Determine probabilities of simple events based on equally
likely outcomes and express them as fractions.
- Predict probabilities in a variety of situations (e.g., given
the number of items of each color in a bag, what is the probability
that an item picked will have a particular color).
- What students think will happen (intuitive)
- Collect data and use that data to predict the probability
(experimental)
- Analyze all possible outcomes to find the probability
(theoretical)
| C. Discrete
MathematicsSystematic Listing and Counting [4.4.4.C] |
|
- Represent and classify data according to attributes, such
as shape or color, and relationships.
- Venn diagrams
- Numerical and alphabetical order
- Represent all possibilities for a simple counting situation
in an organized way and draw conclusions from this representation.
- Organized lists, charts, tree diagrams
- Dividing into categories (e.g., to find the total number
of rectangles in a grid, find the number of rectangles of
each size and add the results)
| D. Discrete
MathematicsVertex-Edge Graphs and Algorithms [4.4.4.D] |
|
- Follow, devise, and describe practical sets of directions
(e.g., to add two 2-digit numbers).
- Play two-person games and devise strategies for winning the
games (e.g., "make 5" where players alternately add
1 or 2 and the person who reaches 5, or another designated number,
is the winner).
- Explore vertex-edge graphs and tree diagrams.
- Vertex, edge, neighboring/adjacent, number of neighbors
- Path, circuit (i.e., path that ends at its starting point)
- Find the smallest number of colors needed to color a map or
a graph.
|