In the context of memory management, what are placement and
replacement algorithms?
Answer / guest
Placement algorithms determine where in available real-
memory to load a program. Common methods are first-fit,
next-fit, best-fit. Replacement algorithms are used when
memory is full, and one process (or part of a process)
needs to be swapped out to accommodate a new program. The
replacement algorithm determines which are the partitions
to be swapped out.
Is This Answer Correct ? | 28 Yes | 2 No |
Write a function that responds to a click anywhere on the page by displaying an alert dialog. Display the event name if the user held Shift during the mouse click. Display the element name that triggered the event if the user held Ctrl during the mouse click.
What are the sub-components of I/O manager in Windows NT?
What are the different operating systems?
What do you mean by memory leak?
What does a 64 bit processor mean?
Why paging is used?
Why is 32 bit called x86 and not x32?
How are data structures handled by ntfs and how does it recover from a crash?
Does dual boot affect performance?
List advantages and disadvantages of dynamic memory allocation vs. static memory allocation.?
What are short-term, long-term and medium-term scheduling?
What are various scheduling queues?