OSY Micro-Project – 4 Selected
Make a comparative statement to calculate page fault for given page reference string by using different page fault algorithms.
OSY Micro-Project – 9 Selected
Write a report by giving examples of each on Page Replacement Algorithms : FIFO, LRU, Optimal
OSY Micro-Project – 15 Selected
Make a comparative chart of various deadlock avoidance and prevention algorithms.
OSY Micro-Project – 1 Selected
Write and execute shell script using FOR, EXIT, BREAK AND CONTINUE statement.
OSY Micro-Project – 7 Selected
Study and comparative statement (chart) of different types of scheduling algorithms :- First come first served (FCFS), Shortest Job First (SJF), Shortest Remaining Time (SRTN), Round Robin (RR), etc. by considering one example common to all algorithms.
OSY Micro-Project – 10 Selected
Install Linux operating system and prepare the report of installation of Linux as a reference guide.
OSY Micro-Project – 2 Selected
Write and execute shell script using IF statement.
OSY Micro-Project – 8 Selected
Write a C program to calculate total waiting and Turnaround time of n processes with different CPU scheduling algorithms by considering one example common to all algorithms.
OSY Micro-Project – 14 Selected
Make a comparative chart of various mechanisms of the given file access method.
OSY Micro-Project – 17 Selected
Write down the report on File management
OSY Micro-Project – 3 Selected
Create a report depicting features of different types of operating system : - Batch operating system, Multi programmed, Time shared, Multiprocessor, Real time and mobile operating system.
OSY Micro-Project – 5 Selected
Prepare help guide using shell script for all the major Linux commands.
OSY Micro-Project – 11 Selected
Prepare help guide using shell script for all the major Linux commands.
OSY Micro-Project – 13 Selected
Implement first fit, best fit algorithm for memory management and write comparative statements.
OSY Micro-Project – 16 Selected
Write down the report on Bankers Algorithm.
OSY Micro-Project – 12 Selected
Given with the P number of processes in the memory and N number of needed resources by them to complete their execution and the task is to find the minimum number of resources R which should be allotted to the processes such that deadlock will never occur.
OSY Micro-Project – 6 Selected
Make a comparative statement (chart) to calculate total waiting and Turnaround time of n processes with different CPU scheduling algorithm by considering one example common to all algorithms.