What is the turnaround time of each process for each of the scheduling algorithms in part (a).

Answer More Questions

1 year ago

Operating System

The Gantt-chart for FCFS scheduling is

P1 P2 P3 P4 P5
0 1 2 4 5
10
Turnaround time = Finished Time – Arrival Time Turnaround time for process P1 = 1 – 0 = 1 Turnaround time for process P2 = 2 – 0 = 2 Turnaround time for process P3 = 4 – 0 = 4 Turnaround time for process P4 = 5 – 0 = 5 Turnaround time for process P5 = 10 – 0 = 10 Average Turnaround time = (1+2+4+5+10)/5 = 4.4 The Gantt-chart for SJF scheduling is
P1 P2 P4 P3 P5
0 1 2 3 5
10
Turnaround time for process P1 = 1 – 0 = 1 Turnaround time for process P2 = 2 – 0 = 2 Turnaround time for process P3 = 5 – 0 = 5 Turnaround time for process P4 = 3 – 0 = 3 Turnaround time for process P5 = 10 – 0 = 10

Average Turnaround time = (1+2+5+3+10)/5 = 4.2 The Gantt-chart for Priority scheduling is
P1 P2 P5 P3 P4
0 1 2 7
9 10
Turnaround time for process P1 = 1 – 0 = 1 Turnaround time for process P2 = 2 – 0 = 2 Turnaround time for process P3 = 9 – 0 = 9 Turnaround time for process P4 = 10 – 0 = 10 Turnaround time for process P5 = 7 – 0 = 7 Average Turnaround time = (1+2+9+10+7)/5 = 5.8 The Gantt-chart for RR scheduling is
P1 P2 P3 P4 P5 P3 P5
0 1 2 3 4 5 6
10
Turnaround time for process P1 = 1 – 0 = 1 Turnaround time for process P2 = 2 – 0 = 2 Turnaround time for process P3 = 6 – 0 = 6 Turnaround time for process P4 = 4 – 0 = 4 Turnaround time for process P5 = 10 – 0 = 10 Average Turnaround time = (1+2+6+4+10)/5 = 4.8

5 5

Surya Bikram Bhandari

Surya Bikram Bhandari

Nov 4, 2021

More related questions

1. What are constants? List and explain different types of constants with examples.

2. Explain briefly about, processor, assembler, compiler, loader, linker and the functions executed by them.

3. What is the main component of operating system

4. Describe different job scheduling in operating systems.

5. What is the cause of thrashing? How does the system detect thrashing? Once it detects thrashing, what can the system do to eliminate this problem?

6. Under what circumstances do page faults occur? Describe the actions taken by the operating system when a page fault occurs?

7. What is fragmentation? Different types of fragmentation?

8. What are the different Dynamic Storage- Allocation methods?

9. What is the usage of Deadlock Detection- Algorithm?

10. What is a Safe State and its? use in deadlock avoidance?

11. What is the Condition for deadlock occurrence?

12. Explain Memory Partitioning, Paging, Segmentation.

13. What is semaphore?

14. What is Mutex Object?

15. What is marshalling?

16. What are the different process states?

17. What is INODE?

18. Define and Explain COM?

19. What is Marshalling?

20. What is Semaphore?

21. What is the difference between a ‘thread’ and a ‘process’?

22. What is MUTEX?

23. What is Real-Time System?

24. What is a Safe State and what is its use in deadlock avoidance?

25. What is cache memory?

26. What is Context Switch?

27. What is CPU Scheduler?

28. What is Dispatcher?

29. What is DRAM? In which form does it store data?

30. What is fragmentation? Different types of fragmentation?

31. What is hard disk and what is its purpose?

32. What are multi tasking, multi programming and multi threading?

33. What is the cause of thrashing? How does the system detect thrashing? Once it detects thrashing, what can the system do to eliminate this problem?

34. What is the difference between Hard and Soft real-time systems?

35. What are the types of Real Time System?

36. What is the important aspect of a real-time system or Mission Critical Systems?

37. What is Throughput, Turnaround time, waiting time and Response time?

38. What is virtual memory?

39. What resources are used when a thread created? How do they differ from those when a process is created?

40. Why paging is used?

41. What are the basic functions of an operating system?

42. Explain file allocation with contiguous allocation

43. Explain directory structure with various level of directory

44. Explain various file accessing methods

45. Explain various file operations

46. Write a note on allocation of frames

47. Explain Page-replacement with any one-page replacement algorithm.

48. Explain Page-replacement with any one page replacement algorithm.

49. What is Page Fault? Explain

50. What is Demand Paging? Explain

51. What is Segmentation? Explain

52. Explain the concept of paging in memory

53. What is fragmentation? Explain different types of fragmentation

54. What is dynamic memory allocation? Explain first fit, best fit and worst fit

55. Explain contiguous memory allocation

56. Explain Swapping in Operating System?

57. Overlays in Memory Management

58. Explain Static vs Dynamic Loading

59. Write a short note on Peterson’s solution.

60. Write a note on Semaphore.

61. Explain Readers-Writers problem using semaphores.

62. What is a thread? Why is it that threads are faster to create than processes? What advantages do kernel threads provide over user threads?

63. Consider the following set of processes, with the length of CPU-burst time given in milliseconds:

64. What is kernel of an Operating System?

65. List the three requirements that must be satisfied by critical section problem.

66. What do you mean by graceful degradation in multiprocessor systems?

