Scribd
Upload
45 views3 pages

OS Nov Dec 2010 QP

Uploaded by

Anurekha Prasad
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
45 views3 pages

OS Nov Dec 2010 QP

Uploaded by

Anurekha Prasad
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/ 3

www.vidyarthiplus.

com

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2010

Fourth Semester

Computer Science and Engineering

CS 2254 — OPERATING SYSTEMS

(Common to Information Technology)

(Regulation 2008)

Time : Three hours Maximum : 100 Marks

Answer ALL questions

PART A — (10 × 2 = 20 Marks)

1. List down the functions of operating systems.

2. What do you mean by multiprogramming?

3. What do you mean by short term scheduler?

4. What is a deadlock?

5. What is address binding?

6. What do you mean by page fault?

7. What is a file? List some operations on it.

8. What are the various file accessing methods?

9. What is rotational latency?

10. What is a swap space?

PART B — (5 × 16 = 80 Marks)

11. (a) (i) Explain how hardware protection can be achieved and discuss in detail the dual
mode of operations. (Marks 8)

(ii) Explain in detail any two operating system structures. (Marks 8)

www.vidyarthiplus.com
www.vidyarthiplus.com

Or

(b) What is meant by a process? Explain states of process with neat sketch and discuss the
process state transition with a neat diagram. (Marks 16)

12. (a) What is a critical section? Give examples. What are the minimum requirements that
should be satisfied by a solution to critical section problem? Write Peterson Algorithm for 2-
process synchronization to critical section problem and discuss briefly. (Marks 16)

Or

(b) Allocation Maximum Available

abcdabcdabcd

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

Answer the following

(i) What is the content of the need matrix?

(ii) Is the system in a safe state?

(iii) If the request for process P1 arrives for (0,4,2,0) can it be granted immediately. (Marks
16)

13. (a) Given memory partition of 100 KB, 500 KB, 200 KB and 600 KB (inorder). Show
with neat sketch how would each of the first-fit, best-fit and worst fit algorithms place
processes of 412 KB, 317 KB, 112 KB and 326 KB (in order). Which algorithm is most
efficient in memory allocation? (Marks 16)

Or

(b) Explain the concept of demand paging. How can demand paging be implemented with
virtual memory? (Marks 16)

14. (a) (i) Explain various file allocation methods in detail. (Marks 8)

www.vidyarthiplus.com
www.vidyarthiplus.com

(ii) What are the possible structures for directory? Discuss them in detail. (Marks 8)

Or

(b) Explain in detail the free space management with neat diagram. (16)

15. (a) Explain in detail various disk scheduling algorithms with suitable example. (Marks
16)

Or

(b) Write short notes on the following :

(i) I/O Hardware (Marks 8)

(ii) RAID structure. (Marks 8)

www.vidyarthiplus.com

You might also like