August 2010

Bachelor of Science in Information Technology (BScIT) – Semester 2/

Diploma in Information Technology (DIT) – Semester 2
BT0036 – Operating Systems – 2 Credits
(Book ID: B0067)
Assignment Set – 1 (30 Marks)

Answer all questions 5 x 6 = 30

1. Use Priority Scheduling Algorithm to schedule the following processes:

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. 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 processes:
Process Burst Time
P1 7
P2 5
P3 8
P4 2
P5 3
 August 2010
Bachelor of Science in Information Technology (BScIT) – Semester 2/
Diploma in Information Technology (DIT) – Semester 2
BT0036 – Operating Systems – 2 Credits
(Book ID: B0067)
Assignment Set – 2 (30 Marks)

Answer all questions 5 x 6 = 30

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. How do we overcome Fragmentation problems? Write a note on 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)