Model Solutions. COMP 102: Test March, 2014
|
|
|
- Geoffrey Reed
- 5 years ago
- Views:
Transcription
1 Family Name: Other Names: ID Number: Signature Model Solutions COMP 102: Test 1 31 March, 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. 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 with input and output [6] 2. Writing programs with input and output [7] 3. Understanding variables and expressions [5] 4. Writing methods with graphical output [6] 5. Writing methods that use objects [6] 6. Defining and Calling Methods [10] 7. Writing methods with if, return, and while [10] TOTAL:
2 SPARE PAGE FOR EXTRA ANSWERS Cross out rough working that you do not want marked. Specify the question number for work that you do want marked. COMP 102 (Terms Test 1) Page 2 of 12 continued...
3 Student ID: Question 1. Understanding programs with input and output [6 marks] What will the following program do if the drawit method is called, and the user types kitten when asked for input? Write and sketch your answer on the diagram below, showing what will be in the text pane and the graphics pane of the UI window. import ecs100. ; public class Drawer{ public static final double Size = 100; public static final double CenterX = 300; public static final double CenterY = 200; public void drawit(){ String item = UI.askString("What label: "); double left = CenterX Size/2; double top = CenterY Size/2; UI.drawRect( left, top, Size, Size ); UI.drawString(item, CenterX, CenterY); item: left: top: * MENU * What is it: kitten kitten 300 COMP 102 (Terms Test 1) Page 3 of 12 continued...
4 Question 2. Writing programs with input and output [7 marks] Complete the following printoctogonarea method to calculate the area of a regular octogon. The method should ask the user for the length of the side and then calculate and print out the area. Note, the area of a regular octogon is six times the square of the length of the side. [After Test Note: this is not the correct formula!!!] For example, if you called the printoctogonarea method and entered 10 when asked for the length, the interaction would be: Length of side: 10 Area = 600 public void printoctogonarea(){ double length = UI.askInt("Length of side:"); double area = 6 length length ; UI. println ("Area = " + area); COMP 102 (Terms Test 1) Page 4 of 12 continued...
5 Student ID: Question 3. Understanding variables and expressions [5 marks] Consider the following mixup method. In the box below, write the text that mixup would output. Note that the first part of each line of output is provided for you. Hint: Keep track of the values of the variables in the boxes. public void mixup(){ String name = "Jim"; int big = 5; int small = 10; UI. println ("1 name: "+name); UI. println ("1 big: "+big); UI. println ("1 small: "+small); name = name + big + small; big = small + big; small = big 2; UI. println ("2 small: "+small); UI. println ("2 big: "+big); UI. println ("2 name: "+name); name: big: small: 1 name: Jim 1 big: 5 1 small: 10 2 small: 30 2 big: 15 2 name: Jim510 COMP 102 (Terms Test 1) Page 5 of 12 continued...
6 Question 4. Writing methods with graphical output [6 marks] Complete the drawglasses method below, so that it draws a pair of glasses in the graphics pane, as shown here: GlassesX GlassesY Result of calling this.drawglasses(80); drawglasses has one parameter (diam), and should draw the outline of two red circles sideby-side touching each other on the graphics pane. The diameter of the circles should be the argument that was passed to the method. The place the circles touch should be at position (200,100). Your method should use the constants. import ecs100. ; import java.awt.color; public class GlassesDrawer{ public static final double GlassesX = 200; public static final double GlassesY = 100; public void drawglasses(double diam){ double top = GlassesY diam/2; double leftleft = GlassesX diam; UI. setcolor (Color.red ); UI.drawOval( leftleft, top, diam, diam); UI.drawOval(GlassesX, top, diam, diam); COMP 102 (Terms Test 1) Page 6 of 12 continued...
7 Student ID: Question 5. Writing methods that use objects [6 marks] Suppose the Snail class has one constructor and two methods: Constructor: Methods: public Snail (double size, Color color ) // constructs a Snail object, of the specified size and color, // displays it at a random position along the bottom of the graphics pane, facing up. public void crawl( int time) // makes the snail move up the screen for the specified number of seconds, // leaving a trail behind it. public void eat() // makes the Snail eat some grass, leaving bits of grass around it. Complete the following snailrace method, which should first create two Snail objects, of different sizes and different colors. It should then make the first snail crawl for 5 seconds, then make the second snail crawl for 4 seconds, then make each snail eat, and then the first snail crawl for 10 seconds and the second snail eat again. public void snailrace (){ Snail s1 = new Snail(30, Color.red ); Snail s2 = new Snail(50, Color. blue ); s1. crawl (5); s2. crawl (4); s1.eat (); s2.eat (); s1. crawl (10); s2.eat (); COMP 102 (Terms Test 1) Page 7 of 12 continued...
8 Question 6. Defining and Calling Methods [10 marks] The following printlabels method prints out labels for items for a bus company. The labels show the destination city, the weight (with a note if the item is over 20kg), the type of the item (luggage or parcel), and a loading instruction depending on the item type. public void printlabels (){ UI. println ("* City: Taupo"); UI. println ("* Weight: 17.5 kg"); UI. println ("* Type: Luggage"); UI. println ("* Loading: Stow forward"); UI. println (); UI. println ("* City: Auckland"); UI. println ("* Weight: 33.0 kg"); UI. println ("* HEAVY!"); UI. println ("* Type: Parcel"); UI. println ("* Loading: stow at rear"); UI. println (); UI. println ("* City: Hamilton"); UI. println ("* Weight: 19.1 kg"); UI. println ("* Type: Parcel"); UI. println ("* Loading: stow at rear"); UI. println (); UI. println ("* City: Auckland"); UI. println ("* Weight: 24.8 kg"); UI. println ("* HEAVY!"); UI. println ("* Type: Luggage"); UI. println ("* Loading: Stow forward"); UI. println (); (Question 6 continued on next page) COMP 102 (Terms Test 1) Page 8 of 12 continued...
9 Student ID: (Question 6 continued) printlabels is not well designed: it has quite a bit of repetition. It would be better design to define another method called printonelabel which prints out a single label, and make printlabels call the printonelabel method four times, as in the version of printlabels below. Complete the definitions of printlabels and printonelabel below so that they print out the same labels as the original version. You will need to determine the appropriate arguments for the calls to printonelabel, the appropriate parameters in the header of printonelabel, and the statements in the body of printlabels. You should not use more than three parameters. public void printlabelsfixed (){ this.printonelabel("taupo", 17.5, true); this.printonelabel("auckland", 33.0, false); this.printonelabel("hamilton", 19.1, false); this.printonelabel("auckland", 24.8, true); public void printonelabel( String city, double wt, boolean isluggage){ UI. println ("* City: " + city); UI. printf ("* Weight: %5.2f kg%n", wt); if (wt > 20){ UI. println ("* HEAVY!"); if (isluggage){ UI. println ("* Type: Luggage"); UI. println ("* Loading: Stow forward"); else { UI. println ("* Type: Parcel"); UI. println ("* Loading: Stow at rear"); UI. println (); COMP 102 (Terms Test 1) Page 9 of 12 continued...
10 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 10 of 12 continued...
11 Student ID: Question 7. Writing methods with if, return, and while [10 marks] Complete the following checkcode method which should check whether the given String is an acceptable code name. It should return true if the String is acceptable, and false otherwise. An acceptable code name must 1. have a length between 6 and 12 characters, (eg, "ABC" is bad), 2. start with A or Z, (eg, "Bcdefghi" and "abcdefg" are bad), 3. not contain the character $ (eg, "ABC$DEFG" is bad), 4. not contain any character twice. (eg, "ZbcdebA" is bad), You can get 5 marks if your method checks the first three conditions. You can get a further 5 marks if your method also checks the final condition (requires a loop to check each character against the rest of the string). Hint: look at the provided documentation for the String class. public boolean checkcode(string name){ if (name.length() < 6 name.length() > 12 ) { return false ; if (name.contains("$")) { return false ; if (!name.startswith("a") &&!name.startswith("z")) { return false ; int i=0; while ( i<name.length()){ if (name.substring( i +1, name.length()). contains(name.substring( i, i +1))){ return false ; i = i+1; return true; ******************************** COMP 102 (Terms Test 1) 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 1) Page 12 of 12 continued...
Model Solutions. COMP 102: Test. 14 August, 2014
Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Model Solutions COMP 102: Test
Model Solutions. COMP 102: Test 1. 6 April, 2016
Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Model Solutions COMP 102: Test
COMP 102: Test August, 2017
Family Name:.......................... Other Names:.......................... Student ID:............................ Signature.............................. COMP 102: Test 1 14 August, 2017 Instructions
COMP 102 : Test. 2017, Apr 3
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 102 : Test 2017, Apr 3
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 ** WITH SOLUTIONS **
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 102 : Test 2017, Apr 3
Model Solutions. COMP 102: Test March, 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/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 May, 2015
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
Java Programming: Test 1
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. Java Programming: Test 1 2016,
Model Solutions. COMP 102: Test May, 2014
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
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 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 , December?? ** WITH SOLUTIONS **
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 102: Test 2 2017, December??
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:............................ COMP102: Test 1 Model Solutions 27 July, 2007 Instructions Time allowed: 45 minutes.
Introduction to Programming: Test 2
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. Introduction to Programming:
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 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
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
COMP 102: Test 2 Model Solutions
Family Name:.......................... Other Names:.......................... ID Number:............................ Instructions Time allowed: 45 minutes There are 45 marks in total. Answer all the questions.
U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 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
Model Solutions. COMP 103: Test May, 2013
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 45 minutes
COMP 103 : Test. 2018, Sept 12//(Corrected)
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 103 : Test 2018, Sept 12//(Corrected)
COMP 103 : Test. 2019, Jan 9 ** WITH SOLUTIONS **
Family Name:.............................. Other Names:...................................... Signature.................................. COMP 103 : Test 2019, Jan 9 ** WITH SOLUTIONS ** Instructions Time
COMP 103 : Test. 2018, Sept 12//(Corrected) ** WITH SOLUTIONS
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. COMP 103 : Test 2018, Sept 12//(Corrected)
Model Solutions. COMP 103: Test April, 2013
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 40 minutes
Intro to Computer Programming: Final Exam
Family Name:.............................. Other Names:............................. Student ID:................................ Signature.................................. Intro to Computer Programming:
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
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.
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 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.
COMP102: Test. 18 April, 2005
Name:.................................. ID Number:............................. Signature:............................... COMP102: Test 18 April, 2005 Instructions Time allowed: 1 1 2 hours. Answer all
COMP102: Test. 31 August, 2005
Name:.................................. ID Number:............................. Signature:............................... COMP102: Test 31 August, 2005 Instructions Time allowed: 1 1 2 hours. Answer all
EXAMINATIONS 2011 Trimester 2, MID-TERM TEST. COMP103 Introduction to Data Structures and Algorithms SOLUTIONS
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW V I C T O R I A UNIVERSITY OF WELLINGTON Student ID:....................... EXAMINATIONS 2011 Trimester 2, MID-TERM TEST COMP103 Introduction
COMP 103. Mid Trimester Test 17 August 2006
Name ID: COMP 103 Mid Trimester Test 17 August 2006 Time: 90 minutes Marks: 90 Answer all questions. Non programmable calculators permitted Unannotated foreign language dictionaries permitted 1. Collection
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
COMP103 Test. 5 Sept, 2007
Family Name:.......................... Other Names:.......................... ID Number:............................ COMP103 Test 5 Sept, 2007 Instructions Time: 90 minutes. Answer all the questions. There
CS 455 Final Exam Fall 2012 [Bono] Dec. 17, 2012
![CS 455 Final Exam Fall 2012 [Bono] Dec. 17, 2012](/thumbs/72/67854638.jpg "CS 455 Final Exam Fall 2012 [Bono] Dec. 17, 2012")
Name: USC loginid (e.g., ttrojan): CS 455 Final Exam Fall 2012 [Bono] Dec. 17, 2012 There are 6 problems on the exam, with 70 points total available. There are 7 pages to the exam, including this one;
Exam Datastrukturer. DIT960 / DIT961, VT-18 Göteborgs Universitet, CSE
Exam Datastrukturer DIT960 / DIT961, VT-18 Göteborgs Universitet, CSE Day: 2018-10-12, Time: 8:30-12.30, Place: SB Course responsible Alex Gerdes, tel. 031-772 6154. Will visit at around 9:30 and 11:00.
University of Waterloo Department of Electrical and Computer Engineering ECE 250 Algorithms and Data Structures
University of Waterloo Department of Electrical and Computer Engineering ECE 250 Algorithms and Data Structures Final Examination (17 pages) Instructor: Douglas Harder April 14, 2004 9:00-12:00 Name (last,
EXAMINATIONS 2017 TRIMESTER 2
EXAMINATIONS 2017 TRIMESTER 2 CGRA 151 INTRODUCTION TO COMPUTER GRAPHICS Time Allowed: TWO HOURS CLOSED BOOK Permitted materials: Silent non-programmable calculators or silent programmable calculators
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
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
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
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!
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,
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
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
Model Solutions. COMP 103: Mid-term Test. 19th of August, 2016
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 45 minutes
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).
MEHMET YAYAN - İSMAİL HAKKI ÖZTÜRK CS101/SEC.-2 CLASS NOTES 1. March 28-30, 2007
MEHMET YAYAN - İSMAİL HAKKI ÖZTÜRK CS101/SEC.-2 CLASS NOTES 1 March 28-30, 2007 if Single-Selection Statement The conditional statement in Java has the form if (condition) statement The condition must
U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2018 TRIMESTER 2 COMP 103 INTRODUCTION TO DATA STRUCTURES AND ALGORITHMS
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW VICTORIA U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2018 TRIMESTER 2 COMP 103 INTRODUCTION TO DATA STRUCTURES AND ALGORITHMS
Announcements - Grades UBLearns grades just updated Monday, March 28 th (11:00am). Please check grades.
CSE 113 A March 28 April 1, 2011 Announcements - Grades UBLearns grades just updated Monday, March 28 th (11:00am). Please check grades. If an EXAM grade is incorrect, you need to bring the exam to me
CISC 1600, Lab 3.1: Processing
CISC 1600, Lab 3.1: Processing Prof Michael Mandel 1 Getting set up For this lab, we will be using OpenProcessing, a site for building processing sketches online using processing.js. 1.1. Go to https://www.openprocessing.org/class/57767/
University of Massachusetts Amherst, Electrical and Computer Engineering
University of Massachusetts Amherst, Electrical and Computer Engineering ECE 122 Midterm Exam 1 Makeup Answer key March 2, 2018 Instructions: Closed book, Calculators allowed; Duration:120 minutes; Write
Prelim 1. Solution. CS 2110, 14 March 2017, 7:30 PM Total Question Name Short answer
Prelim 1. Solution CS 2110, 14 March 2017, 7:30 PM 1 2 3 4 5 Total Question Name Short answer OO Recursion Loop invariants Max 1 36 33 15 15 100 Score Grader 1. Name (1 point) Write your name and NetID
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),
ASSIGNMENT 2. COMP-202A, Fall 2013, All Sections. Due: October 20 th, 2013 (23:59)
ASSIGNMENT 2 COMP-202A, Fall 2013, All Sections Due: October 20 th, 2013 (23:59) Please read the entire PDF before starting. You must do this assignment individually and, unless otherwise specified, you
Algorithms & Datastructures Laboratory Exercise Sheet 1
Algorithms & Datastructures Laboratory Exercise Sheet 1 Wolfgang Pausch Heiko Studt René Thiemann Tomas Vitvar
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
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
CIS 110 Introduction to Computer Programming. 13 February 2013 Make-Up Midterm Midterm
CIS 110 Introduction to Computer Programming 13 February 2013 Make-Up Midterm Midterm Name: Recitation # (e.g. 201): Pennkey (e.g. bjbrown): My signature below certifies that I have complied with the University
Question 2. [5 points] Given the following symbolic constant definition
![Question 2. [5 points] Given the following symbolic constant definition](/thumbs/95/125145735.jpg "Question 2. [5 points] Given the following symbolic constant definition")
CS 101, Spring 2012 Mar 20th Exam 2 Name: Question 1. [5 points] Determine which of the following function calls are valid for a function with the prototype: void drawrect(int width, int height); Assume
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
CISC 1600, Lab 2.1: Processing
CISC 1600, Lab 2.1: Processing Prof Michael Mandel 1 Getting set up For this lab, we will be using Sketchpad, a site for building processing sketches online using processing.js. 1.1. Go to http://cisc1600.sketchpad.cc
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
Midterm Exam 2 CS 455, Spring 2011
Name: USC loginid (e.g., ttrojan): Midterm Exam 2 CS 455, Spring 2011 March 31, 2011 There are 6 problems on the exam, with 50 points total available. There are 7 pages to the exam, including this one;
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
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
ECE264 Fall 2013 Exam 1, September 24, 2013
ECE264 Fall 2013 Exam 1, September 24, 2013 In signing this statement, I hereby certify that the work on this exam is my own and that I have not copied the work of any other student while completing it.
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
COMP102: Test Model Solutions
Name:.................................. ID Number:............................. Signature:............................... COMP102: Test Model Solutions 31 August, 2005 Instructions Time allowed: 1 1 2
Ū 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
int a; int b = 3; for (a = 0; a < 8 b < 20; a++) {a = a + b; b = b + a;}
1. What does mystery(3) return? public int mystery (int n) { int m = 0; while (n > 1) {if (n % 2 == 0) n = n / 2; else n = 3 * n + 1; m = m + 1;} return m; } (a) 0 (b) 1 (c) 6 (d) (*) 7 (e) 8 2. What are
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
int b = 2; for (int a = 0; a < 10 b < 20; a++) { a = a + b; b = b + a; }
1. What does mystery(9870) return? public int mystery(int n) { String m = ""; while (n > 0) { m = m + n%10; n = n/10; return m; (a) "9870" (b) "987" (c) "0" (d) "789" (e) "7890" 2. What are the values
CS 1316 Exam 1 Summer 2009
1 / 8 Your Name: I commit to uphold the ideals of honor and integrity by refusing to betray the trust bestowed upon me as a member of the Georgia Tech community. CS 1316 Exam 1 Summer 2009 Section/Problem
2. The object-oriented paradigm!
2. The object-oriented paradigm! Plan for this section:! n Look at things we have to be able to do with a programming language! n Look at Java and how it is done there" Note: I will make a lot of use of
CS 223: Data Structures and Programming Techniques. Exam 2
CS 223: Data Structures and Programming Techniques. Exam 2 Instructor: Jim Aspnes Work alone. Do not use any notes or books. You have approximately 75 minutes to complete this exam. Please write your answers
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
Practice Midterm 1. Problem Points Score TOTAL 50
CS 120 Software Design I Spring 2019 Practice Midterm 1 University of Wisconsin - La Crosse February 25 NAME: Do not turn the page until instructed to do so. This booklet contains 10 pages including the
if (x == 0); System.out.println( x=0 ); if (x = 0) System.out.println( x=0 );
Sample Final Exam 1. Evaluate each of the following expressions and show the result and data type of each: Expression Value Data Type 14 % 5 1 / 2 + 1 / 3 + 1 / 4 4.0 / 2.0 Math.pow(2.0, 3.0) (double)(2
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
EXAMINATIONS 2016 TRIMESTER 2
EXAMINATIONS 2016 TRIMESTER 2 CGRA 151 INTRODUCTION TO COMPUTER GRAPHICS Time Allowed: TWO HOURS CLOSED BOOK Permitted materials: Silent non-programmable calculators or silent programmable calculators
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
THE UNIVERSITY OF WESTERN AUSTRALIA. School of Computer Science & Software Engineering CITS1001 OBJECT-ORIENTED PROGRAMMING AND SOFTWARE ENGINEERING
THE UNIVERSITY OF WESTERN AUSTRALIA School of Computer Science & Software Engineering CITS1001 OBJECT-ORIENTED PROGRAMMING AND SOFTWARE ENGINEERING SAMPLE TEST APRIL 2012 This Paper Contains: 12 Pages
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
CSE 113 A. Announcements - Lab
CSE 113 A February 21-25, 2011 Announcements - Lab Lab 1, 2, 3, 4; Practice Assignment 1, 2, 3, 4 grades are available in Web-CAT look under Results -> Past Results and if looking for Lab 1, make sure
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
U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2018 TRIMESTER 2 COMP 103 PRACTICE EXAM
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW VICTORIA U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2018 TRIMESTER 2 COMP 103 PRACTICE EXAM Time Allowed: TWO HOURS ********
Spring 2013 COMP Midterm Exam Solutions March 07, 2013
Spring 2013 COMP 110-003 Midterm Exam Solutions March 07, 2013 UNC Honor Pledge: I certify that no unauthorized assistance has been received or given in the completion of this work. Signature: Read this
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
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
A Constant Rate of Change Name Part 1
A Constant Rate of Change Name Part 1 Consider the function table below. Complete this page by solving the problems at the bottom. Use a separate sheet of paper for your descriptions and explanations.