服务计算概论作业报告.docx
- 文档编号:4451414
- 上传时间:2022-12-01
- 格式:DOCX
- 页数:18
- 大小:131.96KB
服务计算概论作业报告.docx
《服务计算概论作业报告.docx》由会员分享,可在线阅读,更多相关《服务计算概论作业报告.docx(18页珍藏版)》请在冰豆网上搜索。
服务计算概论作业报告
慕测平台测试报告
(二)
学院:
计算机学院
姓名:
赵红娜
专业:
软件工程
学号:
3130608003
班级:
1301
完成日期:
2016-10-22
2016年10月22日
1.题目
针对以下4个项目编写测试用例进行测试。
代码如下:
题目
(1)
//BinaryHeapclass
//
//CONSTRUCTION:
withoptionalcapacity(thatdefaultsto100)
//
//******************PUBLICOPERATIONS*********************
//voidinsert(x)-->Insertx
//intdeleteMin()-->Returnandremovesmallestitem
//intfindMin()-->Returnsmallestitem
//booleanisEmpty()-->Returntrueifempty;elsefalse
//booleanisFull()-->Returntrueiffull;elsefalse
//voidmakeEmpty()-->Removeallitems
//******************ERRORS********************************
//ThrowsOverflowifcapacityexceeded
/**
*Implementsabinaryheap.
*Notethatall"matching"isbasedonthecompareTomethod.
*@authorMarkAllenWeiss
*/
publicclassBinaryHeap
{
//@invariantwellFormed();
/**
*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();
//Percolateup
inthole=++currentSize;
for(;hole>1&&x array[hole]=array[hole/2]; array[hole]=x; } /** *Findthesmallestiteminthepriorityqueue. *@returnthesmallestitem,ornull,ifempty. */ publicintfindMin() { if(isEmpty()) return-1; returnarray[1]; } booleanwellFormed(){ if(array==null){//array! =null returnfalse; } if(currentSize<0||currentSize>=array.length){//currentSize>=0;currentSize returnfalse; } for(inti=1;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;i--) 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;//Numberofelementsinheap privateint[]array;//Theheaparray /** *Internalmethodtopercolatedownintheheap. *@paramholetheindexatwhichthepercolatebegins. */ privatevoidpercolateDown(inthole) { intchild; inttmp=array[hole]; for(;hole*2<=currentSize;hole=child) { child=hole*2; if(child! =currentSize&& array[child+1] child++; if(array[child] array[hole]=array[child]; else break; } array[hole]=tmp; } } /** *Exceptionclassforaccessinfullcontainers *suchasstacks,queues,andpriorityqueues. *@authorMarkAllenWeiss */ publicclassOverflowextendsException { } 题目 (2) importjava.util.Comparator; importjava.util.Random; /** *Aclassthatcontainsseveralsortingroutines, *implementedasstaticmethods. *Arraysarerearrangedwithsmallestitemfirst, *usingcompareTo. *@authorMarkAllenWeiss */ publicfinalclassSorting { /** *Simpleinsertionsort. *@paramaanarrayofComparableitems. */ publicvoidinsertionSort(int[]a) { intj; for(intp=1;p { inttmp=a[p]; for(j=p;j>0&&tmp a[j]=a[j-1]; a[j]=tmp; } } publicbooleanisSorted(int[]a){ for(inti=0;i if(a[i]>a[i+1]){ returnfalse; } } returntrue; } publicstaticvoidquicksort(int[]a) { quicksort(a,0,a.length-1); } privatestaticfinalintCUTOFF=10; publicstaticfinalvoidswapReferences(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] swap(a,left,center); if(a[right] swap(a,left,right);
- 配套讲稿:
如PPT文件的首页显示word图标,表示该PPT已包含配套word讲稿。双击word图标可打开word文档。
- 特殊限制:
部分文档作品中含有的国旗、国徽等图片,仅作为作品整体效果示例展示,禁止商用。设计者仅对作品中独创性部分享有著作权。
- 关 键 词:
- 服务 计算 概论 作业 报告
![提示](https://static.bdocx.com/images/bang_tan.gif)