CS 61B. Data Structures
Catalog Description: 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
Related Areas:
Prerequisites: COMPSCI 61A, COMPSCI 88, or ENGIN 7.
Credit Restrictions: Students will receive no credit for COMPSCI 61B after completing COMPSCI 61BL, or COMPSCI 47B. A deficient grade in COMPSCI 61B may be removed by taking COMPSCI 61BL.
Formats:
Fall: 3.0 hours of lecture, 1.0 hours of discussion, and 2.0 hours of laboratory per week
Summer: 6.0 hours of lecture, 2.0 hours of discussion, and 4.0 hours of laboratory per week
Spring: 3.0 hours of lecture, 1.0 hours of discussion, and 2.0 hours of laboratory per week
Grading Basis: letter
Final Exam Status: Written final exam conducted during the scheduled final exam period
Class Schedule (Spring 2025):
CS 61B – MoWeFr 13:00-13:59, Valley Life Sciences 2050 –
Joshua A Hug, Justin Yokota
Class Notes
* Time conflicts ARE allowed with this class
* Lectures WILL be recorded for playback later
* An in-person alternate final exam will be offered immediately after the regularly scheduled final
Class Schedule (Fall 2025):
CS 61B – MoWeFr 16:00-16:59, Lewis 100 –
Joshua A Hug
Class Notes
* Time conflicts ARE allowed.
* Lecture will be recorded for playback later.
Links: