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.
| 451. |
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 | |
| 452. |
What is a Process Control Block? |
| A. | process type variable |
| B. | data structure |
| C. | a secondary storage section |
| D. | a block in memory |
| Answer» C. a secondary storage section | |
| 453. |
Which of the following is not the state of a process? |
| A. | new |
| B. | old |
| C. | waiting |
| D. | running |
| Answer» C. waiting | |
| 454. |
The number of processes completed per unit time is known as |
| A. | output |
| B. | throughput |
| C. | efficiency |
| D. | capacity |
| Answer» C. efficiency | |
| 455. |
The address of the next instruction to be executed by the current process is provided by the |
| A. | cpu registers |
| B. | program counter |
| C. | process stack |
| D. | pipe |
| Answer» C. process stack | |
| 456. |
Which system call can be used by a parent process to determine the termination of child process? |
| A. | wait |
| B. | exit |
| C. | fork |
| D. | get |
| Answer» B. exit | |
| 457. |
What is interprocess communication? |
| A. | communication within the process |
| B. | communication between two process |
| C. | communication between two threads of same process |
| D. | none of the mentioned |
| Answer» C. communication between two threads of same process | |
| 458. |
Which facility dynamically adds probes to a running system, both in user processes and in the kernel? |
| A. | dtrace |
| B. | dlocate |
| C. | dmap |
| D. | dadd |
| Answer» B. dlocate | |
| 459. |
In Unix, Which system call creates the new process? |
| A. | fork |
| B. | create |
| C. | new |
| D. | none of the mentioned |
| Answer» B. create | |
| 460. |
In operating system, each process has its own |
| A. | address space and global variables |
| B. | open files |
| C. | pending alarms, signals and signal handlers |
| D. | all of the mentioned |
| Answer» E. | |
| 461. |
The systems which allow only one process execution at a time, are called |
| A. | uniprogramming systems |
| B. | uniprocessing systems |
| C. | unitasking systems |
| D. | none of the mentioned |
| Answer» C. unitasking systems | |
| 462. |
The OS X has |
| A. | monolithic kernel |
| B. | hybrid kernel |
| C. | microkernel |
| D. | monolithic kernel with modules |
| Answer» C. microkernel | |
| 463. |
Which one of the following is not a real time operating system? |
| A. | vxworks |
| B. | qnx |
| C. | rtlinux |
| D. | palm os |
| Answer» E. | |
| 464. |
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 | |
| 465. |
In Operating Systems, which of the following is/are CPU scheduling algorithms? |
| A. | round robin |
| B. | shortest job first |
| C. | priority |
| D. | all of the mentioned |
| Answer» E. | |
| 466. |
What is the main function of the command interpreter? |
| A. | to get and execute the next user-specified command |
| B. | to provide the interface between the api and application program |
| C. | to handle the files in operating system |
| D. | none of the mentioned |
| Answer» B. to provide the interface between the api and application program | |
| 467. |
Which one of the following error will be handle by the operating system? |
| A. | power failure |
| B. | lack of paper in printer |
| C. | connection failure in the network |
| D. | all of the mentioned |
| Answer» E. | |
| 468. |
To access the services of operating system, the interface is provided by the |
| A. | system calls |
| B. | api |
| C. | library |
| D. | assembly instructions |
| Answer» B. api | |
| 469. |
What is an operating system? |
| A. | collection of programs that manages hardware resources |
| B. | system service provider to the application programs |
| C. | interface between the hardware and application programs |
| D. | all of the mentioned |
| Answer» E. | |
| 470. |
Which of the following scheduling algorithms gives minimum average waiting time? |
| A. | fcfs |
| B. | sjf |
| C. | round – robin |
| D. | priority |
| Answer» C. round – robin | |
| 471. |
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 | |
| 472. |
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. | |
| 473. |
The FCFS algorithm is particularly troublesome for |
| A. | time sharing systems |
| B. | multiprogramming systems |
| C. | multiprocessor systems |
| D. | operating systems |
| Answer» C. multiprocessor systems | |
| 474. |
Which is the most optimal scheduling algorithm? |
| A. | fcfs – first come first served |
| B. | sjf – shortest job first |
| C. | rr – round robin |
| D. | none of the mentioned |
| Answer» C. rr – round robin | |
| 475. |
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 | |
| 476. |
Under multiprogramming, turnaround time for short jobs is usually                  and that for long jobs is slightly |
| A. | lengthened; shortened |
| B. | shortened; lengthened |
| C. | shortened; shortened |
| D. | shortened; unchanged |
| Answer» C. shortened; shortened | |
| 477. |
There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round- Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms? |
| A. | tq = 15ms |
| B. | tq = 40ms |
| C. | tq = 45ms |
| D. | tq = 50ms |
| Answer» B. tq = 40ms | |
| 478. |
What is Response time? |
| A. | the total time taken from the submission time till the completion time |
| B. | the total time taken from the submission time till the first response is produced |
| C. | the total time taken from submission time till the response is output |
| D. | none of the mentioned |
| Answer» C. the total time taken from submission time till the response is output | |
| 479. |
What is Waiting time? |
| A. | the total time in the blocked and waiting queues |
| B. | the total time spent in the ready queue |
| C. | the total time spent in the running queue |
| D. | the total time from the completion till the submission of a process |
| Answer» C. the total time spent in the running queue | |
| 480. |
What is Turnaround time? |
| A. | the total waiting time for a process to finish execution |
| B. | the total time spent in the ready queue |
| C. | the total time spent in the running queue |
| D. | the total time from the completion till the submission of a process |
| Answer» E. | |
| 481. |
Scheduling is done so as to |
| A. | increase cpu utilization |
| B. | decrease cpu utilization |
| C. | keep the cpu more idle |
| D. | none of the mentioned |
| Answer» B. decrease cpu utilization | |
| 482. |
The switching of the CPU from one process or thread to another is called |
| A. | process switch |
| B. | task switch |
| C. | context switch |
| D. | all of the mentioned |
| Answer» E. | |
| 483. |
In the following cases non – preemptive scheduling occurs? |
| A. | when a process switches from the running state to the ready state |
| B. | when a process goes from the running state to the waiting state |
| C. | when a process switches from the waiting state to the ready state |
| D. | all of the mentioned |
| Answer» C. when a process switches from the waiting state to the ready state | |
| 484. |
What is Dispatch latency? |
| A. | the speed of dispatching a process from running to the ready state |
| B. | the time of dispatching a process from running to ready state and keeping the cpu idle |
| C. | the time to stop one process and start running another one |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 485. |
An I/O bound program will typically have |
| A. | a few very short cpu bursts |
| B. | many very short i/o bursts |
| C. | many very short cpu bursts |
| D. | a few very short i/o bursts |
| Answer» D. a few very short i/o bursts | |
| 486. |
A process is selected from the              queue by the                  scheduler, to be executed. |
| A. | blocked, short term |
| B. | wait, long term |
| C. | ready, short term |
| D. | ready, long term |
| Answer» D. ready, long term | |
| 487. |
CPU scheduling is the basis of |
| A. | multiprocessor systems |
| B. | multiprogramming operating systems |
| C. | larger memory sized systems |
| D. | none of the mentioned |
| Answer» C. larger memory sized systems | |
| 488. |
What are the two steps of a process execution? |
| A. | i/o & os burst |
| B. | cpu & i/o burst |
| C. | memory & i/o burst |
| D. | os & memory burst |
| Answer» C. memory & i/o burst | |
| 489. |
With multiprogramming              is used productively. |
| A. | time |
| B. | space |
| C. | money |
| D. | all of the mentioned |
| Answer» B. space | |
| 490. |
Which one of the following can not be scheduled by the kernel? |
| A. | kernel level thread |
| B. | user level thread |
| C. | process |
| D. | none of the mentioned |
| Answer» C. process | |
| 491. |
Which algorithm is defined in Time quantum? |
| A. | shortest job scheduling algorithm |
| B. | round robin scheduling algorithm |
| C. | priority scheduling algorithm |
| D. | multilevel queue scheduling algorithm |
| Answer» C. priority scheduling algorithm | |
| 492. |
Process are classified into different groups in |
| A. | shortest job scheduling algorithm |
| B. | round robin scheduling algorithm |
| C. | priority scheduling algorithm |
| D. | multilevel queue scheduling algorithm |
| Answer» E. | |
| 493. |
The interval from the time of submission of a process to the time of completion is termed as |
| A. | waiting time |
| B. | turnaround time |
| C. | response time |
| D. | throughput |
| Answer» C. response time | |
| 494. |
In priority scheduling algorithm |
| A. | cpu is allocated to the process with highest priority |
| B. | cpu is allocated to the process with lowest priority |
| C. | equal priority processes can not be scheduled |
| D. | none of the mentioned |
| Answer» B. cpu is allocated to the process with lowest priority | |
| 495. |
Which module gives control of the CPU to the process selected by the short-term scheduler? |
| A. | dispatcher |
| B. | interrupt |
| C. | scheduler |
| D. | none of the mentioned |
| Answer» B. interrupt | |
| 496. |
Which scheduling algorithm allocates the CPU first to the process that requests the CPU first? |
| A. | first-come, first-served scheduling |
| B. | shortest job scheduling |
| C. | priority scheduling |
| D. | none of the mentioned |
| Answer» B. shortest job scheduling | |
| 497. |
The                calls certain procedures on remote systems and is used to perform synchronous or asynchronous interactions between systems. |
| A. | procedure |
| B. | rpc |
| C. | message oriented |
| D. | db |
| Answer» C. message oriented | |
| 498. |
What is the other name for object middleware? |
| A. | object request interface |
| B. | object enabled interface |
| C. | object request broker |
| D. | object enabled broker |
| Answer» D. object enabled broker | |
| 499. |
A type of middleware that allows for between the built-in applications and the real- time OS? |
| A. | firmware |
| B. | database middleware |
| C. | portals |
| D. | embedded middleware |
| Answer» E. | |
| 500. |
A software that lies between the OS and the applications running on it. |
| A. | firmware |
| B. | middleware |
| C. | utility software |
| D. | application software |
| Answer» C. utility software | |