Code No: RR410401 Set No.

1
IV B.Tech I Semester Supplimentary Examinations, February 2008
OPERATING SYSTEMS
(Electronics & Communication Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Discuss the Operating System design hierarchy with an example.

(b) Explain the applications of Windows NT Operating System. [8+8]

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 how the concurrent processes cooperate by sharing and by communication?

[16]

4. (a) What are the conditions that must satisfy for deadlock occurrence and explain
them.
(b) Is the deadlocks problem preventable? Justify your answer with example and
diagram. [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) Discuss about various criteria used for short-term scheduling.

(b) Discuss about fair share scheduling method. [8+8]

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. (a) What are the various classes of intruders?

(b) Discuss about intrusion techniques. [8+8]

⋆⋆⋆⋆⋆

1 of 1
Code No: RR410401 Set No. 2
IV B.Tech I Semester Supplimentary Examinations, February 2008
OPERATING SYSTEMS
(Electronics & Communication Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. Describe the Objectives and functions of Operating System. Also explain the dif-
ferent services provided by the operating system. [5+5+6]
2. Discuss about the following:
(a) User-level threads
(b) Kernel-level threads
(c) Multi-threadings. [5+5+6]
3. What is a monitor? Compare it with Semaphore. Explain in detail a monitor with
notify and broadcast using an example. [2+4+5+5]
4. (a) What are the conditions that must satisfy for deadlock occurrence and explain
them.
(b) Is the deadlocks problem preventable? Justify your answer with example and
diagram. [8+8]
5. Consider a memory management system with demand paging. There are three
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 pos-
sible 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. (a) What are preemptive and non-preemptive scheduling policies?
(b) Describe non-preemptive scheduling policies. [8+8]
7. (a) Explain file system software architecture.
(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]

⋆⋆⋆⋆⋆

1 of 1
Code No: RR410401 Set No. 3
IV B.Tech I Semester Supplimentary Examinations, February 2008
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. Contrast Dekker’s algorithm and Peterson’s algorithm. [8+8]

4. How the problem among dining philosophers can be resolved? Suggest a suitable
algorithm. [8+8]

5. (a) Consider a buddy system in which a particular block under the current allo-
cation has an address of 011011110000
i. If the block is of size 4 what is the binary address of its buddy.
ii. If the block is of size 16, what is the binary address of its buddy.
(b) A virtual address in a paging system is equivalent to a pair (p, w), in which
p is a page number and w is a byte number within the page. Let z be the
number of bytes in a page. Find algebraic equation that shows p as function
of z and w.
(c) Why is the capability to relocate a process desirable?
(d) Why is it not possible to enforce memory protection at compile time.[4+4+4+4]

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

(b) Discuss about fair share scheduling method. [8+8]

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. (a) What are the various classes of intruders?

(b) Discuss about intrusion techniques. [8+8]

⋆⋆⋆⋆⋆

1 of 1
Code No: RR410401 Set No. 4
IV B.Tech I Semester Supplimentary Examinations, February 2008
OPERATING SYSTEMS
(Electronics & Communication Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Discuss the Operating System design hierarchy with an example.

(b) Explain the applications of Windows NT Operating System. [8+8]

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. [8+8]

3. (a) Explain different conditions of process interaction with respect to the degree
of awareness, relationship between processes, influence of processes, control
problems.
(b) What are the necessary requirements for mutual exclusion? [8+8]

4. (a) What are the conditions that must satisfy for deadlock occurrence and explain
them.
(b) Is the deadlocks problem preventable? Justify your answer with example and
diagram. [8+8]

5. (a) What elements are typically found in a page table entry? Briefly define each
element.
(b) What is the purpose of translation look aside buffer?
(c) What is the difference between resident set management and page replacement
policy? [6+5+5]

6. Describe various short term scheduling policies. [16]

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. (a) What are the various classes of intruders?

(b) Discuss about intrusion techniques. [8+8]

⋆⋆⋆⋆⋆

1 of 1