Standard 2 : Apply optimization and techniques from Graph Theory to solve problems.



This document was generated on CPALMS - www.cpalms.org

General Information

Number: MA.912.LT.2
Title: Apply optimization and techniques from Graph Theory to solve problems.
Type: Standard
Subject: Mathematics (B.E.S.T.)
Grade: 912
Strand: Logic and Discrete Theory

Related Benchmarks

This cluster includes the following benchmarks
Code Description
MA.912.LT.2.1: Define and explain the basic concepts of Graph Theory.
Clarifications:
Clarification 1: Basic concepts include vertex, edge, directed edge, undirected edge, path, vertex degree, directed graph, undirected graph, tree, bipartite graph, circuit, connectedness and planarity.
MA.912.LT.2.2: Solve problems involving paths in graphs.
Clarifications:
Clarification 1: Instruction includes simple paths and circuits; Hamiltonian paths and circuits; and Eulerian paths and circuits.
MA.912.LT.2.3: Solve scheduling problems using critical path analysis and Gantt charts. Create a schedule using critical path analysis.
MA.912.LT.2.4: Apply graph coloring techniques to solve problems.
Clarifications:
Clarification 1: Problems include map coloring and committee assignments.
MA.912.LT.2.5: Apply spanning trees, rooted trees, binary trees and decision trees to solve problems.
Clarifications:
Clarification 1: Instruction includes the use of technology to determine the number of possible solutions and generating solutions when a feasible number of possible solutions exists.
MA.912.LT.2.6: Solve problems concerning optimizing resource usage using bin-packing techniques.
MA.912.LT.2.7: Solve problems involving optimal strategies in Game Theory.
Clarifications:
Clarification 1: Problems include zero-sum games, such as Paper-Scissors-Rock, and nonzero-sum games, such as Prisoner’s Dilemma.

Clarification 2: Instruction includes pure and mixed strategies and game equilibria.