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.
| 201. |
In thread scheduling, load sharing is referred to |
| A. | Simultaneous scheduling of threads that make up a single process. |
| B. | Implicit scheduling defined by the assignment of threads to processors. |
| C. | A global queue of ready thread is maintained and each processor, when idle, selects a thread from queue. |
| D. | None of these. |
| Answer» D. None of these. | |
| 202. |
Turnaround time is defined as |
| A. | Delay between job submission and job completion |
| B. | A waiting time |
| C. | Both (A) and (B) above |
| D. | None of these |
| Answer» B. A waiting time | |
| 203. |
Instruction processing consists of |
| A. | Fetch cycle only |
| B. | Execution cycle only |
| C. | Fetch and Execution cycle both |
| D. | None of these. |
| Answer» D. None of these. | |
| 204. |
A Absolute loading B Re-locatable loading C Dynamic Run-Time loading; 1. For loader, load module, either is an absolute main memory address or specific address reference. 2. For loader, load modules have no absolute address. 3. For loader, load modules have all memory reference in relative form. |
| A. | A – 1, B – 2, C – 3 |
| B. | A – 2, B – 3 , C – 1 |
| C. | A – 1, B – 3, C – 2 |
| D. | A – 3, B – 2, C – 1 |
| Answer» B. A – 2, B – 3 , C – 1 | |
| 205. |
In disk scheduling, SCAN algorithm states |
| A. | The arm is required to move in one direction only. |
| B. | The arm can be moved in any direction. |
| C. | The arm is fix |
| Answer» B. The arm can be moved in any direction. | |
| 206. |
The lowest level of I/O control consists of |
| A. | device drivers |
| B. | interrupt handlers |
| C. | both A and B above |
| D. | none of the above |
| Answer» D. none of the above | |
| 207. |
The strategy of allowing process that are logically run able to be temporarily suspended is called |
| A. | preemptive scheduling |
| B. | non preemptive scheduling |
| C. | shortest job first |
| D. | first come first served |
| Answer» B. non preemptive scheduling | |
| 208. |
The wait operation |
| A. | Decrements the semaphore value |
| B. | Increments the semaphore value |
| C. | Fixes the semaphore value |
| D. | None of these. |
| Answer» B. Increments the semaphore value | |
| 209. |
The access time in disk scheduling is |
| A. | The time taken to position the head at the track. |
| B. | The time taken to reach the beginning of the sector of the track. |
| C. | The sum of seek time and rotational delay. |
| D. | None of these. |
| Answer» D. None of these. | |
| 210. |
For Load-time dynamic linking |
| A. | Load module (application module) to be loaded is read into memory. |
| B. | Some of the linking is postponed until execution time. |
| C. | External references to target modules remain in the loaded program. |
| D. | None of these. |
| Answer» B. Some of the linking is postponed until execution time. | |
| 211. |
Which O/I are best method for allocating? |
| A. | Contiguous |
| B. | Linked |
| C. | Index |
| D. | All of the above |
| Answer» C. Index | |
| 212. |
Shared sub-directories and files areexample of |
| A. | cyclic graph directory |
| B. | tree structured direction |
| C. | one level directory |
| D. | none of these |
| Answer» B. tree structured direction | |
| 213. |
Which structure prohibits the sharing of files and directories |
| A. | tree structure |
| B. | one level structure |
| C. | two level structure |
| D. | none of these |
| Answer» E. | |
| 214. |
A-Fixed-Head disk, B-Movable-Head disk, 1- One head per track and al head are mounted on rigid arm that extends across all tracks. 2- Only one head and head is mounted on the arm, such that it can position the track. |
| A. | A – 1, B – 2 |
| B. | A – 2, B – 1 |
| C. | A – 1, B – 1 |
| D. | A – 2, B – 2 |
| Answer» B. A – 2, B – 1 | |
| 215. |
Following is the correct definition of a valid process transition within an operating system |
| A. | wake up : ready – running |
| B. | dispatch: ready – running |
| C. | block: ready – blocked |
| D. | timer run out : ready – blocked |
| Answer» C. block: ready – blocked | |
| 216. |
With a segmentation, if there are 64 segments, and the maximum segment size is 512 words, the length of the logical address in bits is |
| A. | 12 |
| B. | 14 |
| C. | 15 |
| D. | 16 |
| Answer» D. 16 | |
| 217. |
If normalized turnaround time of different process are given. Then Highest response ratio next policy in uni processor scheduling policy selects |
| A. | The ready process with lowest normalized turnaround time. |
| B. | The ready process with highest normalized turnaround time. |
| C. | The process with shortest expected processing time. |
| D. | The process with highest expected processing time. |
| Answer» C. The process with shortest expected processing time. | |
| 218. |
With trap in process control |
| A. | Operating system determines the error or exception condition that is fatal. |
| B. | Operating system interrupted for maximum allowable time. |
| C. | Are tables that manage information process |
| D. | None of these. |
| Answer» B. Operating system interrupted for maximum allowable time. | |
| 219. |
Window 98 is a |
| A. | Single user system |
| B. | Multi user system |
| C. | Single tasking system |
| D. | None of these. |
| Answer» B. Multi user system | |
| 220. |
Which combination of the following features will suffice to characterize an OS as a multi programmed OS ?(i) More than one program may be loaded into main memory at the same time for execution.(ii) If a program waits for certain events such as I/O, another program is immediately scheduled for execution.(iii) If the execution of a program terminates, another program is immediately scheduled for execution. |
| A. | (i) only |
| B. | (ii) and (iii) |
| C. | (i) and (iii) |
| D. | (i), (ii) and (iii). |
| Answer» E. | |
| 221. |
The following RAID level employer parallel access technique and single redundant disk |
| A. | RAID level 0 |
| B. | RAID level 1 |
| C. | RAID level 2 |
| D. | RAID level 3 |
| Answer» E. | |
| 222. |
In uni-processor scheduling, if non- preemptive policy is applied 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 clock interrupt is generated at periodic intervals. |
| D. | None of these. |
| Answer» B. Currently running process can be interrupted and moved to ready state by the operating system. | |
| 223. |
Hard real-time tasks are |
| A. | A real time task that do not require dead line constraints. |
| B. | A real time task that requires dead line constraints. |
| C. | A task independent to time when it occurs. |
| D. | None of these. |
| Answer» C. A task independent to time when it occurs. | |
| 224. |
In two level scheme if each page is mapped by 4-byte (22) page table entry then to create a page table composed of 220 page table entry one requires |
| A. | 222 bytes |
| B. | 212 bytes |
| C. | 216 bytes |
| D. | None of these. |
| Answer» B. 212 bytes | |
| 225. |
Main memory is referred as |
| A. | Virtual memory |
| B. | Real memory |
| C. | A and B both |
| D. | None of these. |
| Answer» C. A and B both | |
| 226. |
Resident set of process is |
| A. | Portion of a process that is actually in main memory at any time. |
| B. | Portion of a process that is actually in virtually memory at any time. |
| C. | A and b both true. |
| D. | None of these. |
| Answer» B. Portion of a process that is actually in virtually memory at any time. | |
| 227. |
Access to moving head disks requires three periods of delay before information is brought into memory. The response that correctly lists the three time delays for the physical access of data in the order of the relative speed from the slowest to the fastest is |
| A. | latency time, cache overhead time, seek time |
| B. | transmission time, latency time, seek time |
| C. | seek time, latency time, transmission time |
| D. | cache overhead time, latency time, seek time |
| Answer» D. cache overhead time, latency time, seek time | |
| 228. |
Processor in computer |
| A. | Controls the operations of the computer/ processes data functions. |
| B. | Stores data and program. |
| C. | Moves data between computer and its external environment. |
| D. | None of these. |
| Answer» B. Stores data and program. | |
| 229. |
When operating system always run on a particular processor and that particular processor do all scheduling and process management then this is an example of |
| A. | Master/slave architecture |
| B. | Symmetric multiprocessor |
| C. | Cluster |
| D. | None of these. |
| Answer» B. Symmetric multiprocessor | |
| 230. |
In UNIX process management, the user processes runs in |
| A. | Kernel mode only |
| B. | Kernel and user mode both |
| C. | User mode only |
| D. | None of these. |
| Answer» C. User mode only | |
| 231. |
Match the following pairsA. Logical address(1) An actual location in main memoryB. Relative address(2) An address is expressed as a location relative to some known point.C. Physical address(3) A memory location independent of the current assignment of data to memory |
| A. | A – 3, B – 2, C–1 |
| B. | A – 2, B – 1, C – 3 |
| C. | A – 3, B – 1, C – 2 |
| D. | A – 1, B – 2, C – 3 |
| Answer» B. A – 2, B – 1, C – 3 | |
| 232. |
Par begin (P1) |
| A. | Suspends main program, execute procedure P1 and after execution resume main program. |
| B. | Procedure P1 is delayed infinitely due to other procedure are given preference. |
| C. | Procedure P1 is not considered for execution. |
| D. | None of these. |
| Answer» B. Procedure P1 is delayed infinitely due to other procedure are given preference. | |
| 233. |
105. The Least Recently Used (LRU) policy |
| A. | Replaces the page in memory that has not been referenced for the least time. |
| B. | Replaces the page in memory that has not been referenced for the longest time. |
| C. | Replaces the page in memory in round robin fashion. |
| D. | None of these. |
| Answer» B. Replaces the page in memory that has not been referenced for the longest time. | |
| 234. |
MAR (memory address register) |
| A. | Contains data to be written into memory. |
| B. | Contains data to be read from memory. |
| C. | Specifies location in memory for next read/or writer. |
| D. | Contains address of next instruction to be fetched. |
| Answer» D. Contains address of next instruction to be fetched. | |
| 235. |
A fetch policy for virtual memory determines |
| A. | When a page should be bought into main memory. |
| B. | Where in real memory a process piece is to be reside. |
| C. | The selection of a page in memory that is to replac |
| Answer» B. Where in real memory a process piece is to be reside. | |
| 236. |
A policy in memory management referred asclock policy because one can visualize the page frames as laid out in |
| A. | Straight line |
| B. | Rectangle |
| C. | Circle |
| D. | Square |
| Answer» D. Square | |
| 237. |
In RAID scheme, which of the RAID level doesnot use parity calculation in redundancy achievement |
| A. | RAID 4 |
| B. | RAID 3 |
| C. | RAID 2 |
| D. | RAID 1 |
| Answer» E. | |
| 238. |
Physical address (absolute address) in memory partitioning is |
| A. | Actual location in main memory |
| B. | A reference to memory location independent of current assignment |
| C. | A logical address |
| D. | None of these. |
| Answer» B. A reference to memory location independent of current assignment | |
| 239. |
OS/390 is a |
| A. | Single user system |
| B. | Multi user system |
| C. | Single tasking system |
| D. | None of these. |
| Answer» C. Single tasking system | |
| 240. |
A disk scheduling algorithm in an operating system causes the disk arm to seek back and forth access the disc surface servicing all request in its path, this is a |
| A. | first come first served |
| B. | shortest seek time first |
| C. | scan |
| D. | None of these |
| Answer» D. None of these | |
| 241. |
High paging rate |
| A. | may cause high I/O rate |
| B. | keeps the systems running well |
| C. | is a symptom of too much processor activity |
| D. | always creates a slow system |
| Answer» B. keeps the systems running well | |
| 242. |
CD defines |
| A. | Computer device |
| B. | Computer disk |
| C. | Compact disk |
| D. | None of these |
| Answer» D. None of these | |
| 243. |
I/O modules move data |
| A. | Between external environment and computer. |
| B. | In the computer main memory. |
| C. | In Processors |
| D. | None of these. |
| Answer» B. In the computer main memory. | |
| 244. |
The MS-DOS an operating system supports |
| A. | Single user process and multiple threads |
| B. | Multiple user process and single thread |
| C. | Single user process and single thread |
| D. | Multiple user processes and multiple threads. |
| Answer» D. Multiple user processes and multiple threads. | |
| 245. |
Physical address in memory management is |
| A. | Actual location in main memory |
| B. | Memory location independent of current assignment of data to memory. |
| C. | Memory location dependent to some known point. |
| D. | None of these. |
| Answer» B. Memory location independent of current assignment of data to memory. | |
| 246. |
Following is true for Multiprocessing |
| A. | It makes the operating system simpler |
| B. | It allows multiple processes to run simultaneously |
| C. | It allows the same computer to have multiple processors |
| D. | None of these |
| Answer» D. None of these | |
| 247. |
The volatility of a file refers to |
| A. | The number of records added or deleted from a file composed to the original number of records in that file |
| B. | Efficiency with which non-sequential files are processed |
| C. | The extent where the records of the file "are contiguous and in proximity to others |
| D. | Percentage of records that has changed" in a given time period |
| Answer» B. Efficiency with which non-sequential files are processed | |
| 248. |
In memory management when demand cleaning policy is applied |
| A. | A modified page is written before their page frames are needed to so that pages can be written out in batches. |
| B. | A page is written out to secondary memory only when it has been selected for replacement. |
| C. | A and B both true. |
| D. | None of these. |
| Answer» C. A and B both true. | |
| 249. |
Defective sectors on disks are often known as __________. |
| A. | good blocks |
| B. | destroyed blocks |
| C. | bad blocks |
| D. | none of these |
| Answer» D. none of these | |
| 250. |
A disk that has a boot partition is called a _________. (choose all that apply) |
| A. | start disk |
| B. | system disk |
| C. | boot disk |
| D. | all of these |
| Answer» D. all of these | |