OPERATING SYSTEM

1. _______________________acts as mediator between user and hardware recourses 2. _____________________________are the user applications that perform some useful task to the user 3. Operating system upon booting takes the control of _______________________of the computer 4. Mainly operating systems does the 2 roles they are___________________and _______________ 5. Operating systems is made up of __________________major components and they are__________________ 6. _______________________is the central part or core of the operating system 7. _______________________is the portion of operating system that is loaded into ram during boot sequence and runs till system is shut down 8. Shell forms command interpreter part of the operating system. It takes __________________from the user and translates it for the ______________ 9. ________________________are the software embedded into operating system to enhance the functionality 10. Necessary features that designer of the operating system should have in mind are called. 11. ______________________________and _____________________are main system goals 12. Order which jobs in the queues are executed is determined by . 13. Multiprogramming organizes jobs in such a way that CPU always has.. 14. ______________________is the feature of operating system that allows efficient usage of system resources

15. ____________________________is the feature of operating system CPU switches between various tasks. 16. Response time refers to the duration a process has to wait in the ________________________to get first response fro CPU. 17. __________________________refers to the portion of hard disk space that operating system uses as it was ram 18. Todays advanced file systems are______________________________ 19. Parallel systems are also called as_____________________ 20. A system with ore than one processor share ________________________________ 21. Communication between processors in a multiprocessing system takes place through _____________________ they share. 22. Multiprocessor system provide us great __________________________ 23. Distributed systems are also called as__________________________ 24. Systems that communicate with the memory are_____________________ 25. Mainly three types of networks are available they are_______________they are distinguished mainly on _________________________________ 26. Collection of independent systems each having its own resource is____________________ 27. LAN networks mainly use _______________________as transmission media 28. In most cases the transmission media of MAN consists of__________________________. 29. The WANs use_______________________as transmission media 30. A process is __________________________in execution 31. ___________________________is a passive entity and____________________is an active entity. 32. Process termination requires ____________________of any reusable resources

33. ____________________________process has one program counter specifying location of next executable instruction 34. Multi threaded processes have one_____________________per thread 35. A _______________________is an instance of process under execution 36. _________________________stores the address of next instruction to be fetched. 37. The processes that are very critical for smooth running of the operating systems are called _______________________processes 38. Processes that are initiated by user are called________________processes 39. ____________________________provides mechanism for deadlock handling 40. _________________________Process is suspended by operating system to make a way for_______________ 41. The processes or threads running together do not interfere with each other while sharing resources this phenomenon is called__________________ 42. _____________________________refers to the process of communication between various running processes 43. A set of processes is said be________________________when each process is waiting for resource held by other. 44. Temporarily taking memory space from the process or resource is called_____________________ 45. Operating system locally organize data on a storage medium in the for of ________________ 46. _________________________is defined as the way operating system organize data on a storage medium 47. Files in the storage medium are organized into.. 48. We backup files onto.type of storage medium.

49. _____________________refers to the mechanism used by operating system which specify who can access which files 50. ____________________process involves creating duplicate copy of critical data on to magnetic disk 51. Discs are used to store the data for____________________period of time 52. WORM means _______________________and RW indicates __________________type of memory. 53. __________________________are the examples of storage medium whose performance do not effect overall performance 54. Operating system hides __________________________of the hardware from user. 55. Buffering is the process of _______________________________ 56. Caching is the process of 57. The overlapping of one job with input of other jobs is process of _________________________ 58. SPOOL is an acronym for__________________________________ 59. Spooling refers to transferring data by placing it temporarily until a program is ready to _____________ 60. Printing uses ____________________mechanism 61. The main difference between spooling and caching is______________________ 62. Small pieces of code that facilitate communication between operating system and hardware device is_____________________ 63. ___________________are used to make devices operating system compatible 64. Operating system has several inherent _________________and ______________features. 65. Controlling access to system and its resources done by_________________ mechanism of operating system.

