还剩12页未读,继续阅读
本资源只提供10页预览,全部文档请下载后查看!喜欢就下载吧,查找使用更方便
文本内容:
华南理工大学学生实验报告书实验名称java课程实验课程名称Java语言程序设计课程号学院软件学院专业软件工程班级学生姓名**学号*******实验地点实验日期第一章
1.3publicclassExe1_3{publicstaticvoidmainString[]args{System.out.printlnJAVVA;System.out.printlnJAAVVAA;System.out.printlnJJAAAAAVVAAAAA;System.out.printlnJJAAVAA;}}第二章
2.21importjava.util.Scanner;publicclassExe2_21{publicstaticvoidmainString[]args{System.out.printlnEnterthreepointsfortriangle:;Scannerinput=newScannerSystem.in;doublex1=input.nextDouble;doubley1=input.nextDouble;doublex2=input.nextDouble;doubley2=input.nextDouble;doublex3=input.nextDouble;doubley3=input.nextDouble;doubleside1=Math.sqrtx1-x2*x1-x2+y1-y2*y1-y2;doubleside2=Math.sqrtx1-x3*x1-x3+y1-y3*y1-y3;doubleside3=Math.sqrtx2-x3*x2-x3+y2-y3*y2-y3;doubles=side1+side2+side3/2;doublearea=Math.sqrts*s-side1*s-side2*s-side3;System.out.printlnTheareaofthetriangleis+area;}}第三章
3.27importjava.util.Scanner;publicclassExe3_27{publicstaticvoidmainString[]args{finaldoublex1=0;finaldoubley1=0;finaldoublex2=200;finaldoubley2=0;finaldoublex3=0;finaldoubley3=100;Scannerinput=newScannerSystem.in;System.out.printlnEnterapointsx-andy-coordinates:;doublex=input.nextDouble;doubley=input.nextDouble;doubley_x=-x/2+100;ifxx1xx3{System.out.printlnThepointisnotinthetriangle!;}elseifyy1yy2{System.out.printlnThepointisnotinthetriangle!;}elseifyy_x{System.out.printlnThepointisnotinthetriangle!;}else{System.out.printlnThepointisinthetriangle!;}}}
3.29importjava.util.Scanner;publicclassExe3_29{publicstaticvoidmainString[]args{Scannerinput=newScannerSystem.in;System.out.printlnEntercircle1scenterx-y-coordinatesandradius:;doublex1=input.nextDouble;doubley1=input.nextDouble;doubler1=input.nextDouble;System.out.printlnEntercircle2scenterx-y-coordinatesandradius:;doublex2=input.nextDouble;doubley2=input.nextDouble;doubler2=input.nextDouble;doublelength=Math.sqrtx1-x2*x1-x2+y1-y2*y1-y2;doubleL1=Math.absr1-r2;doubleL2=r1+r2;iflength=L1{System.out.printlncircle2isincircle1!;}elseiflength=L2{System.out.printlncircle2overlapscircle1!;}else{System.out.printlncircle2doesnotoverlapcircle1;}}}第四章
4.25publicclassExe4_25{publicstaticvoidmainString[]args{doublePI=0sum=0;intin;fori=10000;i=100000;i+=10000{forn=1;ni;n+=2{sum+=
1.0/2*n-1-
1.0/2*n+1;}PI=4*sum;System.out.printlni=+i+and兀=+PI;sum=0;}}}
4.41importjava.util.Scanner;publicclassExe4_41{publicstaticvoidmainString[]args{System.out.printlnEnternumbers:;Scannerinput=newScannerSystem.in;intintegermaxcount;integer=input.nextInt;max=integer;count=1;whileinteger!=0{integer=input.nextInt;ifintegermax{max=integer;count=1;}elseifintegermax{}else{count+=1;}};System.out.printlnThelargestnumberis+max;System.out.printlnTheoccurencecountofthelargestnumberis+count;}}第五章
5.21importjava.util.Scanner;publicclassExe5_21{publicstaticvoidmainString[]args{Scannerinput=newScannerSystem.in;double[]ary=newdouble
[10];System.out.printlnEntertennumbers:;forinti=0;iary.length;i++{ary[i]=input.nextDouble;}doublesum=0sum_pow=0;forinti=0;iary.length;i++sum+=ary[i];forinti=0;iary.length;i++sum_pow+=ary[i]*ary[i];doublemean=sum/ary.length;doublestandard_value=Math.sqrtsum_pow-sum*sum/ary.length/ary.length-
1.0;System.out.printlnThemeanis+mean;System.out.printlnThestandarddeviationis+standard_value;}}第六章
6.18importjava.util.Scanner;publicclassExe6_18{publicstaticvoidmainString[]args{System.out.printEntertenrealnumber:;double[]array=newdouble
[10];Inputarray;Sortarray;Outputarray;}//输入publicstaticvoidInputdouble[]ary{Scannerinput=newScannerSystem.in;forinti=0;iary.length;i++ary[i]=input.nextDouble;}//输出publicstaticvoidOutputdouble[]ary{forinti=0;iary.length;i++System.out.print+ary[i];}//冒泡排序publicstaticvoidSortdouble[]ary{intn=0;booleanwork=true;doubletemp=0;forinti=1;iary.length;i++{work=true;forn=0;nary.length-i;n++ifary[n]ary[n+1]{temp=ary[n];ary[n]=ary[n+1];ary[n+1]=temp;work=false;}ifworkbreak;}}}第七章
7.6importjava.util.Scanner;publicclassExe7_6{finalstaticintR=3;finalstaticintL=3;publicstaticvoidmainString[]args{double[][]matrix1=newdouble[L][R];double[][]matrix2=newdouble[L][R];System.out.printlnEntermatrix1:;Inputmatrix1;System.out.printlnEntermatrix2:;Inputmatrix2;Outputmatrix1matrix2multiplyMatrixmatrix1matrix2;}//输入publicstaticvoidInputdouble[][]matrix{Scannerinput=newScannerSystem.in;forintline=0;lineL;line++{forintrow=0;rowR;row++matrix[line][row]=input.nextDouble;}}//输出publicstaticvoidOutputdouble[][]adouble[][]bdouble[][]matrix{intn=0;forinti=0;iL;i++{ifi!=1{forn=0;nR;n++System.out.print+a[i][n];System.out.print;forn=0;nR;n++System.out.print+b[i][n];System.out.print;forn=0;nR;n++System.out.print+matrix[i][n];}else{forn=0;nR;n++System.out.print+a[i][n];System.out.print*;forn=0;nR;n++System.out.print+b[i][n];System.out.print=;forn=0;nR;n++System.out.print+matrix[i][n];}System.out.println;}}//矩阵相乘publicstaticdouble[][]multiplyMatrixdouble[][]adouble[][]b{double[][]c=newdouble[L][R];forinti=0;iL;i++{forintj=0;jR;j++{c[i][j]=0;forintk=0;kR;k++c[i][j]+=a[i][k]*b[k][j];//c[i][j]=a[i]
[0]*b
[0][j]+a[i]
[1]*b
[1][j]+a[i]
[2]*b
[2][j];}}returnc;}}第八章
8.12importjava.util.Scanner;publicclassExe8_12{publicstaticvoidmainString[]args{Scannerinput=newScannerSystem.in;System.out.printEntertheendpointsofthefirstlinesegment:;doublex1=input.nextDouble;doubley1=input.nextDouble;doublex2=input.nextDouble;doubley2=input.nextDouble;System.out.printEntertheendpointsofthesecondlinesegment:;doublex3=input.nextDouble;doubley3=input.nextDouble;doublex4=input.nextDouble;doubley4=input.nextDouble;doubleabcdef;a=y2-y1;b=x1-x2;c=y4-y3;d=x3-x4;e=y2-y1*x1+x1-x2*y1;f=y4-y3*x3+x3-x4*y3;LinearEquationinter=newLinearEquationabcdef;ifinter.isSolvable{System.out.printTheintersectingpointis:+inter.getX++inter.getY;}elseSystem.out.printNULL;}}classLinearEquation{privatedoublea;privatedoubleb;privatedoublec;privatedoubled;privatedoublee;privatedoublef;publicLinearEquationdoubleadoublebdoublecdoubleddoubleedoublef{this.a=a;this.b=b;this.c=c;this.d=d;this.e=e;this.f=f;}booleanisSolvable{ifa*d-b*c!=0returntrue;elsereturnfalse;}doublegetX{returne*d-b*f/a*d-b*c;}doublegetY{returna*f-e*c/a*d-b*c;}}
8.13importjava.util.Scanner;publicclassExe8_13{publicstaticvoidmainString[]args{Scannerinput=newScannerSystem.in;System.out.printlnEnterthenumberofrowsandcolumnsofthearray:;introw=input.nextInt;intcolumn=input.nextInt;double[][]array=newdouble[row][column];System.out.printlnEnterthearray:;forinti=0;irow;i++forintn=0;ncolumn;n++array[i][n]=input.nextDouble;System.out.printlnThelocationofthelargestelementis+locateLargestarray.maxValue+at+locateLargestarray.row++locateLargestarray.column+;}publicstaticLocationlocateLargestdouble[][]a{doublemaxNumber=a
[0]
[0];introw=0column=0;forinti=0;ia.length;i++{forintj=0;ja
[0].length;j++{ifa[i][j]maxNumber{maxNumber=a[i][j];row=i;column=j;}}}returnnewLocationrowcolumnmaxNumber;}}classLocation{LocationintrowintcolumndoublemaxValue{this.row=row;this.column=column;this.maxValue=maxValue;}publicintrowcolumn;publicdoublemaxValue;}。