Excursions In Modern Mathematics, 9th Edition
9th Edition
ISBN: 9780134494142
Author: Tannenbaum
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 8, Problem 52E
Consider the project digraph shown in
a. Schedule the project with
b. Explain why the schedule obtained in (a) 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
Coordinates for a clipping window and a line are given in the following figure. Use Liang-
Q1.
Barsky algorithm to clip this line with respect to the clipping window. Show your steps and calculations
clearly.
Ymax=20-
Po(8, 12)
Ymin=10
P1(30,6)
Xmin=10
Xmax=20
[2B] (Please type and draw your answers digitally).The given table below (1st picture) shows the 5 different places that you would like to visit on a particular day. The table below shows the estimated distance (in kilometers per hour) it takes you to travel from one place to another. If you will visit each of these places exactly once, determine the shortest time possible it would take you to do using the Edge-Picking Algorithm. Example (2nd photo) already provided in the photos below.
10.
Use the decreasing time algorithm to create a priority list for the digraph below, then schedule the project with two processors.
***Picture***
Task 6 is done by = ***Processor 1 or 2 *** starting at time = ______ Task 9 is done by = ***Processor 1 or 2 *** starting at time =________ The finishing time for the schedule is _____________
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
- [(1B)] The given table below shows the 6 different places that you would like to visit on a particular day. The table below shows the estimated amount of time (in minutes) it takes you to travel (by any means of transportation) from one place to another. If you will visit each of these places exactly once, determine the shortest time possible it would take you to do using the Edge-Picking Algorithm. Examples already provided in the photos below. Home Hospital Mall Esplanade Pet Shop Market Home --- 30 15 17 10 3 Hospital 30 --- 17 20 25 23 Mall 15 17 --- 2 25 18 Esplanade 17 20 2 --- 27 20 Pet Shop 10 25 25 27 --- 7 Market 3 23 18 20 7 ---arrow_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_forwardConsider 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.arrow_forward
- Seismic sensing instruments are to be distributed along a volcanic rift zone, a shown in the diagram below. The distances in metres between the sites are shown. Distances between some sites are not shown because of natural hazards that would prevent a natural connection. How can the sites be connected using the minimum amount of wire? In answering this question you must state what algorithm you are using and explain each step. Draw a diagram of the where the wire will go. How much wire will be used? Upload your answer.arrow_forwardA sales Director who lives in a city a is required to fly to a regional‘s office and cities BCD in E. The weather graph shows the one-way airfares between any two cities. Use the brunt force method to find the optimal solution. arrow_forwardUse the critical path algorithm to create a priority list for the digraph below. T1 (2) T4 (12) Т6 (5) End T2 (7) T5 (4) T7 (11) Т3 (9) 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,10arrow_forward
- As you enter the spacecraft, you look to connect your computer. To your dismay, the controls are also password protected. Your computer helpfully translates the prompt and notifies you that a three-digit number is needed. Your computer is able to determine the algorithm for determining each number, along with some password hints. The computer displays the below information: Password Hints: 5 31 (2) f f(x) dx = 8 -4 5 -4 g(x) dx = 16 4 f g(x) dx = 8 -4 5 First Number: (-4 ƒ (x) — 2 g(x)) dx. -4 5 Second Number: S (−4 ƒ (x) – 2 g(x)) dx + f f(x) dx 70-4 ff(x) dz 5 5 Third Number: f2g (x) dx 4 29 (2) dearrow_forward( 1 point) Updike Upholstery cuts and sews fabric for custom ordered chairs, ottomans, and sofas. Often, the more complicated patterns are for the smaller pieces, where cutting is more time consuming than sewing. Thus, cutting and sewing times vary. Today’s list of jobs, shown below, are for an important customer who needs them shipped out (in one shipment) as soon as possible. Which sequence of jobs will complete the customer’s order as quickly as possible? Jobs Cutting Sewing A 4 2 B 6 3 C 1 3 D 2 4 E 3 1 Group of answer choices A-B-C-D-E B-D-A-E-C C-D-B-A-E E-C-D-B-A Flag question: Question 10 Question 101 pts ( 1 point) The makespan of the sequence chosen above is Group of answer choices 15 days 16 days 17 days 33 daysarrow_forwardNow my question Question 4. Is there a polynomial algorithm to find an optimum 2RDF (or W2DF) of an arbitrary (proper) interval graph?arrow_forward
- Activity 7 (1 ) Please provide detailed solution with explanation and justification asap to get a upvote for Each part Pleasearrow_forwardConsider the graph below. How many total tables will there be for the Distance Vector algorithm and what will the size of the table be for Node E? b 5 12 10 d f 5 7 tables and Node E's table is 5x7 4 tables and Node E's table is 7x7 8 tables and Node E's table is 7x7 4 tables and Node E's table is 4x7 16 8arrow_forwardlook at the graphs and fill in the information about the leading co-efficients.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
Graph Theory: Euler Paths and Euler Circuits; Author: Mathispower4u;https://www.youtube.com/watch?v=5M-m62qTR-s;License: Standard YouTube License, CC-BY
WALK,TRIAL,CIRCUIT,PATH,CYCLE IN GRAPH THEORY; Author: DIVVELA SRINIVASA RAO;https://www.youtube.com/watch?v=iYVltZtnAik;License: Standard YouTube License, CC-BY