Week

Topics

Homework

1

• Syllabus and Introduction.
• Pointers.
• Pointers and Arrays.

2

• Pointers and Classes.
• Abstract Data Types.
• ADT List.
• DS ArrayList.

Homework #1 due.

3

• NO CLASSES: Labor day
• DS Linked-List
• DS Double-Linked-Lists;

Homework #2 due.

4

• Big-O notation
• Algorithm Complexity

Homework #3 due.

5

• Data Structure analysis
• Review for Test #1
• TEST #1 (Sept.20)

6

• Inheritance.
• Polymorphism.

Homework #4 due.

7

• ADT Stacks.
• ADT Queues.
• Exception Handling.

Homework #5 due.

8

• Recursion
• Recursive Algorithms
• Backtracking

Homework #6 due.

9

• Backtracking.
• ADT Tree.
• Tree Traversals.

Homework #7 due.

10

• ADT Binary Search Tree
• DS BSTree
• DS ArrayTree
• Review for Test #2
• TEST #2 (Oct.25)

11

• AVL Trees.
• Splay Trees.
• B-Trees.

Homework #8 due.

12

• ADT Priority Queue.
• DS Hash Table.
• ADT Map

Homework #9 due.

13

• Graph Theory.
• ADT Graph.
• Graph Implementations.

Homework #10 due.

14

• Graph Algorithms.
• Review for Test #3.
• TEST #3 (Nov.22)

15

• NO CLASSES: Thanksgiving Break

16

• STL
• Review for Final Exam

Homework #11 due.

17

• FINAL EXAM