Download GTU BE/B.Tech 2018 Winter 4th Sem New 2140702 Operating System Question Paper

FirstRanker.com

Subject Code: 2140702

GUJARAT TECHNOLOGICAL UNIVERSITY

--- Content provided by‍ FirstRanker.com ---

BE - SEMESTER-IV (NEW) EXAMINATION - WINTER 2018

Subject Name: Operating System

Date: 10/12/2018

Time: 02:30 PM TO 05:00 PM

Total Marks: 70

--- Content provided by FirstRanker.com ---

Instructions:

1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1

--- Content provided by‌ FirstRanker.com ---

1. (a) Define following: (MARKS 03)
   1. Interrupt
   2. Thrashing
   3. Race Condition
2. (b) Define and differentiate process and thread. (MARKS 04)

--- Content provided by‌ FirstRanker.com ---

3. (c) What is operating system? Discuss role/functions of OS as a resource manager. (MARKS 07)

Q.2

1. (a) What is mutual exclusion? List out various methods/approach to achieve it. (MARKS 03)
2. (b) What do you mean by scheduling? Discuss in brief types of scheduler. (MARKS 04)
3. (c) Explain process state model with diagram. (MARKS 07)

   OR

   --- Content provided by⁠ FirstRanker.com ---

4. (c) List out types of operating system and explain batch OS and time sharing OS in brief. (MARKS 07)

Q.3

1. (a) What is Belady’s anomaly? Explain with suitable example. (MARKS 03)
2. (b) What is TLB? Explain how it speeds up the overall processing. (MARKS 04)

--- Content provided by⁠ FirstRanker.com ---

3. (c) What is Paging? Explain paging mechanism in MMU with example. (MARKS 07)

   OR

4. (a) What is virtual memory? What are advantages of it? (MARKS 03)
5. (b) Explain multiprogramming with fixed partition. (MARKS 04)
6. (c) Calculate the page fault rates for below reference string in case of FIFO and Optimal page replacement algorithm. (MARKS 07)
   

   --- Content provided by FirstRanker.com ---

   Assume the memory size is 4 page frames and all frames are initially empty.
   0,2,1,6,4,0,1,0,3,1,2,1

Q.4

1. (a) Write a short note on DMA. (MARKS 03)
2. (b) What is deadlock? Describe in brief necessary conditions that should hold for deadlock to occur. (MARKS 04)

--- Content provided by‍ FirstRanker.com ---

3. (c) Consider the processes P1, P2, P3, P4 given in the below table, arrives for execution in the same order, with arrival time 0, and given burst time, draw GANTT chart and find the average waiting time using the FCFS and SJF scheduling algorithm. (MARKS 07)
   

   Process	Burst Time
   P1	21
   P2	3
   P3	6
   P4	2

Q.4

1. (a) What do you mean by fragmentation? Differentiate internal and external fragmentation. (MARKS 03)
2. (b) List approaches to deal with deadlock. Explain deadlock prevention in brief. (MARKS 04)

--- Content provided by FirstRanker.com ---

3. (c) What do you mean by mutual exclusion? Explain Peterson’s solution for mutual exclusion problem. (MARKS 07)

Q.5

1. (a) List and explain different file attributes. (MARKS 03)
2. (b) What is I-node? Explain in brief. (MARKS 04)
3. (c) Define seek time and rotational latency. (MARKS 07)
   

   --- Content provided by​ FirstRanker.com ---

   Assume that a disk drive has 200 cylinders, numbered 0 to 199. The drive is currently serving a request at cylinder 100.
   The queue of pending requests is 23, 89, 132, 42, 189.
   Calculate seek time for FCFS and SSTF disk scheduling algorithm.

   OR

4. (a) Differentiate contiguous and linked file allocation methods. (MARKS 03)

--- Content provided by‍ FirstRanker.com ---

5. (b) Explain Unix Commands — grep, sort, cat, chmod (MARKS 04)
6. (c) What do you mean by security? Discuss in brief access control list. (MARKS 07)

FirstRanker.com