Exams are coming!
Get ready with premium notes and study guides!

Class Notes for CS 2110 at Cornell University

CORNELLCS 2110GriesSpring

CS 2110 Lecture Notes - Lecture 3: Junit, Precondition

OC10149585 Page
14 Jun 2017
0
Lecture 3 - more objects and stuff: we"ve seen public classes, but there is so much more, we"ve seen two types of methods for classes. Functions: now w
View Document
CORNELLCS 2110GriesSpring

CS 2110 Lecture Notes - Lecture 4: Local Variable, Class Variable

OC10149583 Page
14 Jun 2017
0
Lecture 4 - class hierarchy: review - big ideas. Type: a set of values and operations on them (l1) (int: +, -, *, /, %, etc. ) Classes define new types
View Document
CORNELLCS 2110GriesSpring

CS 2110 Lecture 2: Lecture 2 - Objects

OC10149582 Page
14 Jun 2017
0
Lecture 2 - objects: like in python, parameter is the variable inside a method. Argument is when you call the method: creating a new object new javax.
View Document
CORNELLCS 2110GriesSpring

CS 2110 Lecture Notes - Lecture 8: Palindrome, Exponentiation, Circular Definition

OC14109504 Page
16 Mar 2017
0
View Document
CORNELLCS 2110GriesSpring

CS 2110 Lecture 2: Objects

OC14109504 Page
14 Mar 2017
0
Like in python, parameter is the variable inside a method. Argument is when you call the method. Value of this expression is a pointer to the new objec
View Document
CORNELLCS 2110GriesSpring

CS 2110 Lecture Notes - Lecture 12: Binary Tree, Binary Search Algorithm, If And Only If

OC10149585 Page
14 Jun 2017
0
Lecture 12 - trees: tree overview. Tree: data structure with nodes, similar to a linked list. Each node may have zero or more successors (children) Eac
View Document
CORNELLCS 2110GriesSpring

CS 2110 Lecture Notes - Lecture 16: Priority Queue, Binary Tree, Southwest Ohio Regional Transit Authority

OC10149584 Page
14 Jun 2017
0
Lecture 16 - heaps: abstract data structures vs concrete data structures. Adding to anywhere takes time proportional to length of list. Adv. getting so
View Document
CORNELLCS 2110GriesSpring

CS 2110 Lecture Notes - Lecture 8: Circular Definition, Exponentiation, Palindrome

OC10149582 Page
14 Jun 2017
0
Lecture 8 - recursion: circular definition: a definition that is circular, recursion in real life: Family trees - great great great great great grandmo
View Document
CORNELLCS 2110GriesSpring

CS 2110 Lecture Notes - Lecture 5: Local Variable

OC10149583 Page
14 Jun 2017
0
Lecture 5 - scope and inheritance: fields belong to classes, local variables belong inside some block of code. Like in an if statement or method: param
View Document
CORNELLCS 2110GriesSpring

CS 2110 Lecture Notes - Lecture 7: Abstract Data Type, Abstract Type

OC10149583 Page
14 Jun 2017
0
Lecture 7 - abstract and interfaces: a little geometry! When using a gui, a shape"s position is given by the top left corner of the box it can be inscr
View Document
CORNELLCS 2110GriesSpring

CS 2110 Lecture Notes - Lecture 9: Pariah Dog, Popping

OC14109507 Page
16 Mar 2017
0
A. equals(b) compares the two objects using the equals method. Executing recursive methods: push frame for call onto stack, assign arg values to pars,
View Document
CORNELLCS 2110GriesSpring

CS 2110 Lecture 6: Types and Their consequences, instanceof

OC14109504 Page
16 Mar 2017
0
Lecture 6 - types and their consequences, instanceof. Given a method/class/anything inside some other class/method/anything, the outer thing has access
View Document
View all professors (1+)

Class Notes (1,100,000)
US (480,000)
Cornell (1,000)
CS (100)
CS 2110 (30)