66. Internal and external attacks can be defended by ______________________mechanism of operating system. 67. _________________are few examples that can breach systems security. 68. Enhancing users rights is done with_______________ 69. A file can be given to which user or a group is determined by______________________ 70. _________________________is a set of malicious code or program that can harm computer 71. The mechanism that protects internal or confidential networks from insecure public access is called__________________________ 72. The ____________________server provides an interface to client to request services 73. File server provides interface for clients to______________________________ 74. Home networks today are mostly________________________________ 75. The 2 main computing models that evolve over a period of time are______________________ 76. Client server models are extensively used in __________________environments 77. Client server computing model is used where________________administration is required 78. __________________model of computing environment is described as another model of distributed system 79. In peer to peer environment a node can act as ______________________________ 80. In order to join peer to peer network a node must register itself with ____________________on network 81. Another way a node can join peer to peer model is to broadcast request for service and respond to requests via ______________________ 82. Some of the main examples of peer to peer computing environments are________________

83. Peer to peer model is cumbersome in large network environments as it does not have____________________________ 84. ___________________________are new category devices to manage web traffic among several servers 85. Load balancers ____________________the web traffic among identical servers 86. If load balancers are not used then there is a chance for single sever to get overwhelmed with________________________ 87. ________________________________is a mechanism used by application program to request services from operating system 88. System calls can be categorized into ____________________number of categories and they are______________ 89. Some of the popular system calls of UNIX or posix based systems are______________________ 90. Operating system provide _____________________on which applications can run. 91. Main difficulty for operating system program is to make it follow____________________ 92. Failing to follow time constraints can lead to ______________________________________ 93. The interconnection of LAN, MAN and WAN is __________________________________ 94. Excessive integration of application programming tools into operating system can lead to____________ 95. In UNIX in order to start new process we should use the system call __________________and to run the new process it should succeed_____________system call. 96. The call that is capable of closing current executing process is__________________ 97. _____________________call overlays new process 98. In _________________kind of operating system user dont have direct access to computer

99. A piece of code that first loads into memory and which access system resources in batch operating system is ______________________ 100. In ______________operating system loads several programs simultaneously into memory 101. _______________________kind of operating is efficient than_______________________ 102. __________________________operating systems see frequent CPU switching 103. In _______ operating systems CPU time is judiciously divided between existing processes. 104. In time sharing system operating system allocates the CPU time to uses job in short______________________ 105. Example of operating systems that support multiple users__________________________ 106. _________________________________is an example operating system which support both single and multiple users. 107. A computing program that translates assembly language to object code is___________________ 108. _________________ converts source to machine understandable language. 109. _____________________converts user commands to kernel understandable instructions 110. A node that requests for services over network is called ____________________and that responds to the requests is_______________________ 111. Process of saving the PCB of one process and loading other is called__________________ 112. _________________________gives control of CPU to the process selected by short term scheduler 113. The way operating system organize data on a storage media is called _________________famous of them were 114. A ____________________contains memory that is dynamically allocated during runtime process. 115. Excessive aging activity that degrades system performance is called___________________

116. An illusory memory that operating system creates to make program believe there exists bigger memory than ram is___________________ 117. _________________________can be described as core of operating system 118. _________________________component that takes job from job queue to ready queue 119. ____________is the property of operating system to run several processes concurrently 120. ____________________________is the ability of operating system to rapidly switch tasks 121. Collection of instructions on a disk is called_______________________________ 122. __________________________is the portion of memory that stores temporary data. 123. Short term scheduler picks processes from_______________________queue 124. An instance of running process is ____________________________ 125. Thread can be described as_______________________ 126. Time taken to execute a process is called______________________time 127. Time taken for a process request and to get response is called______________________ 128. The sum of total times that a process sends waiting is called_____________________ 129. The critical management functions that operating system performs to manage memory resources is_________________________ 130. ____________________________sits between main memory and CPU registers. 131. Program in most of the cases resides on_________________________memory 132. CPU can access________________________only indirectly 133. Any access that CPU makes to its internal registers is of __________________cycle 134. Main memory takes many clock pulses because its ____________________to CPU 135. the most frequently used instructions are stored in a memory called__________________ 136. _______________memory is fast and easily accessible enhancing performance of system 137. Each running process resides in its own ______________following protection mechanism 138. Both program and data are stored in__________________________

