|
Education
Web
Viewing 1-1 of 1 total results
 GRADE CWR
Concept 4: Vertex-Edge Graphs Understand and apply vertex-edge graphs. In Grades 11 and 12, students extend their understanding of networks to devise, analyze, and apply algorithms for solving problems related to circuits, shortest paths, minimum weight spanning trees,...
1
0
Concept 4: Vertex-Edge Graphs Understand and apply vertex-edge graphs. In Grades 11 and 12, students extend their understanding of networks to devise, analyze, and apply algorithms for solving problems related to circuits, shortest paths, minimum weight spanning trees, and adjacency matrices. Performance Objectives Process Integration Explanations and Examples Students are expected to: PO 1. Study the following topics related to vertex-edge graphs: Euler circuits, Hamilton circuits, the
6
0
http://www.ade.state.az.us/standards/math/Articulated08/Gradeleveldocs/MathGradeCWR.pdf#page=6
www.ade.state.az.us/standards/math/Articulated08/Gradeleveldocs/MathGrade...
This strand requires students to use data collection, data <span class="highlight">analysis</span>, statistics, probability, systematic listing and counting, and the study <span class="highlight">of</span> graphs. This prepares students <span class="highlight">for</span> the study <span class="highlight">of</span> discrete functions as well as to make valid inferences, decisions, and arguments. Discrete mathematics is a branch <span class="highlight">of</span> mathematics that is widely used in business and industry. Combinatorics is the mathematics <span class="highlight">of</span> systematic counting. Vertex-<span class="highlight">edge</span> graphs are used to model and solve problems involving paths, networks, and
14
0
http://www.ade.state.az.us/standards/math/Articulated08/Gradeleveldocs/MathGradeCWR.pdf#page=14
www.ade.state.az.us/standards/math/Articulated08/Gradeleveldocs/MathGrade...
Concept 4: Vertex-<span class="highlight">Edge</span> Graphs Understand and apply vertex-<span class="highlight">edge</span> graphs. In Grades 11 and 12, students extend their understanding <span class="highlight">of</span> networks to devise, analyze, and apply algorithms <span class="highlight">for</span> solving problems related to circuits, shortest paths, minimum weight spanning trees, and adjacency matrices. Performance Objectives Process Integration Explanations and Examples Students are expected to: PO 1. Study the following topics related to vertex-<span class="highlight">edge</span> graphs: Euler circuits, Hamilton circuits, the
15
0
http://www.ade.state.az.us/standards/math/Articulated08/Gradeleveldocs/MathGradeCWR.pdf#page=15
www.ade.state.az.us/standards/math/Articulated08/Gradeleveldocs/MathGrade...
and Examples Students are expected to: PO 2. Understand, analyze, and apply vertex-<span class="highlight">edge</span> graphs to model and solve problems related to paths, circuits, networks, and relationships among a finite number <span class="highlight">of</span> elements, in real-world and abstract settings. Connections: MCWR-S2C4-01, MCWR- S2C4-03, MCWR-S2C4-04, SSHS-S4C1- 03 MCWR-S5C2-01. Analyze a problem situation, determine the question(s) to be answered, organize given <span class="highlight">information</span>, determine how to represent the problem, and identify
|
