Faculty of Science COMP-202A - Foundations of Computing (Fall 2015) - All Sections Midterm Examination

Similar documents
Faculty of Science COMP-202A - Foundations of Computing (Fall 2013) - All Sections Midterm Examination

Faculty of Science COMP-202A - Foundations of Computing (Fall 2012) - All Sections Midterm Examination

Faculty of Science COMP-202B - Foundations of Computing (Winter 2016) - All Sections Midterm Examination

Faculty of Science COMP-202A - Foundations of Computing (Fall 2013) - All Sections Midterm Examination

Faculty of Science COMP-202A - Introduction to Computing I (Fall 2011) - All Sections Midterm Examination

Faculty of Science COMP-202A - Introduction to Computing I (Fall 2009) - All Sections Midterm Examination

Faculty of Science COMP-202B - Introduction to Computing I (Winter 2010) - All Sections Midterm Examination

Faculty of Science COMP-202B - Foundations of Computing (Winter 2016) - All Sections Final Examination

Faculty of Science COMP-202A - Introduction to Computing I (Fall 2008) Final Examination

Faculty of Science COMP-202A - Foundations of Computing (Fall 2014) - All Sections Final Examination

Faculty of Science COMP-202A - Introduction to Computing I (Fall 2009) - All Sections Final Examination

CIS 1068 Design and Abstraction Spring 2017 Midterm 1a

Faculty of Science COMP-202B - Introduction to Computing I (Winter 2009) - All Sections Final Examination

Midterm Exam 2 Thursday, November 15th, points (15% of final grade) Instructors: Jim Williams and Marc Renault

Faculty of Science COMP-202B - Introduction to Computing I (Winter 2011) - All Sections Final Examination

Faculty of Science COMP-202A - Introduction to Computing I (Fall 2010) - All Sections Final Examination

Section 003 Fall CS 170 Exam 2. Name (print): Instructions:

CSC 1051 Algorithms and Data Structures I. Midterm Examination March 1, Name: KEY A

Question: Total Points: Score:

COMP102: Test. 26 April, 2006

CSC 1051 Algorithms and Data Structures I. Midterm Examination March 2, Name:

Computer Science 300 Sample Exam Today s Date 100 points (XX% of final grade) Instructor Name(s) (Family) Last Name: (Given) First Name:

CSC 1051 Algorithms and Data Structures I. Midterm Examination October 6, Name:

Term 1 Unit 1 Week 1 Worksheet: Output Solution

Using Java Classes Fall 2018 Margaret Reid-Miller

We now start exploring some key elements of the Java programming language and ways of performing I/O

CSEN202: Introduction to Computer Science Spring Semester 2017 Midterm Exam

COMP-202B - Introduction to Computing I (Winter 2011) - All Sections Example Questions for In-Class Quiz

CSC 1051 Algorithms and Data Structures I. Midterm Examination October 11, Name: KEY

COE 211/COE 212 Computer/Engineering Programming. Welcome to Exam II Thursday December 20, 2012

COE 212 Engineering Programming. Welcome to Exam II Monday May 13, 2013

CMPS 12A - Winter 2002 Final Exam A March 16, Name: ID:

CSC Algorithms and Data Structures I. Midterm Examination February 25, Name:

CSC 1051 Algorithms and Data Structures I. Midterm Examination February 25, Name: KEY A

CS 211: Existing Classes in the Java Library

Computational Expression

Full file at

A variable is a name for a location in memory A variable must be declared

CMPS 12A Winter 2006 Prof. Scott A. Brandt Final Exam, March 21, Name:

CS 170 Exam 1. Version: B Fall Name (as on OPUS):

CS 177 Spring 2010 Exam I

CS 170 Exam 2. Version: A Fall Name (as in OPUS) (print): Instructions:

Computer Science 145 Midterm 1 Fall 2016

CS 170 Exam 1. Version: C Fall Name (as on OPUS):

CSE 1223: Exam II Autumn 2016

CIS 1068 Program Design and Abstraction Spring2016 Midterm Exam 1. Name SOLUTION

Spring 2013 COMP Midterm Exam Solutions March 07, 2013

