Carrera y trabajo
Пройти курс Algorithms: Design and Analysis, Part 1 by Tim Roughgarden на Coursera
Так как я программист самоучка то об эффективных алгоритмах я мало что знаю. В связи с этим хочется восполнить пробел в знаниях и получить отправную точку для дальнейшего развития.
Criterio del fin
Получен сертификат об окончании
-
Week 1 (January 19-25)
Topics
- Introduction
- Merge Sort
- Asymptotic Notation
- Guiding Principles of Algorithm Analysis
- Divide & Conquer Algorithms
Homework
- Due February 1:
- Problem Set #1: Divide & Conquer / Asymptotic Analysis
- Programming Assignment #1: Counting Inversions!
-
Week 2 (January 26-February 1)
Topics
- Master Method
- QuickSort
Homework
- Due February 8:
- Problem Set #2: QuickSort and the Master Method
- Programming Assignment #2: Counting Comparisons in QuickSort
-
Week 3 (February 2-8)
Topics
- Final Thoughts on Sorting & Searching
- Introduction to Graph Algorithms : Graph Representations & Mininum Cuts in Graphs
Homework
- Due February 15:
- Problem Set #3: Randomized Selection & Minimum Cuts in Graphs
- Programming Assignment #3: Karger's Minimum Cut Algorithm
-
Week 4 (February 9-15)
Topics
- Graph Search: Breadth-First Search, Depth-First Search
- Applications: Topological Sort, Connected Components
Homework
- Due February 22:
- Problem Set #4: Graphs, BFS, DFS, Topological Sort
- Programming Assignment #4: Computing SCCs
-
Week 5 (February 16-22)
Topics
- Dijkstra's Shortest-Path Algorithm
- Data structures and how to use them
- Heaps
- Binary Search Trees
- Balanced BSTs
Homework
- Due March 1:
- Problem Set #5: Dijkstra, Heaps, Search Trees
- Programming Assignment #5: Dijkstra's Algorithm
-
Week 6 (February 23-March 1)
Topics
- Hash Tables: Applications and Implementation
- Bloom Filters
Homework
- Due March 8:
- Problem Set #6: Hashing, Bloom Filters
- Programming Assignment #6: Data Structure Applications
-
Final Exam (March 2-15)
¡No omita entradas nuevas!
Suscríbase al objetivo y siga su logro
