MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 6 Mcqs, each offering curated multiple-choice questions to sharpen your Operating System knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
A solution to the problem of indefinite blockage of low priority processes is ____________ |
| A. | Starvation |
| B. | Wait queue |
| C. | Ready queue |
| D. | Aging |
| Answer» E. | |
| 2. |
What is Aging ? |
| A. | keeping track of cache contents |
| B. | keeping track of what pages are currently residing in memory |
| C. | keeping track of how many times a given page is referenced |
| D. | increasing the priority of jobs to ensure termination in a finite time |
| Answer» E. | |
| 3. |
Choose one of the disadvantages of the priority scheduling algorithm? |
| A. | it schedules in a very complex manner |
| B. | its scheduling takes up a lot of time |
| C. | it can lead to some low priority process waiting indefinitely for the CPU |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 4. |
An SJF algorithm is simply a priority algorithm where the priority is ____________ |
| A. | the predicted next CPU burst |
| B. | the inverse of the predicted next CPU burst |
| C. | the current CPU burst |
| D. | anything the user wants |
| Answer» B. the inverse of the predicted next CPU burst | |
| 5. |
Preemptive Shortest Job First scheduling is sometimes called ____________ |
| A. | Fast SJF scheduling |
| B. | EDF scheduling Earliest Deadline First |
| C. | HRRN scheduling Highest Response Ratio Next |
| D. | SRTN scheduling Shortest Remaining Time Next |
| Answer» E. | |
| 6. |
The real difficulty with SJF in short term scheduling is ____________ |
| A. | it is too good an algorithm |
| B. | knowing the length of the next CPU request |
| C. | it is too complex to understand |
| D. | none of the mentioned |
| Answer» C. it is too complex to understand | |