Text: Mark Allen Weiss, Data Structures & Problem Solving Using Java, 4th Ed.; Amazon via GRACS; textbooks.com.
If things were always this simple, programmers would be unemployed.
Fortunately for our careers, there are a host of complications.
-- Weiss, p. 663.
Assigned Reading:
Sections: | Topic: |
1 | Basic Java |
5 - 5.2 | Intro to Big O |
2 - 2.4 | Pointers and Reference Types |
17.1 | Linked List |
7 - 7.3.4 | Recursion |
17.3, 17.4 | Doubly Linked, Circularly Linked, Sorted List |
11 - 11.1 | Stack and Balanced Symbol Checker |
6 - 6.6 | Java Collections API, Stack, Queue |
16 | Stacks and Queues |
18 - 18.3 | Trees |
19 - 19.1, 19.3 | Binary Search Trees |
18.4 | Tree Traversal Order |
19.4 | AVL Trees |
19.8 | B Trees |
20 - 20.3.1 | Hashing |
20.5 - 20.7 | Separate Chaining (Hash with Buckets) |
6.9 | Priority Queue |
21 - 21.2 | Heap |
13.2 | optional: Discrete Event Simulation |
8 - 8.3 | Sorting, Insertion Sort |
8.5 - 8.8 | Mergesort, Quicksort |
14 | Graphs, Dijkstra's Algorithm |