14CS2037 Operating System B.Tech Question Bank : karunya.edu

Name of the College : Karunya Institute of Technology & Sciences
University : Karunya University
Degree : B.Tech
Department : Information Technology
Subject Name : Operating System
Document Type : Question Bank
Website : karunya.edu

Download :https://www.pdfquestion.in/uploads/ka…g%20System.pdf

Karunya Operating System Question Paper

Part – A

1. Given a system with n processes, how many possible ways can those processes be scheduled. Give a formula in terms of n.
2. In which state is a process in if it has the CPU?

Related : Karunya University 14CS2042 Software Engineering B.Tech Question Bank : www.pdfquestion.in/2889.html

3. Consider a logical address space of eight pages of 1024 words each, mapped onto a physical memory of 32 frames.
a. How many bits are there in the logical address?
b. How many bits are there in the physical address?
What are the physical addresses for the following logical addresses? a. 0,430 b. 2,500
5. Give an example of an application in which data in a file should be accessed in the following order : a. Sequentially b. Randomly
6. Why must the bit map for file allocation be kept on mass storage, rather than in main memory?
7. A _____ semaphore is such that it’s integer value can range over an unrestricted domain
8. When is a process said to be in a critical section?
9. It is not possible to have a deadlock involving only one single process. Which among the 4 necessary and sufficient conditions is violated?
10. What is the command interpreter in Unix called?

Part – B

Fill in the blanks  :
11. Software may trigger and interrupt executing a special operation called __________.
12. A common representation for a discussion of process scheduling is a ______.
13. What is a cascading termination?
14. What is a serial schedule?
15. Define safe state?
16. ________never swaps a page into memory unless that page will be needed.
17. What are the properties of immutable file?
18. _________knows about files and their logical blocks as well as physical blocks.
19. What is the use of controller?
20. What is the use of the asymmetric multi processing?
21. Which device is used to communication in small area network?
22. What is thread cancellation?
23. What is dispatch latency?
24. What is a virtual address?
25. Mention any two techniques used to solve the external fragmentation.
26. List the two broad categories of page replacement algorithms.
27. Specify any two types of file access methods.
28. Mention any two types of velocity are used in disk track access mechanisms
29. List the two factors which decide the efficiency of the use of disk space.
30. What is the main advantage of multiprogramming?
31. The interface between the operating system and the user sitting at a terminal is called as ____________.
32. What does a process control block contain?
33. Operating Systems provide a means for cooperating processes to communicate with each other through ________________________.
34. If the system can allocate resources to each process in some order and still avoid a deadlock, then the system is said to be in _____________
35. Mention the synchronization constructs used when semaphores are used incorrectly to solve critical section problem.
36. A process is ___________ if it is spending more time paging than executing.

Part – C

