Placement and replacement algorithms
In the framework of memory management, describe the placement and replacement algorithms?
Expert
Placement algorithms find out where in available real-memory to load a program. Common techniques are first-fit, next-fit, and best-fit. Replacement algorithms are used if memory is full, and one process (or part of process) requires to be swapped out to accommodate a new program. The replacement algorithm finds out which are the partitions to be swapped out.
Explain the fragmentation?
Explain about the local and global page replacements?
Illustrate the basic difference between the normal LAN cable and cross cable? What could be the utmost length of the LAN cable?
Describe the Buddy system of the memory allocation.
What do you mean by DNS? Explain why it is used? Also describe ‘forward lookup’ and ‘reverse lookup in the DNS?
Write down the various kinds of memory?
Your system is contaminated with Virus? Explain how to recover the data?
Specify the principal events of the Process Creation.
Explain what is meant by the dynamic linking?
Briefly explain about the term synchronization? And as well write down the various synchronization methods?
18,76,764
1922187 Asked
3,689
Active Tutors
1450873
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!