CS 61B: Data Structures and Advanced Programming
CS 61B: Data Structures and Advanced Programming (Spring 2015, UC Berkeley). Instructor: Professor Joshua A. Hug. 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.
Go to the Course Home or watch other lectures:
| Lecture 01 - Introduction, Hello World Java |
| Lecture 02 - Defining and Using Classes |
| Lecture 03 - References, Linked Lists |
| Lecture 04 - Testing |
| Lecture 05 - Binary and Bits, A 61C Preview |
| Lecture 06 |
| Lecture 07 - Arrays, For Loops |
| Lecture 08 - Arrays and Lists |
| Lecture 09 |
| Lecture 10 - Interfaces, Abstract Classes |
| Lecture 11 - Higher-Order Functions, Callbacks, Comparators/Comparables |
| Lecture 12 - Midterm 1 Review |
| Lecture 13 - Environment Variables, Packages, Java Libraries |
| Lecture 14 - Generics, Conversion, Promotion |
| Lecture 15 - Exceptions, Iterator and Iterable |
| Lecture 16 - Java Loose Ends |
| Lecture 17 - Encapsulation, Delegation vs. Extension |
| Lecture 18 - Asymptotics I |
| Lecture 19 - Disjoint Sets |
| Lecture 20 - Asymptotics II: Analysis of Algorithms |
| Lecture 21 - Asymptotics III: Amortized and Empirical Analysis |
| Lecture 22 - Binary Search Trees |
| Lecture 23 - Balanced Search Trees |
| Lecture 24 - Hashing |
| Lecture 25 - Trees |
| Lecture 26 - Heaps, Priority Queues |
| Lecture 27 - Sorting: Selection Sort, Heapsort |
| Lecture 28 - Midterm Review |
| Lecture 29 - Insertion Sort, Shell Sort, Implementations |
| Lecture 30 - Quicksort |
| Lecture 31 - Sorting Tradeoffs & Algorithmic Bounds |
| Lecture 32 - Radix Sorts |
| Lecture 33 - Tries: Trie Implementation, Child Link Optimizations, Ternary Search Tries |
| Lecture 34 - Graphs Intro |
| Lecture 35 - Graph Traversals |
| Lecture 36 - DFS vs. BFS, Shortest Paths |
| Lecture 37 - Minimum Spanning Trees |
| Lecture 38 - Compression |
| Lecture 39 - Impossible and Intractable Problems |