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) .
| 51. |
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» D. multilevel queue scheduling algorithm | |
| 52. |
In multilevel feedback scheduling algorithm |
| A. | a process can move to a different classified ready queue |
| B. | classification of ready queue is permanent |
| C. | processes are not classified into groups |
| D. | none of the mentioned |
| Answer» A. a process can move to a different classified ready queue | |
| 53. |
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» B. user level thread | |
| 54. |
What is the reusable resource? |
| A. | that can be used by one process at a time and is not depleted by that use |
| B. | that can be used by more than one process at a time |
| C. | that can be shared between various threads |
| D. | none of the mentioned |
| Answer» A. that can be used by one process at a time and is not depleted by that use | |
| 55. |
Which of the following condition is required for deadlock to be possible? |
| A. | mutual exclusion |
| B. | a process may hold allocated resources while awaiting assignment of other resources |
| C. | no resource can be forcibly removed from a process holding it |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 56. |
A system is in the safe state if |
| A. | the system can allocate resources to each process in some order and still avoid a deadlock |
| B. | there exist a safe sequence |
| C. | both (a) and (b) |
| D. | none of the mentioned |
| Answer» C. both (a) and (b) | |
| 57. |
The circular wait condition can be prevented by |
| A. | defining a linear ordering of resource types |
| B. | using thread |
| C. | using pipes |
| D. | all of the mentioned |
| Answer» A. defining a linear ordering of resource types | |
| 58. |
Which one of the following is the deadlock avoidance algorithm? |
| A. | banker’s algorithm |
| B. | round-robin algorithm |
| C. | elevator algorithm |
| D. | karn’s algorithm |
| Answer» A. banker’s algorithm | |
| 59. |
What is the drawback of banker’s algorithm? |
| A. | in advance processes rarely know that how much resource they will need |
| B. | the number of processes changes as time progresses |
| C. | resource once available can disappear |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 60. |
For effective operating system, when to check for deadlock? |
| A. | every time a resource request is made |
| B. | at fixed time intervals |
| C. | both (a) and (b) |
| D. | none of the mentioned |
| Answer» C. both (a) and (b) | |
| 61. |
A problem encountered in multitasking when a process is perpetually denied necessary resources is called |
| A. | deadlock |
| B. | starvation |
| C. | inversion |
| D. | aging |
| Answer» B. starvation | |
| 62. |
Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence? |
| A. | resource allocation graph |
| B. | starvation graph |
| C. | inversion graph |
| D. | none of the mentioned |
| Answer» A. resource allocation graph | |
| 63. |
To avoid deadlock |
| A. | there must be a fixed number of resources to allocate |
| B. | resource allocation must be done only once |
| C. | all deadlocked processes must be aborted |
| D. | inversion technique can be used |
| Answer» A. there must be a fixed number of resources to allocate | |
| 64. |
CPU fetches the instruction from memory according to the value of |
| A. | program counter |
| B. | status register |
| C. | instruction register |
| D. | program status word |
| Answer» A. program counter | |
| 65. |
A memory buffer used to accommodate a speed differential is called |
| A. | stack pointer |
| B. | cache |
| C. | accumulator |
| D. | disk buffer |
| Answer» B. cache | |
| 66. |
Which one of the following is the address generated by CPU? |
| A. | physical address |
| B. | absolute address |
| C. | logical address |
| D. | none of the mentioned |
| Answer» C. logical address | |
| 67. |
Run time mapping from virtual to physical address is done by |
| A. | memory management unit |
| B. | cpu |
| C. | pci |
| D. | none of the mentioned |
| Answer» A. memory management unit | |
| 68. |
Memory management technique in which system stores and retrieves data from secondary storage for use in main memory is called |
| A. | fragmentation |
| B. | paging |
| C. | mapping |
| D. | none of the mentioned |
| Answer» B. paging | |
| 69. |
The address of a page table in memory is pointed by |
| A. | stack pointer |
| B. | page table base register |
| C. | page register |
| D. | program counter |
| Answer» B. page table base register | |
| 70. |
Program always deals with |
| A. | logical address |
| B. | absolute address |
| C. | physical address |
| D. | relative address |
| Answer» A. logical address | |
| 71. |
The page table contains |
| A. | base address of each page in physical memory |
| B. | page offset |
| C. | page size |
| D. | none of the mentioned |
| Answer» A. base address of each page in physical memory | |
| 72. |
What is compaction? |
| A. | a technique for overcoming internal fragmentation |
| B. | a paging technique |
| C. | a technique for overcoming external fragmentation |
| D. | a technique for overcoming fatal error |
| Answer» C. a technique for overcoming external fragmentation | |
| 73. |
Operating System maintains the page table for |
| A. | each process |
| B. | each thread |
| C. | each instruction |
| D. | each address |
| Answer» A. each process | |
| 74. |
In segmentation, each address is specified by : |
| A. | a segment number |
| B. | an offset |
| C. | a value |
| D. | a key |
| Answer» B. an offset | |
| 75. |
In paging the user provides only ________, which is partitioned by the hardware into ________ and ______. |
| A. | one address, page number, offset |
| B. | one offset, page number, address |
| C. | page number, offset, address |
| D. | none of these |
| Answer» A. one address, page number, offset | |
| 76. |
Each entry in a segment table has a : |
| A. | segment base |
| B. | segment peak |
| C. | segment limit |
| D. | segment value |
| Answer» C. segment limit | |
| 77. |
The segment base contains the : |
| A. | starting logical address of the process |
| B. | starting physical address of the segment in memory |
| C. | segment length |
| D. | none of these |
| Answer» B. starting physical address of the segment in memory | |
| 78. |
The segment limit contains the : |
| A. | starting logical address of the process |
| B. | starting physical address of the segment in memory |
| C. | segment length |
| D. | none of these |
| Answer» C. segment length | |
| 79. |
The offset ‘d’ of the logical address must be : |
| A. | greater than segment limit |
| B. | between 0 and segment limit |
| C. | between 0 and the segment number |
| D. | greater than the segment number |
| Answer» B. between 0 and segment limit | |
| 80. |
If the offset is legal : |
| A. | it is used as a physical memory address itself |
| B. | it is subtracted from the segment base to produce the physical memory address |
| C. | it is added to the segment base to produce the physical memory address |
| D. | none of these |
| Answer» A. it is used as a physical memory address itself | |
| 81. |
When the entries in the segment tables of two different processes point to the same physical location : |
| A. | the segments are invalid |
| B. | the processes get blocked |
| C. | segments are shared |
| D. | all of these |
| Answer» C. segments are shared | |
| 82. |
The protection bit is 0/1 based on : (choose all that apply) |
| A. | write only |
| B. | read only |
| C. | read – write |
| D. | none of these |
| Answer» C. read – write | |
| 83. |
If there are 32 segments, each of size 1Kb, then the logical address should have : |
| A. | 13 bits |
| B. | 14 bits |
| C. | 15 bits |
| D. | 16 bits |
| Answer» A. 13 bits | |
| 84. |
It uses a direct mapping scheme for cache management. How many different main memory blocks can map onto a given physical cache block ? |
| A. | 2048 |
| B. | 256 |
| C. | 64 |
| D. | 8 |
| Answer» C. 64 | |
| 85. |
A multilevel page table is preferred in comparison to a single level page table for translating virtual address to physical address because : |
| A. | it reduces the memory access time to read or write a memory location |
| B. | it helps to reduce the size of page table needed to implement the virtual address space of a process |
| C. | it is required by the translation look aside buffer |
| D. | it helps to reduce the number of page faults in page replacement algorithms |
| Answer» B. it helps to reduce the size of page table needed to implement the virtual address space of a process | |
| 86. |
The three general methods for delivering content from a server to a client across a network are : |
| A. | unicasting |
| B. | duplex-casting |
| C. | broadcasting |
| D. | multicasting |
| Answer» D. multicasting | |
| 87. |
Unicasting delivers the content to : |
| A. | a single client |
| B. | all clients, regardless whether they want the content or not |
| C. | a group of receivers who indicate they wish to receive the content |
| D. | none of these |
| Answer» A. a single client | |
| 88. |
Broadcasting delivers the content to : |
| A. | a single client |
| B. | all clients, regardless whether they want the content or not |
| C. | a group of receivers who indicate they wish to receive the content |
| D. | none of these |
| Answer» B. all clients, regardless whether they want the content or not | |
| 89. |
Multicasting delivers the content to : |
| A. | a single client |
| B. | all clients, regardless whether they want the content or not |
| C. | a group of receivers who indicate they wish to receive the content |
| D. | none of these |
| Answer» C. a group of receivers who indicate they wish to receive the content | |
| 90. |
RTSP stands for : |
| A. | real time streaming policy |
| B. | real time streaming protocol |
| C. | real time systems protocol |
| D. | read time streaming policy |
| Answer» B. real time streaming protocol | |
| 91. |
HTTP is __________. (choose two) |
| A. | a stateful protocol |
| B. | a stateless protocol |
| C. | a protocol that maintains the status of its connection with the client |
| D. | a protocol that does not maintain the status of its connection with the client |
| Answer» D. a protocol that does not maintain the status of its connection with the client | |
| 92. |
In the SETUP state : |
| A. | the server is setup |
| B. | the client is setup |
| C. | the server allocates resources for the client session |
| D. | the client sends requests to the server |
| Answer» C. the server allocates resources for the client session | |
| 93. |
In the TEARDOWN state : |
| A. | the server breaks down the connection and releases the resources allocated for the session |
| B. | the client breaks down the connection and releases the resources allocated for the session |
| C. | the system crashes |
| D. | none of these |
| Answer» A. the server breaks down the connection and releases the resources allocated for the session | |
| 94. |
RTP stands for : |
| A. | real time protocol |
| B. | real time transmission control protocol |
| C. | real time transmission protocol |
| D. | real time transport protocol |
| Answer» D. real time transport protocol | |
| 95. |
The problem with unicast delivery is that the : |
| A. | memory allocation is difficult |
| B. | server must establish a seperate unicast session for each client |
| C. | the routers must support unicasting |
| D. | the clients must be close to the server |
| Answer» B. server must establish a seperate unicast session for each client | |
| 96. |
The difficulty with multicasting from a practical point of view is : (choose all that apply) |
| A. | memory allocation is difficult |
| B. | server must establish a seperate unicast session for each client |
| C. | the routers must support multicasting |
| D. | the clients must be close to the server |
| Answer» D. the clients must be close to the server | |
| 97. |
To let a client have random access to a media stream : |
| A. | the protocol used must not be stateless |
| B. | the server must support download |
| C. | the stream should give access rights to the client |
| D. | all of these |
| Answer» A. the protocol used must not be stateless | |
| 98. |
The model in which one kernel thread is mapped to many user-level threads is called : |
| A. | many to one model |
| B. | one to many model |
| C. | many to many model |
| D. | one to one model |
| Answer» A. many to one model | |
| 99. |
The model in which one user-level thread is mapped to many kernel level threads is called : |
| A. | many to one model |
| B. | one to many model |
| C. | many to many model |
| D. | one to one model |
| Answer» B. one to many model | |
| 100. |
In the Many to One model, if a thread makes a blocking system call : |
| A. | the entire process will be blocked |
| B. | a part of the process will stay blocked, with the rest running |
| C. | the entire process will run |
| D. | none of these |
| Answer» A. the entire process will be blocked | |
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.