| Date | Reading(s) | Slides | Out | In |
| Mon. Jan. 13, Wed. Jan. 15 |
Main Ch. 1,2
| Introduction
Main on Pre and Post Conditions
Basic Big O
Towers
Main on OOP
| Homework 1 Lists
Homework 1 Javadoc
| -- |
| Mon. Jan. 20, Wed. Jan. 22 |
Main Ch. 4
Big Theta Video
| Big O
Linked Lists
Ch.4
|
| -- |
| Mon. Jan. 27, Wed. Jan. 29 |
Main Ch. 6,7
N Queens on U-Tube
| Stacks/Queues
Main Ch.6,7
Trees
Main Ch.9 Binary Search Trees
Lecture - On Silverlight
|
Queues and Red Black Trees Homework 2
Red Black Tree Project
shortwords.txt
words.txt
badwords.txt
| Homework 1 |
| Mon. Feb. 3, Wed. Feb. 5 |
Main Ch. 9,10
Red Black Tree Video
B-Tree Video
B+ Tree Video
| Heaps and B-Trees
Main on Heaps Ch.10
Notes on 2-3 Trees
Red Black Trees
|
| -- |
| Mon. Feb. 10, Wed. Feb. 12 |
Main Ch. 11,14
Cool Graph Applets
Floyd Warshall at Wikipedia
| Graphs I
Graphs II
| Homework 3 (Red Black Trees Part 2)
Stack (.html)
RPNCalc (.html)
RPN parser (.java)
| -- |
| Mon. Feb. 17, Wed. Feb. 19 |
Main Ch. 11,14
| Graphs III
|
| -- |
| Mon. Feb. 24, Wed. Feb. 26 |
Main Ch. 6,7,12
| Searching I
Main on Searching Using Hash Tables Ch.11
|
| -- |
| Mon. Mar. 3, Wed. Mar. 5 Midterm exam |
Old Midterm exam - Spring 2011 topics may differ.
Page 1
Page 2
Page 3
Page 4
Page 5
Page 6
Page 7
Page 8
Page 9
Page 10
Page 11
Page 12
Old Midterm Fall 2011
Midterm Spring 2012
Midterm Fall 2013
Midterm Spring 2014
| Old Review for midterm
|
| -- |
| Mon. Mar. 17, Wed. Mar. 19 |
Digital Search Tree and Radix Trie
Sorting demonstrations
| Searching II
Lecture Notes
Main Ch.12
Sorting I
| Traveling Sales Person Problem Homework 4
Crime Data X Y Lat Lon Pittsburgh 1990
| -- |
| Mon. Mar. 24, Wed. Mar. 26 |
| Data Compression Huffman
Huffman explained
Data Compression LZW
|
| -- |
| Mon. Mar. 31, Wed. Apr. 2 |
Main Chapter 12
Radix sort
| Sorting II
Radix Sort
Slide Edits
Lecture Notes
|
| -- |
| Mon. Apr. 7, Wed. Apr. 9 |
Finite State Machines
Pushdown Automata
Linear Bound Automata
Turing Machines
Google Doodle Turing Machines
| Finite State Machines I
Finite State Machines II
|
| -- |
| Mon. Apr. 14, Wed. Apr. 16 |
The Chomsky hierarchy
P versus NP problems
| Finite State Machines III
NP-Complete Languages
|
| -- |
| Mon. Apr. 21, Wed. Apr. 23 |
| Review for Final
Example Final Exam Question
|
| -- |
| Mon. Apr. 28, Wed. Apr. 30 |
| Recursion
|
| Project 6 due Wednesday |
| Week of April 5 is Final Exam Week. See Heinz final exam schedule for time and date and location. |
|
|
| -- |