Redraw this PCB in such a way that no wires cross.

Slides:



Advertisements
Similar presentations
Operational Research (O.R.) case studies. What’s the problem?
Advertisements

Finding a Maximum Matching in Non-Bipartite Graphs Alicia Thilani Singham Goodwin /22/2013.
Last time: terminology reminder w Simple graph Vertex = node Edge Degree Weight Neighbours Complete Dual Bipartite Planar Cycle Tree Path Circuit Components.
WB13 Define the terms bipartite graph,
D1: Matchings.
Instructions for Lesson Delivery 1.This is lesson 1 of 2 for Linear equations. 2.Print the last page for all students so they can place them in their whiteboards.
Operational Research (O.R.) case studies. What’s the problem?
Group 10 Project Part 3 Derrick Jasso Rodolfo Garcia Ivan Lopez M.
Lecture 16 Maximum Matching. Incremental Method Transform from a feasible solution to another feasible solution to increase (or decrease) the value of.
Can you connect the dots as shown without taking your pen off the page or drawing the same line twice.
SPORTS MATCHINGS. YOUR TASK Your are the sports captain of your school. There are four different sports teams which are looking for one more person to.
Operational Research (O.R.) case studies
Sec. 5.1: Planarity & Coloring
Introduction to Graph Theory
Graph Concepts and Algorithms Using LEDA By Caroline Moore and Carmen Frerichs (252a-at and 252a-ao) each graph in the presentation was created using gw_basic_graph_algorithms.
Graph Theory Euler Paths and Euler Circuits. Euler Paths & Circuits Euler Paths and Euler Circuits (Euler is pronounced the same as Oiler) An Euler path.
1 3/21/2016 MATH 224 – Discrete Mathematics First we determine if a graph is connected.
CSC 252 Pallavi Moorthy Homework 5. 1.) Vertices, edges From cd../../handout/demo/graph_alg/gw_shortest_path.
Timetable Problem solving using Graph Coloring
1 Lesson 1 - Functions: Concepts and Notations IB Math SL1 - Santowski 11/23/2016 Math SL 1 - Santowski.
MAT 110 Workshop Created by Michael Brown, Haden McDonald & Myra Bentley for use by the Center for Academic Support.
3.4 Graphing Linear Equations in Standard Form
IOI/ACM ICPC Training 4 June 2005.
Chapter 5.
Redraw these graphs so that none of the line intersect except at the vertices B C D E F G H.
Copyright 2013, 2010, 2007, 2005, Pearson, Education, Inc.
Lecture 16 Bipartite Matching
11 Graphs of Linear Equations, and Inequalities, in Two Variables.
Review: Mini-Quiz Matching
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 10 Trees Slides are adopted from “Discrete.
Planarity Testing.
Review: Mini-Quiz Compound Interest
Class Greeting.
Euler Circuits and Paths
Quiz Review.
Estimating Square Roots of Numbers
Chapter 10.8 Graph Coloring
Decision Maths Dijkstra’s Algorithm.
Do Now Solve each inequality. −3e − 10 ≤ −4 2.
Chapter 9: Graphs Basic Concepts
Systems OF EQUATIONS Elimination.
Chapter 10.8 Graph Coloring
Chapter 10.8 Graph Coloring
January , Math 102 OBJECTIVE: Students will be able to solve one step inequalities and graph the solution on a number line AIM: How is.
Trees L Al-zaid Math1101.
Problem Solving 4.
Review: Mini-Quiz Vector Addition
Decision Maths Graphs.
Review: 8.1a Mini-Quiz Graph the systems of equations. Then determine whether each system has no solution, one solution, or infinitely many solutions.
Euler Circuits and Paths
Graph 3x + y = 6 by making a “T” Table and graphing the line.
Chapter 10.8 Graph Coloring
Optional Homework Assignment
Graph System of Equations!!
Review: Mini-Quiz Tessellation
Solving for x and y when you have two equations
Bipartite graphs and Planar Graphs
Today we will Graph Linear Equations
Name:________________________________________________________________________________Date:_____/_____/__________ BRAIN BLITZ/Warm-UP Solve the following.
Euler Paths and Euler Circuits
Integrated Math One Module 5 Test Review.
Warm Up – 3/19 - Wednesday Give the vertex set. Give the edge set.
DO NOW Copy down your homework: 2-2 Lesson check on page 91
Review: 9.3c Mini-Quiz Simplify 108 − Simplify.
Review: 6.5d Mini-Quiz 1. Solve: 9x2 + 12x + 4 = 0.
Review: Mini-Quiz Percent Error
Chapter 9: Graphs Basic Concepts
A Survey of Mathematics with Applications
For Friday Read chapter 9, sections 2-3 No homework
WELCOME TO MAPLE
Presentation transcript:

