OS ASSIGNMENT 2
1 like702 views
This document contains an assignment on operating system concepts from Gandhi Institute of Education & Technology. It includes short notes on topics like conditions of deadlock, page vs segment, Belady's anomaly, critical section, fragmentation, monitors vs semaphores, race condition, binary vs counting semaphores, thrashing, lazy swapper, garbage collection and priority inheritance protocol. It also contains 10 long questions covering concepts like Banker's algorithm, page replacement algorithms, Peterson's solution for critical section problem, semaphores, thrashing, segment replacement, busy waiting, conditions of deadlock, producer-consumer problem, page fault and demand paging.
OS ASSIGNMENT 2
- 1. GANDHI INSTITUTUE FOR EDUCATION & TECHNOLOGY OPERATING SYSTEM ASSIGNMENT – 2 Short Notes: a) Write down four conditions of deadlock.(BPUT 2012) b) Differentiate between a page and a segment. (BPUT 2012) c) What is Belady’s anomaly? (BPUT 2012, 2010) d) What is a critical section? (BPUT 2012) e) Differentiate between internal fragmentation and external fragmentation. (BPUT 2012) f) Compare and contrast the use of monitors and semaphore operations. (BPUT 2011) g) What do you mean by race condition? (BPUT 2011) h) What is the difference between binary and counting semaphores? (BPUT 2011) i) What happens during thrashing (in the memory system) and why it happens? (BPUT 2011) j) What is lazy swapper? Mention its working principle. (BPUT 2010) k) Garbage collection and compaction degrades system performance. Justify. (BPUT 2010) l) Briefly explain how priority‐inheritance protocol helps multiprocessing activity in a system. (BPUT 2010) m) Whether a single user process can create deadlock to the system? (yes/no). Justify your answer with a suitable example.( BPUT 2010) n) With segmentation, if there are 64 segments and maximum segment size is 512 words, what will be length of logical address? (BPUT 2009) o) A computer has 6 tape drives among n programs. Each needs two tape drives. For a system to be deadlock free what is maximum value n?( BPUT 2009) Long Questions: 1. Consider the following snapshot of a system: Allocation Max Available A B C D A B C D A B C D P0 0 0 1 2 0 0 1 2 1 5 2 0 P1 1 0 0 0 1 7 5 0 P2 1 3 5 4 2 3 5 6 P3 0 6 3 2 0 6 5 2 P4 0 0 1 4 0 6 5 6 Answer the following questions using the Banker’s algorithm: (i) What is the content of the matrix Need? (ii) Is the system is a safe state? If yes, what is the safe sequence? Show the detailed steps as per Banker’s algorithm.
- 2. (iii) If a request from process P1 arrives for (0, 4, 2, 0), can the request be granted immediately? (BPUT 2012) 2. Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6 How many page faults would occur for the following replacement algorithms assuming three frames and all frames are initially empty? (i) LRU replacement (ii) FIFO replacement (iii) Optimal replacement(BPUT 2012) 3. Explain Peterson’s solution of critical section problem. (BPUT 2012) 4. Write short notes on any two: (a) Semaphore (b) Thrashing (BPUT 2012) 5. What aspect of paging makes page replacement algorithms so much simpler than segment replacement algorithms? What hardware or software features might be used in support of segment replacement that could make it almost as straightforward as page replacement?( BPUT 2011) 6. What is the meaning of term busy waiting? What other kinds of waiting are there? Can busy waiting be avoided together? Explain your answer. (BPUT 2011) 7. State four conditions of deadlock and explain how each condition can be satisfied?( BPUT 2011) 8. What is producer consumer problem? Give an example of its occurrence in operating system. (BPUT 2011) 9. a) When do page fault occurs? b) What do you mean by weight‐for‐graph?( BPUT 2011) 10. What is demand paging? With suitable block diagram, explain the procedure to handle page fault. (BPUT 2010)