Process and Thread Management | Operating System MCQs

CoderIndeed
personCoderIndeed
May 05, 2022
0

  1. 1. ________ scheduler selects the jobs from the pool of jobs and loads into the ready queue.

    1. Long term
    2. Short term
    3. Medium term
    4. None of the above
    Show Answer
    Answer :     Option ( a )

  2. 2. _________ does the job of allocating a process to the processor.

    1. Long term scheduler
    2. Short term scheduler
    3. Medium term scheduler
    4. Dispatcher
    Show Answer
    Answer :     Option ( d )

  3. 3. A process can be ____________

    1. single-threaded
    2. multi-threaded
    3. Both single-threaded and multi-threaded
    4. None of above
    Show Answer
    Answer :     Option ( c )

  4. 4. A process can be terminated due to __________

    1. normal exit
    2. fatal error
    3. killed by another process
    4. All of the mentioned
    Show Answer
    Answer :     Option ( d )

  5. 5. A Process Control Block(PCB) does not contain which of the following :

    1. Bootstrap program
    2. Stack
    3. Process State
    4. I/O status information
    Show Answer
    Answer :     Option ( a )

  6. 6. An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is ________.

    1. First come First served scheduling algorithm
    2. Round robin scheduling algorithm
    3. Shortest job - first scheduling algorithm
    4. None of the above
    Show Answer
    Answer :     Option ( c )

  7. 7. CPU performance is measured through ________.

    1. Throughput
    2. MHz
    3. Flaps
    4. None of the above
    Show Answer
    Answer :     Option ( a )

  8. 8. FIFO scheduling is ________.

    1. Preemptive Scheduling
    2. Non Preemptive Scheduling
    3. Deadline Scheduling
    4. Fair share scheduling
    Show Answer
    Answer :     Option ( b )

  9. 9. In operating system, each process has its own __________

    1. address space and global variables
    2. open files
    3. pending alarms, signals and signal handlers
    4. All of the mentioned
    Show Answer
    Answer :     Option ( d )

  10. 10. In Priority Scheduling a priority number (integer) is associated with each process. The CPU is allocated to the process with the highest priority (smallest integer = highest priority). The problem of Starvation of low priority processes may never execute, is resolved by __________.

    1. Terminating the process
    2. Aging
    3. Mutual Exclusion
    4. Semaphore
    Show Answer
    Answer :     Option ( b )

  11. 11. In the blocked state, ____

    1. The process which is running is found
    2. The processes waiting for I/O are found
    3. The processes waiting for the processor are found
    4. None of the above
    Show Answer
    Answer :     Option ( b )

  12. 12. In Unix, Which system call creates the new process?

    1. fork
    2. create
    3. new
    4. first
    Show Answer
    Answer :     Option ( a )

  13. 13. Kernel threads

    1. cannot be supported and managed directly by the operating system
    2. can be supported and managed directly by the operating system
    3. are supported below the kernel and are managed without kernel support
    4. None of the above
    Show Answer
    Answer :     Option ( b )

  14. 14. Light weight process is called ___________

    1. thread
    2. tiny process
    3. small process
    4. stack
    Show Answer
    Answer :     Option ( a )

  15. 15. Most operating systems (including UNIX, Linux, and Windows) identify processes according to a unique __________

    1. process counter
    2. process state
    3. process number
    4. process identifier
    Show Answer
    Answer :     Option ( d )

  16. 16. Process control block (PCB) contains which of the following:

    1. List of open files
    2. Process state
    3. Process id
    4. All of the mentioned
    Show Answer
    Answer :     Option ( d )

  17. 17. Round robin scheduling falls under the category of ____________

    1. Non-preemptive scheduling
    2. Preemptive scheduling
    3. All of the mentioned
    4. None of the mentioned
    Show Answer
    Answer :     Option ( b )

  18. 18. Round robin scheduling is essentially the preemptive version of ________.

    1. First come First served scheduling algorithm
    2. Shortest job first scheduling algorithm
    3. Shortest remaining time next scheduling algorithm
    4. Non preemptive priority scheduling algorithm
    Show Answer
    Answer :     Option ( a )

  19. 19. Saving the state of the old process and loading the saved state of the new process is called ________.

    1. Context Switch
    2. State
    3. Multi programming
    4. None of the above
    Show Answer
    Answer :     Option ( a )

  20. 20. Suppose that a process is in “Blocked” state waiting for some I/O service. When the service is completed, it goes to the :

    1. Running state
    2. Ready state
    3. Suspended state
    4. Terminated state
    Show Answer
    Answer :     Option ( b )

  21. 21. The entry of all the PCBs of the current processes is in :

    1. Process Register
    2. Program Counter
    3. Process Table
    4. Process Unit
    Show Answer
    Answer :     Option ( c )

  22. 22. The list of processes waiting for a particular I/O device is called a________

    1. device queue
    2. ready queue
    3. job queue
    4. all of the mentioned
    Show Answer
    Answer :     Option ( a )

  23. 23. The number of processes completed per unit time is known as __________.

    1. Output
    2. Throughput
    3. Efficiency
    4. Capacity
    Show Answer
    Answer :     Option ( b )

  24. 24. The primary distinction between the short term scheduler and the long term scheduler is :

    1. The length of their queues
    2. The type of processes they schedule
    3. The frequency of their execution
    4. None of these
    Show Answer
    Answer :     Option ( c )

  25. 25. The Process Control Block is :

    1. Process type variable
    2. Data Structure
    3. A secondary storage section
    4. A block in memory
    Show Answer
    Answer :     Option ( b )

  26. 26. The processes that are residing in main memory and are ready and waiting to execute are kept on a list called the ______

    1. device queue
    2. ready queue
    3. job queue
    4. All of the mentioned
    Show Answer
    Answer :     Option ( c )

  27. 27. The ready queue is generally stored as a______

    1. Array
    2. Stack
    3. Linked List
    4. None of above
    Show Answer
    Answer :     Option ( c )

  28. 28. The state of a process is defined by :

    1. The final activity of the process
    2. The activity just executed by the process
    3. The activity to next be executed by the process
    4. The current activity of the process
    Show Answer
    Answer :     Option ( d )

  29. 29. The strategy of making processes that are logically runnable to be temporarily suspended is called ____________

    1. Non preemptive scheduling
    2. Preemptive scheduling
    3. Shortest job first
    4. First come First served
    Show Answer
    Answer :     Option ( b )

  30. 30. The systems which allow only one process execution at a time, are called __________

    1. uniprogramming systems
    2. uniprocessing systems
    3. unitasking systems
    4. None of the mentioned
    Show Answer
    Answer :     Option ( b )

  31. 31. Thread shares with other threads belonging to the same process its

    1. thread id
    2. program Counter
    3. register set and stack
    4. code section and data section
    Show Answer
    Answer :     Option ( d )

  32. 32. User threads _____

    1. are supported above the kernel and are managed without kernel support
    2. are supported below the kernel and are managed without kernel support
    3. are supported above the kernel and are managed with kernel support
    4. are supported below the kernel and are managed with kernel support
    Show Answer
    Answer :     Option ( a )

  33. 33. What is a long-term scheduler ?

    1. It selects which process has to be brought into the ready queue
    2. It selects which process has to be executed next and allocates CPU
    3. It selects which process to remove from memory by swapping
    4. None of these
    Show Answer
    Answer :     Option ( a )

  34. 34. What is a medium-term scheduler ?

    1. It selects which process has to be brought into the ready queue
    2. It selects which process has to be executed next and allocates CPU
    3. It selects which process to remove from memory by swapping
    4. None of these
    Show Answer
    Answer :     Option ( c )

  35. 35. What is a short-term scheduler ?

    1. It selects which process has to be brought into the ready queue
    2. It selects which process has to be executed next and allocates CPU
    3. It selects which process to remove from memory by swapping
    4. None of these
    Show Answer
    Answer :     Option ( b )

  36. 36. What is FIFO algorithm?

    1. First executes the job that came in last in the queue
    2. First executes the job that came in first in the queue
    3. First executes the job that needs minimal processor
    4. First executes the job that has maximum processor needs
    Show Answer
    Answer :     Option ( b )

  37. 37. What is the ready state of a process?

    1. When process is scheduled to run after some execution
    2. When process is unable to run until some task has been completed
    3. When process is using the CPU
    4. None of the mentioned
    Show Answer
    Answer :     Option ( a )

  38. 38. When the process issues an I/O request :

    1. It is placed in an I/O queue
    2. It is placed in a waiting queue
    3. It is placed in the ready queue
    4. It is placed in the Job queue
    Show Answer
    Answer :     Option ( a )

  39. 39. Which of the following algorithms tends to minimize the process flow time?

    1. First come First served
    2. Shortest Job First
    3. Earliest Deadline First
    4. Longest Job First
    Show Answer
    Answer :     Option ( b )

  40. 40. Which of the following is a criterion to evaluate a scheduling algorithm?

    1. CPU Utilization: Keep CPU utilization as high as possible
    2. Throughput: number of processes completed per unit time
    3. Waiting Time: Amount of time spent ready to run but not running
    4. All of the above
    Show Answer
    Answer :     Option ( d )

  41. 41. Which of the following is not the state of a process ?

    1. Blocked
    2. Old
    3. Ready
    4. Running
    Show Answer
    Answer :     Option ( b )

  42. 42. Which of the following Multithreading model has drawback "that creating a user thread requires creating the corresponding kernel thread".

    1. One to One
    2. One to Many
    3. Many to One
    4. Many to Many
    Show Answer
    Answer :     Option ( a )

  43. 43. Which of the following Multithreading model maps many user-level threads to one kernel thread.

    1. One to One
    2. One to Many
    3. Many to One
    4. Many to Many
    Show Answer
    Answer :     Option ( c )

  44. 44. Which of the following Multithreading model multiplexes many user-level threads to a smaller or equal number of kernel threads?

    1. One to One
    2. One to Many
    3. Many to One
    4. Many to Many
    Show Answer
    Answer :     Option ( d )

  45. 45. Which of the following state transitions is not possible ?

    1. Blocked to running
    2. Ready to running
    3. Blocked to ready
    4. Running to blocked
    Show Answer
    Answer :     Option ( a )

  46. 46. Which state of a process defined "Instructions are being executed"

    1. New
    2. Ready
    3. Running
    4. Blocked
    Show Answer
    Answer :     Option ( c )

  47. 47. Which state of a process defined "The process has finished execution"

    1. Exit
    2. Ready
    3. Running
    4. Blocked
    Show Answer
    Answer :     Option ( a )

  48. 48. Which state of a process defined "The process is being created"

    1. New
    2. Ready
    3. Running
    4. Blocked
    Show Answer
    Answer :     Option ( a )

  49. 49. With round robin scheduling algorithm in a time shared system ____________

    1. using very large time slices converts it into First come First served scheduling algorithm
    2. using very small time slices converts it into First come First served scheduling algorithm
    3. using extremely small time slices increases performance
    4. using very small time slices converts it into Shortest Job First algorithm
    Show Answer
    Answer :     Option ( a )

  50. 50. Which scheduling algorithm is non preemptive scheduling algorithm?

    1. First come First served
    2. Round Robin
    3. Shortest Remaining Time Next
    4. Preemptive Priority
    Show Answer
    Answer :     Option ( a )

  51. 51. Which scheduling algorithm is preemptive scheduling algorithm?

    1. First come First served
    2. Shortest job first
    3. Shortest Remaining Time Next
    4. Non Preemptive Priority
    Show Answer
    Answer :     Option ( c )

  52. 52. The interval from the time of submission of a process to the time of completion is termed as _______

    1. waiting time
    2. turnaround time
    3. response time
    4. throughput
    Show Answer
    Answer :     Option ( b )

  53. 53. In priority scheduling algorithm,

    1. CPU is allocated to the process with highest priority
    2. CPU is allocated to the process with lowest priority
    3. Equal priority processes can not be scheduled
    4. None of the mentioned
    Show Answer
    Answer :     Option ( a )

  54. 54. In preemptive priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of ______

    1. all process
    2. currently running process
    3. parent process
    4. init process
    Show Answer
    Answer :     Option ( b )

  55. 55. Time quantum is defined in _______

    1. shortest job scheduling algorithm
    2. priority scheduling algorithm
    3. round robin scheduling algorithm
    4. multilevel queue scheduling algorithm
    Show Answer
    Answer :     Option ( c )

  56. 56. A process is selected from the ______ queue by the ________ scheduler, to be executed.

    1. blocked, short term
    2. wait, long term
    3. ready, short term
    4. ready, long term
    Show Answer
    Answer :     Option ( c )

  57. 57. One of the disadvantages of the priority scheduling algorithm is that :

    1. It schedules in a very complex manner
    2. Its scheduling takes up a lot of time
    3. It can lead to some low priority process waiting indefinitely for the CPU
    4. None of these
    Show Answer
    Answer :     Option ( c )

  58. 58. Three CPU intensive processes requires 10, 20 and 30 time units and arrive at times 0, 2 and 6 respectively. The operating system implements a shortest remaining time next scheduling algorithm. Considering that the context switches at time zero and at the end are not counted the number of context switches are needed is ______.

    1. 4
    2. 3
    3. 2
    4. 1
    Show Answer
    Answer :     Option ( c )

  59. 59. On a single processor four jobs are to be executed. At time t = (0) + (jobs arrive in the order of A, B, C, D). The burst CPU time requirements are 4, 1, 8, 1 time units respectively. Under Round Robin Scheduling with the time slice of 1 time unit the completion time of A is ______."

    1. 3
    2. 5
    3. 7
    4. 9
    Show Answer
    Answer :     Option ( d )

  60. 60. ___________ is a technique of improving the priority of process waiting in Queue for CPU allocation.

    1. Starvation
    2. Ageing
    3. Revocation
    4. Relocation
    Show Answer
    Answer :     Option ( b )

  61. 61. Which of the following are the states of a five state process model? i) Running ii) Ready iii) New iv) Exit v) Destroy

    1. i, ii, iii and v only
    2. i, ii, iv and v only
    3. i, ii, iii, and iv only
    4. All i, ii, iii, iv and v
    Show Answer
    Answer :     Option ( c )

  62. 62. State which statement is true for Suspended process? i) The process is not immediately available for execution. ii) The process may be removed from suspended state automatically without removal order.

    1. i only
    2. ii only
    3. i and ii both
    4. None of the above
    Show Answer
    Answer :     Option ( a )

  63. 63. Following is/are the reasons for process suspension.

    1. Swapping parent process
    2. Interrupt request
    3. Timing
    4. All of the above
    Show Answer
    Answer :     Option ( d )

  64. 64. In process scheduling,________________ determines when new processes are admitted to the system.

    1. long term scheduling
    2. medium term scheduling
    3. short term scheduling
    4. None of the above
    Show Answer
    Answer :     Option ( a )

  65. 65. Five batch jobs A to E arrive at same time. They have estimated running times 10,6,2,4 and 8 minutes. Their priorities are 3,5,2,1 and 4 respectively with 5 being highest priority. In which sequence process will get turn to execute under non preemptive priority scheduling algorithm.

    1. ABCDE
    2. BEACD
    3. DCAEB
    4. EDCBA
    Show Answer
    Answer :     Option ( b )

  66. 66. Five batch jobs A to E arrive at same time. They have estimated running times 10,6,2,4 and 8 minutes. Their priorities are 3,5,2,1 and 4 respectively with 5 being highest priority. In which sequence process will get turn to execute under shortest job first scheduling algorithm.

    1. CDBEA
    2. ABCDE
    3. AEBDC
    4. EDCBA
    Show Answer
    Answer :     Option ( a )

  67. 67. Five batch jobs A to E arrive at same time. They have estimated running times 10,6,2,4 and 8 minutes. Their priorities are 3,5,2,1 and 4 respectively with 5 being highest priority. In which sequence process will get turn to execute under first come first serve scheduling algorithm.

    1. CDBEA
    2. ABCDE
    3. AEBDC
    4. EDCBA
    Show Answer
    Answer :     Option ( b )

  68. 68. Five batch jobs A to E arrive at 0,1,2,4,5. They have estimated running times 10,6,2,4 and 8 minutes. Their priorities are 3,5,2,1 and 4 respectively with 5 being highest priority. In which sequence process will get turn to execute under round robin scheduling algorithm for quantum time=4.

    1. ABCDE
    2. EDCBA
    3. ABCDEABEA
    4. ABCDEABEAB
    Show Answer
    Answer :     Option ( c )

  69. 69. Four batch jobs A to D arrive at same time. They have estimated running times 10,6,2 and 8 minutes. Their priorities are 3,2,1 and 4 respectively with 4 being highest priority. Which process will get turn first to execute under preemptive priority scheduling algorithm.

    1. A
    2. B
    3. C
    4. D
    Show Answer
    Answer :     Option ( d )

  70. 70. Four batch jobs A to D arrive at same time. They have estimated running times 10,6,2 and 8 minutes. Their priorities are 3,2,1 and 4 respectively with 4 being highest priority. Which process will get turn first to execute under shortest job first scheduling algorithm.

    1. A
    2. B
    3. C
    4. D
    Show Answer
    Answer :     Option ( c )
Tags

You may like these posts

Show more

Post a Comment

0Comments

Post a Comment (0)

#buttons=(Accept !) #days=(20)

Our website uses cookies to enhance your experience. Check Now
Accept !
Share to other apps
Copy Post Link