jasminebanger Goto Github PK

100-javascript-projects

addons-server

🕶 addons.mozilla.org Django app and API 🎉

angular-js-quiz-application

angular.js quiz application. PS: This is my university assignment

animate_car

contributors-portraits

a Simple HTML/CSS project for Hacktoberfest pull requests. Introduce yourself in a card !

demo

This is a Demo repository

fdcfrontend

Speaker at Developer Circle from Facebook at Chandigarh University

first-contributions

🚀✨ Help beginners to contribute to open source projects

guide

A collection of easy-to-understand guides to programming tools

hacktoberfest

Participate in Hacktoberfest by contributing to any Open Source project on GitHub! Here is a starter project for first time contributors. #hacktoberfest

hacktoberfest-2018

Make your first Pull Request and earn a free tee from GitHub!

hacktoberfest2018

A repository for HacktoberFest 2018.

hacktobest_lpu

hello-hacktober

This repository is for people who are starting to program, and want to participate in hacktoberfest or just want to contribute

hello-world

Hello World in all possible programmnig languages

hello-world-1

just started to know the github

home-assistant.io

:blue_book: Home Assistant User documentation

ideahub

js_calculator

jsonmc

JSON Movie Collection

litebooky

make-a-pull-request

Make a Pull Request

moving-car

Moving car using CSS

myportfolio

openclassroom

new repo

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.

photo_gallary

portfolio

its my portfolio

priority-scheduling

hello

quick_puja

All about quick puja