BIL 200 Lecture Project

Collection of memory allocators.

Console app to simulate next fit algorithm used on UNIX memory allocation. Written in C++.

Implemented system calls for no of total processes, process info like id, size, count of context switches, SJF scheduling algorithm and tested it for CPU and I/O bound tasks. Resolving page fault via lazy memory allocation. Incorporated features like creating a kernel process for paging, swap in, swap out mechanisms, and writing sanity tests.

Projects 1-6 from CMSC216 Fall 2022

Get Next Line is a project at 42 network (1337 school). It is a function that reads a file and allows you to read a line ending with a newline character from a file descriptor. When you call the function again on the same file, it grabs the next line

Reimplementing malloc(), calloc(), realloc(), free() in c from scratch using system calls

Libft 42 Project, a C library designed to achieve different tasks with several functions of C.

Operating Systems Lab Programs

A console based simulation for memory allocation techniques(First Fit,Best Fit,Worst Fit). Also some additional features like memory compaction,memory release and availability of empty spaces in ram.

A Java program that simulates various memory allocation strategies, including First Fit, Best Fit, and Worst Fit.