Lectures
CS2110 has twiceweekly lectures. Attendance is required.
Lecture notes are usually posted the day/evening before the lecture. Please download the lecture notes the evening before a lecture, peruse them to get a sense of what the lecture is about, and have the lecture notes handy during the lecture (either on paper or on your laptop/tablet/phone). During the lecture, we use not only the ppt slides but also Eclipse, DrJava, and the web, and when we are not using the ppt slides it will be useful for you to have them to look at.
Recitations
It is important to attend a weekly recitation, which are considered to be part of the required classwork for the course. We often present material in recitation that is required but not covered in the main lectures. You can switch from recitation to recitation but we like to know which one you are in, in case the University needs to contact you. We added some recitations at a late date; please switch to them if you can to balance out the number of students in each recitation. Use add/drop if you switch sections.
Weekly recitation notes will be posted below as we finalize them.
CS2111
This 1credit S/U optional enrichment class is offered for people who are concerned that CS2110 might move too quickly and would like a bit of additional help understanding the key ideas. Students taking CS2111 must ALSO attend the main lectures and a recitation section. You must be enrolled in ENGRD/CS2110 in oder to take CS2111.
Weekly PDF files for the materials covered in CS2111 are posted on the course CS2111 website get to it from a link on the Links page.
Course text
You don't have to buy a book! We have produced online materials for most of the course: JavaHyperText and Data Structures. Part of this "book" consists of over 50 short (26 minute) tutorial/videos, which you will look at at the appropriate time.
Lecture schedule
Below is a tentative list of lecture topics, times for handing out assignments, deadlines for submitting assignments, and times for the prelims and prelim review sessions. The order and content of lectures may be changed as the course progresses.
LECTURE / Day 
TOPICS  NOTES  READING / ASSIGNMENTS  

1  08/23  Course
policies/procedures. Java strong typing. 
Lecture
notes (pptx)
(pdf)
(pdf6up) Why software is so bad First day handout Eclipse tutorial 
Hand out A0 
2  08/28 
OO: Objects and classes 
Lecture notes (ppt) (pdf) (pdf6up) C.java  Hand out HW1 
Recitation 01: Packages, API Specs, String: tutorial to watch beforehand  
3  08/30 
OO: Fields and their conse quences. JUnit testing 
Lecture Notes
(ppt)
(pdf)
(pdf6up) demoTime.zip 
A0 due Hand out A1 
4  09/04 
OO: The class hierarchy Static components 
Lecture notes (ppt) (pdf) (pdf6up)  Hand out A2 
Recitation 02: Exception handling. Watch tutorial beforehand. Problem set: E.java  
5  09/06 
OO: Insideout / bottomup, local vars, constructors 
Lecture Notes
(ppt)
(pdf)
(pdf6up) demos.zip 
A1 due 
6  09/11 
OO: Types and their conse quences. function equals 
Lecture notes
(pptx)
(pdf)
(pdf6up)
(pdf6up) demoLecture6.zip pollslide.pdf 

Recitation 03: Testing (pdf6up) Rectangle.java TODO.txt  
7  09/13  Interfaces and abstract classes 
Watch tutorial before lecture. Lecture notes (pptx) (pdf) (pdf6up) TimeSet.zip 
A2 due 
8  09/18 
Recursion 1 
Lecture notes (pptx) (pdf) (pdf6up) recursionDemo.zip  Hand out A3 
Recitation 04: Loop invariants. Watch tutorial beforehand loop invariants problemset (docx) (pdf) (solutions) 

9  09/20 
Recursion 2 
Lecture notes
(pptx)
(pdf )
(pdf6up) recursionDemo.zip Iterative palindrome (ppt) (pdf) 

Review for Prelim 1, Sunday 09/23, 13PM  
10  09/25 
Complexity  Lecture Notes (pptx) (pdf) (pdf6up)  
Recitation 05: Review for prelim 1 (pptx) (pdf) (pdf6up)  
11  09/27 
Sorting 
Lecture notes (pptx)
(pdf)
(pdf6up) searchSortAlgorithms.zip 
PRELIM 1, 5:30 7:30 
12  10/02 
Trees  Lectures notes (pptx)
(pdf)
(pdf6up) TreeDemo.zip 

Recitation 06. Enums and Java Collections classes (pptx) (pdf) (pdf6up)  
13  10/04 
Priority queues / heaps  Lecture notes (pptx) (pdf) (pdf6up)  Hand out A4 A3 due 
10/09  Fall Break 

Fall Break  
14  10/11 
Grammars, syntax trees 
Lecture notes (pptx) (pdf) (pdf6up) (The slides on parsing are out of scope of 2110. demoExpressionTrees.zip 

15  10/16 
GUIs: Placing components  Lecture notes
(pptx) (pdf) (pdf6up) demoGui.zip 
Hand out A5 Swing Tutorial 
Recitation 07: Iterator, Iterable.
Watch tutorial beforehand iterableProblemSet.pdf DLTest.java 

16  10/18  GUIs: handling events  Lecture notes (pptx) (pdf) (pdf6up) demoGui.zip 
A4 due 
17  10/23 
Graphs I: Topological sort, Coloring, Planar graphs, Bipartite graphs 
Lecture Notes (pptx) (pdf) (pdf6up)  
Recitation 08. I/O (pptx) (pdf) (pdf6up) iodemo.zip IOProblems.java  
18  10/25  Graphs II: DFS and BFS  Lecture Notes (pptx) (pdf) (pdf6up)
dfsBfsDemo.zip 
A5 due 
19  10/30  Graphs III: Dijkstra's shortestpath algorithm 
Watch tutorial before lecture. Lecture notes (pptx) (pdf) (pdf6up) Do this before the lecture: tutorial on shortest path 
Hand out A6 
Recitation 09: Analysis of Algorithms (pptx)  
20  11/01  Graphs IV. Spanning trees  Lecture notes (pptx) (pdf) (pdf6up)  
21  11/06  Hashing 
Lecture notes (pptx) (pdf) (pdf6up)  A6 due 
Recitation 10. Anonymous functions (pptx)  
22  11/08 
Generics  Lecture notes (pptx) (pdf) (pdf6up)  
Review for Prelim 2, Sunday 11/11, 13PM  
23  11/13  Concurrency 
Lecture notes
(pptx)
(pdf)
(pdf6up) 

Recitation 11. Prelim Review  
24  11/15 
Concurrency  Lecture notes
(pptx)
(pdf)
(pdf6up) boundedBuffer.zip ConcurrentLinkedQueue.java 
PRELIM 2, 5:30 7:30 
25  11/20  Debugging  Lecture notes (pptx) (pdf) (pdf6up)  
Recitation 12: Choose your own adventure  
11/22  Thanksgiving Break  
26  11/27  The Science of Computers  Lecture notes  
Recitation 13: A7 Help  
27  11/29  Fibonnacci  Lecture notes (pptx) (pdf) (pdf6up)  
27  12/04  Conclusions!  Lecture notes  
No Reciations this week  
Optional Final: Mon, 10 Dec, 9:0011:30AM. Place: Barton East 