OS Prefi
Waiting Time - The Criterion is the sum of the personnel spent waiting in the ready queue
Simple paging - This technique divides the memory into several equality sizes frames
Job queue - The queue contains all the processes in the system
Shortest remaining time first - This is an algorithm in which the process with the smallest execution time is chosen for the next execution.
Execution Time - This criterion deals with the time required for process to be executed by the control processing unit.
Medium term Scheduler - The scheduler handles swapped-out processes in scheduling
Virtual Memory Paging - This partitioning method processes the same as simple segmentation but has no internal fragmentation
Round Robin - This algorithm involves the generation of a clock interrupt at periodic intervals
Physical Addresses - This loader generates these addresses when a program is loaded into the main memory
Swapping - It is also known as memory compaction
Virtual Memory Paging - The partitioning method processes the same as simple paging but has no external fragmentation
Throughput - The criterion measures how much work is performed by the processor
Best – Fit - This placement algorithm chooses the block closest to the requested size in partitioning
Simple Segmentation - This Technique divides each process into several segments
Virtual Memory - It provides processes and a kernel with a private view of its main memory
True/False
True about long term Scheduling – it is also known as job scheduler
Not a requirement that memory management intends to satisfy? – The Act of a selecting as task or a job to be dispatched.
Which of the following best describes the shortest remaining time first algorithm?
- It is the estimated processing time to perform the selection function.
Which of the following statements is NOT considered a virtual memory characteristic?
- It provides fast access at a relatively high cost
Which of the following statements is TRUE about turnaround time?
- It is the difference between the finish time and the arrival time
What does fairness in scheduling mean?
- Process should be treated the same
Which of the following is NOT considered a scheduling criterion?
- The average rate of placement algorithm
Which of the following statements TRUE about response time?
- It is the time from submitting a request until the response is received
Which of the following statements is NOT TRUE about memory management?
-It Hold data that is in use
Which of the following statements is NOT TRUE about virtual memory segmentation?
-It is similar to simple paging
Which of the following statements is TRUE about dynamic partitioning?
-It has no Internal fragmentation
Which of the following statements is TRUE about fixed partitioning?
-It only produces a minimal operating system overhead.
Which of the following statements is TRUE about simple paging?
-It may cause a small amount of internal fragmentation.
Which of the following best describes the shortest job first algorithm?
-It is best approach to minimize the waiting time.
Which of the following statements is NOT TRUE about process scheduling?
-It divides CPU time among active processes and threads