Operating Systems 2018 Question Paper — Government College of Enginee…
The 2018 Operating Systems previous year question paper (Government College of Engineering and Technology, Jammu), with every question and its marks.
- University: Government College of Engineering and Technology, Jammu
- Subject: Operating Systems
- Course: Operating System
- Branch: COMPUTER EGINEERING
- Year: 2018
- Paper: end-term
- Duration: 180 minutes
- Total marks: 100
Instructions
- Attempt five questions in all selecting at least two questions from each Section.
- Each question carries 20 marks.
Questions
Section - A
- Q1. (a) What is an operating system? How does an operating system take control over a computer system? Also list the services provided by an operating system. (b) What is the difference between multiprocessing and multiprocessing? What are the advantages of multiprocessing? (15, 5) [20 marks]
- Q2. (a) What do you understand by a "Process"? Explain the different states of a process and its transition from one state to another. Also explain Process Control block and its significance. (b) Explain the characteristics used for the comparison of scheduling algorithms. (c) What is starvation and convoy effect and in which of the scheduling algorithms these can occur? (10, 5, 5) [20 marks]
- Q3. (a) Define Semaphores. How can it be used as a general synchronization tool? What advantage does a semaphore have as compared to a hardware test and set instruction? (b) Define critical section problem and its solution using semaphore. Use this approach to solve producer consumer problem. (10, 10) [20 marks]
- Q4. Consider a system with a set of processes P1, P2, P3 and their CPU burst times, priorities and arrival times being mentioned as below: Process | CPU burst time | Arrival time | Priority --- | --- | --- | --- P1 | 5 | 0 | 2 P2 | 15 | 1 | 3 P3 | 10 | 2 | 1 Assuming 1 to be the highest priority, calculate average waiting time and average turnaround time for following scheduling algorithms: (i) First come first served (ii) Preemptive shortest job first (iii) Non preemptive shortest job first (iv) Preemptive priority (v) Non Preemptive priority (vi) Round robin (with time quantum of 2 units) [20 marks]
Section - B
- Q5. Explain the four necessary conditions that must be in effect for a deadlock to exist. What are the various methods of handling deadlocks? Explain one of the methods in detail. [20 marks]
- Q6. (a) What is Thrashing? How does the system detect thrashing and once detected, what can the system do to eliminate it? (b) Differentiate between: (i) Internal and External Fragmentation (ii) Paging and Segmentation. (10, 10) [20 marks]
- Q7. (a) Consider the following page reference string: 5, 6, 7, 1, 2, 3, 5, 6, 7, 1, 2,3,5, 6, 7, 1, 8, 9, 9, 9, 1, 2, 3, 4 How many page faults would occur for the following page replacement algorithms, assuming four frames? All frames are initially empty. (i) LRU replacement (ii) FIFO replacement (iii) Optimal replacement. (b) Give some reasons as to why local page replacement is better than the global page replacement? (15, 5) [20 marks]
- Q8. (a) How is the process defined in UNIX? How does the parent process control the child process in UNIX? Describe the process control block with the help of a diagram. ( 10 ) (b) Write short notes on: (i) Unix file system (ii) Interprocess Communication. ( 10 ) [20 marks]
Related pages
Other years
- Operating Systems 2018 question paper — end-term
- Operating Systems 2018 question paper — end-term
- Operating Systems 2018 question paper — end-term