-
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
-
Simulate the following file organization techniques. a) Single level directory b) Two level directory c) Hierarchical
-
Implement the banker’s algorithm for deadlock avoidance.
-
Simulate the following disk scheduling algorithms.
a) FCFS b)SCAN c) C-SCAN -
Implement the producer-consumer problem using semaphores.
-
Write a program to simulate the working of the dining philosopher’s problem.
-
Implement a symbol table with suitable hashing.
-
Implement pass one of a two pass assembler.
-
Implement pass two of a two pass assembler.
-
Implement a single pass assembler.
-
Implement a two pass macro processor
-
Implement an absolute loader.
-
Implement a relocating loader.