华南理工大学 Java答案18章.docx
- 文档编号:4380096
- 上传时间:2022-12-01
- 格式:DOCX
- 页数:17
- 大小:157.31KB
华南理工大学 Java答案18章.docx
《华南理工大学 Java答案18章.docx》由会员分享,可在线阅读,更多相关《华南理工大学 Java答案18章.docx(17页珍藏版)》请在冰豆网上搜索。
华南理工大学Java答案18章
华南理工大学学生实验报告书
实验名称
java课程实验
课程名称
Java语言程序设计
课程号
学院
软件学院
专业
软件工程
班级
学生姓名
**
学号
*******
实验地点
实验日期
第一章
1.3
publicclassExe1_3
{
publicstaticvoidmain(String[]args)
{
System.out.println("JAVVA");
System.out.println("JAAVVAA");
System.out.println("JJAAAAAVVAAAAA");
System.out.println("JJAAVAA");
}
}
第二章
2.21
importjava.util.Scanner;
publicclassExe2_21
{
publicstaticvoidmain(String[]args)
{
System.out.println("Enterthreepointsfortriangle:
");
Scannerinput=newScanner(System.in);
doublex1=input.nextDouble();
doubley1=input.nextDouble();
doublex2=input.nextDouble();
doubley2=input.nextDouble();
doublex3=input.nextDouble();
doubley3=input.nextDouble();
doubleside1=Math.sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
doubleside2=Math.sqrt((x1-x3)*(x1-x3)+(y1-y3)*(y1-y3));
doubleside3=Math.sqrt((x2-x3)*(x2-x3)+(y2-y3)*(y2-y3));
doubles=(side1+side2+side3)/2;
doublearea=Math.sqrt(s*(s-side1)*(s-side2)*(s-side3));
System.out.println("Theareaofthetriangleis"+area);
}
}
第三章
3.27
importjava.util.Scanner;
publicclassExe3_27
{
publicstaticvoidmain(String[]args)
{
finaldoublex1=0;
finaldoubley1=0;
finaldoublex2=200;
finaldoubley2=0;
finaldoublex3=0;
finaldoubley3=100;
Scannerinput=newScanner(System.in);
System.out.println("Enterapoint'sx-andy-coordinates:
");
doublex=input.nextDouble();
doubley=input.nextDouble();
doubley_x=-(x/2)+100;
if(x { System.out.println("Thepointisnotinthetriangle! "); } elseif(y { System.out.println("Thepointisnotinthetriangle! "); } elseif(y>y_x) { System.out.println("Thepointisnotinthetriangle! "); } else { System.out.println("Thepointisinthetriangle! "); } } } 3.29 importjava.util.Scanner; publicclassExe3_29 { publicstaticvoidmain(String[]args) { Scannerinput=newScanner(System.in); System.out.println("Entercircle1'scenterx-,y-coordinatesandradius: "); doublex1=input.nextDouble(); doubley1=input.nextDouble(); doubler1=input.nextDouble(); System.out.println("Entercircle2'scenterx-,y-coordinatesandradius: "); doublex2=input.nextDouble(); doubley2=input.nextDouble(); doubler2=input.nextDouble(); doublelength=Math.sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)); doubleL1=Math.abs(r1-r2); doubleL2=r1+r2; if(length<=L1) { System.out.println("circle2isincircle1! "); } elseif(length<=L2) { System.out.println("circle2overlapscircle1! "); } else { System.out.println("circle2doesnotoverlapcircle1"); } } } 第四章 4.25 publicclassExe4_25 { publicstaticvoidmain(String[]args) { doublePI=0,sum=0; inti,n; for(i=10000;i<=100000;i+=10000) { for(n=1;n { sum+=(1.0/(2*n-1)-1.0/(2*n+1)); } PI=4*sum; System.out.println("i="+i+"and兀="+PI); sum=0; } } } 4.41 importjava.util.Scanner; publicclassExe4_41 { publicstaticvoidmain(String[]args) { System.out.println("Enternumbers: "); Scannerinput=newScanner(System.in); intinteger,max,count; integer=input.nextInt(); max=integer; count=1; while(integer! =0) { integer=input.nextInt(); if(integer>max) { max=integer; count=1; } elseif(integer {} else { count+=1; } }; System.out.println("Thelargestnumberis"+max); System.out.println("Theoccurencecountofthelargestnumberis"+count); } } 第五章 5.21 importjava.util.Scanner; publicclassExe5_21 { publicstaticvoidmain(String[]args) { Scannerinput=newScanner(System.in); double[]ary=newdouble[10]; System.out.println("Entertennumbers: "); for(inti=0;i { ary[i]=input.nextDouble(); } doublesum=0,sum_pow=0; for(inti=0;i sum+=ary[i]; for(inti=0;i sum_pow+=ary[i]*ary[i]; doublemean=sum/ary.length; doublestandard_value=Math.sqrt((sum_pow-sum*sum/ary.length)/(ary.length-1.0)); System.out.println("Themeanis"+mean); System.out.println("Thestandarddeviationis"+standard_value); } } 第六章 6.18 importjava.util.Scanner; publicclassExe6_18 { publicstaticvoidmain(String[]args) { System.out.print("Entertenrealnumber: "); double[]array=newdouble[10]; Input(array); Sort(array); Output(array); } //输入 publicstaticvoidInput(double[]ary) { Scannerinput=newScanner(System.in); for(inti=0;i ary[i]=input.nextDouble(); } //输出 publicstaticvoidOutput(double[]ary) { for(inti=0;i System.out.print(""+ary[i]); } //冒泡排序 publicstaticvoidSort(double[]ary) { intn=0; booleanwork=true; doubletemp=0; for(inti=1;i { work=true; for(n=0;n if(ary[n]>ary[n+1]) { temp=ary[n]; ary[n]=ary[n+1]; ary[n+1]=temp; work=false; } if(work)break; } } } 第七章 7.6 importjava.util.Scanner; publicclassExe7_6 { finalstaticintR=3; finalstaticintL=3; publicstaticvoidmain(String[]args) { double[][]matrix1=newdouble[L][R]; double[][]matrix2=newdouble[L][R]; System.out.println("Entermatrix1: "); Input(matrix1); System.out.println("Entermatrix2: "); Input(matrix2); Output(matrix1,matrix2,multiplyMatrix(matrix1,matrix2)); } //输入 publicstaticvoidInput(double[][]matrix) { Scannerinput=newScanner(System.in); for(intline=0;line { for(introw=0;row matrix[line][row]=input.nextDouble(); } } //输出 publicstaticvoidOutput(double[][]a,double[][]b,double[][]matrix) { intn=0; for(inti=0;i { if(i! =1) { for(n=0;n System.out.print(""+a[i][n]); System.out.print(""); for(n=0;n System.out.print(""+b[i][n]); System.out.print(""); for(n=0;n System.out.print(""+matrix[i][n]); } else { for(n=0;n System.out.print(""+a[i][n]); System.out.print("*"); for(n=0;n System.out.print(""+b[i][n]); System.out.print("="); for(n=0;n System.out.print(""+matrix[i][n]); } System.out.println(); } } //矩阵相乘 publicstaticdouble[][]multiplyMatrix(double[][]a,double[][]b) { double[][]c=newdouble[L][R]; for(inti=0;i { for(intj=0;j { c[i][j]=0; for(intk=0;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.12 importjava.util.Scanner; publicclassExe8_12 { publicstaticvoidmain(String[]args) { Scannerinput=newScanner(System.in); System.out.print("Entertheendpointsofthefirstlinesegment: "); doublex1=input.nextDouble(); doubley1=input.nextDouble(); doublex2=input.nextDouble(); doubley2=input.nextDouble(); System.out.print("Entertheendpointsofthesecondlinesegment: "); doublex3=input.nextDouble(); doubley3=input.nextDouble(); doublex4=input.nextDouble(); doubley4=input.nextDouble(); doublea,b,c,d,e,f; 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=newLinearEquation(a,b,c,d,e,f); if(inter.isSolvable()) { System.out.print("Theintersectingpointis: "+inter.getX()+","+inter.getY()); } elseSystem.out.print("NULL"); } } classLinearEquation { privatedoublea; privatedoubleb; privatedoublec; privatedoubled; privatedoublee; privatedoublef; publicLinearEquation(doublea,doubleb,doublec,doubled,doublee,doublef) { this.a=a; this.b=b; this.c=c; this.d=d; this.e=e; this.f=f; } booleanisSolvable() { if(a*d-b*c! =0) returntrue; else returnfalse; } doublegetX() {return((e*d-b*f)/(a*d-b*c));} doublegetY() {return((a*f-e*c)/(a*d-b*c));} } 8.13 importjava.util.Scanner; publicclassExe8_13 { publicstaticvoidmain(String[]args) { Scannerinput=newScanner(System.in); System.out.println("Enterthenumberofrowsandcolumnsofthearray: "); introw=input.nextInt(); intcolumn=input.nextInt(); double[][]array=newdouble[row][column]; System.out.println("Enterthearray: "); for(inti=0;i for(intn=0;n array[i][n]=input.nextDouble(); System.out.println("Thelocationofthelargestelementis" +locateLargest(array).maxValue+"at(" +locateLargest(array).row+","+locateLargest(array).column+")"); } publicstaticLocationlocateLargest(double[][]a) { doublemaxNumber=a[0][0]; introw=0,column=0; for(inti=0;i {
- 配套讲稿:
如PPT文件的首页显示word图标,表示该PPT已包含配套word讲稿。双击word图标可打开word文档。
- 特殊限制:
部分文档作品中含有的国旗、国徽等图片,仅作为作品整体效果示例展示,禁止商用。设计者仅对作品中独创性部分享有著作权。
- 关 键 词:
- 华南理工大学 Java答案18章 Java 答案 18