CS W61B. Data Structures (Online)

Catalog Description: Identical to CS61B, but in an online format. 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.

Units: 4.0

Prerequisites: Computer Science 61A or Computer Science W61A or Computer Science 88 or Engineering 7.

Credit Restrictions: Students will receive no credit for Computer Science W61B after completing Computer Science 47B or or 61B or 61BL. A deficiency in Computer Science 61BL may be removed by taking Computer Science W61B.

Formats:
Fall: 3.0 hours of web-based lecture, 2.0 hours of laboratory, and 1.0 hours of web-based discussion per week
Spring: 3.0 hours of web-based lecture, 2.0 hours of laboratory, and 1.0 hours of web-based discussion per week
Summer: 6.0 hours of web-based lecture, 4.0 hours of laboratory, and 2.0 hours of web-based discussion per week

Grading basis: letter

Final exam status: Written final exam conducted during the scheduled final exam period


Class homepage on inst.eecs

General Catalog listing