Model Solutions. COMP 102: Test May, 2014
|
|
|
- Amos Phelps
- 5 years ago
- Views:
Transcription
1 Family Name: Other Names: ID Number: Signature Model Solutions COMP 102: Test 2 12 May, 2014 Instructions Time allowed: 50 minutes Answer all the questions. There are 50 marks in total. 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 calculators and paper translation dictionaries. You may write notes and working on this paper, but make sure your answers are clear. Questions Marks 1. Understanding Loops [5] 2. Writing Loops [7] 3. Files [6] 4. Using Objects [7] 5. Event Driven Input [7] 6. Defining Classes [9] 7. More Loops [9] 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) Page 2 of 13 continued...
3 Student ID: Question 1. Understanding Loops [5 marks] Consider the following printout method. public void printout( int max){ int i = 0; int j = max; while ( i <= j){ UI. println ( "now: " + i + " and " + j); i = i + 2; j = j / 2; UI. println ("then: " + i + " and " + j); max: i: j: What will be printed if printout(48) is called? now: 0 and 48 now: 2 and 24 now: 4 and 12 now: 6 and 6 then: 8 and 3 COMP 102 (Terms Test 2) Page 3 of 13 continued...
4 Question 2. Writing loops [7 marks] Complete the following sumseries method so that it uses a loop to sum all the integers from 1 to its second argument, and prints out the result. For example sumseries(6) should add and print out Sum of integers from 1 to 6 = 21 Hints: Use two variables: one to count up to max, and one to keep the running total. The last line of the method is written for you. public void sumseries(int max){ int i = 1; int total = 0; while ( i <= max){ total = total + i ; i = i + 1; // or i++; UI. println ("Sum of integers from 1 to " + max + " = " + total); COMP 102 (Terms Test 2) Page 4 of 13 continued...
5 Student ID: Question 3. Files [6 marks] An auction room keeps lists of sheep for sale in a text file. The file contains one line for each different breed. Each line has the number of sheep and the breed of the sheep, for example: 510 Romney 380 Merino 150 Corriedale 18 Leicester 50 Coopworth 85 Friesian Complete the following totalsheep method that is passed the name of the file, will open a Scanner to read from the file, read all the data in the file, and then will print out the total number of sheep for sale in the file. For example, given the file above, it would print Total sheep: 1193 public void totalsheep(string filename){ try{ Scanner scan = new Scanner (new File(fileName)); int total = 0; while ( scan.hasnext() ) { int count = scan.nextint (); String breed = scan.nextline(); // or... scan.next (); total = total + count; UI. println ("Total sheep: " + total); catch(ioexception e){ui.println("fail: " + e); COMP 102 (Terms Test 2) Page 5 of 13 continued...
6 Question 4. Using Objects [7 marks] Consider the SheepSale class on the facing page What will the following fragment of code print out? (Note the variables carefully, and keep track of the fields in the objects.) SheepSale ss1 = new SheepSale("Romney", "Smith"); ss1.report (); ss1.bid(120); ss1.sold("murphy"); SheepSale ss2 = new SheepSale("Merino", "Jones"); ss2.bid(250); ss2.bid(90); ss1.bid(100); ss2.sold("brown"); ss1.report (); ss2.report (); ss1: ss2: breed: owner: price: breed: owner: price: Report: Smith : $0.0 Bid: $120.0 Sold: Smith --> $120.0 Bid: $250.0 Bid: $90.0 Bid: $100.0 Sold: Jones --> $90.0 Report: Murphy : $100.0 Report: Brown : $90.0 (Question 4 continued on next page) COMP 102 (Terms Test 2) Page 6 of 13 continued...
7 Student ID: (Question 4 continued) The SheepSale class: public class SheepSale{ private String breed; private String owner; private double price = 0.0; public SheepSale(String b, String o){ this.breed = b; this.owner = o; public void report(){ UI. println ("Report: " + this.owner +" : "+ this.breed $"+ this.price); public void bid(double offer){ this.price = offer ; UI. println ("Bid: " + this. breed $"+ this.price); public void sold(string buyer){ String oldowner = this.owner; this. owner = buyer; UI. println ("Sold: " + oldowner +" --> "+ this.owner $"+ this.price); COMP 102 (Terms Test 2) Page 7 of 13 continued...
8 Question 5. Event-Driven Input [7 marks] The DotMaker program on the facing page should allow the user to draw a picture made of blue dots on the graphics pane. Every time the user releases the mouse at a point on the graphics pane, the program should draw a filled blue circle of diameter 10, whose top-left corner is at the point. The program should have one button called Clear ; when the user clicks the button, the program should clear the graphics pane. Complete the DotMaker program. The diagram shows the result of the user clicking at positions (1), then (2), and then (3). Clear (Question 5 continued on next page) COMP 102 (Terms Test 2) Page 8 of 13 continued...
9 Student ID: (Question 5 continued) public class DotMaker implements UIMouseListener, UIButtonListener { private static final DIAM = 10; // size of the circles public DotMaker(){ UI.addButton("Clear", this); UI.setMouseListener(this); public void buttonperformed(string button){ if (button.equals("clear")){ UI.clearGraphics(); public void mouseperformed(string action, double x, double y){ if (action.equals("released")){ UI.setColor(Color.blue); UI. filloval (x, y, DIAM, DIAM); public static void main(string[] arguments){ new DotMaker(); COMP 102 (Terms Test 2) Page 9 of 13 continued...
10 Question 6. Defining Classes [9 marks] For this question, you are to complete part of a program for a computer game involving a flock of sheep: The sheep move across the screen from left to right, eating grass as they go. As they get fatter, they move more slowly. Initially, a sheep moves 10.0 units in each move. Every bite of grass slows it down by 0.1 unit, until it is moving just 2.0 units. If the dog barks at a sheep, the sheep is frightened, and for the next two moves, instead of moving across the screen, it will move up the screen. Complete the Sheep class on the facing page, which defines Sheep objects. You need to define: Fields: to store the state information about the sheep. The constructor: initialises the Sheep. The parameter is the y position of the Sheep. The x position is initially 0. The eat method: Parameter is the number of bites of grass. Each bite slows the sheep down, to a limit of 2.0. The barkat method: No parameters. Makes the sheep move upwards instead of to the right for the next two moves. The move method: No parameters. Moves the position of the sheep according to its current speed and whether it is frightened. The isfrightened method: No parameters. Returns a boolean value that is true if the sheep is currently frightened and false otherwise. Note, none of the methods need to call the draw method. COMP 102 (Terms Test 2) Page 10 of 13 continued...
11 Student ID: (Question 6 continued) public class Sheep{ private double x = 0; private double y; private double speed = 10.0; private int frightened = 0; public Sheep(double y){ this.y = y; public void eat( int bites){ this.speed = this.speed 0.1 bites; if (this.speed < 2.0) { this.speed = 2.0; public void barkat(){ this. frightened = 2; public void move(){ if (this. frightened > 0){ this.y = this.y this.speed; this. frightened = this. frightened 1; else{ this.x = this.x + this.speed; public boolean isfrightened(){ return this. frightened > 0; public void draw(){ if (this.isfrightened()){ UI.drawImage("frightened-sheep.png", x, y); else { UI.drawImage("plain-sheep.png", x, y); COMP 102 (Terms Test 2) Page 11 of 13 continued...
12 Question 7. More Loops [9 marks] The following drawstuff method draws lines and circles on the graphics pane. What will it draw if it is called with an argument of 250? this.drawstuff(250); Sketch the answer on the grid on the facing page. public void drawstuff(int size){ int diam = 50; boolean present = true; int left = 0; while ( left < size) { int top = 0; while (top < size){ if ( left < top ){ UI.drawLine(left, top, left +diam, top+diam); else if (present){ UI.drawOval(left, top, diam, diam); present = false; else { present = true; top = top + diam; left: top: present: left = left + diam; (Question 7 continued on next page) COMP 102 (Terms Test 2) Page 12 of 13 continued...
13 Student ID: (Question 7 continued) * * * * * * * * * * * * * * * COMP 102 (Terms Test 2) Page 13 of 13
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??
Model Solutions. COMP 102: Test May, 2012
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 45 minutes
Model Solutions. COMP 102: Test 2. 5 May, 2011
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 45 minutes
COMP 102: Test , September 25 ** WITH SOLUTIONS **
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 102: Test 2 2017, September
COMP 102: Test. 2017, May 15 ** WITH SOLUTIONS **
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 102: Test 2017, May 15
Model Solutions. COMP 102: Test 1. 6 April, 2016
Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Model Solutions COMP 102: Test
Model Solutions. COMP 102: Test. 18 August, 2016
Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Model Solutions COMP 102: Test
Model Solutions. COMP 102: Test March, 2014
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
Introduction to Programming: Test 2
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. Introduction to Programming:
Model Solutions. COMP 102: Test March, 2015
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 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
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
COMP 102: Test August, 2017
Family Name:.......................... Other Names:.......................... Student ID:............................ Signature.............................. COMP 102: Test 1 14 August, 2017 Instructions
COMP102: Test 1 Model Solutions
Family Name:.......................... Other Names:.......................... ID Number:............................ COMP102: Test 1 Model Solutions 27 July, 2007 Instructions Time allowed: 45 minutes.
Ū 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
Intro to Computer Programming: Final Exam
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. Intro to Computer Programming:
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. 14 August, 2014
Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Model Solutions COMP 102: Test
Java Programming: Test 1
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. Java Programming: Test 1 2016,
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.
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
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
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
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.
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 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.
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
COMP102: Test. 18 April, 2005
Name:.................................. ID Number:............................. Signature:............................... COMP102: Test 18 April, 2005 Instructions Time allowed: 1 1 2 hours. Answer all
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
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
COMP102: Test. 31 August, 2005
Name:.................................. ID Number:............................. Signature:............................... COMP102: Test 31 August, 2005 Instructions Time allowed: 1 1 2 hours. Answer all
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
The University of Western Ontario Department of Computer Science Computer Science 1026a Midterm Exam 2 hours
The University of Western Ontario Department of Computer Science Computer Science 1026a Midterm Exam 2 hours PRINT YOUR NAME: PRINT YOUR STUDENT NUMBER: Do not turn this page until instructed to do so!
COMP 103 : Test. 2018, Sept 12//(Corrected)
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 103 : Test 2018, Sept 12//(Corrected)
Exercise 13 Self-Study Exercise Sheet
Concepts of Object-Oriented Programming AS 2017 Exercise 13 Self-Study Exercise Sheet NOTE: This exercise sheet will not be discussed in an exercise session. We publish it now together with the solution
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
COMP 103 : Test. 2018, Sept 12//(Corrected) ** WITH SOLUTIONS
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 103 : Test 2018, Sept 12//(Corrected)
INTRODUCTION TO SOFTWARE SYSTEMS (COMP1110/COMP1140/COMP1510/COMP6710)
Important notice: This document is a sample exam. The final exam will differ from this exam in numerous ways. The purpose of this sample exam is to provide students with access to an exam written in a
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
Model Solutions. COMP 103: Test April, 2013
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 40 minutes
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
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
CSC 111, Test 1 (Fall 2009)
CSC 111, Test 1 (Fall 2009) Name There are 8 questions, many with sub-questions, as part of this test. Make sure you read and answer each question carefully and fully. Partial credit, while possible, will
Problem Grade Total
CS 101, Prof. Loftin: Final Exam, May 11, 2009 Name: All your work should be done on the pages provided. Scratch paper is available, but you should present everything which is to be graded on the pages
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
COMP102: Test Model Solutions
Name:.................................. ID Number:............................. Signature:............................... COMP102: Test Model Solutions 31 August, 2005 Instructions Time allowed: 1 1 2
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
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,
Exercise 13 Self-Study Exercise Sheet
Concepts of Object-Oriented Programming AS 2018 Exercise 13 Self-Study Exercise Sheet NOTE: This exercise sheet will not be discussed in an exercise session. We publish it now together with the solution
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
CONCORDIA UNIVERSITY Summer 2005 Comp 248 /1 Section AA Introduction to Programming Final Examination/A
NAME: ID: CONCORDIA UNIVERSITY Summer 2005 Comp 248 /1 Section AA Introduction to Programming Final Examination/A Instructor: N. Acemian Monday June 27, 2005 Duration: 3 hours INSTRUCTIONS: - Answer all
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
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
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%])
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
Dartmouth College Computer Science 10, Winter 2012 Final Exam
Dartmouth College Computer Science 10, Winter 2012 Final Exam Professor Drysdale Print your name: If you need more space to answer a question than we give you, you may use the backs of pages or you may
Practice Questions for Final Exam: Advanced Java Concepts + Additional Questions from Earlier Parts of the Course
: Advanced Java Concepts + Additional Questions from Earlier Parts of the Course 1. Given the following hierarchy: class Alpha {... class Beta extends Alpha {... class Gamma extends Beta {... In what order
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
Csci 102: Sample Exam
Csci 102: Sample Exam Duration: 65 minutes Name: NetID: Student to your left: Student to your right: DO NOT OPEN THIS EXAM UNTIL INSTRUCTED Instructions: Write your full name and your NetID on the front
CS 113 MIDTERM EXAM 2 SPRING 2013
CS 113 MIDTERM EXAM 2 SPRING 2013 There are 18 questions on this test. The value of each question is: 1-15 multiple choice (3 pts) 17 coding problem (15 pts) 16, 18 coding problems (20 pts) You may get
CS100M November 30, 2000
CS00M November 30, 2000 Makeup Solutions 7:30 PM 9:30 PM (Print last name, first name, middle initial/name) (Student ID) Statement of integrity: I did not, and will not, break the rules of academic integrity
CS170 Introduction to Computer Science Midterm 2
CS170 Introduction to Computer Science Midterm 2 03/25/2009 Name: Solution You are to honor the Emory Honor Code. This is a closed book and closednotes exam, and you are not to use any other resource than
Final Exam CS 152, Computer Programming Fundamentals December 9, 2016
Final Exam CS 152, Computer Programming Fundamentals December 9, 2016 Name: NetID: Answer all questions in the space provided. Write clearly and legibly, you will not get credit for illegible or incomprehensible
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
CS 132 Midterm Exam Fall 2004
Date:1-Nov-2004 Time:7:00-9:00p.m. Permitted Aids:None CS 132 Midterm Exam Fall 2004 Please complete this page in ink. Last Name: Signature: First Name: ID: Please check off your Practicum Section: Dana
Model Solutions. COMP 103: Mid-term Test. 19th of August, 2016
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 45 minutes
York University AK/ITEC OBJECT-BASED PROGRAMMING. Midterm Test Sample. Examiner: S.Y. Chen Duration: One Hour and Fifteen Minutes
York University AK/ITEC 1620 3.0 OBJECT-BASED PROGRAMMING Midterm Test Sample Examiner: S.Y. Chen Duration: One Hour and Fifteen Minutes This exam is closed textbook(s) and closed notes. Use of any electronic
Software and Programming 1
Software and Programming 1 Lab 8: Use of classes, static class variables and methods 1st March 2018 SP1-Lab8-2018.pdf Tobi Brodie (Tobi@dcs.bbk.ac.uk) 1 Lab 8 Objectives Understanding the encapsulation
CSCI 135 Exam #0 Fundamentals of Computer Science I Fall 2012
CSCI 135 Exam #0 Fundamentals of Computer Science I Fall 2012 Name: This exam consists of 7 problems on the following 6 pages. You may use your single- side hand- written 8 ½ x 11 note sheet during the
CSE 1223: Exam II Autumn 2016
CSE 1223: Exam II Autumn 2016 Name: Instructions: Do not open the exam before you are told to begin. This exam is closed book, closed notes. You may not use any calculators or any other kind of computing
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
Claremont McKenna College Computer Science
Claremont McKenna College Computer Science CS 51 Handout 4: Problem Set 4 February 10, 2011 This problem set is due 11:50pm on Wednesday, February 16. As usual, you may hand in yours until I make my solutions
8/27/13. An intro to programming* *Java. Announcements. Professor Rodger. The Link. UTAs start TONIGHT!
An intro to programming* *Java Announcements Professor Rodger The Link UTAs start TONIGHT! 2 1 Announcements Office hours Check the website! 3 Homework Recitation prep due BEFORE recitation on Friday Setup
CS110 Introduction to Computing Fall 2016 Practice Exam 1 -- Solutions
CS110 Introduction to Computing Fall 2016 Practice Exam 1 -- Solutions The exam will be closed-note and closed-book; please consider this fact before using your notes on this practice version. Please see
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).
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
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
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
CPSC 219 Extra review and solutions
CPSC 219 Extra review and solutions Multiple choice questions: Unless otherwise specified assume that all necessary variable declarations have been made. For Questions 1 6 determine the output of the print()
CSE wi Midterm Exam 2/8/18. Name UW ID #
Name UW ID # There are 11 questions worth a total of 120 points. Please budget your time so you get to all of the questions. Keep your answers brief and to the point. The exam is closed book, closed notes,
CS 455 Final Exam Spring 2018 [Bono] May 8, 2018
![CS 455 Final Exam Spring 2018 [Bono] May 8, 2018](/thumbs/88/117208965.jpg "CS 455 Final Exam Spring 2018 [Bono] May 8, 2018")
Name: USC NetID (e.g., ttrojan): CS 455 Final Exam Spring 2018 [Bono] May 8, 2018 There are 9 problems on the exam, with 74 points total available. There are 12 pages to the exam (6 pages double-sided),
(A) 99 ** (B) 100 (C) 101 (D) 100 initial integers plus any additional integers required during program execution
Ch 5 Arrays Multiple Choice Test 01. An array is a ** (A) data structure with one, or more, elements of the same type. (B) data structure with LIFO access. (C) data structure, which allows transfer between
CS 455 Midterm Exam 2 Fall 2015 [Bono] Nov. 10, 2015
![CS 455 Midterm Exam 2 Fall 2015 [Bono] Nov. 10, 2015](/thumbs/78/77722579.jpg "CS 455 Midterm Exam 2 Fall 2015 [Bono] Nov. 10, 2015")
Name: USC NetID (e.g., ttrojan): CS 455 Midterm Exam 2 Fall 2015 [Bono] Nov. 10, 2015 There are 9 problems on the exam, with 54 points total available. There are 8 pages to the exam (4 pages double-sided),
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
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
CS2102, B11 Exam 2. Name:
CS2102, B11 Exam 2 Name: You have 50 minutes to complete the problems on the following pages. There should be sufficient space provided for your answers. If a problem asks you to create an interface, you
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)
Computer Sciences 302 Exam 2 Information & Sample Exam
Computer Sciences 302 Exam 2 Information & Sample Exam Below you ll find information about the second midterm exam and sample exam questions. This sample is intended to be similar in length and difficulty
ESC101 : Fundamental of Computing
ESC101 : Fundamental of Computing End Semester Exam 19 November 2008 Name : Roll No. : Section : Note : Read the instructions carefully 1. You will lose 3 marks if you forget to write your name, roll number,
COE 212 Engineering Programming. Welcome to Exam II Tuesday November 28, 2018
1 COE 212 Engineering Programming Welcome to Exam II Tuesday November 28, 2018 Instructors: Dr. Dima El-khalil Dr. Jawad Fahs Dr. Joe Tekli Dr. Wissam F. Fawaz Name: Student ID: Instructions: 1. This exam