CS 61B Asymptotic Analysis CS 61B: Data Structures - 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. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language. http://www.cs.berkeley.edu
Video is embedded from external source so embedding is not available.
Video is embedded from external source so download is not available.
Channels: Computer Science
Tags: CS 61b asymptotic analysis shewchuk ucberkeley lecture yt:quality=high
Uploaded by: berkeleycs61b ( Send Message ) on 04-09-2012.
Duration: 48m 51s
No content is added to this lecture.
This video is a part of a lecture series from of berkeley
Lec 1 - CS 61B Course Overview
Lec 3 - CS 61B Defining Classes
Lec 4 - CS 61B Types and Conditionals
Lec 5 - CS 61B Iteration and Arrays I
Lec 6 - CS 61B Iteration and Arrays II
Lec 8 - CS 61B Linked Lists II
Lec 12 - CS 61B Abstract Classes
Lec 18 - CS 61B Encapsulated Lists
Lec 20 - CS 61B Algorithm Analysis
Lec 23 - CS 61B Trees and Traversals
Lec 24 - CS 61B Priority Queues
Lec 25 - CS 61B Binary Search Trees
Lec 26 - CS 61B Balanced Search Trees
Lec 28 - CS 61B Weighted Graphs
Lec 34 - CS 61B Lecture 34: Splay Trees
Lec 35 - CS 61B Amortized Analysis
Lec 36 - CS 61B Randomized Analysis
Lec 37 - CS 61B Expression Parsing
Lec 38 - CS 61B Garbage Collection