Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The queue of pending requests, in FIFO order, is: 2,069; 1,212; 2,296; 2,800; 544; 1,618; 356; 1,523; 4,965; 3,681 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk-scheduling algorithms? a. FCFS b. SCAN c. C-SCAN d. LOOK e. C-LOOK

Assume we have a hard disk with 300 cylinders (numbered 0 to 299) with the disk head starting at cylinder 120 (moving toward cylinder 299). We have the following queue of hard disk requests: 160, 230, 100, 80, 180, 200, 240, 290. Draw a diagram below (as in Figure 1) showing the movement of the head over time for the FCFS algorithm, and calculate the total movement of the disk head (in cylinders). (Assume that no other requests for cylinders arrive while this algorithm is executing.)  Figure 1: Disk Scheduling for FCFS algorithm (see image attached )  Assume we have the same hard disk as problem III(b). For reference, the disk has 300 cylinders (numbered 0 to 299) with the following queue of hard disk requests: 160, 230, 100, 80, 180, 200, 240, 290. Draw a diagram below (like Figure 1) showing the movement of the head over time for the SCAN algorithm, and calculate the total movement of the disk head (in cylinders). (Assume that no other requests for cylinders arrive while this…

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.

Please solve the question for the last two parts. Thanks in advance.

Consider user accounts on a computer system with a Web server configured to provide user Web areas. In general, this uses a standard directory name, such as “public_html,” in a user’s home directory. However, access control needs to be properly set to allow users (with or without user accounts on the system) to browse the webpages. Assuming there are one main page (index.html), two pictures files (a.jpg and b.jpg) stored in an sub-directory (Image) and one pdf file (c.pdf) stored in an sub-directory (Doc), all under the public_html. (a) Specify the access matrix for each directory (excluding home directory) and files that allows everyone to view the webpage. (b) Draw a directed graph that represented to the access matrix

please i need the answer

Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The queue of pending requests, in FIFO order, is: 2,069, 1,212, 2,296, 2,800, 544, 1,618, 356, 1,523, 4,965, 3681 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk- scheduling algorithms? e. C-SCAN f. C-LOOK

The capacity of a cut is defined as the sum of capacities of nodes that composes the cut. O True O False

9

Consider a computer environment in which there are 4 magnetic drives, 2 printers, 3 scanners, and 1 optical drive. Three processes P1, P2, P3 are using these resources. At any point in time, the allocations and requests for these resources are as follows. Allocations: Magnetic drive Printer Scanner Optical drive P1 1 P2 2 1 P3 1 Requests: Magnetic drive 2 Printer Scanner Optical drive P1 1 P2 1 1 P3 2 1 Is there any way that the processes can complete without deadlock? If yes, explain how. If not, explain why not.