patricksquare

I will type first the problem "Let the user Enter a Sentence. then determine the longest word(s) in that sentence " ex.#1 Input (Who is john galt ? ) output (john galt ) ex.#2 Input (Lets get jiggy with it) Output (jiggy) I already made a process for getting the …

[code=c] x=0; t=0; int t2=0,t3; while(t<=ref) {t3=t2; for(x=0;x<jbn;x++) { if(t==cpy2[x].at) { if(q>=cpy2[x].bt) { t2+=cpy2[x].bt; tt[x++]=t2; cpy2[x].bt=0; qq++; } else if(q<cpy2[x].bt) { t2+=q; cpy2[x].bt-=q; cpy2[x].at=t2; qq++; } } else break; } t++; if(t3==t2) {t2++;} }; [/code] assuming the values are cpy2[0].at==1 cpy2[0].bt==2 cpy2[1].at==2 cpy2[1].bt==3 cpy2[2].at==4 cpy2[2].bt==4 q==2 qq is just an …

//challenge,, fix this! [code=cplusplus] #include<stdio.h> #include<conio.h> void main() { struct job{ int at; int bt; }; struct job J[80], cpy[80], temp, cpy2[80]; int q, oh, jbn, x, y, z, t, ref=0, tt[80]; again: clrscr(); textcolor(YELLOW); gotoxy(20,5); cprintf("*** ROUND ROBIN WITH OVERHEAD ALGORITHM ***"); textcolor(10); gotoxy(5,7); cprintf("How many jobs do you …

//can someone debug this program,,, thanks,,, [code=cplusplus] #include<stdio.h> #include<conio.h> #include<dos.h> #include<graphics.h> #include<stdlib.h> #define N 100 struct processors //PROCESS ATTRIBUTES// { float burst; float arrival; int priority; int num; }p[20],temp; struct ssss { int no; int xx; float arr; float burst; float ww; int pri; float wait; }process[N]; void main() { …