Multiple Choice Questions Consider the following method and code segment.
|
|
- Marsha Mills
- 6 years ago
- Views:
Transcription
1 Multiple Choice Questions Consider the following method and code segment. public static double jack(double seed) seed = seed + Math.PI; seed = Math.sqrt(seed); seed = seed - (int) seed; return seed; double seed = ; for (int k = 1; k < 10; k++) seed = jack(seed); What values are returned as a result of executing the code segment? (A) Ten double values such that for each x 0 < x < 1 (B) Ten double values such that for each x 0 < x <= 1 (C) Ten double values such that for each x 0 < x < Math.PI (D) Ten double values such that for each x 0 < x <= Math.PI (E) Ten double values such that for each x 1 < x < Math.PI 02. Consider the following method. // precondition: m > 0 public static int mystery(int m) int counter = 0; for (int p = 1; p < m; p++) for (int q = p; q < m; q++) counter++; return counter; What value is returned as a result of the call mystery(8)? (A) 21 (B) 28 (C) 36 (D) 81 (E) 90
2 03. Consider the following code segment. int p = <some int value> int q = <an int value, such that p > q> int r = q - p + 1; for (int k = 1; k <= 300; k++) int rndnum = (int) (Math.random() * r) + p; System.out.print(rndNum + " "); What is the range of random numbers that can be assigned to rndnum? (A) [0.. q-r] (B) [0.. r] (C) [p.. q-r] (D) [q.. p] (E) [p.. q] 04. Today's airports do not process their data (luggage and passengers) in an Objected Oriented Manner. Imagine a future airport where passengers and luggage are handled as follows: 1. Passengers enter a closed hallway restricted to their flight destination. 2. Passengers check in their luggage with an agent who only handles one destination. 3. The luggage is placed on a conveyer belt dedicated for one destination only. Such a future airport resembles Object Oriented Programming by using which one of the following OOP features? (A) encapsulation (B) inheritance (C) composition (D) polymorphism (E) debugging
3 05. Consider the following code segment. int[][] m = 11,12,13,14,15, 16,17,18,19,20, 21,22,23,24,25, 26,27,28,29,30, 31,32,33,34,35 ; for (int r = 0; r < m.length; r++) for (int c = 0; c < m[0].length; c++) if (r == c) System.out.print(m[r][c] + " "); else System.out.print("00 "); Which is printed as a result of executing the code segment? (A) (B) (C) (D) (E)
4 base-10 equals what number in base-5? (A) (B) (C) (D) (E) Consider the following program segment. String s1 = "ABCD"; String s2 = ""; for (int k = 1; k < s1.length(); k++) s2 += s1.substring(k); System.out.println(s2); What will be output when the program segment executes? (A) D (B) CD (C) CDD (D) BCDCDD (E) ABCDBCDCDD 08. Consider the following code segment. ArrayList<String> animals = new ArrayList<String>(); animals.add("giraffe"); animals.add("tiger"); animals.add("elephant"); animals.add("wildebeest"); animals.add("aardvark"); animals.remove(1); animals.remove(3); for (String animal: animals) System.out.print(animal + " "); What is printed as a result of executing the code segment? (A) Giraffe Elephant Wildebeest (B) Tiger Wildebeest Aardvark (C) Giraffe Elephant Aardvark (D) Tiger Elephant Aardvark (E) Tiger Elephant Wildebeest
5 Free Response Question 1. Part (a). Write method fromhextobin, which is described as follows. Method fromhextobin converts the base-16 argument number to its base-2 equivalent. The base-2 number is returned. In completing method fromhextobin you can use the following table, which details the unique relationship between base-16 and base-2 numbers. Every single base-16 digit corresponds to four base-2 digits. Base a b c d e f Base Complete method fromhextobin below. // precondition: hexnum is a String of characters, which represents // a correct base-16 number. // postcondition: returns a String of characters, which represents // the base-2 number equivalent of hexnum. public static String fromhextobin(string hexnum) Part (b). Write method frombintodec, which is described as follows. Method frombintodec converts the base-2 argument number to its base-10 equivalent. The base-10 number is returned. Complete method frombintodec below. // precondition: binnum is a String of characters, which represents // a correct base-2 number. // postcondition: returns an int value, which represents // the base-10 number equivalent of binnum. public static int frombintodec(string binnum) Part (c). Write method fromhextodec, which is described as follows. Method fromhextodec converts the base-16 argument number to its base-10 equivalent. The base-10 number is returned. In writing method fromhextodec you may call methods fromhextobin and frombintodec, which are specified in Part (a) and Part(b), whether the methods are implemented correctly or not. Complete method fromhextodec below. // precondition: hexnum is a String of characters, which represents // a correct base-16 number. // postcondition: returns an int value, which represents // the base-10 number equivalent of hexnum. public static int fromhextodec(string hexnum)
6 Free Response Question 2. Consider the following incomplete declaration of a Matrix class. The intent of the Matrix class is to facilitate mathematical operations performed on two-dimensional, rectangular arrays. Matrix objects can be constructed with row and column size information only or with a provided integer array parameter. A Matrix class can have many useful operations. For this question the focus will be on writing methods for matrix multiplication and matrix display. Method multiply takes two Matrix objects and returns the product. Method oksize is a private helper method for method multiply and determines if the provided Matrix objects can be multiplied. You will also need to redefine the tostring method to display the elements of a Matrix object. public class Matrix private int twod[][]; private int numrows; private int numcols; public Matrix(int r, int c) numrows = r; numcols = c; twod = new int[numrows][numcols]; public Matrix(int array[][]) twod = array; numrows = twod.length; numcols = twod[0].length; public String tostring() /* to be implemented by part (a) */ private boolean oksize(matrix m1, Matrix m2) /* to be implemented by part (b) */ public void multiply(matrix m1, Matrix m2) /* to be implemented by part (c) */ // other methods used by the Matrix class
7 Part (a). Redefine the tostring method as discussed earlier. Method tostring must return a string that will display a Matrix in two-dimensional array format. The following table shows the result of several different calls made by System.out.println(/* Matrix Object */) to the tostring method based on the String argument of the constructor. The code segment below is part of a client program that constructs and displays three Matrix objects. Code segment in client program using the Matrix class int[][] mat1 = 1,2,3, 4,5,6, 7,8,9; int[][] mat2 = 1,0,0, 0,1,0, 0,0,1; Matrix m1 = new Matrix(mat1); Matrix m2 = new Matrix(mat2); Matrix m3 = new Matrix(3,3); System.out.println(m1); System.out.println(m2); System.out.println(m3); m3.multiply(m1,m2); System.out.println(m3); Execution Output Complete method tostring below. // precondition: twod is a nonempty two-dimensional integer array // postcondition: returns a string in rectangular matrix format. public String tostring()
8 Part (b). Matrix multiplication involves a process of adding the products of elements of rows in one matrix times corresponding elements of columns in a second matrix. This process is demonstrated by the matrix multiplication example below. a b e f ae + bg af + bh c d * g h = ce + dg cf + dh It is not necessary that matrices are square matrices or identical matrices. Two matrices can be multiplied as long as the number of columns in the first matrix are equal to the number of rows in the second matrix. The next example involves a 2 x 3 matrix and a 3 x 2 matrix. a b c g h ag + bi + ck ah + bj + cl d e f * i j = dg + ei + fk dh + ej + fl k l Observe that the 2 x 3 matrix is multiplied by a 3 x 2 matrix and creates a 2 x 2 matrix product. A general formula can be stated about the matrix multiplication, which is: An a x b matrix times a b x c matrix becomes an a x c matrix. This formula shows that there are special size requirements for all three matrices involved in the multiplication process. The column size (b) of the first matrix must be the same as the row size (b) of the second matrix. Furthermore, the product matrix must have row size (a) and column size (c). Write method oksize, which is described as follows. Method oksize is used to see if the three matrices involved in multiplication follow the correct rules of row and column size. Method oksize returns true if the number of column of m1 equals the number of rows of m2 and the product matrix has the same number of rows as m1 and the same number of columns as m2. Complete method oksize below. // precondition: m1 and m2 are not null // postcondition: returns true if m1 columns equals m2 rows and // m1 rows equals object's rows and m2 columns // equals object's columns private boolean oksize(matrix m1, Matrix m2)
9 Part (c). Write method multiply as described earlier. In writing method multiply, you may call method oksize, as specified in part (b). Assume that oksize works as specified, regardless of what you wrote in part (b). Complete method multiply below. // precondition: m1 and m2 are not null // postcondition: the product of the m1 and m2 is stored in the // current object, if possible, otherwise the // current object remains unchanged public void multiply(matrix m1, Matrix m2)
APCS Assessment Sheet Consider the following program segment int count = 1;
APCS Assessment Sheet 1 1. Consider the following program segment int count = 1; for(int p = 0; p < 5; p++) if(p % 2 = = 0) count++; else count += 2; System.out.println(count); What value is displayed?
More informationA+ Computer Science MATRICES
A+ Computer Science MATRICES Warm Up: Scores Clump Coding Bat Today: The Matrix 2Day Arrays - Matrices A two-dimensional array is a one-dimensional array of one-dimensional arrays. A spreadsheet is an
More informationAP Computer Science Chapter 10 Implementing and Using Classes Study Guide
AP Computer Science Chapter 10 Implementing and Using Classes Study Guide 1. A class that uses a given class X is called a client of X. 2. Private features of a class can be directly accessed only within
More informationCS 307 Midterm 1[corrected] Spring 2008
Points off 1 2 3 4 5 Total off Net Score CS 307 Midterm 1[corrected] Spring 2008 Your Name Your UTEID Circle yours TA s name: Ruchica Mario Vishvas Instructions: 1. Please turn off or silence your cell
More informationUniversity of Cape Town ~ Department of Computer Science. Computer Science 1015F ~ 2007
Name: Please fill in your Student Number and Name. Student Number : Student Number: University of Cape Town ~ Department of Computer Science Computer Science 1015F ~ 2007 Supplementary Examination Question
More informationSPRING 13 CS 0007 FINAL EXAM V2 (Roberts) Your Name: A pt each. B pt each. C pt each. D or 2 pts each
Your Name: Your Pitt (mail NOT peoplesoft) ID: Part Question/s Points available Rubric Your Score A 1-6 6 1 pt each B 7-12 6 1 pt each C 13-16 4 1 pt each D 17-19 5 1 or 2 pts each E 20-23 5 1 or 2 pts
More informationUniversity of Cape Town ~ Department of Computer Science. Computer Science 1015F ~ 2007
Name: Please fill in your Student Number and Name. Student Number : Student Number: University of Cape Town ~ Department of Computer Science Computer Science 1015F ~ 2007 Final Examination Question Max
More informationCS 307 Midterm 1 Spring 2009
Points off 1 2 3 4 Total off Net Score CS 307 Midterm 1 Spring 2009 Your Name Your UTEID Circle yours TA s name: Todd Guhan Xiuming(aka David) Instructions: 1. Please turn off or silence your cell phones.
More informationIntroduction to Programming Using Java (98-388)
Introduction to Programming Using Java (98-388) Understand Java fundamentals Describe the use of main in a Java application Signature of main, why it is static; how to consume an instance of your own class;
More informationType Hierarchy. Comp-303 : Programming Techniques Lecture 9. Alexandre Denault Computer Science McGill University Winter 2004
Type Hierarchy Comp-303 : Programming Techniques Lecture 9 Alexandre Denault Computer Science McGill University Winter 2004 February 16, 2004 Lecture 9 Comp 303 : Programming Techniques Page 1 Last lecture...
More informationCSCI 135 Exam #2 Fundamentals of Computer Science I Fall 2013
CSCI 135 Exam #2 Fundamentals of Computer Science I Fall 2013 Name: This exam consists of 6 problems on the following 6 pages. You may use your two-sided hand-written 8 ½ x 11 note sheet during the exam.
More informationNATIONAL UNIVERSITY OF SINGAPORE
NATIONAL UNIVERSITY OF SINGAPORE SCHOOL OF COMPUTING TERM TEST #1 Semester 1 AY2006/2007 CS1101X/Y/Z PROGRAMMING METHODOLOGY 16 September 2006 Time Allowed: 60 Minutes INSTRUCTIONS 1. This question paper
More informationCSE 143 SAMPLE MIDTERM
CSE 143 SAMPLE MIDTERM 1. (5 points) In some methods, you wrote code to check if a certain precondition was held. If the precondition did not hold, then you threw an exception. This leads to robust code
More informationAP Computer Science A 2013 Free-Response Questions
AP Computer Science A 2013 Free-Response Questions About the College Board The College Board is a mission-driven not-for-profit organization that connects students to college success and opportunity. Founded
More informationTable of Contents Date(s) Title/Topic Page #s. Chapter 4: Writing Classes 4.1 Objects Revisited
Table of Contents Date(s) Title/Topic Page #s 11/6 Chapter 3 Reflection/Corrections 56 Chapter 4: Writing Classes 4.1 Objects Revisited 57 58-59 look over your Ch 3 Tests and write down comments/ reflections/corrections
More informationCSCI 135 Exam #2 Fundamentals of Computer Science I Fall 2013
CSCI 135 Exam #2 Fundamentals of Computer Science I Fall 2013 Name: This exam consists of 6 problems on the following 6 pages. You may use your two-sided hand-written 8 ½ x 11 note sheet during the exam.
More informationCS1083 Week 2: Arrays, ArrayList
CS1083 Week 2: Arrays, ArrayList mostly review David Bremner 2018-01-08 Arrays (1D) Declaring and using 2D Arrays 2D Array Example ArrayList and Generics Multiple references to an array d o u b l e prices
More informationCS 307 Midterm 2 Fall 2009
Points off 1 2 3 4 5 Total off Net Score Exam Number: CS 307 Midterm 2 Fall 2009 Name UTEID login name TA's Name: Oswaldo Rashid Swati (Circle One) Instructions: 1. Please turn off your cell phones and
More informationAP COMPUTER SCIENCE A DIAGNOSTIC EXAM. Multiple Choice Section Time - 1 hour and 15 minutes Number of questions - 40 Percent of total grade - 50
AP COMPUTER SCIENCE A DIAGNOSTIC EXAM Multiple Choice Section Time - 1 hour and 15 minutes Number of questions - 40 Percent of total grade - 50 Directions: Determine the answer to each of the following
More informationAP CS Unit 3: Control Structures Notes
AP CS Unit 3: Control Structures Notes The if and if-else Statements. These statements are called control statements because they control whether a particular block of code is executed or not. Some texts
More informationCS 314 Exam 1 Spring 2017
Points off 1 2 3 4 5 6 Total off Net Score CS 314 Exam 1 Spring 2017 Your Name Your UTEID Instructions: 1. There are 6 questions on this test. 100 points available. Scores will be scaled to 175 points.
More informationChapter 4 Defining Classes I
Chapter 4 Defining Classes I This chapter introduces the idea that students can create their own classes and therefore their own objects. Introduced is the idea of methods and instance variables as the
More informationJava Class Design. Eugeny Berkunsky, Computer Science dept., National University of Shipbuilding
Java Class Design Eugeny Berkunsky, Computer Science dept., National University of Shipbuilding eugeny.berkunsky@gmail.com http://www.berkut.mk.ua Objectives Implement encapsulation Implement inheritance
More informationTopic 5 Polymorphism. " Inheritance is new code that reuses old code. Polymorphism is old code that reuses new code.
Topic 5 Polymorphism " Inheritance is new code that reuses old code. Polymorphism is old code that reuses new code. 1 Polymorphism Another feature of OOP literally having many forms object variables in
More informationCSI33 Data Structures
Outline Department of Mathematics and Computer Science Bronx Community College August 29, 2018 Outline Outline 1 Chapter 2: Data Abstraction Outline Chapter 2: Data Abstraction 1 Chapter 2: Data Abstraction
More information2D Transformations. 7 February 2017 Week 5-2D Transformations 1
2D Transformations 7 Februar 27 Week 5-2D Transformations Matri math Is there a difference between possible representations? a c b e d f ae bf ce df a c b d e f ae cf be df a b c d e f ae bf ce df 7 Februar
More informationis the and x A. The transpose of A, denoted
CMPS 101 lgorims and bstract Data ypes Programming ssignment 3 In is assignment you will create a calculator for performing matrix operations at exploits e (expected) sparseness of it s matrix operands.
More informationCS111: 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
More informationJAVA MOCK TEST JAVA MOCK TEST II
http://www.tutorialspoint.com JAVA MOCK TEST Copyright tutorialspoint.com This section presents you various set of Mock Tests related to Java Framework. You can download these sample mock tests at your
More informationData abstractions: ADTs Invariants, Abstraction function. Lecture 4: OOP, autumn 2003
Data abstractions: ADTs Invariants, Abstraction function Lecture 4: OOP, autumn 2003 Limits of procedural abstractions Isolate implementation from specification Dependency on the types of parameters representation
More information3. Convert 2E from hexadecimal to decimal. 4. Convert from binary to hexadecimal
APCS A Midterm Review You will have a copy of the one page Java Quick Reference sheet. This is the same reference that will be available to you when you take the AP Computer Science exam. 1. n bits can
More informationDay 4. COMP1006/1406 Summer M. Jason Hinek Carleton University
Day 4 COMP1006/1406 Summer 2016 M. Jason Hinek Carleton University today s agenda assignments questions about assignment 2 a quick look back constructors signatures and overloading encapsulation / information
More informationCS 112 Introduction to Computing II. Wayne Snyder Computer Science Department Boston University
9/5/6 CS Introduction to Computing II Wayne Snyder Department Boston University Today: Arrays (D and D) Methods Program structure Fields vs local variables Next time: Program structure continued: Classes
More informationCS 101 Fall 2006 Midterm 3 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
More informationCSCI 135 Exam #1 Fundamentals of Computer Science I Fall 2012
CSCI 135 Exam #1 Fundamentals of Computer Science I Fall 2012 Name: This exam consists of 6 problems on the following 7 pages. You may use your two-sided hand-written 8 ½ x 11 note sheet during the exam.
More informationReview questions. Review questions, cont d. Class Definition. Methods. Class definition: methods. April 1,
April 1, 2003 1 Previous Lecture: Intro to OOP Class definition: instance variables & methods Today s Lecture: Instance methods Constructors Methods with input parameters Review questions Where do you
More informationA First Book of ANSI C Fourth Edition. Chapter 8 Arrays
A First Book of ANSI C Fourth Edition Chapter 8 Arrays One-Dimensional Arrays Array Initialization Objectives Arrays as Function Arguments Case Study: Computing Averages and Standard Deviations Two-Dimensional
More informationCS18000: Problem Solving And Object-Oriented Programming
CS18000: Problem Solving And Object-Oriented Programming Class (and Program) Structure 31 January 2011 Prof. Chris Clifton Classes and Objects Set of real or virtual objects Represent Template in Java
More informationpublic static boolean isoutside(int min, int max, int value)
See the 2 APIs attached at the end of this worksheet. 1. Methods: Javadoc Complete the Javadoc comments for the following two methods from the API: (a) / @param @param @param @return @pre. / public static
More informationTeenCoder : Java Programming (ISBN )
TeenCoder : Java Programming (ISBN 978-0-9887070-2-3) and the AP * Computer Science A Exam Requirements (Alignment to Tennessee AP CS A course code 3635) Updated March, 2015 Contains the new 2014-2015+
More information1.00 Introduction to Computers and Engineering Problem Solving. Quiz 1 March 7, 2003
1.00 Introduction to Computers and Engineering Problem Solving Quiz 1 March 7, 2003 Name: Email Address: TA: Section: You have 90 minutes to complete this exam. For coding questions, you do not need to
More informationCSE 331 Summer 2017 Final Exam. The exam is closed book and closed electronics. One page of notes is allowed.
Name Solution The exam is closed book and closed electronics. One page of notes is allowed. The exam has 6 regular problems and 1 bonus problem. Only the regular problems will count toward your final exam
More informationUniversity of Cape Town ~ Department of Computer Science Computer Science 1015F ~ June Exam
Name: Please fill in your Student Number and Name. Student Number : Student Number: University of Cape Town ~ Department of Computer Science Computer Science 1015F ~ 2009 June Exam Question Max Internal
More informationLecture 13: Two- Dimensional Arrays
Lecture 13: Two- Dimensional Arrays Building Java Programs: A Back to Basics Approach by Stuart Reges and Marty Stepp Copyright (c) Pearson 2013. All rights reserved. Nested Loops Nested loops nested loop:
More informationIntroduction to Computer Science Unit 2. Notes
Introduction to Computer Science Unit 2. Notes Name: Objectives: By the completion of this packet, students should be able to describe the difference between.java and.class files and the JVM. create and
More informationOUTLINES. Variable names in MATLAB. Matrices, Vectors and Scalar. Entering a vector Colon operator ( : ) Mathematical operations on vectors.
1 LECTURE 3 OUTLINES Variable names in MATLAB Examples Matrices, Vectors and Scalar Scalar Vectors Entering a vector Colon operator ( : ) Mathematical operations on vectors examples 2 VARIABLE NAMES IN
More informationDiscover how to get up and running with the Java Development Environment and with the Eclipse IDE to create Java programs.
Java SE11 Development Java is the most widely-used development language in the world today. It allows programmers to create objects that can interact with other objects to solve a problem. Explore Java
More informationCSCI 135 Final Fall Problem Points Score Total 100
CSCI 135 Final Fall 2011 Name: This exams consists of 11 problems on the following 14 pages. You may use your two- sided hand- written 8 ½ x 11 note sheet during the exam. No calculators, computers, or
More informationCOMPUTER SCIENCE A SECTION II
COMPUTER SCIENCE A SECTION II Time 1 hour and 45 minutes Number of questions 4 Percent of total score 50 Directions: SHOW ALL YOUR WORK. REMEMBER THAT PROGRAM SEGMENTS ARE TO BE WRITTEN IN JAVA. Notes:
More informationProgramming Assignment: recursion, recursion, recursion Due date: Thursday, July 26 at 11:29 am
Programming Assignment: recursion, recursion, recursion Due date: Thursday, July 26 at 11:29 am For this project, you will implement several of static methods in a class called Recursive. You will be provided
More informationCSE 143 SAMPLE MIDTERM SOLUTION
CSE 143 SAMPLE MIDTERM SOLUTION 1. (5 points) In some methods, you wrote code to check if a certain precondition was held. If the precondition did not hold, then you threw an exception. This leads to robust
More informationCS 1063 Introduction to Computer Programming Midterm Exam 2 Section 1 Sample Exam
Seat Number Name CS 1063 Introduction to Computer Programming Midterm Exam 2 Section 1 Sample Exam This is a closed book exam. Answer all of the questions on the question paper in the space provided. If
More informationBasics of Java: Expressions & Statements. Nathaniel Osgood CMPT 858 February 15, 2011
Basics of Java: Expressions & Statements Nathaniel Osgood CMPT 858 February 15, 2011 Java as a Formal Language Java supports many constructs that serve different functions Class & Interface declarations
More informationJava Basics Programming Fundamentals
Java Basics Programming Fundamentals The 2009 Multiple Choice section of the AP Computer Science A exam was broken down as follows: Programming fundamentals - 30/40 Data Structures - 8/40 Logic - 4/40
More informationIMACS: AP Computer Science A
IMACS: AP Computer Science A OVERVIEW This course is a 34-week, 4 classroom hours per week course for students taking the College Board s Advanced Placement Computer Science A exam. It is an online course
More informationCompuScholar, Inc. 9th - 12th grades
CompuScholar, Inc. Alignment to the College Board AP Computer Science A Standards 9th - 12th grades AP Course Details: Course Title: Grade Level: Standards Link: AP Computer Science A 9th - 12th grades
More informationif (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
More informationPage 1 / 3. Page 2 / 18. Page 3 / 8. Page 4 / 21. Page 5 / 15. Page 6 / 20. Page 7 / 15. Total / 100. Pledge:
This pledged exam is open text book and closed notes. Different questions have different points associated with them. Because your goal is to maximize your number of points, we recommend that you do not
More informationChapter 15: Object Oriented Programming
Chapter 15: Object Oriented Programming Think Java: How to Think Like a Computer Scientist 5.1.2 by Allen B. Downey How do Software Developers use OOP? Defining classes to create objects UML diagrams to
More informationstatic String usersname; public static int numberofplayers; private static double velocity, time;
A class can include other things besides subroutines. In particular, it can also include variable declarations. Of course, you can declare variables inside subroutines. Those are called local variables.
More informationCSE 202: Design and Analysis of Algorithms Lecture 5
CSE 202: Design and Analysis of Algorithms Lecture 5 Instructor: Kamalika Chaudhuri Announcements Kamalika s Office hours today moved to tomorrow, 12:15-1:15pm Homework 1 due now Midterm on Feb 14 Algorithm
More informationExponentiation and Java
Exponentiation and Java Stephen Merrin Abstract We discuss an interesting teaching example for the Java programming language, where the problem is how to handle the operation of exponentiation. Speci cally,
More informationSEMESTER 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
More informationPractice Midterm Exam. Start with the ones that you consider to be easiest, then move to those that may take more time.
CS 102 Fall 2008 Instructor: Audrey St. John Practice Midterm Exam General description There are 4 problems, some subdivided into smaller questions. Do as many as you can, or as much of a bigger problem
More information1B1a Arrays. Arrays. Indexing. Naming arrays. Why? Using indexing. 1B1a Lecture Slides. Copyright 2003, Graham Roberts 1
Ba Arrays Arrays A normal variable holds value: An array variable holds a collection of values: 4 Naming arrays An array has a single name, so the elements are numbered or indexed. 0 3 4 5 Numbering starts
More informationFaculty of Science COMP-202A - Introduction to Computing I (Fall 2008) Midterm Examination
First Name: Last Name: McGill ID: Section: Faculty of Science COMP-202A - Introduction to Computing I (Fall 2008) Midterm Examination Tuesday, November 4, 2008 Examiners: Mathieu Petitpas [Section 1] 18:30
More informationA Java Execution Simulator
A Java Execution Simulator Steven Robbins Department of Computer Science University of Texas at San Antonio srobbins@cs.utsa.edu ABSTRACT This paper describes JES, a Java Execution Simulator that allows
More informationAssertions, pre/postconditions
Programming as a contract Assertions, pre/postconditions Assertions: Section 4.2 in Savitch (p. 239) Specifying what each method does q Specify it in a comment before method's header Precondition q What
More informationInheritance and Polymorphism
Object Oriented Programming Designed and Presented by Dr. Ayman Elshenawy Elsefy Dept. of Systems & Computer Eng.. Al-Azhar University Website: eaymanelshenawy.wordpress.com Email : eaymanelshenawy@azhar.edu.eg
More informationOverview. Lecture 7: Inheritance and GUIs. Inheritance. Example 9/30/2008
Overview Lecture 7: Inheritance and GUIs Written by: Daniel Dalevi Inheritance Subclasses and superclasses Java keywords Interfaces and inheritance The JComponent class Casting The cosmic superclass Object
More informationThis 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
More informationCOMP 250: Java Programming I. Carlos G. Oliver, Jérôme Waldispühl January 17-18, 2018 Slides adapted from M. Blanchette
COMP 250: Java Programming I Carlos G. Oliver, Jérôme Waldispühl January 17-18, 2018 Slides adapted from M. Blanchette Variables and types [Downey Ch 2] Variable: temporary storage location in memory.
More informationCSE 214 Computer Science II Java Classes and Information Hiding
CSE 214 Computer Science II Java Classes and Information Hiding Fall 2017 Stony Brook University Instructor: Shebuti Rayana shebuti.rayana@stonybrook.edu http://www3.cs.stonybrook.edu/~cse214/sec02/ Java
More informationITI Introduction to Computing II
ITI 1121. Introduction to Computing II Marcel Turcotte School of Electrical Engineering and Computer Science Inheritance Introduction Generalization/specialization Version of January 20, 2014 Abstract
More informationMaths for Signals and Systems Linear Algebra in Engineering. Some problems by Gilbert Strang
Maths for Signals and Systems Linear Algebra in Engineering Some problems by Gilbert Strang Problems. Consider u, v, w to be non-zero vectors in R 7. These vectors span a vector space. What are the possible
More informationCSCI 135 Exam #1 Fundamentals of Computer Science I Fall 2014
CSCI 135 Exam #1 Fundamentals of Computer Science I Fall 2014 Name: This exam consists of 8 problems on the following 8 pages. You may use your two- sided hand- written 8 ½ x 11 note sheet during the exam.
More informationMORE OO FUNDAMENTALS CSCI 4448/5448: OBJECT-ORIENTED ANALYSIS & DESIGN LECTURE 4 09/01/2011
MORE OO FUNDAMENTALS CSCI 4448/5448: OBJECT-ORIENTED ANALYSIS & DESIGN LECTURE 4 09/01/2011 1 Goals of the Lecture Continue a review of fundamental object-oriented concepts 2 Overview of OO Fundamentals
More informationGRAFIKA KOMPUTER. ~ M. Ali Fauzi
GRAFIKA KOMPUTER ~ M. Ali Fauzi Drawing 2D Graphics VIEWPORT TRANSFORMATION Recall :Coordinate System glutreshapefunc(reshape); void reshape(int w, int h) { glviewport(0,0,(glsizei) w, (GLsizei) h); glmatrixmode(gl_projection);
More informationYou 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
More informationCS 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
More informationWrite the letter of the correct answer for each problem in the blanks on the answer form.
APCS A Review Write the letter of the correct answer for each problem in the blanks on the answer form. 1. Which of the following boolean expressions evaluates to true given the boolean variables a = true,
More informationComputer Science E-119 Fall Problem Set 1. Due before lecture on Wednesday, September 26
Due before lecture on Wednesday, September 26 Getting Started Before starting this assignment, make sure that you have completed Problem Set 0, which can be found on the assignments page of the course
More informationObject Oriented Programming. Assistant Lecture Omar Al Khayat 2 nd Year
Object Oriented Programming Assistant Lecture Omar Al Khayat 2 nd Year Syllabus Overview of C++ Program Principles of object oriented programming including classes Introduction to Object-Oriented Paradigm:Structures
More information9/19/2018 Programming Data Structures. Polymorphism And Abstract
9/19/2018 Programming Data Structures Polymorphism And Abstract 1 In-class assignment: deadline noon!! 2 Overview: 4 main concepts in Object-Oriented Encapsulation in Java is a mechanism of wrapping the
More informationYou will not be tested on JUnit or the Eclipse debugger. The exam does not cover interfaces.
Com S 227 Fall 2016 Topics and review problems for Exam 2 Thursday, November 10, 6:45 pm Locations, by last name: (same locations as Exam 1) A-C Curtiss 0127, first floor only D-N Hoover 2055 O-Z Troxel
More informationObject Class. EX: LightSwitch Class. Basic Class Concepts: Parts. CS257 Computer Science II Kevin Sahr, PhD. Lecture 5: Writing Object Classes
1 CS257 Computer Science II Kevin Sahr, PhD Lecture 5: Writing Object Classes Object Class 2 objects are the basic building blocks of programs in Object Oriented Programming (OOP) languages objects consist
More informationClass definition. complete definition. public public class abstract no instance can be created final class cannot be extended
JAVA Classes Class definition complete definition [public] [abstract] [final] class Name [extends Parent] [impelements ListOfInterfaces] {... // class body public public class abstract no instance can
More informationIntroduction to Computer Science Unit 2. Notes
Introduction to Computer Science Unit 2. Notes Name: Objectives: By the completion of this packet, students should be able to describe the difference between.java and.class files and the JVM. create and
More informationChapter 7. Iteration. 7.1 Multiple assignment
Chapter 7 Iteration 7.1 Multiple assignment You can make more than one assignment to the same variable; effect is to replace the old value with the new. int bob = 5; System.out.print(bob); bob = 7; System.out.println(bob);
More informationAdvanced Java Concepts Unit 9: Graph Exercises
dvanced Java oncepts Unit : Graph Exercises. Which one of the following data structures would be best suited for representing a street map for pedestrians? graph with... a) undirected, unweighted edges.
More information(A) 99 (B) 100 (C) 101 (D) 100 initial integers plus any additional integers required during program execution
Ch 5 1D & 2D Arrays Multiple Choice Test 01. An array is a (A) (B) (C) (D) data structure with one, or more, elements of the same type. data structure with LIFO access. data structure, which allows transfer
More informationObject Oriented Programming (OOP) is a style of programming that incorporates these 3 features: Encapsulation Polymorphism Class Interaction
Object Oriented Programming (OOP) is a style of programming that incorporates these 3 features: Encapsulation Polymorphism Class Interaction Class Interaction There are 3 types of class interaction. One
More informationThe class Object. Lecture CS1122 Summer 2008
The class Object http://www.javaworld.com/javaworld/jw-01-1999/jw-01-object.html Lecture 10 -- CS1122 Summer 2008 Review Object is at the top of every hierarchy. Every class in Java has an IS-A relationship
More informationFirst Exam Computer Programming 326 Dr. St. John Lehman College City University of New York Thursday, 7 October 2010
First Exam Computer Programming 326 Dr. St. John Lehman College City University of New York Thursday, 7 October 2010 NAME (Printed) NAME (Signed) E-mail Exam Rules Show all your work. Your grade will be
More informationITI Introduction to Computing II
ITI 1121. Introduction to Computing II Marcel Turcotte School of Electrical Engineering and Computer Science Inheritance Introduction Generalization/specialization Version of January 21, 2013 Abstract
More informationCS212 Midterm. 1. Read the following code fragments and answer the questions.
CS1 Midterm 1. Read the following code fragments and answer the questions. (a) public void displayabsx(int x) { if (x > 0) { System.out.println(x); return; else { System.out.println(-x); return; System.out.println("Done");
More informationWeek 8: Operator overloading
Due to various disruptions, we did not get through all the material in the slides below. CS319: Scientific Computing (with C++) Week 8: Operator overloading 1 The copy constructor 2 Operator Overloading
More informationCSC Advanced Object Oriented Programming, Spring Specification
CSC 520 - Advanced Object Oriented Programming, Spring 2018 Specification Specification A specification is an unambiguous description of the way the components of the software system should be used and
More informationTHE CATHOLIC UNIVERSITY OF EASTERN AFRICA A. M. E. C. E. A
THE CATHOLIC UNIVERSITY OF EASTERN AFRICA A. M. E. C. E. A MAIN EXAMINATION P.O. Box 62157 00200 Nairobi - KENYA Telephone: 891601-6 Fax: 254-20-891084 E-mail:academics@cuea.edu AUGUST - DECEMBER 2015
More informationChief Reader Report on Student Responses:
Chief Reader Report on Student Responses: 2017 AP Computer Science A Free-Response Questions Number of Students Scored 60,519 Number of Readers 308 Score Distribution Exam Score N %At Global Mean 3.15
More information