Model Solutions. COMP 102: Test March, 2015
|
|
|
- Christiana Perkins
- 5 years ago
- Views:
Transcription
1 Family Name: Other Names: ID Number: Signature Model Solutions COMP 102: Test 1 31 March, 2015 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. If you think some question is unclear, ask for clarification. Brief Java documentation is provided with the test This test contributes 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 your answers are clear. Questions Marks 1. Understanding programs [8] 2. Writing programs with input and output [7] 3. Writing methods that use objects [6] 4. Understanding arguments and parameters [8] 5. Defining and calling methods [8] 6. Writing methods with if and while [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 1) Page 2 of 14 continued...
3 Student ID: Question 1. Understanding programs [8 marks] (a) [4 marks] Understanding variables What will the following method print out? public void printstuff (){ int x = 5; int y = 10; UI. println ("Line 1: " + y); UI. println ("Line 2: " + (x+1)); x = x + 2; y = y + x; UI. println ("Line 3: "+ x); UI. println ("Line 4: "+ y); x: y: Line 1: 10 Line 2: 6 Line 3: 7 Line 4: 17 (Question 1 continued on next page) COMP 102 (Terms Test 1) Page 3 of 14 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 1) Page 4 of 14 continued...
5 Student ID: (Question 1 continued) (b) [4 marks] Understanding graphical output Sketch what the following method will draw in the graphics pane if the user enters the value 100? public void drawstuff(){ int ans = UI.askInt("position: "); UI.drawLine(20, 20, ans, ans); UI.drawRect(ans, ans, 20, ans 2); UI.drawOval(0, ans, ans, ans); * MENU * Extra copy: * MENU * COMP 102 (Terms Test 1) Page 5 of 14 continued...
6 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 1) Page 6 of 14 continued...
7 Student ID: Question 2. Writing programs with input and output [7 marks] Complete the showoval method below to draw an oval in the graphics pane and print out its area. The method should ask the user for the width and the height of the oval, calculate and print out the area, and draw a filled oval centered at (200, 200). For example, if you called showoval and entered 300 for the width and 100 for the height, the text pane and graphics pane should look like this: * MENU * Enter the width: 300 Enter the height: 100 The area is Hints: The area of an oval is width height π/4, Math.PI is a predefined constant with the value of π public void showoval() { UI. cleartext (); // clears the text pane UI. cleargraphics (); // clears the graphics pane double width = UI.askDouble("Enter the width:"); double height = UI.askDouble("Enter the height:"); double area = width height Math.PI /4; UI. println ("The area is " + area); double left = 200 width/2; double top = 200 height/2; UI. filloval ( left, top, width, height ); COMP 102 (Terms Test 1) Page 7 of 14 continued...
8 Question 3. Writing methods that use objects [6 marks] Suppose the GameGun class has one constructor and two methods: Constructor: public GameGun(double x, double y, double size, Color c) // constructs a GameGun object, with the specified position, size and color, // displays it at the specified position on the graphics pane. Methods: public void move(string direction, int dist ) // makes the gun move in the direction specified in the parameter // for the specified distance // Directions can be North, South, East, or West public void fire ( int rounds) // makes the gun fire the specified number of rounds. Complete the following game method, which should first create two GameGun objects at different positions, with different sizes and different colors. It should then make the first gun move south 50 units and fire 20 rounds, then make the second gun move east 100 units and fire 15 rounds, and finally move the first gun west 20 units and then fire 5 rounds from each gun. public void game(){ GameGun g1 = new GameGun(100, 30, 20, Color.red); GameGun g2 = new GameGun(200, 50, 50, Color.blue); g1.move("south", 50); g1. fire (20); g2.move("east", 100); g2. fire (15); g1.move("west",20); g2. fire (5); g1. fire (5); COMP 102 (Terms Test 1) Page 8 of 14 continued...
9 Student ID: Question 4. Understanding Arguments and Parameters [8 marks] The following liststaff method calls the printperson method several times. Show what liststaff will print in the text pane. public void liststaff (){ String expertise = "Databases"; String phone = "1234"; UI. println ("Current library staff:"); this. printperson ("Jack", "4321", "Reference"); this. printperson ("Jim", phone, expertise ); String name = "Jane"; expertise = "Restocking"; this. printperson ( expertise, "3535", name); this. printperson ("Julia", expertise, phone); public void printperson ( String name, String phone, String exp){ UI. println (name + " (" + exp + ")"); UI. println (" phone: " + phone); UI. println ("---"); expertise: phone: name: name: phone: exp: Current library staff: Jack (Reference) phone: Jim (Databases) phone: Restocking (Jane) phone: Julia (1234) phone: Restocking --- COMP 102 (Terms Test 1) Page 9 of 14 continued...
10 Question 5. Defining and Calling Methods [8 marks] The following shoppinglist method prints out labels for a number of shopping items and then prints the total cost of the items at the end. The labels show the name, the quantity, the unit price of the item, and the cost (quantity unit price) of the item. public void shoppinglist (){ UI. println (" name: Bread"); UI. println (" quantity: 1"); UI. println (" unit price: $3.50"); UI. println (" cost: $3.50"); UI. println (" name: milk"); UI. println (" quantity: 2"); UI. println (" unit price: $4.20"); UI. println (" cost: $8.40"); UI. println (" name: beer"); UI. println (" quantity: 4"); UI. println (" unit price: $3.00"); UI. println (" cost: $12.00"); UI. println (" name: chocolate"); UI. println (" quantity: 1"); UI. println (" unit price: $4.80"); UI. println (" cost: $4.80"); UI. println (); UI. println ("Total cost is: $28.70"); shoppinglist is not well designed: it has lots of repetition, and required the programmer to do lots of calculations. It would be better design to define another method called labelitem which calculates the cost of an item from the quantity and the unit price and then prints out a single label for the itme; and then make shoppinglist call the labelitem method four times and compute the total. Complete the definitions of shoppinglistfixed and labelitem on the facing page so that they print out the same labels as the original version. You will need to determine the appropriate arguments for the calls to labelitem, the appropriate header of labelitem, and the statements in the body of labelitem. Note that labelitem should return the cost of the item. You may assume that the quantity is always an integer. COMP 102 (Terms Test 1) Page 10 of 14 continued...
11 Student ID: public void shoppinglistfixed (){ double cost = this. labelitem ( cost = cost + this. labelitem ( cost = cost + this. labelitem ( cost = cost + this. labelitem ( "bread", 1, 3.5); "milk", 2, 4.2); "beer", 4, 3.0); "chocolate", 1, 4.8); UI. println (); UI. printf ("Total cost is: $%4.2f\n", cost); public double labelitem ( String name, int quantity, double price ){ double cost = price quantity ; UI. println (" "); UI. println (" name: " + name); UI. println (" quantity: " + quantity); UI. printf (" unit price: $%4.2f\n", price); UI. printf (" cost: $%4.2f\n", cost); UI. println (" "); return ; COMP 102 (Terms Test 1) Page 11 of 14 continued...
12 Question 6. Writing methods with if and while. [Hard] [8 marks] Complete the following checksentence method which should check whether the given String is an acceptable sentence for a particular web form. It should return false if the string fails any of the conditions, and should return true if the string passes all the conditions. An acceptable sentence 1. must end with the full stop character. 2. must start with a capital letter from A to Z. 3. must not contain a full stop character. anywhere in the sentence except the end. 4. must not contain more than 50 words (where words are separated by spaces). The more conditions you check, the higher your mark! Hint: Look at the methods for the String class on the second page of the documentation. (Question 6 continued on next page) COMP 102 (Terms Test 1) Page 12 of 14 continued...
13 Student ID: (Question 6 continued) public boolean checksentence(string sentence){ int len = sentence.length (); if (len < 2) {return false; String last = sentence. substring ( len 1,len); if (! last. equals(".")){ return false ; String first = sentence. substring (0,1); if ( first.compareto("a") < 0 first.compareto ("Z") > 0 ) { return false ; int index = sentence.indexof("."); if (index > 1 && index < len 1) {return false; int count = 0; String rest = sentence.trim (); while ( rest.indexof(" ")>0){ count++; rest = rest. substring ( rest.indexof(" "), rest. length ()). trim (); return (count <=50); * * * * * * * * * * * * * * * COMP 102 (Terms Test 1) Page 13 of 14
14 Alternative ways of checking the constraints for question 6: // ends with a. if (! sentence.endswith(".")) { return false; // does not contain. before the end. sentence = sentence. substring (0, sentence. length() 1); if (sentence. contains(".")) { return false ; //. only at the end (both conditions at once) if (sentence.indexof(".")!=sentence.length() 1) { return false; // Starts with capital : first letter is one of the capital letters : if (! ("ABCDEFGHIJKLMNOPQRSTUVWXYZ".contains(sentence.substring(0,1)))){ return false ; // Starts with capital : first letter is equal to its uppercase version, but have // to check that it is not punctuation or a digit if (! sentence. substring (0,1). equals(sentence. substring (0,1). touppercase()) sentence. substring (0,1). equals(sentence. substring (0,1). tolowercase())){ return false ; // Starts with capital : sentence isn t before A and is before [ ( first character after Z ) if (sentence.compareto("a") < 0 sentence.compareto("[")>= 0 ){return false; // Count words: (Note: we hadn t covered scanners by the time of the test!) int count = 0; Scanner sc = new Scanner(sentence);; while (sc.hasnext()){ sc.next (); count++; return (count <=50); COMP 102 (Terms Test 1) Page 14 of 14 continued...
Model Solutions. COMP 102: Test 1. 6 April, 2016
Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Model Solutions COMP 102: Test
COMP102: Test 1. Model Solutions
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. COMP102: Test 1 8 Apr, 2013 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,
COMP 102 : Test. 2017, Apr 3
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 102 : Test 2017, Apr 3
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 ** WITH SOLUTIONS **
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 102 : Test 2017, Apr 3
Model Solutions. COMP 102: Test May, 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
Model Solutions. COMP 102: Test March, 2014
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 May, 2016
Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Model Solutions COMP 102: Test
COMP 102: Test August, 2017
Family Name:.......................... Other Names:.......................... Student ID:............................ Signature.............................. COMP 102: Test 1 14 August, 2017 Instructions
COMP 102: Test , September 25 ** WITH SOLUTIONS **
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 102: Test 2 2017, September
COMP102: Test 1 Model Solutions
Family Name:.......................... Other Names:.......................... ID Number:............................ COMP102: Test 1 Model Solutions 27 July, 2007 Instructions Time allowed: 45 minutes.
Model Solutions. COMP 102: Test 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
Model Solutions. COMP 102: Test 2. 5 May, 2011
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 45 minutes
Introduction to Programming: Test 2
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. Introduction to Programming:
COMP102: Test 2 Model Solutions
Family Name:.......................... Other Names:.......................... ID Number:............................ Instructions Time allowed: 90 minutes (1 1 2 hours). There are 90 marks in total. Answer
COMP 102: Test , 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
COMP102: Test. 26 April, 2006
Name:.................................. ID Number:............................ Signature:.............................. COMP102: Test 26 April, 2006 Instructions Time allowed: 90 minutes (1 1 2 hours).
Solution Notes. COMP 151: Terms Test
Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Solution Notes COMP 151: Terms
Ū 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
U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2016 TRIMESTER 2 COMP 102 INTRODUCTION TO COMPUTER PROGRAM DESIGN
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW VICTORIA U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 26 TRIMESTER 2 COMP 2 INTRODUCTION TO COMPUTER PROGRAM DESIGN Time
COMP 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.
Model Solutions. COMP 103: Test May, 2013
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 45 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 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
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.
Intro to Computer Programming: Final Exam
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. Intro to Computer Programming:
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
Solutions to Quiz 1 (March 14, 2016)
MIT 6.005: Software Construction Max Goldman revised Wednesday 16 th March, 2016, 14:08 Solutions to Quiz 1 (March 14, 2016) Problem 1 (Multiple Choice) (20 points). (a) Which of the following must be
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
COMP 103 : Test. 2018, Sept 12//(Corrected)
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 103 : Test 2018, Sept 12//(Corrected)
Strings. Strings and their methods. Mairead Meagher Dr. Siobhán Drohan. Produced by: Department of Computing and Mathematics
Strings Strings and their methods Produced by: Mairead Meagher Dr. Siobhán Drohan Department of Computing and Mathematics http://www.wit.ie/ Topics list Primitive Types: char Object Types: String Primitive
U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2017 TRIMESTER 1 COMP 102 INTRODUCTION TO COMPUTER PROGRAM DESIGN
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW VICTORIA U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2017 TRIMESTER 1 COMP 102 INTRODUCTION TO COMPUTER PROGRAM DESIGN
Model Solutions. COMP 103: Test April, 2013
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 40 minutes
Mandatory Exercise 1 INF3110
Mandatory Exercise 1 INF3110 In this exercise, you are going to write a small interpreter for a simple language for controlling a robot on a 2-dimensional grid. The language is called ROBOL, a clever acronym
Ū 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 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 2010 END YEAR COMP103 Introduction to Data
COMP 103 : Test. 2019, Jan 9 ** WITH SOLUTIONS **
Family Name:.............................. Other Names:...................................... Signature.................................. COMP 103 : Test 2019, Jan 9 ** WITH SOLUTIONS ** Instructions Time
COMP 103 : Test. 2018, Sept 12//(Corrected) ** WITH SOLUTIONS
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 103 : Test 2018, Sept 12//(Corrected)
Midterm I Exam Principles of Imperative Computation André Platzer Ananda Gunawardena. February 23, Name: Andrew ID: Section:
Midterm I Exam 15-122 Principles of Imperative Computation André Platzer Ananda Gunawardena February 23, 2012 Name: Andrew ID: Section: Instructions This exam is closed-book with one sheet of notes permitted.
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
COMP102: Test. 31 August, 2005
Name:.................................. ID Number:............................. Signature:............................... COMP102: Test 31 August, 2005 Instructions Time allowed: 1 1 2 hours. Answer all
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
Using Java Classes Fall 2018 Margaret Reid-Miller
Using Java Classes 15-121 Fall 2018 Margaret Reid-Miller Today Strings I/O (using Scanner) Loops, Conditionals, Scope Math Class (random) Fall 2018 15-121 (Reid-Miller) 2 The Math Class The Math class
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
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
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
Exam 1 Prep. Dr. Demetrios Glinos University of Central Florida. COP3330 Object Oriented Programming
Exam 1 Prep Dr. Demetrios Glinos University of Central Florida COP3330 Object Oriented Programming Progress Exam 1 is a Timed Webcourses Quiz You can find it from the "Assignments" link on Webcourses choose
Final Exam CS 152, Computer Programming Fundamentals December 5, 2014
Final Exam CS 152, Computer Programming Fundamentals December 5, 2014 Name: NetID: Answer all questions in the space provided. Write clearly and legibly, you will not get credit for illegible or incomprehensible
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
2. [20] Suppose we start declaring a Rectangle class as follows:
![2. [20] Suppose we start declaring a Rectangle class as follows:](/thumbs/88/114683644.jpg "2. [20] Suppose we start declaring a Rectangle class as follows:")
1. [8] Create declarations for each of the following. You do not need to provide any constructors or method definitions. (a) The instance variables of a class to hold information on a Minesweeper cell:
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
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
CSE 143: Computer Programming II Summer 2017 HW5: Anagrams (due Thursday, August 3, :30pm)
CSE 143: Computer Programming II Summer 2017 HW5: Anagrams (due Thursday, August 3, 2017 11:30pm) This assignment focuses on recursive backtracking. Turn in the following files using the link on the course
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
COMP102: Test. 18 April, 2005
Name:.................................. ID Number:............................. Signature:............................... COMP102: Test 18 April, 2005 Instructions Time allowed: 1 1 2 hours. Answer all
The Irving K. Barber School of Arts and Sciences COSC 111 Final Exam Winter Term II Instructor: Dr. Bowen Hui. Tuesday, April 19, 2016
First Name (Print): Last Name (Print): Student Number: The Irving K. Barber School of Arts and Sciences COSC 111 Final Exam Winter Term II 2016 Instructor: Dr. Bowen Hui Tuesday, April 19, 2016 Time: 6:00pm
More on variables and methods
More on variables and methods Robots Learning to Program with Java Byron Weber Becker chapter 7 Announcements (Oct 12) Reading for Monday Ch 7.4-7.5 Program#5 out Character Data String is a java class
QUIZ 2 Introduction to Computer Science (COMP 250) Mon. March 2, 2009 Professor Michael Langer
QUIZ 2 Introduction to Computer Science (COMP 250) Mon. March 2, 2009 Professor Michael Langer STUDENT NAME: ID: The exam consists of five questions. There are a total of 10 points. You may use the back
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
Activity 4: Methods. Content Learning Objectives. Process Skill Goals
Activity 4: Methods Java programs are organized into classes, each of which has one or more methods, each of which has one or more statements. Writing methods allows you to break down a complex program
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
Quiz 1 (March 14, 2016)
MIT 6.005: Software Construction Max Goldman revised Sunday 13 th March, 2016, 15:30 Quiz 1 (March 14, 2016) Your name: Your Athena username: You have 50 minutes to complete this quiz. It contains 12 pages
Assoc. Prof. Marenglen Biba. (C) 2010 Pearson Education, Inc. All rights reserved.
Assoc. Prof. Marenglen Biba (C) 2010 Pearson Education, Inc. All This chapter discusses class String, from the java.lang package. These classes provide the foundation for string and character manipulation
Handout 3 cs180 - Programming Fundamentals Fall 17 Page 1 of 6. Handout 3. Strings and String Class. Input/Output with JOptionPane.
Handout 3 cs180 - Programming Fundamentals Fall 17 Page 1 of 6 Handout 3 Strings and String Class. Input/Output with JOptionPane. Strings In Java strings are represented with a class type String. Examples:
Computer Science 300 Sample Exam Today s Date 100 points (XX% of final grade) Instructor Name(s) (Family) Last Name: (Given) First Name:
Computer Science 300 Sample Exam Today s Date 100 points (XX% of final grade) Instructor Name(s) (Family) Last Name: (Given) First Name: CS Login Name: NetID (email): @wisc.edu Circle your Lecture: Lec001
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
CS 455 Final Exam Fall 2015 [Bono] Dec. 15, 2015
![CS 455 Final Exam Fall 2015 [Bono] Dec. 15, 2015](/thumbs/80/81764561.jpg "CS 455 Final Exam Fall 2015 [Bono] Dec. 15, 2015")
Name: USC NetID (e.g., ttrojan): CS 455 Final Exam Fall 2015 [Bono] Dec. 15, 2015 There are 6 problems on the exam, with 70 points total available. There are 10 pages to the exam (5 pages double-sided),
Java for Non Majors. Final Study Guide. April 26, You will have an opportunity to earn 20 extra credit points.
Java for Non Majors Final Study Guide April 26, 2017 The test consists of 1. Multiple choice questions 2. Given code, find the output 3. Code writing questions 4. Code debugging question 5. Short answer
COMP 250 Midterm #2 March 11 th 2013
NAME: STUDENT ID: COMP 250 Midterm #2 March 11 th 2013 - This exam has 6 pages - This is an open book and open notes exam. No electronic equipment is allowed. 1) Questions with short answers (28 points;
Sample questions for CS111 Midterm Exam 2
Sample questions for CS111 Midterm Exam 2 1 Problem 1 [30 points] a) [15 points] Write a recursive method called power() that, given an integer n, returns 2 n (2 to the n th power). Recall that 2 0 = 1
BCIS 3630 Dr. GUYNES SPRING 2018 TUESDAY SECTION [JAN version] GRADER COURSE WEBSITE
![BCIS 3630 Dr. GUYNES SPRING 2018 TUESDAY SECTION [JAN version] GRADER COURSE WEBSITE](/thumbs/89/97511194.jpg "BCIS 3630 Dr. GUYNES SPRING 2018 TUESDAY SECTION [JAN version] GRADER COURSE WEBSITE")
COURSE WEBSITE http://www.steveguynes.com/bcis3630/bcis3630/default.html Instructor: Dr. Guynes Office: BLB 312H Phone: (940) 565-3110 Office Hours: By Email Email: steve.guynes@unt.edu TEXTBOOK: Starting
Assoc. Prof. Marenglen Biba. (C) 2010 Pearson Education, Inc. All rights reserved.
Assoc. Prof. Marenglen Biba (C) 2010 Pearson Education, Inc. All Advanced Java This chapter discusses class String, class StringBuilder and class Character from the java.lang package. These classes provide
Data Types and the while Statement
Session 2 Student Name Other Identification Data Types and the while Statement In this laboratory you will: 1. Learn about three of the primitive data types in Java, int, double, char. 2. Learn about the
Computer Science II Data Structures
Computer Science II Data Structures Instructor Sukumar Ghosh 201P Maclean Hall Office hours: 10:30 AM 12:00 PM Mondays and Fridays Course Webpage homepage.cs.uiowa.edu/~ghosh/2116.html Course Syllabus
Midterm I Exam Principles of Imperative Computation André Platzer Ananda Gunawardena. February 23, 2012
Midterm I Exam 15-122 Principles of Imperative Computation André Platzer Ananda Gunawardena February 23, 2012 Name: Sample Solution Andrew ID: aplatzer Section: Instructions This exam is closed-book with
M105: Introduction to Programming with Java Midterm Examination (MTA) Makeup Spring 2013 / 2014
M105: Introduction to Programming with Java Midterm Examination (MTA) Makeup Spring 2013 / 2014 Question One: Choose the correct answer and write it on the external answer booklet. 1. Java is. a. case
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
EXAMINATIONS 2015 COMP103 INTRODUCTION TO DATA STRUCTURES AND ALGORITHMS
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 2015 TRIMESTER 2 COMP103 INTRODUCTION
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
CS261: HOMEWORK 2 Due 04/13/2012, at 2pm
CS261: HOMEWORK 2 Due 04/13/2012, at 2pm Submit six *.c files via the TEACH website: https://secure.engr.oregonstate.edu:8000/teach.php?type=want_auth 1. Introduction The purpose of HW2 is to help you
Do not turn to the next page until the start of the exam.
Principles of Java Language with Applications, PIC20a E. Ryu Fall 2017 Final Exam Monday, December 11, 2017 3 hours, 8 questions, 100 points, 9 pages While we don t expect you will need more space than
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
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
Good Luck! CSC207, Fall 2012: Quiz 1 Duration 25 minutes Aids allowed: none. Student Number:
CSC207, Fall 2012: Quiz 1 Duration 25 minutes Aids allowed: none Student Number: Last Name: Lecture Section: L0101 First Name: Instructor: Horton Please fill out the identification section above as well
CS 101 Fall 2006 Midterm 1 Name: ID:
You only need to write your name and e-mail ID on the first page. This exam is CLOSED text book, closed-notes, closed-calculator, closed-neighbor, etc. Questions are worth different amounts, so be sure
Searching and Strings. IST 256 Application Programming for Information Systems
Searching and Strings IST 256 Application Programming for Information Systems Searching for Strings In an array, we do a simple linear search for an item by going through the array in order from the first
CS 455 Midterm Exam 1 Fall 2017 [Bono] Thursday, Sep. 28, 2017
![CS 455 Midterm Exam 1 Fall 2017 [Bono] Thursday, Sep. 28, 2017](/thumbs/95/124125387.jpg "CS 455 Midterm Exam 1 Fall 2017 [Bono] Thursday, Sep. 28, 2017")
Name: USC NetID (e.g., ttrojan): CS 455 Midterm Exam 1 Fall 2017 [Bono] Thursday, Sep. 28, 2017 There are 6 problems on the exam, with 55 points total available. There are 10 pages to the exam (5 pages
Chapter 5 Control Statements: Part 2 Section 5.2 Essentials of Counter-Controlled Repetition
Chapter 5 Control Statements: Part 2 Section 5.2 Essentials of Counter-Controlled Repetition 5.2 Q1: Counter-controlled repetition requires a. A control variable and initial value. b. A control variable
(a) This midterm exam is very easy! (b) In Java the return value of a method can be ignored.
ComS 207: Programming I Midterm 1, Tue. Sep 18, 2007 Student Name: Student ID Number: Recitation Section: 1. True/False Questions (10 x 1p each = 10p) (a) This midterm exam is very easy! (b) In Java the
Week 6: Review. Java is Case Sensitive
Week 6: Review Java Language Elements: special characters, reserved keywords, variables, operators & expressions, syntax, objects, scoping, Robot world 7 will be used on the midterm. Java is Case Sensitive
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
Model Solutions. COMP 103: Mid-term Test. 19th of August, 2016
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 45 minutes
Practice exam for CMSC131-04, Fall 2017
Practice exam for CMSC131-04, Fall 2017 Q1 makepalindrome - Relevant topics: arrays, loops Write a method makepalidrome that takes an int array, return a new int array that contains the values from the