CODE NO: 07A80309

R07

SET No - 1

IV B.TECH - II SEMESTER EXAMINATIONS, APRIL/MAY, 2011 OPERATING SYSTEM CONCEPTS (MECHANICAL ENGINEERING) Time: 3hours Max. Marks: 80 Answer any FIVE questions All Questions Carry Equal Marks --1.a) b) 2) Explain system call with an example. Explain memory utilization during the operation of an operating system.

[8+8]

Describe actions of the kernel when processes make system calls for the following purposes: a) A receive request for a message b) A memory request c) Request for information concerning a process d) Request to create a process. [4+4+4+4] Explain the solution to the Bounded-Buffer Producer/Consumer problem using semaphores. [16] Explain the concept of page buffering substantiate its need in paging. Discuss the relation between replacement policy and cache size. Explain the deadlock recovery methods and related issues. Enumerate the steps in the deadlock detection algorithm. Depict the interrupt-driven I/O cycle diagram.

3.

4.a) b) 5.a) b) c) 6.a) b)

[8+8]

[6+6+4]

Discuss file access methods and directory structures. State and explain various techniques for free space management in file system implementation. [8+8] Explain the RAID levels and their applications with diagrams. Discuss the goals of system protection. Give a detailed note on the system and network threats. [16]

7. 8.a) b)

[8+8]

******

CODE NO: 07A80309

R07

SET No - 2

IV B.TECH - II SEMESTER EXAMINATIONS, APRIL/MAY, 2011 OPERATING SYSTEM CONCEPTS (MECHANICAL ENGINEERING) Time: 3hours Max. Marks: 80 Answer any FIVE questions All Questions Carry Equal Marks --1.a) b) 2. Explain the different kinds of registers and their usage in a CPU. Explain the various fields in a program status word.

[8+8]

An application is to be coded using threads. Describe the conditions under which you would recommend use: a) Kernel-level threads b) User-level threads. [8+8] Explain the Round Robin scheduling, algorithm and priority scheduling algorithm with suitable examples. Explain semaphores. Also explain three important uses of semaphores. [8+8] What is the cause of thrashing? How does the system detect thrashing and once detected what steps are taken by the system to eliminate it? Discuss the demand paging technique. [8+8] How the deadlocks can be avoided? Explain with the help of necessary algorithm. [16] Explain the free space management methods. Compare and contrast the file systems with respect to the following: UNIX, LINUX and Windows. Explain any two schemes for improving the efficiency and performance of secondary storage. [6+6+4] Explain the two disle storage access methods with diagrams. Explain about SAN with diagram. Define: Seek time, rotational latency time and disle bandwidth. [8+8] Explain briefly encryption and description of data. Write short notes on: i) Cipher tent only attack ii) Known plain text attack iii) Chosen plain text attack.

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

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

[8+8]

******

CODE NO: 07A80309

R07

SET No - 3

IV B.TECH - II SEMESTER EXAMINATIONS, APRIL/MAY, 2011 OPERATING SYSTEM CONCEPTS (MECHANICAL ENGINEERING) Time: 3hours Max. Marks: 80 Answer any FIVE questions All Questions Carry Equal Marks --1.a) b) Explain the functions of an interrupt in an OS. What are the three classes of interrupts that are important during normal operation of an OS? [6+10] An OS contains 2 processes P1 and P2 with P2 having a higher priority than P1. Let P2 be blocked on an I/O operation and let P1 be running. Explain in 4 brief steps, the actions that take place when the I/O completion event occurs for the I/O operation of P2. Make a list of system calls a thread should avoid using, if threads are implemented at the user-level. [8+8] Explain in detail three uses of semaphores in concurrent systems. [16]

2.a)

b)

3. 4.

A virtual memory handler uses dynamic sharing of pages. Describe the house keeping actions performed by it in the following situations: a) When a page fault occurs b) When a shared page drops out of the working set of one of the sharing processes. [16] Enumerate the conditions that characterize a dead lock? Explain resourceallocation-graph algorithm for deadlock detection with relevant diagrams. Enumerate the methods for handling a dead lock. What are safe state and safe sequences? [8+8] Explain file system software architecture. What are the important criteria in choosing a file organization? Explain sequential file organization.

5.a) b)

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

[4+6+6]

Compare the through put of SCAN and C-SCAN assuming a uniform distribution of requests. What is RAID? Explain how RAID level 5 is implemented? [8+8] List the security attacks that cannot be prevented by encryption. Describe why authentication is important for file protection. Describe advantages and draw backs of performing file protection checks at: a) File open time b) Every read or write operation. [4+6+6] ******

CODE NO: 07A80309

R07

SET No - 4

IV B.TECH - II SEMESTER EXAMINATIONS, APRIL/MAY, 2011 OPERATING SYSTEM CONCEPTS (MECHANICAL ENGINEERING) Time: 3hours Max. Marks: 80 Answer any FIVE questions All Questions Carry Equal Marks --1.a) b) What is CPU state? Explain how the notion of CPU state is useful in implementing multiprogramming. Explain the two modes of operation of CPU: a) Privileged-mode b) User-mode. [8+8] Explain the fields in a process control block. Explain briefly Kernel level threads and user-level threads. Write advantages and disadvantages of both types of threads. [8+8] Explain critical section (CS) with neat examples. Explain the three essential properties of a critical section (CS) implementation. [8+8] Explain any 4 page replacement algorithms with suitable examples. Explain the Bankers algorithm for dead lock avoidance illustratively. Explain: Polling, DMA, Buffering, Caching. [16]

2.a) b)

3.a) b)

4. 5.a) b) 6.a) b) c) 7.

[8+8]

Why is the average search time to find a record in a file less for an indexed, sequential file than for a sequential file? Explain. What is the difference between a file and a database? What are the typical operations that may be performed on a directory? [6+6+4] Explain the following disk scheduling algorithms with illustrative diagrams: a) FCFS b) SSTF c) SCAN d) C-SCAN e) C-LOOK. [16] Distinguish protection and security. Define secure system. Explain program threats.

8.a) b)

[8+8]

******