Mathematical Excursions (MindTap Course List)
4th Edition
ISBN: 9781305965584
Author: Richard N. Aufmann, Joanne Lockwood, Richard D. Nation, Daniel K. Clegg
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Textbook Question
Chapter 5.2, Problem 29ES
Scheduling A research company has a large supercomputer that is used by different teams for a variety of computational tasks. In between each task, the software must be reconfigured. The time required depends on which tasks follow which, because some settings are shared by different tasks. The times (in minutes) required to reconfigure the machine from one task to another are given in the table below. Use the greedy algorithm and the edge-picking algorithm to find time-efficient sequences in which to assign the tasks to the computer. The software configuration must start and end in the home state.
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
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.
A chicken farmer wishes to provide electric power to each chicken house on his farm by installing buried electrical power lines. The graph below illustrates the locations of the houses and the distances between them in feet. Use Kruskal's algorithm to determine how the farmer should dig channels in order to minimize the amount of digging. Also determine the minimum total length of channels that must be dug.
[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.
Chapter 5 Solutions
Mathematical Excursions (MindTap Course List)
Ch. 5.1 - A pen-tracing puzzle is given. See if you can find...Ch. 5.1 - A pen-tracing puzzle is given. See if you can find...Ch. 5.1 - A pen-tracing puzzle is given. See if you can find...Ch. 5.1 - A pen-tracing puzzle is given. See if you can find...Ch. 5.1 - Explain why the following pen-tracing puzzle is...Ch. 5.1 - Transportation An X in the table below indicates a...Ch. 5.1 - Transportation The table below shows the nonstop...Ch. 5.1 - Social Network A group of friends is represented...Ch. 5.1 - Prob. 4ESCh. 5.1 - Determine (a) the number of edges in the graph,...
Ch. 5.1 - Determine (a) the number of edges in the graph,...Ch. 5.1 - Determine (a) the number of edges in the graph,...Ch. 5.1 - Determine (a) the number of edges in the graph,...Ch. 5.1 - Determine whether the two graphs are equivalent.Ch. 5.1 - Determine whether the two graphs are equivalent.Ch. 5.1 - Determine whether the two graphs are equivalent.Ch. 5.1 - Determine whether the two graphs are equivalent.Ch. 5.1 - Explain why the following two graphs cannot be...Ch. 5.1 - Label the vertices of the second graph so that it...Ch. 5.1 - (a) determine whether the graph is Eulerian. If it...Ch. 5.1 - (a) determine whether the graph is Eulerian. If it...Ch. 5.1 - (a) determine whether the graph is Eulerian. If it...Ch. 5.1 - (a) determine whether the graph is Eulerian. If it...Ch. 5.1 - (a) determine whether the graph is Eulerian. If it...Ch. 5.1 - (a) determine whether the graph is Eulerian. If it...Ch. 5.1 - (a) determine whether the graph is Eulerian. If it...Ch. 5.1 - (a) determine whether the graph is Eulerian. If it...Ch. 5.1 - Parks in Exercises 23 and 24, a map of a park is...Ch. 5.1 - Parks in Exercises 23 and 24, a map of a park is...Ch. 5.1 - Transportation For the train routes given in...Ch. 5.1 - Transportation For the direct air flights given in...Ch. 5.1 - Pets The diagram below shows the arrangement of a...Ch. 5.1 - Transportation A subway map is shown below. Is it...Ch. 5.1 - Prob. 29ESCh. 5.1 - Prob. 30ESCh. 5.1 - Degrees of Separation In the graph below, an edge...Ch. 5.1 - Social Network In the graph below, an edge...Ch. 5.1 - Prob. 33ESCh. 5.1 - Travel A map of South America is shown at the...Ch. 5.2 - Continue investigating Hamiltonian circuits in...Ch. 5.2 - Use the greedy algorithm and the weighted graph...Ch. 5.2 - Use the edge-picking algorithm to find a...Ch. 5.2 - Use Dirac's theorem to verify that the graph is...Ch. 5.2 - Use Dirac's theorem to verify that the graph is...Ch. 5.2 - Use Dirac's theorem to verify that the graph is...Ch. 5.2 - Use Dirac's theorem to verify that the graph is...Ch. 5.2 - Transportation For the train routes given in...Ch. 5.2 - Transportation For the direct air flights given in...Ch. 5.2 - Use trial and error to find two Hamiltonian...Ch. 5.2 - Use trial and error to find two Hamiltonian...Ch. 5.2 - Use trial and error to find two Hamiltonian...Ch. 5.2 - Use trial and error to find two Hamiltonian...Ch. 5.2 - Use the greedy algorithm to find a Hamiltonian...Ch. 5.2 - Use the greedy algorithm to find a Hamiltonian...Ch. 5.2 - Use the greedy algorithm to find a Hamiltonian...Ch. 5.2 - Use the greedy algorithm to find a Hamiltonian...Ch. 5.2 - Use the edge-picking algorithm to find a...Ch. 5.2 - Use the edge-picking algorithm to find a...Ch. 5.2 - Use the edge-picking algorithm to find a...Ch. 5.2 - Use the edge-picking algorithm to find a...Ch. 5.2 - Travel A company representative lives in...Ch. 5.2 - Travel A tourist is staying in Toronto, Canada,...Ch. 5.2 - Travel Use the edge-picking algorithm to design a...Ch. 5.2 - Travel Use the edge-picking algorithm to design a...Ch. 5.2 - Travel Nicole wants to tour Asia. She will start...Ch. 5.2 - Travel The prices for traveling between five...Ch. 5.2 - Travel Use the edge-picking algorithm to find a...Ch. 5.2 - Travel Use the edge-picking algorithm to find a...Ch. 5.2 - Route Planning Brian needs to visit the pet store,...Ch. 5.2 - Route Planning A bike messenger needs to deliver...Ch. 5.2 - Scheduling A research company has a large...Ch. 5.2 - Computer Networks A small office wishes to network...Ch. 5.2 - Route Planning A security officer patrolling a...Ch. 5.2 - Route Planning A city engineer needs to inspect...Ch. 5.2 - Draw a connected graph with six vertices that has...Ch. 5.2 - Assign weights to the edges of the following...Ch. 5.3 - The tetrahedron in figure 5.20 consists of four...Ch. 5.3 - The following graph is the projection of one ofthe...Ch. 5.3 - Prob. 3EECh. 5.3 - Give a reason why the graph below Cannot be the...Ch. 5.3 - Prob. 1ESCh. 5.3 - Prob. 2ESCh. 5.3 - Prob. 3ESCh. 5.3 - Prob. 4ESCh. 5.3 - Prob. 5ESCh. 5.3 - Prob. 6ESCh. 5.3 - Prob. 7ESCh. 5.3 - Prob. 8ESCh. 5.3 - Prob. 9ESCh. 5.3 - Prob. 10ESCh. 5.3 - Prob. 11ESCh. 5.3 - Prob. 12ESCh. 5.3 - Show that the following graph contracts to K5.Ch. 5.3 - Show that the following graph contracts to the...Ch. 5.3 - Prob. 15ESCh. 5.3 - Prob. 16ESCh. 5.3 - Prob. 17ESCh. 5.3 - Count the number of vertices, edges, and faces,...Ch. 5.3 - Count the number of vertices, edges, and faces,...Ch. 5.3 - Count the number of vertices, edges, and faces,...Ch. 5.3 - Count the number of vertices, edges, and faces,...Ch. 5.3 - Count the number of vertices, edges, and faces,...Ch. 5.3 - Prob. 23ESCh. 5.3 - Prob. 24ESCh. 5.3 - Prob. 25ESCh. 5.3 - Prob. 26ESCh. 5.3 - Prob. 27ESCh. 5.3 - Prob. 28ESCh. 5.3 - Prob. 29ESCh. 5.3 - Prob. 30ESCh. 5.4 - A one-way road ends at a two-way street. The...Ch. 5.4 - A one-way road intersects a two-way road in a...Ch. 5.4 - A two-way road intersects another two-way road in...Ch. 5.4 - Prob. 1ESCh. 5.4 - Prob. 2ESCh. 5.4 - Prob. 3ESCh. 5.4 - Prob. 4ESCh. 5.4 - Prob. 5ESCh. 5.4 - Prob. 6ESCh. 5.4 - Prob. 7ESCh. 5.4 - Prob. 8ESCh. 5.4 - Prob. 9ESCh. 5.4 - Prob. 10ESCh. 5.4 - Prob. 11ESCh. 5.4 - Prob. 12ESCh. 5.4 - Prob. 13ESCh. 5.4 - Prob. 14ESCh. 5.4 - Prob. 15ESCh. 5.4 - Prob. 16ESCh. 5.4 - Prob. 17ESCh. 5.4 - Prob. 18ESCh. 5.4 - Prob. 19ESCh. 5.4 - Prob. 20ESCh. 5.4 - Prob. 21ESCh. 5.4 - Prob. 22ESCh. 5.4 - Scheduling Six different groups of children would...Ch. 5.4 - Scheduling Five different charity organizations...Ch. 5.4 - Scheduling Students in a film class have...Ch. 5.4 - Animal Housing A researcher has discovered six new...Ch. 5.4 - Prob. 27ESCh. 5.4 - Prob. 28ESCh. 5.4 - Prob. 29ESCh. 5.4 - Prob. 30ESCh. 5.4 - Scheduling Edge colorings, as explained in...Ch. 5 - (a) determine the number of edges in the graph,...Ch. 5 - (a) determine the number of edges in the graph,...Ch. 5 - Soccer In the table below, an X indicates teams...Ch. 5 - Each vertex in the graph at the left represents a...Ch. 5 - Determine whether the two graphs are equivalent.Ch. 5 - Determine whether the two graphs are equivalent.Ch. 5 - Find an Euler path if possible, and (b) find an...Ch. 5 - Find an Euler path if possible, and (b) find an...Ch. 5 - Find an Euler path if possible, and (b) find an...Ch. 5 - Prob. 10RECh. 5 - Prob. 11RECh. 5 - Architecture The floor plan of a sculpture gallery...Ch. 5 - Use Dirac's theorem to verify that the graph is...Ch. 5 - Use Dirac's theorem to verify that the graph is...Ch. 5 - Prob. 15RECh. 5 - Prob. 16RECh. 5 - Use the greedy algorithm to find a Hamiltonian...Ch. 5 - Use the greedy algorithm to find a Hamiltonian...Ch. 5 - Use the edge-picking algorithm to find a...Ch. 5 - Use the edge-picking algorithm to find a...Ch. 5 - Efficient Route The distances, in miles, between...Ch. 5 - Computer Networking A small office needs to...Ch. 5 - Prob. 23RECh. 5 - Prob. 24RECh. 5 - Prob. 25RECh. 5 - Prob. 26RECh. 5 - Count the number of vertices, edges, and faces in...Ch. 5 - Count the number of vertices, edges, and faces in...Ch. 5 - Prob. 29RECh. 5 - Prob. 30RECh. 5 - Prob. 31RECh. 5 - Prob. 32RECh. 5 - Prob. 33RECh. 5 - Prob. 34RECh. 5 - Scheduling A company has scheduled a retreat at a...Ch. 5 - Social Network Each vertex in the graph at the...Ch. 5 - Determine whether the following two graphs are...Ch. 5 - Answer the following questions for the graph shown...Ch. 5 - Recreation The illustration below depicts bridges...Ch. 5 - a. What does Dirac's theorem state? Explain how it...Ch. 5 - Low-Cost Route The table below shows the cost of...Ch. 5 - Use the greedy algorithm to find a Hamiltonian...Ch. 5 - Prob. 8TCh. 5 - Answer the following questions for the graph shown...Ch. 5 - Prob. 10TCh. 5 - Prob. 11TCh. 5 - A group of eight friends is planning a vacation in...
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_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_forwardFor the following set of points, describe how the closest-pair algorithm finds a closest pair ofpoints: (1, 2), (2,−1), (3,−3), (3, 2), (−3, 4), (−1, 2), (2, 3), (1, 1), (−5,−2)arrow_forward
- Given a graph G = (V,E) find the minimum number of edges that will cover every vertex (Edge Cover). Detail and analyze an approximate algorithm to this problem.arrow_forwardRome Prablems 12 & 13: (R) The graph below shows 820 1070 Eurail train times in minutes 1215 Paris (P) between cities. Berlin (B) 400 650 1380 150 1530 12. Apply the Repetitive Nearest Neighbor algorithm. Answer by listing the vertices in the order you use them and the total weight of each circuit. You can write your answers in the chart below. 850 910 (M) Madrid (L) London Starting City Hamilton Circuit Total Weight Rome Paris London Madrid Berlin 13. Re-write the shortest circuit from #12 so that you depart from and return to Rome.arrow_forwardCoordinates 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=20arrow_forward
- Route Planning Brian needs to visit the pet store, the shopping mall, the local farmersmarket, and the pharmacy. His estimated driving times (in minutes) between thelocations are given in the table below. Use the greedy algorithm and the edge-pickingalgorithm to find two possible routes, starting and ending at home, that will helpBrian minimize his total travel timearrow_forward10. 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 _____________arrow_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_forward
- For the following graph: (A) Find the adjacency matrix representation of the graph. (B) Find the sequence of vertices in the graph, if the graph is traversed using Breadth-FirstTraversal algorithm. Assume vertex 0 as the starting vertex.arrow_forwardSolve the following linear program using the simplex algorithm. You should give the initial tableau and each further tableau produced during the execution of the algorithm. If the program has an optimal solution, give this solution and state its objective value. If it does not have an optimal solution, say why. You should indicate the highlighted row and columns in each pivot step as well as the row operations you carry out. This is in order to gain credit even if the final answer is incorrect. maximize 21+ 3x2+5x3 + 4 subject to 1+2+2x3+4 ≤2, 3x2+3x3 + 3x ≤6, 31 +22+2x3 + x ≤7, T1, T2, T3, T4≥ 0arrow_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
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage LearningAlgebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage
Linear Algebra: A Modern Introduction
Algebra
ISBN:9781285463247
Author:David Poole
Publisher:Cengage Learning
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