About Our Project

A collaborative effort to visualize operating system concepts

Project Overview

This project is a comprehensive visualization tool for understanding operating system concepts, particularly focusing on memory allocation algorithms and process scheduling. Our team has worked together to create interactive demonstrations that help students better understand these complex topics.

Our Team

U

Utsav

231CS161
System Calls
Enhanced Second Chance
Inter Process Communication
V

Vamshi

231CS162
FCFS
Round Robin (RR)
V

Vanshika

231CS163
Reader-Writer
Producer-Consumer
Dining Philosopher
V

Vatsal

231CS164
Deadlock Detection
Deadlock Avoidance
Additional Page Replacement Algorithms
V

Vrishank

231CS165
MVT
MFT
LRU Approximation Algorithm
A

Anurag

231CS166
First Fit
Best Fit
Worst Fit
Next Fit
Weighted Best Fit
Size-Ordered First Fit
U

Unmesh

231CS261
LRU
LFU
FIFO
Optimal
V

Vaibhavi

231CS262
SCAN
SSTF
FCFS
V

Vishal

231CS263
Indexed
Linked
Sequential
P

Puja

231CS264
Single Level Directory Organization
Multiple Level Directory Organization
Resource Allocation Graph(Deadlock)
Y

Yashwanth

231CS265
Shortest Job First (SJF)
Shortest Remaining Job First (SRJF)
Priority
Firing Squad(Process Synchronization)