x
Menu

Computer Science 61B

UC Berkeley,, Fall 2006 , Prof. Jonathan Shewchuk

Updated On 02 Feb, 19

Overview

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

Includes

Lecture 27: Graphs

4.1 ( 11 )


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.

httpwww.cs.berkeley.edu

Ratings

0


0 Ratings
55%
30%
10%
3%
2%
Comments
comment person image

Sam

Excellent course helped me understand topic that i couldn't while attendinfg my college.

Reply
comment person image

Dembe

Great course. Thank you very much.

Reply
Send