CS 61B Lecture 2: Using Objects




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/

Related Links:CS 61A Lecture 17: Object-Oriented Programming INAVTEQ Workshop: Introduction to Route Calculation Part 1CS 61B Lecture 8: Linked Lists IIThe Inverted PendulumCS 61B Lecture 25: Binary Search Trees
© Copyright 2008. All Rights Reserved.