IMPORTANT QUESTION AND ANSWER OF OPERATING SYSTEM

1 - Explain the concept of Reentrancy?

It is a useful, memory-saving technique for multiprogrammed timesharing systems. A Reentrant Procedure is one in which multiple users can share a single copy of a program during the same period. Reentrancy has 2 key aspects: The program code cannot modify itself, and the local data for each user process must be stored separately. Thus, the permanent part is the code, and the temporary part is the pointer back to the calling program and local variables used by that program. Each execution instance is called activation. It executes the code in the permanent part, but has its own copy of local variables/parameters. The temporary part associated with each activation is the activation record. Generally, the activation record is kept on the stack.
Note: A reentrant procedure can be interrupted and called by an interrupting program, and still execute correctly on returning to the procedure.

2. Explain Belady's Anomaly?

Also called FIFO anomaly. Usually, on increasing the number of frames allocated to a process virtual memory, the process execution is faster, because fewer page faults occur. Sometimes, the reverse happens, i.e., the execution time increases even when more frames are allocated to the process. This is Belady's Anomaly. This is true for certain page reference patterns.

3. What is a binary semaphore? What is its use?

A binary semaphore is one, which takes only 0 and 1 as values. They are used to implement mutual exclusion and synchronize concurrent processes.

4. What is thrashing?

It is a phenomenon in virtual memory schemes when the processor spends most of its time swapping pages, rather than executing instructions. This is due to an inordinate number of page faults.

5. List the Coffman's conditions that lead to a deadlock.

1. Mutual Exclusion: Only one process may use a critical resource at a time.
2. Hold & Wait: A process may be allocated some resources while waiting for others.
3. No Pre-emption: No resource can be forcible removed from a process holding it.
4. Circular Wait: A closed chain of processes exist such that each process holds at least one resource needed by another process in the chain.

6. What are short, long and medium-term scheduling?

Long term scheduler determines which programs are admitted to the system for processing. It controls the degree of multiprogramming. Once admitted, a job becomes a process.

Medium term scheduling is part of the swapping function. This relates to processes that are in a blocked or suspended state. They are swapped out of real-memory until they are ready to execute. The swapping-in decision is based on memory-management criteria.

Short term scheduler, also know as a dispatcher executes most frequently, and makes the finest-grained decision of which process should execute next. This scheduler is invoked whenever an event occurs. It may lead to interruption of one process by preemption.

. What are turnaround time and response time?

Turnaround time is the interval between the submission of a job and its completion. Response time is the interval between submission of a request, and the first response to that request.

8. What are the typical elements of a process image?

User data: Modifiable part of user space. May include program data, user stack area, and programs that may be modified.
User program: The instructions to be executed.
System Stack: Each process has one or more LIFO stacks associated with it. Used to store parameters and calling addresses for procedure and system calls.
Process control Block (PCB): Info needed by the OS to control processes.

9. What is the Translation Lookaside Buffer (TLB)?

In a cached system, the base addresses of the last few referenced pages is maintained in registers called the TLB that aids in faster lookup. TLB contains those page-table entries that have been most recently used. Normally, each virtual memory reference causes 2 physical memory accesses- one to fetch appropriate page-table entry, and one to fetch the desired data. Using TLB in-between, this is reduced to just one physical memory access in cases of TLB-hit.

10. What is the resident set and working set of a process?

Resident set is that portion of the process image that is actually in real-memory at a particular instant. Working set is that subset of resident set that is actually needed for execution. (Relate this to the variable-window size method for swapping techniques.)

11. When is a system in safe state?

The set of dispatchable processes is in a safe state if there exists at least one temporal order in which all processes can be run to completion without resulting in a deadlock.

12. What is cycle stealing?

We encounter cycle stealing in the context of Direct Memory Access (DMA). Either the DMA controller can use the data bus when the CPU does not need it, or it may force the CPU to temporarily suspend operation. The latter technique is called cycle stealing. Note that cycle stealing can be done only at specific break points in an instruction cycle.

What is meant by arm-stickiness?

If one or a few processes have a high access rate to data on one track of a storage disk, then they may monopolize the device by repeated requests to that track. This generally happens with most common device scheduling algorithms (LIFO, SSTF, C-SCAN, etc). High-density multisurface disks are more likely to be affected by this than low density ones.

14. What are the stipulations of C2 level security?

