Set No.

Code No: 220503

1
Max Marks:80

II B.Tech., II Semester Supplementary Examinations, November-2003 OPERATING SYSTEMS (Common to Computer Science and Engineering, Computer Science and Information Technology, Computer Science and Systems Engineering) Time:3 hours Answer any Five Questions All questions carry equal marks. ----1. Mention the various registers and their functions under the following categories. (a) User-visible registers (b) Control and status registers. 2.a) b) 3. 4. 5.a) b) c) 6.a) Explain the reasons for process termination. Describe the single blocked queue and multiple blocked queues with and example. Using an example get the solution to the mutual exclusion problem by using Semaphore and explain the process clearly. What is deadlock avoidance? Explain process initiation denial and resource allocation denial in detail with example. Consider a dynamic partitioning scheme. Prove that on an average the memory contains half as many holes as segments. What are the steps involved in loading a program in memory. Compare and Contrast the different approaches to loading.

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. What do you understand by a file directory? Explain briefly the information elements of a file directory Explain what is tree-structured directory. Explain the nature of viruses. Discuss about various types of viruses. Describe the anti-viruse approaches. !!!!!

7.a) b) c) 8.a) b) c)

Set No.

Code No: 220503

2
Max Marks:80 Answer any Five Questions All questions carry equal marks. ----

II B.Tech., II Semester Supplementary Examinations, November-2003 OPERATING SYSTEMS (Common to Computer Science and Engineering, Computer Science and Information Technology, Computer Science and Systems Engineering) Time:3 hours

1. 2.a) b) c) 3. 4. 5.a)

Describe the following : (a) Virtual Memory (b) Cache Memory (c) Auxiliary Memory. Describe various operations on threads. Discuss about threads synchronization. Write about Kernel level threads. What is a monitor? Compare it with semaphore. Explain in detail a monitor with notify and broadcast using an example. What are the principles of deadlock and explain in detail the two categories of resources. Explain with a neat sketch. i. Address translation in a segmentation system ii. Address translation in a paging system. Describe about various disk performance parameters? 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. Explain in detail the four terms field, record, file and database with respect to files. List the objectives and the requirements for a file management system Write notes on : (a) intrusion detection (b) password protection. !!!!!

6.a) b)

7.a) b) 8.

Set No. Code No: 220503

3

II B.Tech., II Semester Supplementary Examinations, November-2003 OPERATING SYSTEMS (Common to Computer Science and Engineering, Computer Science and Information Technology, Computer Science and Systems Engineering) Time:3 hours Max Marks:80 Answer any Five Questions All questions carry equal marks. ---1.a) DMA access to main memory is given higher priority than processor access to main memory. Why? Explain with an example. b) Explain the characteristics of Two level memories. Define the following: (i) Process (ii) Program (iii) Process state (iv) Process control block (v) Process Scheduling. Explain the process State Transition diagram with examples. Explain the various mechanisms provided by UNIX for inter processor communication and synchronization in detail. What are the conditions that must satisfy for deadlock occurrence and explain them. Is the deadlocks problem preventable? Justify your answer with example and diagram. Explain the concept of page buffering. Substantiate its need in paging. Discuss the relation between Replacement policy and cache size. Enumerate the factors that influence when an Operating System decides the quantum of main memory to be allocated to a particular process. Write short notes on fixed allocation. Suppose we have a disk with 200 tracks. The disk head starts at track100, and moving in the direction of decreasing track number. For the following sequence of disk track requests 27, 129, 110, 186, 147, 41, 10, 64, 120, compute the average seek time for the following disk scheduling algorithms FIFO, SSTF, Scan, C-Scan. Queue contains the following request in order at time 0, 27,129,110,186,147, 41, 20, 64, 120. Compute the average time to service a request for the disk head scheduling algorithm FCFS. Write short notes on: (a) Sequential file (b) Indexed file (c) Indexed sequential file (d) Direct file. Write short notes on: (a) Trojan Horse defense (b) Trojan horses. !!!!!

2.a) b) 3. 4.a) b) 5.a) b) c) d) 6.

7. 8.

Set No. Code No: 220503

4
Max Marks:80 Answer any Five Questions All questions carry equal marks. ----

II B.Tech., II Semester Supplementary Examinations, November-2003 OPERATING SYSTEMS (Common to Computer Science and Engineering, Computer Science and Information Technology, Computer Science and Systems Engineering) Time:3 hours

1.a) b)

What is symmetric multiprocessing? Explain the Win NT objects. Explain the properties of Unix OS.

2.a) What is Swapping? Explain the need for swapping. . b) Explain the general structure of operating system control tables with an example. 3. 4. 5.a) b) c) What is message passing? Explain the design characteristics of message systems for inter process communication and synchronization. Give the conditions for deadlock and explain the methods of preventing deadlock. Differentiate between demand cleaning and pre-cleaning. What is the difference between a resident set and a working set A process references five pages A, B, C, D, and E, in the following order: A; C; B; E; A; B; E; A; B; C; D; E; Assume the replacement algorithm is first-in-first- out. Find the number of page transfers during this sequence of references starting with an empty main memory with three page frames. Repeat for four page frames. Explain in detail about disk cache performance using frequency based replacement. The following equation was suggested both for cache memory and disk cache memory Ts=Tc+M * TD Generalize this equation to a memory hierarchy with N levels instead of just 2 levels. What are the various types of operations that may be performed on the directory. What are the various access rights that can be assigned to a particular user for a particular file. Explain different methods of record blocking. What are the security requirements of a computer and network. Explain different types of threats. Explain the computer system assets. !!!!!

6.a) b)

7.a) b) c) 8.a) b) c)