MAZ501B: Dis Math B (2014-2015)
CURRICULUM PROGRAM: Mathematics
COURSE TITLE: Discrete Math II
CALENDAR YEAR: 2014-2015
GRADE LEVEL: 10-12
COURSE LENGTH: 18 weeks
Major Concepts/Content: Discrete Math B is a semester course that is independent of and can be taken before or after Discrete Math A. Discreet mathematics courses differ greatly from traditional mathematics courses. This course is an applications-driven course that is based upon the study of events that occur in small (discrete) chunks. Discrete concepts are used extensively in business, industry, government, and in the digital world. The major areas of study are counting and probability, graph theory, the mathematics of social choice (voting and fair division), and coding and encryption. Some of the questions investigated in discrete mathematics are: What does a barcode mean? What is the most efficient way a delivery truck can visit ten destinations? Should you buy a lottery ticket?
Major Instructional Activities: Probability applications include predicting outcomes using combinations, permutations, and counting principles. Mathematics of social choice investigates election theory and fair division. The graph theory component investigates vertex-edge graphs, critical paths, graph coloring, and minimal spanning trees as a way of analyzing a variety of application problems. The concept of recursion is a strategy embedded throughout discrete studies. Concepts will be explored and simulated using a variety of technology tools.
Major Evaluative Techniques: Assessments (formal and informal) will be used to describe and identify student progression toward the discrete mathematics expectations. Students will be asked to demonstrate the depth of their knowledge through tasks that mirror realistic situations. Students will also be required to develop verbal, written and technological skills in the process of solving problems as well as use critical thinking in working towards a solution.
Course Objectives: • Graphs of vertices and edges to model a problem situation. • Critical path analysis to solve scheduling problems. • Graph coloring techniques. • Minimal spanning trees to solve problems. • Tree diagrams, Venn diagrams and other pictorial representations to find the number of outcomes in a problem situation. • The fundamental counting principle to find the number of outcomes. • Counting techniques to solve problems. • Simulations to solve counting and probability problems. • Recursive thinking to solve problems.
Course Notes: DIVIDE INTO 2 SEMESTERS DISCRETE MATH A, DISCRETE MATH B