Discrete Mathematics with Graph Theory (Classic Version) (3rd Edition) (Pearson Modern Classics for Advanced Mathematics Series)
Discrete Mathematics with Graph Theory (Classic Version) (3rd Edition) (Pearson Modern Classics for Advanced Mathematics Series)
3rd Edition
ISBN: 9780134689555
Author: Edgar Goodaire, Michael Parmenter
Publisher: PEARSON
bartleby

Concept explainers

Question
Book Icon
Chapter 11.5, Problem 7E

(a)

To determine

The type of scheduling problem. Also, draw the appropriate directed network.

Suppose we want to build a Klein bottle. The tasks involved in this project and the time required for each are recorded in the following table.

Code Tasks Time (in months)
G blow glass 7
Po Polish 5
Sh Shape 9
A Add hole 4
H Affix handles 5
Tw Twist 2
R Remove hole 4
Pa paint 6

The glass must be blown before anything else. Polishing precedes all but G and Sh; shping precedes all but G and Po. The hole must be added before it removed (!) and before the bottle is twisted. The handles go on before Tw and Pa. Once Tw, R, and Pa are completed, the project is finished.

(b)

To determine

All critical paths for this project. Suppose we want to build a Klein bottle. The tasks involved in this project and the time required for each are recorded in the following table.

Code Tasks Time (in months)
G blow glass 7
Po Polish 5
Sh Shape 9
A Add hole 4
H Affix handles 5
Tw Twist 2
R Remove hole 4
Pa paint 6

The glass must be blown before anything else. Polishing precedes all but G and Sh; shping precedes all but G and Po. The hole must be added before it removed (!) and before the bottle is twisted. The handles go on before Tw and Pa. Once Tw, R, and Pa are completed, the project is finished.

(c)

To determine

The slack of Po, Sh, A, Tw and R for each of the critical paths found in (b).Suppose we want to build a Klein bottle. The tasks involved in this project and the time required for each are recorded in the following table.

Code Tasks Time (in months)
G blow glass 7
Po Polish 5
Sh Shape 9
A Add hole 4
H Affix handles 5
Tw Twist 2
R Remove hole 4
Pa paint 6

The glass must be blown before anything else. Polishing precedes all but G and Sh; shping precedes all but G and Po. The hole must be added before it removed (!) and before the bottle istwisted. The handles go on before Tw and Pa. Once Tw, R, and Pa are completed, the project is finished.

(d)

To determine

The completion of the project be delayed. Suppose that tasks Po and A are each delayed 3 months. Suppose we want to build a Klein bottle. The tasks involved in this project and the time required for each are recorded in the following table.

Code Tasks Time (in months)
G blow glass 7
Po Polish 5
Sh Shape 9
A Add hole 4
H Affix handles 5
Tw Twist 2
R Remove hole 4
Pa paint 6

The glass must be blown before anything else. Polishing precedes all but G and Sh; shping precedes all but G and Po. The hole must be added before it removed (!) and before the bottle is twisted. The handles go on before Tw and Pa. Once Tw, R, and Pa are completed, the project is finished.

Blurred answer
Students have asked these similar questions
2 6. Modelling. Suppose that we have two tanks (A and B) between which a mixture of brine flows. Tank A contains 200 liters of water in which 50 kilograms of salt has been dissolved and Tank B contains 100 liters of pure water. Water containing 1kg of salt per liter is pumped into Tank A at the rate of 5 liters per minute. Brine mixture is pumped into Tank A from Tank B at the rate of 3 liters per minute and brine mixture is pumped from Tank A into Tank B at the rate of 8 liters per minute. Brine is drained from Tank B at a rate of 5 liters per minute. (a) Draw and carefully label a picture of the situation, including both tanks and the flow of brine between them. JankA 1ks of Salt Slits Pump EL Brine mit tark A from tank 13 Tank 13 k 3L zooliters of Ico liters of water with pure water. Saky salt → 777 disslore inside Brine mix is pumped from tank A to B of 82 Brine drainen min by Gf salt (b) Assume all brine mixtures are well-stirred. If we let t be the time in minutes, let x(t) 1ks…
5. The graph of ƒ is given below. Sketch a graph of f'. 6. The graph of ƒ is given below. Sketch a graph of f'. 0 x 7. The graph of ƒ is given below. List the x-values where f is not differentiable. 0 A 2 4
2. DRAW a picture, label using variables to represent each component, set up an equation to relate the variables, then differentiate the equation to solve the problem below. The top of a ladder slides down a vertical wall at a rate of 0.15 m/s. At the moment when the bottom of the ladder is 3 m from the wall, it slides away from the wall at a rate of 0.2 m/s. How long is the ladder?