139. Memory consists of ____________________________each with its own address. 140. ____________and ___________form first and last steps of CPU fetch and execute cycle. 141. ________, _______ and ___________form 2nd 3rd and 4th steps of CPU fetch and execute cycle. 142. Each process runs in its ____________________of memory 143. The concept of logical address that is_______________________to physical address is central to memory management. 144. ____________register mars the beginning of the process and _____________register mars the limit of the process. 145. CPU works in ______________________address space 146. Memory refers to the_______________address space 147. _____________________maps logical address to physical address. 148. ________________register provides base address for a process bloc of physical memory 148. The address generated by CPU during during process execution is____________________ 149. The actual address of physical or main memory is________________________ 150. __________is added to relocation register to get ________by memory management unit. 151. The term ______________refers to replacing a process with needed in the memory

152. The swapping of a process is done when process in memory is _________ or ___________ or ___________. 153. When ________play important role in swapping we use key words swap in and swap out in replacing 154. When _________________lay important role in swapping we use keywords role in and role out in replacing 155. _______________________is one solution for external fragmentation problem.

156. We have mainly __________ memory allocation schemes they are_______________ 157. Simplest memory allocation method is_______________________ 158. In __________memory allocation, the entire available bloc is considered one unit and is called____________. 159. The process of allocating memory wherever it is available is called __________ allocation. 160. We divide physical memory into fixed sized blocks called__________________ 161. We divide logical memory into blocs of equal size called_______________________ 162. To run a process of size n pages we need______________________free frames 163. Every logical address generated by CPU consists of _____________and_____________ 164. Problem of external fragmentation occurs in _____________kind of memory allocation. 165. _____________is one of the solution for external fragmentation but practically expensive. 166. Offset number of logical address is also called_________________________number 167. Paging does not overcome the problem of______________________ 168. If last frame of the process is partially filled it can lead to________________________ 169. in paging mechanism_______________________acts as memory management unit to ma from logical to physical address 170. Page table size is_____________________________to frame size 171. If frame size is kept small it can reduce_____________________________ 172. Frame contain protection bits which can be _______________or__________________ 173. If frame in logical address is legal to access it have ______bit set, if illegal ______bit is set. 174. If an attempt is made to write to read only memory______________________signal is given to operating system citing ________________has occurred. 175. .valid and invalid bits of the page are called_________________________ 176. In a page table valid bit is indicated with ______and invalid bit is indicated with ________ 177. __________________________kind of code can be stored without interference.

178. We can refer frame in main memory by different_____________________ 179. Paging offers distinction of___________________of common code. 180. Sharing of code is mainly useful in _____________________environment. 181. It is ___________________of operating system that page in access is not being removed. 182. The table that keeps track of allocated and unallocated frames is called __________ table 183. ___________________is the process of partitioning based on users view 184. The central part of paging is differentiating ____________from________________ 185. ________________________segment size is core concept of segmentation; 186. The users view of memory and_____________________are same 187. Logical address can be described as collection of modules of varying length called______ 188. The attributes of the segment are________________and_________________ 189. Segmentation address consists of 2 parts namely ______________and________________ 190. Segment addresses are stored in ___________________ 191. The offset of logical address must be less than ________________in order to add it to the base address to generate_________________ 192. Each segment is _______________________from other segments 193. The main setback of segmentation is________________________ 194. The code portion of a segment can be shared with other only if code is __________type or________________ 195. Sharing of segments is________________and easy. 196. We can implement protection mechanism by _______________________in segmentation 197. If segments contain____________________________ it can be easily shared. 198. The three main reasons for a process to be replaced or do swapping from memory is_________________________