CSC 1051 Algorithms and Data Structures I. Midterm Examination October 7, Name:

CIS November 14, 2017

CIS 1068 Netflix Challenge New assignment posted soon Lab grades November 14, 2017

I. True/False: (2 points each)

CIS 110 Introduction to Computer Programming Summer 2018 Midterm. Recitation ROOM :

King Saud University College of Computer and Information Sciences Computer Science Department

McGill University School of Computer Science COMP-202A Introduction to Computing 1

1 Short Answer (15 Points Each)

CS Introduction to Programming Midterm Exam #1 - Prof. Reed Fall 2009

Practice Midterm 1. Problem Points Score TOTAL 50

CIS October 19, 2017

CSC 1051 Algorithms and Data Structures I. Midterm Examination October 9, Name: KEY

COE 212 Engineering Programming. Welcome to Exam II Thursday April 21, Instructors: Dr. Salim Haddad Dr. Joe Tekli Dr. Wissam F.

CMPS 12A - Winter 2002 Midterm 2 March 5, Name: ID:

CS 102 / CS Introduction to Programming Midterm Exam #1 - Prof. Reed Fall 2010

CSC 1051 Algorithms and Data Structures I. Midterm Examination February 26, Name: Key

Some Sample AP Computer Science A Questions - Solutions

COE 212 Engineering Programming. Welcome to Exam II Tuesday November 28, 2018

Section 002 Spring CS 170 Exam 1. Name (print): Instructions:

CIS November 14, 2017

CS 101 Spring 2007 Midterm 2 Name: ID:

UNIVERSITY OF WINDSOR Fall 2007 QUIZ # 2 Solution. Examiner : Ritu Chaturvedi Dated :November 27th, Student Name: Student Number:

A Quick and Dirty Overview of Java and. Java Programming

COMP 202. Built in Libraries and objects. CONTENTS: Introduction to objects Introduction to some basic Java libraries string

Using APIs. Chapter 3. Outline Fields Overall Layout. Java By Abstraction Chapter 3. Field Summary static double PI

x++ vs. ++x x=y++ x=++y x=0; a=++x; b=x++; What are the values of a, b, and x?

Exam 2. Programming I (CPCS 202) Instructor: M. G. Abbas Malik. Total Marks: 40 Obtained Marks:

CS 302: INTRODUCTION TO PROGRAMMING. Lectures 7&8

Section 004 Spring CS 170 Exam 1. Name (print): Instructions:

CIS 110 Introduction to Computer Programming Summer 2014 Midterm. Name:

Some Practice Midterm Problems

Faculty of Science COMP-202A - Introduction to Computing I (Fall 2008) Midterm Examination

Lecture 2. COMP1406/1006 (the Java course) Fall M. Jason Hinek Carleton University

The University of Western Ontario Department of Computer Science Computer Science 1026a Midterm Exam 2 hours

Practice Midterm 1 Answer Key

CIS 110 Introduction To Computer Programming. February 29, 2012 Midterm

COS 126 General Computer Science Spring Written Exam 1

SFWR ENG/COMP SCI 2S03 Principles of Programming SOLUTIONS

COS 126 Midterm 1 Written Exam, Fall 2009

CS170 (005): Introduction to Computer Science Exam 2

CSE 142, Autumn 2010 Midterm Exam, Friday, November 5, 2010

I. True/False: (2 points each)

1 Short Answer (10 Points Each)

CMPT-166: Sample Midterm

Lecture 14 CSE11 Fall 2013 For loops, Do While, Break, Continue

CSCI 135 Exam #0 Fundamentals of Computer Science I Fall 2013

COMP-202 Unit 2: Java Basics. CONTENTS: Using Expressions and Variables Types Strings Methods

CIS March 1, 2018

CSCI 135 Exam #0 Fundamentals of Computer Science I Fall 2012

AP COMPUTER SCIENCE A DIAGNOSTIC EXAM. Multiple Choice Section Time - 1 hour and 15 minutes Number of questions - 40 Percent of total grade - 50

CS Introduction to Programming Midterm Exam #1 - Prof. Reed Spring 2010

CIS 110 Introduction To Computer Programming. November 21st, 2011 Exam 2

