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
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Question
Chapter 11.5, Problem 4E
To determine
The time taken for this critical path assuming that, in addition to the tasks stated, the workers will take a coffee break. The coffee break must take place after calibration and before inspection. If it occurs before polishing, it requires 6 time units.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
A bank with a branch located in a commercial district of a city has the business objective of developing an improved process for serving customers during the noon-to-1pm lunch period. Management decides to first study the waiting time in the current process. The waiting time is defined as the number of minutes that elapse from when the customer enters the queue until he/she reaches the teller’s window. In addition, suppose that another branch, located in a residential area, is also concerned with improving the process of serving customers in the noon-to-1 pm lunch period and data were collected at random at these branches and recorded below;
No of Customers
Commercial dist branch (time)
Residential area branch (time)
1 – 5
3
3
6 - 10
5
6
11 - 15
8
5
16 – 20
8
3
21 - 25
4
2
RequiredÂ
Which of the branches has a relatively better mean waiting time?
Which shop can be surer of meeting the mean waiting time at the two branches?
Assuming…
Salaries are usually reviewed annually. Suppose that aunion negotiates a pay increase of 5% for its members.If inflation is running at 4%, how much better off are the unionmembers?
Using customer demand data, a company estimates it needs to produce items at a takt time of 38 seconds per item. Based on the operator loading chart shown (as is, without balancing), this process can meet takt time. True or False
Chapter 11 Solutions
Discrete Mathematics with Graph Theory (Classic Version) (3rd Edition) (Pearson Modern Classics for Advanced Mathematics Series)
Ch. 11.1 - Prob. 1TFQCh. 11.1 - Prob. 2TFQCh. 11.1 - Prob. 3TFQCh. 11.1 - In a graph G with two odd vertices, 1 and 2 , the...Ch. 11.1 - If a graph G has six odd vertices, to solve the...Ch. 11.1 - Prob. 6TFQCh. 11.1 - Prob. 7TFQCh. 11.1 - In the weighted graph the Chinese Postman Problem...Ch. 11.1 - Prob. 9TFQCh. 11.1 - In the unweighted graph n, n odd, the Chinese...
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
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
- Repeat Example 5 when microphone A receives the sound 4 seconds before microphone B.arrow_forwardIs carbon dating? Why does it work? Give an example in which carbon dating would be useful.arrow_forwardRefer to Exercise 10 in Section 3.2. Assume that X = 30.0 ± 0.1 Pa, h = 10.0 ± 0.2 mm, and μ = 1.49 Pa · s with negligible uncertainty. a) Estimate V and find the uncertainty in the estimate. b) Which would provide a greater reduction in the uncertainty in V: reducing the uncertainty in τ to 0.01 Pa or reducing the uncertainty in h to 0.1 mm?arrow_forward
- A farmer would like to evaluate Miracle Grow when used on his potted daisy plants. He sets up 20 plants in a room all facing the same window, obtaining the same amount of sunlight, and waters them identically each day. For a month, he monitors how much each plant grows. Then, he adds Miracle Grow to every pot and monitors how much each plant grows during a month with Miracle Grow. At the end of two months, he discovers that 14 plants grew more with Miracle Grow. Test the hypothesis that Miracle Grow increases plant growth (using an alpha level of .01).  a) Is this a one-tailed or two-tailed test?  ( b) State the null hypothesis. c) State the alternative hypothesis. d) Find the critical value(s). e) Calculate the obtained statistic. f) Calculate the P-Value (significance) of the obtained statistic). g) Make a decision. h) What does your decision mean?arrow_forwardConsider the following model:arrow_forwardUse the data to model deliveries times for a driver based on three parameters. If today's delivery routs requires 42 miles, 8.3 gallons of gas, and has 4 deliveries, how much time should the driver expect to be on the road? (Keep one decimal place)  Assignment Miles Gasoline Consumption Deliveries Time 1 100.0 10.0 4.0 9.3 2 50.0 6.2 3.0 4.8 3 100.0 9.5 4.0 8.9 4 100.0 10.3 2.0 6.5 5 50.0 4.7 2.0 4.2 6 80.0 7.8 2.0 6.2 7 75.0 7.7 3.0 7.4 8 65.0 6.4 4.0 6.0 9 90.0 8.8 3.0 7.6 10 90.0 10.0 2.0 6.1 11 50.0 5.0 5.0 7.0 12 45.0 4.9 6.0 7.0 13 85.0 8.1 5.0 9.6 14 65.0 6.6 2.0 6.5 15 40.0 4.0 6.0 7.2 16 50.0 5.5 3.0 6.0 17 75.0 7.4 5.0 9.9 18 75.0 7.6 4.0 8.6 19 65.0 6.8 3.0 4.9 20 90.0 8.4 3.0 7.5 21 95.0 8.8 1.0 7.2 22 95.0 10.2 6.0 9.9 23 50.0 4.6 1.0 5.6 24 80.0 8.6 3.0 7.5 25 90.0 8.6 2.0 7.8 26 80.0 8.8 3.0 7.2 27 75.0 6.9 3.0 7.0 28 95.0 10.0 2.0 8.7 29 90.0 9.2 1.0 6.4 30 100.0 9.4 3.0 9.9 31 60.0 6.0 1.0 4.1 32 90.0…arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage Learning
Trigonometry (MindTap Course List)TrigonometryISBN:9781337278461Author:Ron LarsonPublisher:Cengage Learning
Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage
Linear Algebra: A Modern Introduction
Algebra
ISBN:9781285463247
Author:David Poole
Publisher:Cengage Learning
Trigonometry (MindTap Course List)
Trigonometry
ISBN:9781337278461
Author:Ron Larson
Publisher:Cengage Learning
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:9781133382119
Author:Swokowski
Publisher:Cengage
Continuous Probability Distributions - Basic Introduction; Author: The Organic Chemistry Tutor;https://www.youtube.com/watch?v=QxqxdQ_g2uw;License: Standard YouTube License, CC-BY
Probability Density Function (p.d.f.) Finding k (Part 1) | ExamSolutions; Author: ExamSolutions;https://www.youtube.com/watch?v=RsuS2ehsTDM;License: Standard YouTube License, CC-BY
Find the value of k so that the Function is a Probability Density Function; Author: The Math Sorcerer;https://www.youtube.com/watch?v=QqoCZWrVnbA;License: Standard Youtube License