CS 61B: Data Structures and Advanced Programming
This is a collection of links to audio/video lectures of CS 61B: Data Structures and Advanced Programming from UC Berkeley Webcasts. 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.
 |
| Video/text | CS 61B - Data Structures and Advanced Programming (Spring 2015) |
| Instructor: Professor Joshua A. Hug. Arrays and Lists. Java Loose Ends. Asymptotics. Disjoint Sets. Binary Search Trees. Balanced Search Trees. Hashing. Trees. Sorting. Quicksort. Graphs. Graph Traversals. ... |
| Video/text | CS 61B - Data Structures and Advanced Programming (Fall 2014) |
| Instructor: Professor Paul Hilfinger. Developing a Simple Program. Values and Containers. Pointer Manipulation. Arrays. Object-Based Programming. Object-Oriented Mechanisms. Interfaces and Abstract Classes. ... |
| Video/text | CS 61B - Data Structures and Advanced Programming (Spring 2014) |
| Instructor: Professor Jonathan Shewchuk. Defining Classes. Iteration & Arrays. Linked lists. Stack Frames. Inheritance. Abstract Classes. Game Trees. Asymptotic Analysis. Algorithm Analysis. Binary Search Trees. ... |
| Video/text | CS 61B - Data Structures and Advanced Programming (Fall 2013) |
| Instructor: Professor Paul Hilfinger. Object-Based Programming. Object-Oriented Mechanisms. Interfaces and Abstract Classes. Numbers. Algorithmic Analysis. Collections. Sequence Implementation. ... |
| Video/text | CS 61B - Data Structures and Advanced Programming (Fall 2012) |
| Instructor: Professor Paul Hilfinger. Numbers. Algorithmic Analysis. Sequence Implementation. Trees. Backtracking Search. Game Trees. Hashing. Sorting. Balanced Search Structures. Pseudo-Random Sequences. Graphs. ... |
| Video/text | CS 61B - Data Structures and Advanced Programming (Fall 2011) |
| Instructor: Professor Paul Hilfinger. Developing a Simple Program. Values and Containers. Pointer Manipulation. Arrays. Object-Based Programming. Object-Oriented Mechanisms. Interfaces and Abstract Classes. ... |
| Video | CS 61B - Data Structures and Advanced Programming (Fall 2006) |
| Instructor: Jonathan Shewchuk. 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. ... |