Code No: RR321004

Set No. 1

III B.Tech Supplimentary Examinations, Aug/Sep 2008 OPERATING SYSTEMS (Electronics & Instrumentation 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. Explain all the strategies involved in deadlock detection and how it is recovered. [8+8] 5. (a) Consider a paged logical address space (composed of 32 pages of 2Kbytes each) mapped into a 1 Mbytes physical memory space. i. What is the format of the processor’s logical address. ii. What is the length and width of the page table (disregarding the access rights bit). iii. What is the effect on the page table if the physical memory space is reduced by half? (b) Discuss the hardware support requirement for the inverted page table structure. How does this approach affect sharing. [9+7] 6. (a) Which type of process is generally favoured by a multi-level feed back queuing scheduler, a processor bound process or an I/O bound process? Briefly explain why? (b) Consider a variation of round-robin that we will call priority round-robin. In priority round-robin each process has a priority in the range of 1 to 10. When a process is given a time slice the length of quantum is basic constant (say 50 ms) times the priority of the job. Compare this system with an ordinary priority system. [8+8] 7. (a) What do you understand by a file directory? (b) Explain briefly the information elements of a file directory 1 of 2

Code No: RR321004 (c) Explain what is tree-structured directory? 8. (a) What are the various classes of intruders? (b) Discuss about intrusion techniques. ⋆⋆⋆⋆⋆

Set No. 1
[5+5+6]

[8+8]

2 of 2

Code No: RR321004

Set No. 2

III B.Tech Supplimentary Examinations, Aug/Sep 2008 OPERATING SYSTEMS (Electronics & Instrumentation 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) Describe various operations on threads. (b) Discuss about threads synchronization. (c) Write about Kernel level threads. [6+5+5] 3. What are the principles of concurrency and explain the execution of the concurrent process with a simple example. [6+6+4] 4. (a) Three processes share 4 resource units that can be reserved and reused only one at a time. Each process needs a maximum of 2 units. Show that a deadlock cannot occur. (b) N processes share M resource units that can be reserved and released only one at a time. The maximum need of each process does not exceed M and the sum of all maximum needs is less than M + N. Show that a dead lock cannot occur. [8+8] 5. (a) Enumerate the reasons for allowing two or more processes to, all have access to particular region of memory. (b) In a fixed partitioning scheme, what are the advantages of using unequal size partitions? (c) What is the difference between internal and external fragmentation? (d) What are the distinctions among logical, relative and physical addresses? [4+4+4+4] 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. What do you understand by Trusted systems? Draw a figure of reference monitor concept and explain. [5+5+6] ⋆⋆⋆⋆⋆ 1 of 1 [8+8]

Code No: RR321004

Set No. 3

III B.Tech Supplimentary Examinations, Aug/Sep 2008 OPERATING SYSTEMS (Electronics & Instrumentation Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ⋆⋆⋆⋆⋆ 1. (a) Describe the basic instruction cycle with example. (b) What is an Interrupt? Describe the different types of interrupts. 2. Discuss about the following: (a) user-level threads (b) Kernel-level threads (c) Multi-threadings. 3. (a) Write the program for mutual exclusion using semaphores. (b) Explain about infinite buffer producer/consumer problem for concurrent processing which uses binary semaphores [8+8] 4. (a) Three processes share 4 resource units that can be reserved and reused only one at a time. Each process needs a maximum of 2 units. Show that a deadlock cannot occur. (b) N processes share M resource units that can be reserved and released only one at a time. The maximum need of each process does not exceed M and the sum of all maximum needs is less than M + N. Show that a dead lock cannot occur. [8+8] 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. Write short notes of the following (a) Random disk scheduling (b) Priority disk scheduling 1 of 2 [5+5+6] [8+8]

Code No: RR321004 (c) Disk Cache 7. (a) Explain file system software architecture.

Set No. 3
[5+5+6]

(b) Explain the functions of a file management system with a diagram.

[8+8]

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

2 of 2

Code No: RR321004

Set No. 4

III B.Tech Supplimentary Examinations, Aug/Sep 2008 OPERATING SYSTEMS (Electronics & Instrumentation Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ⋆⋆⋆⋆⋆ 1. (a) Describe the basic instruction cycle with example. (b) What is an Interrupt? Describe the different types of interrupts. 2. (a) Explain the reasons for process terminations. (b) Describe the single blocked queue and multiple blocked queues with an example. [4+12] 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. (a) Consider the following snapshot of a system of 5 processes and 4 resources. Process P0 P1 P2 P3 P4 Allocation Max. Available 0012 0012 1520 1000 1750 1354 2356 0632 0652 0014 0656 [8+8]

i. What is the content of the vector need ii. Is the system in a safe state? Verify with algorithm. iii. If a request from process P1 arrives for (0 4 2 0) resources, can the request is immediately granted? Why? With the help of necessary algorithms explain all the steps. (b) Whar are the diffculties that amy arise when a proces is rolled back as the result of a dead lock. [8+8] 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] 1 of 2

Code No: RR321004

Set No. 4
[8+8]

6. (a) Discuss about various criteria used for short-term scheduling (b) Discuss about fair share scheduling method 7. Write short notes on: (a) Sequential file (b) Indexed file (c) Indexed sequential file (d) Direct file. [4+4+4+4]

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

2 of 2

Sign up to vote on this title
UsefulNot useful