Model Solutions. COMP 102: Test May, 2012
|
|
|
- Curtis Cook
- 6 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 11 May, 2012 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. Understanding Java [17] 2. Event Driven Input [10] 3. Defining Classes [10] 4. File Processing [8] 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 Question 1. Understanding Java [17 marks] (a) [4 marks] Consider the following counting method: public void counting(int num){ while (num > 0){ if ( num <= 5 ) { UI. println ("then: " + num 3); else { UI. println ("now: " + num); num = num 2; UI. println ("finally: " + num); What will be printed if counting(9) is called? now: 9 now: 7 then: 15 then: 9 then: 3 finally: -1 (b) [3 marks] Consider the following choose method: public void choose(int a, int b, int c){ if ( a > c ) { UI. println ("March"); else if ( b > c && a < c ) { UI. println ("April"); else if ( c == b c == a ) { UI. println ("May"); else { UI. println ("June"); What will be printed if choose(20, 15,10) is called? March What will be printed if choose(15, 20, 15) is called? May What will be printed if choose(10, 10, 20) is called? June COMP 102 (Terms Test 2) 3 continued...
4 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. Spare copy of grid: COMP 102 (Terms Test 2) 4 continued...
5 (Question 1 continued) (c) [4 marks] Suppose the file called SomeText.txt contains the following: Hello GoodBye What will the following filedraw method draw on the graphics pane? (Answer on the grid below.) Hint: keep track of the values of all the variables public void filedraw(){ try{ Scanner scan = new Scanner (new File("SomeText.txt")); int x = 100; int y = 100; while ( scan.hasnext() ) { String token = scan.next(); UI.drawString(token, x, y); int u = scan.nextint (); int v = scan.nextint (); UI.drawLine(x, y, u, v); x = u; y = v; scan.close(); catch(ioexception e){ui.println("fail: " + e); x: y: u: v: Hello GoodBye (Question 1 continued on next page) COMP 102 (Terms Test 2) 5 continued...
6 (Question 1 continued) (d) [6 marks] Consider the LibraryBook class on the facing page. What will the following fragment of code print out? (Note the variables carefully.) LibraryBook b1 = new LibraryBook("Jingo"); b1.lendbook(); b1.returnbook(5); LibraryBook b2 = new LibraryBook("Thud"); b1.lendbook(); b2.lendbook(); b1.returnbook(15); b2.returnbook(8); b1.retirebook (); loans of Jingo : 1 usage of Jingo : 5 loans of Jingo : 2 loans of Thud : 1 usage of Jingo : 20 usage of Thud : 8 retired Jingo : 20/2 (Question 1 continued on next page) COMP 102 (Terms Test 2) 6 continued...
7 (Question 1 continued) public class LibraryBook{ private String title ; private int usage = 0; private int times = 0; public LibraryBook(String ttl ){ this. title = ttl ; public void lendbook(){ this.times = this.times + 1; UI. println ("loans of " + this.title + " : " + this.times); public void returnbook(int days){ this. usage = this.usage + days; UI. println ("usage of " + this.title + " : " + this.usage); public void retirebook(){ UI. printf ("retired %s : %d/%d \n", this.title, this.usage, this.times); COMP 102 (Terms Test 2) 7 continued...
8 Question 2. Event-Driven Input [10 marks] The TargetPractice program on the facing page should allow the user to draw red or blue target shapes on the graphics pane, as shown below. If the user presses the mouse at one point and releases it at a second point, then the program should draw a target shape centered at the first point, and a radius equal to the horizontal distance between the two points. (as shown in the left hand target below). The program should have two buttons (labeled Red and Blue) that allow the user to change the color for future targets. The program has three fields; it needs a constructor and methods to respond to the buttons and the mouse. You are to complete the program. Note that there is a drawtarget method already written for you, which requires the center and radius of the target. Red Blue 1 radius 2 (Question 2 continued on next page) COMP 102 (Terms Test 2) 8 continued...
9 (Question 2 continued) public class TargetPractice implements UIButtonListener, UIMouseListener{ private Color targetcolor = Color.red; // The current color private double centerx = 0; // position the mouse was pressed private double centery = 0; public TargetPractice(){ UI.setMouseListener(this); UI.addButton("Red", this); UI.addButton("Blue", this); public void mouseperformed(string action, double x, double y) { if (action.equals("pressed")) { this.centerx = x; this.centery = y; else if (action.equals("released")) { double rad = Math.abs(x this.centerx); this.drawtarget(this.centerx, this.centery, rad, this.targetcolor ); public void buttonperformed(string button){ if (button.equals("red")){ targetcolor = Color.red; else if (button.equals("blue")){ targetcolor = Color.blue; / Draws target shape, centered at (x, y) with given radius and color / public void drawtarget(double x, double y, double radius, Color color){ UI.setColor(color ); double rad = radius; while (rad > 5){ UI. filloval (x rad, y rad, rad 2, rad 2); UI.eraseOval(x (rad 10), y (rad 10), (rad 10) 2, (rad 10) 2); rad = rad 20; COMP 102 (Terms Test 2) 9 continued...
10 Question 3. Defining Classes [10 marks] For this question, you are to complete part of a program that displays the state of a rowing race which has several boats, each in their own lane. For example, the figure shows a race with four boats. lane 1 lane 2 otago canty 3 * lanesep units lane 3 vuw lane 4 auck 165 units The RowBoat class on the facing page represents individual boats. Each boat has a team name, a lane number (1, 2, 3,... ), and the distance it has travelled so far along the lane. The draw method will display the boat as a rectangle containing the team name. The boat is displayed on the appropriate lane, and the horizontal position is the distance it has travelled. In the example below, the boat for the VUW is in lane 3 and is 165 meters along the course. Every boat starts at a distance of 0 meters along the course. The program can update the position of the boat (though the lane never changes). You are to complete the RowBoat class: Define three fields to store the name of the team, the lane, and the position of the boat. Complete the constructor, which should have two parameters specifying the name and the lane. It should also draw the boat on the graphics pane by calling the draw method. Complete the restart method, which has no parameters. It should reset the distance along the course to 0 and re-draw the boat. It does not need to erase the boat from its old position. Complete the moveforward method, which should have one parameter the distance to move forward. It should change the position of the boat by the value of the parameter, and then redraw the boat. It does not need to erase the boat from its old position. Complete the draw method, which has no parameters. It should draw the boat on the graphics pane. The boat size should be 30 units wide and 15 units high. The constant lanesep specifies the vertical separation between lanes. Hint: use the drawrect and drawstring methods. As an example of using the RowBoat class, the testboat method below creates a boat, and moves it to the right and then restarts it. public void testboat(){ RowBoat boat = new RowBoat("VUW", 3); UI.clearGraphics(); boat.moveforward(30); UI.sleep(1000); UI.clearGraphics(); boat. restart (); COMP 102 (Terms Test 2) 10 continued...
11 (Question 3 continued) public class RowBoat{ private static final double lanesep = 50; private String teamname; private int lane; private double distance = 0; public RowBoat(String name, int ln){ this.teamname = name; this.lane = ln ; this.draw(); public void restart (){ this.distance = 0; this.draw(); public void moveforward(double move){ this.distance = this.distance + move; this.draw(); public void draw(){ double y = lanesep lane; UI.drawRect(this.distance, y 7, 30, 15); UI.drawString(this.teamName, this.distance, y+7); COMP 102 (Terms Test 2) 11 continued...
12 Question 4. File Processing [8 marks] Suppose the file boat-list.txt contains information about boats owned by a sailing club. Each line contains the boat ID, the number of crew, the year of purchase, and the boat type For example, part of the file might be: A Flying Ant B Heron A Laser A Coronado A Laser A Coronado The chooseboats method on the facing page has one parameter a year. Complete the choose- Boats method so that it reads the boat-list.txt file, prints out the boat ID and the boat type of each boat that was purchased in or after the given year, and finally prints out the total number of crew these boats can hold. For example, if the file contained just the data above, then calling chooseboats(2006); should print out Boats since 2006: B15 Heron A43 Laser A35 Coronado Total Crew: 7 (Question 4 continued on next page) COMP 102 (Terms Test 2) 12 continued...
13 (Question 4 continued) public void chooseboats(int year){ UI. println ("Boats since " + year); try{ Scanner scan = new Scanner(new File("boat-list.txt")); int totcrew = 0; while (scan.hasnext()){ String num = scan.next(); int crew = scan.nextint (); int yr = scan.nextint (); String type = scan.nextline(); if (yr >= year){ UI. println (" " + num + " " + type); totcrew = totcrew + crew; UI. println ("\ntotal Crew: "+ totcrew); scan.close(); catch(ioexception e){ui.println("file Failure: " + e); ******************************** COMP 102 (Terms Test 2) 13
14 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) 14 continued...
Model Solutions. COMP 102: Test 2. 5 May, 2011
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, 2016
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
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
COMP 102: Test , December?? ** WITH SOLUTIONS **
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 102: Test 2 2017, December??
Ū 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. 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:
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
Model Solutions. COMP 102: Test. 18 August, 2016
Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Model Solutions COMP 102: Test
COMP 102/112 : Test. 2019, Apr 1 ** WITH SOLUTIONS **
Family Name:.............................. Other Names:...................................... Signature.................................. COMP 102/112 : Test 2019, Apr 1 ** WITH SOLUTIONS ** Instructions
Model Solutions. COMP 102: Test March, 2014
Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Model Solutions COMP 102: Test
COMP102: Test 1 Model Solutions
Family Name:.......................... Other Names:.......................... ID Number:............................ COMP102: Test 1 Model Solutions 27 July, 2007 Instructions Time allowed: 45 minutes.
Intro to Computer Programming: Final Exam
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. Intro to Computer Programming:
COMP 102 : Test. 2017, Apr 3
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 102 : Test 2017, Apr 3
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, 2015
Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Model Solutions COMP 102: Test
COMP 102 : Test. 2017, Apr 3 ** WITH SOLUTIONS **
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 102 : Test 2017, Apr 3
Ū 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
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
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.
Java Programming: Test 1
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. Java Programming: Test 1 2016,
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. 26 April, 2006
Name:.................................. ID Number:............................ Signature:.............................. COMP102: Test 26 April, 2006 Instructions Time allowed: 90 minutes (1 1 2 hours).
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
Solution Notes. COMP 151: Terms Test
Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Solution Notes COMP 151: Terms
COMP102: Test 1. Model Solutions
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. COMP102: Test 1 8 Apr, 2013 Instructions
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
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.
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
COMP 103 : Test. 2018, Sept 12//(Corrected)
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 103 : Test 2018, Sept 12//(Corrected)
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.
COMP 103 : Test. 2018, Sept 12//(Corrected) ** WITH SOLUTIONS
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 103 : Test 2018, Sept 12//(Corrected)
Model Solutions. COMP 103: Test April, 2013
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 40 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: 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)
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
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
COMP 103 : Test. 2019, Jan 9 ** WITH SOLUTIONS **
Family Name:.............................. Other Names:...................................... Signature.................................. COMP 103 : Test 2019, Jan 9 ** WITH SOLUTIONS ** Instructions Time
Model Solutions. COMP 103: Mid-term Test. 21st of August, 2014
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 50 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
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
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.
COMP102: Test. 31 August, 2005
Name:.................................. ID Number:............................. Signature:............................... COMP102: Test 31 August, 2005 Instructions Time allowed: 1 1 2 hours. Answer all
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
CS 161. SAMPLE FINAL Fall 2014
CS 161 SAMPLE FINAL Fall 2014 1. What are the three parts of a loop? How are those three things organized in a while loop? How are they organized in a for loop? 2. Write the code to declare MyStuff to
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
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
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
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
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
Encapsulation. You can take one of two views of an object: internal - the structure of its data, the algorithms used by its methods
Encapsulation You can take one of two views of an object: internal - the structure of its data, the algorithms used by its methods external - the interaction of the object with other objects in the program
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
CS 315 Software Design Homework 1 First Sip of Java Due: Sept. 10, 11:30 PM
CS 315 Software Design Homework 1 First Sip of Java Due: Sept. 10, 11:30 PM Objectives The objectives of this assignment are: to get your first experience with Java to become familiar with Eclipse Java
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
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
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
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
Model Solutions. COMP 103: Mid-term Test. 19th of August, 2016
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 45 minutes
CS 201 Advanced Object-Oriented Programming Lab 10 - Recursion Due: April 21/22, 11:30 PM
CS 201 Advanced Object-Oriented Programming Lab 10 - Recursion Due: April 21/22, 11:30 PM Introduction to the Assignment In this assignment, you will get practice with recursion. There are three parts
EXAMINATIONS 2017 TRIMESTER 2
EXAMINATIONS 2017 TRIMESTER 2 CGRA 151 INTRODUCTION TO COMPUTER GRAPHICS Time Allowed: TWO HOURS CLOSED BOOK Permitted materials: Silent non-programmable calculators or silent programmable calculators
Welcome! COMP s1. Programming Fundamentals
Welcome! 0 COMP1511 18s1 Programming Fundamentals COMP1511 18s1 Lecture 4 1 More Functions + Loops Andrew Bennett even more functions while loops 2 Before we begin introduce
COMP-202 More Complex OOP
COMP-202 More Complex OOP Defining your own types: Remember that we can define our own types/classes. These classes are objects and have attributes and behaviors You create an object or an instance of
U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2018 TRIMESTER 2 COMP 103 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 VICTORIA U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2018 TRIMESTER 2 COMP 103 INTRODUCTION TO DATA STRUCTURES AND ALGORITHMS
Ū 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 *** WITH SOLUTIONS ***
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 *** WITH SOLUTIONS
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
CSE 582 Autumn 2002 Exam 11/26/02
Name There are 8 questions worth a total of 100 points. Please budget your time so you get to all of the questions. Keep your answers brief and to the point. You may refer to the following reference materials:
Java Foundations: Introduction to Program Design & Data Structures, 4e John Lewis, Peter DePasquale, Joseph Chase Test Bank: Chapter 2
Java Foundations Introduction to Program Design and Data Structures 4th Edition Lewis TEST BANK Full download at : https://testbankreal.com/download/java-foundations-introduction-toprogram-design-and-data-structures-4th-edition-lewis-test-bank/
CMPT-166: Sample Final Exam Answer Key
CMPT 166, Summer 2012, Surrey Sample Final Exam Answer Key Page 1 of 9 CMPT-166: Sample Final Exam Answer Key Last name exactly as it appears on your student card First name exactly as it appears on your
File class in Java. Scanner reminder. File methods 10/28/14. File Input and Output (Savitch, Chapter 10)
File class in Java File Input and Output (Savitch, Chapter 10) TOPICS File Input Exception Handling File Output Programmers refer to input/output as "I/O". Input is received from the keyboard, mouse, files.
EXAMINATIONS 2016 TRIMESTER 2
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 2 COMP103 INTRODUCTION TO DATA STRUCTURES AND ALGORITHMS
ASSIGNMENT 2. COMP-202A, Fall 2013, All Sections. Due: October 20 th, 2013 (23:59)
ASSIGNMENT 2 COMP-202A, Fall 2013, All Sections Due: October 20 th, 2013 (23:59) Please read the entire PDF before starting. You must do this assignment individually and, unless otherwise specified, you
CSC 1051 Data Structures and Algorithms I. Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University
Arrays, Part 2 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
Arrays - Review. Initializer Lists. The for-each Loop. Arrays, Part 2. Dr. Papalaskari 1. CSC 1051 Data Structures and Algorithms I
Arrays, Part 2 Arrays - Review Declaration: double[] scores element type Instantiation: = new double[10]; CSC 1051 Data Structures and Algorithms I Dr. Mary-Angela Papalaskari Department of Computing Sciences
Exam 1 - (20 points)
Exam 1 - (20 points) Answer all of the following questions. READ EACH QUESTION CAREFULLY. Fill the correct bubble on your scantron sheet. Each correct answer is worth 1 point (unless otherwise stated).
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
SEMESTER 1, 2011 EXAMINATIONS. CITS1200 Java Programming FAMILY NAME: GIVEN NAMES:
Computer Science & Software Engineering SEMESTER 1, 2011 EXAMINATIONS CITS1200 Java Programming FAMILY NAME: GIVEN NAMES: STUDENT ID: SIGNATURE: This Paper Contains: 26 pages (including title page) Time
2IS45 Programming
Course Website Assignment Goals 2IS45 Programming http://www.win.tue.nl/~wsinswan/programmeren_2is45/ Rectangles Learn to use existing Abstract Data Types based on their contract (class Rectangle in Rectangle.
Final Exam. COMP Summer I June 26, points
Final Exam COMP 14-090 Summer I 2000 June 26, 2000 200 points 1. Closed book and closed notes. No outside material allowed. 2. Write all answers on the test itself. Do not write any answers in a blue book
CS 201 Advanced Object-Oriented Programming Lab 1 - Improving Your Image Due: Feb. 3/4, 11:30 PM
CS 201 Advanced Object-Oriented Programming Lab 1 - Improving Your Image Due: Feb. 3/4, 11:30 PM Objectives The objectives of this assignment are: to refresh your Java programming to become familiar with
Java for Non Majors Spring 2018
Java for Non Majors Spring 2018 Final Study Guide The test consists of 1. Multiple choice questions - 15 x 2 = 30 points 2. Given code, find the output - 3 x 5 = 15 points 3. Short answer questions - 3
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
COMP102: Test Model Solutions
Name:.................................. ID Number:............................. Signature:............................... COMP102: Test Model Solutions 31 August, 2005 Instructions Time allowed: 1 1 2
Recitation 02/02/07 Defining Classes and Methods. Chapter 4
Recitation 02/02/07 Defining Classes and Methods 1 Miscellany Project 2 due last night Exam 1 (Ch 1-4) Thursday, Feb. 8, 8:30-9:30pm PHYS 112 Sample Exam posted Project 3 due Feb. 15 10:00pm check newsgroup!
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
15110 PRINCIPLES OF COMPUTING SAMPLE EXAM 2
15110 PRINCIPLES OF COMPUTING SAMPLE EXAM 2 Name Section Directions: Answer each question neatly in the space provided. Please read each question carefully. You have 50 minutes for this exam. No electronic
The S.O.L.I.D. Principles. of Object Oriented Programming
The S.O.L.I.D. Principles of Object Oriented Programming Object-Oriented programming Encapsulation Abstraction Inheritance Polymorphism Decoupling Inheritance Parent (Base) class Child (Derived) Class
Notes from the Boards Set # 5 Page
1 Yes, this stuff is on the exam. Know it well. Read this before class and bring your questions to class. Starting today, we can no longer write our code as a list of function calls and variable declarations
Java Object Oriented Design. CSC207 Fall 2014
Java Object Oriented Design CSC207 Fall 2014 Design Problem Design an application where the user can draw different shapes Lines Circles Rectangles Just high level design, don t write any detailed code
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
CSCI 102L - Data Structures Midterm Exam #1 Fall 2011
Print Your Name: Page 1 of 8 Signature: Aludra Loginname: CSCI 102L - Data Structures Midterm Exam #1 Fall 2011 (10:00am - 11:12am, Wednesday, October 5) Instructor: Bill Cheng Problems Problem #1 (24
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
Department of Civil and Environmental Engineering, Spring Semester, ENCE 688R: Midterm Exam: 1 1/2 Hours, Open Book and Open Notes
Department of Civil and Environmental Engineering, Spring Semester, 2013 ENCE 688R: Midterm Exam: 1 1/2 Hours, Open Book and Open Notes Name : Question Points Score 1 30 2 30 3 40 Total 100 1 Question
CSE 143 Final Part 1, August 18, 2011 Sample Solution
Question 1. (16 points) Binary Search Trees. (a) Draw a picture that shows the integer binary search tree that results when the following numbers are inserted into a new, empty binary search tree in the