Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
A large apple farm distributes their apples in boxes that they can source from any one of a number of nearby
box manufacturers. Each box manufacturer makes only one box type that holds a specific number of apples
- so a box from one manufacturer might hold 24 apples, while a box from another might hold 13. The apple
farm can only choose one box supplier each year (a decision they make each year based on price), but they
can then order an unlimited number of boxes of that type.
The farm likes to be prepared, and creates large batches of apples to pack before the decision about which
box type to use has been made. The farm also likes to limit waste, and tries to set the number of apples
in these large batches such that they can fill an integer number of boxes perfectly with no apples left over.
In creating these batches, although the farm doesn't yet know the exact capacity of the boxes they will
buy, they know a list of possible values the box capacity will take. For example, if the…
An operating system uses the banker’s algorithm for deadlock avoidance when managing the allocation of three resource types X, Y and Z to three processes P0, P1 and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution
Allocation
Max
X
Y
Z
X
Y
Z
P0
0
0
1
8
4
3
P1
3
2
0
6
2
0
P2
2
1
1
3
3
3
There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is currently in safe state. Consider the following independent requests for additional resources in the current state-
REQ1: P0 requests 0 units of X, 0 units of Y and 2 units of Z
REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z
Write a program to check whether:
Only REQ1 can be permitted
Only REQ2 can be permitted…
Real Time Scheduling: Select all statements below that are true
EDF scheduling assigns the highest priority to a process with the
smallest remaining time until its deadline.
RM scheduling assigns a higher priority to processes with shorter
periods.
Rate Monotonic (RM) scheduling works by dividing the total amount
of time available into an equal number of shares, and then each
process must request a certain share of the total when it tries to
start.
If a process has period p, it is activated every p units of time.
A real-time system is schedulable under Earliest Deadline First (EDF)
when its overall CPU utilization is less than or equal to 1.
A real-time system is schedulable under RM when its overall CPU
utilization is less than 1.
Chapter 7 Solutions
Operations Research : Applications and Algorithms
Knowledge Booster
Similar questions
- An operating system uses the banker's algorithm for deadlock avoidance when managing the allocation of three resource types X, Y and Z to three processes P0, P1 and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution Allocation Маx Y Y PO 8 4 3 P1 3 2 6 2 P2 2 1 3 3 3 There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is currently in safe state. Consider the following independent requests for additional resources in the current state- REQ1: P0 requests 0 units of X, 0 units of Y and 2 units of Z REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z Write a program to check whether: A. Only REQ1 can be permitted B. Only REQ2 can be permitted C. Both REQ1 and REQ2 can be permitted D. Neither REQ1 nor REQ2 can…arrow_forwardAn operating system uses the banker's algorithm for deadlock avoidance when managing the allocation of three resource types X, Y and Z to three processes P0, P1 and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution Allocation Маx X Y X Y PO 1 8 3 P1 3 2 6 2 P2 1 3 3 3 There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is currently in safe state. Consider the following independent requests for additional resources in the current state- REQ1: PO requests 0 units of X, 0 units of Y and 2 units of Z REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z Write a program to check whether: Only REQ1 can be permitted Only REQ2 can be permitted Both REQ1 and REQ2 can be permitted Neither REQ1 nor REQ2 can be…arrow_forwardAn operating system uses the banker's algorithm for deadlock avoidance when managing the allocation of three resource types X, Y and Z to three processes P0O, P1 and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution Allocation Max Y X Y PO 8 4 3 P1 3 6 P2 2 1 1 3 3 3 There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is currently in safe state. Consider the following independent requests for additional resources in the current state- REQ1: PO requests 0 units of X, 0 units of Y and 2 units of Z REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z Write a program to check whether: A. Only REQ1 can be permitted B. Only REQ2 can be permitted C. Both REQ1 and REQ2 can be permitted D. Neither REQ1 nor REQ2…arrow_forward
- Algorithm Design & Analysis From the following list of bus rapid transit system(one way): The problem: Name Route Vacation A->B->C->D Work 1 E->B->F->G->H Work 2 B->N->E Work 3 H->D->N Task: Design an algorithm to read the bus rapid transit system routes list and print the number of tickets we need to purchase if we want to visit all places minimal twice. The complexity of the algorithm must be O(V+E). V is the number of places. E-> is the number of transits. PS: Use Tarjan’s or Kosaraju’s strongly connected component algorithm.arrow_forwardFile Edit View Sign Window Help Home Tools eh U & O PS1 → X Module 1 Linear Pr... 2 / 2 H 0 Q 87% 3. Scheduling at the Bank of Tacoma The Bank of Tacoma is open Monday through Friday from 9am to 5pm. From past experience, the bank knows that it needs the number of tellers shown in the table below at various times of the day. Bank of Tacoma hires two types of tellers. Full-time tellers work 9am to 5pm, 5 days a week, with 1 hour off each day for lunch. The bank determines when a full-time employee takes his or her lunch hour, but each teller must go between 11am and noon, noon and 1pm, or between 1pm and 2pm. Full-time employees are paid $24 per hour, including a paid lunch hour. The bank can also hire part-time tellers. Each part-time teller works exactly three consecutive hours each day, starting at any specified hour (e.g., 10am-1pm), the same time every day of the week. A part-time teller is paid $16 per hour. To maintain adequate quality of service, the bank has decided that at all…arrow_forwardConsider a computer system with three users: Alice, Bob, and Cindy. Alice owns file X, and Bob and Cindy can read it. Bob owns file Y, and Cindy can read and write the file Y, but Alice can only read it. Cindy owns file Z, but neither Alice nor Bob can read or write it. If a user owns a file, he/she can also execute the file. Create the ACM (access control matrix) of the system Show the ACL and CL of the ACM Now Cindy allows Alice to read Z, Alice removes Bob's ability to read X, and Bob removes all the rights of Alice and Cindy to Y. Show the ACM after these changes.arrow_forward
- In part, the music business is threatened by file-sharing software because artists will not be properly paid for the recordings they make. The government may determine that file-sharing software is lawful nonetheless.For example, artists will receive relatively little money for their recordings, but continue to make money for live performances. What will happen to the music industry's revenue in the next several years? Does your response have any relation to phenomena's celebrity status in any way?As a result of legalizing file-sharing software, the music-listening public will gain from reduced pricing, but in what way(s) might the legislation harm the music-listening public?arrow_forwardAn order for a computer system can specify memory of 4, 8, or 12 gigabytes and disk storage of200, 300, or 400 gigabytes. Draw the diagrams that describe the set of possible orders.arrow_forwardMatch the tasks specified with the types of conditional jump that would be invoked: Jump to label L2 if the [ Choose ] doubleword in memory pointed to by EDI is even Jump to label L1 if the memory [ Choose ] word pointed to by ESI equals Zero Jump to a label if unsigned EAX [ Choose ] is greater than EBX Jump to a label if signed EAX is [ Choose ] greater than EBX [Choose] Jumps Based on Signed Comparisons Jumps Based on Specific Flag Values Jumps Based on Equality Jumps Based on Unsigned Comparisons へ > >arrow_forward
- A university has only full-time and part-time instructors. The details of an instructor include name, address, email, and number. The students in the university can enroll in a seminar and the details to be stored for each student include name, student number, and email. Each seminar consists of seminar name and seminar code. Full-time instructors are responsible for taking the seminars. Each seminar can be taken by at least one and at most two instructors. Part-time instructors can teach courses as well as full-time instructors. Each course consists of a name and course code. Students can register for a maximum of five courses per semester. A course can either be a university elective or an area elective. The availability of an area elective course depends on the number of available students for that course. A student can either be a bachelor, master's, or doctorate student. Doctorate students can also be research assistants. Task: Draw a class diagram that consists of all the classes…arrow_forwardNote: c language Code plzz An operating system uses the banker’s algorithm for deadlock avoidance when managing the allocation of three resource types X, Y and Z to three processes P0, P1 and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is currently in safe state. Consider the following independent requests for additional resources in the current state- REQ1: P0 requests 0 units of X, 0 units of Y and 2 units of Z REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z Write a program to check whether: Only REQ1 can be permitted Only REQ2 can be permitted Both REQ1 and REQ2 can be permitted Neither REQ1 nor REQ2 can be permittedarrow_forwardThere are six processes in three priority classes. Class 1 has the highest priority. (The amount of CPU time needed by each process is written in brackets.) • Class 1: II₁ (13 ms), II3 (8 ms), II6 (6 ms) • Class 2: II₂ (10 ms), II5 (4 ms) Class 3: II4 (12 ms) The system is using the following algorithm: The scheduler picks a process from the highest (non-empty) class. To schedule processes within the same class, the Round-Robin algorithm is used with quantum 5 ms. Process switch takes 1 ms. (a) Draw the schedule for the above processes on a timeline. (b) Mirko decided to modify the above algorithm: After each burst (i.e. when the quantum experies) the process is degraded by one class (unless it is already in Class 3). Draw the schedule for Mirko's modified algorithm.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole