2019 Fall COMPSCI 170 001 LEC 001

2019 Fall

COMPSCI 170 001 - LEC 001

Efficient Algorithms and Intractable Problems

Satish B Rao, Prasad Raghavendra

Aug 28, 2019 - Dec 13, 2019
Mo, We, Fr
04:00 pm - 04:59 pm
Class #:27512
Units: 4

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.

Class Notes

* The lecture for this class will be webcast.

* Time conflicts with this class WILL be allowed by the Computer Science department. NOTE: Faculty is NOT obligated to accommodate conflicting final exam times or project due dates.

* This class uses 999 sections. In addition to.. show more
* The lecture for this class will be webcast.

* Time conflicts with this class WILL be allowed by the Computer Science department. NOTE: Faculty is NOT obligated to accommodate conflicting final exam times or project due dates.

* This class uses 999 sections. In addition to the lecture, you must in enroll in DIS 999 to enroll in the course. Selection and assignment into the actual discussions happen outside of CalCentral. Instructors will provide more information during the first lecture. show less

Rules & Requirements

Repeat Rules

Course is not repeatable for credit.

Reserved Seats

Current Enrollment

No Reserved Seats

Textbooks & Materials

Associated Sections