BC0024 – 01

Marks –60
OPERATING SYSTEMS

No. Of Credits: 4 Book ID: B0067

Answer All Questions and Each Question Carries Equal marks

1. Define:
 Batch systems
 Multiprogramming
 Time sharing systems
 Parallel processing
 Distributed systems
 Real time systems
2. Define Process. With a Block diagram explain various states a process resides in.

3. Write Notes on:

 Context switching mechanism
 Inter Process Communication (IPC)
 Co-operating Process
4. What do you mean by Deadlock? Explain the conditions that results in a deadlock
situation.
5. Use First-Come First Serve Algorithm and Shortest Job First Algorithm to
schedule the following process:
Process Burst Time
P1 7
P2 5
P3 8
P4 2
P5 3

6. Write short notes on:

 Thrashing
 Page Replacement Algorithms
 Best Fit, Worst Fit and First Fit techniques
 BC0024 – 02
Marks –60
OPERATING SYSTEMS

No. Of Credits: 4 Book ID: B0067

Answer All Questions and Each Question Carries Equal marks

1. Use Priority Scheduling Algorithm schedule the following process:

Process Burst Time Priority/Time
P1 7 3
P2 5 1
P3 8 3
P4 2 4
P5 3 2

2. Write Resource-Request Algorithm and substantiate it with a process allocation

example.

3. What are the two types of fragmentations? Illustrate them with block diagrams.
4. How do we overcome Fragmentation problems? Write a note o Paging and
Segmentation methods.
5. Use FIFO Page-Replacement and LRU algorithms to allocate memory pages for
following reference string:
6, 1, 2, 0, 3, 0, 4, 2, 3, 0, 2, 3, 1, 0, 6, 0, 1
(Note: Use three frames)