服務(wù)計(jì)算概論作業(yè)報(bào)告

.慕測(cè)平臺(tái)測(cè)試報(bào)告(二)姓名：趙紅娜專業(yè)：軟件工程學(xué)號(hào)：313060800310-222016年10月22.日針對(duì)以下4個(gè)項(xiàng)目編寫(xiě)測(cè)試用例進(jìn)行測(cè)試。代碼如下：題目(1)//BinaryHeapclass////CONSTRUCTION:withoptionalcapacity(thatdefaultsto100)////******************PUBLICOPERATIONS*********************voidinsertx)-->InsertxeMinReturnandallitems//******************ERRORS********************************//ThrowsOverflowifcapacityexceeded/***Implementsabinaryheap.*Notethatall"matching"isbasedonremovesmallestitemthecompareTomethod.//intfindMin()-->Returnsmallest*@authorMarkAllenWeiss//booleanisEmpty()-->ReturnpublicclassBinaryHeaptrueifempty;elsefalse{//booleanisFull()-->Return//@invariantwellFormed();trueiffull;elsefalse/**voidmakeEmpty-->Remove*Constructthebinaryheap.publicBinaryHeap(){this(DEFAULT_CAPACITY);}/***Constructthebinaryheap.*@paramcapacitythecapacityofthebinaryheap.//@requirescapacity>0;//@ensuresisEmpty();publicBinaryHeap(intcapacity){currentSize=0;array=newint[capacity+1];}/***Insertintothepriorityqueue,maintainingheaporder.*Duplicatesareallowed..*@paramxtheitemtoinsert.*@exceptionOverflowifcontainerisfull.publicvoidinsert(intx)throwsOverflow{if(isFull())thrownewOverflow();//Percolateupinthole=++currentSize;for(;hole>1&&x<array[hole/2];hole/=2)array[hole]=array[hole/array[hole]=x;}/***Findthesmallestiteminthepriorityqueue.*@returnthesmallestitem,ornull,ifempty.publicintfindMin(){if(isEmpty())return-1;returnarray[1];}booleanwellFormed(){if(array==null){//array!=nullreturnfalse;}if(currentSize<0||currentSize>=array.length){//currentSize>=0;currentSize<array.length;returnfalse;}for(inti=1;i<currentSize;i++){if(i*2<=currentSize&&array[i]>array[2*i]){.returnfalse;}if(i*2+1<=currentSize&&array[i]>array[2*i+1]){returnfalse;}}returntrue;}/***Removethesmallestitemfromthepriorityqueue.*@returnthesmallestitem,ornull,ifempty.publicintdeleteMin(){if(isEmpty())return-1;intminItem=findMin();array[1]=array[currentSize--];.percolateDown(1);returnminItem;}/***Establishheaporderpropertyfromanarbitrary*arrangementofitems.Runsinlineartime.publicvoidbuildHeap(){for(inti=currentSize/2;i>0;percolateDown(i);}/***Testifthepriorityqueueislogicallyempty.*@returntrueifempty,falseotherwise.publicbooleanisEmpty(){returncurrentSize==0;}/***Testifthepriorityqueueislogicallyfull.*@returntrueiffull,falseotherwise.publicbooleanisFull(){returncurrentSize==array.length-1;}/***Makethepriorityqueuelogicallyempty.//@ensuresisEmpty();publicvoidmakeEmpty().{currentSize=0;}privatestaticfinalintDEFAULT_CAPACITY=100;privateintcurrentSize;//Numberofelementsinheapprivateint[]array;//Theheapray/***Internalmethodtopercolatedownintheheap.*@paramholetheindexatwhichthepercolatebegins.privatevoidpercolateDown(int{intchild;for(;hole*2<=currentSize;hole=child){child=hole*2;if(child!=currentSize&&array[child+1]<array[child])child+;if(array[child]<tmp)array[hole]=array[child];elsebreak;}array[hole]=tmp;}}inttmp=array[hole];./***Exceptionclassforaccessinfullcontainers*suchasstacks,queues,andpriorityqueues. *@authorMarkAllenWeiss publicclassOverflowextendsException {}題目(2)importjava.util.Comparator;importjava.util.Random;/***Aclassthatcontainsseveralsortinges*implementedasstaticmethods.*Arraysarerearrangedwithsmallestitemfirst,*usingcompareTo.*@authorMarkAllenWeisspublicfinalclassSorting{/***Simpleinsertionsort.*@paramaanarrayofComparableitems.publicvoidinsertionSort(int[]a){for(intp=1;p<a.length;{inttmp=a[p];for(j=p;j>0&&tmp<a[j-1];j--)a[j]=a[j-1];a[j]=tmp;}}publicbooleanisSorted(int[]a){for(inti=0;i<a.length-1;i++){if(a[i]>a[i+1]){returnfalse}}turntrue}publicstaticvoidquicksort(int[]{quicksort(a,0,a.length-1);}privatestaticfinalintCUTOFF=10;publicstaticfinalvoid.swapReferences(Object[]a,intindex1,intindex2){Objecttmp=a[index1];a[index1]=a[index2];a[index2]=tmp;}publicstaticfinalvoidswap(int[]a,intindex1,intindex2){inttmp=a[index1];a[index1]=a[index2];a[index2]=tmp;}privatestaticintmedian3(int[]a,intleft,intright){intcenter=(left+right)/2;if(a[center]<a[left])swap(a,left,center);if(a[right]<a[left])swap(a,left,right);if(a[right]<a[center]).swap(a,center,right);swap(a,i,j);//Placepivotatpositionright-1swap(a,center,right-1);returna[right-1];}eak}swap(a,i,right-1);//privatestaticvoidquicksort(int[]a,intleft,intright){if(left+CUTOFF<=right){intpivot=median3(a,left,inti=left,j=right-1;for(;;){while(a[++i]<pivot)}while(a[--j]>pivot)}jquicksortalefti-1);//Sortsmallelementsquicksort(a,i+1,right);//Sortlargeelements}else//DoaninsertionsortonthesubarrayinsertionSort(a,left,}privatestaticvoidinsertionSort(int[]a,intleft,intright){for(intp=left+1;p<=right;{inttmp=a[p];for(j=p;j>left&&tmpaj];j--)a[j]=a[j-1];a[j]=tmp;題目(3)publicclassStatistics{/****@paramnumbers*@returnthelengthofthearraypublicintcalLength(int[]numbers){intlength=numbers.length;returnlength;}/**.}}privatestaticfinalintNUM_ITEMSprivatestaticinttheSeed=1;}**@paramnumbers*@returnthemeanvalueoftheraypublicdoublecalMean(int[]numbers){intlength=calLength(numbers);doublesum;sum=0.0;for(inti=0;i<length;i++){sum+=numbers[i];}doublemean=sum/(double)returnmean;}/****@paramnumbers*@returnthevarvalueofthe.doublemean=calMean(numbers);doublevarsum=0.0;for(inti=0;i<length;i++){varsum=varsum+((numbers[i]-mean)*(numbers[i]-an}doublevar=varsum/(lengthraypublicdoublecalVar(int[]numbers){intlength=calLength(numbers);題目(4)publicclassTriangle{protectedlonglborderA=0;protectedlonglborderB=0;protectedlonglborderC=0;returnvar;}}//ConstructorpublicTriangle(longlborderA,longlborderB,longlborderC){this.lborderA=lborderA;.this.lborderB=lborderB;this.lborderC=lborderC;}/***checkifitisatriangle**@returntruefortriangleandfalsenotpublicbooleanisTriangle(Triangletriangle){booleanisTriangle=false;//checkboundaryif((triangle.lborderA>0&&triangle.lborderA<=Long.MAX_VALU(triangle.lborderB>0&&triangle.lborderB<=(triangle.lborderC>0&&triangle.lborderC<=Long.MAX_VALU){//checkifsubtractionoftwoborderlargerthanthethirdif(diffOfBorders(triangle.lborderA,triangle.lborderB)<triangle.lborderCdiffOfBorders(triangle.lborderB,triangle.lborderC)<triangle.lborderAdiffOfBorders(triangle.lborderC,triangle.lborderA)<triangle.lborderB){isTriangle=true;}}returnisTriangle;}Long.MAX_VALU/***Checkthetypeoftriangle**Consistsof"Illegal","Regular","Scalene","Isosceles"publicStringgetType(Triangletriangle){StringstrType="Illegal";if(isTriangle(triangle)){//IsRegularif(triangle.lborderA==triangle.lborderBtriangle.lborderB==triangle.lborderC).(triangle.lborderA!=triangle.lborderC)){strTypeScalene;} //ifisosceles else{strType="Isosceles";}}returnstrType;}/***calculatethediffbetween{strType="Regular";*}**/ //Ifscalene publiclongdiffOfBorders(longa,elseiflongb){((triangle.lborderA!=triangle.lborderB)return(a>b)?(a-b):(b-a);}(triangle.lborderB!=triangle.lborderC).borders[1]=this.lborderB;/**borders[2]=this.lborderC;*getlengthofbordersreturnborders;}publiclong[]getBorders(){}long[]borders=newlong[3];borders[0]=this.lborderA;題目(1)importorg.junit.After;importorg.junit.Before;importorgjunitTestimportorg.junit.Assert;publicvoidsetUp()Exception{}publicvoidtearDown()throwsthrowsException{publicclassBinaryHeapTest{}.publicvoidtest(){BinaryHeapheap1=newBinaryHeap(1024);for(inti=1024;i>0;i--){try{heap1.insert(i);}catch(Overflowe){Assert.fail(e.getMessage());}}heap1.makeEmpty();heap1.findMin();heap1.deleteMin();}}題目(2)if(heap1.wellFormed()){heap1.buildHeap();}heap1.deleteMin();importorg.junit.Before;importorg.junit.After;importorgjunitTestpublicclassSortingTest{privateintnum;privateint[]num1=newint[50];privateint[]num2=newint[50];privateObject[]ref=newObject[]{3,4,5,6,9};privateSortingsorting;publicvoidsetUp()throws.Exception{}sorting=newSorting();for(inti=0;i<50;i++){num=(int)(Math.random()*50);num1[i]=num;}for(inti=0;i<50;i++){num=(int)(Math.random()*50);num2[i]=num;}publicvoidtest(){sorting.quicksort(num1);sorting.isSorted(num1);sorting.insertionSort(num2);sorting.isSorted(num2);sorting.swapReferences(ref,1,}}}}publicvoidtearDown()throwsException{題目(3)importorg.junit.After;importorg.junit.Before;importorgjunitTestpublicclassStatisticsT