Explore topic-wise MCQs in Master of Science in Computer Science (M.Sc CS).

This section includes 332 Mcqs, each offering curated multiple-choice questions to sharpen your Master of Science in Computer Science (M.Sc CS) knowledge and support exam preparation. Choose a topic below to get started.

301.

the access takes place, is called a(n) ____.

A. shared memory segments
B. entry section
C. race condition
D. process synchronization
Answer» D. process synchronization
302.

Which of the following does not interrupt a running process ? (GATE CS 2001)

A. a device
B. timer
C. scheduler process
D. power failure
Answer» D. power failure
303.

Which of the following need not necessarily be saved on a context switch between processes ? (GATE CS 2000)

A. general purpose registers
B. translation look-aside buffer
C. program counter
D. all of these
Answer» C. program counter
304.

An unrecoverable error is known as _________.

A. hard error
B. tough error
C. soft error
D. none of these
Answer» B. tough error
305.

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

A. running state
B. ready state
C. suspended state
D. terminated state
Answer» C. suspended state
306.

In a multi-programming environment :

A. the processor executes more than one process at a time
B. the programs are developed by more than one person
C. more than one process resides in the memory
D. a single user can execute many programs at the same time
Answer» D. a single user can execute many programs at the same time
307.

In a time-sharing operating system, when the time slot given to a process is completed, the process goes from the running state to the :

A. blocked state
B. ready state
C. suspended state
D. terminated state
Answer» C. suspended state
308.

The only state transition that is initiated by the user process itself is :

A. block
B. wakeup
C. dispatch
D. none of these
Answer» B. wakeup
309.

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

A. the length of their queues
B. the type of processes they schedule
C. the frequency of their execution
D. none of these
Answer» D. none of these
310.

What is a short-term scheduler ?

A. it selects which process has to be brought into the ready queue
B. it selects which process has to be executed next and allocates cpu
C. it selects which process to remove from memory by swapping
D. none of these
Answer» C. it selects which process to remove from memory by swapping
311.

What is a medium-term scheduler ?

A. it selects which process has to be brought into the ready queue
B. it selects which process has to be executed next and allocates cpu
C. it selects which process to remove from memory by swapping
D. none of these
Answer» D. none of these
312.

If all processes I/O bound, the ready queue will almost always be ______, and the Short term Scheduler will have a ______ to do.

A. full,little
B. full,lot
C. empty,little
D. empty,lot
Answer» D. empty,lot
313.

What is a long-term scheduler ?

A. it selects which process has to be brought into the ready queue
B. it selects which process has to be executed next and allocates cpu
C. it selects which process to remove from memory by swapping
D. none of these
Answer» B. it selects which process has to be executed next and allocates cpu
314.

When a process terminates : (Choose Two)

A. it is removed from all queues
B. it is removed from all, but the job queue
C. its process control block is de-allocated
D. its process control block is never de-allocated
Answer» D. its process control block is never de-allocated
315.

When the process issues an I/O request :

A. it is placed in an i/o queue
B. it is placed in a waiting queue
C. it is placed in the ready queue
D. it is placed in the job queue
Answer» B. it is placed in a waiting queue
316.

Which of the following do not belong to queues for processes ?

A. job queue
B. pcb queue
C. device queue
D. ready queue
Answer» C. device queue
317.

The objective of multi-programming is to : (choose two)

A. have some process running at all times
B. have multiple programs waiting in a queue ready to run
C. to minimize cpu utilization
D. to maximize cpu utilization
Answer» E.
318.

The degree of multi-programming is :

A. the number of processes executed per unit time
B. the number of processes in the ready queue
C. the number of processes in the i/o queue
D. the number of processes in memory
Answer» E.
319.

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

A. process register
B. program counter
C. process table
D. process unit
Answer» D. process unit
320.

The Process Control Block is :

A. process type variable
B. data structure
C. a secondary storage section
D. a block in memory
Answer» C. a secondary storage section
321.

The state of a process is defined by :

A. the final activity of the process
B. the activity just executed by the process
C. the activity to next be executed by the process
D. the current activity of the process
Answer» E.
322.

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

A. output
B. throughput
C. efficiency
D. capacity
Answer» C. efficiency
323.

Which system call returns the process identifier of a terminated child?

A. wait
B. exit
C. fork
D. get
Answer» B. exit
324.

A process stack does not contain

A. function parameters
B. local variables
C. return addresses
D. pid of child process
Answer» E.
325.

A set of processes is deadlock if

A. each process is blocked and will remain so forever
B. each process is terminated
C. all processes are trying to kill each other
D. none of the mentioned
Answer» B. each process is terminated
326.

What is the ready state of a process?

A. when process is scheduled to run after some execution
B. when process is unable to run until some task has been completed
C. when process is using the cpu
D. none of the mentioned
Answer» B. when process is unable to run until some task has been completed
327.

A process can be terminated due to

A. normal exit
B. fatal error
C. killed by another process
D. all of the mentioned
Answer» E.
328.

The systems which allows only one process execution at a time, are called

A. uniprogramming systems
B. uniprocessing systems
C. unitasking systems
D. none of the mentioned
Answer» B. uniprocessing systems
329.

. If a process fails, most operating system write the error information to a

A. log file
B. another running process
C. new file
D. none of the mentioned
Answer» B. another running process
330.

By operating system, the resource management can be done via

A. time division multiplexing
B. space division multiplexing
C. both (a) and (b)
D. none of the mentioned
Answer» D. none of the mentioned
331.

The scheme used in the above question is known as _______ or ________.

A. sector sparing
B. forwarding
C. backwarding
D. sector utilization
Answer» C. backwarding
332.

What is operating system?

A. collection of programs that manages hardware resources
B. system service provider to the application programs
C. link to interface the hardware and application programs
D. all of the mentioned
Answer» E.