A process references five pages A, B, C, D and E in thefollowing order,A, C, B, E, A, B, E, A, B, C, D, E. Assume the replacementalgorithm is first-in-first-out. Find the number of pagetransfers during this sequence of references starting withan empty main memory with three page frames. Repeatfor four page frames.

Answered: A process references five pages A, B,…

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

Suppose the head of a moving head disk with 200 tracks numbered 0-199 is currently servinga request at track 143. It has just finished a request at track 125. If the queue of requests iskept in the FIFO order,86,147,85,177,94,150,102,175,130What is the total head movement to satisfy these requests for the following disk schedulingalgorithms? First Come First Served Shortest Seek Time First SCAN
Using the following page replacement algorithms, determine the number of faults in the following reference string given a physical memory size of 4 frames: 5 6 5 4 4 4 8 2 9 9 0 4 5 3 9 6 8 1 9 1 6 1 0 0 5 Replacement algorithm 3 frames FIFO OPT LRU LFU MFU
Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11, 92, 10. The C-LOOK scheduling algorithm is used. The head is initially at cylinder number 63, moving towards larger cylinder numbers on its servicing pass. The cylinders are numbered from 0 to 199. The total head movement (in number of cylinders) incurred while servicing these requests is
Suppose a disk has N cylinders, numbered from 0 to P. At some time, the disk arm is at cylinder X, and there is a queue of disk access requests for cylinders R1, R2, R3, R4. Explain which Disk scheduling algorithm should be the best to be used between the following a) FIFO b) CSCAN c) SSTF d) FSCAN e) CLOOK N: B • • Choose any acceptable numeric numbers for N, P, X, R1, R2, R3 and R4 • • Plagiarism Will be penalized heavily
1.In the Readers-Writers problem, more than one writer can access the buffer at the same time to write True False 2.Given that processes P1 and P2 are using semaphores to lock resources, determine whether or not the following sequence of requests results in a deadlock. Initially, all resources are available. P1: P2: wait(A) wait(C) wait(B) wait(B) ... .... signal(A) signal(B) signal(B) signal(C) Yes No Insufficient information 3.If no process is executing in its critical section and there exist some processes that wish to enter their critical section, then the selection of the processes that will enter the critical section next cannot be postponed indefinitely. Which option describe best Mutual Exclusion Progress Bounded Waiting None of the above 4.In the producer-consumer problem, the "out" will be used to point to the index in the buffer where a producer can produce next. True False 5.Entry section and Exit section in the code together are referred to as a solution for…
Imagine a virtual memory system where the RAM can only store two pages at a time. Suppose a program makes the following sequence of page accesses: At time 0, page 5At time 1, page 1At time 2, page 5At time 3, page 2At time 4, page 5At time 5, page 3At time 6, page 5At time 7, page 4 Show at what points in time page replacements occur, and which pages are evicted, using the following page replacement algorithms:(a) FIFO(b) LRU
in round robin when three processes have to enter the ready queue at the instant , if one process has just finished I/O the other has preempted from CPU due to expiration of its quantum and third (C) has just started. which one will be inserted last (ie lowest priority ) ? a) the process that has just finished I/O b) One of the three will be random be selected c) The process that has been pre-empted from CPU due to expiration of its quantum time. d) The process that has just started
Suppose that a disk drive has 40 cylinders, numbered 0 to 40. The drive is currently serving a requestat cylinder 20 (the previous request served was at cylinder 19) when the last of these requests is madewith none of these requests yet served. The queue of pending requests, in FIFO order, is 5, 25, 18, 3,39, 8, and 35. A seek takes 5ms per cylinder movement. Starting from the current head position, whatis the total distance (in cylinders) that the disk arm moves to satisfy all the pending request and alsocalculate the total seek time needed to serve these requests, for each of the following disk-schedulingalgorithms? Explain with the help of a diagram in each case. a. FCFSb. SSTFc. SCANd. LOOK
In Linux Ubuntu terminal how do I search the cpuinfo file for the word processor. And at the same time have the search results go into the file processors.txt under the sub-directory cpu using the shortest relative path.
6. Given that pages of a process are accessed in the order of 3(w), 6(w), 1(w), 3(r), 4(r), 6(r), 2(w), 5(r), 3(r), 2(r) and there are 3 page frames allocated to the process. What is the MR if FIFO is applied? What is the MR if LRU is applied? What is the status of the circular linked list after all the references are done if Enhanced Clock is applied? Green background indicates the current head.
Consider the rule of transitive confinement. Suppose a process needs to execute a subprocess insuch a way that the child can access exactly two files, one only for reading and one only for writing. (a) Could we utilize capabilities be used to implement this? If so, how?(b) Could we utilize access control lists implement this? If so, how?
In a main memory-disk virtual storage system, the page size is 1KByte and the OPTIMAL algorithm is used for page replacements. A given program has been allocated three page frames in the main memory and it makes the following 16 memory references when it starts executing (the addresses are given in decimal):500, 2000, 2500, 800, 4000, 1000, 5500, 1500, 2800, 400, 5000, 700, 2100, 3500, 900, 2400 Fill in the contents of the three page frames after each memory reference in a table and calculate the hit ratio. Hint: denote by 'a' the page consisting of locations 0 through 1023 in memory. Similarly, b: 1024-2047, c: 2048-3071, d: 3072-4095, e: 4096-5119 and f: 5120-6143. Round to three decimal places.

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