MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
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.
| 151. |
A monitor program is a program that |
| A. | interprets the interrupt calls |
| B. | restores the status of the CPU after a function call |
| C. | interprets the input from a keyboard and converts the input into its binary equivalent |
| D. | checks the status of the I/O devices |
| Answer» D. checks the status of the I/O devices | |
| 152. |
In file management system the following communicate directly with periphing I/O devices. |
| A. | Device drives |
| B. | Basic file system |
| C. | Basic I/O supervisor |
| D. | Logical I/O. |
| Answer» B. Basic file system | |
| 153. |
Thread is |
| A. | Dispatch able unit of work |
| B. | Can be interrupted |
| C. | A and B both true |
| D. | A and B both false. |
| Answer» D. A and B both false. | |
| 154. |
Which of the RAID level does not employindependent access technique ? |
| A. | RAID 6 |
| B. | RAID 5 |
| C. | RAID 4 |
| D. | RAID 3 |
| Answer» E. | |
| 155. |
The memory allocation scheme subject to external fragmentation is |
| A. | segmentation |
| B. | swapping |
| C. | pure demand paging |
| D. | multiple contiguous fixed partitions |
| Answer» B. swapping | |
| 156. |
The record is the collection of |
| A. | Fields |
| B. | Files |
| C. | Data base |
| D. | None of these. |
| Answer» B. Files | |
| 157. |
The compaction is the technique in memory management that is used to over come |
| A. | Internal fragmentation |
| B. | External fragmentation |
| C. | Both (A) and (B) |
| D. | None of these. |
| Answer» C. Both (A) and (B) | |
| 158. |
The main memory of the computer |
| A. | Controls the operations of computer. |
| B. | Performs data processing functions. |
| C. | Stores data and programs. |
| D. | None of these. |
| Answer» D. None of these. | |
| 159. |
On magnetic disks, the data on the platter is organized in a concentric sets of rings called |
| A. | Sectors |
| B. | Gaps |
| C. | Rings |
| D. | Tracks |
| Answer» E. | |
| 160. |
When preemptive policy is applied to uni- processor scheduling then |
| A. | Once a process is in running state, it continues to execute until it terminates or block itself. |
| B. | Currently running process can be interrupted and moved to ready state by the operating system. |
| C. | The processes are assigned priorities. |
| D. | None of these. |
| Answer» C. The processes are assigned priorities. | |
| 161. |
In disk scheduling, the shortest service time first policy selects the disk request that |
| A. | In cure the maximum seek time |
| B. | In cure the minimum seek time |
| C. | Is received first |
| D. | Is received at last. |
| Answer» C. Is received first | |
| 162. |
When process is swapped out of main memory and put in a suspended state |
| A. | All of its resident pages are moved out. |
| B. | All of the pages that were previously in main memory are returned to main memory. |
| C. | Pages other than the one demanded by a page fault are bought in main memory. |
| D. | None of these. |
| Answer» B. All of the pages that were previously in main memory are returned to main memory. | |
| 163. |
The concept used to support multi programming environment on a computer is |
| A. | Virtual memory |
| B. | Hierarchy of physical memory |
| C. | Display of multiple windows |
| D. | None the above. |
| Answer» D. None the above. | |
| 164. |
In the following processes: a = a + 1; b = 2 × b; b = b + 1; a = 2 × a;the output is. |
| A. | a > b |
| B. | a < b |
| C. | a = b |
| D. | None of these. |
| Answer» E. | |
| 165. |
Compile time |
| A. | where the process will reside in memory, then absolute code can be generated |
| B. | where the process will reside in memory, then the compiler must generate relocatable code |
| C. | if the process can be moved during its execution from one memory segment to another,the binding must be delayed until run time |
| D. | all of the above |
| Answer» B. where the process will reside in memory, then the compiler must generate relocatable code | |
| 166. |
In file management, in the following record blocking method, the optional use of space is made, without unused space left |
| A. | Fixed blocking |
| B. | Variable-length spanned blocking |
| C. | Variable-length un-spanned blocking |
| D. | None of these. |
| Answer» C. Variable-length un-spanned blocking | |
| 167. |
In round robin (time slicing) policy applied on uni-processor scheduling |
| A. | When interrupt occurs, the currently running process is placed in ready queue, and next ready job is selected in First come First serve basis. |
| B. | When interrupt occurs, the currently running process is placed in ready queue and next ready job is selected in random order. |
| C. | No interruption is entertain |
| Answer» B. When interrupt occurs, the currently running process is placed in ready queue and next ready job is selected in random order. | |
| 168. |
The OS/2 is the operating system that support |
| A. | Single thread per process |
| B. | Multiple thread per process |
| C. | Single process |
| D. | None of these. |
| Answer» C. Single process | |
| 169. |
When pre cleaning policy is applied inmemory management |
| A. | A page is written out to secondary memory only when it has been selected for replacement. |
| B. | Modified pages are written before their page frames are needed so that can be written out in batches. |
| C. | A and B both true. |
| D. | None of these. |
| Answer» C. A and B both true. | |
| 170. |
The intensive jobs |
| A. | use less processor time than most jobs |
| B. | you are constrained by their I/O requirements |
| C. | run more quickly than processor- intensive jobs |
| D. | should all be executed at the same time |
| Answer» C. run more quickly than processor- intensive jobs | |
| 171. |
Windows XP is |
| A. | Uni-programming processes |
| B. | Multi programming processes |
| C. | Hardware |
| D. | None of these. |
| Answer» C. Hardware | |
| 172. |
Which of the following RAID level uses independent access technique and distributes the parity strips across all disks? |
| A. | Two |
| B. | Three |
| C. | Four |
| D. | Five |
| Answer» E. | |
| 173. |
In the simple paging in memory management where |
| A. | Process can be loaded into a partition of equal or greater size. |
| B. | Process is loaded into a partition of exactly same size. |
| C. | Process is divided into a number of equal size pages of same length as of frames. |
| D. | None of these. |
| Answer» D. None of these. | |
| 174. |
The real time task |
| A. | The tasks that reacts to events that take place in out side world. |
| B. | The tasks that do not reacts to the outside world events. |
| C. | The tasks are independent of the time when it occurs. |
| D. | None of these. |
| Answer» B. The tasks that do not reacts to the outside world events. | |
| 175. |
Following is not true for disk cache |
| A. | It is a buffer in main memory for disk sector |
| B. | It contains the copy of some of the sector on the disk |
| C. | It is bigger is size than main memory |
| D. | It is smaller is size than main memory |
| Answer» D. It is smaller is size than main memory | |
| 176. |
The master/slave architecture is an example of |
| A. | Distributed memory processing |
| B. | Shared memory processing |
| C. | Symmetric multi processing |
| D. | None of these. |
| Answer» C. Symmetric multi processing | |
| 177. |
In UNIX process management, the system process runs in |
| A. | Kernel mode only |
| B. | Kernel and user mode both |
| C. | User mode only |
| D. | None of these. |
| Answer» B. Kernel and user mode both | |
| 178. |
In Responsive real time operating system |
| A. | The interruption is acknowledge and operating system response to interrupt. |
| B. | Once the operation starts no interrupt is acknowledge. |
| C. | The operation completes in fixed inter of time. |
| D. | None of these. |
| Answer» B. Once the operation starts no interrupt is acknowledge. | |
| 179. |
The cluster is a case of |
| A. | Distributed memory |
| B. | Shared memory |
| C. | Master/slave architecture |
| D. | Symmetric multi processor. |
| Answer» B. Shared memory | |
| 180. |
Situations where two or more processes are reading or writing some shared data and the final result depends on who runs precisely which are called |
| A. | race condition |
| B. | critical sections |
| C. | mutual exclusions |
| D. | message passing |
| Answer» B. critical sections | |
| 181. |
In file management, the pile |
| A. | The collection of data in order which they arrive. |
| B. | A fixed format used for records. |
| C. | Records keep with some key sequence. |
| D. | None of these. |
| Answer» B. A fixed format used for records. | |
| 182. |
A Semaphore is initialized to |
| A. | Negative integer value |
| B. | Positive integer value |
| C. | Non-negative integer value |
| D. | Non-positive integer value. |
| Answer» D. Non-positive integer value. | |
| 183. |
Which of the following is an example of a spooled device? |
| A. | A line printer used to print the output of a number of jobs |
| B. | A terminal used to enter input data to a running program |
| C. | A secondary storage device in a virtual memory system |
| D. | A graphic display device |
| Answer» B. A terminal used to enter input data to a running program | |
| 184. |
Disaster recovery |
| A. | is needed by every installation |
| B. | is never needed |
| C. | varies in degree between installations |
| D. | requires off-site computer for immediate use |
| Answer» D. requires off-site computer for immediate use | |
| 185. |
Priorities |
| A. | are used to schedule processes |
| B. | increase as a process remains in the processor |
| C. | are attached to each page in the system |
| D. | are assigned by the user. |
| Answer» B. increase as a process remains in the processor | |
| 186. |
In round robin (time slicing) policy appliedon uni processor scheduling |
| A. | When interrupt occurs, the currently running process is placed in ready queue, and next ready job is selected in First come First serve basis. |
| B. | When interrupt occurs, the currently running process is placed in ready queue and next ready job is selected in random order. |
| C. | No interruption is entertain |
| Answer» B. When interrupt occurs, the currently running process is placed in ready queue and next ready job is selected in random order. | |
| 187. |
For file management, in file operationsdevice drivers are |
| A. | Disk drivers |
| B. | Tape drivers |
| C. | A and B both |
| D. | None of these. |
| Answer» D. None of these. | |
| 188. |
In magnetic disk, density that is in bits per linear inch |
| A. | Increases in moving from the outer most track to the inner most track. |
| B. | Decreases in moving from the outer most track to the inner most track. |
| C. | Remains same in moving from the outer most track to the inner most track. |
| D. | Randomly distributed in moving from the outer most track to the inner most track. |
| Answer» B. Decreases in moving from the outer most track to the inner most track. | |
| 189. |
In soft real time tasks |
| A. | The dead line is always mandatory. |
| B. | The dead line is desirable but not mandatory. |
| C. | The results are independent of the time, when it took place. |
| D. | None of these. |
| Answer» C. The results are independent of the time, when it took place. | |
| 190. |
Which is the correct definition of a valid process transition in an operating system? |
| A. | Wake up: ready ? running |
| B. | Dispatch: ready? running |
| C. | Block: ready ? running |
| D. | Timer runout : ready ? blocked |
| Answer» C. Block: ready ? running | |
| 191. |
In the pure User Level Threads (ULT)(i) Thread management is done by application, (ii) Thread management is done by kernel,(iii) Kernel is not aware of the existence of thread,(iv) Application program interface (API) to the kernel thread facility. |
| A. | i, iii are true |
| B. | i, ii and iii are true |
| C. | All are false |
| D. | None of these are true |
| Answer» B. i, ii and iii are true | |
| 192. |
In File system architecture which is the correct arrangement from lower level to higher. |
| A. | Device drives, basic file system, basic I/ O supervisor, logical I/O. |
| B. | Basic file system, basic I/O, logical I/O, device drives. |
| C. | Basic I/O, basic file system, logical I/O, device drives. |
| D. | None of these. |
| Answer» B. Basic file system, basic I/O, logical I/O, device drives. | |
| 193. |
Local replacement |
| A. | allows a process to select a replacement frame from the set of all frames |
| B. | requires that each process selects from only its own set of allocated frames |
| C. | both (A) and (B) above |
| D. | none of the above |
| Answer» C. both (A) and (B) above | |
| 194. |
The memory management, y one clock policy is applied then the page first loaded into a frame in memory its use bit is set to |
| A. | Zero |
| B. | One |
| C. | Two |
| D. | Three |
| Answer» C. Two | |
| 195. |
A set or resource allocations such that the system can allocate resources to each process in some order, and still avoids a deadlock is called |
| A. | unsafe state |
| B. | safe state |
| C. | starvation |
| D. | greedy allocation |
| Answer» C. starvation | |
| 196. |
In last- in-first- out, disk scheduling policy |
| A. | Recently received request is entertained at the last. |
| B. | Recently received request is entertained first. |
| C. | Requests are selected at random |
| D. | None of these. |
| Answer» C. Requests are selected at random | |
| 197. |
I/O modules in computer |
| A. | Controls the operation of the computer. |
| B. | Stores data and program. |
| C. | Move data between the computer and external environment. |
| D. | Provides communication among processors and main memory. |
| Answer» D. Provides communication among processors and main memory. | |
| 198. |
A set of resources allocations such that the system can allocate resources to each process is some order, and still avoid a dead lock is called |
| A. | unsafe state |
| B. | safe state |
| C. | Starvation |
| D. | Greedy allocation |
| Answer» C. Starvation | |
| 199. |
With round-robin CPU scheduling in a time shared system |
| A. | using very large time slices degenerates into First-Come First Served Algorithm |
| B. | using extremely small time slices improves performance |
| C. | using very small time slices degenerate into Last-In-First-Out algorithm |
| D. | using medium sized time slices leades to Shortest Request Time First algorithm. |
| Answer» B. using extremely small time slices improves performance | |
| 200. |
The Windows 2000, operating system supports |
| A. | Multiple user processes with single thread per process. |
| B. | Multiple processes with multiple thread per process. |
| C. | Single process with single thre |
| Answer» C. Single process with single thre | |