1. Consider the following snapshot of a system:AllocationRequestMarABCD ABCD0023 0001011012202356 1000A B C DP₁0 0 1 2P₂1000Pa1354PA00012201 2200Available12201.1. Is the system in a safe state?1.2. Can P3's request be safely granted immediately?1.3. If P3's request is granted immediately, does the system enter a deadlock?Show all your workings.

Step 1: 1.1 answer 1.1. To determine if the system is in a safe state, use the banker's algorithm.…

Answered: 1. Consider the following snapshot of a…

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

Consider a computer system with three users: Alice, Bob, and Cyndy. Alice owns the file alicerc, and Bob and Cyndy can read it. Cyndy can read and write the file bobrc, which Bob owns, but Alice can only read it. Only Cyndy can read and write the file cyndyrc, which she owns. Assume that the owner of each of these files can execute it. Create the corresponding access control matrix. Cyndy gives Alice permission to read cyndyrc, and Alice removes Bob's ability to read alicerc. Show the new access control matrix
Consider a computer system with three users: Alice, Bob, and Cindy. Alice owns file X, and Bob and Cindy can read it. Bob owns file Y, and Cindy can read and write the file Y, but Alice can only read it. Cindy owns file Z, but neither Alice nor Bob can read or write it. If a user owns a file, he/she can also execute the file. Create the ACM (access control matrix) of the system Show the ACL and CL of the ACM Now Cindy allows Alice to read Z, Alice removes Bob's ability to read X, and Bob removes all the rights of Alice and Cindy to Y. Show the ACM after these changes.
Consider the following snapshot of a system: Allocation: А ВСD TO 0012 T1 1000 T2 1354 T3 0632 T4 0014 Маx: АВ СD TO 3 0 1 2 T1 17 50 T2 2 3 5 6 T3 0 6 5 3 T4 0 6 5 6 Available: A BC D 25 10 Answer using the banker's algorithm. If you think the system is in an unsafe state, write "unsafe" in the answer box, otherwise, write the process sequence that satisfies the safe state. While answering the question write only the id of the Tasks separated with comma, (e.g., for sequence write only 4,2,1,0,3).
Q4:- A fast computer is used to break a ciphertext (A) using columnar transposition cipher that needs 150 attempts, the speed of processor is 4 MIPS (million instructions per second), and each attempt needs 5 instructions. Another computer of speed 3 MIPS is used to break ciphertext (B) using Caesar Cipher that needs 110 attempts, and each attempt needs 4 instructions for ciphertext (B). Determine which ciphertext will be broken first (consider the worst case, i.e. the last attempt is the successful one), write your answer in details?
1) What is the current state of the system? a. System has circular path b. The system is in safe state c. It is unsafe state d. The state is undetermined 2) What is the safe sequence of the system? a. <D C B A> b.<D B C A> c. None, because it is unsafe d. <D C A B>
Consider for a minute that you are a software engineer who has invented a system that analyzes photos of a range of recyclable items (such as a can, bottle or a crate). It is accessible through a Web Application Programming Interface (Web API), which allows users to transfer photos over the internet. The system provides, for each photograph, the total number of occurrences of each distinct item shown in the image. Consider if it would be reasonable to give this service for free. Justify your answer
An old encryption system uses 20-bit keys. A cryptanalyst, who wants to brute-force attack theencryption system, is working on a computer system with a performance rate N keys per second. How many possible keys will be available in the above encryption system? What will be the maximum number of keys per second (N) that the computer system isworking with, if the amount of time needed to brute-force all the possible keys was 512 milliseconds? Show you detailed calculations.
8. A security system is used to encrypt the password of a cryptocurrency wallet (crypto wallet) and generate 10 different codes that the owner of the wallet can copy on 10 papers that he will hide with great care. So if a thief finds 1 of these hidden papers, he will not be able to unlock the wallet. Indeed it would be necessary to have at least 6 (any 6) codes to reconstitute the secret passphrase and unlock the wallet. How is it possible ?
In many races competitors wear a RFID tag on their shoes or bibs. When the racer crosses a sensor a computer logs the racer’s number along with the current time. Sensors can be placed along the course to accurately calculate the racer’s finish time or pace and also to verify that the racer crossed key checkpoints. Consider such a system in use for a half-marathon running race, which is 13.1 miles. In this problem there are only three sensors: at the start, at the 7-mile point, and at the finish line.Here is sample data for three racers. The first line is the gun time in the 24-hour time format (HH MM SS). The gun time is when the race begins. Subsequent lines are recorded by sensors and contain the sensor ID (0=start, 1=midpoint, 2=finish) followed by the racer’s number followed by the time stamp. The start time may be different than the gun time because sometimes it takes a racer a little while to get to the starting line when there is a large pack. 08 00 000,100,08 00 000,132,08 00…
(b) Suppose we have public key encryption system with E the encryption function and Dr the decryption function, where Er is publicly known for a key k and Dx is secret. Suppose further that the composition of the operations E and Dµ is com- mutative: Er o Dr = Dx o Ex. Propose a simple way to implement authenticating messages using components of this encryption system. Answer: to send a signed message x we compute and send:
1. Implement the following using FCFS, SJF (Preemptive and Non-preemptive). P AT BT P1 0 10 P2 7 P3 4 P4 P5 P6 P7 P8 Average WT = Average TAT = 1234912 31142
Suppose we're modelling an RC crane which is receiving a sequence of input commands, each of which is UP, DOWN, or BEEP. This crane has only two vertical positions, and starts in the high position. It should go into an ERROR end state if it is asked to go UP when it is in the high position or DOWN when it is in the low position. Once it is in the ERROR state, it stays in the ERROR state no matter what commands it receives. BEEP commands are legal at any point. Give a state diagram for this system, in which each edge corresponds to receiving a single command.

SEE MORE QUESTIONS

Recommended textbooks for you

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

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

SEE MORE TEXTBOOKS