Operating System MCQ’s With answers-Chapter 14

Posted by

Operating System MCQ’s with answer,  100% free MCQ PDF DOWNLOAD

261. 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

262. 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

263. 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

264. 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

265. 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

266. 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

267. 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

268. 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

269. 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

270. Execution 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
(D) all of the above

271. In dynamic loading
(A) for better memory utilization use dynamic loading
(B) it does not requires special support from the operating system
(C) disadvantage is unused routine is never loaded
(D) all of the above

272. 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

273. 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

274. 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

275. 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

276. 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

277. The memory allocation scheme subject to external fragmentation is
(A) segmentation
(B) swapping
(C) pure demand paging
(D) multiple contiguous fixed partitions

278. 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

279. 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

280. 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


261. (C) 262. (A) 263. (B) 264. (A) 265. (A)
266. (B) 267. (D) 268. (A) 269. (B) 270. (C)
271. (D) 272. (C) 273. (D) 274. (B) 275. (C)
276. (A) 277. (A) 278. (A) 279. (B) 280. (C)