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

Size: px
Start display at page:

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

## Transcription

1 CSC Algorithms and Data Structures I Midterm Examination February 25, 2016 Name: Question Value Score TOTAL 100 Please answer questions in the spaces provided. If you make a mistake or for some other reason need more space, please use the back of pages and clearly indicate where the answer can be found. Good luck!

2 1. [ /10] What output is produced by the following program? public class TraceThis public static void main (String[] args) int x = 10; int a = 20; int b = 30; x = a; a = b; b = 40; System.out.println("What gets printed? "); System.out.println("x = " + x + " a = " + a + " b = " + b); System.out.print ("Let\'s do this \none\n\"last time\" "); System.out.println (".\nplease count the \"\\\\\"s carefully!"); System.out.println ("Version 1 numbers: " ); System.out.println ("Version 2 numbers: " + "4 + 6"); System.out.println ("Version 3 numbers: " + (4 + 6)); Output:

3 2. ( / 10) a) Which of the following code fragments correctly executes three assignments if the condition is true? Mark the correct one and explain your answer, briefly. i) if (x < 0) a = b * 2; y = x; z = a y; ii) if (x < 0) a = b * 2; y = x; z = a y; iii) if (x < 0) a = b * 2; y = x; z = a y; iv) if (x < 0) a = b * 2; y = x; z = a y ; b) Which of the code fragments below will add 1 to x if x is positive and subtract 1 from x if x is negative, but leave x alone if x is 0? Explain your answer, briefly. i) if (x > 0) x++; else x--; ii) if (x == 0) x = 0; else x++; x--; iii) x++; x--; iv) if (x > 0) x++; else if (x < 0) x--;

4 3. ( / 10) What gets printed? Please show output as it will appear, or indicate NO OUTPUT, or show some of the output followed by INFINITE LOOP. int a = 0; Output: while (a > 0) System.out.println(a); a = a + 3; int a = 5; Output: while (a >= 5) System.out.println(a); a++; int a = 4; Output: while (a > 0) System.out.println(a * 2); a--; String word = "ILLUSION"; int x = 0; while (x < word.length()) System.out.print(word.charAt(x)); System.out.print(word.charAt(x)); x++; Output:

5 4. ( / 10) Using the coordinate system below representing the graphics area of an applet, 4. ( / 10) Using the coordinate system below representing the graphics area of an applet, draw the graphics displayed by the applet, identifying positions MID and TOP (in terms of their use in the applet), and the shapes RECTANGLE, OVAL, LINE. import javax.swing.japplet; public class Quiz4 extends JApplet // // Draws something... // public void paint (Graphics page) final int MID = 40; // MID final int TOP = 20; // TOP page.drawoval (-20, -20, 40,40 ); page.drawrect (MID, TOP, 20, 40); page.drawline (0, 40, 20, 0); // OVAL // RECTANGLE // LINE

6 5. ( / 10) Suppose you look up a class in the Java API and find the following info about the (alas, made-up!) SpringBreak class: java.exam Class SpringBreak java.lang.object java.exam.springbreak Constructor Summary SpringBreak() Creates a new SpringBreak object. Method Summary void destination(string x) static boolean shouldistayorshouldigo(double x) a) Write some code to declare variables for two objects of this class, named thing1 and thing2. b) Circle all of the following that are valid Java statements: SpringBreak.destination = Puerto Vallarta ; thing1.destination( Cancun ); thing2.destination(thing1); SpringBreak.destination( Miami ); System.out.print(thing2.destination( Cancun )); thing2.shouldistayorshouldigo(21.6) = true; System.out.print(SpringBreak.shouldIStayOrShouldIGo(32.4));

7 6. [ /10] a) Given the following declarations: int iresult, num1 = 7, num2 = 3; double fresult, val1 = 9.0; boolean status, part1 = false; What result is stored by each of the following assignment statements? Source code Result stored fresult = (num1 + 2)/ 2; iresult = num1 % num2; fresult = val1 / 2; fresult = (double) num1 / 2; status = part1 && (num1 > num2); status = part1 (num1 > num2);

8 7. [ /10] Short answer questions. a) Given a Random object named gen, what range of values are produced by the following expressions? gen.nextint(4) gen.nextint(20) gen.nextint(4) 15 b) Write some code that uses the object gen, above, to generate pseudorandom numbers in the following specified ranges (including the endpoints): 0 to 9-2 to 5 c) Suppose the String variable message is already initialized. Write a Java code fragment that prints out message, one char per line. d) Write some code that uses the Math class to compute and print out the value of sin(π/2).

9 8. ( / 10) Complete the java code below so that it prints a table for the Investment problem: You put an initial amount (say, \$10,000) into a bank account that earns 5% interest per year. Show the yearly returns on your investment until it doubles. year interest balance 0 \$10, \$ \$10, \$ \$11, \$ \$ import java.text.numberformat; import java.util.scanner; public class Investment public static void main (String[] args) Scanner scan = new Scanner(System.in); 4 \$ \$12, (keep going until balance >= \$20000) System.out.print("Enter initial balance:"); double initial = scan.nextdouble(); int year = 0; double rate = 0.05; double balance = initial; NumberFormat money = NumberFormat.getCurrencyInstance(); System.out.println("year\tinterest\tbalance"); System.out.println (year + "\t" + " " + "\t" + money.format(balance));

