InfoCoBuild

CS 61B: Data Structures and Advanced Programming

CS 61B: Data Structures and Advanced Programming (Fall 2006, 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 37 - Expression Parsing


Go to the Course Home or watch other lectures:

Lecture 01 - Course Overview
Lecture 02 - Using Objects
Lecture 03 - Defining Classes
Lecture 04 - Types and Conditionals
Lecture 05 - Iteration and Arrays I
Lecture 06 - Iteration and Arrays II
Lecture 07 - Linked Lists I
Lecture 08 - Linked Lists II
Lecture 09 - Stack Frames
Lecture 10 - Testing
Lecture 11 - Inheritances
Lecture 12 - Abstract Classes
Lecture 13 - Java Packages
Lecture 14 - Exceptions
Lecture 15 - More Java
Lecture 16 - Game Trees
Lecture 17 - Encapsulation
Lecture 18 - Encapsulated Lists
Lecture 19 - Asymptotic Analysis
Lecture 20 - Algorithm Analysis
Lecture 21 - Hash Tables
Lecture 22 - Stacks and Queues
Lecture 23 - Trees and Traversals
Lecture 24 - Priority Queues
Lecture 25 - Binary Search Trees
Lecture 26 - Balanced Search Trees
Lecture 27 - Graphs
Lecture 28 - Weighted Graphs
Lecture 29 - Sorting I
Lecture 30 - Sorting II
Lecture 31 - Disjoint Sets
Lecture 32 - Sorting III
Lecture 33 - Sorting V
Lecture 34 - Splay Trees
Lecture 35 - Amortized Analysis
Lecture 36 - Randomized Analysis
Lecture 37 - Expression Parsing
Lecture 38 - Garbage Collection
Lecture 39 - Augmenting Data Structures