1
SHORTEST PATHS
READINGS? CHAPTER 28
Lecture 20
CS2110 Spring 2016
About A6
2
We give you class ArrayHeaps for a reason:
It shows the simplest way to write methods like
bubble-up and bubble-down. It gives you a method
to get the smaller child.
You can wr
Lecture 20
Subclasses &
Inheritance
Announcements for Today
Reading
Assignments
Today: Chapter 18
Online reading for Thursday
A4 graded by end of week
Prelim, Nov 12th 7:30-9:00
A5 was posted Friday
Material up to Thursday
Review posted on Thursday
Lecture 19
Using Classes Effectively
Announcements
Reading
Regrades
Tuesday: Chapter 18
Thursday reading online
Today is last day to request
Show it to me after class
I will verify if it is valid
Then request regrade in CMS
Assignments
Prelim, Nov
Lecture 17
Classes
Announcements for This Lecture
Prelim and Regrades
All Prelims are all done
Assignments/Reading
Should be working on A4
Solutions are now posted
Tasks 1-2 by tomorrow
Make-ups graded too
Task 3 by the weekend
Recursion next week
Lecture 18
Methods and Operations
Announcements for This Lecture
Assignments
Lab this Week
A4 Due Thursday at midnight
Hopefully you are on Task 4
Extra consultants available
Simple class exercise
Fill in predefined methods
Setting you up for A6
Wi
Lecture 13
For-Loops
Announcements for This Lecture
Reading
Assignments
A2 has been graded
Today: Chapters 8, 10
Thursday: Chapter 11
Prelim, Oct 15th 7:30-9:00
Material up to TODAY
Study guide is posted
A3 is due on FRIDAY
Review next Wednesday
Lecture 16
More Recursion
Announcements for This Lecture
Prelim 1
Prelim 1 back today!
Assignments and Labs
Need to be working on A4
Pick up in Lab Section
Solution posted in CMS
Mean: 80, Median: 83
What are letter grades?
10/20/15
A bit too early
Lecture 15
Recursion
Announcements for Today
Prelim 1
Tonight at 7:30-9pm
AJ (Uris G01)
Other Announcements
Reading: 5.8 5.10
Assignment 3 now graded
Mean 94, Median 99
Time: 7 hrs, StdDev: 3 hrs
Unchanged from last year
K-Z (Statler Auditorium)
Lecture 14
More with Sequences
Announcements for This Lecture
Readings
Assignments
A3 is due tomorrow
Today: Chapter 11
Next Week: Sec. 5.8-5.10
Turn in before you leave
Prelim, Oct 15th 7:30-9:00
Opportunities for help
Consultants 4:30-9:30
Wil h
Lecture 11
Asserts and
Error Handling
Announcements for Today
Reading
Assignments
Reread Chapter 3
10.0-10.2, 10.4-10.6 for Thu
Assignment 1 now complete
Prelim, Oct 15th 7:30-9:30
Material up October 6th
Study guide next week
Conflict with Prelim
Lecture 21
Programming
with Subclasses
Announcements for Today
Reading
Assignments
Today: See reading online
Tuesday: Chapter 7
Prelim, Nov 12th 7:30-9:00
Material up to Today
Review has been posted
Recursion + Loops + Classes
S/U Students are exem
PRIORITY QUEUES
AND HEAPS
Lecture 17
CS2110 Spring 2016
Readings and Homework
2
Read Chapter 26 A Heap Implementation to learn
about heaps
Exercise: Salespeople often make matrices that show
all the great features of their product that the
competitors pro
Searching and Sorting
Hint at Asymptotic
Complexity
Lecture 10
CS2110 Spring 2016
Miscellaneous
2
A3 due Monday night. Group early! Only
379 views of the piazza A3 FAQ. Everyone
should look at it.
Pinned Piazza note on Supplemental study
material. @472. C
Graphs - I
CS 2110, Spring 2016
Announcements
Reading:
Chapter 28: Graphs
Chapter 29: Graph Implementations
These arent the graphs were interested in
These arent the graphs were interested in
This is
V.J. Wedeen and L.L. Wald, Martinos Center for Biome
CS2110.
GUIS: Listening to
Events
Also
anonymous classes
A3 is now open for regrades.
Until 4 April
Download the demo zip file
from course website and
look at the demos of GUI
things: sliders, scroll
bars, combobox listener,
1
Making use of the recursive
Graphs - II
CS 2110, Spring 2016
1
Where did David leave that book?
2
http:/www.geahvet.com
Where did David leave that book?
3
http:/www.geahvet.com
Where did David leave that book?
Go as far down a path as
possible before backtracking
Depth-First Search
1
Spanning Trees
Lecture 21
CS2110 Spring 2016
Spanning trees
2
What we do today:
Calculating the shortest path in Dijkstras
algorithm
Look at time complexity of shortest path
Definitions
Minimum spanning trees
3 greedy algorithms (including Kruskal & Pri
RECURSION
Lecture 8
CS2110 Fall 2016
Overview references to sections in text
2
Note: Weve covered everything in
JavaSummary.pptx!
What is recursion? 7.1-7.39 slide 1-7
Base case 7.1-7.10 slide 13
How Java stack frames work 7.8-7.10 slide 28-32
Flipping th
Lecture 12
Lists (& Sequences)
Announcements for Today
Reading
Assignments
Read 10.0-10.2, 10.4-10.6
Read all of Chapter 8 for Tue
Prelim, Oct 15th 7:30-9:30
Material up to October 6th
Study guide next week
Conflict with Prelim time?
Submit to Prel
Lecture 1
Course Overview,
Python Basics
We Are Very Full!
Lectures and Labs are at fire-code capacity
We cannot add sections or seats to lectures
You may have to wait until someone drops
No auditors are allowed this semester
All students must do ass
9/4/14
1
Firs
t sh
CS/ENGRD 2110
SPRING 2014
ow
is
tu
laa
toni
ght
at 7
pm!
ada
bar
to
nik
K
Lecture 4: The class hierarchy; static components
http:/courses.cs.cornell.edu/cs2110
2
Announcements
4
A0 will be graded soon everyone who submitted it gets fu
9/10/14
1
About prelim 1
2
CS/ENGRD 2110
FALL 2014
October 2:5:30PM and at 7:30PM. We will tell you which to attend.
Problems with that one? You go to the other one.
Students with conflicts -having two prelims at 7:30 at that evening
Takeoursat 5:30 OR(
9/18/14
About A2 and feedback. Recursion
2
S2 has been graded. If you got 30/30, you will probably have
no feedback.
If you got less than full credit, there should be feedback showing
you which function(s) is incorrect.
If you dont see feedback, ask for a
8/25/14
Welcome to CS2110!
2
Learning about:
OO, abstract data types, generics, Java Collections,
Reasoning about complex problems, analyzing algorithms we
create to solve them, and implementing algorithms with
elegant, easy-to-understand, correct co
9/23/14
Last lecture: binary search
2
0
We will not cover
all this material
b.length
?
pre: b
0
inv: b
h
t
<= v
?
h= 1; t= b.length;
while (h != t1) cfw_
int e= (h+t)/2;
if (b[e] <= v) h= e;
else t= e;
SEARCHING AND SORTING
HINT AT ASYMPTOTIC COMPLEXITY
9/2/14
1
Big Red Sports Network (BRSN) is Cornells only student-run
Broadcast Media, and Journalism organizaAon dedicated enArely to
Sports, with strong parternships with Cornell AthleAcs, WVBR FM
93.5, and the Ithaca