Question Paper Code: 91346
BE. / B.Tech, DEGREE EXAMINATION, NOVEMBER / DECEMBER 2014
Computer Science and Engineering
CS 2254/ CS 45/ CS 1253/080250014/10144 CS 405 - OPERATING SYSTEMS
(Common to Information Technology)
(Common to PTCS 2254/ 10144 CS 405 - Operating Systems for B.E. (Part-Time)
Fourth Semester - CSE - Regulation 2009/2010)Time : Three hours
Maximum: 100 marks
Answer ALL. questions.
PART A- (10-x 2 = 20·marks)
1. What is the resident set and working set of a process?
2. What resources are used when a thread created?
3. Differentiate between pre-emptive and non-pre-emptive scheduling.
4. What can the operating system do to recover from deadlock?
5. What is the maximum file size supported by a file system with 16 direct blocks, single, double, and triple indirection? -The block size is 512 bytes. Disk block. numbers can be stored in 4 bytes.
6. List the steps needed to perform page replacement.
7. What file access pattern is -particularly suited to chained file allocation on disk?
8. What file allocation strategy is most appropriate for random access files?
9. Compare bitmap-based allocation of blocks on disk with a free block list.
10. What is an I/O buffer?
PART B - (5 x 16 = 80 marks)
11. (a) (i) Draw the state diagram of a process from- its creation to termination, including All transitions, and briefly elaborate every state and every transition. (8)
(ii) What are threads? Why are they required? Discuss the differentiate between Kernel level and user level threads. (8)
(b) (i) What are interacting. processes? Explain any two methods of implementing interacting processes. . (8)
(ii) Explain in detail about the different Multi threading models with neat diagram. (8)
12. (a) (i) Consider the situation m which the disk read/write head. is currently located at Track 45 (of tracks 0-255) and moving in the positive direction. Assume that the Following track requests have been made in this order: 40,67,11,240,87. What is the order in which optimized C-SCAN would service these requests and what is the -total seek distance? (8)
(ii) Explain any three policies for process scheduling that uses resource consumption information. What is response ratio? (8)
(b) (i) What are semaphores? How do they implement mutual exclusion?
(ii) Give a solution for readers-writers problem using conditional critical regions. (8)
13. (a) Consider the following segmented paging memory system. There are 4 segments for the given process and a total of 5 page tables in the entire
system. Each page table has a total of 8 entries. The physical memory requires 12 bits to address it; there are a total of 128 frames.
(i) How many bytes are contained within the physical memory?
(ii) How large is the virtual address?
(iii) What is the physical address that corresponds to virtual address Ox 312?
(iv) What is the physical address that corresponds to virtual address Ox 1E9? (16)
(b) Explain with the help of examples FIFO and LRU page algorithms.
14. (a) (i) Explain in detail about File system Implementation.
(ii) A file system on a disk has both logical' and physical block sizes of 512 bytes. Assume that the information about each file is already in memory using contiguous, linked, and indexed allocation strategies answer the following questions: (10)
(1) How is the logical-to-physical address mapping accomplished in this system? (For the indexed allocation, assume that a 'file is always less than 512 blocks long).
(2) If we are currently at lo-gical block 10 (the last block accessed was block and want to access logical block 4, how many physical blocks must be read from the disk?
(b) (i) Discuss the different techniques with which a file can be shared among different users. (8)
(ii) What is File protection and security? 'Compare both and also Explain the techniques to protect user files. (8)
15. (a) (i) Describe three circumstances under which blocking I/O should be used. Describe three circumstances under which nonblocking I/O should be used. Why not Just implement nonblockirig I/O and have processes busy-wait until their device is ready? (8)
(ii) What is disk management? Explain in detail how to improve the disk Performance. (8)
(b) Explain the following:
(i) What is RAID? Describe its types with proper example. (8)
(ii) Compare synchronous and asynchronous input / output with the help of an example. (8)
Full Name : Dhilip Prabakaran
College Name : Dhanalakshmi College of Engineering
Department : Computer Science and Engineering
Semester : 4
Subject Code : CS2254
Subject Name : Operating Systems
Study Material Description : Question Paper of CS2254 Operating Systems November December 2014.
OS Nov Dec 2014 QP.pdf (Size: 1.39 MB / Downloads: 3,478)
Dhilip Prabakaran, proud to be a member of Vidyarthiplus.com (V+) - Online Students Community since July 2014.