McqMate
| 201. |
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» C. scan | |
| 202. |
An attached processor |
| A. | is used one only a few computers |
| B. | causes all processor to function equally |
| C. | is more difficult to implement than a co- processor |
| D. | is used only for limited, specific functions |
| Answer» D. is used only for limited, specific functions | |
| 203. |
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» A. race condition | |
| 204. |
Producer consumer problem can be solved using |
| A. | Semaphores |
| B. | Event counters |
| C. | Monitors |
| D. | All of the above |
| Answer» D. All of the above | |
| 205. |
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» A. preemptive scheduling | |
| 206. |
Moving process from main memory to disk is called |
| A. | Scheduling |
| B. | Cache |
| C. | Swapping |
| D. | Spooling |
| Answer» C. Swapping | |
| 207. |
Banker’s algorithm for resource allocation deals with |
| A. | deadlock prevention |
| B. | deadlock avoidance |
| C. | deadlock recovery |
| D. | mutual exclusion |
| Answer» B. deadlock avoidance | |
| 208. |
The dispatcher |
| A. | actually schedules the tasks into the processor |
| B. | is always very small and simple |
| C. | puts tasks in wait |
| D. | None of these |
| Answer» A. actually schedules the tasks into the processor | |
| 209. |
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» B. safe state | |
| 210. |
Processor-bound tasks |
| A. | use the processor more often |
| B. | use more processor time |
| C. | use less processor time |
| D. | always take longer to execute |
| Answer» B. use more processor time | |
| 211. |
The following resources can cause deadlocks |
| A. | Read only files |
| B. | Shared programs |
| C. | Printers |
| D. | All of the above Complex scheduling algorithms |
| Answer» C. Printers | |
| 212. |
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» B. you are constrained by their I/O requirements | |
| 213. |
The FIFO algorithm |
| A. | executes first the job that last entered the queue |
| B. | executes first the job that first entered the queue |
| C. | executes first the job with the least processor needs |
| D. | executes first the job that has been in the queue the longest |
| Answer» B. executes first the job that first entered the queue | |
| 214. |
Check pointing a job |
| A. | allows it to be completed successfully |
| B. | allows it to continue executing later |
| C. | prepares it for finishing |
| D. | occurs only when there is an error in it |
| Answer» B. allows it to continue executing later | |
| 215. |
Windows is an |
| A. | operating system |
| B. | operating environment |
| C. | user interface |
| D. | programming platform |
| Answer» C. user interface | |
| 216. |
Following is/are operating system used in computers |
| A. | MS-DOS |
| B. | OS/2 |
| C. | UNIX |
| D. | All of the above |
| Answer» D. All of the above | |
| 217. |
The following operating system writes through catches? |
| A. | UNIX |
| B. | DOS |
| C. | ULTRIX |
| D. | XENIX |
| Answer» B. DOS | |
| 218. |
Which is/are the most important features of Microsoft windows program? |
| A. | Windows |
| B. | Pull-down menus |
| C. | Icons |
| D. | All of the above |
| Answer» D. All of the above | |
| 219. |
Multiprocessing models have |
| A. | symmetric multiprocessing model |
| B. | asymmetric multiprocessing model |
| C. | both (A) and (B) above |
| D. | None of these |
| Answer» C. both (A) and (B) above | |
| 220. |
Real-time systems are |
| A. | primarily used on mainframe computers |
| B. | used for monitoring events as they occur |
| C. | used for program development |
| D. | used for real-time interactive users. |
| Answer» B. used for monitoring events as they occur | |
| 221. |
Multiprogramming systems |
| A. | are easier to develop than single programming systems |
| B. | execute each job faster |
| C. | execute more jobs in the same time period |
| D. | are used only one large mainframe computers |
| Answer» C. execute more jobs in the same time period | |
| 222. |
Virtual memory is |
| A. | simple to implement |
| B. | used on all major commercial operating systems |
| C. | less efficient in utilization of memory |
| D. | useful when fast I/O devices are not available |
| Answer» C. less efficient in utilization of memory | |
| 223. |
Memory management is |
| A. | not used in modern operating systems |
| B. | replaced with virtual memory on current systems |
| C. | not used on multiprogramming systems |
| D. | critical for even the simplest operating systems |
| Answer» B. replaced with virtual memory on current systems | |
| 224. |
Scheduling is |
| A. | allowing job to use the processor |
| B. | making proper use of processor |
| C. | Both A and B |
| D. | None of these |
| Answer» C. Both A and B | |
| 225. |
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» C. It allows the same computer to have multiple processors | |
| 226. |
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» C. interprets the input from a keyboard and converts the input into its binary equivalent | |
| 227. |
The process scheduler in the processor management unit |
| A. | gives all jobs to the job scheduler |
| B. | selects a job to run |
| C. | selects a process to run |
| D. | co-ordinates the process synchronization |
| Answer» C. selects a process to run | |
| 228. |
Round robin is a |
| A. | kind of magnetic drum |
| B. | process scheduling policy |
| C. | process synchronization policy |
| D. | memory allocation policy |
| Answer» B. process scheduling policy | |
| 229. |
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» B. Dispatch: ready? running | |
| 230. |
A critical section is a program segment |
| A. | which should run in a certain specified amount of time |
| B. | which avoids deadlocks |
| C. | where shared resources are accessed |
| D. | which must be enclosed by a pair of semaphore operations. |
| Answer» C. where shared resources are accessed | |
| 231. |
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» A. A line printer used to print the output of a number of jobs | |
| 232. |
A solution to the Dining Philosophers Problem which avoids deadlock is |
| A. | ensure that all philosophers pick up the left fork before the right fork. |
| B. | ensure that all philosophers pick up the right fork before the left fork. |
| C. | ensure that one particular philosopher picks up the left fork before the right fork, and all other philosophers pick up the right fork before the left fork. |
| D. | none of the above |
| Answer» C. ensure that one particular philosopher picks up the left fork before the right fork, and all other philosophers pick up the right fork before the left fork. | |
| 233. |
Locality of reference implies that the page reference being made by a process |
| A. | will always be to the page used in the previous page reference |
| B. | is likely to be to one of the pages used in the last few page references |
| C. | will always be to one of the pages existing in memory |
| D. | will always lead to a page fault |
| Answer» B. is likely to be to one of the pages used in the last few page references | |
| 234. |
The correct matching for the following pairs is - (A) Disk sucheduling, (1) Round robin, (B) Batch processing, (2) SCAN ,(C) Time sharing, (3) LIFO, (D) Interrupt processing, (4) FIFO, |
| A. | A-2, B-4, C-1, D-3 |
| B. | A-1, B-2, C-3, D-4 |
| C. | A-2, B-1, C-4, D-3 |
| D. | None of these |
| Answer» A. A-2, B-4, C-1, D-3 | |
| 235. |
Shared sub-directories and files are example of |
| A. | cyclic graph directory |
| B. | tree structured direction |
| C. | one level directory |
| D. | none of these |
| Answer» A. cyclic graph directory | |
| 236. |
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» C. both A and B above | |
| 237. |
Which type of design problem in file system |
| A. | how the file system should look to the user |
| B. | algorithm and data structure must be created to map the logical file system onto the secondary storage device |
| C. | Both A and B above |
| D. | none of the above |
| Answer» C. Both A and B above | |
| 238. |
Of the following which is the methods for allocating disks |
| A. | Contiguous |
| B. | Linked |
| C. | Indexed |
| D. | All of the above |
| Answer» B. Linked | |
| 239. |
External fragmentation solved by which allocation? |
| A. | contiguous allocation |
| B. | linked allocation |
| C. | index allocation |
| D. | both B and C |
| Answer» D. both B and C | |
| 240. |
Which O/I are best method for allocating? |
| A. | Contiguous |
| B. | Linked |
| C. | Index |
| D. | All of the above |
| Answer» B. Linked | |
| 241. |
Allocate the first hole that is big enough is called |
| A. | first fit |
| B. | best fit |
| C. | worst fit |
| D. | all of the above |
| Answer» A. first fit | |
| 242. |
Allocate the smallest hole that. is big enough is called |
| A. | first fit |
| B. | best fit |
| C. | worst fit |
| D. | all of the above |
| Answer» B. best fit | |
| 243. |
The most efficient data set organization is |
| A. | a sequential file |
| B. | an ISAM file |
| C. | variable depending upon the usage of the data set |
| D. | a partitioned data set |
| Answer» C. variable depending upon the usage of the data set | |
| 244. |
A partitioned data set is most used for |
| A. | storing program data |
| B. | storing ISAM files |
| C. | a program or source library |
| D. | storing backup information |
| Answer» C. a program or source library | |
| 245. |
Fragmentation of the file system |
| A. | can always be prevented |
| B. | occurs only if the file system is used improperly |
| C. | can be temporarily removed by compaction |
| D. | is a characteristic of all file systems |
| Answer» C. can be temporarily removed by compaction | |
| 246. |
File record length |
| A. | should always be fixed |
| B. | should always be variable |
| C. | depends upon the size of the file |
| D. | should be chosen to match the data character |
| Answer» C. depends upon the size of the file | |
| 247. |
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» C. varies in degree between installations | |
| 248. |
Wild-card specifies |
| A. | provide an easy way of finding groups of related files |
| B. | are only used when printing the contents of files |
| C. | can be used when writing a file |
| D. | allow several files to be read simultaneously |
| Answer» A. provide an easy way of finding groups of related files | |
| 249. |
The allocation map |
| A. | is used to store program data |
| B. | specifies which blocks are used by which file |
| C. | is updated by applications programs |
| D. | allows programs to erase files |
| Answer» B. specifies which blocks are used by which file | |
| 250. |
The activity of a file |
| A. | is a low percentage of number of records that are added to or deleted from a file |
| B. | is a measure of the percentage of existing records updated during a run |
| C. | refers to how closely the files fit into the allocated space |
| D. | is a measure of the number of records added or deleted from a file compassed with the original number of records |
| Answer» A. is a low percentage of number of records that are added to or deleted from a file | |
| 251. |
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» A. The number of records added or deleted from a file composed to the original number of records in that file | |
| 252. |
Which types of file organization are supported by magnetic tape? |
| A. | random files |
| B. | contiguous sequential file |
| C. | indexed sequential file |
| D. | all of the above |
| Answer» B. contiguous sequential file | |
| 253. |
Address Binding is defined as |
| A. | Compiler will typically bind these symbolic addresses to relocatable addressees |
| B. | Each binding is a mapping from one address space to another |
| C. | The linkage editor or loader win in turn bind these relocatable addresses to absolute addresses |
| D. | All of the above |
| Answer» D. All of the above | |
| 254. |
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» A. where the process will reside in memory, then absolute code can be generated | |
| 255. |
Load 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 memory |
| C. | if the process can be moved during its execution from one memory segment to another, then 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 memory | |
| 256. |
Fragmentation of the file system |
| A. | occurs only if the file system is used improperly |
| B. | can always be prevented |
| C. | can be temporarily removed by compaction |
| D. | is the characteristic of all files system |
| Answer» C. can be temporarily removed by compaction | |
| 257. |
Stub |
| A. | is included in the image for each library routine reference |
| B. | is small piece of code that indicates how to locate the appropriate memory resident library routine |
| C. | how to load the library if the routine is not already present |
| D. | all of the above |
| Answer» D. all of the above | |
| 258. |
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» B. requires that each process selects from only its own set of allocated frames | |
| 259. |
Thrashing |
| A. | the high paging activity |
| B. | is spending more time in paging than executing |
| C. | both A and B above |
| D. | none of the above |
| Answer» C. both A and B above | |
| 260. |
Thrashing can be avoided if |
| A. | the pages, belonging to the working set of the programs are in main memory |
| B. | the speed of CPU is increased |
| C. | the speed of I/O processor is increased |
| D. | all of the above |
| Answer» A. the pages, belonging to the working set of the programs are in main memory | |
| 261. |
The memory allocation scheme subject to external fragmentation is |
| A. | segmentation |
| B. | swapping |
| C. | pure demand paging |
| D. | multiple contiguous fixed partitions |
| Answer» A. segmentation | |
| 262. |
In virtual memory systems, dynamic address translation |
| A. | is the hardware necessary to implement paging |
| B. | stores pages at a specific location on disk |
| C. | is useless when swapping is used |
| D. | is the part of the operating system paging algorithm |
| Answer» A. is the hardware necessary to implement paging | |
| 263. |
Relocatable programs |
| A. | cannot be used with fixed partitions |
| B. | can be loaded almost anywhere in memory |
| C. | do not need a linker |
| D. | can be loaded only at one specific location |
| Answer» B. can be loaded almost anywhere in memory | |
| 264. |
Fixed partitions |
| A. | are very common in current operating systems |
| B. | are very efficient in memory utilization |
| C. | are very inefficient in memory utilization |
| D. | are most used on large mainframe operating systems |
| Answer» C. are very inefficient in memory utilization | |
| 265. |
Virtual system swapping |
| A. | allocates all of memory to one program |
| B. | pages working set pages in and out as a group |
| C. | is never as efficient as normal paging |
| D. | is used only on systems that are thrashing |
| Answer» D. is used only on systems that are thrashing | |
| 266. |
The term paging refers to |
| A. | boosting up the priority of a process in multilevel of queues without feedback |
| B. | gradually increasing the priority of jobs that wait in the system for a long time to remedy infinite blocking |
| C. | keeping track of the time a page has been in memory for the purpose of LRU replacement |
| D. | letting job reside in memory for a certain amount of time, so that the number of pages required can be estimated accurately |
| Answer» B. gradually increasing the priority of jobs that wait in the system for a long time to remedy infinite blocking | |
| 267. |
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» C. 15 | |
| 268. |
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» A. may cause high I/O rate | |
| 269. |
The total time to prepare a disk drive mechanism for a block of data to be read from it is |
| A. | seek time |
| B. | Latency |
| C. | latency plus seek time |
| D. | transmission time |
| Answer» C. latency plus seek time | |
| 270. |
Following illustrates Associative Memory |
| A. | The address of the data is supplied by the user |
| B. | Same as the tracks associated with disk memory |
| C. | No need for address; information is used as address |
| D. | Data is accessed serially |
| Answer» C. No need for address; information is used as address | |
| 271. |
A disk scheduling algorithm in an operating system causes the disk arm to seek back and forth across the disk surface servicing all requests in its path, based on |
| A. | First Come First Served |
| B. | Shortest Seek Time First |
| C. | Sean |
| D. | None of these |
| Answer» C. Sean | |
| 272. |
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» C. seek time, latency time, transmission time | |
| 273. |
An unpaged cache associates disk domains with the address of the read and continues for a specific length. The major disadvantage of unpaged cache is that |
| A. | it allows cache domain to contain redundant data |
| B. | it does not allow writes to be cached |
| C. | its access time is greater than that of paged caching |
| D. | read ahead cache domain blocks are necessarily fixed in size |
| Answer» A. it allows cache domain to contain redundant data | |
| 274. |
UNIX recognizes following I/O devices |
| A. | Disk and Tape drives |
| B. | Terminals |
| C. | Communication lines |
| D. | All the above. |
| Answer» D. All the above. | |
Done Reading?