199. If logical address is greater than limit _______occurs and _________is sent to operating system 200. _____________________________scheduler is responsible for swapping 201. Page size is _____________________proportional to frame size which inurn is ___________________proportional to page table 202. ________________________is memory management technique used by windows 203. ______________is a illusory memory that operating system creates for running program 204. Usage of ___________________disk page is central to the concept of virtual memory. 205. Virtual memory can be implemented trough ____________and__________________ 206. The _____________________________never swaps page into memory till needed. 207. The process of bringing process to memory on need is called_____________________ 208. If a page referenced is not found in memory _________________is said to have occurred. 209 _______________________is the component swaps the page on need 210. Lazy swapper is also called as_____________________ 211. A valid bit indicates that the page is in______________________and therefore legal to access and if invalid bit is set the page is______________________ 212. If page is not in processes legal address space then it is an indication that page is in______ 213. If a reference is made to the page that is no longer in memory then________________is said to have occurred. 214. Operating system looks for_________________frame in memory in order to load page from_________ 215. The page table is ______________________to reflect any changes made to page 216. ________________________algorithms decide which age to replace to make a way for needed page 217. _______________________is done when there is no free frame in memory

218. ________________________when set indicates that page has been modified and changes should be written to disk 219. Modify or dirty bits prevents__________________________ 220. If there is no free frame in memory then_____________________is used to select the victim page 221. When a process has feasibility to select a replacement frame from set of all frames then_____________________said to exist. 222. When process selects only set of frames for page replacement then its called_____________________ 223. If there are not enough pages for the process exists in the memory then__________________rate is very high 224. High page fault diminishes____________________and lessens_____________________ 225. A process of busy aging in and out is__________________________ 226. High page fault rate leads to____________________ 227. High page fault leads to high _____________activity leading to phenomena___________ 228. If page faults go beyond______________________point results in trashing. 229. _____memory can be described as abstract view of memory and _______is real memory 230. When CPU utilizations 10% and disk utilization is 90% then________________is high and_______________is going on 231. If CPU utilization is 84% and disk utilization is 6% then describe the situation 232. If CPU utilization is 10% and disk utilization is 6% then___________is taking place and we can_____________________ 233. Page faults can be divided into__________________and_____________________ 234. The page fault where the faulted age can be found elsewhere in physical memory then its called_____________

235. The page fault where accessing of page need disk access is called___________________ 236. ___________fault creates significant overhead and delay than_____________________ 237. Fill the appropriate path in windows to view page faults Run__________ Then in performance monitor click + button. And select ____________from dropdown to view page fault related information. 238. In windows performance of virtual memory can be affected by changing ________ settings 239. Fill the appropriate path for accessing virtual memory settings Right click my computerproperties___________performance___________advanced virtual memory 240. Each process has unique id called_________________ 241. ________________help us in tracing the process 242. In process hierarchy of UNIX each process is related in ____________kind of relationship 243. A process of creating child by running process is called__________________ 244. Various parameters that processes have include_________________________ 245. Process states in UNIX are_____________________ 246. Each process is represented in the operating system by__________________________ 247. ______________________contains information associated with process 248. The state that the process is currently in is called_____________________ 249. The_____________________ points to the address of next information to be executed. 250. The data stored in CPU in various____________________ 251. The _____________of registers play an important role in process interruption and running 252. The ____________usually include information such as when the processes was last run, CPU time it taken etc 253. The _____information include which I/O devices were allotted, if process has open files etc

254. There are mainly ____________number of scheduling queues and they are___________ 255. The handling of various scheduling queues is done by_____________________ 256. When a new process is created it is admitted to________________queue 257. The ________________________is the component that takes each job from job queue and admits it to the ready queue 258. The queue that contains several processes waiting for CPU time is________________ 259. The _______is the component that picks job from ready queue and allocate CPU time to it. 260. There are mainly 2 conditions for a running process to get back to ready state they are _________ 261. In ready queue processes are stored in the form of____________________ 262. The ready queue contains pointers to________________________pcbs 263. In ready queue each PCB points to_________________in the list. 264. ________________ selects processes from queues. 265. There are mainly _________________number of schedulers and they are_____________ 266. Job scheduler is also called_____________________________ 267. Short term schedulers are also called_________________________ 268. ___________________scheduler decides degree of multi programming 269. _________________ scheduler selects the processes from queue on algorithms such as round robin and fcfs 270. CPU picks processes from CPU scheduler based on_____________________algorithms 271. In ___________________environment CPU does context switching so rapidly so that user gets feel of interactive computing. 272. Context switching is the processes of__________________________ 273. The number of state that the a processor usually be in are________and they are________

