CS 61B: Data Structures
CS 61B: Data Structures - Spring 2006. 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. Lectures available as streaming video at webcast.berkeley.edu/courses.
-
Java Library List Classes
-
Tree representation, searching
-
Balanced Search Structures I
-
Backtracking search, game trees
-
Garbage Collection
-
GUI Interfaces
-
Course Summary
-
Storage Management
-
Dynamic Programming
-
Algorithms (con't)
-
Graphs, more Algorithms
-
Backtracking search, game trees
-
Search and Game Trees (con't), Enumeration Types
-
Graphs, Introduction
-
Probabilistic Balancing
-
Searching Trees (con't)
-
Threads, Concurrency
-
Pseudo-Random Sequences
-
Balanced Search Structures 2
-
Balanced Search Structures
CS 61B: Data Structures
