Code No: RR311301 Set No.

1
III B.Tech I Semester Supplementary Examinations, February 2007
COMPUTER OPERATING SYSTEMS
(Electronics & Control Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. What is OS? Describe the different types of Operating systems with the examples.

[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. Demonstrate that the following software approaches to mutual exclusion do not
depend on elementary mutual exclusion at the memory access level:
(a) The bakery algorithm
(b) Peterson’s algorithm. [8+8]
4. (a) Consider the following snapshot of a system of 5 processes and 4 resources.
Process Allocation Max. Available
P0 0012 0012 1520
P1 1000 1750
P2 1354 2356
P3 0632 0652
P4 0014 0656
i. What is the content of the vector need
ii. Is the system in a safe state? Verify with algorithm.
iii. If a request from process P1 arrives for (0 4 2 0) resources, can the request
is immediately granted? Why? With the help of necessary algorithms
explain all the steps.
(b) Whar are the diffculties that amy arise when a proces is rolled back as the
result of a dead lock. [8+8]
5. (a) Assume we have a 36 bit virtual address. Each page frame in this pure paging
system is 4K in size. Each page table entry is 4 bytes long.
i. What is the total size in bytes of the page table?
ii. Assume we implement a two level paging scheme with equal number of
bits representing a page directory and a page number within each page
directory. Each entry in the page directory also occupies 4 bytes. What
is the minimum amount of table space in bytes for supporting a physical
addressable range of 4 MB.

1 of 2
Code No: RR311301 Set No. 1
(b) Illustrate the technique of using frame table (an inverted page table) support-
ing multiple addresses in a pure paging system. [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]

⋆⋆⋆⋆⋆

2 of 2
Code No: RR311301 Set No. 2
III B.Tech I Semester Supplementary Examinations, February 2007
COMPUTER OPERATING SYSTEMS
(Electronics & Control 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. What is Readers/Writers problem? Explain the method of solving the problem by

using Semaphores with Writers having priority. [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) Explain the process of loading programs into main memory.

(b) Write in brief on the following memory management techniques comparing
their relative strengths and weaknesses.
i. Fixed Partitioning
ii. Simple Segmentation
iii. Virtual Memory Paging
iv. Dynamic Partitioning
(c) Describe the Placement Algorithm. [4+8+4]

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

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

7. (a) Explain file system software architecture.

(b) What are the important criteria in choosing a file organization.
(c) Explain the file and sequential file organization. [6+5+5]

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: RR311301 Set No. 3
III B.Tech I Semester Supplementary Examinations, February 2007
COMPUTER OPERATING SYSTEMS
(Electronics & Control 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. What is queuing discipline? Explain with an example the way in which the message
passing can be used to enforce mutual exclusion. [4+6+6]

4. What is dining philosophers problem? Device an algorithm to solve the problem

using Semaphore. [4+12]

5. (a) Assume we have a 36 bit virtual address. Each page frame in this pure paging
system is 4K in size. Each page table entry is 4 bytes long.
i. What is the total size in bytes of the page table?
ii. Assume we implement a two level paging scheme with equal number of
bits representing a page directory and a page number within each page
directory. Each entry in the page directory also occupies 4 bytes. What
is the minimum amount of table space in bytes for supporting a physical
addressable range of 4 MB.
(b) Illustrate the technique of using frame table (an inverted page table) support-
ing multiple addresses in a pure paging system. [8+8]

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. What do you understand by Trusted systems? Draw a figure of reference monitor

concept and explain. [5+5+6]

⋆⋆⋆⋆⋆

1 of 1
Code No: RR311301 Set No. 4
III B.Tech I Semester Supplementary Examinations, February 2007
COMPUTER OPERATING SYSTEMS
(Electronics & Control Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. Differentiate the following:

(a) DMA Vs Interrupt driven I/O
(b) Programmed I/O Vs Memory Mapped I/O [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. What is Readers / Writers problem? Explain the method of solving the problem
by using semaphore with Readers having priority. [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. Consider a memory management system with demand paging. There are there
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) Discuss about direct memory access
(b) With neat diagram explain I/O organization model [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