Model Solutions. COMP 102: Test May, 2016
|
|
|
- Eleanore Willis
- 6 years ago
- Views:
Transcription
1 Family Name: Other Names: ID Number: Signature Model Solutions COMP 102: Test 2 11 May, 2016 Instructions Time allowed: 50 minutes Answer all the questions. There are 45 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 while [5] 2. Writing with while [8] 3. Defining Classes [10] 4. Event Driven Input [9] 5. Files [13] 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 12 continued...
3 Student ID: Question 1. Understanding while [5 marks] Consider the following printout method. public void printout( int x, int y) { x: y: while (x < y) { UI. println (x); x = x + 1; y = y 1; UI. println ("Done"); What will be printed if printout(3,10) is called? Hint: Show your working using the boxes for x and y above. Write your answers here Done What will be printed if printout(10, 5) is called? Write your answers here Done COMP 102 (Terms Test 2) Page 3 of 12 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. COMP 102 (Terms Test 2) Page 4 of 12 continued...
5 Student ID: Question 2. Writing with while [8 marks] Complete the following drawcircles method so that it uses a loop to draw concentric circles with equal spacing, as shown below The parameters specify the location of the center (x, y) and the radius of the biggest circle. The radius of each circle is 20 less than the radius of the previous circle. The smallest circle must have a radius of at least 20. For example, drawcircles(250, 200, 100) should draw the pattern above. Hint: remember that the diameter of a circle is 2 the radius. public void drawcircles(double x, double y, double radius) { while (radius >= 20) { double left = x radius; double top = y radius; UI.drawOval(left, top, radius 2, radius 2); radius = radius 20; COMP 102 (Terms Test 2) Page 5 of 12 continued...
6 Question 3. Defining Classes [10 marks] This question concerns a program for a game in which a rabbit moves around a 5 5 board looking for food You are to complete the Rabbit class below. Note that the draw method is written for you. A rabbit knows its current location (the row and column of the board), and its current direction ( North, South, East, or West ). It can turn to a new direction, and it can jump a specified number of squares in its current direction. Define fields to store the following information: location of the Rabbit, direction the Rabbit is facing, Complete the constructor which initializes the Rabbit object with the location and the initial direction. Note that the parameters specify the row and the column number. the turn(string dir) method, which changes the direction that the Rabbit is facing. The argument can be North, South, East, or West. the jump(int steps) method, which makes the Rabbit change its location by the specified number of steps in the current direction. For example, if it is at position (3,2) and facing East (as in the diagram above), jump(2) should move it to position (3, 4). jump should never take the rabbit beyond the edge of the board (row or column less than 1 or greater than 5). For example jump(4) from the position (3, 2) should make it end up at (3, 5), not (3,6). COMP 102 (Terms Test 2) Page 6 of 12 continued...
7 Student ID: class Rabbit { // fields private int row; private int col; private String direction ; public Rabbit ( int row, int col, String dir ){ this.row = row; this.col = col; this. direction = dir ; public void turn(string newdir){ this. direction = newdir; public void jump(int steps){ if (this. direction. equals("north")){ this. row = this.row steps; if (this. row<1) {this.row = 1; else if (this. direction. equals("south")){ this. row = this.row + steps; if (this. row>5) {this.row = 5; else if (this. direction. equals("west")){ this.col = this.col steps; if (this.col<1) {this.col = 1; else if (this. direction. equals("east")){ this. col = this. col + steps; if (this. col>5) {this.col = 5; public void draw(){ // Board.SIZE is the size of each square, predefined as 40 double left = 100+(this.col 1) Board.SIZE; double top = 100+(this.row 1) Board.SIZE; UI.drawImage("rabbit.png", left, top, Board.SIZE, Board.SIZE); COMP 102 (Terms Test 2) Page 7 of 12 continued...
8 Question 4. Event-Driven Input [9 marks] Complete the DrawLines program on the facing page so that it allows the user to draw sequences of connected lines on the graphics pane. The program should have two buttons: New Sequence, which should allow the user to start a new sequence of lines Clear, which should clear the graphics pane. The diagram shows an example of what the program might draw if the user clicked the mouse at positions 1 to 4, then clicked the New Sequence button, and then clicked the mouse at positions 6 to 8. (The arrows show where the user clicked.) New Sequence Clear Hint: When the user clicks in the graphics pane: If the program is starting a new sequence, it should simply remember the mouse position. If the program is in the middle of a sequence, it should draw a line from the previous mouse position to the new mouse position. (Question 4 continued on next page) COMP 102 (Terms Test 2) Page 8 of 12 continued...
9 Student ID: (Question 4 continued) public class DrawLines { // Fields private double prex; private double prey; private boolean start = true; // Constructor: set up buttons and mouse public DrawLines(){ UI.setMouseListener(this::doMouse); UI.addButton("New Sequence", this::doline); UI.addButton("Clear", UI::clearGraphics); // Methods to respond to buttons and mouse public void doline(){ this. start = true; public void domouse(string action, double x, double y){ if (action.equals("released")){ if (this. start ){ this.prex = x; this.prey = y; this. start = false; else { UI.drawLine(this.preX, this.prey, x, y); this.prex = x; this.prey = y; COMP 102 (Terms Test 2) Page 9 of 12 continued...
10 Question 5. Files [13 marks] Suppose a file has information about departing flights. Each line has the name of the airline, the flight number, destination, time, the boarding gate number and some notes, for example: Virgin Australia VA113 Palmerston North 16:35 4 boarding Air New Zealand NZ6204 Auckland 21:55 6 go to gate Air New Zealand NZ5372 Christchurch 22:45 1 relax Consider the following readfromfile method. public void readfromfile(string filename){ try{ Scanner scan = new Scanner (new File(fileName)); String line = scan.nextline(); String token = scan.next(); UI. println (scan.next ()); if (scan.hasnextint()){ UI. println (scan.nextint ()); else{ scan.next(); UI. println (scan.nextline()); UI. println (token); catch(ioexception e){ui.println("fail: " + e); (a) [5 marks] What will be printed if this method is called using the example file shown above? Write your answers here New NZ6204 Auckland 21:55 6 go to gate Air COMP 102 (Terms Test 2) Page 10 of 12 continued...
11 Student ID: (b) [8 marks] Complete the following findgate method which is passed the name of a file and the flight number. The findgate method should go through the file, find the flight number, then find its boarding gate number, and print them out. If the flight number is not found, it should print a not found message. For example, using the example file above, findgate( example.txt, NZ6204 ) should print NZ6204 at gate: 6 Hint: Note that the airline name, the city name and the notes can have multiple words. You may assume that each line of the file is always in the same format. There is no missing data. The flight number is always one word, and the gate numbers are the only integers in the file. public void findgate(string filename, String flightno ){ try { Scanner scan = new Scanner (new File(fileName)); while ( scan.hasnext() ) { String n = scan.next(); if (n.equals(flightno )){ while(!scan.hasnextint()){ scan.next(); if (scan.hasnextint()){ UI. println ( flightno + " at Gate: " + scan.nextint()); return; UI. println ( flightno + " was not found"); catch(ioexception e){ui.println("fail: " + e); catch(ioexception e){ui.println("fail: " + e); * * * * * * * * * * * * * * * COMP 102 (Terms Test 2) Page 11 of 12
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) Page 12 of 12 continued...
COMP 102: Test , September 25 ** WITH SOLUTIONS **
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 102: Test 2 2017, September
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, 2014
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 , December?? ** WITH SOLUTIONS **
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 102: Test 2 2017, December??
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 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
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
Model Solutions. COMP 102: Test March, 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:
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 August, 2017
Family Name:.......................... Other Names:.......................... Student ID:............................ Signature.............................. COMP 102: Test 1 14 August, 2017 Instructions
COMP 102/112 : Test. 2019, Apr 1 ** WITH SOLUTIONS **
Family Name:.............................. Other Names:...................................... Signature.................................. COMP 102/112 : Test 2019, Apr 1 ** WITH SOLUTIONS ** Instructions
COMP 102 : Test. 2017, Apr 3
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 102 : Test 2017, Apr 3
COMP 102 : Test. 2017, Apr 3 ** WITH SOLUTIONS **
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 102 : Test 2017, Apr 3
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:
Ū 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
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.
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. 14 August, 2014
Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Model Solutions COMP 102: Test
COMP102: Test. 26 April, 2006
Name:.................................. ID Number:............................ Signature:.............................. COMP102: Test 26 April, 2006 Instructions Time allowed: 90 minutes (1 1 2 hours).
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
Solution Notes. COMP 151: Terms Test
Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Solution Notes COMP 151: Terms
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 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 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
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 103 : Test. 2018, Sept 12//(Corrected)
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 103 : Test 2018, Sept 12//(Corrected)
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: 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 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)
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
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
Ū 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
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
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
EXAM Computer Science 1 Part 1
Maastricht University Faculty of Humanities and Science Department of Knowledge Engineering EXAM Computer Science 1 Part 1 Block 1.1: Computer Science 1 Code: KEN1120 Examiner: Kurt Driessens Date: Januari
Model Solutions. COMP 103: Mid-term Test. 21st of August, 2014
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 50 minutes
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
Model Solutions. COMP 103: Test May, 2013
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 45 minutes
CMPSCI 187: Programming With Data Structures. Lecture #15: Thinking Recursively David Mix Barrington 10 October 2012
CMPSCI 187: Programming With Data Structures Lecture #15: Thinking Recursively David Mix Barrington 10 October 2012 Thinking Recursively Recursive Definitions, Algorithms, and Programs Computing Factorials
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
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: Test April, 2013
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 40 minutes
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
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 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
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
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,
(a) Assume that in a certain country, tax is payable at the following rates:
3 1. (Total = 12 marks) (a) Assume that in a certain country, tax is payable at the following rates: 15% on your first $50000 income 25% on any amount over $50000 Write a method that takes in an annual
You must bring your ID to the exam.
Com S 227 Spring 2017 Topics and review problems for Exam 2 Monday, April 3, 6:45 pm Locations, by last name: (same locations as Exam 1) A-E Coover 2245 F-M Hoover 2055 N-S Physics 0005 T-Z Hoover 1213
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
All program statements you write should be syntactically correct. Partial credit is not guaranteed with incorrect use of syntax.
With Solutions in Red CS110 Introduction to Computing Fall 2012 Section 2 Exam 1 This is an open notes exam. Computers are not permitted. Your work on this exam must be your own. Answer all questions in
COMP102: Test. 31 August, 2005
Name:.................................. ID Number:............................. Signature:............................... COMP102: Test 31 August, 2005 Instructions Time allowed: 1 1 2 hours. Answer all
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,
Practice Midterm Examination
Steve Cooper Handout #28 CS106A May 1, 2013 Practice Midterm Examination Midterm Time: Tuesday, May 7, 7:00P.M. 9:00P.M. Portions of this handout by Eric Roberts and Patrick Young This handout is intended
Midterm Exam 2A Principles of Computing Fall November 10, 2014
Midterm Exam 2A 15110 Principles of Computing Fall 2014 November 10, 2014 Name: Andrew ID: Lab section: Instructions Answer each question neatly in the space provided. There are 6 questions totaling 28
APCS Semester #1 Final Exam Practice Problems
Name: Date: Per: AP Computer Science, Mr. Ferraro APCS Semester #1 Final Exam Practice Problems The problems here are to get you thinking about topics we ve visited thus far in preparation for the semester
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
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
Model Solutions. COMP 103: Mid-term Test. 19th of August, 2016
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 45 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
Spring 2018 June 20 th, 2018 Extra Practice Problems. Short Problems
CS106A Chris Piech Spring 2018 June 20 th, 2018 Extra Practice Problems Some of these problems are courtesy of Julia Daniel! Short Problems 1. Read integers in the console from a user until the user enters
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
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
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
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
CSC Java Programming, Fall Java Data Types and Control Constructs
CSC 243 - Java Programming, Fall 2016 Java Data Types and Control Constructs Java Types In general, a type is collection of possible values Main categories of Java types: Primitive/built-in Object/Reference
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).
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),
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),
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
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
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
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
Object-oriented Programming and Software Engineering CITS1001. Multiple-choice Mid-semester Test
Object-oriented Programming and Software Engineering CITS1001 Multiple-choice Mid-semester Test Semester 1, 2015 Mark your solutions on the provided answer page, by filling in the appropriate circles.
COMPUTER APPLICATIONS
COMPUTER APPLICATIONS (Theory) (Two hours) Answers to this Paper must be written on the paper provided separately. You will not be allowed to write during the first 15 minutes. This time is to be spent
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
COMP 202 Java in one week
CONTENTS: Basics of Programming Variables and Assignment Data Types: int, float, (string) Example: Implementing a calculator COMP 202 Java in one week The Java Programming Language A programming language
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
The Maze Runner. Alexander Kirillov
The Maze Runner URL: http://sigmacamp.org/mazerunner E-mail address: shurik179@gmail.com Alexander Kirillov This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License.
CSE 142, Winter 2007 Final Exam. Name:
1 of 10 CSE 142, Winter 2007 Final Exam Name: Section: Student ID #: TA: You have 110 minutes to complete this exam. You may receive a deduction if you keep working after the instructor calls for papers.
EXAMINATIONS 2017 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 2017 TRIMESTER 2 COMP103 INTRODUCTION TO DATA STRUCTURES AND ALGORITHMS
Assignment 4: Dodo gets smarter
Assignment 4: Dodo gets smarter Algorithmic Thinking and Structured Programming (in Greenfoot) 2017 Renske Smetsers-Weeda & Sjaak Smetsers 1 Contents Introduction 1 Learning objectives 1 Instructions 1
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
Control Flow: Loop Statements
Control Flow: Loop Statements A loop repeatedly executes a of sub-statements, called the loop body. Python provides two kinds of loop statements: a for-loop and a while-loop. This exercise gives you practice
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%])
York University AS/AK/ITEC INTRODUCTION TO DATA STRUCTURES. Midterm Sample I. Examiner: S. Chen Duration: One Hour and 30 Minutes
York University AS/AK/ITEC 2620 3.0 INTRODUCTION TO DATA STRUCTURES Midterm Sample I Examiner: S. Chen Duration: One Hour and 30 Minutes This exam is closed textbook(s) and closed notes. Use of any electronic
CSE 143 Final Exam Part 1 - August 18, 2011, 9:40 am
CSE 143 Final Exam Part 1 - August 18, 2011, 9:40 am Name Student ID # Section TA Name The exam is closed book, closed notes, closed devices, except that you may have a 5x8 card with handwritten notes
SAMPLE EXAM Exam 2 Computer Programming 230 Dr. St. John Lehman College City University of New York Thursday, 5 November 2009
SAMPLE EXAM Exam 2 Computer Programming 230 Dr. St. John Lehman College City University of New York Thursday, 5 November 2009 NAME (Printed) NAME (Signed) E-mail Exam Rules Show all your work. Your grade
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
Project MineSweeper Collaboration: Solo Complete this Project by yourself or with help from Section Leaders and Rick You are asked to write the non-graphical user interface aspects of the popular game
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
CS 307 Midterm 2 Spring 2008
Points off 1 2 3 4 Total off Net Score Exam Number: CS 307 Midterm 2 Spring 2008 Name UTEID login name TA's Name: Mario Ruchica Vishvas (Circle One) Instructions: 1. Please turn off your cell phones and
CS 177 Week 15 Recitation Slides. Review
CS 177 Week 15 Recitation Slides Review 1 Announcements Final Exam on Friday Dec. 18 th STEW 183 from 1 3 PM Complete your online review of your classes. Your opinion matters!!! Project 6 due Just kidding