InfoCoBuild

CS 61B: Data Structures and Advanced Programming

CS 61B: Data Structures and Advanced Programming (Spring 2014, UC Berkeley). Taught by Professor Jonathan Shewchuk, 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 06 - Stack Frames


Go to the Course Home or watch other lectures:

Lecture 01 - Course Overview; Using Objects
Lecture 02 - Defining Classes
Lecture 03 - Types; Conditionals; Iteration & Arrays
Lecture 04 - Iteration & Arrays II
Lecture 05 - Linked Lists
Lecture 06 - Stack Frames
Lecture 07 - Stack & Heap
Lecture 08 - Inheritance
Lecture 09 - Abstract Classes; Java Packages
Lecture 10 - Exceptions; More Java
Lecture 11 - Game Trees
Lecture 12 - Encapsulation; Encapsulated Lists
Lecture 13 - Asymptotic Analysis
Lecture 14 - Dictionaries & Hash Tables
Lecture 15 - Algorithm Analysis
Lecture 16 - Trees and Traversals; Priority Queues
Lecture 17 - Binary Search Trees
Lecture 18 - Balanced Search Trees; Graphs
Lecture 19 - Weighted Graphs
Lecture 20 - Four Sorting Algorithms; Quicksort
Lecture 21 - Disjoint Sets; Sorting & Selection
Lecture 22 - Counting Sort; Radix Sort
Lecture 23 - Splay Trees; Amortized Analysis
Lecture 24 - Randomized Analysis
Lecture 25 - Garbage Collection; Augmenting Data Structures