MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 557 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.
| 401. |
TestAndSet instruction is executed |
| A. | after a particular process |
| B. | periodically |
| C. | atomically |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 402. |
An un-interruptible unit is known as |
| A. | single |
| B. | atomic |
| C. | static |
| D. | none of the mentioned |
| Answer» C. static | |
| 403. |
In the bakery algorithm to solve the critical section problem |
| A. | each process is put into a queue and picked up in an ordered manner |
| B. | each process receives a number (may or may not be unique) and the one with the lowest number is served next |
| C. | each process gets a unique number and the one with the highest number is served next |
| D. | each process gets a unique number and the one with the lowest number is served next |
| Answer» C. each process gets a unique number and the one with the highest number is served next | |
| 404. |
A minimum of            variable(s) is/are required to be shared between processes to solve the critical section problem. |
| A. | one |
| B. | two |
| C. | three |
| D. | four |
| Answer» C. three | |
| 405. |
Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section |
| A. | after a process has made a request to enter its critical section and before the request is granted |
| B. | when another process is in its critical section |
| C. | before a process has made a request to enter its critical section |
| D. | none of the mentioned |
| Answer» B. when another process is in its critical section | |
| 406. |
A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called |
| A. | data consistency |
| B. | race condition |
| C. | aging |
| D. | starvation |
| Answer» C. aging | |
| 407. |
Mutual exclusion implies that |
| A. | if a process is executing in its critical section, then no other process must be executing in their critical sections |
| B. | if a process is executing in its critical section, then other processes must be executing in their critical sections |
| C. | if a process is executing in its critical section, then all the resources of the system must be blocked until it finishes execution |
| D. | none of the mentioned |
| Answer» B. if a process is executing in its critical section, then other processes must be executing in their critical sections | |
| 408. |
The segment of code in which the process may change common variables, update tables, write into files is known as |
| A. | program |
| B. | critical section |
| C. | non – critical section |
| D. | synchronizing |
| Answer» C. non – critical section | |
| 409. |
Concurrent access to shared data may result in |
| A. | data consistency |
| B. | data insecurity |
| C. | data inconsistency |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 410. |
The Zero Capacity queue |
| A. | is referred to as a message system with buffering |
| B. | is referred to as a message system with no buffering |
| C. | is referred to as a link |
| D. | none of the mentioned |
| Answer» C. is referred to as a link | |
| 411. |
In the Zero capacity queue |
| A. | the queue can store at least one message |
| B. | the sender blocks until the receiver receives the message |
| C. | the sender keeps sending and the messages don’t wait in the queue |
| D. | none of the mentioned |
| Answer» C. the sender keeps sending and the messages don’t wait in the queue | |
| 412. |
In indirect communication between |
| A. | there is another process r to handle and pass on the messages between p and q |
| B. | there is another machine between the two processes to help communication |
| C. | there is a mailbox to help communication between p and q |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 413. |
In the non blocking send |
| A. | the sending process keeps sending until the message is received |
| B. | the sending process sends the message and resumes operation |
| C. | the sending process keeps sending until it receives a message |
| D. | none of the mentioned |
| Answer» C. the sending process keeps sending until it receives a message | |
| 414. |
Which of the following are TRUE for direct communication? |
| A. | a communication link can be associated with n number of process(n = max. number of processes supported by system) |
| B. | a communication link can be associated with exactly two processes |
| C. | exactly n/2 links exist between each pair of processes(n = max. number of processes supported by system) |
| D. | exactly two link exists between each pair of processes |
| Answer» C. exactly n/2 links exist between each pair of processes(n = max. number of processes supported by system) | |
| 415. |
The link between two processes P and Q to send and receive messages is called |
| A. | communication link |
| B. | message-passing link |
| C. | synchronization link |
| D. | all of the mentioned |
| Answer» B. message-passing link | |
| 416. |
Messages sent by a process |
| A. | have to be of a fixed size |
| B. | have to be a variable size |
| C. | can be fixed or variable sized |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 417. |
Which of the following two operations are provided by the IPC facility? |
| A. | write & delete message |
| B. | delete & receive message |
| C. | send & delete message |
| D. | receive & send message |
| Answer» E. | |
| 418. |
Message passing system allows processes to |
| A. | communicate with one another without resorting to shared data |
| B. | communicate with one another by resorting to shared data |
| C. | share data |
| D. | name the recipient or sender of the message |
| Answer» B. communicate with one another by resorting to shared data | |
| 419. |
What is Inter process communication? |
| A. | allows processes to communicate and synchronize their actions when using the same address space |
| B. | allows processes to communicate and synchronize their actions without using the same address space |
| C. | allows the processes to only synchronize their actions without communication |
| D. | none of the mentioned |
| Answer» C. allows the processes to only synchronize their actions without communication | |
| 420. |
The child process completes execution, but the parent keeps executing, then the child process is known as |
| A. | orphan |
| B. | zombie |
| C. | body |
| D. | dead |
| Answer» C. body | |
| 421. |
In UNIX, each process is identified by its |
| A. | process control block |
| B. | device queue |
| C. | process identifier |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 422. |
Cascading termination refers to termination of all child processes before the parent terminates |
| A. | normally |
| B. | abnormally |
| C. | normally or abnormally |
| D. | none of the mentioned |
| Answer» B. abnormally | |
| 423. |
The child process can |
| A. | be a duplicate of the parent process |
| B. | never be a duplicate of the parent process |
| C. | cannot have another program loaded into it |
| D. | never have another program loaded into it |
| Answer» B. never be a duplicate of the parent process | |
| 424. |
A parent process calling            system call will be suspended until children processes terminate. |
| A. | wait |
| B. | fork |
| C. | exit |
| D. | exec |
| Answer» B. fork | |
| 425. |
Restricting the child process to a subset of the parent’s resources prevents any process from |
| A. | overloading the system by using a lot of secondary storage |
| B. | under-loading the system by very less cpu utilization |
| C. | overloading the system by creating a lot of sub-processes |
| D. | crashing the system by utilizing multiple resources |
| Answer» D. crashing the system by utilizing multiple resources | |
| 426. |
To enable a process to wait within the monitor |
| A. | a condition variable must be declared as condition |
| B. | condition variables must be used as boolean objects |
| C. | semaphore must be used |
| D. | all of the mentioned |
| Answer» B. condition variables must be used as boolean objects | |
| 427. |
A monitor is a module that encapsulates |
| A. | shared data structures |
| B. | procedures that operate on shared data structure |
| C. | synchronization between concurrent procedure invocation |
| D. | all of the mentioned |
| Answer» E. | |
| 428. |
Process synchronization can be done on |
| A. | hardware level |
| B. | software level |
| C. | both hardware and software level |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 429. |
When high priority task is indirectly preempted by medium priority task effectively inverting the relative priority of the two tasks, the scenario is called |
| A. | priority inversion |
| B. | priority removal |
| C. | priority exchange |
| D. | priority modification |
| Answer» B. priority removal | |
| 430. |
Mutual exclusion can be provided by the |
| A. | mutex locks |
| B. | binary semaphores |
| C. | both mutex locks and binary semaphores |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 431. |
A semaphore is a shared integer variable |
| A. | that can not drop below zero |
| B. | that can not be more than zero |
| C. | that can not drop below one |
| D. | that can not be more than one |
| Answer» B. that can not be more than zero | |
| 432. |
Which one of the following is a synchronization tool? |
| A. | thread |
| B. | pipe |
| C. | semaphore |
| D. | socket |
| Answer» D. socket | |
| 433. |
If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called? |
| A. | mutual exclusion |
| B. | critical exclusion |
| C. | synchronous exclusion |
| D. | asynchronous exclusion |
| Answer» B. critical exclusion | |
| 434. |
When several processes access the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called? |
| A. | dynamic condition |
| B. | race condition |
| C. | essential condition |
| D. | critical condition |
| Answer» C. essential condition | |
| 435. |
Which process can be affected by other processes executing in the system? |
| A. | cooperating process |
| B. | child process |
| C. | parent process |
| D. | init process |
| Answer» B. child process | |
| 436. |
Which of the following does not interrupt a running process? |
| A. | a device |
| B. | timer |
| C. | scheduler process |
| D. | power failure |
| Answer» D. power failure | |
| 437. |
Which of the following need not necessarily be saved on a context switch between processes? |
| A. | general purpose registers |
| B. | translation lookaside buffer |
| C. | program counter |
| D. | all of the mentioned |
| Answer» C. program counter | |
| 438. |
The context of a process in the PCB of a process does not contain |
| A. | the value of the cpu registers |
| B. | the process state |
| C. | memory-management information |
| D. | context switch time |
| Answer» E. | |
| 439. |
In a multiprogramming 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 | |
| 440. |
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 the mentioned |
| Answer» D. none of the mentioned | |
| 441. |
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 the mentioned |
| Answer» C. it selects which process to remove from memory by swapping | |
| 442. |
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 the mentioned |
| Answer» D. none of the mentioned | |
| 443. |
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 | |
| 444. |
What is a long-term scheduler? |
| A. | it selects processes which have to be brought into the ready queue |
| B. | it selects processes which have to be executed next and allocates cpu |
| C. | it selects processes which heave to remove from memory by swapping |
| D. | none of the mentioned |
| Answer» B. it selects processes which have to be executed next and allocates cpu | |
| 445. |
What will happen when a process terminates? |
| 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» B. it is removed from all, but the job queue | |
| 446. |
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 | |
| 447. |
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 | |
| 448. |
What is the objective of multiprogramming? |
| A. | have a process running at all time |
| B. | have multiple programs waiting in a queue ready to run |
| C. | to increase cpu utilization |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 449. |
A single thread of control allows the process to perform |
| A. | only one task at a time |
| B. | multiple tasks at a time |
| C. | only two tasks at a time |
| D. | all of the mentioned |
| Answer» B. multiple tasks at a time | |
| 450. |
What is the degree of multiprogramming? |
| 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. | |