C1 Using the Least Recently Used (LRU) page replacement algorithm, complete the following page replacements using the reference string given below. Calculate the total number of the page faults.Reference String0123014012Frame 1 Frame 2 Frame 3 Page Fault C2 Create an access matrix for the following scenario:Ahmad has the right to read /etc/passwd and view the grades.Mohammed has the right to view the EECS website.Students have the right to share project data and view the EECS website.Instructors have the right to change the grades. Answer: Object Domain C3 Draw the Gantt chart and compute the average turnaround and waiting time for the following processes using the Round Robin Scheduling algorithm. Assume the time quantum is 3 ms. ProcessArrival TimeCPU BurstP107P214P343 Gantt Chart Waiting TimeTurnaround timeP1=P1=P2=P2=P3=P3=Total=Total=Average=Average= C4 Suppose the head of a moving-head disk with 200 tracks numbered 0 to 199 is currently serving a request at track 99 and has just finished a request at track 125. The queue of outstanding requests in FIFO order is: 5, 95, 75, 100,30 and 155. What is the total number of head movements (in cylinders) for the following disk-scheduling algorithms? FCFS Scheduling SCAN Scheduling SSTF Scheduling C5 Create links between the files in the directory and the disk blocks using linked disk allocation technique: BlockLink151212171722223030-1 FileStartendhackers1530Directory Block NoLink BlockBlock NoLinkBlockBlock NoLinkBlockBlock NoLinkBlockBlockNoLinkBlockBlock NoLinkBlock 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 Write any two advantages and disadvantages of the linked disk allocation technique? AdvantagesDisadvantages

since you have asked multiple questions as per guidelines we are allowed to answer only one

Answered: C1 Using the Least Recently Used (LRU)…

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

Related questions

Question

C1 Using the Least Recently Used (LRU) page replacement algorithm, complete the following page replacements using the reference string given below. Calculate the total number of the page faults.

Reference String	0	1	2	3	0	1	4	0	1	2
Frame 1
Frame 2
Frame 3
Page Fault

C2 Create an access matrix for the following scenario:
- Ahmad has the right to read /etc/passwd and view the grades.
- Mohammed has the right to view the EECS website.
- Students have the right to share project data and view the EECS website.
- Instructors have the right to change the grades.

Answer:

Object Domain

C3 Draw the Gantt chart and compute the average turnaround and waiting time for the following processes using the Round Robin Scheduling algorithm. Assume the time quantum is 3 ms.

Process	Arrival Time	CPU Burst
P1	0	7
P2	1	4
P3	4	3

Gantt Chart

Waiting Time	Turnaround time
P1=	P1=
P2=	P2=
P3=	P3=
Total=	Total=
Average=	Average=

C4 Suppose the head of a moving-head disk with 200 tracks numbered 0 to 199 is currently serving a request at track 99 and has just finished a request at track 125. The queue of outstanding requests in FIFO order is: 5, 95, 75, 100,30 and 155. What is the total number of head movements (in cylinders) for the following disk-scheduling algorithms?

FCFS Scheduling

SCAN Scheduling

SSTF Scheduling

Create links between the files in the directory and the disk blocks using linked disk allocation technique:

Block	Link
15	12
12	17
17	22
22	30
30	-1

File	Start	end
hackers	15	30

Directory

Block No	Link Block	Block No	Link Block	Block No	Link Block	Block No	Link Block	Block No	Link Block	Block No	Link Block

0		1		2		3		4		5

6		7		8		9		10		11

12		13		14		15		16		17

18		19		20		21		22		23

24		25		26		27		28		29

30		31		32		33		34		35

Write any two advantages and disadvantages of the linked disk allocation technique?

Advantages	Disadvantages

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions