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.
What do you mean by demand and pre-paging?
Illustrate the basic difference between the normal LAN cable and cross cable? What could be the utmost length of the LAN cable?
Illustrated out the essential differentiation between non-pre-emptive and pre-emptive scheduling?
What do you understand by the term Executive in Windows NT?
Write down the drawbacks of Micro-kernels?
Explain what is meant by the term Counting Semaphore and Binary Semaphore?
Explain the term deadlock and starvation?
Describe how to recover files if the system perceives virus?
Explain the term Dynamic Linking in brief.
State Fourth Generation (4G)?
18,76,764
1957526 Asked
3,689
Active Tutors
1418818
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!