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.
Describe which one is better: Windows 7 or Windows XP? Validate your answers with illustrations.
Explain the term virtual memory?
What do you mean by the Dispatcher?
Explain what is effective access time?
What do you mean by the term Group Policy? Describe briefly.
Describe what is UFD and MFD.
How you cope up from under pressure?
State some of the applications of the real-time systems.
Write down the functions constituting the OS's memory management?
Explain various requirements that solution to the critical section problem should satisfy?
18,76,764
1951228 Asked
3,689
Active Tutors
1433412
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!