deggaronn Goto Github PK

afcat_books

all-semaphore-problems

buildtoplay

capgemini

certificate-worker

contact-management

gree-car-wash

insta-scrapper

java-questions

js-music-player

This is a simple User Interface of a music player created in HTML, CSS and JavaScript.

library-managment-system

multilevel-feedback-queue

Write a program for multilevel queue scheduling algorithm. There must be three queues generated. There must be specific range of priority associated with every queue. Now prompt the user to enter number of processes along with their priority and burst time. Each process must occupy the respective queue with specific priority range according to its priority. Apply Round robin algorithm with quantum time 4 on queue with highest priority range. Apply priority scheduling algorithm on the queue with medium range of priority and First come first serve algorithm on the queue with lowest range of priority. Each and every queue should get a quantum time of 10 seconds. Cpu will keep on shifting between queues after every 10 seconds i.e. to apply round robin algorithm OF 10 seconds on over all structure. Calculate Waiting time and turnaround time for every process. The input for number of processes should be given by the user.

node-application-and-functions-

node-arrow-function

a javascript arrow function that takes an array of words and transforms it into an array of each word's length and returns it. Display the resulting array on console.

online-fee-payment-system

phishing-detection-using-php-and-machine-learning

phishing-detector

Phishing checker and detector

phonebook-manager

placement_system

portfolio-using-react-js

preeti_webpage

priority-preamptive-scheduling

producer-consumer-problem

product-description-page-

product descriptionpage with add to cart mechanisim and checkout page in HTMl CSS and JS

puppeteer

Headless Chrome Node.js API

react-js-todo-

round-robin-scheduling

Considering the arrival time and burst time requirement of the process the scheduler schedules the processes by interrupting the processor after every 6 units of time and does consider the completion of the process in this iteration. The scheduler than checks for the number of process waiting for the processor and allots the processor to the process but interrupting the processor every 10 unit of time and considers the completion of the processes in this iteration. The scheduler checks the number of processes waiting in the queue for the processor after the second iteration and gives the processor to the process which needs more time to complete than the other processes to go in the terminated state. The inputs for the number of requirements, arrival time and burst time should be provided by the user.

scrapper

scribe

Scribe: a personal blogging website

social