Computer Science 61B video lectures, Jonathan Shewchuk of UC Berkeley

Home »Computer Science »UC Berkeley » Computer Science 61B

Computer Science 61B

Lecture 1: CS 61B Lecture 1 - Course Overview

Download:   mp3 download MP4,FLV & 3GP 14013 views

SEE: Guide to Download UC Berkeley Video Lecture

Lecture Details :

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.

Course Description :

Course Overview -Using Objects - Defining Classes - Types and Conditionals - Iteration and Arrays - Linked Lists - Stack Frames -Testing - Inheritances - Abstract Classes - Java Packages - Exceptions -More Java - Game Trees - Encapsulation - Encapsulated Lists - Asymptotic Analysis - Algorithm Analysis - Hash Tables - Stacks and Queues - Trees and Traversals - Priority Queues - Binary Search Trees - Balanced Search Trees - Graphs - Weighted Graphs - Sorting - Disjoint Sets - Sortings - Splay Trees - Amortized Analysis - Randomized Analysis - Expression Parsing - Garbage Collection - Augmenting Data Structures

Other Resources :

Citation |

These free Lecture Videos are licensed under a Creative Commons License by UC Berkeley

Other Computer Science Courses

» check out the complete list of Computer Science lectures          


Get Your Degree!

Find schools and get information on the program that’s right for you.

Powered by Campus Explorer


Post your Comments