Spring 2024
COMPSCI 170 001 - LEC 001
Efficient Algorithms and Intractable Problems
Prasad Raghavendra, Christian H Borgs
Class #:15787
Units: 4
Instruction Mode:
In-Person Instruction
Offered through
Electrical Engineering and Computer Sciences
Current Enrollment
Total Open Seats:
19
Enrolled: 616
Waitlisted: 0
Capacity: 635
Waitlist Max: 0
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
FRI, MAY 10TH
07:00 pm - 10:00 pm
RSF Fieldhouse
Other classes by Prasad Raghavendra
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 NOT allowed.
* Waiting for faculty confirmation about exceeding room capacity before expanding enrollment. It MIGHT go up to 475.
* Waiting for faculty confirmation about exceeding room capacity before expanding enrollment. It MIGHT go up to 475.
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
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