No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
|
cout<<"how many slots are there?: "<<endl; cin>>s ; cout<<"Please enter\t" <<n<<" " "size of each slot"<<endl; j=k; for(int counter1=0; counter1<krfd; counter1++) { cin>>job_size[k]; } 
|
|
|
cout<<"how many slots are there?: "<<endl; cin>>s ; cout<<"Please enter\t" <<n<<" " "size of each slot"<<endl; s=k; for(int counter1=0; counter1<krfd; counter1++) { cin>>slot_size[k];//this suppose to print out #size of each slot where there is s # of slots and how would I name each slot according to the number of …
|
|
|
Hi ppl I would really appreciate if someone help me out here. I really tried to do this problem and its driving me crazy. All I could get is the algorithum of worst fit, best-fit next fit and first fit. Please help me as soon as I can. And I … 
|
|
|
Hi ppl I would really appreciate if someone help me out here. I really tried to do this problem and its driving me crazy. All I could get is the algorithum of worst fit, best-fit next fit and first fit. PLease I willing to give away g-mail invite if you …
|
|
|
Hi ppl I would really appreciate if someone help me out here. I really tried to do this problem and its driving me crazy. All I could get is the algorithum of worst fit, best-fit next fit and first fit. Please help me as soon as I can. And I …
|