Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 3, Problem 41CRP
Program Plan Intro
Starvation:
When more than one process executes in overlapped time period and one of the processes do not get time for its execution to complete, then that particular process suffers from starvation.
Deadlock:
In a computer system, a process utilizes resources to execute its instructions. In a condition when the two processes simultaneously acquire resources of the other process, the processes are not able to execute their instruction and this condition is called deadlock.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Please refer to this textbook: “A. Silberschatz, P. B. Galvin and G. Gagne, “Operating System Principles,”7th Edition, John Wiley & Sons Inc., 2006.”
And answer the following questions:
Question10:
The following is not a property of transactions: (a) Permanent: once committed, the results of a transaction are made permanent. (b) Serializable: the result of concurrent transactions must be the same as if they were run in serial order. (c) Indivisible: the transaction appears as an indivisible action. (d) Bounded: a transaction must have an upper bound on the time it takes to complete
112.
Four necessary conditions for deadlock to exist are: mutual exclusion, no-preemption, circular wait and
a.
hold and wait
b.
deadlock avoidance
c.
race around condition
d.
buffer overflow
Please refer to this textbook: “A. Silberschatz, P. B. Galvin and G. Gagne, “Operating System Principles,”7th Edition, John Wiley & Sons Inc., 2006.”
And answer the following questions:
Question:The Ricart& Argwala mutual exclusion algorithm:
(a) Does not depend on time stamps in messages while Lamport's does.
(b) Cannot handle the case where two or more processes request the same resource at the same
time.
(c) Does not require a process to send messages to the entire group while Lamport's does.
(d) Requires fewer messages than Lamport's algorithm.
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
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Read the question very carefully, especially for Load and Branch.arrow_forwardProblem Statement: (The following problem is based on problem statements in a number of operating systems texts) For this lab, you'll be setting up 2 queues of PCBs. A process control block (PCB) is an internal structure that is used to hold information associated with a process. A process is an instance of a program that is brought into random-access memory (RAM) for execution. To simplify matters, you'll be setting up 2 queues: a ready queue and a wait queue and, PCBs each PCB will have 2 fields: a process ID or PID (a positive integer) a link field to point to the next PCB on a queue The ready queue will have the PCBs for the processes that will be run in a first-come, first-served fashion. The wait queue will have the PCBs for the processes that will be waiting for a resource in a first-come, first-served fashion. If the PCB at the head of the ready queue needs some resource (for example, I/O) then it will be removed from the ready queue and moved to the rear of…arrow_forwardPlease refer to this textbook: “A. Silberschatz, P. B. Galvin and G. Gagne, “Operating System Principles,”7th Edition, John Wiley & Sons Inc., 2006.” And answer the following questions: Question:15 A system has the following blocks queued for writing: 8000, 3000, 5000, 2000. The most recently written block was 4500. The block read before that was 2500. (a) What sequence of writes will a C-SCAN algorithm generate? (b) What sequence of writes will a SCAN algorithm generate? (c) What sequence of writes will a FCFS algorithm generate? (d) What sequence of writes will a SSTF algorithm generate? (e) What sequence of writes will a LOOK algorithm generate?arrow_forward
- ) Consider the following memory management allocation scenario at time t:arrow_forward5) In a modified version of RR scheduling scheme, there are two queues. Queue #1 is for real-time processes and Queue #2 is for normal processes. Queue #2 is serviced only if Queue #1 is empty. a) Draw a diagram illustrating the above scheduling policy/scheme: b) Briefly state the pros & cons (one each) of the above policy:arrow_forwardExplain what a deadlock is in the context of concurrent programming.arrow_forward
- 3. Knapsack problem (4’)a. (1’) Show the dynamic programming table when applying the bottom-up dynamicprogramming algorithm to the instance of the knapsack problem? (Capacity W=6)b. (1’) Show the dynamic programming table when applying MemoryKnapsack(i, j)dynamic programming algorithm to the instance of the knapsack problem? (CapacityW=6)c. (1’) What is the optimal subset?d. (1’) What is the maximal value of a feasible subset?arrow_forwardList the 4 conditions that can cause a deadlock for concurrent processes P1 and P2. (short answer is ok)arrow_forwardWhy and when should implicit heap-dynamic variables be used; when, how, and why should they not be used; and what should be done if they should be usedarrow_forward
- All deadlocks are caused by competing demands for resources.arrow_forwardSecurity: 1. Buffer overflow A C code example for Buffer Overflow is below: #include #define BUFFER SIZE 256 int main(int argc, char *argv[]) { char buffer[BUFFER SIZE]; if (argc <2) return -1; else { } strcpy(buffer,argv[1]); return 0; } (a) Explain the C code here on what it is doing. (b) Explain why buffer overflow may happen (c) Explain how you can modify the code to avoid buffer overflow.arrow_forwardAs a result, when individuals speak about dynamic memory allocation, what precisely do they mean? What's the goal of it all? Many of the most important functions in the C programming language make it feasible to allocate memory in a dynamic manner. Please answer with code examples that are suitable for the situation.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 EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable 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