CS 170. Efficient Algorithms and Intractable Problems
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
- Security (SEC)
- Theory (THY)
Centers & Labs
- Various centers and labs are available for research purposes.
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 170: Efficient Algorithms and Intractable Problems
Catalog Description
Concept and basic techniques in the design and analysis of algorithms; models of computation; lower bounds; algorithms for optimum search trees, balanced trees and UNION-FIND algorithms; numerical and algebraic algorithms; combinatorial algorithms. Turing machines, how to count steps, deterministic and nondeterministic Turing machines, NP-completeness. Unsolvable and intractable problems.
Units
- 4 units
Prerequisites
- COMPSCI 61B and COMPSCI 70
Formats
- Spring: 3.0 hours of lecture and 1.0 hours of discussion per week
- Summer: 6.0 hours of lecture and 2.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
- Written final exam conducted during the scheduled final exam period
Class Schedule
- Fall 2025: CS 170 – TuTh 14:00-15:29, Wheeler 150 – John Wright, Sanjam Garg
- Spring 2026: CS 170 – TuTh 15:30-16:59, Stanley 105 – Lijie Chen, Umesh V Vazirani
Class Notes
- Time conflicts are NOT allowed.
- The lecture WILL be recorded for playback later.
- Lectures will be recorded.
- 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. The students who qualify have already been notified.