Building Java Programs

Transcription:

First Name: Last Name: McGill ID: Section: Faculty of Science COMP-202A - Foundations of Computing (Fall 2015) - All Sections Midterm Examination November 5 th, 2015 Examiners: Melanie Lyman-Abramovitch [Section 1 (MWF 10:35-11:25)] 18:00-21:00 Dan Pomerantz [Section 2 TR (13:00-14:30)] Melanie Lyman-Abramovitch [Section 3 MWF (12:35-13:25)] Instructions: DO NOT TURN THIS PAGE UNTIL INSTRUCTED This is a closed book examination; only a legal-sized (8.5 by 14 ) crib sheet is permitted. This crib sheet can be single or double-sided; it can be handwritten or typed. Non-electronic translation dictionaries are permitted, but instructors and invigilators reserve the right to inspect them at any time during the examination. Besides the above, only writing implements (pens, pencils, erasers, pencil sharpeners, etc.) are allowed. The possession of any other tools or devices is prohibited. Answer all questions on the scantron sheet. This examination has 14 pages including this cover page, and is printed on both sides of the paper. On page 14, you will find information about useful classes and methods. You may detach the Appendix (page 14 onwards) from the examination if you wish. The Examination Security Monitor Program detects pairs of students with unusually similar answer patterns on mulitple-choice exams. Data generated by this program can be used as admissible evidence, either to initiate or corroborate an investigation or a charge of cheating under Section 16 of the Code of Student Conduct and Disciplinary Procedures. MAKE SURE TO WRITE YOUR NAME AND STUDENT ID ON THE SCANTRON AS WELL AS TO FILL IN THE BUBBLE PROPERLY AT THE BEGINNING OF THE EXAM. MARKS WILL BE DEDUCED IF INFORMATION IS MISSING. Scoring The exam will be scored as follows: 1. Questions 1 to 10 are worth 1 point each 2. Questions 11 to 40 will be worth 2 points each 3. Question 41 will be worth 30 points Version-1

