1) For the following “Producer-consumer Problem using Semaphores”, (a) Will there be any deadlock if the order of the downs were switched, for the producer or for the consumer individually as well as together (so, 3 combinations)? Explain. Now, (b) similarly consider the order of ups and show (3 combinations again) – when you assume that the ups are switched then keep the downs intact (not switched). semaphore mutex = 1; /* binary semaphore providing mutual exclusion */semaphore empty = N; /* counting semaphore, counts empty buffer slots */semaphore full = 0; /* counting semaphore, counts full buffer slots */void producer(void){while(TRUE)}{int item = produce_item();down(&empty);down(&mutex); // Enter CRinsert_item(item); //put in bufferup(&mutex); // Leave CRup(&full);void consumer(void){while(TRUE)down(&full);down(&mutex); // Enter CRint item = remove_item(); //remove item from bufferup(&mutex); // Leave CRup(&empty);consume_item(item); // do something with it{}

buffer access to consumer ,so that item can be inserted. ii] Same will be for consumer,Changing…

1) For the following “Producer-consumer Problem using Semaphores”, (a) Will there be any deadlock if the order of the downs were switched, for the producer or for the consumer individually as well as together (so, 3 combinations)? Explain. Now, (b) similarly consider the order of ups and show (3 combinations again) – when you assume that the ups are switched then keep the downs intact (not switched).

1) For the following “Producer-consumer Problem using Semaphores”, (a) Will there be any deadlock if the order of the downs were switched, for the producer or for the consumer individually as well as together (so, 3 combinations)? Explain. Now, (b) similarly consider the order of ups and show (3 combinations again) – when you assume that the ups are switched then keep the downs intact (not switched).

Microsoft Visual C#

7th Edition

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Joyce, Farrell.

Chapter8: Advanced Method Concepts

Section: Chapter Questions

Problem 7RQ

See similar textbooks

Similar questions

CPU Priority Scheduling-preemptive: Write a Java program to implement a priority scheduling algorithm that uses low number to represent high priority. Your program should first prompts the user to input a list of process ID, arrival time, burst time, and priority for each process to be run on the CPU. The list is terminated by 0 0 0 0 for the process ID, arrival time, burst time, and priority. The program output should draw a Gantt chart (as text) that shows the scheduling order of the processes using the Priority scheduling algorithm. Also print the turnaround time, response time, and waiting time for each process along with their average for all processes. Make sure to display very helpful messages to the user for input and output.
program in java: topic: selection port The Input must be:["apple", "avocado", "orange", "banana", "strawberry", "pineapple", "plum", "mango"] The assumptions and conditionsSorted partition is on the right side.The order is decreasing based on the number of letters which is found after letter "j" inclusive.The result or output must be:['strawberry', 'pineapple', 'plum', 'mango', 'orange', 'avocado', 'apple', 'banana']
The block is practically a square-size placeholder for the Tile objects. But not all the spots are necessarily occupied. When the block is generated, we randomly pick the spots that will be filled in with tiles. All the tiles of a block must have the same color. write the code for these functions below private DynamicArray<DynamicArray<Tile>> block; // the internal storage of the block data public Block(int y, int x, int size) // this contructor creates a 2D placeholder of null value; //these values will be populated later with calls to setTile() public Block(int y, int x, int size, byte color) // overloaded constuctor that creates a 2D matrix with actual tile objects; //no need to call setTile afterwards
Modify code Write a C program to simulate producer-consumer problem using semaphores. TASK: DESCRIPTION Producer-consumer problem, is a common paradigm for cooperating processes. A producer process produces information that is consumed by a consumer process. One solution to the producer-consumer problem uses shared memory. To allow producer and consumer processes to run concurrently, there must be available a buffer of items that can be filled by the producer and emptied by the consumer. This buffer will reside in a region of memory that is shared by the producer and consumer processes. A producer can produce one item while the consumer is consuming another item. The producer and consumer must be synchronized, so that the consumer does not try to consume an item that has not yet been produced. 12.3PROGRAM #include<stdio.h> void main() { int buffer[10], bufsize, in, out, produce, consume, choice=0; in = 0; out = 0; bufsize = 10; while(choice !=3) { printf(“\n1. Produce \t 2.…
Linux general memory layout includes stack, heap, data, and code. stack memory relations stores local variables heap: dynamic memory for programmer to allocate data: stores global variables, separated into initialized and uninitialized code: stores the code being executed Use the following code to answer the questions that follow #include <stdio.h> #include <stdlib.h> int x; int main(int argc, char *argv[]) { int y=3 printf(": %p\n", main); int* z = malloc(100e6); printf("location of stack: %p\n", &y); return 0; } Where are the possible memory addresses of the above variables? Address Location x y main z *z
STACK SEGMENT STACK ENDS DATA SEGMENT DATA ENDS CODE SEGMENT assume cs:code,ds:data,ss:stack MOV AX,data MOV DS,AX MOV AH,02H MOV BH,00 MOV DH,5 MOV DL,10 INT 10H MOV Ax,4C00H INT 21H code ends END What is the output screenshots
Return-Oriented Programming (ROP). Return-oriented programming uses sequences of instructions that arealready part of the executable program. These are called gadgets; each gadget ends with the single-byte instruction ret (binary code 0xc3). The exploit input consists of (i) enough padding to reachthe return address from the vulnerable function (can be anything), followed by (ii) a sequence ofaddresses of gadget code in the program. Each gadget executes a few instructions that do somethinguseful (e.g., move a particular value into a particular register), then “return” to the address on thetop of the stack, which starts the next gadget.ROP is important to know about because attackers can use it when countermeasures like non-executable stack make code injection infeasible. In this problem, you will search for gadgets inprograms on your VM.(Nota bene: ROP is a technique for exploiting an existing vulnerability—i.e., buffer overflow—in a program; it does not create any vulnerabilities. So…
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
Java program instructions are stored in a memory location called ___. code static memory the stack the heap What does a clock do? Stores the computer's programs Counts the number of instructions executed by a processor Interfaces with peripherals Determines the rate of execution for a processor's instructions Which XXX and YYY will find the minimum value of all the elements in the array? Choices are in the form XXX / YYY. int[][]userVals=newint[NUM_ROWS][NUM_COLS];minVal=userVals[0][0];for(i=0;i<NUM_ROWS;++i){for(j=0;j<NUM_COLS;++j){if(XXX){YYY;}}} userVals[i] userVals[j] userVals[i][j] userVals[i][j]>minVal/minVal=userVals[i][j]
In C programming, write a method int ksyscall_proc_get_name(char *name). *Copies the current process name to the buffer provided * char *name - pointer to the buffer to copy the name. If there is an error return -1, if success return 0.
Shortest-Remaining-Time-First (Preemptive SJF): Write a Java program to implement a Shortest-Remaining-Time-First (Preemptive SJF) scheduling algorithm. Your program should first prompts the user to input a list of process ID, arrival time, and burst time (in ms) for each process to be run on the CPU. The list is terminated by 0 0 0 for the process ID, arrival time, and burst time. The program output should draw a Gantt chart (as text) that shows the scheduling order of the processes using the RR scheduling algorithm. Also print the turnaround, response, and waiting time for each process along with their average for all processes. Make sure to display very helpful messages to the user for input and output.
2.3 Describe the defences against buffer overflows that can be implemented when running programs.