List of Experiments
- Experiment 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 (CO4)
- Experiment 2 - Implement the Disk Scheduling algorithms (CO4)
- Experiment 3 - Implement Banker’s Algorithm (CO4)
- Experiment 4 - Implement pass one of a two pass assembler (CO5)
- Experiment 5 - Implement pass two of a two pass assembler (CO5)
- Experiment 6 - Program to add two 16-bit numbers using trainer kit (CO1)
- Experiment 7 - Program to sort n numbers using trainer kit. (CO1)
- Experiment 8 - Study of Assembler and Debugging commands. (CO2)
- Experiment 9 - Program to add two 16-bit numbers using MASM. (CO2)
- Experiment 10 - Program to multiply two 16-bit numbers using MASM. (CO2)
- Experiment 11 - Interfacing with stepper motor - Rotate through any given sequence. (CO3)
- Experiment 12 - Interfacing with 8255 (Mode 0) (CO3)