CS 170: Efficient Algorithms and Intractable Problems (Spring 2012, UC Berkeley). Instructors: Prof. Christos Papadimitriou and Prof. Satish Rao.
0
September 26, 2023
English
English [CC]
Description
This course discusses 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.
Course Curriculum
- Lecture 01 Unlimited
- Lecture 02 Unlimited
- Lecture 03 Unlimited
- Lecture 04 Unlimited
- Lecture 06 Unlimited
- Lecture 07 Unlimited
- Lecture 08 Unlimited
- Lecture 09 Unlimited
- Lecture 10 Unlimited
- Lecture 11 Unlimited
- Lecture 12 Unlimited
- Lecture 13 Unlimited
- Lecture 14 Unlimited
- Lecture 16 Unlimited
- Lecture 17 Unlimited
- Lecture 18 Unlimited
- Lecture 19 Unlimited
- Lecture 22 Unlimited
- Lecture 23 Unlimited
- Lecture 24 Unlimited
- Lecture 25 Unlimited
- Lecture 26 Unlimited
About the instructor
5
5
Instructor Rating
6
Reviews
4637
Courses
24184
Students
OpenCoursa
Accessible Education for Everyone
OpenCoursa is a free online learning platform dedicated to providing high-quality education to learners worldwide. With courses across a wide range of subjects, we empower individuals to gain new skills and knowledge at no cost. Our mission is to make education accessible to everyone, offering flexible learning opportunities for personal and professional growth.
FREE
Hours of videos
Units & Quizzes
Unlimited Lifetime access
Access on mobile app
Certificate of Completion
- For teams of 2 or more users
- 27,000+ fresh & in-demand courses
- Learning Engagement tools
- SSO and LMS Integrations