10 9. [ / 10] Write a complete Java program that asks the user to input three integers and then prints the maximum value among the numbers entered. (For example, if the three numbers entered are 7, 43, 7, the program should print 43 as the maximum. Be sure to write a complete Java program, including class definition, variable and constant declarations, as appropriate, and proper indentation, to make it readable. Include one simple comment describing what the program does (no need need to write lots of comments).

11 10. [ / 10] Construct an algorithm that inputs some positive numbers from the user, terminated with a zero (sentinel value). The algorithm should print the numbers entered and compute and print their sum. After the sum is printed, print a goodbye message. Example: If the numbers are entered as input, the algorithm should print: Sum = 10 Goodbye [Note that the terminating zero should NOT be printed.] Directions: Write your algorithm by rearranging and structuring elements chosen from the list below, using indentation to show structure. Do not use anything else and note that not all of these are needed, but you may use one of them more than once, if necessary. input num input sum num = 0 sum = 0 count = 0 num = num + 1 sum = sum + 1 count = count + 1 sum = sum + num sum = num + 1 if (sum == num) if (sum < num) if (num < sum) else while (num < sum) while (sum < num) while (count < sum) while (num!= 0) while (num!= sum) print Sum = sum print num print Goodbye

12 REFERENCE MATERIAL Y 20 Y 10 Drawing a Line 150 Start% x%%%%%%%y% End% x%%%%%%%y% page.drawline (10, 20, 150, 45); page.drawline (150, 45, 10, 20); Drawing an Oval page.drawoval (175, 20, 50, 80); X X Drawing a Rectangle 50 X Y Start% x%%%%%%%y% Width%%%%Height% page.drawrect (50, 20, 100, 40); Drawing an Arc An arc is defined by an oval, a start angle, and an arc angle:

13 REFERENCE MATERIAL Random class double nextdouble() Returns the next pseudorandom, uniformly distributed double value between 0.0 and 1.0 int nextint() Returns the next pseudorandom, uniformly distributed int value from this random number generator's sequence. int nextint(int n) Returns a pseudorandom, uniformly distributed int value between 0 (inclusive) and the specified value (exclusive), drawn from this random number generator's sequence. Some methods and constants of the Math class static double abs(double a) Returns the absolute value of a double value. static double cos(double a) Returns the trigonometric cosine of an angle. static double pow(double a, double b) Returns the value of the first argument raised to the power of the second argument. static double random() Returns a double value greater than or equal to 0.0 and less than 1.0. static long round(double a) Returns the closest long to the argument. static double sin(double a) Returns the trigonometric sine of an angle. static double sqrt(double a) Returns the correctly rounded positive square root of a double value. static double PI static double E Value of π (constant) Value of e (constant) String class boolean isempty() Returns true if, and only if, length() is 0. char charat(int index) Returns the char value at the specified index. int length() Returns the length of this string. String touppercase() Converts all of the characters in this String to upper case using the rules of the default locale.

14

15 CSC Algorithms and Data Structures I Midterm Examination February 25, 2016 Name: Question Value Score TOTAL 100 Please answer questions in the spaces provided. If you make a mistake or for some other reason need more space, please use the back of pages and clearly indicate where the answer can be found. Good luck!

16 1. [ /10] What output is produced by the following program? public class TraceThis public static void main (String[] args) int x = 10; int a = 20; int b = 30; x = a; a = b; b = 40; System.out.println("What gets printed? "); System.out.println("x = " + x + " a = " + a + " b = " + b); System.out.print ("Let\'s do this \none\n\"last time\" "); System.out.println (".\nplease count the \"\\\\\"s carefully!"); System.out.println ("Version 1 numbers: " ); System.out.println ("Version 2 numbers: " + "4 + 6"); System.out.println ("Version 3 numbers: " + (4 + 6)); Output:

17 2. ( / 10) a) Which of the following code fragments correctly executes three assignments if the condition is true? Mark the correct one and explain your answer, briefly. i) if (x < 0) a = b * 2; y = x; z = a y; ii) if (x < 0) a = b * 2; y = x; z = a y; iii) if (x < 0) a = b * 2; y = x; z = a y; iv) if (x < 0) a = b * 2; y = x; z = a y ; b) Which of the code fragments below will add 1 to x if x is positive and subtract 1 from x if x is negative, but leave x alone if x is 0? Explain your answer, briefly. i) if (x > 0) x++; else x--; ii) if (x == 0) x = 0; else x++; x--; iii) x++; x--; iv) if (x > 0) x++; else if (x < 0) x--;

18 3. ( / 10) What gets printed? Please show output as it will appear, or indicate NO OUTPUT, or show some of the output followed by INFINITE LOOP. int a = 0; Output: while (a > 0) System.out.println(a); a = a + 3; int a = 5; Output: while (a >= 5) System.out.println(a); a++; int a = 4; Output: while (a > 0) System.out.println(a * 2); a--; String word = "ILLUSION"; int x = 0; while (x < word.length()) System.out.print(word.charAt(x)); System.out.print(word.charAt(x)); x++; Output:

