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
Also Offered As: COMPSCI 61B
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.
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: Student Option
Final Exam Status: Yes
Class Schedule (Spring 2026):
CS 61B – MoWeFr 13:00-13:59, Wheeler 150 –
Joshua A Hug, Kay Ousterhout
Class Notes
- Time conflicts are allowed
- Lectures will be recorded
- An alternate final exam will be offered
Class Schedule (Fall 2026):
CS 61B – MoWeFr 14:00-14:59, Wheeler 150 –
Joshua A Hug, Manuel A Sabin
Class Notes
- Lectures will be recorded
- Time conflicts are allowed
- Seats reserved for students with enrollment permission are not open. They are reserved for students in internal programs. Please DO NOT ask faculty or staff for one of these seats.
Links: