subject paper operating system- ii hird ear...subject : paper-504 : operating system- ii third year...

Jump2Learn The Online Learning Place

Website : www.jump2learn.com | Email : [email protected] | YouTube : Jump2Learn Facebook Page : www.facebook.com/Jump2Learn | Instagram : www.instagram.com/jump2learn

SUBJECT : PAPER-504 : OPERATING SYSTEM- II

THIRD YEAR B.C.A. (SEM. V) EXAMINATION

This pdf file contains YEAR 2012 to 2019 question Papers list of above

subject. The question Bank will be upload in future for the students

1. Mar/Apr –2012 2. Oct/Nov –2013 3. Mar/Apr – 2014 4. Oct/Nov –2014 5. Mar/Apr – 2015 6. Oct/Nov – 2015 7. Mar/Apr – 2016

8. Oct/Nov –2016 (Old Course) 9. Oct/Nov –2016 (New Course)

10. Mar/Apr – 2017 11. Oct/Nov – 2017 12. Mar/Apr – 2018 13. Oct/Nov – 2019 14. Mar/Apr – 2019

For Further information Follow the below links.

Website : www.jump2learn.com | Email : [email protected] | YouTube : Jump2Learn Facebook Page : www.facebook.com/Jump2Learn | Instagram: www.instagram.com/jump2learn

Page 1 of 45

http://www.jump2learn.com/mailto:[email protected]://www.youtube.com/channel/UCy7aRjT8rolLvlKrT2E4bcwhttp://www.facebook.com/Jump2Learnhttp://www.instagram.com/jump2learnhttp://www.jump2learn.com/mailto:[email protected]://www.youtube.com/channel/UCy7aRjT8rolLvlKrT2E4bcwhttp://www.facebook.com/Jump2Learnhttp://www.instagram.com/jump2learn



1

Third Year B.C.A. (Sem. V) Examination

March / April – 2012

Operating System-II: Paper-504

[Time: 3 Hours ] [ Total Marks: 70 ]

Instructions

(1)

(2) Give appropriate example, when require.

(3) Do not change options.

Q.1 Answer in short: (any seven) 14

(1) What is race condition? How to avoid it?

(2) What do you mean by co-operating process?

(3) What is use of PMTBR, PMLTR registers? What is difference between buffering and blocking?

(4) What is difference between paging and segmentation?

(5) What is difference between first fit and best fit algorithms? Which one is better? And why?

Fill up strictly the details of signs on your answer book

Name of the Examination: Third Year B.C.A. (Sem. V)

Name of the Subject : Operating System-II: Paper-504

Subject Code No.: 3 7 8 1

Seat No.:

Student’s Signature

Page 2 of 45

http://www.jump2learn.com/mailto:[email protected]://www.youtube.com/channel/UCy7aRjT8rolLvlKrT2E4bcwhttp://www.facebook.com/Jump2Learnhttp://www.instagram.com/jump2learn



2

(6) What information needs to be saved when context switch takes place?

(7) What are Access Control Lists?

(8) What is dirty bit?

Q.2 Do as directed: 8+6=14

(1) Explain with diagram. Indexed Allocation.

(2) Consider reference string given below:

1, 3, 4, 4, 3, 2, 1, 7, 5, 6, 4, 2, 1, 2, 4, 3, 2, 1

Show with diagram how many page faults occur in following

replacements? Consider the memory is empty initially, and

memory having 4 page frames.

(a) Optimal page replacement algorithm.

(b) Least recently used page replacement algorithm.

OR

(1) Explain multilevel feedback queue algorithm for process scheduling.

(2) List out 4 necessary conditions to occur for deadlock. Explain how

can you prevent deadlock by breaking any one.

Q.3 Write short notes: (any three) 18

(1) Second Chance (SC) algorithm.

(2) Message passing system.

(3) Semaphore.

(4) Inverted Page Table.

Page 3 of 45




3


(1) Consider the following set of process, with the length CPU-burst time given

in milliseconds:

Process Burst time Priority

P1 3 1

P2 7 4

P3 5 2

P4 1 1

P5 4 3

The processes are assumed to have arrived in following order.

Pl, P2, P3, P4, P5 all at time 0

(a) Draw four Gantt Charts illustrating the execution of these process

