hitesh08

Pinned Repositories

Amazon-IAM
Language:Haskell01
beam
A type-safe, non-TH Haskell SQL library and ORM
Language:Haskell00
beam-mysql
Beam MySQL compatibility layer
Language:HTML00
cpp
Thinking to git push my code from usual DSA problem solving at multiple platforms like leetcode, codechef and such.
Language:C++00
hacktoberfest
Make your first Pull Request on Hacktoberfest 2022. Don't forget to spread love and if you like give us a ⭐️
Language:JavaScript00
hedis
A Redis client library for Haskell.
Language:Haskell00
imad-app
Base repository for IMAD course application.
Language:JavaScript00
OS
Consider a scheduling approach which is non pre-emptive similar to shortest job next in nature. The priority of each job is dependent on its estimated run time, and also the amount of time it has spent waiting. Jobs gain higher priority the longer they wait, which prevents indefinite postponement. The jobs that have spent a long time waiting compete against those estimated to have short run times. The priority can be computed as : Priority = 1+ Waiting time / Estimated run time Write a program to implement such an algorithm.
Language:C00
Rajasthan-Tourism
Language:CSS00
rust-grep-cli
Small Rust CLI tool to mimic grep like utilities
Language:Makefile00

hitesh08's Repositories

hitesh08/Amazon-IAM
1
hitesh08/rust-grep-cli
Small Rust CLI tool to mimic grep like utilities
Language:Makefile
hitesh08/cpp
Thinking to git push my code from usual DSA problem solving at multiple platforms like leetcode, codechef and such.
Language:C++
hitesh08/beam
A type-safe, non-TH Haskell SQL library and ORM
hitesh08/hedis
A Redis client library for Haskell.
hitesh08/beam-mysql
Beam MySQL compatibility layer
hitesh08/hacktoberfest
Make your first Pull Request on Hacktoberfest 2022. Don't forget to spread love and if you like give us a ⭐️
Language:JavaScript
hitesh08/OS
Consider a scheduling approach which is non pre-emptive similar to shortest job next in nature. The priority of each job is dependent on its estimated run time, and also the amount of time it has spent waiting. Jobs gain higher priority the longer they wait, which prevents indefinite postponement. The jobs that have spent a long time waiting compete against those estimated to have short run times. The priority can be computed as : Priority = 1+ Waiting time / Estimated run time Write a program to implement such an algorithm.
Language:C
hitesh08/Rajasthan-Tourism
Language:CSS
hitesh08/imad-app
Base repository for IMAD course application.
Language:JavaScript