C2 level security provides for:

1. Discretionary Access Control
2. Identification and Authentication
3. Auditing
4. Resource reuse

15. What is busy waiting?

The repeated execution of a loop of code while waiting for an event to occur is called busy-waiting. The CPU is not engaged in any real productive activity during this period, and the process does not progress toward completion.

16. Explain the popular multiprocessor thread-scheduling strategies.

1. Load Sharing: Processes are not assigned to a particular processor. A global queue of threads is maintained. Each processor, when idle, selects a thread from this queue. Note that load balancing refers to a scheme where work is allocated to processors on a more permanent basis.
2. Gang Scheduling: A set of related threads is scheduled to run on a set of processors at the same time, on a 1-to-1 basis. Closely related threads / processes may be scheduled this way to reduce synchronization blocking, and minimize process switching. Group scheduling predated this strategy.
3. Dedicated processor assignment: Provides implicit scheduling defined by assignment of threads to processors. For the duration of program execution, each program is allocated a set of processors equal in number to the number of threads in the program. Processors are chosen from the available pool.
4. Dynamic scheduling: The number of thread in a program can be altered during the course of execution.

17. When does the condition 'rendezvous' arise?

In message passing, it is the condition in which, both, the sender and receiver are blocked until the message is delivered.

18. What is a trap and trapdoor?

Trapdoor is a secret undocumented entry point into a program used to grant access without normal methods of access authentication. A trap is a software interrupt, usually the result of an error condition.

What are local and global page replacements?

Local replacement means that an incoming page is brought in only to the relevant process address space. Global replacement policy allows any page frame from any process to be replaced. The latter is applicable to variable partitions model only.

20. Define latency, transfer and seek time with respect to disk I/O.

Seek time is the time required to move the disk arm to the required track. Rotational delay or latency is the time it takes for the beginning of the required sector to reach the head. Sum of seek time (if any) and latency is the access time. Time taken to actually transfer a span of data is transfer time.

21. Describe the Buddy system of memory allocation.

Free memory is maintained in linked lists, each of equal sized blocks. Any such block is of size 2^k. When some memory is required by a process, the block size of next higher order is chosen, and broken into two. Note that the two such pieces differ in address only in their kth bit. Such pieces are called buddies. When any used block is freed, the OS checks to see if its buddy is also free. If so, it is rejoined, and put into the original free-block linked-list.

22. What is time-stamping?

It is a technique proposed by Lamport, used to order events in a distributed system without the use of clocks. This scheme is intended to order events consisting of the transmission of messages. Each system 'i' in the network maintains a counter Ci. Every time a system transmits a message, it increments its counter by 1 and attaches the time-stamp Ti to the message. When a message is received, the receiving system 'j' sets its counter Cj to 1 more than the maximum of its current value and the incoming time-stamp Ti. At each site, the ordering of messages is determined by the following rules: For messages x from site i and y from site j, x precedes y if one of the following conditions holds....(a) if Ti<Tj or (b) if Ti=Tj and i<j.

23. How are the wait/signal operations for monitor different from those for semaphores?

If a process in a monitor signal and no task is waiting on the condition variable, the signal is lost. So this allows easier program design. Whereas in semaphores, every operation affects the value of the semaphore, so the wait and signal operations should be perfectly balanced in the program.

24. In the context of memory management, what are placement and replacement algorithms?

Placement algorithms determine where in available real-memory to load a program. Common methods are first-fit, next-fit, best-fit. Replacement algorithms are used when memory is full, and one process (or part of a process) needs to be swapped out to accommodate a new program. The replacement algorithm determines which are the partitions to be swapped out.

In loading programs into memory, what is the difference between load-time dynamic linking and run-time dynamic linking?

For load-time dynamic linking: Load module to be loaded is read into memory. Any reference to a target external module causes that module to be loaded and the references are updated to a relative address from the start base address of the application module.

With run-time dynamic loading: Some of the linking is postponed until actual reference during execution. Then the correct module is loaded and linked.

26. What are demand-paging and pre-paging?

With demand paging, a page is brought into memory only when a location on that page is actually referenced during execution. With pre-paging, pages other than the one demanded by a page fault are brought in. The selection of such pages is done based on common access patterns, especially for secondary memory devices.

27. Paging a memory management function, while multiprogramming a processor management function, are the two interdependent?

Yes.

28. What is page cannibalizing?

