McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Master of Science in Computer Science (MSc CS) .
| 1. |
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» D. all of the mentioned | |
| 2. |
To access the services of operating system, the interface is provided by the |
| A. | system calls |
| B. | api |
| C. | library |
| D. | assembly instructions |
| Answer» A. system calls | |
| 3. |
Which one of the following is not true? |
| A. | kernel is the program that constitutes the central core of the operating system |
| B. | kernel is the first part of operating system to load into memory during booting |
| C. | kernel is made of various modules which can not be loaded in running operating system |
| D. | kernel remains in the memory during the entire computer session |
| Answer» C. kernel is made of various modules which can not be loaded in running operating system | |
| 4. |
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» D. all of the mentioned | |
| 5. |
The scheme used in the above question is known as _______ or ________. |
| A. | sector sparing |
| B. | forwarding |
| C. | backwarding |
| D. | sector utilization |
| Answer» B. forwarding | |
| 6. |
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» C. both (a) and (b) | |
| 7. |
. 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» A. log file | |
| 8. |
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» A. dtrace | |
| 9. |
Which one of the following is not a real time operating system? |
| A. | vxworks |
| B. | windows ce |
| C. | rtlinux |
| D. | palm os |
| Answer» D. palm os | |
| 10. |
The OS X has |
| A. | monolithic kernel |
| B. | hybrid kernel |
| C. | microkernel |
| D. | monolithic kernel with modules |
| Answer» B. hybrid kernel | |
| 11. |
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» A. uniprogramming systems | |
| 12. |
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» D. all of the mentioned | |
| 13. |
In Unix, Which system call creates the new process? |
| A. | fork |
| B. | create |
| C. | new |
| D. | none of the mentioned |
| Answer» A. fork | |
| 14. |
A process can be terminated due to |
| A. | normal exit |
| B. | fatal error |
| C. | killed by another process |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 15. |
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» A. when process is scheduled to run after some execution | |
| 16. |
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» B. communication between two process | |
| 17. |
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» A. each process is blocked and will remain so forever | |
| 18. |
A process stack does not contain |
| A. | function parameters |
| B. | local variables |
| C. | return addresses |
| D. | pid of child process |
| Answer» D. pid of child process | |
| 19. |
Which system call returns the process identifier of a terminated child? |
| A. | wait |
| B. | exit |
| C. | fork |
| D. | get |
| Answer» A. wait | |
| 20. |
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» B. program counter | |
| 21. |
The number of processes completed per unit time is known as __________. |
| A. | output |
| B. | throughput |
| C. | efficiency |
| D. | capacity |
| Answer» B. throughput | |
| 22. |
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» D. the current activity of the process | |
| 23. |
The Process Control Block is : |
| A. | process type variable |
| B. | data structure |
| C. | a secondary storage section |
| D. | a block in memory |
| Answer» B. data structure | |
| 24. |
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» C. process table | |
| 25. |
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» D. the number of processes in memory | |
| 26. |
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» D. to maximize cpu utilization | |
| 27. |
Which of the following do not belong to queues for processes ? |
| A. | job queue |
| B. | pcb queue |
| C. | device queue |
| D. | ready queue |
| Answer» B. pcb queue | |
| 28. |
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» A. it is placed in an i/o queue | |
| 29. |
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» C. its process control block is de-allocated | |
| 30. |
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» A. it selects which process has to be brought into the ready queue | |
| 31. |
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» C. empty,little | |
| 32. |
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» C. it selects which process to remove from memory by swapping | |
| 33. |
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» B. it selects which process has to be executed next and allocates cpu | |
| 34. |
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» C. the frequency of their execution | |
| 35. |
The only state transition that is initiated by the user process itself is : |
| A. | block |
| B. | wakeup |
| C. | dispatch |
| D. | none of these |
| Answer» A. block | |
| 36. |
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» B. ready state | |
| 37. |
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» C. more than one process resides in the memory | |
| 38. |
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» B. ready state | |
| 39. |
An unrecoverable error is known as _________. |
| A. | hard error |
| B. | tough error |
| C. | soft error |
| D. | none of these |
| Answer» A. hard error | |
| 40. |
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» B. translation look-aside buffer | |
| 41. |
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» C. scheduler process | |
| 42. |
the access takes place, is called a(n) ____. |
| A. | shared memory segments |
| B. | entry section |
| C. | race condition |
| D. | process synchronization |
| Answer» C. race condition | |
| 43. |
Which of the following state transitions is not possible ? |
| A. | blocked to running |
| B. | ready to running |
| C. | blocked to ready |
| D. | running to blocked |
| Answer» A. blocked to running | |
| 44. |
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» A. dispatcher | |
| 45. |
The processes that are residing in main memory and are ready and waiting to execute are kept on a list called |
| A. | job queue |
| B. | ready queue |
| C. | execution queue |
| D. | process queue |
| Answer» B. ready queue | |
| 46. |
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» B. turnaround time | |
| 47. |
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» A. first-come, first-served scheduling | |
| 48. |
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» A. cpu is allocated to the process with highest priority | |
| 49. |
In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of |
| A. | all process |
| B. | currently running process |
| C. | parent process |
| D. | init process |
| Answer» B. currently running process | |
| 50. |
Time quantum is defined in |
| A. | shortest job scheduling algorithm |
| B. | round robin scheduling algorithm |
| C. | priority scheduling algorithm |
| D. | multilevel queue scheduling algorithm |
| Answer» B. round robin scheduling algorithm | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.