CS1035 OPERATING SYSTEMS LAB L T P C Total Contact hours - 30 0 0 2 1

Prerequisite CS1002, CS1032

PURPOSE :This laboratory course gives a complete understanding of the operating systems principles
and its Implementations

INSTRUCTIONAL OBJECTIVES

1. To implement Scheduling algorithms

2. To implement deadlock algorithms and page replacement algorithms

3. To simulate memory management schemes, Threads and synchronization..

LIST OF EXPERIMENTS

1. Simulate the following CPU scheduling algorithms a. Round Robin b) SJF c) FCFS d) Priority

2. Simulate all file allocation strategies a. Sequential b) Indexed c) Linked

3. Simulate MVT and MFT

4. Simulate all File Organization Techniques a. Single level directory b) Two level c) Hierarchical d) DAG
5. Simulate Bankers Algorithm for Dead Lock Avoidance

6. Simulate an Algorithm for Dead Lock Detection

7. Simulate all page replacement algorithms a. FIFO b) LRU c) LFU

8. Simulate Shared memory and IPC

9. Simulate Paging Technique of memory management.

10. Implement Threading & Synchronization Applications

TEXT BOOKS

1. Wale Soyinka, ”Linux Administration A Beginners Guide”, 5th edition, Tata McGraw-Hill, 2009. Ch1-
9,13,16-24,26-28).

2. Mc Kinnon, Mc Kinnon, “Installing and Administrating Linux“, 2nd edition, Wiley, 2004. (Ch12,13)