Page swapping or page replacements are called page cannibalizing.

29. What has triggered the need for multitasking in PCs?

1. Increased speed and memory capacity of microprocessors together with the support fir virtual memory and
2. Growth of client server computing

30. What are the four layers that Windows NT have in order to achieve independence?

1. Hardware abstraction layer
2. Kernel
3. Subsystems
4. System Services.

5.      1. What is an operating system?

6.      An operating system is a program that acts as an intermediary between the user and the computer hardware. The purpose of an OS is to provide a convenient environment in which user can execute programs in a convenient and efficient manner.

7.      What are the different operating systems?

8.      1.     Batched operating systems

9.      2.     Multi-programmed operating systems

10.  3.     timesharing operating systems

11.  4.     Distributed operating systems

12.  5.     Real-time operating systems

13.   

14.  3. What are the basic functions of an operating system?

15.  Operating system controls and coordinates the use of the hardware among the various applications programs for various uses. Operating system acts as resource allocator and manager. Also operating system is control program which controls the user programs to prevent errors and improper use of the computer. It is especially concerned with the operation and control of I/O devices.
 

16.  4. What is kernel? 

17.  Kernel is the core and essential part of computer operating system that provides basic services for all parts of OS.
 

18.  5. What is difference between micro kernel and macro kernel?

19.  Micro kernel is a kernel which run services those are minimal for operating system performance. In this kernel all other operations are performed by processor.

20.  Macro Kernel is a combination of micro and monolithic kernel. In monolithic kernel all operating system code is in single executable image.
 

21.  6. What is dead lock?

22.  Deadlock is a situation or condition where the two processes are waiting for each other to complete so that they can start. This result both the processes to hang.

23.  7. What is a process?

24.  A program in execution is called a process.

25.  Processes are of two types:
1. Operating system processes
2. User processes
 

26.  8. What are the states of a process?

27.  1. New
2. Running
3. Waiting
4. Ready
5. Terminated
 

28.  9. What is starvation and aging?

29.  Starvation is Resource management problem where a process does not get the resources it needs for a long time because the resources are being allocated to other processes.

30.  Aging is a technique to avoid starvation in a scheduling system.

31.   

32.  10. What is semaphore?

33.  Semaphore is a variable, whose status reports common resource, Semaphore is of two types one is Binary semaphore and other is Counting semaphore.
 

34.  11. What is context switching?

35.  Transferring the control from one process to other process requires saving the state of the old process and loading the saved state for new process. This task is known as context switching.
 

36.  12. What is a thread?

37.  A thread is a program line under execution. Thread sometimes called a light-weight process, is a basic unit of CPU utilization; it comprises a thread id, a program counter, a register set, and a stack
 

38.  13. What is process synchronization?

39.  A situation, where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called race condition. To guard against the race condition we need to ensure that only one process at a time can be manipulating the same data. The technique we use for this is called process synchronization.

40.   

41.  14. What is virtual memory?

42.  Virtual memory is hardware technique where the system appears to have more memory that it actually does. This is done by time-sharing, the physical memory and storage parts of the memory one disk when they are not actively being used.

43.   

44.  15. What is thrashing?

45.  It is a phenomenon in virtual memory schemes when the processor spends most of its time swapping pages, rather than executing instructions. This is due to an inordinate number of page faults.

46.   

47.  16. What is fragmentation? Tell about different types of fragmentation?

48.  When many of free blocks are too small to satisfy any request then fragmentation occurs. External fragmentation and internal fragmentation are two types of fragmentation. External Fragmentation happens when a dynamic memory allocation algorithm allocates some memory and a small piece is left over that cannot be effectively used.  Internal fragmentation is the space wasted inside of allocated memory blocks because of restriction on the allowed sizes of allocated blocks.

49.   

50.  17. What are necessary conditions for dead lock?

51.  1. Mutual exclusion (where at least one resource is non-sharable)

52.  2. Hold and wait (where a process holds one resource and waits for other resource)

53.  3. No preemption (where the resources can’t be preempted)

54.  4. Circular wait (where p[i] is waiting for p[j] to release a resource. i= 1,2,…n

55.  j=if (i!=n) then i+1

56.  else 1 )

57.   

58.  18. What is cache memory?

