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.
What do you understand by the term library in OS?
Explain the term Directory?
Describe the Slots on Motherboard? Describe it in brief.
What do you understand by the term Executive in Windows NT?
Illustrate the term Asymmetric Multiprocessing.
Explain about the Real-Time System?
State some of the binding steps?
Explain the term Priority inversion and Dispatch Inversion.
Give a brief introduction of the term Pipe?
Explain the following given terms: a) System Calls b) Virtual machine c) Hand held Systems
18,76,764
1934561 Asked
3,689
Active Tutors
1457000
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!