Model Solutions. COMP 102: Test 2. 5 May, 2011
|
|
|
- Colin Jenkins
- 5 years ago
- Views:
Transcription
1 Family Name: Other Names: ID Number: Signature Instructions Time allowed: 45 minutes There are 45 marks in total. Answer all the questions. Model Solutions COMP 102: Test 2 5 May, 2011 Write your answers in the boxes in this test paper and hand in all sheets. You may ask for additional paper if you need it. If you think some question is unclear, ask for clarification. Brief Java documentation will be supplied with the test. This test will contribute 15% of your final grade, (But your mark will be boosted up to your exam mark if that is higher.) You may use paper translation dictionaries, and calculators without a full set of alphabet keys. You may write notes and working on this paper, but make sure it is clear where your answers are. Questions Marks 1. Basic Java [17] 2. Event Driven Input [8] 3. Defining Classes [10] 4. File Processing [10] TOTAL:
2 SPARE PAGE FOR EXTRA ANSWERS Cross out rough working that you do not want marked. Specify the question number for work that you do want marked. COMP 102 (Terms Test 2) 2 continued...
3 Student ID: Question 1. Basic Java [17 marks] (a) [4 marks] Consider the following numbers method public void numbers(){ int num = 1; int ans = 0; while (num < 5){ UI. println (ans); ans = ans + num; num = num + 1; UI. println ("finally " + ans); What will be printed if numbers() is called? finally 10 (b) [3 marks] Consider the following choose method public void choose(int a, int b, int c){ if (a < b) { UI. println ("Monday"); else if (a > b && b == c) { UI. println ("Wednesday"); else if (c == a c == b) { UI. println ("Friday"); else { UI. println ("the weekend"); What will be printed if choose(4, 7, 7) is called? Monday What will be printed if choose(7, 7, 4) is called? the weekend What will be printed if choose(7, 4, 7) is called? Friday COMP 102 (Terms Test 2) 3 continued...
4 (Question 1 continued) (c) [4 marks] Suppose the file called WordsAndNumbers.txt contains the following text: Hi 3 Program 2 Apple 4 Good 1 What will the following fileprint method print out? public void fileprint (){ try{ Scanner scan = new Scanner(new File("WordsAndNumbers.txt")); while (scan.hasnext()){ String w = scan.next(); int n = scan.nextint (); while (n > 0){ UI. print (w); n = n 1; UI. println (); scan.close(); catch(ioexception e){ui.println("fail: " + e); HiHiHi ProgramProgram AppleAppleAppleApple Good (Question 1 continued on next page) COMP 102 (Terms Test 2) 4 continued...
5 Student ID: (Question 1 continued) (d) [6 marks] Consider the Fish class shown below. What will the following fragment of code print out? Fish f1 = new Fish("Nino"); f1.report (); Fish f2 = new Fish("Blote"); f1.meet("debian"); f1.report (); f2.meet("dori"); f1.teem(5); f2.report (); f1.report (); Nino : 1 : - Nino : 2 : Debian Blote : 2 : Dori Nino : 7 : Nino public class Fish{ private String name; private int count; private String friend = "-"; public Fish(String nm){ this.name = nm; this.count = 1; public void report(){ UI. println (this.name + " : " + this.count + " : " + this.friend); public void meet(string str){ this. friend = str ; this.count = this.count + 1; public void teem(int n){ this. friend = this. name; this.count = this.count + n; COMP 102 (Terms Test 2) 5 continued...
6 Question 2. Event-Driven Input [8 marks] Consider the PatternMaker class on the facing page. Sketch below what the program would draw on the graphics pane if the user took the following mouse actions in sequence: 1. press at point 1 and release mouse at point 2 2. press at point 3 and release mouse at point 4 3. press the Direct button 4. press at point 6 and release mouse at point 7 5. press at point 8 and release mouse at point 9 Straight Direct (Question 2 continued on next page) COMP 102 (Terms Test 2) 6 continued...
7 Student ID: (Question 2 continued) public class PatternMaker implements UIButtonListener, UIMouseListener{ // Fields private String what = "straight"; private double lastx = 0; private double lasty = 0; // Set up interface public PatternMaker(){ UI.setMouseListener(this); UI.addButton("Straight", this); UI.addButton("Direct", this); // Respond to button presses public void buttonperformed(string button){ if (button.equals("straight")){ this. what = "straight"; else if (button.equals("direct")){ this. what = "direct"; public void mouseperformed(string action, double x, double y) { // Respond to pressed events if (action.equals("pressed")) { if (this. what.equals("straight")){ UI.drawOval(x, y, 10, 10); else if (this. what.equals("direct")){ UI. filloval (x, y, 10, 10); // Respond to released events else if (action. equals("released")) { UI.drawLine(this.lastX, this. lasty, x, y); this.lastx = x; this.lasty = y; public static void main(string[] arguments){ new PatternMaker(); COMP 102 (Terms Test 2) 7 continued...
8 Question 3. Defining Classes [10 marks] Consider the FuelGauge class on the facing page. A FuelGauge object keeps track of the capacity of a fuel tank and the amount of fuel left, and displays it as a simple red vertical bar in a rectangle, as in the example below, which shows a gauge one third full (eg, 10 litres of fuel when the tank capacity is 30 litres). You need to complete the FuelGauge class: Define two fields to store the capacity of the tank (maximum number of litres in the tank) and the current number of litres of fuel remaining. Complete the constructor, which should have one parameter which specifies the capacity of the FuelGauge object, and should draw the gauge on the graphics pane. Complete the fill method, which has no parameters. It should fill the tank to capacity, then re-draw the fuel guage on the screen. Complete the use method, which should have one parameter the amount of fuel to use up. It should reduce the current amount of fuel by the value of the parameter, and then re-draw the gauge. If all the fuel in the tank is used, the fuel should be zero it should never be negative. Complete the redraw method, which has no parameters. It should erase the FuelGauge and redraw it with the bar showing how full the tank is. Note that fields for the position and size of the gauge are provided, as is the part of the redraw method that erases and draws the outline of the gauge. As an example of using the FuelGauge class, the testgauge method below creates a gauge, fills it, and then uses 40 litres of fuel, leaving it one third full. public void testgauge(){ FuelGauge fg = new FuelGauge(60); fg. fill (); fg.use(15); fg.use(25); (Question 3 continued on next page) COMP 102 (Terms Test 2) 8 continued...
9 Student ID: (Question 3 continued) public class FuelGauge{ private double capacity; private double fuel = 0; // dimensions private double left = 40; private double top = 120; private double base = 220; private final double width = 10; private final double height = 100; public FuelGauge( double cap){ this.capacity = cap; this.redraw(); public void fill ( ){ this. fuel = this.capacity; this.redraw(); public void use( double amount){ this. fuel = this. fuel amount; if (this. fuel < 0) { this. fuel = 0; this.redraw(); public void redraw(){ UI.eraseRect(this. left, this.top, this.width, this.height ); // draw the bar UI.setColor(Color.red); double fuelheight = this. fuel /this.capacity this.height; UI. fillrect (this. left, this.base fuelheight, this.width, fuelheight ); // draw the outline UI.setColor(Color.black); UI.drawRect(this.left, this.top, this.width, this.height ); COMP 102 (Terms Test 2) 9 continued...
10 Question 4. File Processing [10 marks] Suppose the file timetable.txt contains information about the departure times, platform number, and destination of trains from Wellington station. For example, part of the file might be: Johnsonville Upper Hutt Melling Johnsonville Upper Hutt Melling Johnsonville where each line contains a time (in 24 hour format), a platform number, and a destination. Complete the choosetrains method on the facing page. choosetrains has two parameters a destination station and a time. The method should read the timetable.txt file, and print out the platform and departure time of all trains to the specified destination which leave at or before the specified time. It should also print out the number of trains to that destination that leave after the specified time. For example, if the file contained just the data above, then calling choosetrains( Johnsonville, 1030); should print out Trains to Johnsonville before 1030: platform 1 at 930 platform 4 at 1002 There are 1 later trains Note: the method should not ask the user for the destination and time. (Question 4 continued on next page) COMP 102 (Terms Test 2) 10 continued...
11 Student ID: (Question 4 continued) public void choosetrains(string dest, int time){ try{ Scanner scan = new Scanner(new File("timetable.txt")); UI. printf ("Trains to %s before %d:\n", dest, time); int countlate = 0; while (scan.hasnext()){ int t = scan.nextint (); int platform = scan.nextint (); String station = scan.nextline(); if ( station.contains(dest)){ if ( t <= time){ UI. printf (" platform %d at %d\n", platform, t); else{ countlate++; UI. printf ("There are %d later trains\n", countlate); UI. println (" "); catch(ioexception e){ui.println("fail: " + e); ******************************** COMP 102 (Terms Test 2) 11
12 SPARE PAGE FOR EXTRA ANSWERS Cross out rough working that you do not want marked. Specify the question number for work that you do want marked. COMP 102 (Terms Test 2) 12 continued...
Model Solutions. COMP 102: Test May, 2012
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 45 minutes
Model Solutions. COMP 102: Test May, 2014
Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Model Solutions COMP 102: Test
Model Solutions. COMP 102: Test May, 2015
Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Model Solutions COMP 102: Test
Model Solutions. COMP 102: Test May, 2016
Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Model Solutions COMP 102: Test
COMP 102: Test , December?? ** WITH SOLUTIONS **
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 102: Test 2 2017, December??
COMP 102: Test. 2017, May 15 ** WITH SOLUTIONS **
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 102: Test 2017, May 15
COMP 102: Test , September 25 ** WITH SOLUTIONS **
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 102: Test 2 2017, September
COMP102: Test 1 Model Solutions
Family Name:.......................... Other Names:.......................... ID Number:............................ COMP102: Test 1 Model Solutions 27 July, 2007 Instructions Time allowed: 45 minutes.
Model Solutions. COMP 102: Test. 14 August, 2014
Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Model Solutions COMP 102: Test
Introduction to Programming: Test 2
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. Introduction to Programming:
Ū P O K O O T E I K A A M Ā U I U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2014 TRIMESTER 1
T E W H A R E W Ā N A N G A O T E Student ID:....................... Ū P O K O O T E I K A A M Ā U I VUW VICTORIA U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2014 TRIMESTER 1 COMP 102 INTRODUCTION
Model Solutions. COMP 102: Test March, 2015
Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Model Solutions COMP 102: Test
Model Solutions. COMP 102: Test 1. 6 April, 2016
Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Model Solutions COMP 102: Test
COMP 102: Test August, 2017
Family Name:.......................... Other Names:.......................... Student ID:............................ Signature.............................. COMP 102: Test 1 14 August, 2017 Instructions
COMP 102 : Test. 2017, Apr 3
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 102 : Test 2017, Apr 3
Intro to Computer Programming: Final Exam
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. Intro to Computer Programming:
COMP 102: Test August, 2017
Family Name:.......................... Other Names:.......................... Student ID:............................ Signature.............................. COMP 102: Test 1 14 August, 2017 Instructions
Model Solutions. COMP 102: Test March, 2014
Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Model Solutions COMP 102: Test
Ū P O K O O T E I K A A M Ā U I U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2014 TRIMESTER 2
T E W H A R E W Ā N A N G A O T E Student ID:....................... Ū P O K O O T E I K A A M Ā U I VUW VICTORIA U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2014 TRIMESTER 2 COMP 102 INTRODUCTION
EXAMINATIONS 2010 MID-YEAR COMP 102 INTRODUCTION TO COMPUTER PROGRAM DESIGN
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW V I C T O R I A UNIVERSITY OF WELLINGTON Student ID:....................... EXAMINATIONS 2010 MID-YEAR COMP 102 INTRODUCTION TO COMPUTER
COMP 102 : Test. 2017, Apr 3 ** WITH SOLUTIONS **
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 102 : Test 2017, Apr 3
Java Programming: Test 1
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. Java Programming: Test 1 2016,
Model Solutions. COMP 102: Test. 18 August, 2016
Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Model Solutions COMP 102: Test
COMP102: Test 2 Model Solutions
Family Name:.......................... Other Names:.......................... ID Number:............................ Instructions Time allowed: 90 minutes (1 1 2 hours). There are 90 marks in total. Answer
COMP 102: Test 2 Model Solutions
Family Name:.......................... Other Names:.......................... ID Number:............................ Instructions Time allowed: 45 minutes There are 45 marks in total. Answer all the questions.
COMP 102/112 : Test. 2019, Apr 1 ** WITH SOLUTIONS **
Family Name:.............................. Other Names:...................................... Signature.................................. COMP 102/112 : Test 2019, Apr 1 ** WITH SOLUTIONS ** Instructions
COMP102: Test. 26 April, 2006
Name:.................................. ID Number:............................ Signature:.............................. COMP102: Test 26 April, 2006 Instructions Time allowed: 90 minutes (1 1 2 hours).
COMP102: Test 1. Model Solutions
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. COMP102: Test 1 8 Apr, 2013 Instructions
COMP102: Test July, 2006
Name:.................................. ID Number:............................ COMP102: Test 1 26 July, 2006 Instructions Time allowed: 45 minutes. Answer all the questions. There are 45 marks in total.
EXAMINATIONS 2010 END-OF-YEAR COMP 102 INTRODUCTION TO COMPUTER PROGRAM DESIGN
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW V I C T O R I A UNIVERSITY OF WELLINGTON Student ID:....................... EXAMINATIONS 2010 END-OF-YEAR COMP 102 INTRODUCTION TO
COMP102: Test 2: Part B Model Solutions
Name:.................................. ID Number:............................ COMP102: Test 2: Part B Model Solutions 13 Sept, 2006 Instructions Time allowed: 30 minutes. There are 30 marks in total.
Solution Notes. COMP 151: Terms Test
Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Solution Notes COMP 151: Terms
U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2015 TRIMESTER 1 COMP 102 INTRODUCTION TO COMPUTER PROGRAM DESIGN
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW VICTORIA U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2015 TRIMESTER 1 COMP 102 INTRODUCTION TO COMPUTER PROGRAM DESIGN
EXAMINATIONS 2008 END-OF-YEAR COMP 102 INTRODUCTION TO COMPUTER PROGRAM DESIGN
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW V I C T O R I A UNIVERSITY OF WELLINGTON Student ID:....................... EXAMINATIONS 2008 END-OF-YEAR COMP 102 INTRODUCTION TO
Model Solutions. COMP 103: Test May, 2013
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 45 minutes
U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2017 TRIMESTER 1 COMP 102 INTRODUCTION TO COMPUTER PROGRAM DESIGN
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW VICTORIA U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2017 TRIMESTER 1 COMP 102 INTRODUCTION TO COMPUTER PROGRAM DESIGN
COMP102: Test. 18 April, 2005
Name:.................................. ID Number:............................. Signature:............................... COMP102: Test 18 April, 2005 Instructions Time allowed: 1 1 2 hours. Answer all
COMP102: 181. Menu. More while loops. Admin: Test. Peter Andreae
Menu COMP102: 181 More while loops Admin: Test Designing loops with numbers COMP102: 182 When the number of steps is known at the beginning of the loop: int count = 0; int num = 1; while ( count < number)
COMP102: Test. 31 August, 2005
Name:.................................. ID Number:............................. Signature:............................... COMP102: Test 31 August, 2005 Instructions Time allowed: 1 1 2 hours. Answer all
COMP 103 : Test. 2018, Sept 12//(Corrected)
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 103 : Test 2018, Sept 12//(Corrected)
U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2016 TRIMESTER 2 COMP 102 INTRODUCTION TO COMPUTER PROGRAM DESIGN
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW VICTORIA U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 26 TRIMESTER 2 COMP 2 INTRODUCTION TO COMPUTER PROGRAM DESIGN Time
COMP 103 : Test. 2018, Sept 12//(Corrected) ** WITH SOLUTIONS
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 103 : Test 2018, Sept 12//(Corrected)
COMP 103 : Test. 2019, Jan 9 ** WITH SOLUTIONS **
Family Name:.............................. Other Names:...................................... Signature.................................. COMP 103 : Test 2019, Jan 9 ** WITH SOLUTIONS ** Instructions Time
EXAMINATIONS 2011 Trimester 2, MID-TERM TEST. COMP103 Introduction to Data Structures and Algorithms SOLUTIONS
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW V I C T O R I A UNIVERSITY OF WELLINGTON Student ID:....................... EXAMINATIONS 2011 Trimester 2, MID-TERM TEST COMP103 Introduction
Questions COMP 102 INTRODUCTION TO COMPUTER PROGRAM DESIGN. Attempt ALL Questions.
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW V I C T O R I A UNIVERSITY OF WELLINGTON Student ID:....................... EXAMINATIONS 2007 MID-YEAR COMP 102 INTRODUCTION TO COMPUTER
U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2017 TRIMESTER 1 COMP 102 INTRODUCTION TO COMPUTER PROGRAM DESIGN
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW VICTORIA U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2017 TRIMESTER 1 COMP 102 INTRODUCTION TO COMPUTER PROGRAM DESIGN
Model Solutions. COMP 103: Test April, 2013
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 40 minutes
Family Name:... Other Names:... ID Number:... Signature... Model Solutions. COMP 103: Test 1. 9th August, 2013
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Model Solutions COMP 103: Test
Model Solutions. COMP 103: Mid-term Test. 21st of August, 2014
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 50 minutes
EXAMINATIONS 2012 MID YEAR. COMP103 Introduction to Data Structures and Algorithms SOLUTIONS
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW V I C T O R I A UNIVERSITY OF WELLINGTON Student ID:....................... EXAMINATIONS 2012 MID YEAR COMP103 Introduction to Data
CSIS 10A Assignment 9 Solutions
CSIS 10A Assignment 9 Solutions Read: Chapter 9 Choose and complete any 10 points from the problems below, which are all included in the download file on the website. Use BlueJ to complete the assignment,
McGill University School of Computer Science COMP-202A Introduction to Computing 1
McGill University School of Computer Science COMP-202A Introduction to Computing 1 Midterm Exam Thursday, October 26, 2006, 18:00-20:00 (6:00 8:00 PM) Instructors: Mathieu Petitpas, Shah Asaduzzaman, Sherif
1. Boolean algebra. [6] 2. Constructing a circuit. [4] 3. Number representation [4] 4. Adders [4] 5. ALU [2] 6. Software [4]
![1. Boolean algebra. [6] 2. Constructing a circuit. [4] 3. Number representation [4] 4. Adders [4] 5. ALU [2] 6. Software [4]](/thumbs/93/114163715.jpg "1. Boolean algebra. [6] 2. Constructing a circuit. [4] 3. Number representation [4] 4. Adders [4] 5. ALU [2] 6. Software [4]")
Family Name:.......................... Other Names:.......................... ID Number:.......................... ENGR101: Test 4 May 2009 Instructions Time allowed: 45 minutes. There are 45 marks in
U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2016 TRIMESTER 1 COMP 102 INTRODUCTION TO COMPUTER PROGRAM DESIGN
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW VICTORIA U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2016 TRIMESTER 1 COMP 102 INTRODUCTION TO COMPUTER PROGRAM DESIGN
CS 170 Section 3, Spring 2015 Programming in Java Midterm Exam 1. Name (print):
Name (print): INSTRUCTIONS: o Keep your eyes on your own paper and do your best to prevent anyone else from seeing your work. o Do NOT communicate with anyone other than the professor/proctor for ANY reason
Constants. Why Use Constants? main Method Arguments. CS256 Computer Science I Kevin Sahr, PhD. Lecture 25: Miscellaneous
CS256 Computer Science I Kevin Sahr, PhD Lecture 25: Miscellaneous 1 main Method Arguments recall the method header of the main method note the argument list public static void main (String [] args) we
About This Lecture. Data Abstraction - Interfaces and Implementations. Outline. Object Concepts. Object Class, Protocol and State.
Revised 01/09/05 About This Lecture Slide # 2 Data Abstraction - Interfaces and Implementations In this lecture we will learn how Java objects and classes can be used to build abstract data types. CMPUT
EECS 1001 and EECS 1030M, lab 01 conflict
EECS 1001 and EECS 1030M, lab 01 conflict Those students who are taking EECS 1001 and who are enrolled in lab 01 of EECS 1030M should switch to lab 02. If you need my help with switching lab sections,
COMP102: Test Model Solutions
Name:.................................. ID Number:............................. Signature:............................... COMP102: Test Model Solutions 31 August, 2005 Instructions Time allowed: 1 1 2
CS 2110 Fall Instructions. 1 Installing the code. Homework 4 Paint Program. 0.1 Grading, Partners, Academic Integrity, Help
CS 2110 Fall 2012 Homework 4 Paint Program Due: Wednesday, 12 November, 11:59PM In this assignment, you will write parts of a simple paint program. Some of the functionality you will implement is: 1. Freehand
Chapter 6: Inheritance
Chapter 6: Inheritance EECS 1030 moodle.yorku.ca State of an object final int WIDTH = 3; final int HEIGTH = 4; final int WEIGHT = 80; GoldenRectangle rectangle = new GoldenRectangle(WIDTH, HEIGHT, WEIGHT);
CSE 11 Midterm Fall 2008
Signature cs11f Name Student ID CSE 11 Midterm Fall 2008 Page 1 (10 points) Page 2 (22 points) Page 3 (23 points) Page 4 (17 points) Page 5 (12 points) Total (84 points = 80 base points + 4 points EC [5%])
CS 170 Section 3, Spring 2015 Programming in Java Midterm Exam 1. Name (print):
Name (print): INSTRUCTIONS: o Keep your eyes on your own paper and do your best to prevent anyone else from seeing your work. o Do NOT communicate with anyone other than the professor/proctor for ANY reason
Final Exam 90 minutes Eng. Mohammed S. F. Abdual Al
Islamic University of Gaza Faculty of Engineering Computer Engineering Department Computer Programming Lab (ECOM 2124) Final Exam 90 minutes Eng. Mohammed S. F. Abdual Al Student name Student ID Please
COMP 250. Lecture 29. interfaces. Nov. 18, 2016
COMP 250 Lecture 29 interfaces Nov. 18, 2016 1 ADT (abstract data type) ADT s specify a set of operations, and allow us to ignore implementation details. Examples: list stack queue binary search tree priority
Final Exam Practice. Partial credit will be awarded.
Please note that this problem set is intended for practice, and does not fully represent the entire scope covered in the final exam, neither the range of the types of problems that may be included in the
Chapter 7 Applets. Answers
Chapter 7 Applets Answers 1. D The drawoval(x, y, width, height) method of graphics draws an empty oval within a bounding box, and accepts 4 int parameters. The x and y coordinates of the left/top point
2. [20] Suppose we start declaring a Rectangle class as follows:
![2. [20] Suppose we start declaring a Rectangle class as follows:](/thumbs/88/114683644.jpg "2. [20] Suppose we start declaring a Rectangle class as follows:")
1. [8] Create declarations for each of the following. You do not need to provide any constructors or method definitions. (a) The instance variables of a class to hold information on a Minesweeper cell:
CS 455 Midterm Exam 1 Fall 2017 [Bono] Thursday, Sep. 28, 2017
![CS 455 Midterm Exam 1 Fall 2017 [Bono] Thursday, Sep. 28, 2017](/thumbs/95/124125387.jpg "CS 455 Midterm Exam 1 Fall 2017 [Bono] Thursday, Sep. 28, 2017")
Name: USC NetID (e.g., ttrojan): CS 455 Midterm Exam 1 Fall 2017 [Bono] Thursday, Sep. 28, 2017 There are 6 problems on the exam, with 55 points total available. There are 10 pages to the exam (5 pages
1 Short Answer (15 Points Each)
Name: Write all of your responses on these exam pages. If you need extra space please use the backs of the pages. 1 Short Answer (15 Points Each) 1. Write the following Java declarations, (a) A double
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
CS111: PROGRAMMING LANGUAGE II
CS111: PROGRAMMING LANGUAGE II Computer Science Department Lecture 1(c): Java Basics (II) Lecture Contents Java basics (part II) Conditions Loops Methods Conditions & Branching Conditional Statements A
This exam is open book. Each question is worth 3 points.
This exam is open book. Each question is worth 3 points. Page 1 / 15 Page 2 / 15 Page 3 / 12 Page 4 / 18 Page 5 / 15 Page 6 / 9 Page 7 / 12 Page 8 / 6 Total / 100 (maximum is 102) 1. Are you in CS101 or
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
1. Which of the following is the correct expression of character 4? a. 4 b. "4" c. '\0004' d. '4'
Practice questions: 1. Which of the following is the correct expression of character 4? a. 4 b. "4" c. '\0004' d. '4' 2. Will System.out.println((char)4) display 4? a. Yes b. No 3. The expression "Java
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.
CS 139 Practice Midterm Questions #2
CS 139 Practice Midterm Questions #2 Spring 2016 Name: 1. Write Java statements to accomplish each of the following. (a) Declares numbers to be an array of int s. (b) Initializes numbers to contain a reference
TWO-DIMENSIONAL FIGURES
TWO-DIMENSIONAL FIGURES Two-dimensional (D) figures can be rendered by a graphics context. Here are the Graphics methods for drawing draw common figures: java.awt.graphics Methods to Draw Lines, Rectangles
CS 455 Midterm Exam 2 Fall 2016 [Bono] November 8, 2016
![CS 455 Midterm Exam 2 Fall 2016 [Bono] November 8, 2016](/thumbs/81/84177751.jpg "CS 455 Midterm Exam 2 Fall 2016 [Bono] November 8, 2016")
Name: USC NetID (e.g., ttrojan): CS 455 Midterm Exam 2 Fall 2016 [Bono] November 8, 2016 There are 7 problems on the exam, with 50 points total available. There are 8 pages to the exam (4 pages double-sided),
Implementing non-static features
Implementing non-static features Problem Implement the Rectangle class. What have we done so far? attributes constructors accessors mutators getarea tostring scale equals compareto Duplicates What will
EXAMINATIONS 2011 END YEAR. COMP103 Introduction to Data Structures and Algorithms SOLUTIONS
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW V I C T O R I A UNIVERSITY OF WELLINGTON Student ID:....................... EXAMINATIONS 2011 END YEAR COMP103 Introduction to Data
MCS-378 Intraterm Exam 1 Serial #:
MCS-378 Intraterm Exam 1 Serial #: This exam is closed-book and mostly closed-notes. You may, however, use a single 8 1/2 by 11 sheet of paper with hand-written notes for reference. (Both sides of the
QUEEN MARY, UNIVERSITY OF LONDON DCS128 ALGORITHMS AND DATA STRUCTURES Class Test Monday 13 th February
QUEEN MARY, UNIVERSITY OF LONDON DCS128 ALGORITHMS AND DATA STRUCTURES Class Test Monday 13 th February 2006 11.05-12.35 Please fill in your Examination Number here: Student Number here: All answers to
Selected Questions from by Nageshwara Rao
Selected Questions from http://way2java.com by Nageshwara Rao Swaminathan J Amrita University swaminathanj@am.amrita.edu November 24, 2016 Swaminathan J (Amrita University) way2java.com (Nageshwara Rao)
Tutorial 2 Today we will have a quick introduction to ArgoUML and how to use it, as well as look at some examples of class diagrams.
Tutorial 2 Today we will have a quick introduction to ArgoUML and how to use it, as well as look at some examples of class diagrams. This is an answer sheet, answers are marked in RED. Quiz dates: Quiz
Last Name: Circle One: OCW Non-OCW
First Name: AITI 2004: Exam 1 June 30, 2004 Last Name: Circle One: OCW Non-OCW Read Instructions Carefully! This is a 3 hour closed book exam. No calculators are allowed. Please write clearly if we cannot
SOLUTIONS. COMP103 Introduction to Data Structures and Algorithms
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW V I C T O R I A UNIVERSITY OF WELLINGTON Student ID:....................... EXAMINATIONS 2011 MID YEAR COMP103 Introduction to Data
COMP 202. More on OO. CONTENTS: static revisited this reference class dependencies method parameters variable scope method overloading
COMP 202 CONTENTS: static revisited this reference class dependencies method parameters variable scope method overloading More on OO COMP 202 - Week 7 1 Static member variables So far: Member variables
3.1 Class Declaration
Chapter 3 Classes and Objects OBJECTIVES To be able to declare classes To understand object references To understand the mechanism of parameter passing To be able to use static member and instance member
CISC 1600 Lecture 3.1 Introduction to Processing
CISC 1600 Lecture 3.1 Introduction to Processing Topics: Example sketches Drawing functions in Processing Colors in Processing General Processing syntax Processing is for sketching Designed to allow artists
H212 Introduction to Software Systems Honors
Introduction to Software Systems Honors Lecture #04: Fall 2015 1/20 Office hours Monday, Wednesday: 10:15 am to 12:00 noon Tuesday, Thursday: 2:00 to 3:45 pm Office: Lindley Hall, Room 401C 2/20 Printing
F I N A L E X A M I N A T I O N
Faculty Of Computer Studies M257 Putting Java to Work F I N A L E X A M I N A T I O N Number of Exam Pages: (including this cover sheet( Spring 2011 April 4, 2011 ( 5 ) Time Allowed: ( 1.5 ) Hours Student
Midterm Exam 5 April 20, 2015
Midterm Exam 5 April 20, 2015 Name: Section 1: Multiple Choice Questions (24 pts total, 3 pts each) Q1: Which of the following is not a kind of inheritance in C++? a. public. b. private. c. static. d.
Objects and Classes (1)
Objects and Classes (1) Reading: Classes (interface, implementation, garbage collection) http://moodle.cs.man.ac.uk/course/view.php?id=81 Interface Examples Creating and using objects of existing classes
Test 1 Fall 2018 : Compsci 201
Test 1 Fall 2018 : Compsci 201 Owen Astrachan September 26, 2018 Name: NetID/Login: (1 point) Community standard acknowledgment (signature) (1 point) Problem 1 value 28 pts. grade Problem 2 9 pts. Problem
Methods Summer 2010 Margaret Reid-Miller
Methods 15-110 Margaret Reid-Miller Methods A method is a group of programming statements that has a name, e.g., main()! A method definition includes the method header and method body. Flow of control:
CS 110 Practice Final Exam originally from Winter, Instructions: closed books, closed notes, open minds, 3 hour time limit.
Name CS 110 Practice Final Exam originally from Winter, 2003 Instructions: closed books, closed notes, open minds, 3 hour time limit. There are 4 sections for a total of 49 points. Part I: Basic Concepts,
Model Solutions. COMP 103: Mid-term Test. 19th of August, 2016
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 45 minutes
CS61BL. Lecture 1: Welcome to CS61BL! Intro to Java and OOP Testing Error-handling
CS61BL Lecture 1: Welcome to CS61BL! Intro to Java and OOP Testing Error-handling About me Name: Edwin Liao Email: edliao@berkeley.edu Office hours: Thursday 3pm - 5pm Friday 11am - 1pm 611 Soda Or by
1.00 Lecture 8. Using An Existing Class, cont.
.00 Lecture 8 Classes, continued Reading for next time: Big Java: sections 7.9 Using An Existing Class, cont. From last time: is a Java class used by the BusTransfer class BusTransfer uses objects: First