59.  Cache memory is random access memory (RAM) that a computer microprocessor can access more quickly than it can access regular RAM. As the microprocessor processes data, it looks first in the cache memory and if it finds the data there (from a previous reading of data), it does not have to do the more time-consuming reading of data from larger memory.

60.   

61.  19. What is logical and physical addresses space?

62.  Logical address space is generated from CPU; it bound to a separate physical address space is central to proper memory management. Physical address space is seen by the memory unit. Logical address space is virtual address space. Both these address space will be same at compile time but differ at execution time.

63.   

64.  20. Differentiate between Complier and Interpreter?

65.  An interpreter reads one instruction at a time and carries out the actions implied by that instruction. It does not perform any translation. But a compiler translates the entire instructions

66.   

67.  21. What is Throughput, Turnaround time, waiting time and Response time?

68.  Throughput – number of processes that complete their execution per time unit

69.  Turnaround time – amount of time to execute a particular process

70.  Waiting time – amount of time a process has been waiting in the ready queue

71.  Response time – amount of time it takes from when a request was submitted until the first response is produced, not output (for time-sharing environment)

72.   

73.  22. What is Memory-Management Unit (MMU)?

74.  Hardware device that maps virtual to physical address. In MMU scheme, the value in the relocation register is added to every address generated by a user process at the time it is sent to memory.

75.  ->The user program deals with logical addresses; it never sees the real physical addresses

76.   

77.  23. What is a Real-Time System?

78.  A real time process is a process that must respond to the events within a certain time period. A real time operating system is an operating system that can run real time processes successfully

79.   

80.  24. What is a trap and trapdoor?

81.  Trapdoor is a secret undocumented entry point into a program used to grant access without normal methods of access authentication. A trap is a software interrupt, usually the result of an error condition.

82.   

83.  25. When is a system in safe state?

84.  The set of dispatchable processes is in a safe state if there exists at least one temporal order in which all processes can be run to completion without resulting in a deadlock.

85.   

86.  26. Explain the concept of the Distributed systems?

87.  Distributed systems work in a network. They can share the network resources, communicate with each other.

88.   

89.  27. What is cache-coherency?

90.  In a multiprocessor system there exist several caches each may containing a copy of same variable A. Then a change in one cache should immediately be reflected in all other caches this process of maintaining the same value of a data in all the caches s called cache-coherency.

91.   

92.  28. What is a long term scheduler & short term schedulers?

93.  Long term schedulers are the job schedulers that select processes from the job queue and load them into memory for execution. The short term schedulers are the CPU schedulers that select a process from the ready queue and allocate the CPU to one of them.

94.   

95.  29. Explain the meaning of mutex.

96.  Mutex is the short form for ‘Mutual Exclusion object’. A mutex allows multiple threads for sharing the same resource. The resource can be file. A mutex with a unique name is created at the time of starting a program. A mutex must be locked from other threads, when any thread that needs the resource. When the data is no longer used / needed, the mutex is set to unlock.

97.   

98.  30. What is cycle stealing?

99.  We encounter cycle stealing in the context of Direct Memory Access (DMA). Either the DMA controller can use the data bus when the CPU does not need it, or it may force the CPU to temporarily suspend operation. The latter technique is called cycle stealing. Note that cycle stealing can be done only at specific break points in an instruction cycle.

100.                       

101.                      31. What is Marshalling?

102.                      The process of packaging and sending interface method parameters across thread or process boundaries.

103.                       

104.                      32. What is a daemon?

105.                      Daemon is a program that runs in the background without user’s interaction. A daemon runs in a multitasking operating system like UNIX. A daemon is initiated and controlled by special programs known as ‘processes’.

106.                       

107.                      33. What is pre-emptive and non-preemptive scheduling?

108.                      Preemptive scheduling: The preemptive scheduling is prioritized. The highest priority process should always be the process that is currently utilized.

109.                      Non-Preemptive scheduling: When a process enters the state of running, the state of that process is not deleted from the scheduler until it finishes its service time.

110.                       

111.                      34. What is busy waiting?

112.                      The repeated execution of a loop of code while waiting for an event to occur is called busy-waiting. The CPU is not engaged in any real productive activity during this period, and the process does not progress toward completion.

113.                       

114.                      35. What is page cannibalizing?

115.                      Page swapping or page replacements are called page cannibalizing.

116.                       

117.                      36. What is SMP?

118.                      To achieve maximum efficiency and reliability a mode of operation known as symmetric multiprocessing is used. In essence, with SMP any process or threads can be assigned to any processor.

