shrey-12 Goto Github PK

3dtrialport

Welcome to my 3D Portfolio repository! This project showcases my skills in 3D design and interactive web development using Three.js and Blender. With a passion for creating immersive and visually stunning experiences, I've combined the power of 3D modeling with web technologies to bring my portfolio to life.

algorithms

artificialintelligence

search algorithms

awesomethiefshreya

ayu

Welcome to Ayurveda Hub, your ultimate destination for exploring the ancient wisdom of Ayurveda and embracing a holistic approach to health and wellness.

budget-application

checkers-2

checkers-project

Checkers Project using pygame

cloudcomputing

codeforces

compilers

css-challenges

daily CSS challenges, until I can center a div

dbms

dbms-project

disney-clone

graph-theory-

html-iitm

Week wise assignments with my own touch

java-projects

javascriptdom

Javascript DOM elements, frontend

machinelearning

mad-ddpm

unofficial implementation of Morphing Attack Detection using Denoising Diffusion Probabilistic Models with modifications

ml-roadmap

Machine Learning Resources, Practice and Research

networkinglab

nodejs

trying to learn node and express.js

operatingsystems

Semester 3 unix library and linux codes

pear-2

A peer to peer video calling website, with some cute functionalities

qtile-config

queues

You need to implement multQueue according to the following instructions. Im- plement a circular queue called waitQueue using an integer array of length 10. Initially that queue is empty. Next implement a linked list called serviceList with initially one node where the node contains a circular queue implemented using array of size 5 where we can insert integer elements. Now you need to implement operations to support following operations: (a) multEnqueue(int x): If the waitQueue is empty, It should enqueue x to the queue in the serviceList. If the queue in the serviceList is full, then it should insert the element into the waitQueue. If waitQueue is also full, then it should create a new node in the serviceList with a circular queue of length 5. Then it should dequeue five elements from waitQueue and enqueue those elements into the circular queue of newly created node in the serviceList. After that it should enqueue x to the waitQueue. (b) multDequeue(): In this operation, you should dequeue an element from the first node of the list serviceList and return it. Then, dequeue one element from waitQueue and enqueue that to the queue from where that element is dequeued in the serviceList. If the waitQueue is empty and due to this dequeue operation the queue at the first node of the serviceList is also empty, then delete that node if it is not the only node in serviceList. Note that, when first node gets deleted, next node of the first node becomes the first node. (c) statusQueue(): This should print the number of nodes in the serviceList, elements in the queues of each node and elements in the waitQueue. It should also show that if a new element comes, then where it will be placed in the current multQueue. If you cannot place it without creating a new node, you should return that multQueue is full. You can implement and use other supporting functions also.

react-dev

Learning react

shrey-12

Config files for my GitHub profile.