a. PRODUCER CONSUMER PROBLEM USING SEMAPHORES Start the Program Declare the required variables Initialize the buffer size and get maximum item you want to produce Get the option, which you want to do either producer or consumer or exit from the operation. If you select the producer, check the buffer size if it is full, the producer should not produce the item and 1. 2. 3. 4. 5. increase the value of the buffer size. If you select the consumer, check the buffer size if it is empty, the consumer should not consume the item or 6. otherwise consume the item and decrease the value of buffer size. If you select exit come out of the program. Stop the program 7. 8.

a. PRODUCER CONSUMER PROBLEM USING SEMAPHORES Start the Program Declare the required variables Initialize the buffer size and get maximum item you want to produce Get the option, which you want to do either producer or consumer or exit from the operation. If you select the producer, check the buffer size if it is full, the producer should not produce the item and 1. 2. 3. 4. 5. increase the value of the buffer size. If you select the consumer, check the buffer size if it is empty, the consumer should not consume the item or 6. otherwise consume the item and decrease the value of buffer size. If you select exit come out of the program. Stop the program 7. 8.

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter13: File Input And Output

Section: Chapter Questions

Problem 13RQ

See similar textbooks

Similar questions

Write code To count the number of people who enter your store, you could use the same motiondetection feature and count the number of files generated. The only problem is youmight run out of space. To get over this problem it is possible to write a short programthat maintains the number of pictures in a spreadsheet by date and then deletes thepictures.
3. Task 2: Reading lines from a File Write C code which will read a line of characters (terminated by a \n) from input_file into a character array called buffer. NULL terminate the buffer upon reading a \n. NOTE:Your source code must display any of the given sample output below.It means your source code should be flexible enough to meet any of the given sample output.Your source code output must be identical to any of the given sample output.It means you have to strictly follow what are the displayed text, labels, casing of characters in the sample output.Strictly follow the naming of file. Sample OUTPUT1: Enter File Name: lupang_hinirang.txt Bayang magiliw Perlas ng silanganan Alab ng puso sa dibdib mo’y buhay Lupang Hinirang, duyan ka ng magiting Sa manlulupig, di ka pasisiil Sa dagat at bundok na simoy At sa langit mong bughaw Tagumpay na nagnininging Ang bituin at araw niyan Kailan pa ma’y di magdidilim Lupa ng araw ng luwalhati’t pagsinta Buhay ay…
help with c++..paste indented cod plzz Q2: There are three buckets size X, Y, M (1<=X<=Y<=M). All three buckets are initially empty. Using these three buckets, we can perform any number of the following two types of operations. We can fill the smallest bucket (of size X) completely to the top with X units of water and pour it into the size-M bucket, as long as this will not cause the size-M bucket to overflow. We can fill the medium bucket (of size Y) completely to the top with Y units of water and pour it into the size-M bucket, as long as this will not cause the size-M bucket to overflow. Although we may not be able to completely fill the size-M bucket, but we can still determine the maximum amount of milk we can possibly add to largest bucket. Sample input: 17 25 77 Sample output: 76 In this example, we fill the bucket of size 17 three times and then bucket of size 25 once, accumulating a total of 76 units of water. You could use additional test case to test your…
“Performance” or “response time.” defines how fast an application presents an output once given an input. Assume you are building an app, and one of the engineers on the team thinks the Sieve of Eratosthenes algorithm will be the bottleneck in satisfying performance requirements. They have executed the algorithm and set it under test to create a performance baseline. (Please, find below A4.py and primeSieve.py) Run A4.py and report the result from the part 1 section: “X function calls in Y seconds.” After the remainder of the application and main algorithms are written, the engineers set the full application under performance testing, in part 2 of A4.py. Record the result from the part 2 section: “X function calls in Y seconds.” The method described in this section is to examine performance by making an educated guess on where performance bottlenecks occur before finishing and testing the entire application (or at least a complete portion of a significant function) Was it a good…
Pseudocode Refinement Step 1–The Problem Statement This should be as short as possible, yet convey the full requirement of the program (however vague). Consider the following starting point for your stepwise refinement, which was pulled from the homework description. “Given a target file to find and a starting directory, determine if and where the target file exists.” Pseudocode Refinement Step 2 Using the above sentence as an incomplete guide split the embedded concepts into 4 distinct steps, such as: Setup & Initialization (for the program, or a specific function, similar to preconditions) 2. Input 3. Processing…
create python algorithm for a shortest job first scheduler. the scheduler needs to be able to perform well in a varietyof metrics, such as turnaround time, response time, burst time and switching time. thescheduler needs to be able to perform well in a variety of situations, and also needs to take into account I/O Interrupts.The input is a number n, indicating the number of processes in the file, followed by n processes, each on a newline. Each process line is in the format:Process Name, Process Runtime, Process Arrival Time, IO Frequency If IO occurs for a givenprocess, then it needs to be indicated by a ! followed by the process name without a space. In this case thefequency of the IO is dependant on the “IO Frequency” parameter. It is also important to note that in this caseNO other process can be scheduled concurrently with an IO request.
Using C++. Assume your development team is tasked with writing a pathfinder ( solution finder ) or the childhood game of 8 sliding tiles game. Your task is to determine whether or not an initial board configuration is or is not solvable. Your algorithm should do this by counting inversions. If the number of inversions is even, then the board is solvable. If the number of inversions is odd, then the board is not solvable (there is NO sequence of moves that will transition from the initial board to the goal board).
Using C# and Windows Presentation Foundation (WPF), design and implement a standalone desktop time management application that fulfils the following requirements: 1. The user must be able to add multiple modules for the semester. The following data must be stored for each module:a. Code, for example, PROG6212b. Name, for example, Programming 2Bc. Number of credits, for example, 15d. Class hours per week, for example, 52. The user must be able to enter the number of weeks in the semester.3. The user must be able to enter a start date for the first week of the semester.4. The software shall display a list of the modules with the number of hours of self-study that is required for each module per week. The number shall be calculated as follows: self-study hours per week=number of credits × 10/number of weeks − class hours per week 5. The user must be able to record the number of hours that they spend working on a specific module on a certain date.6. The software shall display how many…
C++ Task: By using the coding given, please add 2 other void, which is void undo() and void redo(). Modify it untill the programme can work properly. The output may contain PUSH, POP, DISPLAY, UNDO and REDO. The coding: #include <iostream>using namespace std;struct Node { int data; struct Node *next;};struct Node* top = NULL;void push(int val) { struct Node* newnode = (struct Node*) malloc(sizeof(struct Node)); newnode->data = val; newnode->next = top; top = newnode;}void pop() { if(top==NULL) cout<<"Stack Underflow"<<endl; else { cout<<"The popped element is "<< top->data <<endl; top = top->next; }}void display() { struct Node* ptr; if(top==NULL) cout<<"stack is empty"; else { ptr = top; cout<<"Stack elements are: "; while (ptr != NULL) { cout<< ptr->data <<" "; ptr = ptr->next; } } cout<<endl;}int main() { int ch, val;…
9/21/21 Updates are in blue Add the following functionality and menu options to the previous lab Searching - a user should be able to search by ID or by item name create only one menu item for searching a user should be able to enter the name of the item using any case, (for example, sTRolleR) you may wish to store items in all lower/upper case to expedite the search write one search function that can search by ID and name and goes through the array of structs/objects only once show the entire record if found or an appropriate message if not Sorting - sort by any field in ascending order write one function to sort by any field using a parallel array of pointers use Bubble Sort is not the most effective but the easiest to modify. do not copy and paste sort code five times into the same function. sorting using pointers is faster because you have to swap pointers only, which are normally stored in 4 bytes each; it also allows you to preserve the original order of the items write a…
Add the ability to convert an entire message into Morse code, as well as the ability to handle a data file comprising numerous entries. Change your input validation code so that the user has an infinite number of opportunities to enter valid responses. Your program should run until the user selects the "quit" option from your menu. Add a menu option to provide the user the option of processing a data file. Add another way to exit the program. When your software starts, the menu should be the first item that appears. The menu format should be the same as in the Sample Output. Allow the user to make more menu selections until they select the option to exit. Before soliciting the user for a menu selection, always show the menu. Handle an incorrect menu option correctly. The user should have an infinite number of opportunities to enter a valid menu option. Validate the user's input for the number of words sent so that numbers less than one are not accepted. Allow the user an unlimited…
help with Python.....paste indented code here QUESTION 10 Implement the following with try...except:1) Assign a variable to the filename newFile.txt.2) Remove the file, newFile.txt from the current working directory.3) Prompt "Remove Complete" if the file can be removed. Otherwise, prompt "INCOMPLETE". Example Output (assume newFile.txt does not exist)INCOMPLETE