2019 Fall
COMPSCI 170 001 - LEC 001
Efficient Algorithms and Intractable Problems
Satish B Rao, Prasad Raghavendra
Class #:27512
Units: 4
Offered through
Electrical Engineering and Computer Sciences
Current Enrollment
Total Open Seats:
47
Enrolled: 943
Waitlisted: 0
Capacity: 990
Waitlist Max: 100
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
THU, DECEMBER 19TH
08:00 am - 11:00 am
RSF Fieldhouse
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.
Rules & Requirements
Repeat Rules
Course is not repeatable for credit.
Reserved Seats
Current Enrollment
No Reserved Seats