Excursions in Modern Mathematics (9th Edition)
9th Edition
ISBN: 9780134468372
Author: Peter Tannenbaum
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 8, Problem 51E
Consider the project digraph shown in
a. Use the backflow algorithm to find the critical time for each vertex.
b. Find the critical path for the project.
c. Schedule the project with
d. Explain why the schedule obtained in (c) is optimal.
Figure 8-40
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Use the decreasing time algorithm to create a priority list for the digraph below.
T1 (2)
T4 (11)
T7 (11)
T2 (3)
T5 (3)
T8 (2)
End
ТЗ (2)
T6 (8)
T9 (4)
Priority list:
Give the priority as a list of task numbers. For example, you'd enter something like: 1,2,3,4,5,6,7,8,9
Consider the following graph. Node O is the source node and node T is the terminal node.
2
B
D
T
5
4
3
7
E
5
Find the shortest path from node O to node T along with its total distance using
(a)
Dijkstra's algorithm.
(b)
Find the shortest path from node O to node E and its total distance by looking at
your solution in (a). Do NOT solve from the beginning.
(c)
solution in (a).
Find the fifth nearest node from node O and its total distance by looking at your
(d)
Formulate the shortest path problem from node O to node T as a linear (integer)
programming problem.
What is the output for the vertex
Chapter 8 Solutions
Excursions in Modern Mathematics (9th Edition)
Ch. 8 - For the digraph shown in Fig. 8-25, find a.the...Ch. 8 - For the digraph shown in Fig. 8-26, find Figure...Ch. 8 - For the digraph in Fig. 8-25, find a.all path of...Ch. 8 - For the digraph in Fig. 8-26, find a.a path of...Ch. 8 - For the digraph in Fig. 8-25, find a.all cycles of...Ch. 8 - For the digraph in Fig. 8-26, find a.all cycles of...Ch. 8 - Prob. 7ECh. 8 - For the digraph in Fig.8-26, find a.all vertices...Ch. 8 - a.Draw a digraph with vertex-set V={A,B,C,D} and...Ch. 8 - a.Draw a digraph with vertex-set V={A,B,C,D} and...
Ch. 8 - Prob. 11ECh. 8 - Consider the digraph with vertex-set V={V,W,X,Y,Z}...Ch. 8 - Prob. 13ECh. 8 - Prob. 14ECh. 8 - Prob. 15ECh. 8 - A mathematics textbook consists of 10 chapters....Ch. 8 - Prob. 17ECh. 8 - The digraph in Fig. 8-29 is an example of a...Ch. 8 - Prob. 19ECh. 8 - Wobble, a start-up company, is developing a search...Ch. 8 - A project consists of eight tasks labeled A...Ch. 8 - A project consists of eight tasks labeled A...Ch. 8 - Prob. 23ECh. 8 - Prob. 24ECh. 8 - Prob. 25ECh. 8 - A ballroom is to be set up for a large wedding...Ch. 8 - Prob. 27ECh. 8 - Prob. 28ECh. 8 - Exercises 29 through 32 refer to a project...Ch. 8 - Exercises 29 through 32 refer to a project...Ch. 8 - Prob. 31ECh. 8 - Exercises 29 through 32 refer to a project...Ch. 8 - Prob. 33ECh. 8 - Exercises33 and 34 refer to the Martian Habitat...Ch. 8 - Prob. 35ECh. 8 - Prob. 36ECh. 8 - Prob. 37ECh. 8 - Using the priority list G,F,E,D,C,B,A, schedule...Ch. 8 - Prob. 39ECh. 8 - Using the priority list G,F,E,D,C,B,A, schedule...Ch. 8 - Prob. 41ECh. 8 - Prob. 42ECh. 8 - Prob. 43ECh. 8 - Use the decreasing-time algorithm to schedule the...Ch. 8 - Prob. 45ECh. 8 - Use the decreasing-time algorithm to schedule the...Ch. 8 - Prob. 47ECh. 8 - Consider the project described by the digraph...Ch. 8 - Consider the project described by the digraph...Ch. 8 - Consider the project described by the digraph...Ch. 8 - Consider the project digraph shown in Fig.8-40....Ch. 8 - Consider the project digraph shown in Fig.8-40....Ch. 8 - Prob. 53ECh. 8 - Consider the project digraph shown in Fig.8-41....Ch. 8 - Schedule the Apartments Unlimited project given in...Ch. 8 - Schedule the project given in Exercise26 Table8-5...Ch. 8 - Consider the project described by the project...Ch. 8 - Consider the project digraph shown in Fig.8-43,...Ch. 8 - Prob. 59ECh. 8 - Symmetric and totally asymmetric digraphs. A...Ch. 8 - Prob. 61ECh. 8 - Let W represent the sum of the processing times of...Ch. 8 - You have N=2 processors to process M independent...Ch. 8 - You have N=3 processors to process M independent...Ch. 8 - You have N=2 processor to process M+1 independent...
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
- please show input for part b using demos Graphingarrow_forwardChess is a board game, where the board is made up of 64 squares arranged in an 8-by-8 grid. One of the pieces is a rook, which can move from its current square any number of spaces either vertically or horizontally (but not diagonally) in a single turn. Discuss how you could use graphs to show that a rook can get from its current square to any other square on the board in at most two turns. You’re encouraged to utilize relevant graph definitions, problems, and algorithms where appropriate.arrow_forwardThe ABC Cooling Company manufactures several types of air conditioners. Five departments are involved in the processing required for the products. A summary of he processing sequences required fort he five major products and he weekly production volumes for the products are shown in the table below along with the department area. Based on the Graph-Based Construction Method, develop a block layout. PRODUCT PROCESS SEQUENCE WEEKLY PRODUCTION 1 А-B-C 150 А-В-E-D 200 3 A-C-E 50 4 А-С-В-Е 200 5 A-D-E 250arrow_forward
- graph also needarrow_forwardRon attends a cocktail party (with his graphing calculator in his pocket). He wants to limit his food intake to 143 g protein, 130 g fat, and 162 g carbohydrate. According to the health conscious hostess, the marinated mushroom caps have 3 g protein, 5 g fat, and 9 g carbohydrate, the spicy meatbals have 14 g protein, 7g fat, and 15 g carbohydrate, and the deviled eggs have 13 g protein, 15 g fat, and 6 g carbohydrate. How many of each snack can he eat to obtain his goal? O A. 4 mushrooms, 7 meatballs, 5 eggs O B. 5 mushrooms, 4 meatballs, 7 eggs OC. 8 mushrooms, 6 meatballs, 5 eggs OD. 7 mushrooms, 5 meatballs, 4 eggs O Time Remaining: 00 4851 Next DELL F11 PriScr Delete F12 Insert F4 F6 F7 FB F9 F10 F2 4. Esc F3 F5 41 44 PAA VA 144 %23 &. Backspace 2 3. 4. 6. 7. R T. Tab H. Karrow_forwardthe operation times for the major functional units in this implementation are the following: Memory units: 200 picoseconds (ps) ALU and adders: 50 ps Register file (read or write): 25 ps Assuming that the multiplexors, control unit, PC accesses, sign extension unit, and wires have no delay, which of the following implementations would be faster and by how much? An implementation in which every instruction operates in 1 clock cycle of a fixed length. An implementation where every instruction executes in 1 clock cycle using a variable length clock, which for each instruction is only as long as it needs to be. (Such an approach is not terribly practical, but it will allow us to see what is being sacrificed when all the instructions must execute in a single clock of the same length.) To compare the performance, assume the following instruction mix: 20% loads, 15% stores, 40% ALU instructions, 20% branches, and 5% jumps.arrow_forward
- Compute L3 and R3 for graphs A and B.arrow_forwardSuppose you work for Amazon Prime delivery services. You are assigned a new town to deliver packages to. You discover that the streets are small enough that you can throw the mail to each persons house on both sides of the street as you drive by. (You may not be the greatest mailman but you sure do finish everything pretty fast!) The photo attached is a representation of all the stops you must make. The locations marked with a red dot are those who have mail that needs to be delivered. You decide to complete all your deliveries as efficiently as possible today. To be most efficient you must drive past each delivery stop only once and you also decide to only drive down roads that have a delivery stop. You must start and end at the exact same spot (that way you can get back to your own car quickly). (i) Is this a possible scenario for a route in which all your wants are met? Describe a route or prove a contradiction. (ii) Unfortunately, as you make your way to the starting point you get…arrow_forwardCreate a C++ program to compress and decompress a file. (Files from flashdrive) Must inlucde or consider the ff: Data Structures(list/array/tree/graph) Time Complexityarrow_forward
- Find the optimal value of the given modelarrow_forwardlook at the graphs and fill in the information about the leading co-efficients.arrow_forwardRon attends a cocktail party (with his graphing calculator in his pocket). He wants to limit his food intake to 143 g protein, 130 g fat, and 162 g carbohydrate. According to the health conscious hostess, the marinated mushroom caps have 3 g protein, 5 g fat, and 9 g carbohydrate; the spicy meatballs have 14 g protein, 7 g fat, and 15 g carbohydrate; and the deviled eggs have 13 g protein, 15 g fat, and 6 g carbohydrate. How many of each snack can he eat to obtain his goal?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:9781133382119
Author:Swokowski
Publisher:Cengage
Minimum cuts and maximum flow rate; Author: Juddy Productions;https://www.youtube.com/watch?v=ylxhl1ipWss;License: Standard YouTube License, CC-BY