Hashing

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. Developing a Simple Program
2. More on Simple Programs
3. Values and Containers
4. Simple Pointer Manipulation
5. Arrays and Objects
6. Object-Oriented Mechanisms
7. Interfaces and Abstract Classes
8. Abstract Methods and Classes, Continued
9. Examples of Interfaces
10. Misc. Support for Abstraction; Exceptions
11. Misc. Support for Abstraction, Continued
12. Numbers
13. Algorithmic Analysis I
14. Algorithmic Analysis II
15. Collections Overview
16. Paradox of Voting
17. Resource Curse
18. Getting a View - Sublists
19. Data Structures Exam Review
20. Trees
21. Trees, Searching
22. Generic Programming
23. Priority Queues, Range Queries
24. Hashing
25. Sorting
26. Sorting, Continued
27. Balanced Search Structures
28. Balanced Search Structures, Continued
29. Pseudo-Random Sequences
30. Backtracking Search, Game Trees
31. Enumeration Types, Threads, and Concurrency
32. Threads and Concurrency, Continued
33. Graphs, Introduction
34. Graphs, Minimal Spanning Trees, Union-find
35. Graphs, Continued
36. Dynamic Programming
37. Storage Management
38. Storage Management, Continued, Reflection
39. Data Structures Course Summary