Redraw this PCB in such a way that no wires cross. Review: Mini-Quiz Planarity Redraw this PCB in such a way that no wires cross. B C A D E *** Notice that B and C do not have to connect. Slide 1

Class Greeting

Objective: The student will be able to solve Cross Topic Mathematical Problems.

What’s the problem?

You are choosing your courses… You want to study Math, Physics, French and Philosophy You also want to attend Basketball Club Each of these is available in one or more of 6 different option blocks Subject Option Blocks Maths A, B, F Physics D, E, F French A, B Philosophy C, E Basketball Club C

if your combination of courses is possible? How do you decide if your combination of courses is possible?

Let’s summarise the problem We have a set of subjects and a set of option blocks with each subject available in one or more of the option blocks.

We want to match up our chosen subjects with possible option blocks in a systematic method.

This is an example of a Matching Problem

Matching Problems We have two distinct sets of vertices with some edges between the two sets but no edges within a set

We want to find as large as possible a subset of the edges with no two edges sharing a vertex.

Problem: A student at the beginning of year M6 is choosing his course options. He wants to study Math, Physics, French and Philosophy, and he also wants to attend Basketball Club. The College timetable is divided into 6 option blocks labelled A to F. The table below shows which of the student’s chosen courses is available in each option block. Subject Option Blocks Maths A, B, F Physics D, E, F French A, B Philosophy C, E Basketball Club C

  Draw a bipartite graph to represent the availability of subjects. Explain why it is not possible to find a complete matching. The student would like to avoid having lessons in Option E because this is taught on a Friday afternoon. Explain why this is not possible. Having accepted that he cannot avoid Option E, the student would like to try to avoid Option A, which is taught on a Monday morning. Find a maximal matching that does not include Option A. The student suddenly realises that the College also offers guitar lessons, available only in Option D. Even though it will mean that he has a full timetable (and has to get out of bed on a Monday morning) he would like to also attend these. With your maximal matching from (d) as a starting point, use the Alternating Path Algorithm to find a complete matching

Solution: Draw a bipartite graph to represent the availability of subjects. a) The bipartite graph is shown below. MATHS PHYSICS FRENCH PHILOSOPHY BASKETBALL A B C D E F   It is only possible to find a complete matching when each set has the same number of nodes. Explain why it is not possible to find a complete matching.

The student would like to avoid having lessons in Option E because this is taught on a Friday afternoon. Explain why this is not possible. MATHS PHYSICS FRENCH PHILOSOPHY BASKETBALL A B C D E F Basketball Club is only available in Option C and Philosophy only in C and E. The student will therefore have to do Basketball in C and Philosophy in E.   

Having accepted that he cannot avoid Option E, the student would like to try to avoid Option A, which is taught on a Monday morning. Find a maximal matching that does not include Option A. MATHS PHYSICS FRENCH PHILOSOPHY BASKETBALL A B C D E F A maximal matching is   Maths - F Physics – D French – B Philosophy – E Basketball – C

An alternating path is: Guitar – D = Physics – F = Maths – A The student suddenly realises that the College also offers Guitar Lessons, available only in Option D. Even though it will mean that he has a full timetable (and has to get out of bed on a Monday morning) he would like to also attend these. With your maximal matching from (d) as a starting point, use the Alternating Path Algorithm to find a complete matching MATHS PHYSICS FRENCH PHILOSOPHY BASKETBALL A B C D E F GUITAR An alternating path is: Guitar – D = Physics – F = Maths – A This gives a complete matching of:   Maths – A Physics – F French – B Philosophy – E Basketball – C Guitar – D

Another example where this is used British Airways scheduling staff: deciding who will work, when, and where…

Lesson Summary: Objective: The student will be able to solve Cross Topic Mathematical Problems.

Preview of the Next Lesson: Objective: The student will be able to solve Cross Topic Mathematical Problems.

Homework Draw your PCB and HW 7