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 30E
Exercises 29 through 32 refer to a project consisting of 11 tasks (A through K) with the following processing times (in hours):
a. A schedule with
b. Explain why a schedule with
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
the 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.
Anela is a computer scientist who is formulating a large and complicated program for a type of data processing. She has three ways of storing and retrieving data: cloud storage, disk, or hard drive. As an experiment, she sets up her program in three different ways: one using cloud storage, one using disks, and the other using a hard drive. Then she makes four test runs of this type of data processing on each program. The time required to execute each program is shown in the following table (in minutes). Use a 0.01 level of significance to test the hypothesis that the mean processing time is the same for each method.
Hard Drive
Cloud
Disks
8.8
7.5
7.1
8.8
9.2
6.6
8.0
7.2
10.2
7.6
7.9
8.0
(i) Give the value of the level of significance.
(ii) Find the sample test statistic. (Round your F Ratio to two decimal places. Round all other answers to four decimal places.)
(vi) In the case of one-way ANOVA, make a summary table. (Round your answers to three decimal places.)…
Anela is a computer scientist who is formulating a large and complicated program for a type of data processing. She has three ways of storing and retrieving data: cloud storage, disk, or hard drive. As an experiment, she sets up her program in three different ways: one using cloud storage, one using disks, and the other using a hard drive. Then she makes four test runs of this type of data processing on each program. The time required to execute each program is shown in the following table (in minutes). Use a 0.01 level of significance to test the hypothesis that the mean processing time is the same for each method.
Hard Drive
Cloud
Disks
8.4
6.8
7.2
9.3
9.6
6.8
8.1
7.0
9.6
8.3
7.9
8.6
(ii) Find the sample test statistic. (Round your F Ratio to two decimal places. Round all other answers to four decimal places.)
(vi) In the case of one-way ANOVA, make a summary table. (Round your answers to three decimal places.)
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
- Suppose the coal and steel industries form a closed economy. Every $1 produced by the coal industry requires $0.30 of coal and $0.70 of steel. Every $1 produced by steel requires $0.80 of coal and $0.20 of steel. Find the annual production (output) of coal and steel if the total annual production is $20 million.arrow_forwardAnela is a computer scientist who is formulating a large and complicated program for a type of data processing. Anela has three ways of storing and retrieving data: cloud storage, disk, or hard drive. As an experiment, Anela sets up her program in three different ways: one using cloud storage, one using disks, and the other using a hard drive. Then Anela makes four test runs of this type of data processing on each program. The time required to execute each program is shown in the following table (in minutes). Use a 0.01 level of significance to test the hypothesis that the mean processing time is the same for each method. Hard Drive Cloud Disks 8.7 7.2 7.0 9.3 9.1 6.4 7.9 7.5 9.8 8.0 7.7 8.2arrow_forwardA compony produces two different grades of steel, A and B, at two different factories, 1 and 2. The following table summarizes the production capabilities of the factories, the cost per day, and the number of units of each grade of steel that is required to fill orders. Factory 1 Factory 2 Required Grade A steel 1 unit 2 units 80 units Grade B steel 3 units 2 units 140 units Cost per day 5000 6000 How many days should each factory operate in order to fill the orders at minimum cost? What is the minimum cost?arrow_forward
- A furniture factory makes wooden tables, chairs, and armoires. Each piece of furniture requires three operations: cutting the wood, assembling, and finishing. Each operation requires the number of hours (h) given in Table 3 below. The workers in the factory can provide 300 hours of cutting, 400 hours of assembling, and 590 hours of finishing each work week. How many tables, chairs, and armoires shold be produced so that all available labor-hours are used? Or is this impossible? Table Chair Armoire 1 Cutting (h) Assembling (h) Finishing (h) 1 1 1 2 Table 3: Manufacturing Furniturearrow_forwardAn Jibble is produced on an assembly line consisting of six workstations. The total work content for one Jibble is 22 minutes based on the following standard times set forth for each station: 1 (4.0 minutes), 2 (6.5 minutes), 3 (4.0 minutes), 4 (2.5 minutes), 5 (2.0 minutes), 6 (3.0 minutes). If this assembly line runs 5 days per week, 8 hours per day and each station operator operates at 120% of standard, how many Jibbles can be produced in a week? a. Greater than or equal to 600 units. b. Greater than or equal to 500 units but less than 600 units. c. Less than 400 units. d. Greater than or equal to 400 units but less than 500 units.arrow_forwardEvery day, secret, over-worked employees at Wayne Enterprises work two 6-hour shifts producing Batmobiles. These shifts are selected from 12 am - 6 am, 6 am - 12 pm, 12 pm - 6 pm, and 6 pm - 12 am. The following table depicts the number of employees needed during each shift: Shift Time Period 1 2 3 4 12 am - 6 am 6 am - 12 pm 12 pm - 6 pm 6 pm - 12 am Number of Employees Required 13 21 17 11 Bruce Wayne pays all employees working two consecutive shifts, $12 per hour (Note: employees scheduled to work 12 am - 6 am and 6 pm - 12 am would be considered consecutive). Employees whose shifts are not consecutive are paid $18 per hour for the inconvenience. Formulate an LP that can be used to minimize the cost of meeting the daily workforce demands for Batmobile production. To formulate the model, use the following decision variables: Xij = workers working shifts i and j where i, j = {1, 2, 3, 4}arrow_forward
- The Lawson Fabric Mill Produces five different fabrics. Each fabric can be woven on one or more of the mill’s 36 looms. The sales department’s forecast of demand for the next month is shown in below Table 1, along with data on the selling price per yard, variable cost per yard, and purchase price per yard. The mill operates 24 hours a day and is scheduled for 30 days during the coming month. The mill has two types of looms: draw and regular. The draw looms are more versatile and can be used for all five fabrics. The regular looms can produce only three of the fabrics. The mill has a total of 36 looms: 8 are draw and 28 are regular. The rate of production for each fabric on each type of loom is given in below Table 2. The time required to change over from producing one fabric to another is negligible and does not have to be considered. The Lawson Fabric Mill satisfies all demand with either its own fabric or fabric purchased from another mill. Fabrics that cannot be woven at the…arrow_forwardA company manufactures a product at its plants in A, B, and C, then ships the product to six customers in G, H, J, K, and L, The monthly capacity of plants A, B, and Care 7400, 7300, and 10000 units, respectively. The monthly demand from customers G, H, J, K, and Lare 3000, 500, 4600, 7500, and 8900 units, respectively. Use Excel Solver to find the optimal distribution plant that will give the lowest total monthly shipping cost if the shipping cost per unit (in dollars per unit) are as follows: - from A to G, H, J, K, and L are 4, 9, 20, 6, and 13 dollars per unit, respectively; from B to G, H, J, K, and L are 12, 7, 3, 10, and 6 dollars per unit, respectively; from C to G, H, J, K, and L are 7, 6, 12, 2, and 9 dollars per unit, respectively. - The optimal total shipping costs is dollars per month.arrow_forwardthat the amounts of time (in minutes) required for assembling the frames, installing the wheels, and decorating for the Starstreak and Superstreak models are as given in the following table: Frame Wheels Decoration Starstreak 25 6. 16 Superstreak 14 9 12 Assume also that each day the company has available 135 hours of labor for assembling frames, 95 hours of labor for installing wheels, and 110 hours of labor for decoration. Assume also that the profit on each Starstreak bike is $22.00 and the profit on each Superstreak bike is $26.00. How many bikes of each type should the company make in order maximize its profit?arrow_forward
- Using the priority list T3, T6, T3, T1, T5, T2, T9, T10, T7, T4, schedule the project below with two 8 processors. T1 (6) T5 (9) Т9 (4) T2 (8) Т6 (5) T8 (10) T10 (3) End Т3 (11) T7 (2) T4 (12) Task 6 is done by Select an answer v starting at time Task 8 is done by Select an answer v starting at timearrow_forwardA service has five tasks, performed in sequence. In the instance when there is more than one worker assigned to a task, each worker performs the entire task and they both can be working on different “items” at the same time. Task Task time per worker Number of workers 1 2 minutes 1 2 6 minutes 1 3 14 minutes 2 4 4 minutes 1 5 15 minutes 3 What is the capacity (hourly) of the process as a whole? Capacity= Time available/ Task Timearrow_forwardThe manager of a Burger Doodle franchise wants to determine how many sausage biscuits and ham biscuits to prepare each morning for breakfast customers. The two types of biscuits require the following resources: Biscuit Labor (hr.) Sausage (Ib.) Ham (Ib.) Flour (Ib.) Sausage 0.010 0.10 0.04 Ham 0.024 0.15 0.04 The franchise has 6 hours of labor available each morning. The manager has a contract with a local grocer for 30 pounds of sausage and 30 pounds of ham each morning. The manager also purchases 16 pounds of flour. The profit for a sausage biscuit is $0.60; the profit for a ham biscuit is $0.50. The manager wants to know the number of each type of biscuit to prepare each morning to maximize profit.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage Learning
Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage
Algebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal Littell
Mathematics For Machine TechnologyAdvanced MathISBN:9781337798310Author:Peterson, John.Publisher:Cengage Learning,
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
Algebra: Structure And Method, Book 1
Algebra
ISBN:9780395977224
Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:McDougal Littell
Mathematics For Machine Technology
Advanced Math
ISBN:9781337798310
Author:Peterson, John.
Publisher:Cengage Learning,
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