using

(i) FCFS scheduling

(ii) SJF scheduling

(iii) A non preemptive priority (a small priority number implies a higher priority) scheduling.

(iv) Round Robin (quantum = 1) scheduling.

(b) What is the turn around time and waiting time of each

process for each of the scheduling algorithm for (a)?

(c) Which of the schedules in part (a) results in minimum

Page 4 of 45




4

average waiting time (overall processes)?

(2) Suppose a disk drive has 400 cylinders numbered from 0 to 399. Drive is

currently serving the request at cylinder no. 150. The queue for pending

request is as follows:

180, 65, 320, 93, 9, 390, 260, 40, 80, 220

What is the total distance that the disk arm moves to satisfy

all the pending requests for each of the following disk-

scheduling algorithms?

(i) FCFS

(ii) SSTF

(iii) SCAN

(iv) C-LOOK.


(1) Discuss Peterson's solution for achieving the mutual exclusion.

Also write the necessary code for implementing it.

OR

(1) Write a note on inverted page title.

(2) Differentiate between static and dynamic memory allocation.

OR

(2) If page fault occurs, how OS handles it? Explain in brief.

Page 5 of 45




1

Third Year B.C.A. (Sem. V)(CBCS) Examination

October / November – 2013



Instructions

(1)



1. Answer in short: 14

(1) List the major criteria that will give you the good process scheduling policy.

(2) What do you mean by race condition?

(3) Define Hold and Wait and Circular Wait conditions. Also find out any relation between

them.

(4) What are the major functions of File Management?

(5) What do you mean by cooperating processes?

(6) Define principle of Locality.


Name of the Examination: Third Year B.C.A. (Sem. V) (CBCS)



Seat No.:


Page 6 of 45




2

(7) What is absolute and relative path name?

2. Do as directed: 14

(1) Explain paging with segmentation in details.

(2) Explain the linked allocation of disk space of file.

OR

(2) Write a note on critical region problem. Discuss Peterson’s algorithm.

3. Write short notes: (Any Two) 14

(1) Safe State

(2) Message passing system

(3) Hierarchical page table


(1) Consider the following table: 7

Process Arrival Time CPU Burst

P1 0 8

P2 1 4

P3 2 1

Page 7 of 45




3

What is the average turnaround time with FCFS and SJN?

(2) Consider the reference string given below: 7

1 2 3 4 5 8 3 6 0 1 2 3 4 8 3 6 2 5 3

How many page faults will occur for the following replacement? Consider the memory is

empty initially and having 3 frames.

(i) Optimum page replacement algorithm

(ii) Least recently used page replacement algorithm

5. Do as directed: (Any Two) 14

(1) Explain any two methods for file access control verification.

(2) What is semaphore? Explain how does it solve the critical section problem.

(3) Discuss RR policy with its merits and demerits. What is the impact of the quantum

of time slice on the system performance? What criteria you should consider to decide

the proper time slice?

Page 8 of 45




1

Third Year B.C.A. (Sem. V)(CBCS) Examination




Instructions

(1)



1. Answer in short. 14

(1) What is compaction? Why it is required?

(2) Define turnaround & throughput time.

(3) Define preemptive & non-preemptive scheduling.

(4) Give the difference between starvation & Deadlock.



(7) What is the difference between deadlock prevention and deadlock avoidance?





Seat No.:


Page 9 of 45




2

2. Do As Directed. 14

(1) Explain paging with segmentation in detail.

(2) Why we required structured page table? Explain Hierarchical Page Table in

detail.

OR

(2) Write a note on critical region problem. Discuss Paterson's algorithm.

3. Write short note (Any Two). 14

(1) Demand paging.

(2) Tree level directory structure.

(3) Static partitioning Scheme.

4. Do as directed. 14

(1) Consider the following table: 7

Process Arrival

Time (ms) CPU burst

(ms)

P1 1 7

P2 2 3

P3 3 1

P4 4 4

P5 5 5

Page 10 of 45




3

(i) Draw three time line (Gantt) charts illustrating the execution of

these processes using SJF, SRT, RR (quantum = 2) scheduling.

(ii) What is the turnaround time & waiting time of each process for

each of the scheduling algorithms?

(2) Consider the reference string given below: 7

2 3 1 2 4 6 0 2 6 3 2 9 8 3 6 2 3 2

How many page faults will occur for the following replacement? Consider

the memory is empty initially and having 4 frames.

(i) Least recently used page replacement algorithm.

(ii) FIFO page replacement algorithm.

5. Do as directed. (Any 2) 14


(2) List four necessary conditions to occur deadlock. Explain how you can

prevent deadlock by breaking any one?

(3) Explain Address binding in detail.

Page 11 of 45




1


November / December– 2014



Instructions

(1)




(1) Define Deadlock.

(2) What purpose does the modified bit serve in demand paging System?

(3) What is do you mean by cooperating processes?

(4) What information needs to be saved when context switching takes place?

(5) What do you mean by Hit ratio?


(7) Difference between Job Scheduler & Process Scheduler.





Seat No.:


Page 12 of 45




2


(1) Given reference string is (Consider three Page Frames) 6

1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5.

Then discuss FIFO algorithm.

Also check is there Belady's Anomaly or not. (Considering Four Page Frames)

(2) If FIFO algorithm mistakenly replaces the page that is still in active use, then which 6

technique is used to overcome this problem? Explain it.

(3) Discuss Round Robin policy with its merits & demerits. What is the impact of the 6

quantum of time slice on the system performance?

OR

(3) Write a note on critical region problem. Discuss Primitives for mutual exclusion 6

algorithm.

3. Write short note: (Any Two) 18

(1) Demand Paging

(2) Hash Page table

(3) Tree level directory structure

(4) Message passing system.

Page 13 of 45




3


(1) Consider the following table:

Process Arrival

Time

CPU burst

(ms)

P1 0 8

P2 1 4

P3 2 1

P4 3 2

P5 4 5

What is the average turnaround time with FCFS and SJN?

OR

(1) Consider the following table:

Process CPU

burst

P1 10

P2 1

P3 2

P4 1

P5 5

Page 14 of 45




4

(i) Draw three time line charts illustrating the execution of these

processes using SRT, RR (quantum=2) scheduling.

(ii) What is the turnaround time of each process for each of the scheduling

algorithms?



OR

(1) Explain the hierarchy model of the file system.

(2) What is producer-consumer problem? Explain with example.

OR

(2) List four necessary conditions to occur deadlock. Explain.

Page 15 of 45




1

Third Year B.C.A. (Sem. V) (CBCS)Examination




Instructions




(1) What are the PM functions?

(2) What is the compaction? Why it is required?

(3) Define mutual exclusion.

(4) What information needs to be saved when context switching takes place?

(5) What are the major functions of File Management?







Seat No.:


Page 16 of 45




2

2. Do as Directed. 18

(1) What is producer-consumer problem? Explain with example. 6

(2) What is the problem with the NFU page replacement? What should be the 6

modification to overcome this problem? Explain it.

(3) What is safe state? Explain Banker's algorithm to avoid deadlock. 6

OR

(3) Write a note on message passing system. 6

3. Write short note: (any three) 18

(1) Demand paging.

(2) Bitmaps and Linked-list approach for allocation

(3) Paterson's algorithm for critical region problem

(4) Second chance algorithm.


Consider the following page-reference string:

1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2.

How many page faults would occur for the following replacement

algorithms, assuming four frames?

Page 17 of 45




3

- LRU replacement.

- Optimal replacement.

Give the comparison between these two.

OR

4. Consider the following page-reference string:

a, b, a, c, a, b, d, b, a, c, d.

How many page faults would occur for the following replacement algorithms,

assuming three frames?

- LRU replacement.

- FIFO replacement.

Which is better? Why it is better? Explain.


(1) Explain any two methods for file access control verification. 5

OR

(1) Explain the hierarchy model of the file system. 5

(2) What is semaphore? Explain how does it solve the critical section 5

Problem?

OR

(2) Why we required structured page table? Explain Hierarchical Page Table in detail. 5

Page 18 of 45




1


October / November - 2015



Instructions



1. Answer in short: (Any Seven) 14

(1) What is a role of file system? Write the name of some OS file system.

(2) Define CPU Scheduling. What is preemptive and non-preemptive scheduling?

(3) What is Thrashing?

