Code No: 16019
NR
Set No. 2
in
III B.Tech II Semester Supplimentary Examinations,February 2010 OPERATING SYSTEMS Common to Electronics And Instrumentation Engineering, Electronics And Communication Engineering Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ?????
ld .
1. (a) What is meant by monitor? How the monitor concept is used in solving mutual exclusion problem? (b) How the processors are communicating with each other?
[8+8]
2. (a) What is symmetric multiprocessing? Explain the Win NT objects. (b) Explain the properties of Unix OS.
[8+8]
or
3. (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.
uW
(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] 4. Explain briefly the file organisation in UNIX system V.
[16]
5. (a) Discuss about various criteria used for short-term scheduling. (b) Discuss about fair share scheduling method.
[8+8]
6. (a) Explain the nature of viruses.
nt
(b) Discuss about various types of viruses. (c) Describe the anti-viruse approaches.
[5+5+6]
Aj
7. 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 possible 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] 1
Code No: 16019
NR
Set No. 2
8. (a) Explain process state diagram (5 state model ) with a neat sketch. (b) Describe the typical elements of process control block.
[10+6]
Aj
nt
uW
or
ld .
in
?????
2
Code No: 16019
NR
Set No. 4
in
III B.Tech II Semester Supplimentary Examinations,February 2010 OPERATING SYSTEMS Common to Electronics And Instrumentation Engineering, Electronics And Communication Engineering Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ?????
ld .
1. 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.
or
(a) Let all the data for the processes be located into physical memory. Draw a possible 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]
uW
2. (a) Explain process state diagram (5 state model ) with a neat sketch. (b) Describe the typical elements of process control block.
[10+6]
3. (a) Discuss about various criteria used for short-term scheduling. (b) Discuss about fair share scheduling method.
[8+8]
4. (a) What is symmetric multiprocessing? Explain the Win NT objects.
nt
(b) Explain the properties of Unix OS.
[8+8]
5. (a) What is meant by monitor? How the monitor concept is used in solving mutual exclusion problem? (b) How the processors are communicating with each other?
[8+8]
Aj
6. (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]
7. (a) Explain the nature of viruses. (b) Discuss about various types of viruses. 3
Code No: 16019
NR
Set No. 4
(c) Describe the anti-viruse approaches.
[5+5+6]
8. Explain briefly the file organisation in UNIX system V.
[16]
Aj
nt
uW
or
ld .
in
?????
4
Code No: 16019
NR
Set No. 1
1. Explain briefly the file organisation in UNIX system V.
in
III B.Tech II Semester Supplimentary Examinations,February 2010 OPERATING SYSTEMS Common to Electronics And Instrumentation Engineering, Electronics And Communication Engineering Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ????? [16]
ld .
2. (a) Explain process state diagram (5 state model ) with a neat sketch. (b) Describe the typical elements of process control block.
[10+6]
3. (a) What is symmetric multiprocessing? Explain the Win NT objects. (b) Explain the properties of Unix OS.
[8+8]
or
4. (a) What is meant by monitor? How the monitor concept is used in solving mutual exclusion problem? (b) How the processors are communicating with each other?
[8+8]
5. (a) Discuss about various criteria used for short-term scheduling.
uW
(b) Discuss about fair share scheduling method.
[8+8]
6. (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.
nt
(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]
Aj
7. 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 possible 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]
8. (a) Explain the nature of viruses. 5
Code No: 16019
NR
Set No. 1
(b) Discuss about various types of viruses. (c) Describe the anti-viruse approaches.
[5+5+6]
Aj
nt
uW
or
ld .
in
?????
6
Code No: 16019
NR
Set No. 3
in
III B.Tech II Semester Supplimentary Examinations,February 2010 OPERATING SYSTEMS Common to Electronics And Instrumentation Engineering, Electronics And Communication Engineering Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ????? 1. (a) Explain process state diagram (5 state model ) with a neat sketch.
2. (a) Explain the nature of viruses. (b) Discuss about various types of viruses. (c) Describe the anti-viruse approaches.
[10+6]
ld .
(b) Describe the typical elements of process control block.
or
3. Explain briefly the file organisation in UNIX system V.
[5+5+6] [16]
uW
4. 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 possible 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.
nt
(c) Assume that process P1 gets swapped back into memory. Give the page tables in this situation. [5+5+6] 5. (a) What is symmetric multiprocessing? Explain the Win NT objects. (b) Explain the properties of Unix OS.
[8+8]
Aj
6. (a) What is meant by monitor? How the monitor concept is used in solving mutual exclusion problem? (b) How the processors are communicating with each other?
[8+8]
7. (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] 7
Code No: 16019
NR
Set No. 3
8. (a) Discuss about various criteria used for short-term scheduling. (b) Discuss about fair share scheduling method.
[8+8]
Aj
nt
uW
or
ld .
in
?????
8