119.                       

120.                      37. What is process migration?

121.                      It is the transfer of sufficient amount of the state of process from one machine to the target machine.

122.                       

123.                      38. Difference between Primary storage and secondary storage?

124.                      Primary memory is the main memory (Hard disk, RAM) where the operating system resides.

125.                      Secondary memory can be external devices like CD, floppy magnetic discs etc. secondary storage cannot be directly accessed by the CPU and is also external memory storage.

126.                       

127.                      39. Define compactions.

128.                      Compaction is a process in which the free space is collected in a large memory chunk to make some space available for processes.

129.                       

130.                      40. What are residence monitors?

131.                      Early operating systems were called residence monitors.

132.                       

133.                      41. What is dual-mode operation?

134.                      In order to protect the operating systems and the system programs from the malfunctioning programs the two mode operations were evolved
System mode
User mode.

135.                       

136.                      42. What is a device queue?

137.                      A list of processes waiting for a particular I/O device is called device queue.

138.                       

139.                      43. What are the different types of Real-Time Scheduling?

140.                      Hard real-time systems required to complete a critical task within a guaranteed amount of time.
Soft real-time computing requires that critical processes receive priority over less fortunate ones.

141.                       

142.                      44. What is relative path and absolute path?

143.                      Absolute path-- Exact path from root directory.
Relative path-- Relative to the current path.

144.                       

145.                      45. What are the disadvantages of context switching?

146.                      Time taken for switching from one process to other is pure over head. Because the system does no useful work while switching. So one of the solutions is to go for threading when ever possible.

147.                       

148.                      46. What is a data register and address register?

149.                      Data registers - can be assigned to a variety of functions by the programmer. They can be used with any machine instruction that performs operations on data.
Address registers - contain main memory addresses of data and instructions or they contain a portion of the address that is used in the calculation of the complete addresses.

150.                       

151.                      47. What is DRAM?  

152.                      Dynamic Ram stores the data in the form of Capacitance, and Static RAM stores the data in Voltages.

153.                       

154.                      48. What are local and global page replacements?  

155.                      Local replacement means that an incoming page is brought in only to the relevant process' address space. Global replacement policy allows any page frame from any process to be replaced. The latter is applicable to variable partitions model only.

156.                       

157.                      49. Explain the concept of the batched operating systems?  

158.                      In batched operating system the users gives their jobs to the operator who sorts the programs according to their requirements and executes them. This is time consuming but makes the CPU busy all the time.

159.                       

160.                      50. What is SCSI?

161.                      SCSI - Small computer systems interface is a type of interface used for computer components such as hard drives, optical drives, scanners and tape drives. It is a competing technology to standard IDE (Integrated Drive Electronics).

162.                       

163.                      51.When is a system in safe state?

164.                      The set of dispatchable processes is in a safe state if there exists at least one temporal order in which all processes can be run to completion without resulting in a deadlock.
 

165.                       

166.                      52. What is cycle stealing?

167.                      We encounter cycle stealing in the context of Direct Memory Access (DMA). Either the DMA controller can use the data bus when the CPU does not need it, or it may force the CPU to temporarily suspend operation. The latter technique is called cycle stealing. Note that cycle stealing can be done only at specific break points in an instruction cycle.
 

168.                      53. What is an idle thread?

169.                      The special thread a dispatcher will execute when no ready thread is found.
 

170.                      54. What is FtDisk?

171.                      It is a fault tolerance disk driver for Windows NT.
 

172.                      55.What is  Dispatcher?

173.                      Dispatcher module gives control of the CPU to the process selected by the short-term scheduler; this involves: Switching context, Switching to user mode, Jumping to the proper location in the user program to restart that program, dispatch latency – time it takes for the dispatcher to stop one process and start another running.
 

174.                      56. When does the condition 'rendezvous' arise?

175.                      In message passing, it is the condition in which, both, the sender and receiver are blocked until the message is delivered.
 

176.                      57. What is process spawning?

177.                      When the OS at the explicit request of another process creates a process, this action is called process spawning
 

178.                      58. What are the reasons for process suspension?
1) swapping
2) interactive user request
3) timing
4) parent process request

179.                       

180.                      59. What are the sub-components of I/O manager in Windows NT?
1) Network redirector/ Server
2) Cache manager.
3) File systems
4) Network driver
5) Device driver
 