19 4. ( / 10) Using the coordinate system below representing the graphics area of an applet, draw the graphics displayed by the applet, identifying positions MID and TOP (in terms of their use in the applet), and the shapes RECTANGLE, OVAL, LINE. import javax.swing.japplet; import java.awt.*; public class Quiz4 extends JApplet // // Draws something... // public void paint (Graphics page) final int MID = 40; // MID final int TOP = 20; // TOP page.drawoval (MID-10, TOP-20, 20,40); // OVAL page.drawrect (0, 0, 30, 40); // RECTANGLE page.drawline (0, 60, 100, 60); // LINE

20 5. ( / 10) Suppose you look up a class in the Java API and find the following info about the (alas, made-up!) SpringBreak class: java.exam Class SpringBreak java.lang.object java.exam.springbreak Constructor Summary SpringBreak() Creates a new SpringBreak object. Method Summary void destination(string x) static boolean shouldistayorshouldigo(double x) a) Write some code to declare variables for two objects of this class, named thing1 and thing2. b) Circle all of the following that are valid Java statements: SpringBreak.destination = Puerto Vallarta ; thing1.destination( Cancun ); thing2.destination(thing1); SpringBreak.destination( Miami ); System.out.print(thing2.destination( Cancun )); thing2.shouldistayorshouldigo(21.6) = true; System.out.print(SpringBreak.shouldIStayOrShouldIGo(32.4));

21 6. [ /10] a) Given the following declarations: int iresult, num1 = 7, num2 = 3; double fresult, val1 = 9.0; boolean status, part1 = false; What result is stored by each of the following assignment statements? Source code Result stored fresult = (num1 + 2)/ 2; iresult = num1 % num2; fresult = val1 / 2; fresult = (double) num1 / 2; status = part1 && (num1 > num2); status = part1 (num1 > num2);

22 7. [ /10] Short answer questions. a) Given a Random object named gen, what range of values are produced by the following expressions? gen.nextint(4) gen.nextint(20) gen.nextint(4) 15 b) Write some code that uses the object gen, above, to generate pseudorandom numbers in the following specified ranges (including the endpoints): 0 to 9-2 to 5 c) Suppose the String variable message is already initialized. Write a Java code fragment that prints out message, one char per line. d) Write some code that uses the Math class to compute and print out the value of sin(π/2).

23 8. ( / 10) Complete the java code below so that it prints a table for the Investment problem: You put an initial amount (say, \$10,000) into a bank account that earns 5% interest per year. Show the yearly returns on your investment until it doubles. year interest balance 0 \$10, \$ \$10, \$ \$11, \$ \$ import java.text.numberformat; import java.util.scanner; public class Investment public static void main (String[] args) Scanner scan = new Scanner(System.in); 4 \$ \$12, (keep going until balance >= \$20000) System.out.print("Enter initial balance:"); double initial = scan.nextdouble(); int year = 0; double rate = 0.05; double balance = initial; NumberFormat money = NumberFormat.getCurrencyInstance(); System.out.println("year\tinterest\tbalance"); System.out.println (year + "\t" + " " + "\t" + money.format(balance));

24 9. [ / 10] Write a complete Java program that asks the user to input three integers and then prints the maximum value among the numbers entered. (For example, if the three numbers entered are 7, 43, 7, the program should print 43 as the maximum. Be sure to write a complete Java program, including class definition, variable and constant declarations, as appropriate, and proper indentation, to make it readable. Include one simple comment describing what the program does (no need need to write lots of comments).

25 10. [ / 10] Construct an algorithm that inputs some positive numbers from the user, terminated with a zero (sentinel value). The algorithm should print the numbers entered and compute and print their sum. After the sum is printed, print a goodbye message. Example: If the numbers are entered as input, the algorithm should print: Sum = 10 Goodbye [Note that the terminating zero should NOT be printed.] Directions: Write your algorithm by rearranging and structuring elements chosen from the list below, using indentation to show structure. Do not use anything else and note that not all of these are needed, but you may use one of them more than once, if necessary. input num input sum num = 0 sum = 0 count = 0 num = num + 1 sum = sum + 1 count = count + 1 sum = sum + num sum = num + 1 if (sum == num) if (sum < num) if (num < sum) else while (num < sum) while (sum < num) while (count < sum) while (num!= 0) while (num!= sum) print Sum = sum print num print Goodbye

26 REFERENCE MATERIAL Y 20 Y 10 Drawing a Line 150 Start% x%%%%%%%y% End% x%%%%%%%y% page.drawline (10, 20, 150, 45); page.drawline (150, 45, 10, 20); Drawing an Oval page.drawoval (175, 20, 50, 80); X X Drawing a Rectangle 50 X Y Start% x%%%%%%%y% Width%%%%Height% page.drawrect (50, 20, 100, 40); Drawing an Arc An arc is defined by an oval, a start angle, and an arc angle:

27 REFERENCE MATERIAL Random class double nextdouble() Returns the next pseudorandom, uniformly distributed double value between 0.0 and 1.0 int nextint() Returns the next pseudorandom, uniformly distributed int value from this random number generator's sequence. int nextint(int n) Returns a pseudorandom, uniformly distributed int value between 0 (inclusive) and the specified value (exclusive), drawn from this random number generator's sequence. Some methods and constants of the Math class static double abs(double a) Returns the absolute value of a double value. static double cos(double a) Returns the trigonometric cosine of an angle. static double pow(double a, double b) Returns the value of the first argument raised to the power of the second argument. static double random() Returns a double value greater than or equal to 0.0 and less than 1.0. static long round(double a) Returns the closest long to the argument. static double sin(double a) Returns the trigonometric sine of an angle. static double sqrt(double a) Returns the correctly rounded positive square root of a double value. static double PI static double E Value of π (constant) Value of e (constant) String class boolean isempty() Returns true if, and only if, length() is 0. char charat(int index) Returns the char value at the specified index. int length() Returns the length of this string. String touppercase() Converts all of the characters in this String to upper case using the rules of the default locale.

28

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

CSC 1051 Algorithms and Data Structures I Midterm Examination February 25, 2016 Name: KEY A Question Value Score 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 10 TOTAL 100 Please answer questions in

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

CSC 1051 Algorithms and Data Structures I Midterm Examination February 26, 2015 Name: Key Question Value 1 10 Score 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 10 TOTAL 100 Please answer questions in the

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

CSC 1051 Algorithms and Data Structures I Midterm Examination March 2, 2017 Name: Question Value Score 1 10 2 10 3 20 4 20 5 20 6 20 TOTAL 100 Please answer questions in the spaces provided. If you make

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

CSC 1051 Algorithms and Data Structures I Midterm Examination October 9, 2014 Name: KEY Question Value Score 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 10 TOTAL 100 Please answer questions in the

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

CSC 1051 Algorithms and Data Structures I Midterm Examination October 6, 2016 Name: Question Value Score 1 20 2 20 3 20 4 20 5 20 TOTAL 100 Please answer questions in the spaces provided. If you make a

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

CSC 1051 Algorithms and Data Structures I Midterm Examination October 7, 2013 Name: Question Value Score 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 10 TOTAL 100 Please answer questions in the spaces

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

CSC 1051 Algorithms and Data Structures I Midterm Examination October 11, 2018 Name: KEY Question Value Score 1 20 2 20 3 20 4 20 5 20 TOTAL 100 Please answer questions in the spaces provided. If you make

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

CSC 1051 Algorithms and Data Structures I Midterm Examination March 1, 2018 Name: KEY A Question Value Score 1 20 2 20 3 20 4 20 5 20 TOTAL 100 Please answer questions in the spaces provided. If you make

### CSC 1051 Algorithms and Data Structures I. Midterm Examination February 24, Name: KEY 1

CSC 1051 Algorithms and Data Structures I Midterm Examination February 24, 2014 Name: KEY 1 Question Value Score 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 10 TOTAL 100 Please answer questions in

### CSC 1051 Algorithms and Data Structures I. Final Examination May 12, Name

CSC 1051 Algorithms and Data Structures I Final Examination May 12, 2017 Name Question Value Score 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 10 TOTAL 100 Please answer questions in the spaces provided.

### CSC 1051 Algorithms and Data Structures I. Final Examination May 12, Name: KEY. Question Value Score

CSC 1051 Algorithms and Data Structures I Final Examination May 12, 2017 Name: KEY Question Value Score 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 10 TOTAL 100 Please answer questions in the spaces

### CSC 1051 Algorithms and Data Structures I. Final Examination May 2, Name:

CSC 1051 Algorithms and Data Structures I Final Examination May 2, 2016 Name: Question Value Score 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 10 TOTAL 100 Please answer questions in the spaces provided.

### CSC 1051 Algorithms and Data Structures I. Final Examination May 2, Name: Question Value Score

CSC 1051 Algorithms and Data Structures I Final Examination May 2, 2016 Name: Question Value Score 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 10 TOTAL 100 Please answer questions in the spaces provided.

### CSC 1051 Algorithms and Data Structures I. Final Examination December 17, Name:

CSC 1051 Algorithms and Data Structures I Final Examination December 17, 2013 Name: Question Value 1 10 Score 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 20 TOTAL 100 Please answer questions in the spaces provided.

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

First Name: Last Name: McGill ID: Section: Faculty of Science COMP-202A - Introduction to Computing I (Fall 2009) - All Sections Midterm Examination Tuesday, November 3, 2009 Examiners: Mathieu Petitpas

### Chapter 2 Exercise Solutions

Chapter 2 Exercise Solutions EX 2.1. EX 2.2. EX 2.3. EX 2.4. EX 2.5. Explain the following programming statement in terms of objects and the services they provide. System.out.println ("I gotta be me!");

### CIS 1068 Design and Abstraction Spring 2017 Midterm 1a

Spring 2017 Name: TUID: Page Points Score 1 28 2 18 3 12 4 12 5 15 6 15 Total: 100 Instructions The exam is closed book, closed notes. You may not use a calculator, cell phone, etc. i Some API Reminders

### CSC 1051 Algorithms and Data Structures I. Final Examination May 2, Name:

CSC 1051 Algorithms and Data Structures I Final Examination May 2, 2015 Name: Question Value 1 10 Score 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 20 TOTAL 100 Please answer questions in the spaces provided.

### CSC 1051 Data Structures and Algorithms I

Repetition CSC 1051 Data Structures and Algorithms I Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University Course website: www.csc.villanova.edu/~map/1051/ Some slides in this

### CSC 1051 Data Structures and Algorithms I

Repetition CSC 1051 Data Structures and Algorithms I Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University Course website: www.csc.villanova.edu/~map/1051/ Some slides in this

### Practice Midterm 1. Problem Points Score TOTAL 50

CS 120 Software Design I Spring 2019 Practice Midterm 1 University of Wisconsin - La Crosse February 25 NAME: Do not turn the page until instructed to do so. This booklet contains 10 pages including the

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

First Name: Last Name: McGill ID: Section: Faculty of Science COMP-202B - Introduction to Computing I (Winter 2010) - All Sections Midterm Examination Thursday, March 11, 2010 Examiners: Milena Scaccia

### Using Java Classes Fall 2018 Margaret Reid-Miller

Using Java Classes 15-121 Fall 2018 Margaret Reid-Miller Today Strings I/O (using Scanner) Loops, Conditionals, Scope Math Class (random) Fall 2018 15-121 (Reid-Miller) 2 The Math Class The Math class

### CSC 1051 Data Structures and Algorithms I

Repetition CSC 1051 Data Structures and Algorithms I Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University Course website: www.csc.villanova.edu/~map/1051/ Some slides in this

### AYBUKE BUYUKCAYLI KORAY OZUYAR MUSTAFA SOYLU. Week 21/02/ /02/2007 Lecture Notes: ASCII

AYBUKE BUYUKCAYLI KORAY OZUYAR MUSTAFA SOYLU Week 21/02/2007-23/02/2007 Lecture Notes: ASCII 7 bits = 128 characters 8 bits = 256characters Unicode = 16 bits Char Boolean boolean frag; flag = true; flag

### Methods CSC 121 Fall 2016 Howard Rosenthal

Methods CSC 121 Fall 2016 Howard Rosenthal Lesson Goals Understand what a method is in Java Understand Java s Math Class and how to use it Learn the syntax of method construction Learn both void methods

### Java Coding 3. Over & over again!

Java Coding 3 Over & over again! Repetition Java repetition statements while (condition) statement; do statement; while (condition); where for ( init; condition; update) statement; statement is any Java

### CSC 1051 Villanova University. CSC 1051 Data Structures and Algorithms I. Course website:

Repetition CSC 1051 Data Structures and Algorithms I Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University Course website: www.csc.villanova.edu/~map/1051/ Some slides in this

### Methods CSC 121 Spring 2017 Howard Rosenthal

Methods CSC 121 Spring 2017 Howard Rosenthal Lesson Goals Understand what a method is in Java Understand Java s Math Class and how to use it Learn the syntax of method construction Learn both void methods

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

First Name: Last Name: McGill ID: Section: Faculty of Science COMP-202A - Foundations of Computing (Fall 2012) - All Sections Midterm Examination November 7th, 2012 Examiners: Daniel Pomerantz [Sections

### AP CS Unit 3: Control Structures Notes

AP CS Unit 3: Control Structures Notes The if and if-else Statements. These statements are called control statements because they control whether a particular block of code is executed or not. Some texts

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

COMP-202B - Introduction to Computing I (Winter 2011) - All Sections Example Questions for In-Class Quiz The in-class quiz is intended to give you a taste of the midterm, give you some early feedback about

### CSC 1051 Algorithms and Data Structures I. Final Examination December 18, Name:

CSC 1051 Algorithms and Data Structures I Final Examination December 18, 2015 Name: Question Value Score 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 10 TOTAL 100 Please answer questions in the spaces

### Practice Midterm 1 Answer Key

CS 120 Software Design I Fall 2018 Practice Midterm 1 Answer Key University of Wisconsin - La Crosse Due Date: October 5 NAME: Do not turn the page until instructed to do so. This booklet contains 10 pages

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

Outline Chapter 3 Using APIs 3.1 Anatomy of an API 3.1.1 Overall Layout 3.1.2 Fields 3.1.3 Methods 3.2 A Development Walkthrough 3.2.1 3.2.2 The Mortgage Application 3.2.3 Output Formatting 3.2.4 Relational

### Happy Cinco de Mayo!!!!

CSC 1051 Algorithms and Data Structures I Happy Cinco de Mayo!!!! Final Examination May 5, 2018 Name: Question Value Score 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 20 TOTAL 100 Please answer questions

### DUBLIN CITY UNIVERSITY

DUBLIN CITY UNIVERSITY REPEAT EXAMINATIONS 2008 MODULE: Object-oriented Programming I - EE219 COURSE: B.Eng. in Electronic Engineering (Year 2 & 3) B.Eng. in Information Telecomms Engineering (Year 2 &

### DUBLIN CITY UNIVERSITY

DUBLIN CITY UNIVERSITY SEMESTER ONE EXAMINATIONS 2007 MODULE: Object Oriented Programming I - EE219 COURSE: B.Eng. in Electronic Engineering B.Eng. in Information Telecommunications Engineering B.Eng.

### CSCI 2010 Principles of Computer Science. Basic Java Programming. 08/09/2013 CSCI Basic Java 1

CSCI 2010 Principles of Computer Science Basic Java Programming 1 Today s Topics Using Classes and Objects object creation and object references the String class and its methods the Java standard class

### COMP 202 Java in one week

CONTENTS: Basics of Programming Variables and Assignment Data Types: int, float, (string) Example: Implementing a calculator COMP 202 Java in one week The Java Programming Language A programming language

### CSC 1051 Data Structures and Algorithms I. Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University

Graphics & Applets CSC 1051 Data Structures and Algorithms I Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University Course website: www.csc.villanova.edu/~map/1051/ Back to Chapter

### Computer Science 145 Midterm 1 Fall 2016

Computer Science 145 Midterm 1 Fall 2016 Doodle here. This is a closed-book, no-calculator, no-electronic-devices, individual-effort exam. You may reference one page of handwritten notes. All answers should

### Chapter 3. Selections

Chapter 3 Selections 1 Outline 1. Flow of Control 2. Conditional Statements 3. The if Statement 4. The if-else Statement 5. The Conditional operator 6. The Switch Statement 7. Useful Hints 2 1. Flow of

### Programming with Java

Programming with Java Data Types & Input Statement Lecture 04 First stage Software Engineering Dep. Saman M. Omer 2017-2018 Objectives q By the end of this lecture you should be able to : ü Know rules

### 4. Java Project Design, Input Methods

4-1 4. Java Project Design, Input Methods Review and Preview You should now be fairly comfortable with creating, compiling and running simple Java projects. In this class, we continue learning new Java

### Introduction to Computer Science Unit 2. Notes

Introduction to Computer Science Unit 2. Notes Name: Objectives: By the completion of this packet, students should be able to describe the difference between.java and.class files and the JVM. create and

### Computer Science 145

Name: Computer Science 145 Final Exam Answer Sheet Fall 2016 1. a b c d 8. 2. a b c d 9. a b c d 3. a b c d e 10. a b c d 4. a b c d 11. 5. a b c d 12. 6. 13. 7. 14. a b c d 15. 16. 17. 1 18. 19. 2 20.

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

Computer Sciences 200 Midterm Exam 2 Thursday, November 15th, 2018 100 points (15% of final grade) Instructors: Jim Williams and Marc Renault (Family) Last Name: (Given) First Name: CS Login Name: NetID

### Data Representation and Applets

Data Representation and Applets CSC 1051 Data Structures and Algorithms I Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University Overview Binary representation Data types revisited

### AL GHURAIR UNIVERSITY College of Computing. Objectives: Examples: Text-printing program. CSC 209 JAVA I

AL GHURAIR UNIVERSITY College of Computing CSC 209 JAVA I week 2- Arithmetic and Decision Making: Equality and Relational Operators Objectives: To use arithmetic operators. The precedence of arithmetic

### CS1004: Intro to CS in Java, Spring 2005

CS4: Intro to CS in Java, Spring 25 Lecture #8: GUIs, logic design Janak J Parekh janak@cs.columbia.edu Administrivia HW#2 out New TAs, changed office hours How to create an Applet Your class must extend

### Introduction to Computer Science Unit 2. Notes

Introduction to Computer Science Unit 2. Notes Name: Objectives: By the completion of this packet, students should be able to describe the difference between.java and.class files and the JVM. create and

### The Irving K. Barber School of Arts and Sciences COSC 111 Final Exam Winter Term II Instructor: Dr. Bowen Hui. Tuesday, April 19, 2016

First Name (Print): Last Name (Print): Student Number: The Irving K. Barber School of Arts and Sciences COSC 111 Final Exam Winter Term II 2016 Instructor: Dr. Bowen Hui Tuesday, April 19, 2016 Time: 6:00pm

### Happy Cinco de Mayo!!!!

CSC 1051 Algorithms and Data Structures I Happy Cinco de Mayo!!!! Final Examination May 5, 2018 Name: KEY Question Value Score 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 20 TOTAL 100 Please answer questions

### COMP-202 Unit 4: Programming With Iterations. CONTENTS: The while and for statements

COMP-202 Unit 4: Programming With Iterations CONTENTS: The while and for statements Introduction (1) Suppose we want to write a program to be used in cash registers in stores to compute the amount of money

### Applets and the Graphics class

Applets and the Graphics class CSC 2014 Java Bootcamp Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University Some slides in this presentation are adapted from the slides accompanying

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

COMP 202 Built in Libraries and objects CONTENTS: Introduction to objects Introduction to some basic Java libraries string COMP 202 Objects and Built in Libraries 1 Classes and Objects An object is an

### Lecture Static Methods and Variables. Static Methods

Lecture 15.1 Static Methods and Variables Static Methods In Java it is possible to declare methods and variables to belong to a class rather than an object. This is done by declaring them to be static.

### Midterm I - CSE11 Fall 2013 CLOSED BOOK, CLOSED NOTES 50 minutes, 100 points Total.

Midterm I - CSE11 Fall 2013 CLOSED BOOK, CLOSED NOTES 50 minutes, 100 points Total. Name: ID: Problem 1) (8 points) For the following code segment, what are the values of i, j, k, and d, after the segment

### Term 1 Unit 1 Week 1 Worksheet: Output Solution

4 Term 1 Unit 1 Week 1 Worksheet: Output Solution Consider the following what is output? 1. System.out.println("hot"); System.out.println("dog"); Output hot dog 2. System.out.print("hot\n\t\t"); System.out.println("dog");

### Object Oriented Programming. Java-Lecture 1

Object Oriented Programming Java-Lecture 1 Standard output System.out is known as the standard output object Methods to display text onto the standard output System.out.print prints text onto the screen

### Midterm Examination (MTA)

M105: Introduction to Programming with Java Midterm Examination (MTA) Spring 2013 / 2014 Question One: [6 marks] Choose the correct answer and write it on the external answer booklet. 1. Compilers and

### CSCI 1226 Sample Midterm Exam

CSCI 1226 Test #1 February 2017 General Instructions CSCI 1226 Sample Midterm Exam (A bit long since it combines parts of three earlier tests) Read and follow all directions carefully. Name: Student #:

### Java By Abstraction - Test-B (Chapters 1-6)

Java By Abstraction - Test-B (Chapters 1-6) Last Name First Name Do not write below this line B (60%) A (40%) TOTAL String Methods (invoke on a string s) boolean equals(string t) Returns true if s and

### M105: Introduction to Programming with Java Midterm Examination (MTA) Makeup Spring 2013 / 2014

M105: Introduction to Programming with Java Midterm Examination (MTA) Makeup Spring 2013 / 2014 Question One: Choose the correct answer and write it on the external answer booklet. 1. Java is. a. case

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

CIS 110 Introduction To Computer Programming February 29, 2012 Midterm Name: Recitation # (e.g. 201): Pennkey (e.g. bjbrown): My signature below certifies that I have complied with the University of Pennsylvania

### COMP 202. Java in one week

COMP 202 CONTENTS: Basics of Programming Variables and Assignment Data Types: int, float, (string) Example: Implementing a calculator Java in one week The Java Programming Language A programming language

### Using Classes and Objects

Using Classes and Objects CSC 1051 Data Structures and Algorithms I Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University Course website: www.csc.villanova.edu/~map/1051/ Today

### CS110: PROGRAMMING LANGUAGE I

CS110: PROGRAMMING LANGUAGE I Computer Science Department Lecture 8: Methods Lecture Contents: 2 Introduction Program modules in java Defining Methods Calling Methods Scope of local variables Passing Parameters

### Name CS/120 Sample Exam #1 -- Riley. a) Every program has syntax, which refers to the form of the code, and, which refers to the meaning of the code.

Name CS/120 Sample Exam #1 -- Riley Please show all of your work. 1. For each part below write the term, symbols, or phrase from class that best fits the description. (Each part is worth 2 points.) a)

### COE 211 Computer Programming. Welcome to Exam I Tuesday March 13, 2018

1 COE 211 Computer Programming Welcome to Exam I Tuesday March 13, 2018 Instructors: Dr. Dima El-khalil Dr. Wissam F. Fawaz Name: Student ID: Instructions: 1. This exam is Closed Book. Please do not forget

### CSC 1051 Data Structures and Algorithms I. Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University

Last Class CSC 1051 Data Structures and Algorithms I Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University Course website: www.csc.villanova.edu/~map/1051/ Some slides in this

### CSC 1051 Algorithms and Data Structures I. Final Examination December 20, Name: KEY. Question Value Score

CSC 1051 Algorithms and Data Structures I Final Examination December 20, 2016 Name: KEY Question Value Score 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 10 TOTAL 100 Please answer questions in the

### Chapter 4 Classes in the Java Class Libraries

Programming Fundamental I ACS-1903 Chapter 4 Classes in the Java Class Libraries 1 Random Random The Random class provides a capability to generate pseudorandom values pseudorandom because the stream of

### To define methods, invoke methods, and pass arguments to a method ( ). To develop reusable code that is modular, easy-toread, easy-to-debug,

1 To define methods, invoke methods, and pass arguments to a method ( 5.2-5.5). To develop reusable code that is modular, easy-toread, easy-to-debug, and easy-to-maintain. ( 5.6). To use method overloading

### CS111: PROGRAMMING LANGUAGE II

1 CS111: PROGRAMMING LANGUAGE II Computer Science Department Lecture 1: Introduction Lecture Contents 2 Course info Why programming?? Why Java?? Write once, run anywhere!! Java basics Input/output Variables

### COMP102: Test 1 Model Solutions

Family Name:.......................... Other Names:.......................... ID Number:............................ COMP102: Test 1 Model Solutions 27 July, 2007 Instructions Time allowed: 45 minutes.

### Java Classes: Random, Character A C S L E C T U R E 6

Java Classes: Random, Character A C S - 1903 L E C T U R E 6 Random An instance of the Random can be used to generate a stream of random values Typical process: 1. Create a Random object 2. Use the object

### Data Representation and Applets

Data Representation and Applets CSC 1051 Data Structures and Algorithms I Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University Course website: http://www.csc.villanova.edu/~map/1051/

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

First Name: Last Name: McGill ID: Section: Faculty of Science COMP-202A - Foundations of Computing (Fall 2013) - All Sections Midterm Examination November 11th, 2013 Examiners: Jonathan Tremblay [Sections

### Data Representation and Applets

Data Representation and Applets CSC 1051 Data Structures and Algorithms I Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University Course website: http://www.csc.villanova.edu/~map/1051/

### The Math Class (Outsource: Math Class Supplement) Random Numbers. Lab 06 Math Class

The (Outsource: Supplement) The includes a number of constants and methods you can use to perform common mathematical functions. A commonly used constant found in the Math class is Math.PI which is defined

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

First Name: Last Name: McGill ID: Section: Faculty of Science COMP-202A - Foundations of Computing (Fall 2013) - All Sections Midterm Examination November 11th, 2013 Examiners: Jonathan Tremblay [Sections

### Fundamentals of Programming Data Types & Methods

Fundamentals of Programming Data Types & Methods By Budditha Hettige Overview Summary (Previous Lesson) Java Data types Default values Variables Input data from keyboard Display results Methods Operators

### Classes and Objects Part 1

COMP-202 Classes and Objects Part 1 Lecture Outline Object Identity, State, Behaviour Class Libraries Import Statement, Packages Object Interface and Implementation Object Life Cycle Creation, Destruction

### Algorithms and Conditionals

Algorithms and Conditionals CSC 1051 Data Structures and Algorithms I Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University Course website: www.csc.villanova.edu/~map/1051/

### Lecture 6. Assignments. Summary - Variables. Summary Program Parts 1/29/18. Reading: 3.1, 3.2, 3.3, 3.4

Assignments Lecture 6 Complete for Project 1 Reading: 3.1, 3.2, 3.3, 3.4 Summary Program Parts Summary - Variables Class Header (class name matches the file name prefix) Class Body Because this is a program,

### Full file at

Chapter 2 Console Input and Output Multiple Choice 1) Valid arguments to the System.out object s println method include: (a) Anything with double quotes (b) String variables (c) Variables of type int (d)

### Java I/O and Control Structures

Java I/O and Control Structures CSC 2014 Java Bootcamp Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University Some slides in this presentation are adapted from the slides accompanying

### CS 302: INTRODUCTION TO PROGRAMMING. Lectures 7&8

CS 302: INTRODUCTION TO PROGRAMMING Lectures 7&8 Hopefully the Programming Assignment #1 released by tomorrow REVIEW The switch statement is an alternative way of writing what? How do you end a case in

### static int min(int a, int b) Returns the smaller of two int values. static double pow(double a,

The (Outsource: Supplement) The includes a number of constants and methods you can use to perform common mathematical functions. A commonly used constant found in the Math class is Math.PI which is defined

### Computational Expression

Computational Expression, Math Class, Wrapper Classes Janyl Jumadinova 18 February, 2019 Janyl Jumadinova Computational Expression 18 February, 2019 1 / 8 The Random class is part of the java.util package

### Chapter 2: Objects and Primitive Data

Chapter 2: Objects and Primitive Data Multiple Choice 1. c 2. e 3. d 4. b 5. a 6. e 7. b 8. c 9. d 10. b True/False 1. T 2. F 3. T 4. T 5. T 6. F 7. T 8. T Short Answer 2.1. Explain the following programming

### Using Classes and Objects

Using Classes and Objects CSC 1051 Data Structures and Algorithms I Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University Course website: www.csc.villanova.edu/~map/1051/ The

### Controls Structure for Repetition

Controls Structure for Repetition So far we have looked at the if statement, a control structure that allows us to execute different pieces of code based on certain conditions. However, the true power

### Lecture 6. Assignments. Java Scanner. User Input 1/29/18. Reading: 2.12, 2.13, 3.1, 3.2, 3.3, 3.4

Assignments Reading: 2.12, 2.13, 3.1, 3.2, 3.3, 3.4 Lecture 6 Complete for Lab 4, Project 1 Note: Slides 12 19 are summary slides for Chapter 2. They overview much of what we covered but are not complete.

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

CIS 1068 Program Design and Abstraction Spring2016 Midterm Exam 1 Name SOLUTION Page Points Score 2 15 3 8 4 18 5 10 6 7 7 7 8 14 9 11 10 10 Total 100 1 P age 1. Program Traces (41 points, 50 minutes)