Operating System MCQ’s With answers-Chapter 13

Posted by

The "Answers" given with the Question is "not verified". To view Verified answers click on the button below.

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

242. Round robin is a
(A) kind of magnetic drum
(B) process scheduling policy
(C) process synchronization policy
(D) memory allocation policy

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

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

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

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

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

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

249. Shared sub-directories and files are example of
(A) cyclic graph directory
(B) tree structured direction
(C) one level directory
(D) none of these

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

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

252. Of the following which is the methods for allocating disks
(A) Contiguous
(B) Linked
(C) Indexed
(D) All of the above

253. External fragmentation solved by which allocation?
(A) contiguous allocation
(B) linked allocation
(C) index allocation
(D) both B and C

254. Which O/I are best method for allocating?
(A) Contiguous
(B) Linked
(C) Index
(D) All of the above

255. Allocate the first hole that is big enough is called
(A) first fit
(B) best fit
(C) worst fit
(D) all of the above

256. Allocate the smallest hole that. is big enough is called
(A) first fit
(B) best fit
(C) worst fit
(D) all of the above

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

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

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

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

241. (C) 242. (B) 243. (B) 244. (C) 245. (A)
246. (C) 247. (B) 248. (A) 249. (A) 250. (C)
251. (C) 252. (B) 253. (D) 254. (B) 255. (A)
256. (B) 257. (C) 258. (C) 259. (C) 260. (C)