181.                      60. What is a drawback of MVT?
1) ability to support multiple processors
2) virtual storage
3) source level debugging

182.                      What are the different operating systems?

183.                      1.     Batched operating systems

184.                      2.     Multi-programmed operating systems

185.                      3.     timesharing operating systems

186.                      4.     Distributed operating systems

187.                      5.     Real-time operating systems

188.                       

189.                      3. What are the basic functions of an operating system?

190.                      Operating system controls and coordinates the use of the hardware among the various applications programs for various uses. Operating system acts as resource allocator and manager. Also operating system is control program which controls the user programs to prevent errors and improper use of the computer. It is especially concerned with the operation and control of I/O devices.
 

191.                      4. What is kernel? 

192.                      Kernel is the core and essential part of computer operating system that provides basic services for all parts of OS.
 

193.                      5. What is difference between micro kernel and macro kernel?

194.                      Micro kernel is a kernel which run services those are minimal for operating system performance. In this kernel all other operations are performed by processor.

195.                      Macro Kernel is a combination of micro and monolithic kernel. In monolithic kernel all operating system code is in single executable image.
 

196.                      6. What is dead lock?

197.                      Deadlock is a situation or condition where the two processes are waiting for each other to complete so that they can start. This result both the processes to hang.

198.                      7. What is a process?

199.                      A program in execution is called a process.

200.                      Processes are of two types:
1. Operating system processes
2. User processes
 

201.                      8. What are the states of a process?

202.                      1. New
2. Running
3. Waiting
4. Ready
5. Terminated
 

203.                      9. What is starvation and aging?

204.                      Starvation is Resource management problem where a process does not get the resources it needs for a long time because the resources are being allocated to other processes.

205.                      Aging is a technique to avoid starvation in a scheduling system.

206.                       

207.                      10. What is semaphore?

208.                      Semaphore is a variable, whose status reports common resource, Semaphore is of two types one is Binary semaphore and other is Counting semaphore.
 

209.                      11. What is context switching?

210.                      Transferring the control from one process to other process requires saving the state of the old process and loading the saved state for new process. This task is known as context switching.
 

211.                      12. What is a thread?

212.                      A thread is a program line under execution. Thread sometimes called a light-weight process, is a basic unit of CPU utilization; it comprises a thread id, a program counter, a register set, and a stack
 

213.                      13. What is process synchronization?

214.                      A situation, where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called race condition. To guard against the race condition we need to ensure that only one process at a time can be manipulating the same data. The technique we use for this is called process synchronization.

215.                       

216.                      14. What is virtual memory?

217.                      Virtual memory is hardware technique where the system appears to have more memory that it actually does. This is done by time-sharing, the physical memory and storage parts of the memory one disk when they are not actively being used.

218.                       

219.                      15. What is thrashing?

220.                      It is a phenomenon in virtual memory schemes when the processor spends most of its time swapping pages, rather than executing instructions. This is due to an inordinate number of page faults.

221.                       

222.                      16. What is fragmentation? Tell about different types of fragmentation?

223.                      When many of free blocks are too small to satisfy any request then fragmentation occurs. External fragmentation and internal fragmentation are two types of fragmentation. External Fragmentation happens when a dynamic memory allocation algorithm allocates some memory and a small piece is left over that cannot be effectively used.  Internal fragmentation is the space wasted inside of allocated memory blocks because of restriction on the allowed sizes of allocated blocks.

224.                       

225.                      17. What are necessary conditions for dead lock?

226.                      1. Mutual exclusion (where at least one resource is non-sharable)

227.                      2. Hold and wait (where a process holds one resource and waits for other resource)

228.                      3. No preemption (where the resources can’t be preempted)

229.                      4. Circular wait (where p[i] is waiting for p[j] to release a resource. i= 1,2,…n

230.                      j=if (i!=n) then i+1

231.                      else 1 )

232.                       

233.                      18. What is cache memory?

234.                      Cache memory is random access memory (RAM) that a computer microprocessor can access more quickly than it can access regular RAM. As the microprocessor processes data, it looks first in the cache memory and if it finds the data there (from a previous reading of data), it does not have to do the more time-consuming reading of data from larger memory.

235.                       

236.                      19. What is logical and physical addresses space?

