botarsh's Stars
scientifichackers/flutter_cognito_plugin
An AWS cognito plugin for flutter
kamranahmedse/git-standup
Recall what you did on the last working day. Psst! or be nosy and find what someone else in your team did ;-)
CammyKamal/Android-Data-Binding-Examples
A collection of samples using Android Data Binding
BaseMax/TelegramJavascriptContest
A mirror for Telegram Javascript Contest Stage 1.
NorinMp143/LiteBooky
Chalarangelo/30-seconds-of-code
Short code snippets for all your development needs
BaseMax/AndroidGoogleMaps
A sample android application with google maps for SDK 9.
jessabean/100-javascript-projects
vercel/swr
React Hooks for Data Fetching
lipis/flag-icons
:flags: A curated collection of all country flags in SVG — plus the CSS for easier integration
botarsh/The_Quanta
Women security application... A Hackathon Idea
dart-lang/sdk
The Dart SDK, including the VM, JS and Wasm compilers, analysis, core libraries, and more.
iampawan/FUI01-NikeWebFlutter
vuejs-in/companies-using-vuejs-in-India
The list of companies who use Vue.js in India
jasminebanger/Photo_Gallary
Neha/vue-for-noobs
A repo for the VueJS learning Journal and code examples
ProtoSchool/bangalore
[ARCHIVED] ProtoSchool Bangalore
ipfs/team-mgmt
IPFS Team Planning, Management & Coordination threads
botarsh/TravisCI79
HaxonicOfficial/CTF-Practice
CTF problems for the practice of Beginners in Cyber Forensics.
botarsh/fdcfrontend
Speaker at Developer Circle from Facebook at Chandigarh University
jasminebanger/OS_pro
Design a scheduler that uses a preemptive priority scheduling algorithm based on dynamically changing priority. Larger number for priority indicates higher priority. Assume that the following processes with arrival time and service time wants to execute (for reference): ProcessID Arrival Time Service Time P1 0 4 P2 1 1 P3 2 2 P4 3 1 When the process starts execution (i.e. CPU assigned), priority for that process changes at the rate of m=1. When the process waits for CPU in the ready queue (but not yet started execution), its priority changes at a rate n=2. All the processes are initially assigned priority value of 0 when they enter ready queue for the first time . The time slice for each process is q = 1. When two processes want to join ready queue simultaneously, the process which has not executed recently is given priority. Calculate the average waiting time for each process. The program must be generic i.e. number of processes, their burst time and arrival time must be entered by user.
Sanix-Darker/AntiDDOS-system
🛡️⚔️ Protect your web app from DDOS attack or the Dead Ping + CAPTCHA VERIFICATION in one line!
adilmoujahid/blockchain-python-tutorial
Source Code for my blog post: A Practical Introduction to Blockchain with Python
iampawan/FlutterQuizApp
kindavishal/Music-Store
Stream all the Music around the World for free