Week:

Discussion:

Due Saturday at midnight:

1

Max-Sub-Sequence Teaser, Goals of course, roll, syllabus, Exponents and Logs, TOH Teaser, Linear Search, Binary Search, Card Shuffling, Assignment 1, CreateRandomList(), Bubble Sort, Shaker Sort, Counting Sort.

2

Traveling Salesman Teaser, Assignment 2 introduction, Merge Sort, Quick Sort, Modified Quick Sort. Seating chart, Going the Second Mile.

Sorting 1

3

SAT Teaser, checking grades, Assignment 3 introduction, counting compares, random versus mostly sorted data, organizing your code, producing charts, reading log/log charts.

Sorting 2

4

Assignment 4. Insert. Abstract Data Types (ADTs).

Sorting 3

5

Assignment 5. Traverse/Delete/Retrieve

Insert

6

Multiplying and Factoring Teasers, Big-O definition and meaning. More categories, NP problems, NP Complete problems, million-dollar problems, unsolvable problems, RSA Encryption, "You'd be dead." Test 1 pre-review.

Traverse/Delete/Retrieve

7

Test 1. Linked Lists.

Test 1

8

Graphics calculator, InfixToPostfix, EvaluatePostfix, Graph Drawing, Stack class, Cool Polar Coordinates,

Linked Lists

9

BST. Overriding operators, Is versus ==. Recursion review.

Graphing Calculator

10

General Trees, 2-3 trees, 234 trees, 100 trees, Speed Comparisons. Traversal orders,

Extra Credit Exponent Quiz Program

11

Test 2 pre-review. Hash introduction, IsPrime, HashFunction, Collisions

BST

12

Other collision handling strategies, odds of collision, Hashing Names, Resizing. Time Predictions

Test 2

13

Graphs. Definitions, storage options, searching

Hash

14

Final Review. Maze Solver. 8 Puzzle.

Graphs

15

Heaps, Dijkstra's algorithm. Keeping it N*LogN.

Extra Credit Speed Test

Finals Week

Test Final