237.                      Logical address space is generated from CPU; it bound to a separate physical address space is central to proper memory management. Physical address space is seen by the memory unit. Logical address space is virtual address space. Both these address space will be same at compile time but differ at execution time.

238.                       

239.                      20. Differentiate between Complier and Interpreter?

240.                      An interpreter reads one instruction at a time and carries out the actions implied by that instruction. It does not perform any translation. But a compiler translates the entire instructions

241.                       

242.                      21. What is Throughput, Turnaround time, waiting time and Response time?

243.                      Throughput – number of processes that complete their execution per time unit

244.                      Turnaround time – amount of time to execute a particular process

245.                      Waiting time – amount of time a process has been waiting in the ready queue

246.                      Response time – amount of time it takes from when a request was submitted until the first response is produced, not output (for time-sharing environment)

247.                       

248.                      22. What is Memory-Management Unit (MMU)?

249.                      Hardware device that maps virtual to physical address. In MMU scheme, the value in the relocation register is added to every address generated by a user process at the time it is sent to memory.

250.                      ->The user program deals with logical addresses; it never sees the real physical addresses

251.                       

252.                      23. What is a Real-Time System?

253.                      A real time process is a process that must respond to the events within a certain time period. A real time operating system is an operating system that can run real time processes successfully

254.                       

255.                      24. What is a trap and trapdoor?

256.                      Trapdoor is a secret undocumented entry point into a program used to grant access without normal methods of access authentication. A trap is a software interrupt, usually the result of an error condition.

257.                       

258.                      25. When is a system in safe state?

259.                      The set of dispatchable processes is in a safe state if there exists at least one temporal order in which all processes can be run to completion without resulting in a deadlock.

260.                       

261.                      26. Explain the concept of the Distributed systems?

262.                      Distributed systems work in a network. They can share the network resources, communicate with each other.

263.                       

264.                      27. What is cache-coherency?

265.                      In a multiprocessor system there exist several caches each may containing a copy of same variable A. Then a change in one cache should immediately be reflected in all other caches this process of maintaining the same value of a data in all the caches s called cache-coherency.

266.                       

267.                      28. What is a long term scheduler & short term schedulers?

268.                      Long term schedulers are the job schedulers that select processes from the job queue and load them into memory for execution. The short term schedulers are the CPU schedulers that select a process from the ready queue and allocate the CPU to one of them.

269.                       

270.                      29. Explain the meaning of mutex.

271.                      Mutex is the short form for ‘Mutual Exclusion object’. A mutex allows multiple threads for sharing the same resource. The resource can be file. A mutex with a unique name is created at the time of starting a program. A mutex must be locked from other threads, when any thread that needs the resource. When the data is no longer used / needed, the mutex is set to unlock.

272.                       

273.                      30. What is cycle stealing?

274.                      We encounter cycle stealing in the context of Direct Memory Access (DMA). Either the DMA controller can use the data bus when the CPU does not need it, or it may force the CPU to temporarily suspend operation. The latter technique is called cycle stealing. Note that cycle stealing can be done only at specific break points in an instruction cycle.

275.                       

276.                      31. What is Marshalling?

277.                      The process of packaging and sending interface method parameters across thread or process boundaries.

278.                       

279.                      32. What is a daemon?

280.                      Daemon is a program that runs in the background without user’s interaction. A daemon runs in a multitasking operating system like UNIX. A daemon is initiated and controlled by special programs known as ‘processes’.

281.                       

282.                      33. What is pre-emptive and non-preemptive scheduling?

283.                      Preemptive scheduling: The preemptive scheduling is prioritized. The highest priority process should always be the process that is currently utilized.

284.                      Non-Preemptive scheduling: When a process enters the state of running, the state of that process is not deleted from the scheduler until it finishes its service time.

285.                       

286.                      34. What is busy waiting?

287.                      The repeated execution of a loop of code while waiting for an event to occur is called busy-waiting. The CPU is not engaged in any real productive activity during this period, and the process does not progress toward completion.

288.                       

289.                      35. What is page cannibalizing?

290.                      Page swapping or page replacements are called page cannibalizing.

291.                       

292.                      36. What is SMP?

293.                      To achieve maximum efficiency and reliability a mode of operation known as symmetric multiprocessing is used. In essence, with SMP any process or threads can be assigned to any processor.

294.                       

295.                      37. What is process migration?

296.                      It is the transfer of sufficient amount of the state of process from one machine to the target machine.

