List of Experiments

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.

Name		Name	Last commit message	Last commit date
Latest commit History 7 Commits
CSCAN.c		CSCAN.c
FCFS.c		FCFS.c
PRIORITY.c		PRIORITY.c
README.md		README.md
ROUND ROBIN.c		ROUND ROBIN.c
SCAN.c		SCAN.c
SJF.c		SJF.c
Symtable.c		Symtable.c
banker.c		banker.c
dphilosopher.c		dphilosopher.c
hash.c		hash.c
input.txt		input.txt
list2.txt		list2.txt
optab.txt		optab.txt
parent.c		parent.c
pass1.c		pass1.c
proconsumer.c		proconsumer.c
symtab.txt		symtab.txt
tld.c		tld.c

alinbabu2010/SS_Lab-Programs