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.
What are the differences between process and thread? The fundamental difference between a process and a thread is that a process has an entire copy of the program to itself and
Why interrupt can be used? The majority of the different parts of the PC need to send information to and from the processor and they expect to be able to get the processor's at
explain about oprating system services and topics briefly
What is the Translation Lookaside Buffer (TLB) In a cached system, the base addresses of the last few referenced pages is maintained in registers known as the TLB that aids in
Relocation bits employed by relocating loader are specified by Relocation bits employed by relocating loader are specified by Assembler or Translator
Define dynamic linking. Dynamic linking is same to dynamic loading, rather that loading being postponed unless execution time, linking is postponed. This feature is usually use
Q. Why do several systems store the operating system in firm ware and others on disk? Answer: For certain devices such like handheld PDAs and cellular telephones a disk with
The optimal replacement policy, called OPT, is to evict the page which will be accessed farthest into the future. Since we can't predict the future precisely, we can't implement OP
explain about design issues of network operating system
General Graph Directory A serious trouble with using an acyclic graph structure is making sure that there are no cycles. When links are further added to an existing tree struc
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