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