UNIT 2 LESSON 6 CS PRINCIPLES. UNIT 2 LESSON 6 OBJECTIVES Students will be able to: Write an algorithm for solving the minimum spanning tree (MST) problem.

Slides:

Advertisements

Similar presentations

Greedy Algorithms.

Advertisements

Networks Prim’s Algorithm

O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.

Introduction to Graph Theory Instructor: Dr. Chaudhary Department of Computer Science Millersville University Reading Assignment Chapter 1.

Great Theoretical Ideas in Computer Science for Some.

CSE373: Data Structures & Algorithms Lecture 24: The P vs. NP question, NP-Completeness Nicki Dell Spring 2014 CSE 373 Algorithms and Data Structures 1.

UNIT-IV Computer Network Network Layer. Network Layer Prepared by - ROHIT KOSHTA In the seven-layer OSI model of computer networking, the network layer.

Train DEPOT PROBLEM USING PERMUTATION GRAPHS

CS774. Markov Random Field : Theory and Application Lecture 06 Kyomin Jung KAIST Sep

7.3 Kruskal’s Algorithm. Kruskal’s Algorithm was developed by JOSEPH KRUSKAL.

Network Optimization Problems: Models and Algorithms This handout: Minimum Spanning Tree Problem.

Math443/543 Mathematical Modeling and Optimization

Minimum Spanning Trees CIS 606 Spring Problem A town has a set of houses and a set of roads. A road connects 2 and only 2 houses. A road connecting.

CS541 Advanced Networking 1 Routing and Shortest Path Algorithms Neil Tang 2/18/2009.

Two Discrete Optimization Problems Problem #2: The Minimum Cost Spanning Tree Problem.

Approximation Algorithms Motivation and Definitions TSP Vertex Cover Scheduling.

Graphs & Graph Algorithms 2 Fawzi Emad Chau-Wen Tseng Department of Computer Science University of Maryland, College Park.

The Shortest Path Problem

Complexity Theory: The P vs NP question Lecture 28 (Dec 4, 2007)

Minimum Spanning Trees. Subgraph A graph G is a subgraph of graph H if –The vertices of G are a subset of the vertices of H, and –The edges of G are a.

WAN Technologies.

TECH Computer Science Graph Optimization Problems and Greedy Algorithms Greedy Algorithms  // Make the best choice now! Optimization Problems  Minimizing.

CMSC 150 INTRODUCTION TO COMPUTING CS 150: Mon 9 Jan 2012.

Minimal Spanning Trees What is a minimal spanning tree (MST) and how to find one.

Algorithms for Network Optimization Problems This handout: Minimum Spanning Tree Problem Approximation Algorithms Traveling Salesman Problem.

Lecture 13 Graphs. Introduction to Graphs Examples of Graphs – Airline Route Map What is the fastest way to get from Pittsburgh to St Louis? What is the.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Sets.

Great Theoretical Ideas in Computer Science.

7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.

Module 5 – Networks and Decision Mathematics Chapter 23 – Undirected Graphs.

Minimum Spanning Trees Easy. Terms Node Node Edge Edge Cut Cut Cut respects a set of edges Cut respects a set of edges Light Edge Light Edge Minimum Spanning.

CSE373: Data Structures & Algorithms Lecture 22: The P vs. NP question, NP-Completeness Lauren Milne Summer 2015.

Most of contents are provided by the website Graph Essentials TJTSD66: Advanced Topics in Social Media.

Minimum Spanning Trees CS 146 Prof. Sin-Min Lee Regina Wang.

Topics Paths and Circuits (11.2) A B C D E F G.

Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 7 The Mathematics of Networks 7.1Trees 7.2Spanning Trees 7.3 Kruskal’s.

UNIT 2 LESSON 3 CS PRINCIPLES. OBJECTIVES Students will be able to: Construct a binary communication protocol for playing Battleship using the Internet.

. Now try this one Challenge:  Is this even possible?  One gets stuck….

How can two different equations have the same solution?? x+7= 25 has the same solution as the equation x + 14 = 32.

Graph Theory Trees. WHAT YOU WILL LEARN Trees, spanning trees, and minimum-cost spanning trees.

UNIT 2 LESSON 8 CS PRINCIPLES. UNIT 2 LESSON 8 OBJECTIVES Students will be able to: Describe how routers develop routing tables to determine how to send.

David Stotts Computer Science Department UNC Chapel Hill.

Networks are connections and interactions. Networks are present in every aspect of life. Examples include economics/social/political sciences. Networks.

Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.

Great Theoretical Ideas in Computer Science.

Spanning Trees Alyce Brady CS 510: Computer Algorithms.

Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)

Minimum-cost spanning tree

Minimum-Cost Spanning Tree and Kruskal’s Algorithm

Algorithms Detour - Shortest Path

Minimum Spanning Tree Chapter 13.6.

Strategies for Problem Solving

Strategies for Problem Solving

APPLICATIONS OF MATRICES APPLICATION OF MATRICES IN COMPUTERS Rabab Maqsood (069)

Spanning Trees Discrete Mathematics.

CS223 Advanced Data Structures and Algorithms

CS200: Algorithm Analysis

Minimum Spanning Tree Neil Tang 3/25/2010

Visualizing Prim’s MST Algorithm Used to Trace the Algorithm in Class

Connected Components Minimum Spanning Tree

Graphs & Graph Algorithms 2

EXPLORING COMPUTER SCIENCE Journal Entries, Portfolio Entries, And Check Your Understanding Unit 2 – Strand 2 Problem Solving This unit focuses on.

4-4 Graph Theory Trees.

COMPUTER NETWORKS CS610 Lecture-42 Hammad Khalid Khan.

Lecture 11 Overview Self-Reducibility.

Minimum Spanning Tree Neil Tang 4/3/2008

Networks Prim’s Algorithm

Minimum Spanning Trees (MSTs)

Prim’s Minimum Spanning Tree Algorithm Neil Tang 4/1/2008

7 The Mathematics of Networks

Presentation transcript:

UNIT 2 LESSON 6 CS PRINCIPLES

UNIT 2 LESSON 6 OBJECTIVES Students will be able to: Write an algorithm for solving the minimum spanning tree (MST) problem. Identify the minimum spanning tree on a given graph. Use the terms algorithm, graph, node, edge correctly. Explain the benefits of developing an algorithm for solving a problem versus solving an instance of a problem.

GRAPH THEORY The MST is a problem in a field of study known as Graph Theory in mathematics and computer science.Graph Theory Problems involving graphs come up a lot in computer science, not only related to networking problems, but also in describing more sophisticated or interconnected relationships between data and information, for example, complicated scheduling problems, logistics, or even sociology problems, or interactions between molecules. Many real-world problems can be expressed or visualized as graphs. The MST problem is interesting because it has an optimal best solution, and the algorithm for finding the MST on a graph is relatively straightforward to understand. A graph might have multiple “best” solutions, and there are several different algorithms for finding them.

MST How much do you think the Internet costs to build and maintain? Let’s say that you are in charge of not one router, but several, and your job is to connect them so that a) any packet can get from any router to any other router in your system, and b) you want to build these connections as cheaply as possible. Say you are in charge of 4 routers placed at various locations in a region. The diagram shows the possible connections that could be made between any pair of routers and the associated cost of building a connection between them (in millions of dollars). Journal #8: Copy this graph into your journal and indicate the MST. What is the cost of the MST?

POSSIBLE STRATEGIES How do you know when to stop? i.e. How do you know you’ve found the minimum? Which edge should you start with? Can you define a strategy for considering an edge, then either keeping it or discarding it?