Operating System MCQ’s With answers-Chapter 11

Posted by

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

201. Semaphores
(A) are used to do I/O
(B) Synchronize critical resources to prevent contention
(C) synchronize critical resources to prevent deadlock.
(D) allow processes to communicate with one another.

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

203. Dijkstra’s banker’s algorithm in an operating-system solves the problem of
(A) deadlock avoidance
(B) deadlock recovery
(C) mutual exclusion
(D) context switching

204. Which structure prohibits the sharing of files and directories
(A) tree structure
(B) one level structure
(C) two level structure
(D) none of these

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

206. The portion of the process scheduler in an operating system that dispatches processes is concerned with
(A) activating suspended I/O-bound processes
(B) temporarily suspending processes when CPU load is too great
(C) assigning ready processes to the CPU
(D) all of the above

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

208. I/O redirection
(A) implies changing the name of a file
(B) can be employed to use an exiting file as input file for a program
(C) implies connection to programs through a pipe
(D) none of the above

209. When an interrupt occurs, an operating system
(A) ignores the interrupt
(B) always changes state of interrupted process after processing the interrupt
(C) always resumes execution of interrupted process after processing the interrupt
(D) may change state of interrupted process to blocked and schedule another process

210. Thrashing
(A) reduces page I/O
(B) decreases the degree of multiprogramming
(C) implies excessive page I/O
(D) improve the system performance

211. Dirty bit for a page in a page table
(A) helps avoid unnecessary writes on a paging device
(B) helps maintain LRU information
(C) allows only read on a page
(D) none of the above

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

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

214. 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 coprocessor
(D) is used only for limited, specific functions

215. Process is
(A) a program in high level language kept on disk
(B) contents of main memory
(C) a program in execution
(D) a job in secondary memory

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

217. Producer consumer problem can be solved using
(A) Semaphores
(B) Event counters
(C) Monitors
(D) All of the above

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

219. Moving process from main memory to disk is called
(A) Scheduling
(B) Cache
(C) Swapping
(D) Spooling

220. Banker’s algorithm for resource allocation deals with
(A) deadlock prevention
(B) deadlock avoidance
(C) deadlock recovery
(D) mutual exclusion

201. (C) 202. (A) 203. (A) 204. (D) 205. (A)
206. (C) 207. (B) 208. (B) 209. (D) 210. (C)
211. (A) 212. (B) 213. (C) 214. (D) 215. (C)
216. (A) 217. (D) 218. (A) 219. (C) 220. (B)