|
INTERVIEW QUESTIONS
OPERATING SYSTEMS
DETAILS
Question: In the context of memory management, what are placement and replacement algorithms?
Answer: 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 the partitions to be swapped out are
|
|
|
Category |
Operating Systems Interview Questions & Answers -
Exam Mode /
Learning Mode
|
Rating |
(0.2) By 8595 users |
Added on |
9/9/2014 |
Views |
66498 |
Rate it! |
|
|
Question:
In the context of memory management, what are placement and replacement algorithms?
Answer:
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 the partitions to be swapped out are Source: CoolInterview.com
If you have the better answer, then send it to us. We will display your answer after the approval.
Rules to Post Answers in CoolInterview.com:-
- There should not be any Spelling Mistakes.
- There should not be any Gramatical Errors.
- Answers must not contain any bad words.
- Answers should not be the repeat of same answer, already approved.
- Answer should be complete in itself.
|
|
Related Questions |
View Answer |
|
How are the wait/signal operations for monitor different from those for semaphores?
|
View Answer
|
|
What is time-stamping?
|
View Answer
|
|
Describe the Buddy system of memory allocation
|
View Answer
|
|
Define latency, transfer and seek time with respect to disk I/O
|
View Answer
|
|
What are local and global page replacements?
|
View Answer
|
|
What is a trap and trapdoor?
|
View Answer
|
|
When does the condition 'rendezvous' arise?
|
View Answer
|
|
Explain the popular multiprocessor thread-scheduling strategies
|
View Answer
|
|
What is busy waiting?
|
View Answer
|
|
What are the stipulations of C2 level security?
|
View Answer
|
|
What is meant by arm-stickiness?
|
View Answer
|
|
What is cycle stealing?
|
View Answer
|
|
When is a system in safe state?
|
View Answer
|
|
What is the resident set and working set of a process?
|
View Answer
|
|
What is the Translation Lookaside Buffer (TLB)?
|
View Answer
|
|
What are the typical elements of a process image?
|
View Answer
|
|
What are turnaround time and response time?
|
View Answer
|
|
What are short-, long- and medium-term scheduling?
|
View Answer
|
|
List the Coffman's conditions that lead to a deadlock.
|
View Answer
|
|
What is thrashing?
|
View Answer
|
Please Note: We keep on updating better answers to this site. In case you are looking for Jobs, Pls Click Here Vyoms.com - Best Freshers & Experienced Jobs Website.
View All Operating Systems Interview Questions & Answers - Exam Mode /
Learning Mode
|