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!
Explain segmentation hardware?
We define an completion to map two-dimensional user-defined addresses into one-dimensional physical addresses. This mapping is affected by means of segment table. Every entry in the segment table has a segment base and a segment limit. The segment base holds the starting address where the segment resides in memory, where the segment limit specifies the length of the segment.
A logical address consists of two parts that are a segment number's, and an offset into that segment d. The segment number is utilized as an index to the table. The offset d of the logical address should be between 0 and the segment limit. The segment table is fundamentally an array of base-limit register pairs.
Q. What kinds of services does the process manager provide? Define local procedure call? Answer: The process manager offers services for creating and deleting and using proce
what is file abstraction?
Explain a boot control block A boot control block can have the information required by the system to boot an operating from that partition. If the disk does not have an operati
Define the DosExit Function used in the OS/2 DosExit(action, resultCode) DosExit function is to be called when a thread or process is finished executing. If EXIT_THREAD is
The hardware to support demand paging is as follows Page table: This table has the skill to mark an entry invalid though a valid-invalid bit or particular value of protectio
Explain why SSTF scheduling tends to favor middle cylinders over the innermost and outermost cylinders. The center of the disk is the location having the fewest average distanc
MEMORY MANAGEMENT USING BUDDY SUSTEM Here we are dividing the memory as powers of two as well as we are selecting the space which is smallest but large enough to hold a process
what operating system mean
What are the various disk-scheduling algorithms? The several disk-scheduling algorithms are a. First Come First Served Scheduling b. Shortest Seek Time First Scheduling
4. Describe priority scheduling algorithm. Consider the following set of processes. Show the order in which the algorithm will schedule these processes. Assume preemptive and non-p
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: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd