Operating Systems 2018 Question Paper — Government College of Enginee…

Instructions

• Attempt five questions in all, selecting atleast two questions from each Section.

Questions

Section A

• QQ1 a). What is the difference between Multiprogramming and Multiprocessing and Distributed Operating Systems What are the advantages of each? [10 marks]
• Qb). What is spooling and what is the use of it in Batch operating system? [5 marks]
• Qc). Why user mode and kernel mode is considered as good operating system design? Give an example that illustrates a user being switched from user mode to kernel mode, then back to the user mode. [5 marks]
• QQ2 a). Explain the following terms with the help of examples: i. Race condition ii. Critical Section iii. Mutual exclusion with busy waiting iv. Counting Semaphore [12 marks]
• Qb). Describe Dining Philosopher problem with its solution [8 marks]
• QQ3 a). Given the following information: Process | Arrival Time | Burst time | Priority --- | --- | --- | --- A | 0 | 3 | 3 B | 1 | 6 | 5 C | 2 | 1 | 2 D | 3 | 4 | 1 E | 4 | 2 | 4 Compute average waiting time and average turnaround time for the following scheduling algorithms: i. Round Robin(quantum=1) ii. Priority preemptive iii. Preemptive SJF? [15 marks]
• Qb). What is starvation and convoy effect and in which of the scheduling algorithms these can occur? [5 marks]
• QQ4 a). Discuss the various criteria for comparing CPU scheduling algorithms. [10 marks]
• Qb). Explain the difference between Preemptive Shortest job first and Non preemptive shortest job first scheduling algorithms with an example. [5 marks]
• Qc). Describe the actions taken by a kernel to context switch among processes. [5 marks]

Section B

• QQ5 a). What is Virtual memory ?What are its benefits? Explain various methods for implementing Virtual memory management with their advantages and disadvantages. [10 marks]
• Qb). What is thrashing? How does the system detect thrashing? Once it detects, what can the system do to eliminate this problem. [10 marks]
• QQ6 a). 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 following page replacement algorithms assuming 3 frames. i. LRU replacement ii. Optimal replacement [10 marks]
• Qb). Give significance of following in demand paging i. Dirty bit ii. Valid/invalid bit [5 marks]
• Qc). Consider a logical address space of eight pages of 1024 words each, mapped onto a physical memory of 32 frames. i. How many bits are there in the logical address? ii. How many bits are there in the physical address? [5 marks]
• QQ7 a). Consider the following snapshot of a system Job | Allocated A B C D | Maximum A B C D | Available 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 | Use the banker's algorithm to answer the following:- a) Find out the contents of matrix "Need". b) Is system in a safe state? c) If a request from Process P1 arrives for (0, 4, 2, 0) Can the request be granted immediately? [15 marks]
• Qb). Explain the four necessary conditions that must be in effect for a deadlock to exist. [5 marks]
• QQ8 a). Difference between SCAN and LOOK Disk scheduling algorithms [5 marks]
• Qb). Difference between Seek Time Rotational Latency and Transfer Time in Disk Scheduling [5 marks]
• Qc). Compare and contrast chained allocation with indexed allocation technique of file allocation [5 marks]
• Qd). Explain Bit Vector and Linked List techniques of Free space management . [5 marks]

Related pages

• Operating Systems syllabus
• All Operating Systems papers from 2018

Other years

• Operating Systems 2018 question paper — end-term
• Operating Systems 2018 question paper — end-term
• Operating Systems 2018 question paper — end-term