Scribd
Upload
23 views

OSMP

The document is a model exam paper for an Operating Systems exam. It contains 10 questions across 5 units on topics like processes, memory management, file systems, disk scheduling, and security. Students must answer one question from each unit, with each question worth a total of 12 marks.

Uploaded by

chokkagnapikasri.21.it
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
23 views

OSMP

The document is a model exam paper for an Operating Systems exam. It contains 10 questions across 5 units on topics like processes, memory management, file systems, disk scheduling, and security. Students must answer one question from each unit, with each question worth a total of 12 marks.

Uploaded by

chokkagnapikasri.21.it
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Hall Ticket No: Question Paper Code :

ANIL NEERUKONDA INSTITUTE OF TECHNOLOGY & SCIENCES


(AUTONOMOUS)
II/IV B. Tech II- Semester Regular Examinations April – 2017
Operating Systems
(IT)
Time: 3 hours Max Marks: 60

Answer ONE Question from each Unit


All Questions Carry Equal Marks
All parts of the question must be answered at one place only
UNIT-I

1. a) Define operating system and discuss the various types of operating systems. (8M)
b) Define process and explain various states of a process with the help of a neat diagram. (4M)
(OR)

2. a) Describe the following system calls in detail (8M)


(i)Fork () (ii) wait() (iii)Read() (iv) write()
b) Explain the various types of multithreading models. (4M)

UNIT-II

3. a) Explain producer consumer problem using semaphores (8M)


b) Five jobs 1 through 5 have arrived at similar time with burst times of 2,4,2,6 and 3
respectively. Their priorities are given as 3,2,1,4 and 5 respectively, with 1 being highest priority
and 5 being lowest priority. Calculate the completion time, average waiting time and average
turnaround time for the below algorithms.
(i)FCFS (ii) Priority (4M)

(OR)

4. Explain bankers algorithm for deadlock avoidance along with an example. (12M)

UNIT-III

5 a) Explain about dynamic storage allocation strategies in contiguous memory allocation


scheme. (8M)
b) Discuss between internal and external fragmentation (4M)

(OR)

6. a) Explain paging as a memory management scheme with the help of a neat diagram (8M)
b) Explain the following page replacement algorithms with an example. (4M)
(i)FIFO (ii)LRU

MODEL PAPER 1
UNIT-IV

7 a) Discuss about various types of directory structures (8M)


b) Explain briefly about file access methods (4M)

(OR)

8 a) Classify various types of file allocation methods (8M)


b) Describe about Virtual file system (4M)

UNIT-V

9 a) Explain about different types of disc scheduling algorithms. (8M)


b) Discuss the various levels of RAID (4M)

(OR)

10. a) Explain about Access Matrix as a model of protection (8M)


b) Write a short note on Domain of protection (4M)

MODEL PAPER 2

You might also like