Spring 2025
COMPSCI 170 001 - LEC 001
Efficient Algorithms and Intractable Problems
John Wright, Nika Haghtalab
Class #:28872
Units: 4
Instruction Mode:
In-Person Instruction
Time Conflict Enrollment Allowed
Offered through
Electrical Engineering and Computer Sciences
Current Enrollment
Total Open Seats:
70
Enrolled: 395
Waitlisted: 0
Capacity: 465
Waitlist Max: 300
No Reserved Seats
Hours & Workload
1 hours of the exchange of opinions or questions on course material per week, 3 hours of instructor presentation of course materials per week, and 8 hours of outside work hours per week.
Final Exam
MON, MAY 12TH
11:30 am - 02:30 pm
Valley Life Sciences 2050
Pimentel 1
Course 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.
Class Notes
* Time conflicts ARE allowed but NO ALTERNATE FINAL EXAM.
* Lecture will be recorded for playback later.
* Limited seats have been set aside for Data Science majors.
* Lecture will be recorded for playback later.
* Limited seats have been set aside for Data Science majors.
Rules & Requirements
Requisites
- Undergraduate Students: College of Engineering declared majors or L&S Computer Science or Data Science BA
Repeat Rules
Course is not repeatable for credit.
Reserved Seats
Reserved Seating For This Term
Current Enrollment
No Reserved Seats
Textbooks & Materials
See class syllabus or https://calstudentstore.berkeley.edu/textbooks for the most current information.
Guide to Open, Free, & Affordable Course Materials