CS 61B: Data Structures and Advanced Programming
CS 61B: Data Structures and Advanced Programming (Fall 2012, UC Berkeley). Taught by Professor Paul Hilfinger, this course discusses data structures and advanced programming. 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.
| Lecture 24 - Priority Queues, Range Queries |
|
Go to the Course Home or watch other lectures:
| Lecture 01 - Course Introduction |
| Lecture 02 - Developing a Simple Program |
| Lecture 03 - More on Simple Programs |
| Lecture 04 - Values and Containers |
| Lecture 05 - Pointer Manipulation |
| Lecture 06 - Arrays |
| Lecture 07 - Arrays (cont.), Object-Based Programming |
| Lecture 08 - Object-Based Programming (cont.), Object-Oriented Mechanisms |
| Lecture 09 - Object-Oriented Mechanisms (cont.), Interfaces and Abstract Classes |
| Lecture 10 - Interfaces and Abstract Classes (cont.) |
| Lecture 11 - Examples of Interfaces |
| Lecture 12 - Exceptions |
| Lecture 13 - Misc. Support for Abstraction |
| Lecture 14 - Numbers |
| Lecture 15 - Algorithmic Analysis I |
| Lecture 16 - Algorithmic Analysis II |
| Lecture 17 - Collections Overview, Sequence Implementation |
| Lecture 18 - Sequence Implementation (cont.) |
| Lecture 19 |
| Lecture 20 - Sequence Implementation (cont.), Trees |
| Lecture 21 - Trees (cont.) |
| Lecture 22 - Trees (cont.), Backtracking Search, Game Trees |
| Lecture 23 - Backtracking Search, Game Trees (cont.), Generic Programming |
| Lecture 24 - Priority Queues, Range Queries |
| Lecture 25 - Hashing |
| Lecture 26 - Sorting |
| Lecture 27 - Sorting (cont.) |
| Lecture 28 - Balanced Search Structures |
| Lecture 29 - Balanced Search Structures (cont.) |
| Lecture 30 - Pseudo-Random Sequences |
| Lecture 31 - Graphs, Introduction |
| Lecture 32 - Graphs: Minimal Spanning Trees |
| Lecture 33 - Graphs: Union-Find, Dynamic Programming |
| Lecture 34 - Enumeration types, Threads and Concurrency |
| Lecture 35 - Enumeration types, Threads and Concurrency (cont.) |
| Lecture 36 - Storage Management |
| Lecture 37 - Assorted Topics |
| Lecture 38 - Course Summary |