Midterm Exam 2 Thursday, November 15th, points (15% of final grade) Instructors: Jim Williams and Marc Renault
|
|
- Jean Rodgers
- 5 years ago
- Views:
Transcription
1 Computer Sciences 200 Midterm Exam 2 Thursday, November 15th, points (15% of final grade) Instructors: Jim Williams and Marc Renault (Family) Last Name: (Given) First Name: CS Login Name: NetID Circle your Lecture: Lec001 TR 0800 (Jim) Lec002 TR 0930 (Jim) Lec003 MWF 1100 (Marc) Lec004 MWF 1320 (Marc) Fill in these fields (left to right) on the scantron form using a #2 pencil. 1. LAST NAME (family name) and FIRST NAME (given name), as much as there is space to enter. 2. IDENTIFICATION NUMBER is your Campus ID number. 3. SPECIAL CODES ABC: Enter your three-digit lecture number: 001, 002, 003, or SPECIAL CODES F: Write the letter P for Primary and fill in the bubble for (1). FILL IN THE BUBBLES CORRESPONDING TO ALL OF THESE ANSWERS! The exam has two parts and is worth a total of 100 points. Part I has 20 Simple Choice questions worth 2 points each for 40 points possible for Part I. Part II has 20 Multiple Choice questions worth 3 points each for 60 points possible for Part II. You will have 120 minutes to complete the exam. Be sure to read through every question completely. I certify that I will keep my answers covered so that they may not be viewed by another student during the exam or prior to completion of their exam. I also certify that I will not view or in any way use another s work or any unauthorized devices. I understand that I may not make any type of copy of any portion of this exam without express permission from my instructor. I understand that being caught allowing another to view my work or being caught viewing another s work are both violations of this agreement and either may result in automatic failure of the course. Any penalty may also be reported to the Deans Office for all involved. Signature: 1. Be sure to review the reference pages as needed during the exam. 2. Turn off and put away your cell phone, calculator, Inspector Gadget (watches, glasses, pencils, etc.) now and wait for the proctor to signal the start of the exam. c 2018 Williams, Renault CS200 Midterm Exam 2 (P) Page 1 of 7
2 Disclaimer: the following are provided for your reference only, and the inclusion of information here does not guarantee it will be used on the exam. Operator Precedence Table: Level Operator Description Associativity higher ( <expression> ) grouping with parentheses left to right [ ] ( ). array index, method call, member access (dot operator) left to right post-increment, post-decrement left to right ! pre-increment, unary plus/minus, logical negation right to left (type) new casting and creating object right to left * / % multiplication, division, modulus left to right addition, subtraction, concatenation left to right < <= > >= instanceof relational and Java s instanceof operator left to right ==!= equality left to right && conditional AND (short-circuits) left to right conditional OR (short-circuits) left to right lower? : ternary conditional right to left = += -= *= /= %= assignment, arithmetic (compound) assignment right to left Methods from the java.lang.string class: int length() char charat(int index) boolean contains(string s) String tolowercase() String touppercase() int indexof(string s) int lastindexof(string s) boolean equals(string s) boolean equalsignorecase(string s) String substring(int begin) String substring(int begin, int end) boolean startswith(string prefix) boolean startswith(string pre, int off) string trim() Returns number of characters in the String Returns the character at the specified index of the String Returns true iff string s is in this string, otherwise false Returns a new string that is the lowercase version of this string. Returns a new string that is the UPPERCASE version of this string. Returns the index within this string of the first character of the first occurrence of the specified string s or -1 if not found. Returns the index within this string of the first character of the last occurrence of the specified string s or -1 if not found. Returns true if the contents of this String is the same as the contents of String s. Returns true iff the contents of the this string is the same as that of the string s, ignoring differences in case. Returns a new string that is a substring of this string starting at begin to the end of this string. Returns a new string that is a substring of this string starting at index begin up to but not including end. Returns true iff this string starts with the specified prefix prefix, false otherwise. Returns true iff this string starts at the specified offset off with the specified prefix pre, false otherwise. Returns a new string of this with any leading and trailing whitespace removed. c 2018 Williams, Renault CS200 Midterm Exam 2 (P) Page 2 of 7
3 Class (static) Constant(s) and Methods from the java.lang.math class: static double Math.PI static double random() static double pow(double x, double n) static double sqrt(double n) static double abs(double n) static double ceil(double n) static double sin(double theta) Field that represents the constant π Returns a random value between 0 (inclusive) and 1 (exclusive) Returns x n Returns n Returns the absolute value of n Returns the value of n rounded up to the nearest whole number. Returns the sine of the angle θ (θ is in radians) Other trig methods also available. Methods from the java.util.random class: Random() Creates a new pseudorandom number generator instance. Random(long s) Creates a new pseudorandom number generator seeded with s. int nextint() Returns the next pseudorandom integer value. int nextint(int n) Returns the next pseudorandom integer value between 0 (inclusive) and n (exclusive). double nextdouble() Returns the next pseudorandom double value between 0.0 (inclusive) and 1.0 (exclusive). Methods from the java.io.printstream class: void print(string s) void print(char c) void print(char[] c) void print(int i) void print(double d) void print(boolean b) void println(string s) void println(char c) void println(int i) void println(double d) void println(boolean b) Prints a String. Prints a character. Prints all the characters from the array in order. Prints an int. Prints a double. Prints a boolean. Prints a String followed by a newline. Prints a character followed by a newline. Prints an int followed by a newline. Prints a double followed by a newline. Prints a boolean followed by a newline. Methods from the java.util.scanner class: Scanner(String s) Scanner(System.in) boolean hasnext() boolean hasnextint() boolean hasnextdouble() boolean hasnextline() String next() int nextint() double nextdouble() String nextline() Creates a Scanner to read the String s Creates a Scanner that reads from the keyboard. Returns true if there s another token of input. Returns true if the next token is an int value. Returns true if the next token is a double value. Returns true if there s another line of input. Finds and returns the next complete token from this scanner. Scans the next token of the input as an int. Scans the next token of the input as a double. Advances this scanner past the current line and returns the input that was skipped. c 2018 Williams, Renault CS200 Midterm Exam 2 (P) Page 3 of 7
4 Methods from the java.util.arraylist class: Note the E s below are replaced with the particular ArrayList s element type. ArrayList() ArrayList<E>() ArrayList(int initcap) ArrayList<E>(int initcap) int size() E[] toarray() boolean contains(e item) int indexof(e item) E get(int index) void add(e item) void add(int index, E item) Constructs an empty array list where elements are type Object with an initial capacity of 10. Constructs an empty array list of the specified element type E with an initial capacity of 10. Constructs an empty array list where elements are type Object with an initial capacity of initcap. Constructs an empty array list of the specified element type E with an initial capacity of initcap. Returns the number of used elements in this list. Returns an array of the specified type of this ArrayList Returns true iff the specified item is in this list, otherwise false. Returns the index of the specified item if it is in this list, otherwise -1. Returns the item at the specified index in this list, throws IndexOutBoundsException if invalid index. Adds the specified item to the end of this list. Adds the specified item by inserting it into this list at the specified index. boolean addall(collection<? extends E> c) Appends all of the elements in the specified collection to the end of this list, in the order that they are returned by the specified collection s Iterator. E remove(int index) boolean remove(e item) Removes and returns the item from the specified index. Returns true iff the specified item was removed from this list, otherwise false. Method from the java.util.arrays class: Note the E s below are replaced with the particular array s element type. static String tostring(e[] array) Returns a String representation of the array, consisting of a list of the array s elements as strings separated by commas and enclosed in square brackets ("[]"). static void sort(e[] array) sorts the specified array in memory type E must be Comparable or Comparable<E> static int[] copyof(int[] orig, int newlength) Copies the specified array, truncating or padding with zeros (if necessary) so the copy has the specified length. static <E> E[] copyof(e[] orig, int newlength) Copies the specified array, truncating or padding with nulls (if necessary) so the copy has the specified length. static <E> List<E> aslist(e... a) Returns a fixed-size list backed by the specified array. c 2018 Williams, Renault CS200 Midterm Exam 2 (P) Page 4 of 7
5 Exception Class Inheritance Hierarchy: public class Object public class Throwable extends Object public class Exception extends Throwable public class RuntimeException extends Exception public class ArithmeticException extends RuntimeException public class IndexOutOfBoundsException extends RuntimeException public class ArrayIndexOutOfBoundsException extends IndexOutOfBounds public class StringIndexOutOfBoundsException extends IndexOutOfBounds public class ClassCastException extends RuntimeException public class NullPointerException extends RuntimeException public class NoSuchElementException extends RuntimeException public class InputMismatchException extends NoSuchElementException public class IOException extends Exception public class FileNotFoundException extends IOException public class EOFException extends IOException c 2018 Williams, Renault CS200 Midterm Exam 2 (P) Page 5 of 7
6 Part 1: Simple Choice (Questions 1 1, 2 points each) 1. The return type of the expression Math.pow(5, 6) * 2 is. A. double B. int c 2018 Williams, Renault CS200 Midterm Exam 2 (P) Page 6 of 7
7 Part 2: Multiple Choice (Questions 2 2, 3 points each) 2. What will the following code print out when it is run? Scanner scnr = new Scanner("Hello \n\n World!"); String c = scnr.next(); String b = scnr.nextline(); String a = scnr.next(); System.out.println(":" + a + ":" + b + ":"); A. :World!: : B. : : World!: C. :Hello:World!: D. :Hello: : c 2018 Williams, Renault CS200 Midterm Exam 2 (P) Page 7 of 7
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
More informationFaculty of Science COMP-202A - Introduction to Computing I (Fall 2008) Final Examination
First Name: Last Name: McGill ID: Section: Faculty of Science COMP-202A - Introduction to Computing I (Fall 2008) Final Examination Thursday, December 11, 2008 Examiners: Mathieu Petitpas [Section 1] 14:00
More informationFaculty of Science COMP-202A - Introduction to Computing I (Fall 2009) - All Sections Final Examination
First Name: Last Name: McGill ID: Section: Faculty of Science COMP-202A - Introduction to Computing I (Fall 2009) - All Sections Final Examination Wednesday, December 16, 2009 Examiners: Mathieu Petitpas
More informationFaculty of Science COMP-202B - Introduction to Computing I (Winter 2009) - All Sections Final Examination
First Name: Last Name: McGill ID: Section: Faculty of Science COMP-202B - Introduction to Computing I (Winter 2009) - All Sections Final Examination Wednesday, April 29, 2009 Examiners: Mathieu Petitpas
More informationFaculty of Science COMP-202A - Foundations of Computing (Fall 2013) - All Sections Midterm Examination
First Name: Last Name: McGill ID: Section: Faculty of Science COMP-202A - Foundations of Computing (Fall 2013) - All Sections Midterm Examination November 11th, 2013 Examiners: Jonathan Tremblay [Sections
More informationFaculty of Science COMP-202A - Foundations of Computing (Fall 2012) - All Sections Midterm Examination
First Name: Last Name: McGill ID: Section: Faculty of Science COMP-202A - Foundations of Computing (Fall 2012) - All Sections Midterm Examination November 7th, 2012 Examiners: Daniel Pomerantz [Sections
More informationFaculty of Science COMP-202A - Foundations of Computing (Fall 2013) - All Sections Midterm Examination
First Name: Last Name: McGill ID: Section: Faculty of Science COMP-202A - Foundations of Computing (Fall 2013) - All Sections Midterm Examination November 11th, 2013 Examiners: Jonathan Tremblay [Sections
More informationFaculty of Science COMP-202B - Introduction to Computing I (Winter 2010) - All Sections Midterm Examination
First Name: Last Name: McGill ID: Section: Faculty of Science COMP-202B - Introduction to Computing I (Winter 2010) - All Sections Midterm Examination Thursday, March 11, 2010 Examiners: Milena Scaccia
More informationIndex COPYRIGHTED MATERIAL
Index COPYRIGHTED MATERIAL Note to the Reader: Throughout this index boldfaced page numbers indicate primary discussions of a topic. Italicized page numbers indicate illustrations. A abstract classes
More informationFaculty of Science COMP-202A - Introduction to Computing I (Fall 2009) - All Sections Midterm Examination
First Name: Last Name: McGill ID: Section: Faculty of Science COMP-202A - Introduction to Computing I (Fall 2009) - All Sections Midterm Examination Tuesday, November 3, 2009 Examiners: Mathieu Petitpas
More informationUsing 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
More informationFaculty of Science COMP-202A - Foundations of Computing (Fall 2015) - All Sections Midterm Examination
First Name: Last Name: McGill ID: Section: Faculty of Science COMP-202A - Foundations of Computing (Fall 2015) - All Sections Midterm Examination November 5 th, 2015 Examiners: Melanie Lyman-Abramovitch
More informationLecture 6. Assignments. Summary - Variables. Summary Program Parts 1/29/18. Reading: 3.1, 3.2, 3.3, 3.4
Assignments Lecture 6 Complete for Project 1 Reading: 3.1, 3.2, 3.3, 3.4 Summary Program Parts Summary - Variables Class Header (class name matches the file name prefix) Class Body Because this is a program,
More informationWelcome to the Using Objects lab!
Welcome to the Using Objects lab! Learning Outcomes By the end of this lab: 1. Be able to define chapter 3 terms. 2. Describe reference variables and compare with primitive data type variables. 3. Draw
More informationFaculty of Science COMP-202B - Foundations of Computing (Winter 2016) - All Sections Midterm Examination
Faculty of Science COMP-202B - Foundations of Computing (Winter 2016) - All Sections Midterm Examination February 23 rd, 2016 Examiners: Yang Cai [Section 1 TR (10:00-11:30)] 18:00-21:00 Jackie Chi Kit
More informationCSC 1051 Algorithms and Data Structures I. Midterm Examination October 11, Name: KEY
CSC 1051 Algorithms and Data Structures I Midterm Examination October 11, 2018 Name: KEY Question Value Score 1 20 2 20 3 20 4 20 5 20 TOTAL 100 Please answer questions in the spaces provided. If you make
More informationFull file at
Java Programming: From Problem Analysis to Program Design, 3 rd Edition 2-1 Chapter 2 Basic Elements of Java At a Glance Instructor s Manual Table of Contents Overview Objectives s Quick Quizzes Class
More informationCOMP102: Test. 26 April, 2006
Name:.................................. ID Number:............................ Signature:.............................. COMP102: Test 26 April, 2006 Instructions Time allowed: 90 minutes (1 1 2 hours).
More informationOperators. Java operators are classified into three categories:
Operators Operators are symbols that perform arithmetic and logical operations on operands and provide a meaningful result. Operands are data values (variables or constants) which are involved in operations.
More informationCSC 1051 Algorithms and Data Structures I. Midterm Examination March 1, Name: KEY A
CSC 1051 Algorithms and Data Structures I Midterm Examination March 1, 2018 Name: KEY A Question Value Score 1 20 2 20 3 20 4 20 5 20 TOTAL 100 Please answer questions in the spaces provided. If you make
More informationCIS 1068 Design and Abstraction Spring 2017 Midterm 1a
Spring 2017 Name: TUID: Page Points Score 1 28 2 18 3 12 4 12 5 15 6 15 Total: 100 Instructions The exam is closed book, closed notes. You may not use a calculator, cell phone, etc. i Some API Reminders
More informationFaculty of Science COMP-202A - Introduction to Computing I (Fall 2010) - All Sections Final Examination
First Name: Last Name: McGill ID: Section: Faculty of Science COMP-202A - Introduction to Computing I (Fall 2010) - All Sections Final Examination Wednesday, December 8, 2010 Examiners: Maja Frydrychowicz
More informationA variable is a name for a location in memory A variable must be declared
Variables A variable is a name for a location in memory A variable must be declared, specifying the variable's name and the type of information that will be held in it data type variable name int total;
More informationCSC 1051 Algorithms and Data Structures I. Midterm Examination October 6, Name:
CSC 1051 Algorithms and Data Structures I Midterm Examination October 6, 2016 Name: Question Value Score 1 20 2 20 3 20 4 20 5 20 TOTAL 100 Please answer questions in the spaces provided. If you make a
More informationLecture 6. Assignments. Java Scanner. User Input 1/29/18. Reading: 2.12, 2.13, 3.1, 3.2, 3.3, 3.4
Assignments Reading: 2.12, 2.13, 3.1, 3.2, 3.3, 3.4 Lecture 6 Complete for Lab 4, Project 1 Note: Slides 12 19 are summary slides for Chapter 2. They overview much of what we covered but are not complete.
More information"Hello" " This " + "is String " + "concatenation"
Strings About Strings Strings are objects, but there is a special syntax for writing String literals: "Hello" Strings, unlike most other objects, have a defined operation (as opposed to a method): " This
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 informationPrimitive Data Types: Intro
Primitive Data Types: Intro Primitive data types represent single values and are built into a language Java primitive numeric data types: 1. Integral types (a) byte (b) int (c) short (d) long 2. Real types
More informationCSC Algorithms and Data Structures I. Midterm Examination February 25, Name:
CSC 1051-001 Algorithms and Data Structures I Midterm Examination February 25, 2016 Name: Question Value Score 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 10 TOTAL 100 Please answer questions in the
More informationCOMP 202. Built in Libraries and objects. CONTENTS: Introduction to objects Introduction to some basic Java libraries string
COMP 202 Built in Libraries and objects CONTENTS: Introduction to objects Introduction to some basic Java libraries string COMP 202 Objects and Built in Libraries 1 Classes and Objects An object is an
More informationCSCI 2010 Principles of Computer Science. Data and Expressions 08/09/2013 CSCI
CSCI 2010 Principles of Computer Science Data and Expressions 08/09/2013 CSCI 2010 1 Data Types, Variables and Expressions in Java We look at the primitive data types, strings and expressions that are
More informationCSC 1051 Algorithms and Data Structures I. Midterm Examination February 25, Name: KEY A
CSC 1051 Algorithms and Data Structures I Midterm Examination February 25, 2016 Name: KEY A Question Value Score 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 10 TOTAL 100 Please answer questions in
More informationCSE143 Midterm Summer Name of Student: Section (e.g., AA): Student Number:
CSE143 Midterm Summer 2017 Name of Student: Section (e.g., AA): Student Number: The exam is divided into six questions with the following points: # Problem Area Points Score ---------------------------------------------
More informationECE 122 Engineering Problem Solving with Java
ECE 122 Engineering Problem Solving with Java Lecture 3 Expression Evaluation and Program Interaction Outline Problem: How do I input data and use it in complicated expressions Creating complicated expressions
More informationA token is a sequence of characters not including any whitespace.
Scanner A Scanner object reads from an input source (keyboard, file, String, etc) next() returns the next token as a String nextint() returns the next token as an int nextdouble() returns the next token
More informationCSC 1051 Algorithms and Data Structures I. Midterm Examination March 2, Name:
CSC 1051 Algorithms and Data Structures I Midterm Examination March 2, 2017 Name: Question Value Score 1 10 2 10 3 20 4 20 5 20 6 20 TOTAL 100 Please answer questions in the spaces provided. If you make
More informationData Conversion & Scanner Class
Data Conversion & Scanner Class Quick review of last lecture August 29, 2007 ComS 207: Programming I (in Java) Iowa State University, FALL 2007 Instructor: Alexander Stoytchev Numeric Primitive Data Storing
More informationFaculty of Science COMP-202B - Foundations of Computing (Winter 2016) - All Sections Final Examination
Faculty of Science COMP-202B - Foundations of Computing (Winter 2016) - All Sections Final Examination April 21 st, 2016 Examiners: Yang Cai [Section 1 TR (10:00-11:30)] 14:00-17:00 Jackie Chi Kit Cheung
More informationProgramming II (CS300)
1 Programming II (CS300) Chapter 02: Using Objects MOUNA KACEM mouna@cs.wisc.edu Spring 2018 Using Objects 2 Introduction to Object Oriented Programming Paradigm Objects and References Memory Management
More informationCS 367: Introduction to Data Structures Midterm Sample Questions
LAST NAME (PRINT): FIRST NAME (PRINT): CS 367: Introduction to Data Structures Midterm Sample Questions Friday, July 14 th 2017. 100 points (26% of final grade) Instructor: Meena Syamkumar 1. Fill in these
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 informationCOMP Primitive and Class Types. Yi Hong May 14, 2015
COMP 110-001 Primitive and Class Types Yi Hong May 14, 2015 Review What are the two major parts of an object? What is the relationship between class and object? Design a simple class for Student How to
More informationFaculty of Science COMP-202A - Introduction to Computing I (Fall 2011) - All Sections Midterm Examination
First Name: Last Name: McGill ID: Section: Faculty of Science COMP-202A - Introduction to Computing I (Fall 2011) - All Sections Midterm Examination Monday, October 31, 2011 Examiners: Daniel Pomerantz
More informationBasic Computation. Chapter 2
Walter Savitch Frank M. Carrano Basic Computation Chapter 2 Outline Variables and Expressions The Class String Keyboard and Screen I/O Documentation and Style Variables Variables store data such as numbers
More informationComputer Science 145
Name: Computer Science 145 Final Exam Answer Sheet Fall 2016 1. a b c d 8. 2. a b c d 9. a b c d 3. a b c d e 10. a b c d 4. a b c d 11. 5. a b c d 12. 6. 13. 7. 14. a b c d 15. 16. 17. 1 18. 19. 2 20.
More informationAP Computer Science A
AP Computer Science A 1st Quarter Notes Table of Contents - section links Click on the date or topic below to jump to that section Date : 9/8/2017 Aim : Java Basics Objects and Classes Data types: Primitive
More informationComputer Science 145 Midterm 1 Fall 2016
Computer Science 145 Midterm 1 Fall 2016 Doodle here. This is a closed-book, no-calculator, no-electronic-devices, individual-effort exam. You may reference one page of handwritten notes. All answers should
More informationCMSC 206: Data Structures Final Exam Reference May 2018
CMSC 206: Data Structures Final Exam Reference May 2018 public interface BMCSet /** Adds a new item to the set * @param item The new item to add to the set * @return true if the item is a new item added
More informationWe now start exploring some key elements of the Java programming language and ways of performing I/O
We now start exploring some key elements of the Java programming language and ways of performing I/O This week we focus on: Introduction to objects The String class String concatenation Creating objects
More informationProgramming with Java
Programming with Java Data Types & Input Statement Lecture 04 First stage Software Engineering Dep. Saman M. Omer 2017-2018 Objectives q By the end of this lecture you should be able to : ü Know rules
More informationThe 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 informationPace University. Fundamental Concepts of CS121 1
Pace University Fundamental Concepts of CS121 1 Dr. Lixin Tao http://csis.pace.edu/~lixin Computer Science Department Pace University October 12, 2005 This document complements my tutorial Introduction
More informationBasic Computation. Chapter 2
Basic Computation Chapter 2 Outline Variables and Expressions The Class String Keyboard and Screen I/O Documentation and Style Variables Variables store data such as numbers and letters. Think of them
More informationElementary Programming
Elementary Programming EECS1022: Programming for Mobile Computing Winter 2018 CHEN-WEI WANG Learning Outcomes Learn ingredients of elementary programming: data types [numbers, characters, strings] literal
More informationData and Expressions. Outline. Data and Expressions 12/18/2010. Let's explore some other fundamental programming concepts. Chapter 2 focuses on:
Data and Expressions Data and Expressions Let's explore some other fundamental programming concepts Chapter 2 focuses on: Character Strings Primitive Data The Declaration And Use Of Variables Expressions
More informationCSE 143 Lecture 4. ArrayList. Reading: slides created by Marty Stepp
CSE 143 Lecture 4 ArrayList Reading: 10.1 slides created by Marty Stepp http://www.cs.washington.edu/143/ Handling errors Currently our ArrayIntList class allows the user to do some bad things, like adding/getting
More informationCSC 1051 Algorithms and Data Structures I. Midterm Examination October 9, Name: KEY
CSC 1051 Algorithms and Data Structures I Midterm Examination October 9, 2014 Name: KEY Question Value Score 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 10 TOTAL 100 Please answer questions in the
More informationRepetition. Chapter 6
Chapter 6 Repetition Goals This chapter introduces the third major control structure repetition (sequential and selection being the first two). Repetition is discussed within the context of two general
More informationRepetition. Chapter 6
Chapter 6 Repetition Goals This chapter introduces the third major control structure repetition (sequential and selection being the first two). Repetition is discussed within the context of two general
More informationObjects and Classes 1: Encapsulation, Strings and Things CSC 121 Fall 2014 Howard Rosenthal
Objects and Classes 1: Encapsulation, Strings and Things CSC 121 Fall 2014 Howard Rosenthal Lesson Goals Understand objects and classes Understand Encapsulation Learn about additional Java classes The
More informationTester vs. Controller. Elementary Programming. Learning Outcomes. Compile Time vs. Run Time
Tester vs. Controller Elementary Programming EECS1022: Programming for Mobile Computing Winter 2018 CHEN-WEI WANG For effective illustrations, code examples will mostly be written in the form of a tester
More informationCSE 373. Data Types and Manipulation; Arrays. slides created by Marty Stepp
CSE 373 Data Types and Manipulation; Arrays slides created by Marty Stepp http://www.cs.washington.edu/373/ University of Washington, all rights reserved. 1 Numeric data type kind of number memory (bits)
More informationLecture 8: The String Class and Boolean Zen
Lecture 8: The String Class and Boolean Zen Building Java Programs: A Back to Basics Approach by Stuart Reges and Marty Stepp Copyright (c) Pearson 2013. All rights reserved. Strings string: An object
More informationCSC 1051 Algorithms and Data Structures I. Midterm Examination February 26, Name: Key
CSC 1051 Algorithms and Data Structures I Midterm Examination February 26, 2015 Name: Key Question Value 1 10 Score 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 10 TOTAL 100 Please answer questions in the
More informationEntry Point of Execution: the main Method. Elementary Programming. Learning Outcomes. Development Process
Entry Point of Execution: the main Method Elementary Programming EECS1021: Object Oriented Programming: from Sensors to Actuators Winter 2019 CHEN-WEI WANG For now, all your programming exercises will
More informationCSC 1051 Algorithms and Data Structures I. Midterm Examination October 7, Name:
CSC 1051 Algorithms and Data Structures I Midterm Examination October 7, 2013 Name: Question Value Score 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 10 TOTAL 100 Please answer questions in the spaces
More informationJAVA OPERATORS GENERAL
JAVA OPERATORS GENERAL Java provides a rich set of operators to manipulate variables. We can divide all the Java operators into the following groups: Arithmetic Operators Relational Operators Bitwise Operators
More informationChapter 2: Data and Expressions
Chapter 2: Data and Expressions CS 121 Department of Computer Science College of Engineering Boise State University January 15, 2015 Chapter 2: Data and Expressions CS 121 1 / 1 Chapter 2 Part 1: Data
More informationCS 302: Introduction to Programming
CS 302: Introduction to Programming Lectures 2-3 CS302 Summer 2012 1 Review What is a computer? What is a computer program? Why do we have high-level programming languages? How does a high-level program
More informationMr. Monroe s Guide to Mastering Java Syntax
Mr. Monroe s Guide to Mastering Java Syntax Getting Started with Java 1. Download and install the official JDK (Java Development Kit). 2. Download an IDE (Integrated Development Environment), like BlueJ.
More informationExam 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
More informationOperators in java Operator operands.
Operators in java Operator in java is a symbol that is used to perform operations and the objects of operation are referred as operands. There are many types of operators in java such as unary operator,
More informationWeek 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
More informationChapter 2: Data and Expressions
Chapter 2: Data and Expressions CS 121 Department of Computer Science College of Engineering Boise State University April 21, 2015 Chapter 2: Data and Expressions CS 121 1 / 53 Chapter 2 Part 1: Data Types
More informationMidterm Review 01. SP17 ICS 111 Ed Meyer
Midterm Review 01 SP17 ICS 111 Ed Meyer Exam Details On Laulima > Quizzes, Tests and Surveys Due Thursday 2/23 by 11:55pm Password: toast 1 attempt; 1 hr 15 minutes Reserve uninterrupted time for yourself
More informationCIS 110 Introduction To Computer Programming. November 21st, 2011 Exam 2
CIS 110 Introduction To Computer Programming November 21st, 2011 Exam 2 Name and section # Pennkey (# and username): My signature below certifies that I have complied with the University of Pennsylvania
More informationCS 106 Introduction to Computer Science I
CS 106 Introduction to Computer Science I 06 / 03 / 2015 Instructor: Michael Eckmann Today s Topics Finish up discussion of projected homeruns 162 as a constant (final) double vs. int in calculation Scanner
More informationCSE 143 Au03 Midterm 2 Page 1 of 7
CSE 143 Au03 Midterm 2 Page 1 of 7 Question 1. (4 points) (a) If a precondition is not true when a method is called, two possible ways to detect and handle the situation are to use an assert statement
More informationCS 307 Final Spring 2008
Points off 1 2 3 4 5 Total off Net Score CS 307 Final Spring 2008 Name UTEID login name Instructions: 1. Please turn off your cell phones. 2. There are 5 questions on this test. 3. You have 3 hours to
More informationWeiss Chapter 1 terminology (parenthesized numbers are page numbers)
Weiss Chapter 1 terminology (parenthesized numbers are page numbers) assignment operators In Java, used to alter the value of a variable. These operators include =, +=, -=, *=, and /=. (9) autoincrement
More informationCS Introduction to Data Structures Week 1 Thursday
CS 367 - Introduction to Data Structures Week 1 Thursday We assume that you are proficient at object-oriented programming in Java. Please enroll in CS300 if you do not know Java and have not written object-oriented
More informationJVM (java) compiler. A Java program is either a library of static methods (functions) or a data type definition
Programming Model Basic Structure of a Java Program The Java workflow editor (Code) P.java compiler (javac) P.class JVM (java) output A Java program is either a library of static methods (functions) or
More informationCS5000: Foundations of Programming. Mingon Kang, PhD Computer Science, Kennesaw State University
CS5000: Foundations of Programming Mingon Kang, PhD Computer Science, Kennesaw State University Mathematical Functions Java provides many useful methods in the Math class for performing common mathematical
More informationObject-Oriented Programming
Data structures Object-Oriented Programming Outline Primitive data types String Math class Array Container classes Readings: HFJ: Ch. 13, 6. GT: Ch. 13, 6. Đại học Công nghệ - ĐHQG HN Data structures 2
More informationWhat did we talk about last time? Examples switch statements
Week 4 - Friday What did we talk about last time? Examples switch statements History of computers Hardware Software development Basic Java syntax Output with System.out.print() Mechanical Calculation
More informationQuestion 0. (1 point) Write the correct ID of the section you normally attend on the cover page of this exam if you have not already done so.
CSE 143 Sp04 Midterm 2 Page 1 of 10 Reference information about some standard Java library classes appears on the last pages of the test. You can tear off these pages for easier reference during the exam
More informationUsing APIs. Chapter 3. Outline Fields Overall Layout. Java By Abstraction Chapter 3. Field Summary static double PI
Outline Chapter 3 Using APIs 3.1 Anatomy of an API 3.1.1 Overall Layout 3.1.2 Fields 3.1.3 Methods 3.2 A Development Walkthrough 3.2.1 3.2.2 The Mortgage Application 3.2.3 Output Formatting 3.2.4 Relational
More informationAdam Blank Lecture 2 Winter 2019 CS 2. Introduction to Programming Methods
Adam Blank Lecture 2 Winter 2019 CS 2 Introduction to Programming Methods CS 2: Introduction to Programming Methods File I/O, Object Oriented Programming, and Lists Questions From Last Time 1 What are
More informationSection 2: Introduction to Java. Historical note
The only way to learn a new programming language is by writing programs in it. - B. Kernighan & D. Ritchie Section 2: Introduction to Java Objectives: Data Types Characters and Strings Operators and Precedence
More informationHello World. n Variables store information. n You can think of them like boxes. n They hold values. n The value of a variable is its current contents
Variables in a programming language Basic Computation (Savitch, Chapter 2) TOPICS Variables and Data Types Expressions and Operators Integers and Real Numbers Characters and Strings Input and Output Variables
More informationJava provides a rich set of operators to manipulate variables. We can divide all the Java operators into the following groups:
Basic Operators Java provides a rich set of operators to manipulate variables. We can divide all the Java operators into the following groups: Arithmetic Operators Relational Operators Bitwise Operators
More informationH212 Introduction to Software Systems Honors
Introduction to Software Systems Honors Lecture #04: Fall 2015 1/20 Office hours Monday, Wednesday: 10:15 am to 12:00 noon Tuesday, Thursday: 2:00 to 3:45 pm Office: Lindley Hall, Room 401C 2/20 Printing
More informationQUIZ: What value is stored in a after this
QUIZ: What value is stored in a after this statement is executed? Why? a = 23/7; QUIZ evaluates to 16. Lesson 4 Statements, Expressions, Operators Statement = complete instruction that directs the computer
More informationCS 106 Introduction to Computer Science I
CS 106 Introduction to Computer Science I 06 / 02 / 2015 Instructor: Michael Eckmann Today s Topics Operators continue if/else statements User input Operators + when used with numeric types (e.g. int,
More informationCIS 110: Introduction to Computer Programming
CIS 110: Introduction to Computer Programming Lecture 15 Our Scanner eats files ( 6.1-6.2) 10/31/2011 CIS 110 (11fa) - University of Pennsylvania 1 Outline Programming assertion recap The Scanner object
More informationCS 455 Midterm Exam 2 Fall 2016 [Bono] November 8, 2016
Name: USC NetID (e.g., ttrojan): CS 455 Midterm Exam 2 Fall 2016 [Bono] November 8, 2016 There are 7 problems on the exam, with 50 points total available. There are 8 pages to the exam (4 pages double-sided),
More informationCSC 1214: Object-Oriented Programming
CSC 1214: Object-Oriented Programming J. Kizito Makerere University e-mail: jkizito@cis.mak.ac.ug www: http://serval.ug/~jona materials: http://serval.ug/~jona/materials/csc1214 e-learning environment:
More informationCS Programming I: Branches
CS 200 - Programming I: Branches Marc Renault Department of Computer Sciences University of Wisconsin Madison Fall 2018 TopHat Sec 3 (AM) Join Code: 925964 TopHat Sec 4 (PM) Join Code: 259495 Boolean Statements
More informationBasic operators, Arithmetic, Relational, Bitwise, Logical, Assignment, Conditional operators. JAVA Standard Edition
Basic operators, Arithmetic, Relational, Bitwise, Logical, Assignment, Conditional operators JAVA Standard Edition Java - Basic Operators Java provides a rich set of operators to manipulate variables.
More informationLab 14 & 15: String Handling
Lab 14 & 15: String Handling Prof. Navrati Saxena TA: Rochak Sachan String Handling 9/11/2012 22 String Handling Java implements strings as objects of type String. Once a String object has been created,
More information