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.
Give a brief introduction of the term ‘daemon’?
Write a short note on time-stamping?
Illustrate the term Batch Systems.
Briefly explain compaction?
What are approaches for dealing with deadlock
Give brief introduction of the term command interpreter?
What do you mean by demand and pre-paging?
Describe the merits of the Multiprogramming.
To a net book with no DVD how can we install Windows 7?
Define term bus and controller?
18,76,764
1932355 Asked
3,689
Active Tutors
1413000
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!