297.                       

298.                      38. Difference between Primary storage and secondary storage?

299.                      Primary memory is the main memory (Hard disk, RAM) where the operating system resides.

300.                      Secondary memory can be external devices like CD, floppy magnetic discs etc. secondary storage cannot be directly accessed by the CPU and is also external memory storage.

301.                       

302.                      39. Define compactions.

303.                      Compaction is a process in which the free space is collected in a large memory chunk to make some space available for processes.

304.                       

305.                      40. What are residence monitors?

306.                      Early operating systems were called residence monitors.

307.                       

308.                      41. What is dual-mode operation?

309.                      In order to protect the operating systems and the system programs from the malfunctioning programs the two mode operations were evolved
System mode
User mode.

310.                       

311.                      42. What is a device queue?

312.                      A list of processes waiting for a particular I/O device is called device queue.

313.                       

314.                      43. What are the different types of Real-Time Scheduling?

315.                      Hard real-time systems required to complete a critical task within a guaranteed amount of time.
Soft real-time computing requires that critical processes receive priority over less fortunate ones.

316.                       

317.                      44. What is relative path and absolute path?

318.                      Absolute path-- Exact path from root directory.
Relative path-- Relative to the current path.

319.                       

320.                      45. What are the disadvantages of context switching?

321.                      Time taken for switching from one process to other is pure over head. Because the system does no useful work while switching. So one of the solutions is to go for threading when ever possible.

322.                       

323.                      46. What is a data register and address register?

324.                      Data registers - can be assigned to a variety of functions by the programmer. They can be used with any machine instruction that performs operations on data.
Address registers - contain main memory addresses of data and instructions or they contain a portion of the address that is used in the calculation of the complete addresses.

325.                       

326.                      47. What is DRAM?  

327.                      Dynamic Ram stores the data in the form of Capacitance, and Static RAM stores the data in Voltages.

328.                       

329.                      48. What are local and global page replacements?  

330.                      Local replacement means that an incoming page is brought in only to the relevant process' address space. Global replacement policy allows any page frame from any process to be replaced. The latter is applicable to variable partitions model only.

331.                       

332.                      49. Explain the concept of the batched operating systems?  

333.                      In batched operating system the users gives their jobs to the operator who sorts the programs according to their requirements and executes them. This is time consuming but makes the CPU busy all the time.

334.                       

335.                      50. What is SCSI?

336.                      SCSI - Small computer systems interface is a type of interface used for computer components such as hard drives, optical drives, scanners and tape drives. It is a competing technology to standard IDE (Integrated Drive Electronics).

337.                       

338.                      51.When is a system in safe state?

339.                      The set of dispatchable processes is in a safe state if there exists at least one temporal order in which all processes can be run to completion without resulting in a deadlock.
 

340.                       

341.                      52. What is cycle stealing?

342.                      We encounter cycle stealing in the context of Direct Memory Access (DMA). Either the DMA controller can use the data bus when the CPU does not need it, or it may force the CPU to temporarily suspend operation. The latter technique is called cycle stealing. Note that cycle stealing can be done only at specific break points in an instruction cycle.
 

343.                      53. What is an idle thread?

344.                      The special thread a dispatcher will execute when no ready thread is found.
 

345.                      54. What is FtDisk?

346.                      It is a fault tolerance disk driver for Windows NT.
 

347.                      55.What is  Dispatcher?

348.                      Dispatcher module gives control of the CPU to the process selected by the short-term scheduler; this involves: Switching context, Switching to user mode, Jumping to the proper location in the user program to restart that program, dispatch latency – time it takes for the dispatcher to stop one process and start another running.
 

349.                      56. When does the condition 'rendezvous' arise?

350.                      In message passing, it is the condition in which, both, the sender and receiver are blocked until the message is delivered.
 

351.                      57. What is process spawning?

352.                      When the OS at the explicit request of another process creates a process, this action is called process spawning
 

353.                      58. What are the reasons for process suspension?
1) swapping
2) interactive user request
3) timing
4) parent process request

354.                       

355.                      59. What are the sub-components of I/O manager in Windows NT?
1) Network redirector/ Server
2) Cache manager.
3) File systems
4) Network driver
5) Device driver
 

356.                      60. What is a drawback of MVT?
1) ability to support multiple processors
2) virtual storage
3) source level debugging