- KTU - CS331
-
Simulate the following non-preemptive CPU scheduling algorithms to find turnaround time and waiting time.
- FCFS
- SJF
- Round Robin (pre-emptive)
- Priority
-
Simulate the following file allocation strategies.
- Sequential
- Indexed
- Linked
-
Implement the different paging techniques of memory management.
-
Simulate the following file organization techniques.
- Single Level Directory
- Two Level Directory
- Hierarchical
-
Implement the banker’s algorithm for deadlock avoidance.
-
Simulate the following disk scheduling algorithms.
- FCFS
- SCAN
- C-SCAN
-
Simulate the following page replacement algorithms.
- FIFO
- LRU
- LFU
-
Implement the producer-consumer problem using semaphores.
-
Write a program to simulate the working of the dining philosopher's problem.
-
Implement the symbol table functions: create, insert, modify, search, and display.
-
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 a single pass macro processor.
-
Implement an absolute loader.
-
Implement a relocating loader.
-
Implement pass one of a direct-linking loader.
-
Implement pass two of a direct-linking loader.
-
Implement a simple text editor with features like insertion / deletion of a character, word, and sentence.
-
Implement a symbol table with suitable hashing.