(4) What is Critical section? How mutual exclusion can be achieved?

(5) Explain pure demand paging.

(6) What is compaction? How it can be performed?

(7) What is Belady's anomaly?

(8) What is a solution of dynamic storage allocation problem?





Seat No.:


Page 19 of 45




2

2. Do as directed: (Any Three) 18

(1) Explain memory allocation scheme with fragmentation in detail.

(2) Define deadlock. Explain deadlock prevention mechanism in detail.

(3) Explain memory segmentation scheme.

(4) Explain disk space allocation schemes of file.


(1) Consider the reference string given below:

2, 3, 2, 1, 5, 2, 4, 5, 3, 2, 5, 2

How many page faults will occur for the following replacement? Consider the memory is

empty initially and having 3 frames. Which one is better and why?

(i) Optimal page replacement algorithm

(ii) LRU page replacement algorithm

(iii) FIFO page replacement algorithm

(2) Consider the following set of process, with the length CPU-burst time given in

milliseconds:

Process Burst time Arrival time

P1 3 0

P2 6 2

P3 4 4

P4 5 6

P5 2 8

Page 20 of 45




3

The processes are assumed to have arrived in following order:

Pl, P2, P3, P4, P5.

(a) Draw Gantt charts to illustrate the execution of the process using:

- FCFS scheduling

- SRTF scheduling

- Round Robin scheduling (Quantum = 4)

(b) Calculate turn around time and waiting time of each process in each scheduling algorithm.

4. Write short notes: (Any Three) 18

(1) Second Chance algorithm.

(2) TLB

(3) Acyclic Graph Directory

(4) Deadlock Avoidance

5. Answer the following: 10

(1) Explain producer consumer problem with a fatal race condition. 5

OR

(1) Explain the concept of Demand Paging in detail. 5

(2) Write about File protection in detail. 5

OR (2) Explain Multilevel feedback scheduling. 5

Page 21 of 45




1

Third Year B.C.A. (Sem. V) (CBCS) Examination




Instructions

(1)




(1) Define fragmentation. What is difference between internal and external

fragmentation?

(2) Define Scheduling. What is preemptive and non-preemptive scheduling?

(3) What is difference between logical and physical address space?

(4) What is Race condition? How race condition can be avoided?

(5) List out CPU scheduling criteria. Explain any two criteria.

(6) What is context switching?

(7) What is high paging activity during paging scheme?

(8) Explain starvation of process.





Seat No.:


Page 22 of 45




2

2. Do as directed: (Any Three) 18

(1) Explain the memory strategy where programs can be larger than physical

memory in details and how can it be implemented?

(2) Explain Paging scheme in detail.

(3) Define Process. Explain process state diagram and PCB in detail.

(4) Describe scheme for defining the logical structure of directory.

3. Do as directed: (Any One) 10

(1) Consider the reference string given below:

8, 1, 2, 3, 1, 4, 1, 5, 3, 4, 1, 4, 3, 2, 3, 1, 2, 8, 1, 2

How many page faults will occur for the following replacement? Consider the

memory is empty initially and having 3 frames. Give the comparison.

(i) Optimal page replacement algorithm

(ii) LRU page replacement algorithm

(iii) FIFO page replacement algorithm

(2) Consider the following set of process, with the length CPU-burst time given in

milliseconds:

Process

Burst time Priority

P1 4 1

P2 8 4

P3 6 2

P4 1 1

P5 4 3

Page 23 of 45




3


Pl,P2,P3,P4,P5 all at time 0

(a) Draw Gantt charts to illustrate the execution of the process using:

(i) FCFS scheduling

(ii) A non-preemptive priority

(iii) SJF scheduling

(iv) Round Robin scheduling (Quantum=1)

(b) Calculate turnaround time and waiting time of each process in each

scheduling algorithm.


(1) Segmentation

(2) IPC

(3) Inverted page table

(4) Deadlock prevention


(1) What is a semaphore? Also explain producer-consumer problem using 5

semaphores.

OR (1) Write about allocation scheme of disk space to a file. 5

(2) Define Deadlock. Explain Banker’s algorithm to avoid deadlock. 5

OR

(2) Explain Peterson’s algorithm for preserving mutual exclusion. 5

Page 24 of 45




1


November / December – 2016


