In an airline reservation system, it is necessary to ensure that while one process is busy using a file, no other process can also use it. Otherwise, two different processes, working for two different ticket agents, might each inadvertently sell the last seat on some flight. Devise a synchronization method using semaphores that makes sure that only one process at a time accesses each file (assuming that the processes obey the rules).

In an airline reservation system, it is necessary to ensure that while one process is busy using a file, no other process can also use it. Otherwise, two different processes, working for two different ticket agents, might each inadvertently sell the last seat on some flight. Devise a synchronization method using semaphores that makes sure that only one process at a time accesses each file (assuming that the processes obey the rules).

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

Similar questions

using c++ In this assignment you are going to implement your own version of university library system,Thesystem will have two different sides , the first one is to help the librarian to do his job and the other side for admin to manage every one permissions in the system , so You should provide the following features in your system: Admin view o Add/remove Studentso Add/remove librarian o Add/remove other admins Librarian viewo Add/Delete bookso Issue/Return bookso View bookso View Issued bookso Log in /log outo Search for the book(id/name) Simple backend for your system , You could use a file each row should represent itemo Books File should be something like:Id , Book Name, Author Name, Available quantity, Issued Quantity1,Oliver Twist, Charles Dickens,98,2In the previous the first row was the name of each column , you can do that or handle it in your code , id =1 , Book Name =Oliver Twist ..Etc. Tables neededo Books Id  Book Name Author Name Available quantity Issued…
In this project you are to design a process queue that is responsible for handling the process requests coming from different users. You have to take into consideration that users have different levels of privileges and priorities. Each user has an identification number and a password, in addition to process priorities. One good idea is to design the queue using an array or pointers while preserving the first-in first-out concept of the queue. For every process request received, the program should check the privileges of that request and whether it can be moved forward in the queue to be served by the operating system prior to serving the other requests. Using the programming language of your choice (preferably C+), write the process queue that would handle the user request. The program must allow for requests coming from different users or from one user.
Write a C program which creates a child process to find all txt files in the root directory (i.e., “/") and stores the output in a text file called “all_txt_files.txtť". If the child process execution takes more than t seconds (measured at the parent), the parent should abort the execution of that child. Otherwise, after the child process termination, the parent has to create another child which will count the number of records in all_txt_files.txt and print out the output. The program should not allow the creation of orphan processes. - You need to include the C header file time.h to roughly count the execution time of the child process and play with different values of t so that both cases may happen. Another option may be the alarm system call. - You can use redirection (i.e., “>") to redirect the output of find to a txt file (e.g., find / - name "*. txt" > all_txt_files.txt). It's not a problem if find cannot access some directories. - You can count the number of lines in a txt…
COPY FROM CHEGG == DISLIKE AND REPORT Assume that a finite number of resources of a single resource type mustbe managed. Processes may ask for a number of these resources and will returnthem once finished. As an example, many commercial software packagesprovide a given number of licenses, indicating the number of applications thatmay run concurrently. When the application is started, the license count isdecremented. When the application is terminated, the license count isincremented. If all licenses are in use, requests to start the application aredenied. Such a request will be granted only when an existing license holderterminates the application and a license is returned. The following program segment is used to manage a finite number of instancesof an available resource. The maximum number of resources and the number ofavailable resources are declared as follows: #define MAX_RESOURCES 5 int available_resources = MAX_RESOURCES; /** When a process wishes to obtain a number of…
In the context of the same file management system, it is planned to offer a sorted view of files by name. For that purpose, there is a need for a compare function that takes two strings (file names) and returns: 0: if both files are the same -1: if the first string comes alphabetically before the second string 1: if the first string comes alphabetically after the second string Examples: compare (abc, abc) → 0 compare (abc, de) →-1 compare (xyz, abcde) → 1 i. Design the compare algorithm as described above. Use pseudocode to describe your algorithm.
A deadlock occurs when a group of processes is stalled because one process is holding a resource and waiting for another process to obtain it. Consider the situation when two trains are approaching each other on the same track and there is only one track: once they are in front of each other, neither train can proceed. In operating systems, a similar scenario happens when two or more processes possess certain resources while waiting on resources owned by other processes (s). In the picture below, Process 1 is holding Resource 1 and waiting for Process 2 to acquire Resource 2, while Process 2 is waiting for Resource 1. Give an example of a realistic deadlock avoidance approach and describe the basic strategy behind it.
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…
in C++ please create a Priority : -pre-emptive algorithm code: here are information that will help you Tasks: • Lab 4: Process management • Review Process management algorithms Definitions: (in terms for this lab not formal definitions) • Preemptive: When a new process arrives and has a higher priority than the current running process, Then the current running process is paused and put back in the waiting queue, and the new process starts executing. In most systems it will automatically interrupt the current running job when the new job arrives, however some systems use a predetermined interval (a certain number of time units), to check for new jobs. • Non preemptive: Take no action when a process with higher priority arrives,when a new process with a higher precedence arrives current running process need to finish first before the new process goes Oxford definition: Preempt – to take action in order to prevent (an anticipated event) from happening; forestall. • Metric: a metric is…
For the following scenario for a point of sale system, draw the following: • A mail order company that distributes CDs and tapes at discount prices to record club members (tells the purpose of the system). • When an order processing clerk receives an order form, she verifies that the sender is a club member by checking the MEMBER FILE. If the sender is not a member, the clerk returns the order along with a membership application form. • If the customer is a member, the clerk verifies the order item data by checking the ITEM FILE. Then the clerk enters the order data and saves it to the DAILY ORDERS FILE. • At the same time, the clerk also prints an invoice and shipping list for each order, which are forwarded to the ORDER FULFILLMENT DEPARTMENT for processing there. Answer:
Which example uses the SOLID SRP principle correctly and does not violate it? (A or B) A. public class DatabaseParser { ParseDirectoryMapFile(); // parse directory map fileParsePasswordFile(); // parse user fileParseReviewDataFile(); // parse review data fileParseTeamFile(); // parse team CalculateGrade(); CalulateRelativeGrade(); } B public class DatabaseParser { ParseDirectoryMapFile(); // parse directory map fileParsePasswordFile(); // parse user fileParseReviewDataFile(); // parse review data fileParseTeamFile(); // parse team file} // seperately with the following: public class Calculator{ CalculateGrade(); CalulateRelativeGrade(); }
In this question you will be considering the development of a platform through which people working from home can monitor and control machines such as 3D printers, working in a factory. i. You are provided with the following requirement. "User can select a 3D model file from a list and add it to a queue for one of the printers." Write out a step-by-step process that a tester can use to test this requirement. ii. Write TWO requirements for the monitoring part of the platform, using the EARS syntax.
Question : Your task is to design a departmental store management system. The store has multiple shelves with numbers on it for placing multiple items, initially the shelf is empty, means that there is no item on the shelf. The store consists of k number of shelves, and each shelf has exactlyp number of positions for items to be placed on it. The store wants to design a software to keep the records of item on the shelves. The software should be able to perform the following operations: 1. Insert the item at a particular position in a given shelf, if it's empty else place the item in the first empty location in that shelf, and if there is no location empty on that shelf then do not insert it and display the appropriate message to the user. 2. Display all the items in a given shelf. 3. Remove the item from particular position in a given shelf if it is there. 4. Remove all the item from a given shelf 5. Return total number of the items in the specified shelf 6. Return the total number of…