Class Notes for Gries

CORNELLCS 2110GriesSpring

CS 2110 Lecture Notes - Lecture 5: Local Variable

OC14109505 Page
16 Mar 2017
0
Local variables belong inside some block of code. Like in an if statement or method. Suppose in some block of code we want to swap the values of b and
View Document
CORNELLCS 2110GriesSpring

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

OC14109504 Page
16 Mar 2017
0
Whe(cid:374) usi(cid:374)g a gui, a shape"s positio(cid:374) is gi(cid:448)e(cid:374) (cid:271)y the top left (cid:272)or(cid:374)er of the box it can
View Document
CORNELLCS 2110GriesSpring

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

OC14109505 Page
16 Mar 2017
0
View Document
CORNELLCS 2110GriesSpring

CS 2110 Lecture Notes - Lecture 3: Junit, Precondition, Class Invariant

OC14109507 Page
15 Mar 2017
0
We"(cid:448)e see(cid:374) pu(cid:271)li(cid:272) (cid:272)lasses, (cid:271)ut there is o much more. We"(cid:448)e see(cid:374) t(cid:449)o t(cid:455)p
View Document
CORNELLCS 2110GriesSpring

CS 2110 Lecture Notes - Lecture 1: Natural Number, Strong And Weak Typing

OC14109502 Page
14 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 11: Sorting Algorithm, Insertion Sort, Postcondition

OC10149583 Page
14 Jun 2017
0
Invariant: [0, i-1] sorted and [i, b. length()] unsorted. Each iteration pushes value of b[i] to sorted position and i = i+1 for (int i = 0; i<b. lengt
View Document
CORNELLCS 2110GriesSpring

CS 2110 Lecture Notes - Lecture 18: Directed Acyclic Graph, List Of Algorithms, Topological Sorting

OC10149584 Page
14 Jun 2017
0
Lecture 18 - graphs: we are not talking about graphs like bar graphs, circle graphs, we are talking about shit like the brain, like correspondence betw
View Document
CORNELLCS 2110GriesSpring

CS 2110 Lecture Notes - Lecture 13: Reverse Polish Notation, Tree Traversal, Infix Notation

OC10149584 Page
14 Jun 2017
0
Lecture 13 - more trees: from last time we saw how to construct a syntax tree for some basic mathematical expressions. Tree: left off on tree traversal
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 10: Linear Search, Binary Search Algorithm

OC10149583 Page
14 Jun 2017
0
View Document

Class Notes (1,200,000)
US (500,000)
Cornell (1,000)
CS (100)
CS 2110 (30)
Gries (30)