mirror of
https://github.com/PKUFlyingPig/cs-self-learning.git
synced 2026-06-26 03:17:01 +08:00
3e418d672e
* [TRANSLATION]translate CS170.md * Update CS170.en.md * Update MITLA.en.md * Update Duke-Coursera-Intro-C.en.md * Update N2T.en.md * Update signal.en.md * Update CS70.en.md * Update CS106L.en.md * Update fullstackopen.en.md * Update Data100.en.md
24 lines
1.2 KiB
Markdown
24 lines
1.2 KiB
Markdown
# CS170: Efficient Algorithms and Intractable Problems
|
|
|
|
## Descriptions
|
|
|
|
- Offered by: UC Berkeley
|
|
- Prerequisites: CS61B, CS70
|
|
- Programming Languages: LaTeX
|
|
- Difficulty: 🌟🌟🌟
|
|
- Class Hour: 60 hours
|
|
|
|
This is Berkeley's algorithm design and analysis course. It focuses on the theoretical foundations and complexity analysis of algorithms, covering Divide-and-Conquer, Graph Algorithms, Shortest Paths, Spanning Trees, Greedy Algorithms, Dynamic programming, Union Finds, Linear Programming, Network Flows, NP-Completeness, Randomized Algorithms, Hashing, etc.
|
|
|
|
The textbook for this course is well written and very suitable as a reference book. In addition, this class has written assignments and is recommended to use LaTeX. You can take this opportunity to practice your LaTeX skills.
|
|
|
|
## Course Resources
|
|
|
|
- Course Website: <https://cs170.org/>
|
|
- Recordings: <https://www.youtube.com/playlist?list=PLnocShPlK-Ft-o7NInBDw18be86dNaxlT>
|
|
- Recordings: refer to the course website
|
|
- Assignments: refer to the course website
|
|
|
|
## Personal Resources
|
|
|
|
All the resources and assignments used by @PKUFlyingPig in this course are maintained in [PKUFlyingPig/UCB-CS170 - GitHub](https://github.com/PKUFlyingPig/UCB-CS170)
|