COMP-202A - Fall 2015 - Midterm Examination - Version-1 Page 2 True/False Section (1 point each) 1. If you have an if block, followed by an else-if block, you are required to end with an else block. (A) FALSE (B) TRUE 2. In Java, if a and b are boolean expressions, a&&b and b&&a will always evaluate to the same result. (A) TRUE (B) FALSE 3. It is possible to successfully compile a.java file that does not contain a main method. (A) TRUE (B) FALSE 4. In Java, proper indentation is enforced by the compiler. (A) TRUE (B) FALSE 5. The following code compiles: int x = 1; if(x) { System.out.println("Hello world"); (A) TRUE (B) FALSE 6. In Java, we can compare an int value with a char value without doing any explicit typecasting. (A) FALSE (B) TRUE 7. The size of an array in Java can never be changed after it has been created. (A) FALSE (B) TRUE 8. What is the value of the variable c after the following code executes? boolean a = true; boolean b = false; boolean c =!(a b); (A) FALSE (B) TRUE 9. After the following code executes, it will print 8 to the screen.

COMP-202A - Fall 2015 - Midterm Examination - Version-1 Page 3 int[] a = {8,9,10; int[] b = a; b[0] = 10; System.out.println(a[0]); (A) TRUE (B) FALSE 10. Declaring a variable with the same name twice inside the same method always results in a compiler error. (A) FALSE (B) TRUE

COMP-202A - Fall 2015 - Midterm Examination - Version-1 Page 4 Regular multiple choice (2 points each) For this section, if error is not a choice, assume that the code compiles and runs without error. 11. Which of the following boolean expressions is true when exactly one of a and b is true and false otherwise? (A) (a b) && (a && b) (B)!(a b) && (a&& b) (C)!a &&!b (D) (a b) &&!(a && b) (E) (a b) (a && b) 12. What does the following snippet of code print? int x = 5; if(x=5){ System.out.println("x is five"); else { System.out.println("x is not five"); (A) There is a run-time error. (B) There are no errors, but it doesn t print anything. (C) x is not five (D) There is a compile-time error. (E) x is five 13. What does the following block of code print? int x = 5; int y = 6; int z = 7; if(x<y){ System.out.println("cats"); if(y>z){ System.out.println("dogs"); if(z>x){ System.out.println("rabbits"); (A) There is no error, but it prints nothing. (B) cats dogs rabbits (C) cats rabbits (D) cats (E) There is a run time error.

COMP-202A - Fall 2015 - Midterm Examination - Version-1 Page 5 14. What does the following block of code print? int x = 5; int y = 6; int z = 7; if(x<y){ System.out.println("x is smaller than y"); if(y<z){ System.out.println("y is smaller than z"); else{ System.out.println("z is smaller than y"); (A) There is an error. (B) y is smaller than z (C) z is smaller than y. (D) x is smaller than y y is smaller than z (E) x is smaller than y 15. Which of the following are primitive types? Shade in ALL correct answers on your scantron sheet. (A) char (B) double (C) int[] (D) boolean (E) String 16. What does the following code print? System.out.println("Hello! " + 4 + (2*7)); (A) Hello! 414 (B) This code will not run. There is a compile-time error. (C) This code will not run. There is a run-time error. (D) Hello! 18 (E) Hello! 4(2*7) 17. What is the value stored in the variable z? double z = 1/2; (A) 1.0 (B) 0.5 (C) 1 (D) 0.0 (E) Compiler error. 18. What is the value stored in the variable z?

COMP-202A - Fall 2015 - Midterm Examination - Version-1 Page 6 int z = 1.0/2.0; (A) Compiler error. (B) 0.5 (C) 0.0 (D) 1.0 (E) 1 19. What are the values of x, y and z after the following code executes? int x = 5; int y = 6; int z = 7; x = z; x = x + 1; z = y; y = z + x; z = 2*y; x--; (A) x=6, y=15, z=24 (B) x=7, y=14, z=28 (C) x=7, y=15, z=30 (D) x=5, y=12, z=24 (E) x=7, y=14, z=12 20. What does the following code print? int x=0; while(x<10){ x+=2; System.out.print(x + ", "); System.out.println(x); (A) 2, 4, 6, 8, 10, 10 (B) 2, 4, 6, 8, 10, 12 (C) 2, 4, 6, 8, 10 (D) 0, 2, 4, 6, 8, 10, 12 (E) 0, 2, 4, 6, 8, 10 21. What does the following code print? int x=0; String s = ""; while(x<10){ x++; if(x%3==0){ x++; x++; s = s + x + " "; System.out.println(s);

COMP-202A - Fall 2015 - Midterm Examination - Version-1 Page 7 (A) 2 5 8 (B) 1 4 7 (C) 1 4 7 10 (D) 1 3 6 9 (E) 2 5 8 11 22. What is the value of the variable z after the code executes? int z = 0; for (int i = 0; i < 10; i = i + 2) { for (int j = 10; j >= 1; j = j - 3) { z++; j++; z++; (A) 20 (B) 10 (C) 25 (D) 15 (E) 30 23. What does the following code print? for(int i = 0; i < 10; i + 2){ System.out.print(i + " "); (A) 0 1 2 3 4 5 6 7 8 9 (B) There is a compile time error (C) 0 2 4 6 8 (D) 0 2 4 6 8 10 (E) 0 1 2 3 4 5 6 7 8 9 10 24. What does the following code print? for(int i=0; i<3; i++){ for(int j=0; j<i; j++){ i--; System.out.print(j + " "); (A) 0 0 0 1 0 1 2 0 1 2 3 (B) This is an infinite loop - it prints forever (C) 0 0 1 0 1 2 0 1 2 3 (D) 0 0 0 1 0 1 2

COMP-202A - Fall 2015 - Midterm Examination - Version-1 Page 8 (E) 0 0 1 0 1 2 25. What are the contents of the array a after the following code executes? int[] a = {1,2,3,4,5; for(int i=0; i<a.length; i++){ a[i] = a[(i+1)%a.length]; (A) There is a run-time error (B) a=[2,3,4,5,2] (C) a=[2,3,4,5,1] (D) a=[2,3,4,5,5] (E) a=[5,4,3,2,1] 26. What are the contents of the array a after the following lines of code execute? int[] a = {1,2,3; method(a[0],a[1],a[2]); //Below is the entire body of the method called on the last line above. public static void method(int a, int b, int c){ int x = a; a = b; b = c; c = x; (A) a=[2,3,1] (B) a=[1,2,3] (C) a=[3,1,2] (D) a=[2,1,3] (E) a=[3,2,1] 27. What are the contents of the array a after the following lines of code execute? Note that the default value when you create an int[][] is 0 in each position. int[][] a = new int[5][2]; for(int i=0; i<a.length; i++){ a[i][i%a[i].length] = i; (A) Undefined - not all entries in a have been assigned values. (B) a=[[0,1,2,3,4],[0,1,2,3,4]] (C) a=[[0, 0],[0, 1],[2, 0],[0, 3],[4, 0]] (D) Compile time error - a.length is undefined for multi-dimensional arrays. (E) a=[[0, 0],[1, 1],[2, 2],[3, 3],[4, 4]] 28. What are the contents of the array a after the following lines of code execute?

COMP-202A - Fall 2015 - Midterm Examination - Version-1 Page 9 int[] a = {1,2,3,4,5; method(a); //Below is the entire body of the method called on the last line above. public static void method(int[] a){ for(int i=0; i<a.length; i++){ a[i] = a[a.length-i-1]; (A) a=[1,2,3,4,5] (B) a=[5,4,3,4,5] (C) a=[5,4,3,2,1] (D) a=[1,2,3,2,1] (E) Run time off-by-one error 29. Consider the following code. What prints? public class Swaps { public static void main(string[] args) { int[] a = {1,2,3,4,5; int[] b = {1,2,3,4; swaparrays(a,b); int x = 30; int y = 40; swapints(3,4); System.out.println(a.length + " " + x); public static void swaparrays(int[] a1, int[] a2) { int[] temp = a1; a1 = a2; a2 = temp; public static void swapints(int i, int j) { int temp = i; i = j; j = temp; (A) 5 40 (B) 4 30 (C) 5 30 (D) 4 40

COMP-202A - Fall 2015 - Midterm Examination - Version-1 Page 10 (E) Compiler error 30. Which of the following creates an array of integers [1, 2, 3, 4, 5]? Shade in ALL correct answers on your scantron sheet. If the statement results in a run or compile time error, then it is not valid. (A) int[] badpassword = new int[5]; badpassword = {1, 2, 3, 4, 5; (B) int[] badpassword = new int[5]; for(int i=badpassword.length; i>0; i--){ badpassword[i] = i; (C) int[] badpassword = new int[5]; for(int i=0; i<=badpassword.length(); i++){ badpassword[i] = i; (D) int[] badpassword = {1,2,3,4,5; (E) int[] badpassword = new int[5]; for(int i=1; i<6; i++){ badpassword[i-1] = i; For questions 31 to 34 use the following code. See the appendix for a description of Arrays.toString() which is used below to print the array contents. import java.util.arrays; public class MidtermCode{ public static void main(string[] args){ int[] a = {1,2,3,4,5; int[] b = {5,4,3,2,1; int[] c = merge(a, b); System.out.println(Arrays.toString(c)); public static int[] merge(int[] a, int[] b){ int[] c = new int[a.length+b.length]; for(int i=0; i<c.length; i++){ if(i>=a.length){ c[i] = b[i-a.length]; else{ c[i] = a[i]; return c; 31. What is displayed on the console after the System.out.println() call in the main method? (A) [1, 2, 3, 4, 5, 5, 4, 3, 2, 1] (B) [5, 4, 3, 2, 1, 1, 2, 3, 4, 5] (C) Nothing, there is run time error (D) [1, 2, 3, 4, 5, 1, 2, 3, 4, 5]

COMP-202A - Fall 2015 - Midterm Examination - Version-1 Page 11 (E) [5, 4, 3, 2, 1, 5, 4, 3, 2, 1] 32. If we change if(i >= a.length) to if(i > a.length), what is displayed on the console after the System.out.println() call in the main method? (A) [5, 4, 3, 2, 1, 5, 4, 3, 2, 1] (B) Nothing, there is run time error (C) [1, 2, 3, 4, 5, 1, 2, 3, 4, 5] (D) [5, 4, 3, 2, 1, 1, 2, 3, 4, 5] (E) [1, 2, 3, 4, 5, 5, 4, 3, 2, 1] 33. If we change c[i] = b[i a.length] to c[i] = b[i a.length 1], what is displayed on the console after the System.out.println() call in the main method (assume the change from the previous question was reversed). (A) [5, 4, 3, 2, 1, 1, 2, 3, 4, 5] (B) [5, 4, 3, 2, 1, 5, 4, 3, 2, 1] (C) [1, 2, 3, 4, 5, 5, 4, 3, 2, 1] (D) [1, 2, 3, 4, 5, 1, 2, 3, 4, 5] (E) Nothing, there is run time error 34. If we change c[i] = b[i a.length] to c[i] = b[b.length + a.length i 1], what is displayed on the console after the System.out.println() call in the main method? (assume the change from the previous question was reversed). (A) [1, 2, 3, 4, 5, 5, 4, 3, 2, 1] (B) Nothing, there is run time error (C) [5, 4, 3, 2, 1, 1, 2, 3, 4, 5] (D) [1, 2, 3, 4, 5, 1, 2, 3, 4, 5] (E) [5, 4, 3, 2, 1, 5, 4, 3, 2, 1] 35. Consider the following method signature public static double mymethod(int a, double b) Which of the following are valid ways to call the method? Shade in ALL valid answers on your scantron. (A) mymethod(3.0, mymethod(2, 4)); (B) int x = (int)mymethod(1, 2); (C) mymethod(3, (double) mymethod(2, 4)); (D) System.out.println(myMethod(4.0, 3)); (E) mymethod(3, mymethod(2, 4)); 36. Suppose you have a method that returns double. Which of the following is NOT a valid return statement inside this method? Note: there is only one correct answer. (A) return (int)3.0; (B) return 3; (C) return 3 ; (D) return 3.0; (E) return (double)"3";

COMP-202A - Fall 2015 - Midterm Examination - Version-1 Page 12 37. Consider the following method signature public static double mymethod(int[] a) Which of the following are valid ways to call the method. If the call results in a run or compile time error, this is not a valid call. Shade in ALL valid answers on your scantron. (A) int[][] a = {{1, 2, 3, {2, 3, 4; mymethod(a[a.length]); (B) int[][] a = {{1, {2; mymethod(a); (C) int[] a = {1, 2, 3, 4, 5; mymethod(a); (D) int[][] a = {{1, {2; mymethod(a[0]); (E) double[] a = {1, 2, 3.0, 4.0, 5.0; mymethod(a); 38. What is the value of the variable y after the following snippet of code executes? double x = 1.5; double y = (int)x; x =.5; (A) 1.0 (B) 0.5 (C) 1.5 (D) 0.0 (E) 2.0 39. Which of the following Java expressions does NOT have a value of 0? (A) (int)(-.5); (B) (int).5; (C) 1 / 2; (D) (double)(1/2); (E) (double)1/2; 40. What does the following code print? String s = "12345"; for (int i = 0; i < s.length(); i++) { s.charat(i) = s.charat((i + 1) % s.length()); (A) This code will not run. There is a compile-time error. (B) This code will not run. There is a run-time error. (C) 23451 (D) 51234 (E) 23452

COMP-202A - Fall 2015 - Midterm Examination - Version-1 Page 13 Long Answer Questions (30 points total) For this question, you will write several methods for your own Math class. These should all be inside a class called Hypotenuse. Write these methods on the provided paper. If you run out of space, more paper will be provided. Make sure that your name and student number are written on the extra paper. Write a method called absval. This method takes as input a real number and outputs the absolute value of that number. For example absval(3.5) should return 3.5, absval(-4) should return 4, and absval(0) should return 0. You may NOT use any library methods to help for this question. Write a method called power. This method takes as input a real number, x, and an integer number, y. It outputs the real number to the power of the integer number, x y. You can assume that the exponent (the integer, y) is non-negative (but it might be 0). You may NOT use any library methods to help for this question. Write a method called squareroot. This method takes as input a real number, y, and outputs its square root, y. You will do this using the Babylonian method described in detail below. You may NOT use any library methods to help for this question. The Babylonian method for approximating the square root of a number works by making successive guesses (denoted by x 0, x 1,...x k below) which get closer and closer to the actual value. Once the difference between successive guesses is very small, the method stops and the final guess is considered to be the answer. The first guess :x 0 = y 2 Subsequent guesses: Repeat x k+1 = 1 2 (x k + y x k ) Stop when the difference between successive values of x k and x k+1 is less than 0.1. The answer is the last value of x k+1. For this question, if the method input is negative, you should take the absolute value of the input before computing the square root. Do this using the absval method you wrote in part 1. Inside of the class Hypotenuse, write a main method. Your method will ask the user for two floating point numbers as input and obtain them using a Scanner type variable. These numbers correspond to the base and the height of a right angle triangle. It then calculates and prints the length of the hypotenuse. Recall that c 2 = a 2 + b 2 where c is the length of the hypotenuse and a and b are the lengths of the base and the height. Use the power and squareroot methods that you wrote previously to do this.

COMP-202A - Fall 2015 - Midterm Examination - Appendix Page 14 SUMMARY OF JAVA STANDARD LIBRARY METHODS FOR SELECTED CLASSES Arrays (package java.util.arrays Methods: public int[] copyofrange(int[] original, int from, int to): Returns a subset of the original starting at from and finishing at to, excluding to. to might lie outside of the array. String (package java.lang) Methods: public boolean equals(object anobject): Compares this String to anobject. public int length(): Calculates the length of this String. public char charat(int i): Gets the char at position i of the String. Note that counting starts from 0 so that to get the first character of the String you should input i equals 0. public boolean equalsignorecase(string anotherstring): Compares, ignoring case considerations, this String to anotherstring. public int compareto(string anotherstring): Compares this String to anotherstring lexicographically; returns a negative value if this String occurs before anotherstring, a positive value if this String occurs after anotherstring, and 0 if both Strings are equal. public int comparetoignorecase(string anotherstring): Compares, ignoring case considerations, this String to anotherstring lexicographically; returns a negative value if this String occurs before anotherstring, a positive value if this String occurs after anotherstring, and 0 if both Strings are equal. public String substring(int start, int finish): Returns a new String composed of the this String starting from index start and up to, but not including index of finish public String replace(char c, char d) : Returns a new String with all occurrences of the character c in the this String replaced by the character d. public char[] tochararray(): Converts this String to a new character array. File (package java.io) Methods: public FileSstring pathname): Creates a new File instance that corresponds to the given pathname. Scanner (package java.util) Methods: public Scanner(Inputstream source): Constructs a new Scanner that produces values scanned from the specified input stream. public Scanner(File f): Constructs a new Scanner that produces values scanned from the specified File public double nextdouble(): Scans the next token of the input as a double. public boolean nextboolean(): Scans the next token of the input as a boolean. public int nextint(): Scans the next token of the input as an int. public String nextline(): Advances this Scanner past the current line and returns the input read. public boolean hasnextline(): Checks whether there are further lines left to scan. PrintStream (package java.io) Methods: public void print(boolean b): Prints boolean value b. public void print(double d): Prints double value d. public void print(int i): Prints int value i. public void print(object o): Prints Object o. public void print(string s): Prints String s. public void println(): Terminates the current line by writing the line separator string. public void println(boolean b): Prints boolean value b and then terminates the line. public void println(double d): Prints double value d and then terminates the line. public void println(int i): Prints int value i and then terminates the line. public void println(object o): Prints Object o and then terminates the line. public void println(string s): Prints String s and then terminates the line. Math (package java.lang) Methods: public static double pow(double a, double b): Returns the value of a raised to the power of b. public static double sqrt(double a): Returns the correctly rounded positive square root of double value a. public static double random(): Returns a double value with a positive sign, greater than or equal to 0.0 and less than 1.0. public static double exp(double a): Returns Euler s number e raised to the power of double value a. (base e) of double value a. of double value a.