Os Nov 2007

Code No: RR410401 Set No.
1
IV B.Tech I Semester Regular Examinations, November 2007
OPERATING SYSTEMS
(Electronics & Communication Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆
1. With the help of neat block diagram, describe the computer components with an
example. [16]
2. (a) Describe various operations on threads.
(b) Discuss about threads synchronization.
(c) Write about Kernel level threads. [6+5+5]
3. (a) Explain busy waiting and blocking wait.
(b) Is busy waiting always less efficient (in terms of using process or time) than a
blocking wait? Explain. [8+8]
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. [8+8]
5. (a) Cleary explain how, in general a virtual address generated by the CPU is
translated into a physical main address.
(b) A process contains eight Virtual Pages in disk and is assigned a fixed allocation
of four page frames in main memory. The following page trace occurs: 1, 0,
2, 2, 2, 7, 6, 7, 0, 1, 2, 0, 3, 0, 4, 5 .
i. how the successive pages residing in the four frames using the LRU re-
placement policy. Compute the hit ratio in main memory. Assume the
frames are initially empty.
ii. for FIFO replacement policy. [8+8]
6. (a) Discuss about various criteria used for short-term scheduling.
(b) Discuss about fair share scheduling method. [8+8]
7. Write about
(a) Free space management.
(b) Reliability of a file allocation. [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
OPERATING SYSTEMS
⋆⋆⋆⋆⋆
1. With the help of neat block diagram, describe the computer components with an
example. [16]
2. (a) Explain the reasons for process terminations.

(b) Describe the single blocked queue and multiple blocked queues with an exam-
ple. [4+12]
3. Explain the various mechanisms provided by UNIX for inter process communication
and synchronization in detail. [16]
4. How the deadlocks can be avoided? Explain with the help of necessary algorithms.
[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]

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. Write notes on:
(a) intrusion detection

(b) password protection. [8+8]
⋆⋆⋆⋆⋆
1 of 1
OPERATING SYSTEMS
⋆⋆⋆⋆⋆
1. With the help of simple interrupt processing block diagram, explain the interrupt
processing with an example. [5+6+5]
2. (a) Explain the reasons for process terminations.

(b) Describe the single blocked queue and multiple blocked queues with an exam-
ple. [4+12]
3. What is Semaphore? Define the Binary Semaphore primitives and explain Semaphore
mechanism with an example. [2+5+5+4]
4. What is deadlock avoidance? Explain process initiation denial and resource allo-
cation denial in detail with example. [4+4+4+4]
partitions?
[4+4+4+4]


8. (a) What are the various classes of intruders?

(b) Discuss about intrusion techniques. [8+8]
⋆⋆⋆⋆⋆
1 of 1
OPERATING SYSTEMS
⋆⋆⋆⋆⋆
1. Differentiate the following:
(a) DMA Vs Interrupt driven I/O

(b) Programmed I/O Vs Memory Mapped I/O [8+8]
2. (a) Describe various operations on threads.

(b) Discuss about threads synchronization.
(c) Write about Kernel level threads. [6+5+5]
3. (a) What design and management issues are raised by the existence of concur-
rency? Point out how the issues of speed independence can be addressed?
(b) Explain in detail how concurrent process come into conflict with each other,
when they are competing for the use of the same resource? [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]
partitions?
[4+4+4+4]


1 of 2
8. Write notes on:
(a) intrusion detection

(b) password protection. [8+8]
⋆⋆⋆⋆⋆
2 of 2

Os Nov 2007

Enviado por

Dados do documento

Descrição original:

Título original

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

Os Nov 2007

Enviado por

Direitos autorais:

Formatos disponíveis

Code No: RR410401 Set No.

2. (a) Explain the reasons for process terminations.

6. (a) Discuss about various criteria used for short-term scheduling.

7. (a) What do you understand by a file directory?

8. Write notes on:

(a) intrusion detection

2. (a) Explain the reasons for process terminations.

6. (a) Discuss about various criteria used for short-term scheduling.

7. (a) What do you understand by a file directory?

8. (a) What are the various classes of intruders?

1. Differentiate the following:

(a) DMA Vs Interrupt driven I/O

2. (a) Describe various operations on threads.

6. (a) Discuss about various criteria used for short-term scheduling.

7. (a) What do you understand by a file directory?

(a) intrusion detection

Você também pode gostar