37. Mention any two methods implemented to manage free space list in files.
38. What are the main factors to be dealt with respect to disk scheduling?
39. What are the several aspects of disk management?
40. What are the advantages of multiprocessors system?
41. State various states of a process.
42. What are the common types of thread implementation?
43. What is dispatcher?
44. State the sequence of the utilization of a resource for a process.
45. What do you mean by overlays?
46. What is a lazy swapper?
47. State the types of path names.
48. What does a file control block (FCB) contains?
49. State three major approaches of allocating disk space.
50. _________ is a program that manages the computer hardware.
51. A _______ is a collection of related information defined by its creator.
52. A thread is a ________ process.
53. The time taken for the dispatcher to stop one process and start another running process is known as dispatch _________.
54. Mention the four necessary conditions required for the occurrence of the deadlock.
55. Deadlocks can be described more precisely in terms of a directed graph called _______ graph.
56. _________ memory is a technique that allows the execution of process that may not be completely in memory.
57. The user who created the file is called as ______.
58. ________ contains information about the file, including ownership, permissions and location of the file contents.
59. Specify the three major methods used for allocating the disk space.
60. List the four components of computer system
61. Define Command Interpreter
62. What are the benefits of multithreaded programming?
63. What are the two basic models of Inter Process Communication?
64. What are the necessary conditions of deadlock situation?
65. Define Preemptive Kernel
66. Write the formula for effective access time
67. What are the benefits of slap allocator?
68. List the performance issues of tertiary – storage
69. Define Buffer
70. What is a System Call?
71. What do you mean by a Control Card?
72. Define Socket
73. Name the two fundamental models of inter process communication.
74. What do you mean by dispatch latency?
75. What is a transaction?
76. When will you say that the system is in safe state?
77. Define paging
78. What is an interrupt?
79. Brief Belady’s Anomaly.
80. What is meant by resident monitor?
81. An operating system that is capable of allowing multiple software processes to run at the same time is called ____________.
82. A process which has just terminated but has to relinquish the resource is called____________.
83. Define safe state.
84. What is meant by external fragmentation?
85. Who performs garbage collection?
86. The high paging activity is called ____________.
87. List the different access methods of file system.
88. What is meant by physical formatting?
89. Define Kernel.
90. What is layered approach?
91. What is a state?
92. What is FCFS?
93. Write the Little’s formula.
94. What do you mean by deadlock prevention?
95. State two levels of process termination.
96. The string of memory reference is called ____________.
97. Write the two types of page replacement algorithms.
98. What is a controller?
99. What do you mean by sector sparing?
100. How are system calls useful?
101. What is the advantage of Microkernel approach to system design?
102. What information does an operating system generally need to keep about running processes in order to execute them?
103. Assume that a system consists of four resources of same type, they are shared by three processes, each of which needs almost two resources. Show that the system is deadlock free.
104. What are monitors?
105. What is paging?
106. What do you mean by Belady’s anomaly?
107. State the use of block device.
108. What is the need of RAID concept?
109. Write the name of any one distributed operating system.
110. Define Dual-Mode operation.
111. Define Process.
112. What is meant by thread? Specify the benefits of multithreaded programming.
113. Define Dispatch latency.
114. Define fragmentation and its types.
115. What is meant by thrashing?
116. What are the different types of file access methods?
117. What are the characteristics of Deadlock?
118. Define Rotational latency.
119. What are the different types of disk formatting?
120. What are the modes of operations?
121. Write any two application programs.
122. Define RMI.
123. What is throughput?
124. What are the approaches used to handle Critical Section?
125. How do you ensure that the deadlocks never occur?
126. Write any four file attributes.
127. What is a hash table?
128. How do computers access disk storage?
129. What is seek time?
130. Software may trigger an interrupt by executing a special operation called a _________.
131. List the main advantages of multiprocessor systems.
132. Define process.
133. Mention any two properties of CPU scheduling algorithms.
134. No two processes are executing in their critical sections at the same time. Say True or False.
135. What is safe state?
136. What is thrashing?
137. Name the file access methods.
138. What is the drawback of network-attached storage systems?
139. What is a spool?
140. What is the function of an operating system?
141. What is LAN?
142. Define process.
143. What do you mean by Turnaround time?
144. What are the necessary conditions for a deadlock to occur?
145. What do you mean by compaction?
146. What is the principle of optimal page replacement algorithm?
147. What do you mean by absolute pathname?
148. Why is disk scheduling important?
149. What is RAID level1?
150. What is meant by real time operating systems?
151. Compare loosely coupled and tightly coupled system.
152. What is meant by context switch?
153. What are the benefits of multithreaded programming?
154. What are the three requirements that a solution to the critical-section problem satisfy?
155. Define deadlock.
156. What is compaction?
157. How do you compute the effective access time for a demand-page system?
158. What is latency time?
159. What are streams
160. Define the degree of Multiprogramming.
161. Specify the most heavily used system calls for File Management.
162. Define Process.
163. What is a Context Switch?
164. What is a Binary semaphore?
165. State the conditions for Deadlock.
166. What is thrashing?
167. What data type is File?
168. Define seek time.
169. What are the advantages of using disk over Main Memory for storage?
170. Define context switch.
171. What are System calls?
172. Define a thread.
173. What are preemptive and non-preemptive scheduling?
174. State the assumption behind the bounded buffer producer consumer problem.
175. List the four conditions for deadlock.
176. Define Virtual memory.
177. What is the purpose of paging the page tables?
178. Mention the importance of swap-space management.
179. What is the kernel of an OS?
180. A single-threaded process has one ________ to specifying the next instruction to execute.