2024 Fall
COMPSCI 170 001 - LEC 001
Efficient Algorithms and Intractable Problems
Prasad Raghavendra, Sanjam Garg
Class #:28489
Units: 4
Instruction Mode:
In-Person Instruction
Offered through
Electrical Engineering and Computer Sciences
Current Enrollment
Total Open Seats:
12
Enrolled: 634
Waitlisted: 0
Capacity: 646
Waitlist Max: 300
Open Reserved Seats:
7 unreserved seats
5 reserved for Undergraduate Data Science Majors
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
TUE, DECEMBER 17TH
08:00 am - 11:00 am
Valley Life Sciences 2050
Pimentel 1
Morgan 101
Anthro/Art Practice Bldg 160
Physics Building 3
Other classes by Prasad Raghavendra
Other classes by Sanjam Garg
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.
* Lecture will be recorded for playback later.
* An alternate final exam will NOT be offered.
* Lecture will be recorded for playback later.
* An alternate final exam will NOT be offered.
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
Open Reserved Seats:
7 unreserved seats
5 reserved for Undergraduate Data Science Majors
Textbooks & Materials
See class syllabus or https://calstudentstore.berkeley.edu/textbooks for the most current information.
Guide to Open, Free, & Affordable Course Materials