274. When a processes is forcibly made to relinquish the CPU is___________scheduling and when it voluntarily gives u its called_______________scheduling 275. Non preemptive scheduling is also called______________ 276. When a process switches from________________to_____________state or terminated it is said to follow non preemptive scheduling. 277. The time that dispatcher to stop one and start another process is called____________________ 278. Jumping to proper location in the user program to restart the program is done by______________ 279. _____________________if large can cause overhead with dispatcher 280. The CPU time taken by a process is called______________________ 281. When processes with short CPU times wait behind that of long CPU bursts then the effect is called________________________ 282. ______________________scheduling associates picking of a process on the basis of CPU bursts. 283. In _____________________scheduling algorithm when a new process arrives with cpu burst less than remaining time of current executing process, preemption occur 284. _____________________algorithm gives minimum average waiting time for a given set of processes. 285. When two jobs arrive with same CPU bursts in SRTF then tie is broken by______________algorithm 287. Shortest job first non preemptive scheduling algorithm is better than________________ 288. in each processes waiting in a ready queue has____________________in priority scheduling algorithm 289. In priority scheduling algorithm job is assigned to CPU based on_________________

290. The priority is ________value and lowers the priority number____________is the priority. 291. In windows operating system ________________processes have highest priority and that have low priority is ________________processes 292. The indefinite wait by a low priority processes by CPU time is called___________________ 293. ________________is the phenomena which increases priority of the processes with time. 294. The process of starvation can be prevented with the help of________________________ 295. The scheduling that gives process certain elapsed time, after which it is added to the ready queue is called________________________scheduling 296. If there are n processes and quantum or elapsed time is q then processes gets_______________of CPU time and no processes gets more than ___________units of time 297. When time quantum in round robin scheduling is very high then it becomes______________algorithm 298. The time slice given to each processes in round robin scheduling is called. 299. When CPU burst of processes is less than time quantum in round robin scheduling no __________________________is required. 300. In ____________________scheduling algorithm the ready queue is grouped into foreground and background processes 301. In multilevel queue scheduling algorithm foreground processes are also called as________________and background processes are also called as_______________ 302. The groups of ready queue can have their own ____________________in multilevel queue scheduling. 303. Each queue can be assigned a quantum of CPU time it is generally______________% for foreground and___________% for background in multilevel queue scheduling algorithm. 304. Usually ________________________processes have high priority than______________processes in multilevel queue scheduling algorithms.

305. Multilevel queue scheduling algorithms lack flexibility to_________________________ 306. In ____________________________scheduling algorithms processes can be moved from one group to other within ready queue. 307. ________________________is one form of aging where the priority of low priority processes is automatically raised. 308. A ________________ processes can perform more than one process at a time. 309. ______________________of multiple threads of single process remain same. 310. In multi threaded processes each thread has separate____________________ 311. Resource sharing allows threads to share_____________________ 312. The overhead of context switching between ____________________ is far less than context switching between__________________ 313. _______________________environment can give great boost to overall performance of the system. 314. With threads the economy and performance of the process can be optimized as threads can easily_________________ 315. Support for threads in the operating system can be done in ________ levels and they are____________ 316. ______________are responsible for programmer API for creating and managing threads. 317. We can implement thread library at two levels they are______________________ 318. Total running threads can be seen in windows by path Task managerperformance_________________ 319. Windows operating system uses ______________________ type of threads 320. Context switching overhead will be high in _______________ level threads.

ALL THE BEST