ITI Introduction to Computing II

Similar documents
ITI Introduction to Computing II

CS Exam 1 Study Guide and Practice Exam

Computer Science Introductory Course MSc - Introduction to Java

More About Methods. Hsuan-Tien Lin. Deptartment of CSIE, NTU. OOP Class, March 8-9, 2010

Constructors - Cont. must be distinguished by the number or type of their arguments.

1 ListElement l e = f i r s t ; / / s t a r t i n g p o i n t 2 while ( l e. next!= n u l l ) 3 { l e = l e. next ; / / next step 4 } Removal

Basic Java OOP 10/12/2015. Department of Computer Science & Information Engineering. National Taiwan University

Comp 11 Lectures. Mike Shah. July 12, Tufts University. Mike Shah (Tufts University) Comp 11 Lectures July 12, / 33

More on Methods and Encapsulation

1. Write a program to calculate distance traveled by light

Introduction to Programming (Java) 3/12

INTRODUCTION. This is not a full c-programming course. It is not even a full 'Java to c' programming course.

Hoare Logic: Reasoning About Imperative Programs

1 Trees. Listing 1: Node with two child reference. public class ptwochildnode { protected Object data ; protected ptwochildnode l e f t, r i g h t ;

Hoare Examples & Proof Theory. COS 441 Slides 11

Class versus Instance (Section 5.1)

A Short Introduction to Hoare Logic

Measuring Goodness of an Algorithm. Asymptotic Analysis of Algorithms. Measuring Efficiency of an Algorithm. Algorithm and Data Structure

Course Announcements. John Jannotti (cs32) Scope, Collections & Generics Feb 8, / 1

Analysis of Algorithms

6.001 Recitation 22: Streams

FACULTY OF SCIENCE ACADEMY OF COMPUTER SCIENCE AND SOFTWARE ENGINEERING OBJECT ORIENTED PROGRAMMING DATE 07/2014 SESSION 8:00-10:00

DARN: A Matrix Manipulation Language

Sharing Objects. Pieter van den Hombergh. Fontys Hogeschool voor Techniek en Logistiek. February 15, 2017

Programming Language Concepts, CS2104 Lecture 3

EDA045F: Program Analysis LECTURE 10: TYPES 1. Christoph Reichenbach

CSE332: Data Structures & Parallelism Lecture 2: Algorithm Analysis. Ruth Anderson Winter 2019

ECEN 651: Microprogrammed Control of Digital Systems Department of Electrical and Computer Engineering Texas A&M University

Functional Programming with F# Overview and Basic Concepts

Data Structures and Algorithms Winter Semester

Outline. policies for the first part. with some potential answers... MCS 260 Lecture 10.0 Introduction to Computer Science Jan Verschelde, 9 July 2014

CS 163/164 - Exam 1 Study Guide and Practice Exam

COMS 6100 Class Notes

MiniMat: Matrix Language in OCaml LLVM

CompA - Complex Analyzer

Introduction to Computing II (ITI 1121) FINAL EXAMINATION

Unit 8: Sequ. ential Circuits

Comp 11 Lectures. Mike Shah. June 20, Tufts University. Mike Shah (Tufts University) Comp 11 Lectures June 20, / 38

Tou has been released!

20.1 2SAT. CS125 Lecture 20 Fall 2016

Lecture 20: Analysis of Algorithms

EECS 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization

Clojure Concurrency Constructs, Part Two. CSCI 5828: Foundations of Software Engineering Lecture 13 10/07/2014

QUIZ - How Well Do You Know RPN? Richard J. Nelson

Static Program Analysis

CSE 331 Winter 2018 Reasoning About Code I

CSE373: Data Structures and Algorithms Lecture 3: Math Review; Algorithm Analysis. Catie Baker Spring 2015

CSE332: Data Structures & Parallelism Lecture 2: Algorithm Analysis. Ruth Anderson Winter 2018

Program Verification Using Separation Logic

CMSC 132, Object-Oriented Programming II Summer Lecture 10:

CSE332: Data Structures & Parallelism Lecture 2: Algorithm Analysis. Ruth Anderson Winter 2018

Solving Equations by Adding and Subtracting

Limitations of OCAML records

10: Analysis of Algorithms

Example: Fib(N) = Fib(N-1) + Fib(N-2), Fib(1) = 0, Fib(2) = 1

CS5371 Theory of Computation. Lecture 7: Automata Theory V (CFG, CFL, CNF)

Program Analysis Part I : Sequential Programs

Outline Resource Introduction Usage Testing Exercises. Linked Lists COMP SCI / SFWR ENG 2S03. Department of Computing and Software McMaster University

Latches. October 13, 2003 Latches 1

INF Models of concurrency

CSCI 239 Discrete Structures of Computer Science Lab 6 Vectors and Matrices

Computability, Undeciability and the Halting Problem

Create Satellite Image, Draw Maps

Automata Theory CS S-12 Turing Machine Modifications

Deterministic Finite Automaton (DFA)

Lists, Stacks, and Queues (plus Priority Queues)

Introduction to Computing II (ITI1121) FINAL EXAMINATION

15-451/651: Design & Analysis of Algorithms September 13, 2018 Lecture #6: Streaming Algorithms last changed: August 30, 2018

Formal Specification and Verification. Specifications

Computational complexity and some Graph Theory

Lab 2: Static Response, Cantilevered Beam

CSE 20. Lecture 4: Introduction to Boolean algebra. CSE 20: Lecture4

Python. chrysn

Axiomatic Semantics. Operational semantics. Good for. Not good for automatic reasoning about programs

CSE 311: Foundations of Computing I. Lecture 1: Propositional Logic

1 Java Night Countdown (30%)

Lisp Introduction. Dr. Neil T. Dantam. Spring CSCI-498/598 RPM, Colorado School of Mines. Dantam (Mines CSCI, RPM) Lisp Spring / 88

Softwaretechnik. Lecture 13: Design by Contract. Peter Thiemann University of Freiburg, Germany

Finite Automata Part Two

CSE370: Introduction to Digital Design

Introducing Proof 1. hsn.uk.net. Contents

Solutions. Prelim 2[Solutions]

Comp487/587 - Boolean Formulas

Softwaretechnik. Lecture 13: Design by Contract. Peter Thiemann University of Freiburg, Germany

Lexical Analysis: DFA Minimization & Wrap Up

Design of Embedded Systems: Models, Validation and Synthesis (EE 249) Lecture 9

Undecidability and Rice s Theorem. Lecture 26, December 3 CS 374, Fall 2015

CSE 241 Class 1. Jeremy Buhler. August 24,

Introduction to Computing II (ITI 1121) MIDTERM EXAMINATION

Algorithmic verification

Description of the ED library Basic Atoms

Simply Typed Lambda Calculus

CSC236 Week 10. Larry Zhang

Principles of Program Analysis: A Sampler of Approaches

Plan for Today and Beginning Next week (Lexical Analysis)

CS-140 Fall 2017 Test 1 Version Practice Practice for Nov. 20, Name:

Comp 11 Lectures. Mike Shah. July 26, Tufts University. Mike Shah (Tufts University) Comp 11 Lectures July 26, / 40

Algebra Year 9. Language

On the Simulation of Random Events or How to calculate the number of cars arriving at an intersection in any given period of time

Information and Entropy. Professor Kevin Gold

Transcription:

(with contributions from R. Holte) School of Electrical Engineering and Computer Science University of Ottawa Version of January 11, 2015 Please don t print these lecture notes unless you really need to!

Great coders are today s rock stars Will.I.Am Watch the video at code.org!

Review Objectives: 1. Discussing several concepts related to data types 2. Understanding the implications of the differences between primitive and reference types 3. Reviewing call-by-value 4. Understanding the concept of scope Lectures: Pages 597 631 of E. Koffman and P. Wolfgang.

Plan 1. What are variables and data types 2. Primitive vs reference 3. Comparison operators (primitive vs reference) 4. Auto-boxing/auto-unboxing; 5. Passing parameters 6. Scope 7. Memory management

Variables What is a variable? A variable is a place in memory, to hold a value, which we refer to with help of a label 0,000,000,000 0,000,123,455 (i) 0,000,123,456 0,000,123,457 33 4,294,967,296 byte i = 3 3 ;

Variables I will be using Greek letters to designate memory locations (addresses) since in Java we don t know the location of objects and should not care! (i) α 1 α α +1 33 byte i = 3 3 ;

Data types What are data types for? Yes, it tells the compiler how much memory to allocate: double f o r m u l a ; // 8 b y t e s char c ; // 2 b y t e s But it also? It gives information about the meaning (semantic) of the data: which operations are allowed, which data are compatible. Hence the following statement, c = f l a g f o r m u l a ; will produce an error at compile time; data types are therefore also useful to help detect errors in programs early on.

Data types (contd) To be more precise, there are concrete data types and abstract data types Concrete data types specify both, the allowed operations and the representation of the data Abstract Data Types (ADTs) specify only the allowed operations

Data Types in Java In Java, we have primitive and reference data types: Primitive are: numbers, characters (but not Strings) and booleans the value is stored at the memory location designated by the label of the variable References: Predefined: Arrays Strings User defined, reference to an instance of a class; The value of a reference variable is a memory location, which points/references to the location of an object; it is a pointer, a link, it s a reference The declaration of a reference variable does not create an object, does not allocate space for an object, it only allocates memory to store the address of an object

(a) α null > i n t [ ] a ; a = new i n t [ 5 ] ; The declaration of a reference variable only allocates memory to hold a reference (sometimes called pointer or address), null is a special value (literal), which does not reference an object

(a) α null i n t [ ] a ; > a = new i n t [ 5 ] ; (instance) β 0 0 0 0 0 The creation of a new instance, new int[ 5 ], allocates memory to hold 5 integer values (and the housekeeping information). Each cell of the array is initialized with the default int value, which is 0.

(a) α β i n t [ ] a ; > a = new i n t [ 5 ] ; (instance) β 0 0 0 0 0 Finally, the reference of the newly created object is assigned to the location designed by the label a.

Memory diagram Because we don t know (and shouldn t care) about the actual memory layout, we often use memory diagrams such as the following, (a) α β a (a) (instance) α β β 0 0 0 0 0 (instance) β 0 0 0 0 0 0 0 0 0 0

Memory diagram In a memory diagram, I want to see: a box for every reference variable with an arrow pointing a the designated object a box for every primitive variable with the value inside the box a box for every object a i n t [ ] a ; a = new i n t [ 5 ] ; 0 0 0 0 0

Memory diagram Given the following class declaration: p u b l i c c l a s s Constant { p r i v a t e f i n a l S t r i n g name ; p r i v a t e f i n a l double v a l u e ; p u b l i c Constant ( S t r i n g name, double v a l u e ) { t h i s. name = name ; t h i s. v a l u e = v a l u e ; Draw the memory diagram for the following statments: Constant c ; c = new Constant ( g o l d e n r a t i o, 1.61803399 ) ;

Memory diagram c a reference variable of type Constant value 1.6180339887 name an instance of the class Constant "golden ratio" an instance of the class String

Memory diagram c a reference variable of type Constant value 1.6180339887 name an instance of the class Constant "golden ratio" an instance of the class String

Remember Variables have types Objects have classes

Class Integer In the following examples, we ll be using our own class Integer: c l a s s I n t e g e r { i n t v a l u e ; Usage: I n t e g e r a ; a = new I n t e g e r ( ) ; a. v a l u e = 3 3 ; a. v a l u e ++; System. out. p r i n t l n ( a. v a l u e = + a. v a l u e ) ; We use the dot notation to access the value of an instance variable. Java has a pre-defined class named Integer. It is called a wrapper class; it wraps an int value into an object.

Class Integer Adding a constructor c l a s s I n t e g e r { i n t v a l u e ; I n t e g e r ( i n t v ) { v a l u e = v ; Usage: I n t e g e r a ; a = new I n t e g e r ( 33 ) ;

Primitive vs reference variables i 33 i null alias null i n t i = 3 3 ; I n t e g e r i, a l i a s ; i = new I n t e g e r ( 33 ) ; a l i a s = i ; At compile time the necessary memory to hold the reference is allocated

Primitive vs reference variables i 33 i null alias null α value 33 i n t i = 3 3 ; I n t e g e r i, a l i a s ; i = new I n t e g e r ( 33 ) ; a l i a s = i ; Creating an object (new Integer( 33 ))

Primitive vs reference variables i 33 i α alias null α value 33 i n t i = 3 3 ; I n t e g e r i, a l i a s ; i = new I n t e g e r ( 33 ) ; a l i a s = i ; Assigning the reference of that object to the reference variable i

Primitive vs reference variables i 33 i α alias α α value 33 i n t i = 3 3 ; I n t e g e r i, a l i a s ; i = new I n t e g e r ( 33 ) ; a l i a s = i ; Copying the value of the reference variable i into alias

Primitive vs reference variables i 33 i alias value 33 i n t i = 3 3 ; I n t e g e r i, a l i a s ; i = new I n t e g e r ( 33 ) ; a l i a s = i ; i and alias are both designating the same object!

Primitive vs reference variables i alias i 33 value 33 i n t i = 3 3 ; I n t e g e r i, a l i a s ; i = new I n t e g e r ( 33 ) ; a l i a s = i ; Using the memory diagram representation

Wrappers For every primitive type there is an associated wrapper class For instance, Integer is the wrapper class for the primitive type int A wrapper stores a value of a primitive type inside an object This will be paramount for stacks, queues, lists and trees Besides holding a value, the wrapper classes possess several class methods, mainly to convert values from/to other types, e.g. Integer.parseInt( 33 )

Quiz This is valid Java statement, true or false? I n t e g e r i = 1 ; If this is a valid statement, what are the implications? Okay, 1 is a value of a primitive type, int, but i is a reference variable, of type Integer In Java 1.4 or older, this would cause a compile-time error! However, in Java 5, 6 or 7, this is a valid statement! Why?

Auto-boxing This is because Java 5, 6 and 7 automagically transform the following statement I n t e g e r i = 1 ; into I n t e g e r i = new I n t e g e r ( 1 ) ; This is called auto-boxing.

Auto-unboxing Similarly, the statement i = i + 5 I n t e g e r i = 1 ; i = i + 5 ; is transformed into i = new I n t e g e r ( i. i n t V a l u e ( ) + 5 ) ; where the value of the wrapper object designated by i is extracted, unboxed, with the method call, i.intvalue().

Boxing/unboxing Primitive byte short int long float double bool char Reference Byte Short Integer Long Float Double Boolean Character All 8 primitive types have a corresponding wrapper class. The automatic conversion from primitive to reference type is called boxing, and the conversion from reference to primitive type is called unboxing.

Does it matter? l o n g s1 = ( l o n g ) 0 ; f o r ( j =0; j <10000000; j++ ) { s1 = s1 + ( l o n g ) 1 ; Long s2 = ( l o n g ) 0 ; f o r ( j =0; j <10000000; j++ ) { s2 = s2 + ( l o n g ) 1 ; 49 milliseconds 340 milliseconds Why? On the right side, s2 is declared as a Long, hence, the line, s2 = s2 + ( long ) 1 ; is rewritten as, s2 = new Long ( s2. l o n g V a l u e ( ) + ( long ) 1 ) ;

Programming tip: benchmarking your code long s t a r t, stop, e l a p s e d ; s t a r t = System. c u r r e n t T i m e M i l l i s ( ) ; // s t a r t the c l o c k f o r ( j =0; j <10000000; j++ ) { s2 += ( long ) 1 ; // s t a n d s f o r s2 = s2 + ( l o n g ) 1 s t o p = System. c u r r e n t T i m e M i l l i s ( ) ; // s t o p the c l o c k e l a p s e d = s t o p s t a r t ; where System.currentTimeMillis() returns the number of milliseconds elapsed since midnight, January 1, 1970 UTC (Coordinated Universal Time). System.nanoTime() also exists.

Billion-dollar mistake (Null reference) I call it my billion-dollar mistake. It was the invention of the null reference in 1965. At that time, I was designing the first comprehensive type system for references in an object oriented language (ALGOL W). My goal was to ensure that all use of references should be absolutely safe, with checking performed automatically by the compiler. But I couldn t resist the temptation to put in a null reference, simply because it was so easy to implement. This has led to innumerable errors, vulnerabilities, and system crashes, which have probably caused a billion dollars of pain and damage in the last forty years. Tony Hoare

Comparison operators primitive data types Variables of primitive data types can be compared directly i n t a = 5 ; i n t b = 1 0 ; i f ( a < b ) { System. out. p r i n t l n ( a < b ) ; e l s e i f ( a == b ) { System. out. p r i n t l n ( a == b ) ; e l s e { System. out. p r i n t l n ( a > b ) ; What will be printed out on the output? Prints a < b

a b α β 5 10 i n t a = 5 ; i n t b = 1 0 ; i f ( a < b ) { System. out. p r i n t l n ( a < b ) ; e l s e i f ( a == b ) { System. out. p r i n t l n ( a == b ) ; e l s e { System. out. p r i n t l n ( a > b ) ;

Comparison operators: primitive and reference types What will happen and why? i n t a = 5 ; I n t e g e r b = new I n t e g e r ( 5 ) ; i f ( a < b ) { System. out. p r i n t l n ( a < b ) ; e l s e i f ( a == b ) { System. out. p r i n t l n ( a == b ) ; e l s e { System. out. p r i n t l n ( a > b ) ; References.java:7: operator < cannot be applied to int,java.lang.integer if (a < b) ^ References.java:9: operator == cannot be applied to int,java.lang.integer else if (a == b) ^ 2 errors

a α 5 i n t a = 5 ; I n t e g e r b = new I n t e g e r ( 5 ) ; i f ( a < b ) { System. out. p r i n t l n ( a < b ) ; e l s e i f ( a == b ) { System. out. p r i n t l n ( a == b ) ; e l s e { System. out. p r i n t l n ( a > b ) ; b β γ value 5 γ References.java:7: operator < cannot be applied to int,java.lang.integer if (a < b) ^ References.java:9: operator == cannot be applied to int,java.lang.integer else if (a == b) ^ 2 errors

a b 5 i n t a = 5 ; I n t e g e r b = new I n t e g e r ( 5 ) ; i f ( a < b ) { System. out. p r i n t l n ( a < b ) ; e l s e i f ( a == b ) { System. out. p r i n t l n ( a == b ) ; e l s e { System. out. p r i n t l n ( a > b ) ; value 5 References.java:7: operator < cannot be applied to int,java.lang.integer if (a < b) ^ References.java:9: operator == cannot be applied to int,java.lang.integer else if (a == b) ^ 2 errors

a 5 i n t a = 5 ; I n t e g e r b = new I n t e g e r ( 5 ) ; b i f ( a < b ) { System. out. p r i n t l n ( a < b ) ; e l s e i f ( a == b ) { System. out. p r i n t l n ( a == b ) ; e l s e { System. out. p r i n t l n ( a > b ) ; value 5 References.java:7: operator < cannot be applied to int,java.lang.integer if (a < b) ^ References.java:9: operator == cannot be applied to int,java.lang.integer else if (a == b) ^ 2 errors

Comparison operators and reference types What will be the result? MyInteger a = new MyInteger ( 5 ) ; MyInteger b = new MyInteger ( 10 ) ; i f ( a < b ) { System. out. p r i n t l n ( a e q u a l s b ) ; e l s e { System. out. p r i n t l n ( a does not e q u a l b ) ; Less.java:14: operator < cannot be applied to MyInteger,MyInteger if ( a < b ) { ^ 1 error

Remarks These error messsages are produced by pre-1.5 Java compilers Starting with Java 1.5, autoboxing masks the problem In order to get same behaviour with the two environments, let s use our wrapper, MyInteger

Class MyInteger c l a s s MyInteger { i n t v a l u e ; MyInteger ( i n t v ) { v a l u e = v ;

a 5 i n t a = 5 ; MyInteger b = new MyInteger ( 5 ) ; b i f ( a < b ) { System. out. p r i n t l n ( a < b ) ; e l s e i f ( a == b ) { System. out. p r i n t l n ( a == b ) ; e l s e { System. out. p r i n t l n ( a > b ) ; value 5 Fix this!

Solution i n t a = 5 ; MyInteger b = new MyInteger ( 5 ) ; i f ( a < b. v a l u e ) { System. out. p r i n t l n ( a i s l e s s than b ) ; e l s e i f ( a == b. v a l u e ) { System. out. p r i n t l n ( a e q u a l s b ) ; e l s e { System. out. p r i n t l n ( a i s g r e a t e r than b ) ; Prints a equals b.

Comparison operators and reference types What will happen and why? MyInteger a = new MyInteger ( 5 ) ; MyInteger b = new MyInteger ( 5 ) ; i f ( a == b ) { System. out. p r i n t l n ( a e q u a l s b ) ; e l s e { System. out. p r i n t l n ( a does not e q u a l b ) ; The result is a does not equal b.

a b value 5 MyInteger a = new MyInteger ( 5 ) ; MyInteger b = new MyInteger ( 5 ) ; i f ( a == b ) { System. out. p r i n t l n ( a e q u a l s b ) ; e l s e { System. out. p r i n t l n ( a does not e q u a l s b ) ; value 5 The result is a does not equal b.

a b value 5 MyInteger a = new MyInteger ( 5 ) ; MyInteger b = new MyInteger ( 5 ) ; i f ( a == b ) { System. out. p r i n t l n ( a e q u a l s b ) ; e l s e { System. out. p r i n t l n ( a does not e q u a l s b ) ; value 5 The result is a does not equal b.

Solution MyInteger a = new MyInteger ( 5 ) ; MyInteger b = new MyInteger ( 5 ) ; i f ( a. e q u a l s ( b ) ) { System. out. p r i n t l n ( a e q u a l s b ) ; e l s e { System. out. p r i n t l n ( a does not b ) ; where equals could have been defined as an instance method: p u b l i c boolean e q u a l s ( MyInteger o t h e r ) { r e t u r n s t h i s. v a l u e == o t h e r. v a l u e ; Would print a equals b.

What will happen? MyInteger a = new MyInteger ( 5 ) ; MyInteger b = a ; i f ( a == b ) { System. out. p r i n t l n ( a == b ) ; e l s e { System. out. p r i n t l n ( a!= b ) ; Prints a == b, why? because a and b reference the same object (instance), in other words, the two memory locations are the same; we say that b is an alias for a.

Comparison operators and reference types What will happen? MyInteger a = new MyInteger ( 5 ) ; MyInteger b = a ; i f ( a. e q u a l s ( b ) ) { System. out. p r i n t l n ( a e q u a l s b ) ; e l s e { System. out. p r i n t l n ( a does not e q u a l b ) ; prints a equals b because the two values are equal.

a MyInteger a = new MyInteger ( 5 ) ; MyInteger b = a ; b i f ( a == b ) { System. out. p r i n t l n ( a == b ) ; e l s e { System. out. p r i n t l n ( a!= b ) ; value 5

a MyInteger a = new MyInteger ( 5 ) ; MyInteger b = a ; b i f ( a. e q u a l s ( b ) ) { System. out. p r i n t l n ( a == b ) ; e l s e { System. out. p r i n t l n ( a!= b ) ; value 5

Remarks Two reference variables designate objects that are logically equivalent if these objects have the same content, use the method equals to test for content or logical equality In order to test if two reference variables designate the same object, use the comparison operators == and!= i f ( a. e q u a l s ( b ) ) {... vs i f ( a == b ) {... We will continue the discussion when learning about inheritance!

Exercises Experiment comparing these objects using equals and ==, you might be surprised by the results. S t r i n g a = new S t r i n g ( H e l l o ) ; S t r i n g b = new S t r i n g ( H e l l o ) ; i n t c [ ] = { 1, 2, 3 ; i n t d [ ] = { 1, 2, 3 ; S t r i n g e = H e l l o ; S t r i n g f = H e l l o ; S t r i n g g = f + ; In particular, try a == b and e == f.

Definition: arity The arity of a method is simply the number of parameters; a method may have no parameter, one parameter or many. MyInteger ( ) { t h i s. v a l u e = 0 ; MyInteger ( i n t v ) { t h i s. v a l u e = v ; i n t sum ( i n t a, i n t b ) { r e t u r n a + b ;

Definition: formal parameter A formal parameter is a variable which is part of the definition of the method; it can be seen as a local variable of the body of the method. i n t sum ( i n t a, i n t b ) { r e t u r n a + b ; a and b are formal parameters of sum.

Definition: actual parameter An actual parameter is the variable which is used when the method is called to supply the value for the formal parameter. i n t sum ( i n t a, i n t b ) { r e t u r n a + b ;... i n t midterm, finalexam, t o t a l ; t o t a l = sum ( midterm, f i n a l E x a m ) ; midterm and finalexam are actual parameters of sum, when the method is called the value of the actual parameters is copied to the location of the formal parameters.

Concept: call-by-value In Java, when a method is called, the values of the actual parameters are copied to the location of the formal parameters. When a method is called: the execution of the calling method is stopped an activation frame (activation block or record) is created (it contains the formal parameters as well as the local variables) the value of the actual parameters are copied to the location of the formal parameters the body of the method is executed a return value or (void) is saved (the activation frame is destroyed) the execution of the calling method restarts with the next instruction

p u b l i c c l a s s Test { p u b l i c s t a t i c void i n c r e m e n t ( i n t a ) { a = a + 1 ; p u b l i c s t a t i c void main ( S t r i n g [ ] a r g s ) { i n t a = 5 ; System. out. p r i n t l n ( b e f o r e : + a ) ; i n c r e m e n t ( a ) ; System. out. p r i n t l n ( a f t e r : + a ) ; What will printed? b e f o r e : 5 a f t e r : 5

p u b l i c s t a t i c v o i d i n c r e m e n t ( i n t a ) { a = a + 1 ; p u b l i c s t a t i c v o i d main ( S t r i n g [ ] a r g s ) { > i n t a = 5 ; i n c r e m e n t ( a ) ; args a 5 activation frame for main Each method call has its own activation frame, which holds the parameters and local variables (here, args and a)

p u b l i c s t a t i c v o i d i n c r e m e n t ( i n t a ) { a = a + 1 ; a p u b l i c s t a t i c v o i d main ( S t r i n g [ ] a r g s ) { i n t a = 5 ; > i n c r e m e n t ( a ) ; args a 5 activation frame for increment activation frame for main When increment is called a new activation frame is created

p u b l i c s t a t i c v o i d i n c r e m e n t ( i n t a ) { a = a + 1 ; a 5 p u b l i c s t a t i c v o i d main ( S t r i n g [ ] a r g s ) { i n t a = 5 ; > i n c r e m e n t ( a ) ; args a 5 activation frame for increment activation frame for main The value of the actual parameter is copied to the location of the formal parameter

p u b l i c s t a t i c v o i d i n c r e m e n t ( i n t a ) { > a = a + 1 ; a 6 p u b l i c s t a t i c v o i d main ( S t r i n g [ ] a r g s ) { i n t a = 5 ; i n c r e m e n t ( a ) ; args a 5 activation frame for increment activation frame for main The execution of a = a + 1 changes the content of the formal parameter a, which is a distinct memory location the local variable a of the main method

p u b l i c s t a t i c v o i d i n c r e m e n t ( i n t a ) { a = a + 1 ; p u b l i c s t a t i c v o i d main ( S t r i n g [ ] a r g s ) { i n t a = 5 ; i n c r e m e n t ( a ) ; args > a 5 activation frame for main Control returns to the main method, the activation frame for increment is destroyed

References and method calls c l a s s M yinteger { i n t v a l u e ; MyInteger ( i n t v ) { v a l u e = v ; c l a s s Test { public s t a t i c void increment ( MyInteger a ) { a. v a l u e ++; p u b l i c s t a t i c v o i d main ( S t r i n g [ ] a r g s ) { MyInteger a = new MyInteger ( 5 ) ; System. out. p r i n t l n ( b e f o r e : + a. v a l u e ) ; i n c r e m e n t ( a ) ; System. out. p r i n t l n ( a f t e r : + a. v a l u e ) ; What will be printed out?

s t a t i c v o i d i n c r e m e n t ( M yinteger a ) { a. v a l u e ++; p u b l i c s t a t i c v o i d main ( S t r i n g [ ] a r g s ) { > MyInteger a = new M y Integer ( 5 ) ; i n c r e m e n t ( a ) ; args a value 5 The local variable a of the main method is a reference to an instance of the class MyInteger

s t a t i c v o i d i n c r e m e n t ( M yinteger a ) { a. v a l u e ++; a p u b l i c s t a t i c v o i d main ( S t r i n g [ ] a r g s ) { MyInteger a = new M y Integer ( 5 ) ; > i n c r e m e n t ( a ) ; args a value 5 Calling increment, creating a new activation frame

s t a t i c v o i d i n c r e m e n t ( M yinteger a ) { a. v a l u e ++; a p u b l i c s t a t i c v o i d main ( S t r i n g [ ] a r g s ) { MyInteger a = new M y Integer ( 5 ) ; > i n c r e m e n t ( a ) ; args a value 5 Copying the value of the actual parameter into the formal parameter of increment

s t a t i c v o i d i n c r e m e n t ( M yinteger a ) { > a. v a l u e ++; a p u b l i c s t a t i c v o i d main ( S t r i n g [ ] a r g s ) { MyInteger a = new M y Integer ( 5 ) ; args i n c r e m e n t ( a ) ; a value 6 Executing a.value++

s t a t i c v o i d i n c r e m e n t ( M yinteger a ) { a. v a l u e ++; p u b l i c s t a t i c v o i d main ( S t r i n g [ ] a r g s ) { MyInteger a = new M y Integer ( 5 ) ; i n c r e m e n t ( a ) ; args > a value 6 Returning the control to the main method

Definition: scope The scope of a declaration is the region of the program within which the entity declared by the declaration can be referred to using a simple name The Java Language Specification, Third Edition, Addison Wesley, p. 117.

Definition: scope of a local variable in Java The scope of a local variable declaration in a block is the rest of the block in which the declaration appears, starting with its own initializer and including any further declarators to the right in the local variable declaration statement The Java Language Specification, Third Edition, Addison Wesley, p. 118. A.K.A. static or lexical scope

Definition: scope of a parameter Java The scope of a parameter of a method or constructor is the entire body of the method or constructor The Java Language Specification, Third Edition, Addison Wesley, p. 118. A.K.A. static or lexical scope

p u b l i c c l a s s Test { p u b l i c s t a t i c void d i s p l a y ( ) { System. out. p r i n t l n ( a = + a ) ; p u b l i c s t a t i c void main ( S t r i n g [ ] a r g s ) { i n t a ; a = 9 ; // v a l i d a c c e s s, w i t h i n the same b l o c k i f ( a < 10) { a = a + 1 ; // a n o t h e r v a l i d a c c e s s d i s p l a y ( ) ; Is this a valid program?

p u b l i c c l a s s Test { p u b l i c s t a t i c void main ( S t r i n g [ ] a r g s ) { System. out. p r i n t l n ( sum ) ; f o r ( i n t i =1; i <10; i++ ) { System. out. p r i n t l n ( i ) ; i n t sum = 0 ; f o r ( i n t i =1; i <10; i++ ) { sum += i ; Is this a valid program?

p u b l i c c l a s s Test { p u b l i c s t a t i c void main ( S t r i n g [ ] a r g s ) { f o r ( i n t i =1; i <10; i++ ) { System. out. p r i n t l n ( i ) ; i n t sum = 0 ; f o r ( i n t i =1; i <10; i++ ) { sum += i ; Is this a valid program?

Memory management What happens to objects when they are not referenced? Here what happens to the object that contains the value 99? MyInteger a = new MyInteger ( 7 ) ; MyInteger b = new MyInteger ( 99 ) ; b = a ; The JVM recuperates the memory space This process is called garbage collection Not all programming languages manage memory automatically Java is not immune to memory leaks as will see in a few weeks...

Summary Strong typing help detecting certain kinds of errors early Comparison operators always compare the value of the expressions When comparing references we check that two references designate the same object or not The method equals should be used to compare the content of the objects In Java, call-by-value is the mechanism that is used for method calls The scope of variable and parameter names is static in Java

Next lecture Introduction to object-oriented programming Role of abstractions Activities of software development UML Unified Modeling Language Example: Counter

References I E. B. Koffman and Wolfgang P. A. T. Data Structures: Abstraction and Design Using Java. John Wiley & Sons, 2e edition, 2010. P. Sestoft. Java Precisely. The MIT Press, second edition edition, August 2005. James Gosling, Bill Joy, Guy Steele, and Gilad Bracha. Java Language Specification. Addison Wesley, 3rd edition, 2005.

Please don t print these lecture notes unless you really need to!