(Old Course)


Instructions




(1) What are Access Control lists? (2) Explain pure demand paging. (3) What is Belady’s anomaly? (4) What is compaction? Why it is required? (5) Give the difference between deadlock and starvation. (6) Define fragmentation. What is the difference between internal and external

fragmentation?

(7) What do you mean by co-operating process? (8) What is Thrashing?





Seat No.:


Page 25 of 45




2


(1) Consider the following reference string: 7

1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5

How many page faults will occur for the following replacement policies?

Consider the memory is empty initially and memory is having 3 frames.

(i) FIFO page replacement algorithm.

(ii) OPT page replacement algorithm

(iii) IRU page replacement algorithm.

(2) Write a note on critical region problem. Discuss Peterson’s algorithm. 7

OR

(2) Define deadlock. Explain deadlock prevention mechanism in details. 7

How it differs from the multilevel queue scheduling?



(2) Tree level directory structure

(3) Inter process communication

(4) Segmentation.


(1) Consider the following set of process, with the length CPU-burst time given is 7 milliseconds:

Page 26 of 45




3

Process Burst

time

Priority

P1 4 1

P2 8 4

P3 6 2

P4 1 1

PS 4 3


P1, P2, P3, P4, P5 all at time zero

(a) Draw Gantt chart to illustrate execution of process using following algorithm: - FCFS scheduling - SJF non-preemptive scheduling - Priority based scheduling

(b) Calculate turnaround time and waiting time of each process in each scheduling algorithm.

(2) What is semaphore? Explain producer-consumer problem using semaphores. 7

OR

(2) Write steps in handling page faults. 7

5. Answer the following: (Any Two) 10

(1) Explain disk space allocation methods.

(2) Discuss concept of demand paging.

(3) Explain Multilevel feedback scheduling.

Page 27 of 45




1




(New Course)


Instructions

(1)




(1) Differentiate between logical address space and physical address space. (2) What are independent processes? (3) What is Compaction? Why it is required? (4) What is Dispatcher? (5) What purpose does the modified bit serve in demand paging system? (6) What is the difference between Preemptive and Non-preemptive scheduling? (7) What is Starvation? How starvation can be handling? (8) What is Swapping?





Seat No.:


Page 28 of 45




2



1, 2, 3, 4, 1, 6, 5, 2, 1, 3, 7, 4, 2, 1, 3, 5, 7, 2, 1



(i) OPT page replacement algorithm

(ii) FIFO page replacement algorithm.

(2) Define Virtual memory: Explain demand paging with its advantages and disadvantages. 7

OR

(2) Explain multilevel feedback queue scheduling algorithm for process scheduling. 7

How it differs from the multilevel queue scheduling?



(2) Peterson solution

(3) Interprocess communication

(4) Segmentation.


(1) Consider the following set of process, with the length CPU-burst time given is 7 milliseconds:

Page 29 of 45




3

Process Burst

time

Priority

P1 4 1

P2 7 4

P3 9 2

P4 2 1

P5 4 3


Pl, P2, P3, P4, P5 all at time zero

(a) Draw Gantt chart to illustrate execution of process using following algorithm: - FCFS scheduling - RR scheduling (Quantum = 1) - Priority based scheduling


(2) What is semaphore? Explain producer-consumer problem using semaphores. 7

OR

(2) Define page fault. Write steps to handle page faults. 7


(1) Explain TLB in detail.

(2) Define process. What is process state diagram? List the content of PCB.

(3) What is deadlock? What are necessary conditions for deadlock to occur?

Page 30 of 45




1




(New Course)





(1) What is difference between first fit and best fit algorithms? Which one is

better? And why?

(2) What is a context switching?


(4) What is a role of dispatcher?


(6) Define turnaround time and throughput time.

(7) What is Belady's anomaly?

(8) What is an overlays?





Seat No.:


Page 31 of 45




2



2, 3, 1, 2, 4, 6, 0, 2, 6, 3, 2, 9, 8, 3, 6, 2, 3, 2



(a) OPT page replacement algorithm

(b) LRU page replacement algorithm

(2) Explain concept of paging in detail. 7

OR

(2) Discuss Peterson's solution for achieving the Mutual exclusion.


(1) Hierarchical page table

