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 37CRP
Program Plan Intro
Deadlock:
It is a condition in which two or more processes are blocked from progressing because each is waiting for a resource that is allocated to another.
Deadlock cannot occur unless all three of the following conditions are satisfied:
- There is competition for non-sharable resources.
- The resources are requested on a partial basis; that is, having received some resources, a process will return later to request more.
- Once a resource has been allocated, it cannot be forcibly retrieved.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these 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.…
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.…
Scenario
A newly opened university would like to develop a student registration system (SRS) that can bedeployed on any operating system.The new system will allow students to register for courses and view their semester results fromany type of computer device. Lecturers will be able to access the system to sign in to access thecourses that have been assigned to them as well as to record grades. The system should allow allcourses offered by the university to be maintained up-to-date and can be accessible through theInternet.The registrar’s office will maintain course information and grades. At the beginning of eachsemester, students may request/ access a list of course offerings for the semester. Informationabout each course, such as lecturers, departments, and any prerequisites, will be included (byregistrar’s office) to help students make informed decisions.The university should be able to allow students to sign in to select a number of course offeringsfor the semester. Each course…
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
- Consider a memory system which only allows you to do sequential search. For example a read/write tapedrive. If you want to look for a file you have to search sequentially looking at the first file, then the secondfile and so on until you find the file. A reasonable strategy would be place the most recently retrieved fileat the front (imagine that the tape system can magically do this). This way the files that are accessed moreoften will be ”at the front” and require less searching time in the long run. Consider the case with only 3files A, B, and C.1. Let Xn denote the sequence of the memory system after the nth search. For example, if the files wereordered A and then B followed by C, then X0 = ABC. Enumerate the state space.2. If X0 = ABC, list all possible states of X1.3. If pA, pB, and pC = 1 − pA − pB are the probabilities with which files A, B, and C are accessed,respectively, determine the one-step state transition matrix.4. If pA = 0.6, pB = 0.10, pC = 0.3, determine the steady…arrow_forwardCreate a state machine diagram of operating system processes according to the following description: In general, processes are created and are then waiting to be scheduled if they are able to run. They might be blocking on some external condition (IO, semaphores, other synchronization,...) and might be therefore not able to run. If they are scheduled they are running. At any point they can become blocked due to some external condition. Processes can also be swapped out to the page file / swapping space, which can happen when they are waiting for some external condition or when they are waiting to be scheduled. We are assuming that processes can be terminated at any time.arrow_forwardWhen a user programme and an operating system collaborate to construct a virtual machine, they both produce a highly distinct instance of the machine's representation. Specify the several ways in which they are not the same.arrow_forward
- How may the principle of mutual exclusion (ME), from all viewpoints (i.e., within the scope of your studies), be seen as a necessary framework for the efficient operation of an operating system, according to your research?arrow_forwardIs it possible for a single process to halt in the middle of its execution? Justifications for your responses are required.arrow_forwardRunning the procedure on a virtual machine may be the most time- and resource-efficient choice. What best describes the present scenario in your own words, regardless of your opinion?arrow_forward
- Consider a computer system with 3 processes and one resource with 4 instances. Each process needs at most 2 resource instances. Is a deadlock possible in this system? Justify your answer.arrow_forwardWhat describes how the principle of least privlege applies to the use of computers? A, It guarantees that no information inifially held in an object can be used outside its execution environment B, A process is allowed access only to the resources il needs to complete Its task and limit damage from a faulty process C, It is a process that can access an object in a domain only if that domain has a key that malches one of the locks of the object D It is the use of access controls to monitor and limit access to applications, programs, and websites during specific times of use.arrow_forwardConsider a scenario in which several processes compete for access to the same resource (e.g., a file or some memory address). When a process is starved due to resource unavailability, a timer is used to stop (i.e., kill) the process after a predetermined time interval. Once the process is terminated, attempt to gain access to the desired resource. For example, a user could be prompted programmatically to check if a process is not available, and if not available, then the process could be terminated. This would simulate the same process users perform with the Task Manager on Windows or the Activity Manager on the Mac. Create a C program that implements the scenario using two processes that are created using fork(). Print the necessary process data using fprintf to show a log of activities: which processes are running, what resource they are trying to access, whether the resource is available, and whether the process is starved. After analyzing the activity log produced by your program,…arrow_forward
- In the situation where there are multiple users or a networked computer system, you probably share a printer with other users. When you request to print a file, your request is added to the printer. When your request reaches the front of the printing line, your file is printed. This ensures that only one person at a time has access to the printer and that this access is given on a first-come, first-served basis. Keeping that in mind whenever a new request is generated, OS will put the file in a line and prints the file which comes earlier(first). After printing the OS checks the next file and prints the next file and this goes on until all files get printed. Implement the above scenario what you have to do is: Make a File class which keeps Id, name, number of pages. Create a Printer class which takes File type array. The Printer class implements the operation “add” which adds a new file to the line by checking the available space. A remove() method in Printer class which removes…arrow_forwardThe typical computer screen has a WIMP setup (what does WIMP stand for?). Most common WIMP arrangements work on the basis of a desktop metaphor, in which common actions are likened to similar actions in the real world. For example, moving a file is achieved by selecting it and dragging it into a relevant folder or filing cabinet. The advantage of using a metaphor is that the user can identify with the environment presented on the screen. Having a metaphor allows users to predict the outcome of their actions more easily. Note that the metaphor can break down, however. What is the real-world equivalent of formatting a disk? Is there a direct analogy for the concept of ‘undo’?arrow_forwardBetween the operating system and a user application, two totally different representations of a virtual machine are produced. Describe the differences between them.arrow_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