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.
State Fourth Generation (4G)?
What do you understand by the term pre-paging and demand-paging?
Give a brief introduction of the term named pipe?
Explain the term pure demand paging?
Explain some of the disadvantages of the linked allocation?
Illustrate the basic difference between the normal LAN cable and cross cable? What could be the utmost length of the LAN cable?
Explain several operating system services?
Explain the benefit of dynamic loading? Also define MMU
Explain in brief the Indirect Communication.
What do you mean by the term BSOD? Describe, what do you do if you get blue screen in a computer? Explain how do you troubleshoot it?
18,76,764
1930854 Asked
3,689
Active Tutors
1443007
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!