Augmenting Data Structures

Lecture Description

Course Description

Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

Course Index

1. Course Overview
2. Using Objects
3. Defining Classes
4. Types and Conditionals
5. Iteration and Arrays I
6. Iteration and Arrays II
7. Linked Lists I
8. Linked Lists II
9. Stack Frames
10. Testing
11. Inheritances
12. Abstract Classes
13. Java Packages
14. Exceptions
15. More Java
16. Game Trees
17. Encapsulation
18. Encapsulated Lists
19. Asymptotic Analysis
20. Algorithm Analysis
21. Hash Tables
22. Stacks and Queues
23. Trees and Traversals
24. Priority Queues
25. Binary Search Trees
26. Balanced Search Trees
27. Graphs
28. Weighted Graphs
29. Sorting I
30. Sorting II
31. Disjoint Sets
32. Sorting III
33. Sorting V
34. Splay Trees
35. Amortized Analysis
36. Randomized Analysis
37. Expression Parsing
38. Garbage Collection
39. Augmenting Data Structures