67. Define system call.

68. What do you mean by graceful degradation in multiprocessor systems?

69. Assume, we have the workload as shown below. All 5 processes arrive at time 0, in the order given below. The length of the CPU burst time is given in milliseconds

70. Explain Context switch along with a suitable diagram.Name and briefly define the scheduling criteria. List out the circumstances under which a CPU scheduling decision may have to be taken by the CPU scheduler.

71. Give the queuing diagram representing process scheduling and show the action point for the different types of CPU schedulers.

72. Name the three types of schedulers and give functions of each.

73. List the Coffman’s conditions that lead to a deadlock.

74. What is the difference between synchronization and mutual exclusion?

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

76. What resources are used when a thread created? How do the differ from those when a process is created?

77. What is the difference between Hard and Soft real time Systems?

78. What is Throughput, Turnaround time, Waiting time and Response time?

79. What level of security does Windows NT meets?

80. What are DDks? Name an operating system that includes this feature.

81. What are the sub-components of I/O manager in Windows NT?

82. What is Executive in Windows NT?

83. What are rings in Windows NT?

84. What are the possible threads a thread can have?

85. What is FtDisk?

86. What is an idle thread?

87. What is mutant?

88. What is process migration?

89. What are the reasons for process suspension?

90. List out some reasons for process termination.

91. How many jobs can be run concurrently on MVT?

92. What is process spawning?

93. What is a drawback of MVT?

94. Is Windows NT a full blown object oriented operating system? Give reasons.

95. What are the key object oriented concepts used by Windows NT?

96. What is SMP?

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

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

99. What is Page Cannibalizing?

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

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

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

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

104. What is time-stamping?

105. Describe the Buddy system of memory allocation.

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

107. What are local and global page replacements?

108. What is a trap and trapdoor?

109. When does the condition 'rendezvous' arise?

110. Explain the popular multiprocessor thread-scheduling strategies.

111. What is busy waiting?

112. What are the stipulations of C2 level security?

113. What is meant by arm-stickiness?

114. What is cycle stealing?

115. When is a system in safe state?

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

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

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

119. What are turnaround time and response time?

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

121. What is thrashing?

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

123. Explain Belady's Anomaly?

124. Explain the concept of Reentrancy?

125. Explain how to access Terminal?

126. Explain how you can reset Unity Configuration?

127. What is the meaning of “export” command in Ubuntu?

128. What is the use of behavior tab in Ubuntu?

129. Explain the purpose of using a libaio package in Ubuntu?

130. Explain what is Unity in Ubuntu? How can you add new entries to the launcher?

131. Explain why Ubuntu is safe and not affected by viruses?

132. What is a folder in Ubuntu?

133. How would a file name EXAMPLEFILE.TXT appear when viewed under the DOS command console operating in Windows 98?

134. Under DOS, what command will you type when you want to list down the files in a directory, and at the same time pause after every screen output?

135. Differentiate internal commands from external commands.

136. What is NOS?

137. What is plumbing/piping?

138. Why partitioning and formatting is a prerequisite to installing an operating system?

139. What is preemptive multitasking?

140. What is GUI?

141. What are interrupts?

142. What is an Assembler

143. What is spooling?

144. What is caching?

145. Explain pros and cons of a command line interface?

146. What is multitasking?

147. What is the purpose of an I/O status information?

148. What are the different types of CPU registers in a typical operating system design?

149. What are the primary functions of VFS?

150. What are device drivers?

151. What is Root Partition?

152. When designing the file structure for an operating system, what attributes are considered?

153. What is the best page size when designing an operating system?

154. When does thrashing occur?

155. What is Direct Access Method?

156. What is a socket?

157. Give an example of a Process State.

158. How does swapping result in better memory management?

159. What is fragmentation?

160. What is the basic function of paging?

161. What are overlays?

162. How does dynamic loading aid in better memory space utilization?

163. State the main difference between logical from physical address space.

164. What factors determine whether a detection-algorithm must be utilized in a deadlock avoidance system?

165. Describe Banker’s algorithm

166. Enumerate the different RAID levels.

167. What are necessary conditions which can lead to a deadlock situation in a system?

168. What is RR scheduling algorithm?

169. Briefly explain FCFS.

170. Give some benefits of multithreaded programming.

171. What is a thread?

172. What is asymmetric clustering?

173. How are server systems classified?

174. What is SMP?

175. What is time- sharing system?

176. Describe the objective of multiprogramming.

177. What is a virtual memory?

178. What are real-time systems?

179. What is kernel?

180. What are the advantages of a multiprocessor system?

181. What is demand paging?

182. Explain the main purpose of an operating system?

183. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. Calculate the average waiting time.

184. What do you mean by FCFS?

185. What are the advantages of Multiprocessing or Parallel System?

186. What are the advantages of multiprogramming?

187. What is the difference between Job and Process?

188. What inconveniences that a user can face while interacting with a computer system, which is without an operating system?

189. What are the primary differences between Network Operating System and Distributed Operating System?

190. How Buffering can improve the performance of a Computer system?

191. What is the relationship between operating systems and computer hardware?

192. Describe the four generations of computing and how operating systems developed as a result

193. A system has 32 bit Virtual adress and 8KB page size.main memory is 128 MB..the size of page table, when page table ,when pt entry has 1 valid bit 1 modified bit and frame bits

Questions Bank

View all Questions