Scribd
Upload
38 views2 pages

CS2254 MJ 2010

This document is a question paper for an Operating Systems exam covering topics like operating system structure, process management, memory management, file systems, I/O, and disk scheduling. It contains 15 multiple choice and long answer questions worth a total of 100 marks. The questions assess understanding of key concepts like process control blocks, scheduling algorithms, memory allocation techniques, file allocation methods, and I/O subsystems.

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
38 views2 pages

CS2254 MJ 2010

This document is a question paper for an Operating Systems exam covering topics like operating system structure, process management, memory management, file systems, I/O, and disk scheduling. It contains 15 multiple choice and long answer questions worth a total of 100 marks. The questions assess understanding of key concepts like process control blocks, scheduling algorithms, memory allocation techniques, file allocation methods, and I/O subsystems.

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/ 2

Reg. No.

Question Paper Code: E3066

B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2010

Fourth Semester

Computer Science and Engineering

CS2254 - OPERATING SYSTEMS

(Common to Information Technology)

(Regulation 200S)

Time: Three hours Maximum: 100 Marks

Answer ALL Questions

PART A - (10 x 2 = 20 Marks)


1. Mention the objectives and functions of an operating system.
2. Define thread. Differentiate user threads from kernel threads.
3. What is a semaphore? State the two parameters.
4. What is deadlock? What are the schemes used in operating system to handle
deadlocks?
5. Differentiate a page from a segment.
6. What is meant by thrashing? Give an example.
7. Mention the objectives of file management system.
S. Differentiate the various file access methods.
9. What is the need for disk scheduling?
10. What does swap-space management mean?

PART B - (5 x 16 = SOMarks)

11. (a) (i) Explain the operating system structure and its components. (S)

(ii) Explain briefly IPC in Linux. (S)

Or

(b) (i) Explain Process Control Block. (4)

(ii) Describe the differences among short-term, medium-term, and


long-term scheduling. (4)

(iii) Describe the Inter Process communication in client-server systems.


(S)
12. (a) (i) Distinguish between preemptive and non-preemptive scheduling.
Explain each type with an example. (8)

(ii) Vilhat is synchronization? Explain how semaphores can be used to


deal with n-process critical section problem. (8)

Or

(b) (i) Discuss the issues in multiprocessor and real-time scheduling. (8)

(ii) Explain Banker's deadlock-avoidance algorithm with an


illustration. (8)

13. (a) (i) Discuss how memory IS allocated In variable partition


multiprogramming. (6)

(ii) Explain memory management in Linux. (10)

Or

(b) (i) Discuss segmentation in detail. Compare it with paging. (8)

(ii) Explain FIFO, LRU and Second-chance page replacement


algorithms with an example reference string. (8)

14. (a) (i) Explain linked file allocation method. (6)

(ii) Describe Windows XP file system in detail. (10)

Or

(b) (i) Vilhatis the role of Access matrix for protection? Explain. (5)

(ii) Vilhatis meant by free space management? Explain. (5)

(iii) Explain the directory structure of Linux operating system. (6)

15. (a) (i) Explain the services provided by a kernel I/O subsystem. (8)

(ii) Explain and compare the C-LOOK and C-SCAN disk scheduling
algorithms. (8)

Or

(b) (i) Write an elaborate note on RAID. (6)

(ii) Explain in detail the salient features of Linux I/O. (10)

2 E 3066

You might also like