List of Experiments

1. Simulate the following non-preemptive CPU scheduling algorithms to find turnaround time and waiting time. a) FCFS b) SJF c) Round Robin (pre-emptive) d) Priority

2. Simulate the following file organization techniques. a) Single level directory b) Two level directory c) Hierarchical

3. Implement the banker’s algorithm for deadlock avoidance.

4. Simulate the following disk scheduling algorithms.
   a) FCFS b)SCAN c) C-SCAN

5. Implement the producer-consumer problem using semaphores.

6. Write a program to simulate the working of the dining philosopher’s problem.

7. Implement a symbol table with suitable hashing.

8. Implement pass one of a two pass assembler.

9. Implement pass two of a two pass assembler.

10. Implement a single pass assembler.

11. Implement a two pass macro processor

12. Implement an absolute loader.

13. Implement a relocating loader.