Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Hierarchical paging method
Most modern computer systems maintain a large logical-address space. In this situation the page table itself turns into excessively large. To remedy this memory wastage we won't allocate the page table contiguously in main memory.
One way is to utilize two-level paging algorithm, in which page table is as well paged. A logical address is separated into a page number consisting of 20 bits and a page offset consisting of 12 bits. for the reason that we page the page table, the page number is additional divided into a 10-bit page number and a 10 bit page offset. At this point address translation works as of the outer page table inwards this scheme is called as forward-mapped page table.
List ways to share files among directories in operating systems. a. Copy file from one account into another. b. Link directory entry of "copied" file to directory entry of o
What are the advantages of Linked allocation? The benefits are a. No external fragmentation b. Size of the file does not require to be declared
Question 1 Explain single Partition Allocation and Multiple Partition Question 2 What is PCB? What useful information is available in PCB? Question 3 Explain Preemptive and No
LRU page replacement In slightest recently used page replacement algorithm we will replace that page that hasn't been used for the longest period of time. This is similar as an
Which are the different states of a process? Different status of a process is: New: When the process is created. Running: When instructions are executed. Wait
Hashed page tables A common approach for handling address spaces larger than 32 bits is to use a hashed page table. Every entry in the hash table having a linked list of elemen
A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 ton
FIRST FIT ALGORITHM Scanning a list along with if a free hole is available with necessary space for the process to allocate it allocates the process in that space. The first s
with the aid of diagrams describe the following os structures monolithic , layered, client server
What are the four necessary conditions of deadlock prevention? Ans: Four essential conditions for deadlock prevention: a. The meaning of removing the mutual exclusio
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd