Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 3, Problem 40CRP
a.
Program Plan Intro
Starvation
The starvation is a phenomenon in which a process has to wait for its execution due to low priority.
b.
Program Plan Intro
Starvation
The starvation is a phenomenon in which a process has to wait for its execution due to low priority.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Exercise 2:
Draw a State machine Diagram for a Telephone line (a process in a smartphone OS) with the following behavior:
When the telephone app is not active, the telephone line is idle. When the app is activated, the line gives a dial tone and can accept the dialing of digits.
If after getting the dial tone, the user doesn't dial a number within a time interval of 10 seconds, then a time-out occurs, and the line gets idle again. A button on the app can re- activate the line.
After dialing a number, if the number is invalid then a recorded message is played at the end of which the line becomes idle.
Upon entry of a valid number, the phone app tries to connect a call & routes it to the proper destination.
If the called person answers the phone, the conversation can occur, and the line is in an on- call state. When the called person hangs up, the phone app disconnects and the line goes to the idle state.
In a timesharing OS we have the following cpu timeline for two tasks X and Y. The timeslice is 1s.Both tasks are available in the system at the same time t=9:00:00.000 and order of arrival is the obviousX followed by Y. (The decimals reflect milliseconds if they showup in an indicated time reference.) There are no other processes (tasks) in the system other than X,Y.
1234567890 XYXYX--YXY
The time line 1 indicates that at t=9:00:00s task X starts its execution and when t=9:00:01s is reached task Y takes over. The time line 1 indicates the 'first second' and time line 0 indicates the 'tenth second' above.Task Y completes its execution at t=9:00:10s, the completion of the tenth second since X started its execution. Task X has completed its execution earlier.
(a) What is the total number of context switches starting from prior to t=9:00:00s (e.g. t=8:59:59.999) through thecompletion of $Y$? answer is 16s
(b) What is the turnaround time for Y? answer is 10s
(c) What is…
Assume a primitive time-sharing operating system is running on a computer with 50,000 32-bit words of main memory, with the resident monitor consuming 10,000 of that. When control is to be assigned to an interactive user, the user’s program and data were loaded into the remaining 40,000 words of main memory. A program is always loaded to start at the location of the 10,000th word; this simplified both the monitor and memory management.
Assume that there are four interactive users with the following memory requirements, in words: Job1: 10,000, Job2: 30,000, Job3: 1000, Job4: 5,000
Draw the main memory state diagram considering the following:
(a) The monitor loads Job1 and transfers control to it.
(b) The monitor decides to load Job2 and transfer control to it.
(c) Next, the monitor decides to load Job3 and transfer control to it.
(d) Next, the monitor decides to load Job1 and transfer control to it.
(e) Next, the monitor decides to load Job4 and transfer control…
Chapter 3 Solutions
Computer Science: An Overview (12th Edition)
Ch. 3.1 - Identify examples of queues. In each case,...Ch. 3.1 - Which of the following activities require...Ch. 3.1 - Prob. 3QECh. 3.1 - Prob. 4QECh. 3.2 - Prob. 1QECh. 3.2 - What is the difference between application...Ch. 3.2 - Prob. 3QECh. 3.2 - Prob. 4QECh. 3.3 - Summarize the difference between a program and a...Ch. 3.3 - Summarize the steps performed by the CPU when an...
Ch. 3.3 - Prob. 3QECh. 3.3 - If each time slice in a multiprogramming system is...Ch. 3.3 - Prob. 5QECh. 3.4 - Prob. 1QECh. 3.4 - Suppose a two-lane road converges to one lane to...Ch. 3.4 - Prob. 3QECh. 3.4 - Prob. 4QECh. 3.5 - Prob. 1QECh. 3.5 - Prob. 2QECh. 3.5 - If a process in a multiprogramming system could...Ch. 3 - List four activities of a typical operating...Ch. 3 - Summarize the distinction between batch processing...Ch. 3 - Prob. 3CRPCh. 3 - Prob. 4CRPCh. 3 - What is a multitasking operating system?Ch. 3 - Prob. 6CRPCh. 3 - On the basis of a computer system with which you...Ch. 3 - a. What is the role of the user interface of an...Ch. 3 - What directory structure is described by the path...Ch. 3 - Define the term process as it is used in the...Ch. 3 - Prob. 11CRPCh. 3 - What is the difference between a process that is...Ch. 3 - What is the difference between virtual memory and...Ch. 3 - Suppose a computer contained 512MB (MiB) of main...Ch. 3 - What complications could arise in a...Ch. 3 - What is the distinction between application...Ch. 3 - Prob. 17CRPCh. 3 - Summarize the booting process.Ch. 3 - Why is the booting process necessary?Ch. 3 - If you have a PC, record the sequence activities...Ch. 3 - Suppose a multiprogramming operating system...Ch. 3 - Prob. 22CRPCh. 3 - Prob. 23CRPCh. 3 - Prob. 24CRPCh. 3 - Prob. 25CRPCh. 3 - Would greater throughput be achieved by a system...Ch. 3 - Prob. 27CRPCh. 3 - What information is contained in the state of a...Ch. 3 - Identify a situation in a multiprogramming system...Ch. 3 - List in chronological order the major events that...Ch. 3 - Prob. 31CRPCh. 3 - Prob. 32CRPCh. 3 - Explain an important use for the test-and-set...Ch. 3 - Prob. 34CRPCh. 3 - Prob. 35CRPCh. 3 - Prob. 36CRPCh. 3 - Prob. 37CRPCh. 3 - Each of two robot arms is programmed to lift...Ch. 3 - Prob. 39CRPCh. 3 - Prob. 40CRPCh. 3 - Prob. 41CRPCh. 3 - Prob. 42CRPCh. 3 - Prob. 43CRPCh. 3 - Prob. 44CRPCh. 3 - Prob. 45CRPCh. 3 - Prob. 46CRPCh. 3 - Prob. 47CRPCh. 3 - Prob. 48CRPCh. 3 - Prob. 49CRPCh. 3 - Prob. 50CRPCh. 3 - Prob. 51CRPCh. 3 - Prob. 52CRPCh. 3 - How is the window manager related to the operating...Ch. 3 - Prob. 54CRPCh. 3 - Prob. 55CRPCh. 3 - Suppose you are using a multiuser operating system...Ch. 3 - Prob. 2SICh. 3 - Prob. 3SICh. 3 - Prob. 4SICh. 3 - Prob. 5SI
Knowledge Booster
Similar questions
- Assume a primitive time-sharing operating system is running on a computer with 50,000 32-bit words of main memory, with the resident monitor consuming 10,000 of that. When control is to be assigned to an interactive user, the user’s program and data were loaded into the remaining 40,000 words of main memory. A program is always loaded to start at the location of the 10,000th word; this simplified both the monitor and memory management. Assume that there are four interactive users with the following memory requirements, in words: Job1: 10,000, Job2: 30,000, Job3: 1000, Job4: 5,000 Draw the main memory state diagram considering the following: (a) The monitor loads Job1 and transfers control to it. (b) The monitor decides to load Job2 and transfer control to it. (c) Next, the monitor decides to load Job3 and transfer control to it. (d) Next, the monitor decides to load Job1 and transfer control to it. (e) Next, the monitor decides to load Job4 and transfer control to it.…arrow_forwardAssume a primitive time-sharing operating system is running on a computer with 50,000 32-bit words of main memory, with the resident monitor consuming 10,000 of that. When control is to be assigned to an interactive user, the user’s program and data were loaded into the remaining 40,000 words of main memory. A program is always loaded to start at the location of the 10,000th word; this simplified both the monitor and memory management. Assume that there are four interactive users with the following memory requirements, in words: Job1: 10,000, Job2: 30,000, Job3: 1000, Job4: 5,000 Draw the main memory state diagram considering the following: (a) The monitor loads Job1 and transfers control to it. (b) The monitor decides to load Job2 and transfer control to it. (c) Next, the monitor decides to load Job3 and transfer control to it. (d) Next, the monitor decides to load Job1 and transfer control to it. (e) Next, the monitor decides to load Job4 and transfer control to it.…arrow_forwardA system is made up of three processes that share five resources of the same kind that are all used in the same manner. Each process may be completed with a maximum of two resources. Are there any deadlocks in the system that can be demonstrated?arrow_forward
- Computer Science A multiprogrammed system with a single CPU has a very large number of CPU boundprocesses running on it that all have the same priority. Could you think of a CPU schedulingalgorithm that would combine the lowest possible response times with the highest possiblethroughput and no starvationarrow_forwardA common variable x, introduced to nothing, is worked on by four simultaneous cycles W, X, Y, Z as follows. Every one of the cycles W and X peruses x from memory, increases by one, stores it to memory, and afterward ends. Every one of the cycles Y and Z peruses x from memory, decrements by two, stores it to memory, and afterward ends. Each cycle prior to perusing x summons the P activity (i.e., look out) on an including semaphore S and conjures the V activity (i.e., signal) on the semaphore S in the wake of putting away x to memory. Semaphore S is introduced to two. What is the most extreme conceivable worth of x after all cycles total execution?arrow_forwardPlease Implement in C programming Language Given the list of processes, their CPU burst times, arrival times, and priorities implement the Round Robin scheduling algorithm on the processes with preemption. Compute and print the completion Time(CT), Turnaround Time(TAT), and Waiting Time(WT) for each process using C Programming. Waiting time: Processes need to wait in the process queue before execution starts and in execution while they get preempted. Turnaround time: Time elapsed by each process to get completely served. (Difference between submission time and completion time).arrow_forward
- : Consider a system that has two processes A and B, each wants to record a scanned document on CD. Process A requests permission to use the scanner and is granted permission. Process B is programmed differently and requests the CD recorder first & is also granted permission. Now A asked for the CD recorder but the request is denied until B releases it. Unfortunately, instead of releasing the CD recorder B asks for the scanner. Answer the following question for given above scenario; Draw the Resource Allocation Graph (RAG) & also determine that there is a deadlock that exists or not. Verify the four sufficient & necessary conditions with reasons. Which one is satisfied or not?arrow_forwardPlease Implement in C programming Language Given the list of processes, their CPU burst times, arrival times, and priorities implement the SJF scheduling algorithm on the processes with preemption. Compute and print the completion Time(CT), Turnaround Time(TAT), and Waiting Time(WT) for each process using C Programming. Waiting time: Processes need to wait in the process queue before execution starts and in execution while they get preempted. Turnaround time: Time elapsed by each process to get completely served. (Difference between submission time and completion time). Task 1: SJF Scheduling with preemption You can use the following input as a sample:arrow_forwardPlease Implement in C programming Language Given the list of processes, their CPU burst times, arrival times, and priorities implement the Priority scheduling algorithm on the processes with preemption. Compute and print the completion Time(CT), Turnaround Time(TAT), and Waiting Time(WT) for each process using C Programming. Waiting time: Processes need to wait in the process queue before execution starts and in execution while they get preempted. Turnaround time: Time elapsed by each process to get completely served. (Difference between submission time and completion time).arrow_forward
- A process loop, or machine cycle, consists of the following four subcomponents. In what ways do machine cycles matter the most? Is it necessary to replace worn or broken machine components throughout a cycle? How about creating another module to solve the issue of swapping?arrow_forwardRead this Paragraph and answer the Given question: A A&A that runs a chain of hospitals in Karachi has decided to start a new computer program to manage patients, admit-in, and discharge of patients. Currently, A&A has software that can carry out these tasks for an individual hospital. This is problematic since, for example, if one hospital is full and receives a new patient request, the A&A tries to locate a suitable bed in another of its hospital; it is then necessary for hospital management to ring around the other hospitals. Similar problems arise if a patient wants to transfer to another hospital that has better facilities. A&A requires a new web application that should resolve the existing system problem by implementing a single, common patient admission and discharge system across the whole chain. Additionally, the A&A wishes to gain a competitive edge with a frequent-guest program to encourage repeat patient who readmits will be given discounts and other…arrow_forwardAssume that a memory module contains three holes of 10MB each. A sequence of 14 requests for 1MB each will be processed (See the diagram below). For each of the memory allocation methods listed below, draw a diagram representing how memory is allocated and determine the sizes of the remaining holes after all 14 requests have been satisfied. First fit Next fit C. Best fit d. a. b. Worst fit Hint - For the Next fit, the following allocation starts with the hole following the previous allocation 10 Mb 10 Mb 10 Mbarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education