Homework Solutions.

Slides:

Advertisements

Similar presentations

A B Q Chord AB is 18. The radius of Circle Q is 15. How far is chord AB from the center of the circle? 9 15 (family!) 12 x.

Advertisements

Minimum Spanning Tree Sarah Brubaker Tuesday 4/22/8.

Holt Geometry Proving Constructions Valid Ch. 6 Proving Constructions Valid Holt Geometry Lesson Presentation Lesson Presentation.

Algorithms on graphs In Decision Mathematics, a graph consists of points (called vertices or nodes) which are connected by lines (edges or arcs). Eg in.

EXAMPLE 2 Use perpendicular bisectors SOLUTION STEP 1 Label the bushes A, B, and C, as shown. Draw segments AB and BC. Three bushes are arranged in a garden.

 The factorial function (n!)  Permutations  Combinations.

THE DISTANCE FORMULA ALGEBRA 1 CP. WARM UP Can the set of numbers represent the lengths of the sides of a right triangle? 4, 5, 6.

Minimum spanning trees Aims: To know the terms: tree, spanning tree, minimum spanning tree. To understand that a minimum spanning tree connects a network.

Chapter 4 sections 1 and 2.  Fig. 1  Not connected  All vertices are even.  Fig. 2  Connected  All vertices are even.

Chinese postman problem

MATH 3581 — College Geometry — Spring 2010 — Solutions to Homework Assignment # 3 B E A C F D.

Section 1.3 Segments & Their Measures 1/14. Geometric Vocabulary Postulate : Rules that are accepted without proof. Axiom : Synonym for postulate. Theorem.

Jeopardy Angle Pairs Bisecting $100 $100 $100 $100 $100 $200 $200 $200

Transform of projection School of Mechanical Engineering of DUT.

Right-Angled Trigonometry Involving 3D Example The cuboid below has length AB = 4cm, DE = 6cm and AF = 12cm. Work out the lengths of the diagonals (i)

Warm-up Solve the following problems for x x – 5 = 2x 2.5x – 3 = 2x x – 7 = 4x - 3.

11.2 Areas of Triangles, Trapezoids, and Rhombi What you’ll learn: 1.To find areas of triangles 2.To find areas of trapezoids and rhombi.

POLYNOMIALS. MULTIPLYING POLYNOMIALS REVIEW Polynomials:

Coordinate Geometry Adapted from the Geometry Presentation by Mrs. Spitz Spring 2005

Using Coordinate Geometry to Prove Parallelograms

2004 Trigonometry. Question 1 A diagram of the water slide at the adventure park is shown below.

Parallelograms – Part 2 Geometry Chapter 6 A BowerPoint Presentation Proving quadrilaterals are parallelograms.

Holt McDougal Geometry 4-Ext Proving Constructions Valid 4-Ext Proving Constructions Valid Holt Geometry Lesson Presentation Lesson Presentation Holt McDougal.

Geometry: Plane Figures Chapter. point A point marks a location. A A B B line segment the part of the line between 2 points endpoints.

Determine the sequence of genes along a chromosome based on the following recombination frequencies A-C 20% A-D 10% B-C 15% B-D 5%

By Meli & Amy & Meggie & Bex. What is route inspection hmmmm??? Objective: Is to go along every single edge and end up back to where you started from.

Measuring Segments and Angles During this lesson, you will use segment postulates to determine the lengths of segments.

Reasoning with Properties from Algebra Chapter 2.6 Run Warmup.

Minimum Spanning Trees Text Read Weiss, §9.5 Prim’s Algorithm Weiss §9.5.1 Similar to Dijkstra’s Algorithm Kruskal’s Algorithm Weiss §9.5.2 Focuses on.

Equidistance Theorems Lesson 4.4 Objective: Recognize the relationships between equidistance and perpendicular bisectors. Lesson 4.4 Objective: Recognize.

EXAMPLE 4 Find a minimum distance Parking You are going to buy books. Your friend is going to buy CDs. Where should you park to minimize the distance you.

Unit 3 Chinese Postman. Non - Eulerian Semi - Eulerian Eulerian.

南亚和印度.

12.1 Parts of Circles and Tangent Lines Geometry.

The graph is neither Eulerian or Semi – Eulerian as it has 4 ODD vertices.

CHAPTER 1 SECTION 5.

AS Maths Decision Paper June 2011 Model Answers.

COMP108 Algorithmic Foundations Greedy methods

AS Maths Decision Paper June 2011 Model Answers.

Using Coordinate Geometry to Prove Parallelograms

COP 6726: New Directions in Database Systems

Kruskal’s Algorithm Elaicca Ronna Ordoña. A cable company want to connect five villages to their network which currently extends to the market town of.

Combinations COURSE 3 LESSON 11-3

Mid-point Theorem and Intercept Theorem

Using Coordinate Geometry to Prove Parallelograms

تصنيف التفاعلات الكيميائية

CSE373: Data Structures & Algorithms Lecture 12: Minimum Spanning Trees Catie Baker Spring 2015.

Richard Anderson Lecture 27 Network Flow Applications

CSE373: Data Structures & Algorithms Lecture 20: Minimum Spanning Trees Linda Shapiro Spring 2016.

Minimum Spanning Trees

The General Triangle C B A.

AS Maths Decision Paper January 2006 Model Answers.

Example A cable company want to connect five villages to their network which currently extends to the market town of Avonford. What is the minimum.

Minimum spanning trees

Angles and Bisectors.

AS Maths Decision Paper January 2012 Model Answers.

AB AC AD AE AF 5 ways If you used AB, then, there would be 4 remaining ODD vertices (C, D, E and F) CD CE CF 3 ways If you used CD, then, there.

Minimum spanning trees

Planarity K4 (complete)

Networks Kruskal’s Algorithm

The General Triangle C B A.

1. For A(–4, 8) and B(5, 8), find the midpoint of AB.

Kruskal’s Algorithm AQR.

Distance Formula d = √ (x1 – x2)2 + (y1 – y2)2, where d is the distance between the points (x1, y1) and (x2, y2).

Section 1.6 Solving Inequalities.

If AD = 10, DC =6, and ED = 15, find DB.

Pythagoras theorem statement

Presentation transcript:

Homework Solutions

June 2010 Odd vertices A, B, C, M AB + CM = 25 + 48 or 73 AC + BM = 24 + 49 or 73 AM + BC = 47 + 23 or 70 Repeat AM + BC = 70 Min = 384 + 70 = 454 bii) 8 edges at F so F will be visited 8 ÷ 2 = 4

The ODD VERTICES are noted down A, C, D, F The COMBINATIONS with DISTANCES AC + DF = 18 + 22 = 40 AD + CF = 32 + 30 = 62 AF + CD = 12 + 30 = 42 REPEAT the SHORTEST DISTANCE AC + DF = 18 + 22 = 40 TOTAL DISTANCE 164 + 40 = 204

b) Start / Finish A or C Repeat DF = 22 TOTAL DISTANCE 164 + 22 = 186 ci) You need to repeat the shortest pair = AF Repeat AF = 12 TOTAL DISTANCE 164 + 12 = 176 cii) Start / Finish at C / D

The ODD VERTICES are noted down A, B, C, D June 08 The ODD VERTICES are noted down A, B, C, D The COMBINATIONS with DISTANCES AB + CD = 270 + 270 = 540 AC + BD = 290 + 290 = 580 AD + BC = 260 + 270 = 530 REPEAT the SHORTEST DISTANCE AD + BC = 260 + 270 = 530 TOTAL DISTANCE 1920 + 530 = 2450

bi) Repeats BC (Length = 1920 + 270 =) 2190 (metres) ci) She needs to repeat the shortest repeated distance which is AD = 260 (Length = 1920 + 260 =) 2180 (metres) cii) B or C

The ODD VERTICES are noted down B, C, F, H The COMBINATIONS with DISTANCES BC + FH = 160 + 320 = 480 BF + CH = 360 + 210 = 570 BH + CF = 280 + 520 = 800 REPEAT the SHORTEST DISTANCE BC + FH = 160 + 320 = 480 TOTAL DISTANCE 2410 + 480 = 2890