In this section of Operating System Process Management.it contain Operating System Process Management – Process Scheduling MCQs (Multiple Choice Questions Answers).All the MCQs (Multiple Choice Question Answers) requires in detail reading of Operating System subject as the hardness level of MCQs have been kept to advanced level.
 

1
. The objective of multi programming is
  • I. to have some process running at all times.
  • II. Single process should run at a time.
  • III. to maximize CPU utilization
  • IV. to minimize CPU utilization
  • I
  • II,III
  • I,III
  • I,IV
2
. For a single-processor system
  • I. there will never be more than one running process
  • II. if more processes, the rest will have to wait until the CPU is free and can be rescheduled.
  • III. it maximize the CPU utilization
  • IV. there will be more than one running process
  • I, II
  • II,III
  • I,III
  • I,IV
3
. The processes that are residing in main memory and are ready and waiting to execute are kept on a list called the
  • device queue
  • ready queue
  • job queue
  • None of the above
4
. The ready queue is generally stored as a______
  • Array
  • Stack
  • Linked List
  • None of the above
5
. Which of the following is True regarding A ready-queue header
  • IT contains pointers to the first and final PCBs in the list
  • IT contains pointers field that points to the next PCB in the ready queue
  • Only A is True
  • Both A and B
6
. The list of processes waiting for a particular I/O device is called a________
  • device queue
  • ready queue.
  • job queue
  • None of the above
7
. Once the process is allocated the CPU and is executing, which of several events could occur:
  • i. The process could issue an I/O request and then be placed in an I/O queue
  • ii. The process could create a new child process and wait for the child’s termination.
  • iii. The process could be removed forcibly from the CPU, as a result of an interrupt, and be put back in the ready queue.
  • Only 1
  • 1 and 2
  • 1, 2,3
  • 2 and 3
8
. At which time it is removed from all queues and has its PCB and resources deallocated.
  • The process could issue an I/O request and then be placed in an I/O queue
  • The process could create a new child process and wait for the child’s termination.
  • The process could be removed forcibly from the CPU, as a result of an interrupt, and be put back in the ready queue.
  • None of the Above
9
. For short-term scheduler Which of the following stands True
  • i. selects from among the processes that are ready to execute and allocates the CPU to one of them.
  • ii. selects processes from mass-storage device (typically a disk) and loads them into memory for execution.
  • iii. The short-term scheduler must select a new process for the CPU frequently.
  • iv. The short-term scheduler executes much less frequently.
  • 1 only
  • 2 and 3 only
  • 1 ,2 and 4 only
  • 1,3 only
10
. For Long-term scheduler which of the following stands true
  • i. The long-term scheduler executes much less frequently.
  • ii. Because of the longer interval between executions, the long-term scheduler can afford to take more time to decide which process should be selected for execution
  • iii. Because of the smaller interval between executions, the long-term scheduler can afford to take Less time to decide which process should be selected for execution
  • iv. The long-term scheduler executes More frequently.
  • 1,2 only
  • 1 only
  • 1 and 3 only
  • 1 ,2 and 3 only
11
. Which of the following is TRUE for An I/O-bound process.
  • i. is one that spends more of its time doing I/O
  • ii. is one that spends more of its time doing computations.
  • iii. If all processes are I/O bound, the ready queue will almost always be empty
  • iv. If all processes are I/O bound, the ready queue will almost always be Full
  • 1 only
  • 1 and 3 only
  • 2 and 4 only
  • 2 and 3 Only
12
. Which of the following is TRUE for CPU bound process?
  • i. is one that spends more of its time doing I/O
  • ii. is one that spends more of its time doing omputations.
  • iii. If all processes are CPU bound, the I/O waiting queue will almost always be empty
  • iv. If all processes are CPU bound, the I/O waiting queue will almost always be Full
  • 1 only
  • 1 and 3 only
  • 2 and 3 only
  • 2 and 4
13
. Copying a process from memory to disk to allow space for other processes is called
  • Swapping
  • Deadlock
  • Demand Paging
  • Page Fault
14
. The process is swapped out of memory, and is later swapped into memory, by the________
  • Long-term Scheduler
  • Short-term Scheduler
  • medium-term scheduler
  • None of the Above
15
. Switching the CPU to another process requires performing a state save of the current process and a state restore of a different process. This task is known as a ____________.
  • Swapping
  • context switch
  • Demand Paging
  • Page Fault

 
 
You may be interested in:
Operating System Online Tests
Operating System Short Questions Answers
Operating System Chapterwise Long Descriptive Questions Answers
Operating System Tutorials