(2) Banker's Algorithm to avoid deadlock

(3) Contiguous memory allocation

(4) TLB


(1) Consider the following set of process, with the length CPU-burst time 7

given is milliseconds:

Page 32 of 45




3

Process Burst

time

Priority

P1 6 3

P2 7 1

P3 3 3

P4 7 4

PS 9 2

The process are assumed to have arrived in following order:


(a) Draw Gantt chart to illustrate execution of process using following

algorithm:

- FCFS scheduling

- SJF scheduling

- Priority based scheduling

(b) Calculate turnaround time and waiting time of each process in

each scheduling algorithm.

(2) What is semaphore? What are the operations of it? Discuss producer 7

and consumer problem using Semaphores.

OR

(2) Explain segmentation with paging in detail.


(1) Describe inverted page table.

(2) Explain process state table with PCB in detail.

(3) Define page fault. Write steps to handling page fault.

Page 33 of 45




1





Instructions

(1)




(1) What is the difference between page and segment? (2) Define principle of Locality. (3) What is a context switching? (4) What is MMU? (5) What is page hit and page miss ratio? (6) Define term: CPU utilization and response time. (7) Give the difference between deadlock and starvation. (8) What purpose dose the modified bit server in demand paging system?





Seat No.:


2 ;

Page 34 of 45




2


(1) Consider the following set of process, with the length CPU-burst time given in 7

milliseconds:


P1 4 2

P2 7 1

P3 9 4

P4 2 1

P5 4 3



(a) Draw Gantt chart to illustrate execution of process using following algorithm - SJF scheduling - RR scheduling (Quantum = 1) - Priority based scheduling



(2) Explain segmentation with paging scheme in detail. 7

OR

(2) Explain memory allocation scheme with fragmentation in detail. 7


(1) Resource Allocation Graph.

(2) Hash Page Table.

(3) TLB.

(4) Process state table and PCB.

Page 35 of 45




3



7, 1, 2, 3, 1, 4, 1, 5, 3, 4, 1, 4, 3, 2, 3, 1, 2, 7, 1, 2



(i) FIFO page replacement algorithm


(iii) LRU page replacement algorithm.

Also explain which algorithm is better and why?

(2) Discuss producer and consumer problem using Semaphores. Also write 7

necessary code for implementing the solution.

OR

(2) What is safe state? Explain Banker's Algorithm to avoid deadlock.


(1) Explain Multilevel feedback scheduling.

(2) Discuss Peterson's solution: for achieving the Mutual exclusion.

(3) Write steps to handle page faults.

Page 36 of 45




1





Instructions

(1)



1. Answer in short: (Any Seven) 14 (1) What is compaction? Why is it required?

(2) What. is race condition? How to avoid race condition?

(3) Explain Belady's anomaly.

(4) Define preemptive scheduling and non-preemptive scheduling.

(5) What is the difference between first-fit, worst-fit and best-fit? Which is

better? Why?

(6) What is internal fragmentation? How does it differ from external

fragmentation?

(7) Define turnaround time and throughput time.






Seat No.:


Page 37 of 45




2



1, 3, 4, 4, 3, 2, 1, 7, 5, 6, 4, 2, 1, 2, 4, 3, 2, 1





(iii) LRU page replacement algorithm Also explain which algorithm is better

and why?

(2) Describe how paging can be implemented by using cache memory. 7

OR

(2) Explain memory management technique of segmentation.


(1) Inter Process Communication

(2) Second Chance Algorithm

(3) Deadlock Prevention

(4) Static Partitioning Scheme.


(1) Consider the following set of process, with the length CPU-burst time 7

given in milliseconds:

Page 38 of 45




3


P1 5 4

P2 8 1

P3 7 2

P4 3 1

P5 4 3



(a) Draw Gantt chart to illustrate execution of process using following

algorithm:

(i) FCFS scheduling

(ii) RR scheduling (Quantum = 2)

(iii) Priority based scheduling



(2) What is semaphore? Explain producer-consumer problem using 7

semaphore.

OR

(2) Explain Critical Section Problem. Discuss Peterson's solution for achieving 7

the Mutual exclusion.


(1) What is a scheduler? Explain different types of Schedulers.

(2) Explain Banker's Algorithm to avoid deadlock.

