Code No: R05310503 Set No.

1
III B.Tech I Semester Regular Examinations, November 2008
OPERATING SYSTEMS
( Common to Computer Science & Engineering, Electronics &
Instrumentation Engineering, Information Technology, Electronics &
Control Engineering, Computer Science & Systems Engineering and
Electronics & Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. Justify the following statements.

(a) OS can be viewed as a Resource Allocator.

(b) OS is a Control Program [8+8]

2. (a) What are the two separate and potentially independent characteristics em-
bodied in the concept of the process? Discuss.
(b) What resources are typically shared by all of the threads of a process? [8+8]

3. Write the short notes on the following

(a) Race Condition

(b) Process Interaction [8+8]

4. Explain about Deadlock Avoidance. [16]

5. (a) A computer has four page frames. The time of loading, time of last access and
the R and M bits for each page are as shown below (the times are in clock
ticks):

Page Loaded Last ref R M

0 126 279 0 0
1 230 260 1 0
2 120 272 1 1
3 160 280 1 1
i. Which page will FIFO replace
ii. Which page will LRU replace
iii. Which page will second chance replace
(b) In a fixed-partitioning scheme, what are the advantages of using unequal-size
partitions? [9+7]

6. What is the purpose of processor scheduling? Explain various types of scheduling

for uniprocessor system. [16]

7. (a) What is FAT? Discuss its role in secondary storage management.

1 of 2
Code No: R05310503 Set No. 1
(b) Differentiate between spanned and unspanned record blocking method. [8+8]

8. Explain intrusion detection. Discuss the approaches to intrusion detection and

audit records. [16]

⋆⋆⋆⋆⋆

2 of 2
Code No: R05310503 Set No. 2
III B.Tech I Semester Regular Examinations, November 2008
OPERATING SYSTEMS
( Common to Computer Science & Engineering, Electronics &
Instrumentation Engineering, Information Technology, Electronics &
Control Engineering, Computer Science & Systems Engineering and
Electronics & Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. What are the major activities of an operating system with regard to process man-
agement? [16]

2. What are various steps involved in change of a process state? Explain in detail?
[16]

3. Explain the solution for the critical section problem for multiple processes. [16]

4. What are the different LINUX spinlcocks? Explain. [16]

5. (a) Explain Paging hardware with translation look-aside buffer.

(b) How memory protection can be accomplished in a paged environment? Ex-
plain. [8+8]

6. (a) Explain various disk performance parameters.

(b) Show that the use buffer can reduce the running time by atmost a factor of
two. [8+8]

7. Explain various techniques implemented for free space management, discuss with
suitable examples. [16]

8. (a) Discuss about access control lists with suitable example.

(b) Write a note on intruders. [8+8]

⋆⋆⋆⋆⋆

1 of 1
Code No: R05310503 Set No. 3
III B.Tech I Semester Regular Examinations, November 2008
OPERATING SYSTEMS
( Common to Computer Science & Engineering, Electronics &
Instrumentation Engineering, Information Technology, Electronics &
Control Engineering, Computer Science & Systems Engineering and
Electronics & Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. Differentiate Distributed systems from Multiprocessor systems. [16]

2. What are the various reasons for process suspension? Explain. [16]

3. Define monitor. What are its characteristics? [16]

4. Elaborate the following Solaris Thread Synchronization Primitives.

(a) Readers/Writer Lock

(b) Condition Variables. [8+8]

5. (a) Compare global and local page replacement algorithms. What are the advan-
tages of each?
(b) Describe two-level paging. What problems two-level paging tries to solve?
[8+8]

6. Explain Fair-share scheduling policy with an appropriate example. Compare its

performance with any other scheduling policy. [16]

7. (a) Discuss the criteria for choosing a file organization.

(b) Describe indexed file, indexed sequential file organization. [8+8]

8. (a) Explain the requirements of computer and network security.

(b) Discuss the assets of a computer system. [8+8]

⋆⋆⋆⋆⋆

1 of 1
Code No: R05310503 Set No. 4
III B.Tech I Semester Regular Examinations, November 2008
OPERATING SYSTEMS
( Common to Computer Science & Engineering, Electronics &
Instrumentation Engineering, Information Technology, Electronics &
Control Engineering, Computer Science & Systems Engineering and
Electronics & Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. Some CPUs provide for more than two modes of operation. What are two possible
uses of these multiple modes? Explain. [16]

2. Explain about the following.

(a) Process identification.

(b) Processor state information. [8+8]

3. Explain the solution for the critical section problem for multiple processes. [16]

4. Explain about Deadlock Avoidance. [16]

5. Explain segmentation scheme for memory management. Give the segmentation

hardware. [16]

6. Explain Fair-share scheduling policy with an appropriate example. Compare its

performance with any other scheduling policy. [16]

7. (a) What is FAT? Discuss its role in secondary storage management.

(b) Differentiate between spanned and unspanned record blocking method. [8+8]

8. (a) Discuss the password file protection mechanisms.

(b) Write a detail note on Masquerader, Misfeasor, and clandestine user. [8+8]

⋆⋆⋆⋆⋆

1 of 1