Code No: RR410401

Set No. 1

IV B.Tech I Semester Supplementary Examinations, February 2007 OPERATING SYSTEMS (Electronics & Communication Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ⋆⋆⋆⋆⋆ 1. Describe the Objectives and functions of Operating system. Also explain the different services provided by the operating system. [5+5+6] 2. Discuss about the following: (a) user-level threads (b) Kernel-level threads (c) Multi-threadings. 3. Show that monitors and semaphores have equivalent functionality by (a) Implementing a monitor using semaphores (b) Implementing a semaphore using monitors [8+8] [5+5+6]

4. What is dining philosophers problem? Device an algorithm to solve the problem using Semaphore. [4+12] 5. (a) Discuss the differences between a pure paging and pure segmentation virtual memory systems. What are the pros and cons of each scheme? (b) What are the three main issues of implementing a virtual memory system? (c) Comment on the relative merits of using a local versus a global page replacement policy. [6+5+5] 6. (a) What are preemptive and non-preemptive scheduling policies? (b) Describe non-preemptive scheduling policies 7. (a) What do you understand by a file directory? (b) Explain briefly the information elements of a file directory (c) Explain what is tree-structured directory? [5+5+6] [8+8]

8. What do you understand by Trusted systems? Draw a figure of reference monitor concept and explain. [5+5+6] ⋆⋆⋆⋆⋆

1 of 1

Code No: RR410401

Set No. 2

IV B.Tech I Semester Supplementary Examinations, February 2007 OPERATING SYSTEMS (Electronics & Communication Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ⋆⋆⋆⋆⋆ 1. What is Multiprogramming? Explain the memory hierarchy with reference to the uses, characteristics, applications and functions. [4+12] 2. (a) Explain the reasons for process terminations. (b) Describe the single blocked queue and multiple blocked queues with an example. [4+12] 3. What is message passing? Explain the design characteristics of message systems for inter process communication and synchronization. [2+4+5+5] 4. (a) How mutual exclusion, hold and wait and circular wait are different from each other? Explain with the help of examples. (b) Write an algorithm to detect the occurrence of deadlocks 5. (a) Explain the process of loading programs into main memory. (b) Write in brief on the following memory management techniques comparing their relative strengths and weaknesses. i. ii. iii. iv. Fixed Partitioning Simple Segmentation Virtual Memory Paging Dynamic Partitioning [4+8+4] [8+8]

(c) Describe the Placement Algorithm. 6. (a) Discuss about various criteria used for short-term scheduling (b) Discuss about fair share scheduling method 7. (a) What do you understand by a file directory? (b) Explain briefly the information elements of a file directory (c) Explain what is tree-structured directory?

[8+8]

[5+5+6]

8. What do you understand by Trusted systems? Draw a figure of reference monitor concept and explain. [5+5+6] ⋆⋆⋆⋆⋆

1 of 1

Code No: RR410401

Set No. 3

IV B.Tech I Semester Supplementary Examinations, February 2007 OPERATING SYSTEMS (Electronics & Communication Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ⋆⋆⋆⋆⋆ 1. (a) Explain the Operating system as Resource Manager. (b) A major operating system will evolve over time for a number of reasons. What are they? [4+12] 2. (a) Explain the role of process control block in OS. (b) Differentiate the following i. Process Switching vs Context Switching ii. Clock interrupt Vs I/O interrupt. 3. Explain in detail all the steps involved in getting a Dekker’s algorithm.

[8+8] [16]

4. What is deadlock avoidance? Explain process initiation denial and resource allocation denial in detail with example. [4+4+4+4] 5. Consider a memory management system with demand paging. There are there processes P1, P2, P3 which have one page of private memory each. Moreover P1 and P2 are sharing an array A which fits entirely into one memory page. Similarly, P2 and P3 are sharing an array B, which fits into a memory page. (a) Let all the data for the processes be located into physical memory. Draw a possible memory allocation diagram, give the page tables for the three processes. (b) Assume that process P1 gets swapped out of memory entirely. How are the page tables changing. (c) Assume that process P1 gets swapped back into memory. Give the page tables in this situation. [5+5+6] 6. (a) Discuss about various criteria used for short-term scheduling (b) Discuss about fair share scheduling method 7. (a) What do you understand by a file directory? (b) Explain briefly the information elements of a file directory (c) Explain what is tree-structured directory? 8. Write notes on (a) intrusion detection (b) password protection ⋆⋆⋆⋆⋆ 1 of 1 [8+8] [5+5+6] [8+8]

Code No: RR410401

Set No. 4

IV B.Tech I Semester Supplementary Examinations, February 2007 OPERATING SYSTEMS (Electronics & Communication Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ⋆⋆⋆⋆⋆ 1. (a) Explain the Operating system as Resource Manager. (b) A major operating system will evolve over time for a number of reasons. What are they? [4+12] 2. Discuss about the following: (a) user-level threads (b) Kernel-level threads (c) Multi-threadings. [5+5+6]

3. Explain the state of the process Queue for the Readers / Writers problem and get the solution to the same by using message -passing [8+8] 4. How the deadlocks can be avoided? Explain with the help of necessary algorithms. [8+8] 5. (a) A process has 4 page frame allocated to it. Calculate the number of page faults using following page replacement algorithms for the reference string4,0,0,0,2,4,2,1,0,3,2. i. ii. iii. iv. MIN (OPT) FIFO LRU Clock [8+8]

(b) Explain thrashing in detail. 6. (a) Describe about various disk performance parameters?

(b) We noted that successive requests are likely to be from the same cylinder. what does this imply about the expected performance of the FCFS and SSTF disk scheduling algorithms. [8+8] 7. (a) What do you understand by a file directory? (b) Explain briefly the information elements of a file directory (c) Explain what is tree-structured directory? [5+5+6]

8. What do you understand by Trusted systems? Draw a figure of reference monitor concept and explain. [5+5+6] ⋆⋆⋆⋆⋆ 1 of 1