Download AKTU B-Tech 4th Sem 2018-19 RCS401 Operating System Question Paper

FirstRanker.com

Firstranker's choice

Printed Pages: 2

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

Paper Id: 110255

Roll No.

B.TECH

(SEM IV) THEORY EXAMINATION 2018-19

Operating System

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

Time: 3 Hours

Total Marks: 70

Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

2. Any special paper specific instruction.

SECTION A

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

1. Attempt all questions in brief. 2 x 7 = 14

1. Describe the typical elements of the process control block
2. What are the various scheduling criteria for CPU scheduling?
3. What is the main function of the memory-management unit?
4. Define seek time and latency time.

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

5. Define SCAN and C-SCAN scheduling algorithms.
6. What is a safe state and an unsafe state?
7. Explain the logical address space and physical address space diagrammatically.

2. Attempt any three of the following: 7 x 3 = 21

1. Define Process. Explain various steps involved in change of a process state with neat transition diagram.

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

2. Explain Batch operating system with example
3. What is a Critical Section problem? Give the conditions that a solution to the critical section problem must satisfy.
4. Illustrate the page-replacement algorithms
   1. FIFO
   2. Optimal Page Replacement
   use the reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 for a memory with three frames.

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

5. A hard disk having 2000 cylinders, numbered from 0 to 1999. the drive is currently serving the request at cylinder 143, and the previous request was at cylinder 125. The status of the queue is as follows 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130 What is the total distance (in cylinders) that the disk arm moves to satisfy the entire pending request for each of the following disk-scheduling algorithms?
   1. SSTF
   2. FCFS

3. SECTION C 7x1=7

Attempt any one part of the following:

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

1. What is an Operating system? Describe the Operating-System Functions
2. Write about monolithic kernel, layered, and microkernel structures of operating systems.

FirstRanker.com

4. Attempt any one part of the following: 7x1=7

1. Explain what semaphores are, their usage, implementation given to avoid busy waiting and binary semaphores.

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

2. What is Producer Consumer problem? How it can illustrate the classical problem of synchronization? Explain.

5. Attempt any one part of the following: 7x1=7

1. Consider the following process:
   

   Process	Arrival Time	Burst Time
   P1	0	8
   P2	1	4
   P3	2	9
   P4	3	5

   What is the average waiting and turn around time for these process with
   1. FCFS Scheduling
   2. Preemptive SJF Scheduling

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

2. Consider the following snapshot of a system:
   

   Process	Allocated			Maximum			Available
   	R1	R2	R3	R1	R2	R3	R1	R2	R3
   P1	2	2	3	3	6	8	7	7	10
   P2	2	0	3	4	3	3
   P3	1	2	4	3	4	4

   Answer the following questions using the banker's algorithm:
   1. What is the content of the matrix need?
   2. Is the system in a safe state?

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

6. Attempt any one part of the following: 7x1=7

1. Explain Paging with example. Differentiate Paging and Segmentation.
2. Explain the difference between External fragmentation and Internal fragmentation. How to solve the fragmentation problem using paging.

7. Attempt any one part of the following: 7x1=7

1. What are files and explain the access methods for files.

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

2. Write short notes on :
   1. File system protection and security
   2. Linked File allocation methods and