Students
Tuition Fee
Not Available
Start Date
Not Available
Medium of studying
Not Available
Duration
Not Available
Details
Program Details
Degree
Courses
Course Language
English
About Program

Program Overview


Introduction to the Department of Electrical Engineering and Computer Sciences (EECS) at UC Berkeley

The Department of Electrical Engineering and Computer Sciences (EECS) at UC Berkeley offers one of the strongest research and instructional programs in this field anywhere in the world.


Academics

Undergraduate Admissions & Programs

  • CS Major
  • EECS Major
  • EECS/CS Program Comparison Chart
  • Second Bachelor's Degree
  • Summer Research
  • Cal Day

Graduate Admissions & Programs

  • Grad Admissions FAQ
  • Industry-Oriented Programs
  • Research-Oriented Programs
  • Fellowships
  • Adding the EECS/CS M.S. From Another Department
  • Recommended Coursework

Courses

  • EE Courses
  • CS Courses

Research

Research Overview

Research is the foundation of Berkeley EECS. Faculty, students, and staff work together on cutting-edge projects that cross disciplinary boundaries to improve everyday life and make a difference.


Areas

  • Research areas are not specified in the provided context.

Centers & Labs

  • Centers and labs are not specified in the provided context.

People

Faculty

  • In Memoriam

Students

  • Student Awards
  • Student Organizations

Staff

  • Student Affairs
  • Faculty Support
  • Course Support
  • Facilities and Engineering Services
  • Financial Services
  • HR
  • IT Support
  • Industrial & Public Relations

Alumni

  • EE Distinguished Alumni
  • CS Distinguished Alumni

CS 270: Combinatorial Algorithms and Data Structures

Catalog Description

Design and analysis of efficient algorithms for combinatorial problems. Network flow theory, matching theory, matroid theory; augmenting-path algorithms; branch-and-bound algorithms; data structure techniques for efficient implementation of combinatorial algorithms; analysis of data structures; applications of data structure techniques to sorting, searching, and geometric problems.


Units

  • 3 units

Related Areas

  • Theory (THY)

Prerequisites

  • COMPSCI 170

Formats

  • Spring: 3.0 hours of lecture and 1.0 hours of discussion per week
  • Fall: 3.0 hours of lecture and 1.0 hours of discussion per week

Grading Basis

  • Letter

Final Exam Status

  • No final exam

Class Schedule (Fall 2025)

  • CS 270 – Mo 17:00-18:29, Soda 306; We 17:30-18:59, Soda 306 – Satish B Rao

Class Notes

  • Time conflicts are allowed
  • Interested undergrads can fill out a form (not specified in the provided context)
See More