Question: a) The table below lists the flights and their arrival time window. Represent this with a graph where there is a vertex representing each flight

a) The table below lists the flights and their arrival time window. Represent this with a graph where there is a vertex representing each flight and an edge between the vertices if the arrival time window coincides for the corresponding vertices.

Flight Number Arrival Time Window (24 hr)
AF 2056 8:00 - 8:15
DL1452 9:00-9:30
SW3211 14:00-14:20
DL1888 9:20-9:50
CA2287 13:50-14:15

b) How can we use this graph to find the minimum number of runways required to be allotted to flights such that two flights with coinciding arrival time windows are allotted different runways. (2M) c) What is the minimum number of runways required to allot to the flights such that no two flights with coinciding arrival windows are allotted the same runway?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!

Q:

Draw graph models, stating the type of graph (from Table 1) used, to represent airline routes where every day there are four flights from Boston to Newark, two flights from Newark to Boston, three...

Q:

Please create total 5 codings for below questions. 1. Edge.java 2.Graph.java 3.GraphAlgorithms.java 4.Vertex.java 5.VertexDistance.java Below is a question. Graph Traversals Forthisassignment, you...

Q:

Use the following table to help answer the question. \ table [ [ TABLE 1 Graph Terminology.,Multiple Edges Allowed?,Lops Allowed? ] , [ Type , Edges,No , No ] , [ Simple graph,Undirected,Yes,No ] , [...

Q:

module 14 Please solve below question. 5 codings should be created. 1. Edge.java 2. Graph.java 3. GraphAlgorithms.java 4. Vertex.java 5. VertexDistance.java Below is questions. Minimum Spanning Trees...

Q:

Module 14 Assignment: MST Please solve below question. 5 codings should be created. 1. Edge.java 2. Graph.java 3. GraphAlgorithms.java 4. Vertex.java 5. VertexDistance.java Below is questions....

Q:

Please solve below question. 5 codings should be created. 1. Edge.java 2. Graph.java 3. GraphAlgorithms.java 4. Vertex.java 5. VertexDistance.java Below is questions. Minimum Spanning Trees For this...

Q:

i want summary please Survey paper When machine learning meets congestion control: A survey and comparison Huiling Jiang s", Qing Lit ker, Yong Jiang ", , GengBiao Shen ", Richard Sinnott ", Chen...

Q:

Write a program that reads information about a weighted graph from the standard input . The input format starts with a description of a graph in the same format as for Assignment 5. After that are...

Q:

Here is what I have and need help to do steps 6 and 7. #include #include #include using namespace std; struct Edge{ int vertexNumber; double weight; struct Edge* next; Edge( int vn, int wgt, struct...

Q:

Part 2. (12 points) Running Dijkstra's algorithm In this question, we will think about how to answer shortest path problems where we have more than just a sin gle source and destination. Answer each...

Q:

a.Why does Starbucks rely on licenses for most of its international operations? Does the firm risk its dissipation of its managerial or technological advantages b.Can you argue is the Starbucks is a...

Q:

In the Assembly Department of Hannon Company, budgeted and actual manufacturing overhead costs for the month of April 2014 were as follows. All costs are controllable by the department manager....

Q:

When creating an Intentionally - Defective Grantor Trust, one goal of the grantor ( s ) is to continue to be able to pay the income taxes of the business put into the trust, because those tax...

Q:

A class of fourth graders takes a diagnostic reading test, and the scores are reported by reading grade level. The 5-number summaries for the 15 boys and 14 girls are shown below. Complete parts a)...