CS61B

CS61B, titled Data Structures, is a course offered by the University of California, Berkeley in its EECS department. It is part of the undergraduate computer science curriculum and is typically taken after CS61A. The course focuses on data structures and the algorithms that operate on them, with an emphasis on implementing, analyzing, and evaluating the performance of software that handles data efficiently. Topics generally covered include arrays, linked lists, stacks, queues, trees (including binary search trees and balanced variants), graphs, heaps, and hash tables, as well as related concepts such as maps, sets, dynamic memory management, and object-oriented design. Students study algorithmic techniques for organizing data and analyze performance using different complexity measures, including amortized analysis and worst-case bounds.

The instructional approach combines lectures with extensive hands-on programming. Students implement data structures in a course programming language (historically Java) and test for correctness, efficiency, and scalability. Coursework typically includes weekly problem sets and programming projects, along with midterm and final examinations. Assessments emphasize both theoretical understanding and practical software engineering skills, including debugging, testing, and using appropriate development tools and version control.

CS61B serves as a foundational course for Berkeley’s computer science majors, bridging introductory programming and more advanced topics in algorithms and systems. Prerequisites usually include prior programming experience or completion of CS61A (or an equivalent course). The course is taught by Berkeley faculty and teaching staff and has had a lasting influence on data-structures education in computer science curricula. Materials, problem sets, and lecture content are often published to support students within the campus program and online learners seeking to study the material.