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!
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.
Assume we have 1M memory if a process 70k enters we are able to choose the 128k, which will be the best fit for the process thus divide the 1M into 512k each after that a further division of 256k each in one 512k after that one of the 256 is divided into further 128keach and place the process in that. Similar to that if another process enters the division and placing will continue.
Subsequent to this all the free spaces will join together.
After the two adjacent processes having similar space completed they will combine together and at last when all the processes are over the 1M memory will get back.
Explain Wait for Graph a. Use a resource allocation graph to derive a wait-for graph. b. Wait-for graph acquired by making an edge from p 1 to p 2 iff p 1 is waiting for
Determine the equation for the y and truth table for the circuits
Q. What are two differences among user-level threads and kernel-level threads? Under what situations is one type better than the other? Answer: (1) User-level threads are un
What are the system components of an operating system and explain them? a) Process management b) Main-memory management c) I/O management d) File management e) Seco
Q. State three merits of placing functionality in a device controller rather than in the kernel and State three disadvantages. Answer: Three advantages: Bugs are less probabl
Hierarchical paging Single way is to use a two-level paging algorithm, in which the page table itself is also paged. A logical address is separated into a page number and a pag
Contiguous allocation The contiguous-allocation method needs each file to occupy a set of contiguous blocks of the disk. Disk addresses explain a linear ordering on the disk. T
What are the typical elements of a process image? User data: Modifiable part of user space. May have program data, user stack area, and programs that might be modified. User
Q. Dynamically loadable kernel modules give elasticity when drivers are added to a system however do they have disadvantages too? Under what situations would a kernel be compiled
Demonstrate that your program (include the program output as part of the final report) can produce the correct output with the following parameters. For each case comment if the ou
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