C++ program that implements the FIFO, Optimal, MFU, and LRU page-replacement algorithms. Given a page-reference string, where page numbers range from 0 to 9, apply the page-reference string to each algorithm, and output the number of page faults incurred by each algorithm.
Replacement Policy implemented in linux. Assigned 5/12/2020, Due 12/12/2020
This repository is intended to work as an archive to collect the best (i.e. most efficient) solutions to leetcode problems, both in space and time.
Development version of ph2rand, an R package for the design of randomized comparative phase II oncology trials
Point estimates, confidence intervals and p-values for adaptive two-stage designs with planned adaptivity.
Java graph traversal and path finding algorithms library. Implements Iterative deepening A* (IDA*)
The repository contains code for distribution system analysis. Currently the code developed is for radial systems but many sensitivities are provided which can be used for decision support.
A Python-based CLI tool for managing expenses with the Splitwise model, simplifying group expenses in the terminal.
Find and Compute optimal submatrix of invalid correlation matrix
Repository for implementation details for Data-Science
Trabalho de SO sobre algoritmos de Substituição de página
Methods to calculate optimal design parameters for one- and two-stage three-arm group-sequential gold-standard non-inferiority trial designs with or without binding or nonbinding futility boundaries.
Produces optimal k-means solutions for small instances and small k.
🌐 Analyze, optimize and convert architectural structured abstraction and topology. Improve models, networks, diagrams, maps and more.
Implement page replacement policies like LRU, NFU, FIFO , Aging, Random etc . And also compare their results.
Add a description, image, and links to the optimal topic page so that developers can more easily learn about it.
To associate your repository with the optimal topic, visit your repo's landing page and select "manage topics."