26. The following four requests could come in to an operating system as it is running on a computer system: The clock in the computer has just "ticked," and we need to update a seconds counter. The program running on processor 2 is trying to perform an illegal operation code. Someone pulled the plug on the power supply, and the system will run out of power in 50 msec. The disk has just read the character that passed under the read/write head, and it wants to store it in memory before the next one arrives. In what order should the operating system handle these requests?

26. The following four requests could come in to an operating system as it is running on a computer system: The clock in the computer has just "ticked," and we need to update a seconds counter. The program running on processor 2 is trying to perform an illegal operation code. Someone pulled the plug on the power supply, and the system will run out of power in 50 msec. The disk has just read the character that passed under the read/write head, and it wants to store it in memory before the next one arrives. In what order should the operating system handle these requests?

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

For a 100-cylinder disk, compute the total number of head movements for the request queue provided below, using FCFS scheduling and a 100-cylinder disk (0-99). It is expected that the read write head is present at cylinder number 50 at the start of the program. Request queue for disk cylinders has the following numbers: 75, 25, 30, 68, 40, 89, 10.
Write a program that simulates a paging system using the aging algorithm. The number of page frames is a parameter. The sequence of page references should be read from a file. For a given input file, plot the number of page faults per 1000 memory references as a function of the number of page frames available. Code Solution: https://github.com/preethikandhalu/C/blob/master/aging.c Task to be done based on the above program: Describe what the code does, explaining how it accomplishes its task of implementing the aging page replacement algorithm. You must create an input file for simulating a sequence of page references. Run the program. (Fix any bugs that it may contain, first). Vary the number of page frames, keeping the sequence of page references constant. What can you infer from the results? Plot the output in an Excel graph. Explain your findings. Adjust your inputs to get meaningful outputs.
Part 2: Encryption Objective: Develop a program that encrypts a plaintext file by XORing 128-bit blocks of the file with a key repeatedly until the entire file is encrypted. Details: • The plaintext file will be a book from Project Gutenberg. • The encryption method should use the XOR operation on the file, 128 bits at a time, with the key. • Each 128-bit block is XORed with the same key. • The program should work from the command line and accept three parameters: o The name of the key file o The name of the plaintext file o The desired name of the resulting ciphertext file Note: This encryption method is not supposed to be secure. Usage: $ ./bad_streamcipher_enc kf pt ct
Both the utmp file and any directory are organized as a sequence of structs. Consider the two structs definitioned here: struct { char a; int b; char c; } one; struct { char a; char c; int b; } two; Which of the following is true? If you don't know the answer (we did discuss this in class), experiment in order to find the answer. struct one takes up more memory than struct two. struct two takes up more memory than struct one. They both take up the same amout of memory.
To improve performance when reading files, "block read ahead" can be performed. What is this? A. The operating system determines, when reading block K, if the file is being read sequentially. If it is, the file system will retrieve block K, and initiate the request for block K+1 in the file. B. The operating system determines, when writing block K, if the file is being written sequentially. If it is, the file system will retrieve block K, and initiate the request for block K+1 in the file. C. The operating system determines when reading block K if that block was accessed via a seek. If it is, the file system will retrieve block K, and initiate the request for the next block in the file that is needed by the process. D. All of the above
The Tower of Hanoi Problem Tower of Hanoi is a mathematical game consisting of three pegs (P1, P2 and P3) and a stack of disks of different diameters. Disks can slide onto any peg. The game starts with all disks stacked on P1 and ends at the point where all disks stacked on P3. The game player is required to move all disks from P1 to P3 using P2 as a buffer. Three rules must be followed when playing the game (1) Only one disk may be moved at a time. (2) Each move involves taking a disk on the top of a peg and place it on the top of another peg. (3) A disk of a larger diameter should never be placed on top of a disk of a smaller diameter. The diagrams below demonstrate the starting state and goal state of the game with 5 disks. starting sate p1 to goal state p3 Requirements In this assignment, students are required to solve the Tower of Hanoi (with five disks) using state space search algorithms implemented in Python. Two state space search algorithms: (1) a blind search (depth-first…
I'm wondering what sort of file access pattern would be the most appropriate for chained file allocation on disk.
Consider a disk pack with 32 surfaces, 64 tracks and 512 sectors per pack. 256 bytes of data are stored in a bit serial manner in a sector. The number of bits required to specify a particular sector in the disk is.
Suppose we have a Unix file system with block size of 8 Kbyte and pointers with size of 4 bytes. How large a file can be represented using only single indirect pointer in inode? A. 8 Kbyte B. 2K * 8 Kbyte C. 2K * 2K * 8 Kbyte D. 2K * 2K * 2K * 8 Kbyte
Both the utmp file and any directory are organized as a sequence of. Can you please fill in the blank? The rest is correct.
The following four requests could come in to an operating system as it is running on a computer system: The clock in the computer has just “ticked,” and we need to update a seconds counter. The program running on processor 2 is trying to perform an illegal operation code. Someone pulled the plug on the power supply, and the system will run out of power in 50 msec. The disk has just read the character that passed under the read/write head, and it wants to store it in memory before the next one arrives. In what order should the operating system handle these requests?
- Let's assume that a system can handle 2,000 users. a UNIX security system that permits 1,990 users to view a single file called "MPX.pdf" is suggested. Do you have any plans for the other ten people who don't have access to the file?