(i) How many times will process P0 print “'0”? Justify your answer. Q4. The following program consists of 3 concurrent processes and 3 binary semaphores. Thesemaphores are initialized as S0=1, S1=0, S2=0.Process POProcess P1Process P2wait (S1);signal (S0);while (true) {wait (S0);print (0);signal (S1);signal (S2);wait (S2);signal (S0);}

Justification: In the beginning P0 only inside the while loop, hence the value of S0=1,S1=0,S2=0.…

Answered: How many times will process P0 print…

Engineering

Computer Science

How many times will process P0 print “'0”? Justify your answer.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: Please explain, C-pro Q# What happens if we forget to reclaim our memory with the 'free' function?…

A: Answer: I have given answer in the brief examples

Q: Q2: Write matlab commands to solve the following two equations: 2X+4Y=10 X+Y=4

A: Above given is pair of linear equations with two variables. linear equations in the form of ax +…

Q: What is the difference between pre and post increment/decrement operations?

A: 1- Pre increment/decrement operation(++n,--n): Pre-increment/decrement means adding/subtracting and…

Q: Can the value of a checksum be all Os (in binary)? Defend your answer. Can the value be all 1s (in…

A: The value of a checksum can be all 0s (in binary). This happens when the value of the sum (after…

Q: What is the value of temp and n after the executions of the following code? assume user inputs…

A: Required:

Q: The following pair of processes share a common variable X. Process A int Y; A1: Y=X*2: A2: X = Y;…

A: A Process is a series of actions, motions, or operations leading to some result the manufacturing…

Q: Write a program execute the following additions, test CF, and then storage the results and CF in…

A: In this we have to write a program to add two numbers and check if there is carry or not and store…

Q: Assume that the following are concurrent statements. L<= P nand Q after 10 ns; M <= L nor N after 5…

Q: 1. The bank account balances are: a=500, b=600, c=1000. What possible account balances can appear…

A: Let's first understand the Transactions: T1: bank transfer of 300 from a to c if (a<300)…

Q: Which of the following is not a transaction state? a. Active b. Partially committed c. Failed d.…

A: We have asked from given options which of the following is not a transaction state? In Transaction,…

Q: i. The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores…

A: Introduction: If all the three semaphores are initialized to 0 and all are waiting in the first…

Q: We can use the following cmdlet to display a list of running processes. Group of answer choices…

A: given data We can use the following cmdlet to display a list of running processes. Group of answer…

Q: T1 T2 T3 Read (X) Read ( Y) Read ( Y) Write ( Y) Write (X) Write (X) Read (X) Write ( X ) All the…

A: A transaction schedule is serializable if it's outcome is equal to the outcome of it's transactions…

Q: parallel and running programs concurrently

A: Hey there, I hope you find my solution helpful.

Q: Describe four problems that may arise as a result of running many concurrent processes.

A: Introduction: Concurrent Processes: In an operating system, when various or multiple processes are…

Q: 3. You have five (5) memory partitions of 220 MB, 150 MB, 300 MB, 430 MB, 720 MB which is in order,…

A: AS according to our guidelines we can provide one solution at a time if you want answer of another…

Q: jobs

A: Process ID: 6458 Job no: 1 Status: Running If you look at the ps output, the first column depicts…

Q: Given the following logical expression, place the operations in the order in which you would apply,…

A: Given: Given the following logical expression, place the operations in the order in which you would…

Q: .g. what they are, what they do) the following terms in your own words. 1. stdio.h (in C programs)…

A: The stdio.h is called header file of C language based library and stdio.h header defines three…

Q: We can use Get-Process and Get-Service without any parameter, and get a list of running processes…

A: By default, when Get-Service is run without parameters, all the local computer's services are…

Q: The output of the following script is r.

A: The code snippet is operation on strings. Strings are basically an array of character which is…

Q: i ←10 while (i > 5)…

A: dear student, please note that we are only allowed to solve one question in one post. From solving…

Q: ccording to Amdahl's Law, what is the maximum possible % reduction in execution time when: process…

A: In computer architecture, Amdahl’s law (or Amdahl’s argument) is a formula which gives the…

Q: Is suspended processes will always hold a zero (0) value for both read and write I/O operations?

A: …

Q: Please help with implementing the Banker's algorithm for deadlock avoidance, that works on a given…

A: ANSWER:-

Q: Consider that we need to use semaphores to allow the below sequence of processes to execute: P4 P1…

A: The answer is as follows:-

Q: 4. Does the following group communication of 4 computers respect the FIFO order? p1 p2 physical time…

A: Answer: I have given answer in the brief explanation.

Q: Q2: Write matlab commands to solve the following two equations: 2X+4Y=10 X+Y-4

A: The above given equations are a system of linear equations with two variables. The equations of form…

Q: The following pair of processes share a common variable X. Process A int Y; A1: Y = X*2; A2:…

A: Question. The following pair of processes share a common variable X. Process A int Y; A1: Y =…

Q: 6. Draw the memory arrangement for the following data. MI DB 'Happy new year! M2 DW 3 DUP (10H) ,…

A: Bytes are allocated by define bytes DB. Words are allocated by define words DW. DUP allows to…

Q: The function PowerRecursive below takes inputs r and n, wherer is any real number and n is a…

A: Recursive call PowerRecursive(r,n-1) done for n-1 to to base case. The base case of the…

Q: Is the following concurrent execution sequentially consistent? write(a,1), read(b,0), computer 1:…

A: Sequential concurrent execution: for the given operation we have to form a graph to check for any…

Q: 2. Write a program using (Subroutine) to find the following result and store the result in memory…

A: Let the data 1,3,5,100,2,4 is stored in location starting from 60000H. The program works as make…

Q: 9- Devices that let the computer communicate with you (a) Input (b) Print (c) Output (d) None of…

A: The solution involves basics of operating systems.

Q: The situation when two or more programs hung up is referred

A: The situation when two or more programs hung up is referred as

Q: What will be stored in SI and DI after executing the following code: CLD MOV AX, 5000H MOV DS, AX…

A: Given: Value of SI and DI.

Q: WHICH STATE OF A PROCESS IS INSUFFICIENT THEREFORE HAS TO BE DIVIDED TO MORE STATES? Select one:…

A: Because Not Running state is to be split into two states are Ready and Blocked.

Q: Which of the following is done last in the order of operations? Squaring Addition Multiplication…

A: Addition Explanation in order of operation first the parantgesus will get solve than expinenets than…

Q: Are the functions one to one or onto only? I. f : N → Z : x ↔ x II. f : N → N : x ↔ x III. f : Z…

A: Please upvote. I am providing you the correct answer below. please please.

Q: What will be the contents of AX after the following operation?mov ax,63hmov bl,10hdiv bl

A: Instruction: The given instruction is as follows: mov ax,63hmov bl,10hdiv bl

Q: Consider that in your computer, you have five (5) memory partitions of 180 MB, 590 MB, 280 MB, 380…

A: Here, the best-fit algorithm will make the best use of memory. It is given that there are 5 memory…

Q: Assume that the followings are the outputs of ps and jobs commands and answer the following…

A: Step 1:- Os stands for Operating System. Operating System is defined as an interface between the…

Q: Warning: Not copy code again and again. N

A: You did not mention writing a particular programming language so we provide python code for you.…

Q: Assume that 35% of a program cannot be sped up, and the remaining 65% has no dependencies and hence…

Q: a. The differences among sequential access, direct access, and random access?

A: Answer. A.The distinction between the consecutive access, direct access and random access.When…

Q: 8a. What does the following piece of Python code print to the terminal ? 1st = [1, 2, 3] for i in…

A: B. 0 1 2 Output screenshot :

Q: Which of the following transition between state cannot be happened? الاجابات execution , ready…

A: Which of the following transition between state cannot be happened? execution , ready ready ,…

Q: What is the size of Tray in the C snippet shown below? (Assume that 1 character occupies 1 byte)…

A: CODE(SCREENSHOT) : Explanation : in line 4 , a char array named x of size 5 is declared using…

Q: Assume that the followings are the outputs of ps and jobs commands and answer the following…

A: Given: Assume that the followings are the outputs of ps and jobs commands and answer the following…

Q: 18. In this instance, dirty reads are disallowed, while nonrepeatable reads and phantom reads are…

A: The answer is given below.

Concept explainers

Fundamentals of Input and Output Performance

The I/O subsystem is a component of computer system design that uses buses to assist communication between the Central Processing Unit, Computer Memory/Storage, and Input and Output Devices (that is known as peripheral devices). The I/O subsystem includes disc controllers, tape drives, discs, system buses, and other devices. The I/O database application reads and writes drives using the operating system windows I/O.

Question

(i) How many times will process P0 print “'0”? Justify your answer.

Q4. The following program consists of 3 concurrent processes and 3 binary semaphores. The
semaphores are initialized as S0=1, S1=0, S2=0.
Process PO
Process P1
Process P2
wait (S1);
signal (S0);
while (true) {
wait (S0);
print (0);
signal (S1);
signal (S2);
wait (S2);
signal (S0);
}

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Fundamentals of Input and Output Performance

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

The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores are initialized as S0 = 0,S1 = 1 and S2 = 1. Process P0:while (true) { wait (S0); print '1';release(S1);release(S2);} Process P1:wait (S2);release (S0); Process P2:wait(S2);release(S0); How many times will process P0 print '1'?
Write a C program Producer – Consumer as a classical problem of synchronizationStep 2. Write a program* that solves the producer - consumer problem. You may use the following pseudo codefor implementation.*program to write: produce -consumer problem to produce and consume the alphabet.//Shared data: semaphore full, empty, mutex;//pool of n buffers, each can hold one item//mutex provides mutual exclusion to the buffer pool//empty and full count the number of empty and full buffers//Initially: full = 0, empty = n, mutex = 1//Producer threaddo {…produce next item…wait(empty);wait(mutex);…add the item to buffer…signal(mutex);signal(full);} while (1);//Consumer threaddo {wait(full)wait(mutex);…remove next item from buffer…signal(mutex);signal(empty);…consume the item } while (1); it consumes and produce the alphabets not numbers sample output is attached you please also attach your sample output
Computer Science Complete the program 'Ring-1.c' to make the program work well for any number of processes specified by users and have one possible output sequence as follows if we run the program using 4 processes. Process 0: Token value < 4 > is received from process 3 Process 2: Token value < 2 > is received from process 1 Process 1: Token value < 1 > is received from process 0 Process 3: Token value < 3 > is received from process 2 #include <stdio.h>#include <stdlib.h>#include <mpi.h> int main(void){int comm_sz, my_rank;MPI_Init(NULL, NULL);MPI_Comm_size(MPI_COMM_WORLD, &comm_sz);MPI_Comm_rank(MPI_COMM_WORLD, &my_rank);int token = 1; MPI_Send(&token, 1, MPI_INT, (my_rank + 1) % comm_sz, 0, MPI_COMM_WORLD); if (my_rank == 0){ MPI_Recv(&token, 1, MPI_INT, comm_sz - 1, 0, MPI_COMM_WORLD, MPI_STATUS_IGNORE);/* print out the message */printf("Process %d received token value < %d…
Modiflow y the beprogram given to include response time program;FCFS CPU SCHEDULING ALGORITHM #include<stdio.h>#include<conio.h>main(){int bt[20], wt[20], tat[20], i, n; float wtavg, tatavg;clrscr();printf("\nEnter the number of processes -- "); scanf("%d", &n); for(i=0;i<n;i++){printf("\nEnter Burst Time for Process %d -- ", i); scanf("%d", &bt[i]);}wt[0] = wtavg = 0; tat[0] = tatavg = bt[0]; for(i=1;i<n;i++){wt[i] = wt[i-1] +bt[i-1];tat[i] = tat[i-1] +bt[i]; wtavg = wtavg + wt[i]; tatavg = tatavg + tat[i];}printf("\t PROCESS \tBURST TIME \t WAITING TIME\t TURNAROUND TIME\n");for(i=0;i<n;i++){printf("\n\t P%d \t\t %d \t\t %d \t\t %d", i, bt[i], wt[i], tat[i]);}printf("\nAverage Waiting Time -- %f", wtavg/n);printf("\nAverage Turnaround Time -- %f", tatavg/n); getch();}
Modiflow y the beprogram given to include response time program;FCFS CPU SCHEDULING ALGORITHM #include<stdio.h>#include<conio.h>main(){int bt[20], wt[20], tat[20], i, n; float wtavg, tatavg;clrscr();printf("\nEnter the number of processes -- "); scanf("%d", &n);for(i=0;i<n;i++){printf("\nEnter Burst Time for Process %d -- ", i); scanf("%d", &bt[i]);}wt[0] = wtavg = 0; tat[0] = tatavg = bt[0];for(i=1;i<n;i++){wt[i] = wt[i-1] +bt[i-1];tat[i] = tat[i-1] +bt[i]; wtavg = wtavg + wt[i]; tatavg = tatavg + tat[i];}printf("\t PROCESS \tBURST TIME \t WAITING TIME\t TURNAROUND TIME\n");for(i=0;i<n;i++){printf("\n\t P%d \t\t %d \t\t %d \t\t %d", i, bt[i], wt[i], tat[i]);}printf("\nAverage Waiting Time -- %f", wtavg/n);printf("\nAverage Turnaround Time -- %f", tatavg/n); getch();}
Write a C program which creates two childprocesses. One of the child processes mustopen data1.txt and fill it with 10 randomintegers (0-9). The other child process mustopen data2.txt and fill it with 10 randomletters (a-z). In the meanwhile, parent mustprint both child processes' id's and wait forthem to finish.
Develop a program in C to create three processes A, B and C. Job of these individual processes are as follows: Process A: Reads n numbers from the keyboard and counts the number of odd numbers in it. Then this count will be sent to the Process B. Process B: Reads the count from Process A and determines the fibonacci sequence of that count. This fibonacci sequence result will be sent to the process C. Process C: This process reads the fibonacci sequence from process B and sort the numbers in descending order.
In the above, we had the three concurrent processes p1, p2 and p3, each with the number s1 = 2, s2 = 3 and s3 = 2 of states, respectively.
Please help with implementing the Banker's algorithm for deadlock avoidance, that works on a given set of N processes and M resource types (N<10,M<10). Use Java for the implementation, with a simple text interface, where the user enters only the name of the input file (text only). The program reads all the necessary input data from that file. The input data and result is then displayed on the screen. Please help by using BACKTRACKING and find all solutions Subject: Java Programming
Modiflow y the beprogram given to include response time program;SJF CPU SCHEDULING ALGORITHM #include<stdio.h> #include<conio.h> using namespace std; int main() { int p[20], bt[20], wt[20], tat[20], i, k, n, temp; float wtavg, tatavg; printf("\nEnter the number of processes--"); scanf("%d", &n); for(i=0;i<n;i++) { p[i]=i; printf("Enter Burst Time for Process %d--", i); scanf("%d", &bt[i]); } for(i=0;i<n;i++) for(k=i+1;k<n;k++) if(bt[i]>bt[k]) { temp=bt[i]; bt[i]=bt[k]; bt[k]=temp; temp=p[i]; p[i]=p[k];…
) Consider the following sequence of virtual memory references (in decimal) generatedby a single program in a pure paging system:100, 110, 1400, 1700, 703, 3090, 1850, 2405, 2460, 4304, 4580, 3640a. Derive the corresponding reference string of pages (i.e. the pages the virtual addressesare located on), assuming a page size of 1024 bytes. (Assume that page numberingstarts at 0)b. For the page sequence derived above, determine the number of page faults for each ofthe following page replacement strategies, assuming that two (2) page frames areavailable to the program.i. LRUii. FIFOiii. OPT (Optimal)
Write a Python program using the multiprocessing method and the Pool object that spawns 10 processes with inputs 1,...,10 and each process calculates the sum of integers up to and including its input and returns this sum.