Buddy system of the memory allocation
Describe the Buddy system of the memory allocation.
Expert
Free memory is maintained in the linked lists, each of equivalent sized blocks. Any such block is of size 2^k. If some memory is needed by a process, the block size of the next higher order is selected and broken to two. Note that the two such pieces vary in address only in their kth bit. These pieces are termed as buddies. If any used block is freed, the OS checks to see if its buddy is as well free. If so, it is re-joined, and place to the original free-block linked-list.
Explain long term scheduler & short term schedulers?
Write down the functions constituting the OS's memory management?
What do you mean by the term Group Policy? Describe briefly.
Write down the main functions of operating system?
Write down the typical elements of the process image?
Explain the term deadlock and starvation?
Describe what is lazy swapper?
Illustrate the term Mutual Exclusion.
State some of the applications of the real-time systems.
Explain different types of operating systems?
18,76,764
1931338 Asked
3,689
Active Tutors
1435390
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!