(3) Write steps to handle page faults.

Page 39 of 45




1


November / December – 2018



Instructions

(1)




(1) What is pure demand paging? (2) Differentiate co-operating process and independent process. (3) What is compaction? Why it is required? (4) What is critical section? How mutual exclusion can be achieved? (5) What is swapping? (6) What is the difference between deadlock prevention and deadlock avoidance? (7) What is a shared page & shared segment? (8) Define the role and types of scheduler.



Name of the Subject : Operating System: Paper-504


Seat No.:


Page 40 of 45




2

2. Do as directed: 14 (1) Consider the following set of process, with the length CPU-burst time given 7

in milliseconds:


P1, P2, P3, P4, P5 all at time zero.

(a) Draw Gantt chart to illustrate execution of process using following algorithm: - Priority scheduling - RR scheduling (Quantum = 1) - FCFS scheduling

(b) Calculate turnaround time and waiting time of each process in each scheduling

algorithm.

(2) What is page fault? What are the steps OS performs to handle the page fault 7

situation? What is use of modified bit?

OR

(2) Define noncontiguous memory allocation. Explain paging scheme with TLB hardware. 7

3. Write short notes: (Any Three) 18 (1) Hash page table structure (2) Peterson's Algorithm (3) IPC (4) Second chance algorithm

Process Burst Time Priority

P1 6 1

P2 4 3

P3 5 2

P4 7 1

Page 41 of 45




3

4. Do as directed: 14 (1) Consider the following reference string: 7

7, 8, 6, 2, 3, 7, 4, 2, 1, 6, 8, 3, 4, 7, 2, 5, 0



(i) FIFO page replacement algorithm (ii) OPT page replacement algorithm (iii) LRU page replacement algorithm


(2) What is semaphore? Explain how it solves the critical section problem. 7

OR (2) What is deadlock? How deadlock can be avoided? 7

5. Answer the following: (Any Two) 10 (1) Explain producer-consumer problem of synchronization with example.

(2) Describe working of static memory allocation mechanism.

(3) Define process. Explain process state diagram with task control block in detail.

Page 42 of 45




1



Operating System-II: SET : III


Instructions

(1)



Q.1 Answer in short: (any seven) 14

(1) How can we recover a deadlock? (2) Define a term High paging activity in memory. (3) What is a meaning of context switch in process state? (4) What is a role of memory management unit? (5) Write about CPU scheduling criteria. (6) What is a belady's anomaly? (7) Describe characteristic deadlocks. (8) Which partition allocation strategy is considered as best during memory

allocation?



Name of the Subject : Operating System: SET:III


Seat No.:


Page 43 of 45




2

Q.2 Do as directed: 14

(1) Consider the following set of process, with the length CPU-burst time given in 7

Milliseconds:


PI, P2, P3, P4, P5 all at time zero

(a) Draw Gantt chart to illustrate execution of process using following algorithm:

- SJF scheduling - RR scheduling (Quantum = 4) - Priority based scheduling


(2) Define noncontiguous memory allocation. Explain paging scheme in details. 7

OR

(2) What is segmentation? Explain segmentation with paging scheme in details 7

Q.3 Write short notes: (Any Three) 18

(1) RA Graph

(2) Inverted Page Table

(3) Peterson solution

(4) TLB


P1 5 2

P2 8 1

P3 10 3

P4 3 5

P5 5 4

Page 44 of 45




3

Q.4 Do as directed: 14


8, 2, 3, 4, 2, 5, 2, 6, 4, 5, 2, 5, 4, 3, 3, 4, 2, 3, 8, 2, 3

How many page faults will occur for the following replacement policies? Consider

the memory is empty initially and memory is having 4 frames.



(iii) LRU page replacement algorithm


(2) Define semaphores. Explain producer and consumer problem using it in details.7

OR

(2) Discuss deadlock avoidance. Write about Banker’s Algorithm in details. 7

Q.5 Answer the following: (Any Two) 10

(1) Explain Second chance algorithm.

(2) Define process. Explain Process state Diagram with PCB in details.

(3) Define page fault. Write six steps to handle it.

Page 45 of 45

subject paper operating system- ii hird ear...subject : paper-504 : operating system- ii third year...

Documents