Chapter 11 Solutions

Discrete Mathematics with Graph Theory (Classic Version) (3rd Edition) (Pearson Modern Classics for Advanced Mathematics Series)

Ch. 11.1 - Solve the Chinese Postman Problem for each of the...Ch. 11.1 - Prob. 2ECh. 11.1 - 3. [BB] Solve the Chinese Postman Problem for the...Ch. 11.1 - In a graph G with two odd vertices, 1 and 2 , the...Ch. 11.1 - Solve the Chinese Postman Problem for each of the...Ch. 11.1 - Prob. 6ECh. 11.1 - Prob. 7ECh. 11.1 - Solve the Chinese Postman Problem for the weighted...Ch. 11.1 - Prob. 9ECh. 11.1 - Prob. 10ECh. 11.1 - Prob. 11ECh. 11.1 - Prob. 12ECh. 11.2 - Prob. 1TFQCh. 11.2 - Prob. 2TFQCh. 11.2 - Prob. 3TFQCh. 11.2 - Prob. 4TFQCh. 11.2 - Prob. 5TFQCh. 11.2 - Prob. 6TFQCh. 11.2 - Prob. 7TFQCh. 11.2 - Prob. 8TFQCh. 11.2 - Prob. 9TFQCh. 11.2 - Prob. 10TFQCh. 11.2 - Prob. 1ECh. 11.2 - Prob. 2ECh. 11.2 - Prob. 3ECh. 11.2 - Prob. 4ECh. 11.2 - Prob. 5ECh. 11.2 - Prob. 6ECh. 11.2 - Prob. 7ECh. 11.2 - Prob. 8ECh. 11.2 - Prob. 9ECh. 11.2 - Prove Theorem 11.2.4: A digraph is Eulerian if and...Ch. 11.2 - Prob. 11ECh. 11.2 - Prob. 12ECh. 11.2 - 13. Label the vertices of each pair of digraphs in...Ch. 11.2 - 14. Consider the digraphs , shown. (a) Find the...Ch. 11.2 - The answers to exercises marked [BB] can be found...Ch. 11.2 - In each of the following cases, find a permutation...Ch. 11.2 - Prob. 17ECh. 11.2 - Prob. 18ECh. 11.2 - [BB] if a graph G is connected and some...Ch. 11.2 - Prob. 20ECh. 11.2 - Prob. 21ECh. 11.2 - Prob. 22ECh. 11.2 - Prob. 23ECh. 11.2 - [BB] Apply the original form of Dijkstras...Ch. 11.2 - Prob. 25ECh. 11.2 - Prob. 26ECh. 11.2 - Prob. 27ECh. 11.2 - Prob. 28ECh. 11.2 - [BB] The Bellman-Ford algorithm can be terminated...Ch. 11.2 - Prob. 30ECh. 11.2 - Prob. 31ECh. 11.2 - Prob. 32ECh. 11.2 - Prob. 33ECh. 11.3 - Prob. 1TFQCh. 11.3 - Prob. 2TFQCh. 11.3 - Prob. 3TFQCh. 11.3 - Prob. 4TFQCh. 11.3 - Prob. 5TFQCh. 11.3 - Prob. 6TFQCh. 11.3 - Prob. 7TFQCh. 11.3 - Prob. 8TFQCh. 11.3 - Prob. 9TFQCh. 11.3 - Prob. 1ECh. 11.3 - Prob. 2ECh. 11.3 - Prob. 3ECh. 11.3 - Prob. 4ECh. 11.3 - Prob. 5ECh. 11.4 - Prob. 1TFQCh. 11.4 - Prob. 2TFQCh. 11.4 - Prob. 3TFQCh. 11.4 - Prob. 4TFQCh. 11.4 - Prob. 5TFQCh. 11.4 - Prob. 6TFQCh. 11.4 - Prob. 7TFQCh. 11.4 - Prob. 8TFQCh. 11.4 - Prob. 9TFQCh. 11.4 - Prob. 10TFQCh. 11.4 - Prob. 1ECh. 11.4 - Prob. 2ECh. 11.4 - Prob. 3ECh. 11.4 - Prob. 4ECh. 11.4 - Prob. 5ECh. 11.4 - Prob. 6ECh. 11.4 - Prob. 7ECh. 11.4 - Prob. 8ECh. 11.4 - Prob. 9ECh. 11.4 - Prob. 10ECh. 11.4 - Prob. 11ECh. 11.4 - Prob. 12ECh. 11.5 - Prob. 1TFQCh. 11.5 - Prob. 2TFQCh. 11.5 - Prob. 3TFQCh. 11.5 - Prob. 4TFQCh. 11.5 - Prob. 5TFQCh. 11.5 - Prob. 6TFQCh. 11.5 - Prob. 7TFQCh. 11.5 - Prob. 8TFQCh. 11.5 - Prob. 9TFQCh. 11.5 - 10. In a type scheduling problem, a vertex that...Ch. 11.5 - Prob. 1ECh. 11.5 - [BB] The construction of a certain part in an...Ch. 11.5 - Prob. 3ECh. 11.5 - Prob. 4ECh. 11.5 - Prob. 5ECh. 11.5 - 6.(a) Find two different orientations on the edges...Ch. 11.5 - Prob. 7ECh. 11.5 - 8. Repeat Exercise 7 if, in addition to all the...Ch. 11.5 - Repeat Exercise 7 if A takes 6 months to complete...Ch. 11.5 - Prob. 10ECh. 11.5 - Prob. 11ECh. 11.5 - Prob. 12ECh. 11.5 - Prob. 13ECh. 11.5 - Prob. 14ECh. 11.5 - Prob. 15ECh. 11.5 - Prob. 16ECh. 11.5 - 17. The computer systems manager in mathematics...Ch. 11 - Solve the Chinese Postman Problem for the two...Ch. 11 - Prob. 2RECh. 11 - 3. Solve the Chinese Postman Problem for the...Ch. 11 - Prob. 4RECh. 11 - Prob. 5RECh. 11 - Prob. 6RECh. 11 - Prob. 7RECh. 11 - Prob. 8RECh. 11 - Prob. 9RECh. 11 - 11. Let and assume that the complete graph has...Ch. 11 - Prob. 11RECh. 11 - Prob. 12RECh. 11 - Prob. 13RECh. 11 - Prob. 14RECh. 11 - Use a version of Dijkstras algorithm to find a...Ch. 11 - Prob. 16RECh. 11 - Prob. 17RECh. 11 - Prob. 18RECh. 11 - Prob. 19RECh. 11 - 20. The following chart lists a number of tasks...Ch. 11 - Prob. 21RE
Knowledge Booster
Background pattern image
Math
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Holt Mcdougal Larson Pre-algebra: Student Edition...
Algebra
ISBN:9780547587776
Author:HOLT MCDOUGAL
Publisher:HOLT MCDOUGAL
Text book image
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:9781133382119
Author:Swokowski
Publisher:Cengage
Text book image
Mathematics For Machine Technology
Advanced Math
ISBN:9781337798310
Author:Peterson, John.
Publisher:Cengage Learning,
Text book image
Elementary Geometry For College Students, 7e
Geometry
ISBN:9781337614085
Author:Alexander, Daniel C.; Koeberlein, Geralyn M.
Publisher:Cengage,