MCQs ON DSA
1. Virtual memory is:
2. Spatial locality refers to the phenomenon that once a location is referenced:
3. Which of the following is an example of a SPOOLED device?
4. Page fault occurs when:
5. Overlay is:
6. Determine the number of page faults when reference to pages occurs in the order 1,2,3,4,5,2,1,2,4. Assume that the main memory can accommodate 3 pages and the main memory already has the pages 1 and 2, with page 1 having been brought earlier than page 2 (assume LRU algorithm is used).
7. Concurrent processes are processes that:
8. The page replacement policy that sometimes leads to more page faults when the size of the memory is increased is:
9. The only state transition that is initiated by the user process itself is:
10. Working set (t, k) at an instant of time, t, is the set of:
11. Fragmentation is:
12. Which of the following are real-time systems?
13. Dijkstra’s banking algorithm in an operating system solves the problem of:
14. In page memory systems, if the page size is increased, then the internal fragmentation generally:
15. An operating system contains 3 user processes each requiring 2 units of resource R. The minimum number of units of R such that no deadlock will ever occur is:
16. Critical region is:
17. Kernel is:
18. With a single resource, deadlock occurs:
19. Necessary conditions for deadlock are:
20. In time-sharing operating systems, when the time slot given to a process is completed, the process goes from the RUNNING state to the:
21. At a particular time, the value of a counting semaphore is 10. It will become 7 after:
22. Supervisor call:
23. Semaphores are used to solve the problem of:
24. If the property of locality of reference is well pronounced in a program:
25. At a particular time of computation, the value of a counting semaphore is 7. Then 20 P operations and ‘x’ V operations were completed on this semaphore. If the final value of the semaphore is 5, x will be:
26. Pre-emptive scheduling is the strategy of temporarily suspending a running process:
27. Mutual exclusion problem occurs:
28. Sector interleaving in disks is done by:
29. Memory protection is of no use in a:
30. Some computer systems support dual-mode operation—the user mode and the supervisor or monitor mode. These refer to the modes:
31. Disk scheduling involves deciding:
32. A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 tape drives. The maximum value of ‘n’ for which the system is guaranteed to be deadlock-free is:
33. Dirty bit is used to show the:
34. Fence register is used for:
35. Which of the following is a service not supported by the operating system?
36. The first-fit, best-fit, and worst-fit algorithms can be used for:
37. Which of the following is a single-user operating system?
38. In Round Robin CPU scheduling, as the time quantum is increased, the average turnaround time:
39. In a multiprogramming environment:
40. Which of the following are true?
41. In a paged memory, the page hit ratio is 0.35. The time required to access a page in secondary memory is equal to 100ns. The time required to access a page in primary memory is 10ns. The average time required to access a page is:
42. A state is safe if the system can allocate resources to each process (up to its maximum) in some order and still avoid deadlock. Which of the following are true?
43. The size of the virtual memory depends on the size of the:
44. In a multi-user operating system, 20 requests are made to use a particular resource per hour, on average. The probability that no requests are made in 45 minutes is:
45. In which of the following scheduling policies does context switching never take place?
46. In which of the following directory systems, it is possible to have multiple complete paths for a file, starting from the root directory?
47. Suppose that a process is in ‘BLOCKED’ state waiting for some I/O service. When the service is completed, it goes to the:
48. In a system that does not support swapping:
49. To obtain better memory utilization, dynamic loading is used. With dynamic loading, a routine is not loaded until it is called. For implementing dynamic loading:
50. Which of the following is true?
51. Which of the following is true?
52. In partitioned memory allocation scheme:
53. Cascading termination refers to the termination of all child processes before the parent terminates:
54. For implementing a multiprogramming operating system:
55. Consider a system having ‘m’ resources of the same type. These resources are shared by 3 processes A, B, C, which have time demands of 3, 4, 6 respectively. The minimum value of ‘m’ that ensures that deadlock will never occur is:
56. A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then deadlock:
57. ‘m’ processes share ‘n’ resources of the same type. The maximum need of each process does not exceed ‘n’, and the sum of all their maximum needs is always less than . In this setup, deadlock:
58. A process refers to 5 pages, A, B, C, D, and E, in the order: A; B; C; D; A; E; B; C; D; E. If the page replacement algorithm is FIFO, the number of page faults with an empty internal store of 3 frames is:
59. Distributed systems should:
60. The main function of shared memory is:
61. Which of the following is the most suitable scheduling scheme in a real-time operating system?
62. ‘Aging’ is:
63. If there are 32 segments, each of size 1 Kbytes, then the logical address should have:
64. Disk requests come to a disk driver for cylinders in the order 10, 22, 20, 2, 40, 6, and 38 at a time when a disk drive is reading from cylinder 20. The seek time is 6 ms per cylinder. The total seek time, if the disk arm scheduling algorithm is first-come-first-served, is:
65. A certain moving arm disk storage with one head has the following specifications:
66. Memory protection is normally done by the:
67. Which of the following scheduling algorithms gives the minimum average waiting time?
68. In a paged segmented scheme of memory management, the segment table itself must have a page table because:
69. Which of the following page replacement algorithms suffers from Belady’s anomaly?
70. Which of the following scheduling policies is well suited for a time-shared operating system?
71. The address sequence generated by tracing a particular program executing in a pure demand paging system with 100 records per page, with 1 free main memory frame is recorded as follows. What is the number of page faults?
72. A computer system has 4 K word cache organized in a block-set-associative manner, with 4 blocks per set, 64 words per block. The number of bits in SET and WORD fields of the main memory address format is:
73. A memory page containing a heavily used variable that was initialized very early and is in constant use is removed when the page replacement algorithm is used:
74. A demand paging system, with the page table held in registers, takes 5 ms to service a page fault if an empty page is available, or if the page to be replaced is not dirty. It takes 15 ms if the replaced page is dirty. Memory access time is 1 microsecond. Assume we want an effective access time of 2 microseconds and that the page to be replaced is dirty 60% of the time. What is the approximate maximum acceptable page fault rate to meet this access time requirement?
75. Memory protection is normally done by the:
76. Which of the following scheduling algorithms gives the minimum average waiting time?
77. In a paged segmented scheme of memory management, the segment table itself must have a page table because:
78. Which of the following page replacement algorithms suffers from Belady’s anomaly?
79. Which of the following scheduling policies is well suited for a time-shared operating system?
80. The address sequence generated by tracing a particular program executing in a pure demand paging system with 100 records per page, with 1 free main memory frame is recorded as follows. What is the number of page faults?
81. A computer system has 4 K word cache organized in a block-set-associative manner, with 4 blocks per set, 64 words per block. The number of bits in SET and WORD fields of the main memory address format is:
82. A memory page containing a heavily used variable that was initialized very early and is in constant use is removed when the page replacement algorithm is used:
83. A demand paging system, with the page table held in registers, takes 5 ms to service a page fault if an empty page is available, or if the page to be replaced is not dirty. It takes 15 ms if the replaced page is dirty. Memory access time is 1 microsecond. Assume we want an effective access time of 2 microseconds and that the page to be replaced is dirty 60% of the time. What is the approximate maximum acceptable page fault rate to meet this access time requirement?
84. Trojan-Horse programs:
85. Page stealing:
86. In virtual memory systems, Dynamic address translation:
87. The garbage collector:
88. Page-map table is:
89. Which of the following rules out the use of GO TO?
90. Which of the following is a phase of a compilation process?
91. A computer cannot “boot” if it does not have the:
92. Which of the following is a measure to test how good or bad a modular design is:
93. Which of the following types of software must you have in main memory in order to use your keyboard?
94. If you want to execute more than one program at a time, the system software you are using must be capable of:
95. Which of the following is a type of systems software used on microcomputers?
96. Which of the following is helpful in evaluating applications software that will best suit your needs?
97. Which of the following are loaded into main memory when the computer is booted?
98. Which of the following software types is used to simplify using systems software?
99. Which of the following is not applications software?
100. Which of the following types of software should you use if you often need to create, edit, and print documents?
101. Multiprogramming was made possible by:
102. A translator which reads an entire program written in a high-level language and converts it into machine language code is:
103. What is the name given to all the programs inside the computer which make it usable?
104. Systems software is a program that directs the overall operation of the computer, facilitates its use, and interacts with all users. What are the different types of this software?
105. What is the name of the system which deals with the running of the actual computer and not with the programming problems?
106. Which of the following systems software does the job of merging the records from two files into one?
107. The term “operating system” means:
108. The operating system of a computer serves as a software interface between the user and:
109. The primary job of the operating system of a computer is to:
110. All the time a computer is switched on, its operating system software has to stay in:
111. What is the name given to software which can be legally compiled and often used for free?
112. What is the operating system used by Macintosh computers?
113. Who is called the overseer and supervisor of all computer activity?
114. Can you name the major operating systems used in computers?
115. Who developed the operating system/2 (OS/2) for running IBM’s new PS/2 family of microcomputers?
116. Most of the microcomputer’s operating systems like Apple DOS, MS DOS, and PC DOS are called disk operating systems because:
117. What is the name given to the process of initializing a microcomputer with its operating system?
118. What is the name of the operating system which was originally designed by scientists and engineers for use by scientists and engineers?
119. What are the most important features of Microsoft Windows program?
120. What is the name given to the organized collection of software that controls the overall operation of a computer?
121. What is the name given to the values that are automatically provided by software to reduce keystrokes and improve a computer user’s productivity?
122. The powerful text editor called PC-Writer can be used by anybody by paying a small fee. Such programs are called:
123. What is the name of the operating system that reads and reacts in terms of actual time?
124. What is the name of the technique in which the operating system of a computer executes several programs concurrently by switching back and forth between them?
125. When did IBM release the first version of its disk operating system DOS version 1.0?
126. IBM released its first PC in 1981. Can you name the operating system which was most popular at that time?
127. The mathematics software allows the users to directly write and solve problems in arithmetic, trigonometry, algebra, etc. Can you name the person who created this software?
128. The higher version of the operating systems are so written that programs designed for earlier versions can still be run. What is it called?
129. What is the name of the arrangement whereby several central processing units share one memory?
130. A graphical-menu-driven operating system allows you to pick up from the menu of choices it displays on the screen. What is the name given to the images which are used in such image-oriented menus?
131. With reference to Windows, a DLL is:
132. Windows is a(n):
133. Microcomputer operating systems are generally:
134. The part of the computer system which performs the housekeeping functions is called:
135. An operating system designed to run on only one family of computers is called:
136. An operating system:
137. The relationship between operating system software and application software is that:
138. A proprietary operating system can run on machines made by:
139. The most popular 16-bit operating system is:
140. DOS is:
141. A computer program written into a storage medium from which it cannot be accidentally erased is called:
142. The first popular microcomputer operating system developed around 1974 is:
143. A microcomputer operating system which is popular with computer professionals and which can support multitasking is:
144. The two most popular operating systems for 8- and 16-bit personal computers are:
145. UNIX operating system:
146. An operating system for a large computer is:
147. Which of the following is not an operating system?
148. XENIX can be used only with:
149. The application package is used to:
150. The part of the computer system which performs the housekeeping functions is called:
151. A computer program written in a high-level language is called a:
152. A compiler can diagnose:
153. Compilers are generally written by:
154. A programmer, by mistake, writes an instruction to divide instead of multiply. Such an error can be detected by a/an:
155. Which is not true about ‘syntax’ and ‘semantics’ parts of a computer language?
156. A series of statements explaining how the data is to be processed is called:
157. The computer language generally translated to pseudo code is:
158. Application programs used with microcomputers are generally written by:
159. What is true about machine language?
160. Object program is:
161. What is true about assembly language?
162. The process of transferring data intended for a peripheral device into a disk (or intermediate store) so that it can be transferred to the peripheral at a more convenient time or in bulk is known as:
163. A form of code that uses more than one process and processor, possibly of different types, and that may on occasion have more than one process or processor active at the same time is known as:
164. Situations where two or more processes are reading or writing some shared data and the final result depends on who runs precisely when are called:
165. Part of a program where the shared memory is accessed and which should be executed indivisibly is called:
166. A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executed is known as:
167. Which of the following operating systems use write-through caches?
168. A disk scheduling algorithm in an operating system causes the disk arm to move back and forth across the disk surface in order to service all requests in its path. This is a:
169. A system program that sets up an executable program in main memory ready for execution is:
170. A compiler for a high-level language that runs on one machine and produces code for a different machine is called:
171. An instruction in a programming language that is replaced by a sequence of instructions prior to assembly or compiling is known as:
172. Which of the following translator programs converts assembly language program to object program?
173. Which of the following system programs forgoes the production of object code to generate absolute machine code and load it into the physical main storage location from which it will be executed immediately upon completion of the assembly?
174. System programs such as compilers are designed so that they are:
175. Memory:
176. A program:
177. A processor:
178. An assembler is:
179. An interpreter is:
180. A compiler is:
181. A loader is:
182. Virtual Memory
183. Paging
184. Multiprogramming
185. The Memory Buffer Register (MBR)
186. The Memory Address Register (MAR)
187. The Instruction Register (IR)
188. Advantage(s) of using assembly language rather than machine language is (are):
189. Pass 1 of an assembler:
190. Pass 2 of an assembler:
191. The System/370 assembler language:
192. A base register table:
193. Addressing structure:
194. Addressing modes:
195. The Register-to-Register (RR) instructions:
196. The Register-to-Storage (RS) instructions:
197. The Storage-to-Storage (SS) instructions:
198. Which of the following are Language Processors?
199. The specific tasks Storage Manager performs are:
200. The process manager (or processor manager) has to keep track of:
201. The advantage(s) of incorporating the macro processor into Pass 1 is (are):
202. The macro processor must perform:
203. In which way(s) a macro processor for assembly language can be implemented:
204. Which of the following functions is(are) performed by the loader?
205. When a computer is first turned on or restarted, a special type of absolute loader is executed, called a:
206. In MS-DOS 5.0, which is the number that acts as a code to uniquely identify the software?
207. The higher versions of the operating systems are so written that programs designed for earlier versions can still be run. What is it called?
208. What is the name of the process of initializing a microcomputer with its operating system?
209. A hardware device that is capable of executing a sequence of instructions is known as:
210. The function(s) performed by the paging software is(are):
211. The file level is a descriptor containing all the information which would be required:
212. The task(s) of the lexical analysis phase is(are):
213. Which is a permanent database in the general model of a compiler?
214. Which table is a permanent database that has an entry for each terminal symbol?
215. While running DOS on a PC, which command would be used to duplicate the entire diskette?
216. Which of the following filename extensions suggests that the file is a backup copy of another file?
217. While working with MS-DOS, which command will you use to transfer a specific file from one disk to another?
218. With MS-DOS, which command will divide the surface of the blank floppy disk into sectors and assign a unique address to each one?
219. The functions of the Storage Assignment is(are):
220. A non-relocatable program is one which:
221. A relocatable program form is one which:
222. A self-relocating program is one which:
223. The term "operating system" means:
224. Which of the following software types is used to simplify using system software?
225. Which of the following is not applications software?
226. Which of the following types of software should you use if you often need to create, edit, and print documents?
227. Which of the following will determine your choice of systems software for your computer?
228. Terminal Table:
229. Assembly code database is associated with:
230. The table created by lexical analysis to describe all literals used in the source program is:
231. The functions of the syntax phase are:
232. In an absolute loading scheme, which loader function is accomplished by the assembler?
233. In an absolute loading scheme, which loader function is accomplished by the loader?
234. The advantages inherent to using high-level language are:
235. The action of parsing the source program into the proper syntactic classes is known as:
236. In analyzing the compilation of a PL/I program, the term “Lexical analysis” is associated with:
237. In analyzing the compilation of a PL/I program, the term “Machine independent optimization” is associated with:
238. In analyzing the compilation of a PL/I program, the description “resolving symbolic address (labels) and generating machine language” is associated with:
239. In analyzing the compilation of a PL/I program, the description “creation of more optimal matrix” is associated with:
240. Which of the following is not a part of the operating system?
241. Which of the following is not an advantage of multiprogramming?
242. In which addressing mode the contents of a register specified in the instruction are first decremented, and then these contents are used as the effective address of the operands?
243. In which addressing mode, the effective address of the operand is generated by adding a constant value to the contents of a register?
244. In what modules, multiple instances of execution will yield the same result even if one instance has not terminated before the next one has begun?
245. What is the name given to all the programs inside the computer which makes it usable?
246. A translator which reads an entire program written in a high-level language and converts it into machine language code is:
247. Which of the following is helpful in evaluating applications software that will best suit your needs?
248. If you want to execute more than one program at a time, the system software you are using must be capable of:
249. Which of the following types of software must you have in main memory in order to use your keyboard?
250. Which of the following might be used to convert high-level language instructions into machine language?
251. Multiprogramming was made possible by:
252. What is the name of the system which deals with the running of the actual computer and not with the programming problems?
253. Which of the following scheduling objectives should be applied to the following: the system should admit jobs to create a mix that will keep most devices busy?
254. Which policy replaces a page if it is not in the favored subset of a process’s pages?
255. In which of the storage placement strategies a program is placed in the smallest available hole in the main memory?
256. Which of the following statements is false?
257. Can you name the major operating system used in computers?
258. What is the name of the operating system which was originally designed by scientists and engineers for use by scientists and engineers?
259. Which are the most important features of Microsoft Windows program?
260. What is the name given to the organized collection of software that controls the overall operation of a computer?
261. What is the name given to the values that are automatically provided by software to reduce keystrokes and improve a computer user’s productivity?
262. Producer-consumer problem can be solved using:
263. Situations where two or more processes are reading or writing some shared data and the final result depends on who runs precisely when, are called:
264. A process is:
265. In which addressing mode the effective address of the operand is the contents of a register specified in the instruction and after accessing the operand, the contents of this register is incremented to point to the next item in the list?
266. A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executed, is known as:
267. The process of transferring data intended for a peripheral device into a disk (or intermediate store) so that it can be transferred to the peripheral at a more convenient time or in bulk, is known as:
268. Which of the following statements is false?
269. The powerful text editor called PC-Write can be used by anybody by paying a small fee. Such programs are called:
270. What is the name of the operating system that reads and reacts in terms of actual time?
271. What is the name of the technique in which the operating system of a computer executes several programs concurrently by switching back and forth between them?
272. What is the name given to the software which can be legally compiled and often used for free?
273. All the time a computer is switched on, its operating system software has to stay in:
274. A front-end processor is usually used in:
275. The problem of thrashing is affected significantly by:
276. Two basic types of operating systems are:
277. Remote computing service involves the use of timesharing and:
278. Non-modifiable procedures are called:
279. An instruction in a programming language that is replaced by a sequence of instructions prior to assembly or compiling is known as:
280. The main function of the dispatcher (the portion of the process scheduler) is:
281. The primary job of the operating system of a computer is to:
282. The operating system of a computer serves as a software interface between the user and:
283. Which of the following operating systems use write-through caches?
284. A system program that combines the separately compiled modules of a program into a form suitable for execution is:
285. What problem is solved by Dijkstra’s banker’s algorithm?
286. A compiler for a high-level language that runs on one machine and produces code for a different machine is called:
287. Banker’s algorithm for resource allocation deals with:
288. To avoid race conditions, the maximum number of processes that may be simultaneously inside the critical section is:
289. Daisy chain is a device for:
290. Scissoring enables:
291. Information in memory that is no longer valid or wanted is known as:
292. Which of the following is a type of systems software used on microcomputers?
293. Which of the following are loaded into main memory when the computer is booted?
294. What is the name of the operating system for the laptop computer called MacLife?
295. What is the operating system used by Macintosh computers?
296. Who developed the operating system/2 (OS/2) for running IBM’s new PS/2 family of microcomputers?
297. In which addressing mode the operand is given explicitly in the instruction?
298. Which of the following programs is not a utility?
299. Job Control Language (JCL) statements are used to:
300. Operating system is:
301. Most of the microcomputer’s operating systems like Apple DOS, MS DOS, and PC DOS, etc., are called disk operating systems because:
302. When did IBM release the first version of the disk operating system DOS version 1.0?
303. IBM released its first PC in 1981. Can you name the operating system which was most popular at that time?
304. Page fault frequency in an operating system is reduced when the:
305. Which of the following is true for testing and debugging?
306. If special forms are needed for printing the output, the programmer specifies these forms through:
307. Under multiprogramming, turnaround time for short jobs is usually...... and for long jobs is slightly......
308. The state transition initiated by the user process itself in an operating system is:
309. Which of the following terms refers to the degree to which data in a database system are accurate and correct?
310. The total time to prepare a disk drive mechanism for a block of data to be read from it is:
311. Indicate whether the statement LDA B is a statement in:
312. Indicate which describes the term “software”:
313. Bug means:
314. A development strategy whereby the executive control modules of a system are coded and tested first is known as:
315. Indicate which, of the following, is not true about Nassi-Shneiderman charts:
316. Indicate which, of the following, is not true about a data flow diagram (DFD):
317. Which of the following checks cannot be carried out on the input data to a system?
318. Which of the following is not true about documentation?
319. C is:
320. Which of the following modules does not incorporate initialization of values changed by the module?
321. Which of the following statements is false?
322. Indicate which, of the following, is not true about an interpreter:
323. Indicate which, of the following, is not true about 4GL:
324. An algorithm is described as:
325. A sequence of instructions, in a computer language, to get the desired result is known as:
326. The strategy of allowing processes that are logically runnable to be temporarily suspended is called:
327. Part of a program where the shared memory is accessed and which should be executed indivisibly is called:
328. The technique, for sharing the time of a computer among several jobs, which switches jobs so rapidly such that each job appears to have the computer to itself is:
329. The operating system manages:
330. A form of code that uses more than one process and processor, possibly of different types, and that may on occasion have more than one process or processor active at the same time is known as:
331. Assembly language:
332. Which of the following are the advantages of modular programming?
333. Which of the following can be accessed by the transfer vector approach of linking?
334. The linker:
335. Indicate which is a pre-emptive scheduling algorithm:
336. A characteristic of an online real-time system is:
337. Indicate which, of the following, is the worst type of module coupling:
338. A page fault:
339. In memory systems, boundary registers:
340. Relocatable programs:
341. The FIFO algorithm:
342. The user interface:
343. Memory management is:
344. The practice of “bundling” refers to:
345. The primary purpose of an operating system is to:
346. Multiprogramming systems:
347. Spooling is most beneficial in a multiprogramming environment where:
348. Software that measures, monitors, analyzes, and controls real-world events is called:
349. Object modules generated by assemblers that contain unresolved external references are resolved for two or more object modules by a/an:
350. Which of the following is false about disk when compared to main memory?
351. Which of the following capabilities is required for a system program to execute more than one program at a time?
352. A critical region is:
353. Which of the following addressing modes facilitates access to an operand whose location is defined relative to the beginning of the data structure in which it appears?
354. The register or main memory location which contains the effective address of the operand is known as:
355. System programs such as compilers are designed so that they are:
356. Special software to create a job queue is called a:
357. The most common security failure is:
358. A public key encryption system:
359. Supervisor state is:
360. A high paging rate:
361. Round robin scheduling is essentially the preemptive version of:
362. If the number of bits in the virtual address of a program is 12 and the page size is 0.5 KB, the number of pages in the virtual address space is:
363. In which of the storage placement strategies is a program placed in the largest available hole in the main memory?
364. For how many processes which are sharing common data does Dekker’s algorithm implement mutual exclusion?
365. A disk scheduling algorithm in an operating system causes the disk arm to move back and forth across the disk surface in order to service all requests in its path. This is a:
366. Round-robin scheduling:
367. Inter-process communication:
368. Fork is:
369. A process is another name for:
370. Relocation bits used by relocating loader are specified (generated by):
371. Device independence:
372. User-Friendly Systems are:
373. Disk scheduling includes deciding:
374. Which of the following translator programs convert assembly language program to object program?
375. Data encryption:
376. Seeks analysis:
377. Swapping:
378. Feedback queue:
379. A file organization component of a VSAM file is:
380. The file structure that redefines its first record at a basic of zero uses the term:
381. File record length:
382. An incremental backup:
383. A partitioned data set is most used for:
384. System generation:
385. Object code:
386. Virtual memory is:
387. System maintenance:
388. Which of the following statements is not true?
389. What scheduling algorithm allows processes that are logically runnable to be temporarily suspended?
390. The term ‘polling’ in a computer means a process by which a computer system:
391. In a magnetic disk, data is recorded in a set of concentric tracks which are subdivided into:
392. Which of the following is true for machine language?
393. The LRU algorithm:
394. A linker:
395. Global locks:
396. The dynamic allocation of storage areas with VSAM files is accomplished by:
397. Which of the following refers to associative memory?
398. Link encryption:
399. Which of the following is a characteristic of an operating system?
400. Files can have:
401. A file is sometimes called a:
402. In MS-DOS, relocatable object files and load modules have extensions:
403. Resolution of externally defined symbols is performed by:
404. In which of the following page replacement policies does Belady’s anomaly occur?
405. Four necessary conditions for deadlock to exist are: mutual exclusion, no-preemption, circular wait, and:
406. A system program that sets up an executable program in main memory ready for execution is:
407. The principle of locality of reference justifies the use of:
408. The details of all external symbols and relocation information (relocation list or map) are provided to the linker by:
409. Scheduling is:
410. Real-time systems are:
411. Access time is the highest in the case of:
412. The most common systems security method is:
413. Poor response times are caused by:
414. Which of the following is a block device?
415. Which of the following statements is false?
416. Thrashing can be avoided if:
417. Operating system:
418. A task in a blocked state:
419. Backups should be done:
420. Which of the following statements is true?
421. A flowchart that uses predefined symbols to describe data flow in a system is known as:
422. Which of the following is true about pseudo code?
423. A program that converts a high-level language program to a set of instructions that can run on a computer is called a:
424. Which of the following statements is not true about the FORTRAN language?
425. The initial value of the semaphore that allows only one of the many processes to enter their critical section is:
426. The principles of structured programming forbid the use of:
427. Which of the following is necessary to work on a computer?
428. Dividing a project into segments and smaller units in order to simplify the analysis, design, and programming efforts is known as:
429. The errors that can be pointed out by the compiler are:
430. The dispatcher:
431. The SJF algorithm executes first the job:
432. Semaphores:
433. Fragmentation of the file system:
434. The command interpreter:
435. A translator is best described as:
436. The part of the machine-level instruction, which tells the central processor what has to be done, is:
437. Which of the following instruction steps would be written within the diamond-shaped box of a flowchart?
438. Block caches or buffer caches are used:
439. To avoid the race condition, the maximum number of processes that may be simultaneously inside their critical section is:
440. What is the initial value of the semaphore to allow only one of the many processes to enter their critical section?
441. Which technique stores a program on disk and then transfers the program into main storage as and when they are needed, is known as:
442. Which of the following is not true about the description of a decision table?
443. The memory allocation scheme subject to ‘external’ fragmentation is:
444. The advantage of a command processor running only built-in commands is:
445. Which of the following is not true about memory management?
446. In which way(s) can a macro processor for assembly language be implemented?
447. The disadvantage of “Compile and GO” loading scheme is (are):
448. In analyzing the compilation of a PL/I program, the term “syntax analysis” is associated with:
449. Uniform Symbols Table:
450. The function(s) of the scheduler is (are):
451. The function(s) of the file system is (are):
452. Moving a process from main memory to disk is called:
453. In order to allow only one process to enter its critical section, binary semaphores are initialized to:
454. The state transition initiated by the user process itself in an operating system is:
455. Which of the following terms refers to the degree to which data in a database system are accurate and correct?
456. The total time to prepare a disk drive mechanism for a block of data to be read from it is:
457. The paging rate:
458. Thrashing:
459. The computational technique used to compute the disk storage address of individual records is called:
460. Capacity planning:
461. In a multiprogramming system, a set of processes is deadlocked if each process in the set is waiting for an event to occur that can be initiated only by another process in the set. Which of the following is not one of the four conditions that are necessary for deadlock to occur?
462. Belady's anomaly occurs in:
463. The CPU, after receiving an interrupt from an I/O device:
464. Which of the following is not a characteristic of a daisy chaining priority control scheme?
465. An example of a system development program is:
466. Which of the following is not a part of the operating system?
467. If special forms are needed for printing the output, the programmer specifies these through:
468. Which of the following is not an advantage of multiprogramming?
469. The problem of thrashing is affected significantly by:
470. Logical extension of multiprogramming of operating system is:
471. Under multiprogramming, turnaround time for short jobs is usually...... and that for long jobs is slightly......
472. Remote computing service involves the use of time-sharing and......
473. Under which circumstances the scheduling scheme is non-preemptive:
474. Under which circumstances the scheduling scheme is preemptive:
475. ......gives control of the CPU to the process selected by the short-term scheduler.
476. Which of the following are the functions of the dispatcher?
477. Which of the following are CPU scheduling criteria?
478. Which of the following is true for the algorithms for allocating regions of contiguous memory?
479. The first-fit algorithm for allocating regions of contiguous memory does......
480. The best-fit algorithm for allocating regions of contiguous memory does......
481. Which of the following are scheduling algorithms:
482. Routine is not loaded until it is called. All routines are kept on disk in a reloadable load format. The main program is loaded into memory & is executed. This type of loading is called ______.
483. Which of the following is crucial time while accessing data on the disk?
484. The host repeatedly checks if the controller is busy until it is not. It is in a loop that status register’s busy bit becomes clear. This is called ______ and a mechanism for the hardware controller to notify the CPU that it is ready is called ______.
485. Unix Operating System is an ______.
486. Which of the following memory allocation scheme suffers from External fragmentation?
487. Information about a process is maintained in a ______.
488. Distributed OS works on the ______ principle.
489. The problem of fragmentation arises in ______.
490. Which file system does DOS typically use?
491. The program is known as ______ which interacts with the inner part of called kernel.
492. The time taken by the disk arm to locate the specific address of a sector for getting information is called ______.
493. Which file system does Windows 95 typically use?
494. Identify the odd thing in the services of operating system.
495. Cryptography technique is used in ______.
496. Which of the following is not an advantage of multiprogramming?
497. In ______ OS, the response time is very critical.
498. An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is ______.
499. Real-time systems are ______.
500. Which technique was introduced because a single job could not keep both the CPU and the I/O devices busy?
501. Inter-process communication can be done through ______.
502. In Priority Scheduling, a priority number (integer) is associated with each process. The CPU is allocated to the process with the highest priority (smallest integer = highest priority). The problem of starvation (low priority processes may never execute) is resolved by ______.
503. CPU performance is measured through ______.
504. PCB = ______.
505. Software is a program that directs the overall operation of the computer, facilitates its use, and interacts with the user. What are the different types of this software?
506. A ______ is software that manages the time of a microprocessor to ensure that all time-critical events are processed as efficiently as possible. This software allows the system activities to be divided into multiple independent elements called tasks.
507. The primary job of the operating system of a computer is to ______.
508. With the round-robin CPU scheduling in a time-shared system ______.
509. Which of the following is a criterion to evaluate a scheduling algorithm?
510. Which of the following is contained in Process Control Block (PCB)?
511. Supercomputers typically employ ______.
512. Round-robin scheduling is essentially ______ the preemptive version of ______.
513. A page fault occurs.
514. Which of the following will determine your choice of systems software for your computer?
515. Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following statements: wait(S); wait(Q); —; signal(S); signal(Q) and wait(Q); wait(S); —; signal(Q); signal(S); respectively. The above situation depicts a ______.
516. What is a shell?
517. Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. The main program is loaded into memory & is executed. This type of loading is called ______.
518. In the blocked state:
519. What is the memory from 1K - 640K called?
520. The process related to process control, file management, device management, information about system and communication that is requested by any higher-level language can be performed by ______.
521. If the Disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O blocks requests are 98, 37, 14, 124, 65, 67.
522. Multiprogramming systems ______.
523. Which is not the state of the process?
524. The solution to the Critical Section Problem is: Mutual Exclusion, Progress, and Bounded Waiting.
525. The problem of thrashing is affected significantly by ______.
526. The state of a process after it encounters an I/O instruction is ______.
527. The number of processes completed per unit time is known as ______.
528. ______ is the situation in which a process is waiting on another process, which is also waiting on another process ... which is waiting on the first process. None of the processes involved in this circular wait are making progress.
529. Which technique was introduced because a single job could not keep both the CPU and the I/O devices busy?
530. The mechanism that brings a page into memory only when it is needed is called ______.
531. Switching the CPU to another Process requires saving the state of the old process and loading the new process state. This is called as ______.
532. Which directory implementation is used in most Operating Systems?
533. The Banker’s algorithm is used:
534. A thread:
535. ______ is a high-level abstraction over Semaphore.
536. A tree-structured file directory system ______.
537. Translator for low-level programming language were termed as:
538. Analysis which determines the meaning of a statement once its grammatical structure becomes known is termed as:
539. Load address for the first word of the program is called:
540. Symbolic names can be associated with:
541. The translator which performs macro expansion is called a:
542. Shell is the exclusive feature of:
543. A program in execution is called:
544. Interval between the time of submission and completion of the job is called:
545. A scheduler which selects processes from secondary storage device is called:
546. The scheduling in which CPU is allocated to the process with the least CPU-burst time is called:
547. The term ‘page traffic’ describes:
548. The “turn-around” time of a user job is the:
549. Which of the following can be used as a criterion for classification of data structures used in language processing?
550. Memory utilization factor shall be computed as follows:
550. Memory utilization factor shall be computed as follows:
551. Program ‘preemption’ is:
552. An assembler is:
553. Which of the following is not a fundamental process state?
554. LRU page replacement policy is:
555. Which of the following is true?
556. Which of the following approaches do not require knowledge of the system state?
557. Program generation activity aims at:
558. Which amongst the following is not an advantage of Distributed systems?
559. An imperative statement:
560. Which of the following loader is executed when a system is first turned on or restarted?
561. Poor response time is usually caused by:
562. The “blocking factor” of a file is:
563. Which of these is a component of a process precedence sequence?
564. Which amongst the following is valid syntax of the Fork and Join Primitive?
565. Nested Macro calls are expanded using the:
566. A parser which is a variant of top-down parsing without backtracking is:
567. The expansion of nested macro calls follows:
568. In a two-pass assembler, the task of the Pass II is to:
569. A linker program:
570. Which scheduling policy is most suitable for a time-shared operating system?
571. A critical section is a program segment:
572. An operating system contains 3 user processes each requiring 2 units of resource R. The minimum number of units of R such that no deadlocks will ever arise is:
573. Locality of reference implies that the page reference being made by a process:
574. This of these is not a part of Synthesis phase:
575. The syntax of the assembler directive EQU is:
576. The following features are needed to implement top-down parsing:
577. A macro definition consists of:
578. The main reason to encrypt a file is to:
579. This of the following is not a key piece of information, stored in a single page table entry, assuming pure paging and virtual memory:
580. A UNIX device driver is:
581. The following is not a layer of IO management module:
582. Which amongst the following is not a valid page replacement policy?
583. Consider a program with a linked origin of 5000. Let the memory area allocated to it have the start address of 70000. Which amongst the following will be the value to be loaded in the relocation register?
584. An assembly language is a:
585. TII stands for:
586. An analysis, which determines the syntactic structure of the source statement, is called:
587. Actions implementing instruction’s meaning are actually carried out by:
588. The field that contains a segment index or an internal index is called:
589. A program in execution is called:
590. Jobs which are admitted to the system for processing are called:
591. A set of techniques that allow executing a program which is not entirely in memory is called:
592. SSTF stands for:
593. Before proceeding with its execution, each process must acquire all the resources it needs is called:
594. Relocation bits used by relocating loader are specified by:
595. Resolution of externally defined symbols is performed by:
596. Relocation programs:
597. Authentication is a fundamental building block in most computers:
598. Page fault frequency in an operating system is reduced when the:
599. Which of the following are language processors?
600. Virtual memory can be implemented with:
601. Recognition of basic syntactic constructs through reductions, this task is performed by:
602. A grammar for a programming language is a formal description of:
603. ______ is a technique of temporarily removing inactive programs from the memory of a computer system:
604. ______ is a technique of improving the priority of processes waiting in the queue for CPU allocation:
605. ______ is the time required by a sector to reach below the read/write head:
606. Which of the following is the most general phase-structured grammar?
607. File record length:
608. The process is:
609. A program is passive while a process is:
610. A process is created and is initially put in the:
611. Exit() system call results in:
612. A thread is a:
613. Generally, we have user-level threads and:
614. IPCs can be done through:
615. RR scheduling is a preemptive version of:
616. A scheduling where in the jobs are allowed to move between the queues:
617. In RR Scheduling, a ready queue is treated as:
618. FIFO scheduling is:
619. The indefinite blocking of low-priority processes by high-priority processes is known as:
620. The technique of gradually increasing the priority of processes that wait in the system for a long time is called:
621. The main objective of scheduling is:
622. The total time elapsed from the time the job is submitted (or process is created) to the time the job (or process) is completed is called:
623. ______ is defined as the average fraction of time during which the CPU is busy, executing either user programs or system modules:
624. In ______ scheduling, if once a process has been allocated CPU, then the CPU cannot be taken away from that process:
625. In ______, the CPU can be taken away before the completion of the process:
626. “If there are n-processes in a ready queue and the time quantum is ‘q’ time intervals, then each process gets ‘1/n’, of the CPU time in the chunks of at most ‘q’ units of time. Each process will have to wait for (n -1) x q time unit until its next time quantum comes in” This principle is suitable for which one of the following:
627. Process can be in one of the following states:
628. Process is:
629. Process is:
630. The high paging activity is called:
631. The process of merging adjacent holes to form a single larger hole is called as:
632. The degree of multiprogramming is controlled by:
633. Thrashing occurs:
634. Boundary registers:
635. A scheduling algorithm is fair:
636. A critical region:
637. In one of the deadlock prevention methods, impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration. This violates the ______ condition of deadlock:
638. Semaphore can be used for solving:
639. The hardware mechanism that enables a device to notify the CPU is called:
640. ______ begins at the root and follows a path down to the specified file:
641. Process state is a part of:
642. Virtual memory is commonly implemented by:
643. Paging:
644. Which of the following is a criterion to evaluate a scheduling algorithm?
645. Which of the following is contained in Process Control Block (PCB)?
646. With the round-robin CPU scheduling in a time-shared system:
Last updated