[OFF] Algorithms: Design and Analysis, da universidade de Stanford
49 views
Skip to first unread message
Juan Lopes
Jun 13, 2012, 11:00:15 AM6/13/12
to dotnetar...@googlegroups.com
Começou essa semana a turma de design e análise de algoritmos da universidade de Stanford. Quem está habituado com o Coursera deve conhecer.
Então, é uma oportunidade de entender mais sobre algoritmos de uma forma bem didática.
elemarjr
Jun 13, 2012, 12:13:20 PM6/13/12
to dotnetar...@googlegroups.com
Inscrito e estudando!
--
Você recebeu esta mensagem porque faz parte do grupo .Net Architects hospedado no Google Groups.
Para postar envie uma mensagem para dotnetar...@googlegroups.com
Para sair do grupo envie uma mensagem para dotnetarchitec...@googlegroups.com
Para mais opções visite o grupo em http://groups.google.com/group/dotnetarchitects?hl=pt-br
Nicolas Tarzia
Jun 13, 2012, 12:27:32 PM6/13/12
to dotnetar...@googlegroups.com
Inscrito!
--
Nícolas Tarzia | ViWorks | T: +55.12.92141859 | con...@nicolastarzia.com | http://www.nicolastarzia.com
nicolas_tarzia
nicolastarzia
Leonardo Campos
Jun 14, 2012, 12:58:54 AM6/14/12
to dotnetar...@googlegroups.com
É a segunda vez que esse curso estará disponível.
--
Att.
Leonardo da Silva Campos
"Keep distance, coder coding!"
Fiz na primeira vez e achei bacana.
Só para terem ideia do que será abordado no curso, segue lista dos arquivos disponibilizados no primeiro. ;P
+---01 - Introduction
| +---Slides
| | 01 - Introduction - Why Study Algorithms.pptx
| | 02 - About the Course.pptx
| | 03 - Merge Sort - Motivation and Example.pptx
| | 04 - Merge Sort - Pseudocode.pptx
| | 05 - Merge Sort - Analysis.pptx
| | 06 - Guiding Principples for Analysis of Algorithms.pptx
| |
| \---Videos
| | 01 - Introduction - Why Study Algorithms.mp4
| | 01 - Introduction - Why Study Algorithms.txt
| | 02 - About the Course.mp4
| | 02 - About the Course.txt
| | 03 - Merge Sort - Motivation and Example.mp4
| | 03 - Merge Sort - Motivation and Example.txt
| | 04 - Merge Sort - Pseudocode.mp4
| | 04 - Merge Sort - Pseudocode.txt
| | 05 - Merge Sort - Analysis.mp4
| | 05 - Merge Sort - Analysis.txt
| | 06 - Guiding Principles for Analysis of Algorithms.mp4
| | 06 - Guiding Principles for Analysis of Algorithms.txt
| |
| \---Subs
| 01 - Introduction - Why Study Algorithms-eng.txt
| 04 - Merge Sort - Pseudocode-eng.txt
|
+---02 - Asymptotic Analysis
| +---Slides
| | slides_algo-asymptotic1.pdf
| | slides_algo-asymptotic1.pptx
| | slides_algo-asymptotic2.pdf
| | slides_algo-asymptotic2.pptx
| | slides_algo-asymptotic3-annotated.pptx
| | slides_algo-asymptotic3.pdf
| | slides_algo-asymptotic4.pdf
| | slides_algo-asymptotic4.pptx
| |
| \---Videos
| 01 - Big-On Notation.mp4
| 01 - Big-On Notation.txt
| 02 - Basic Examples.mp4
| 02 - Basic Examples.txt
| 03 - Big Omega and Theta.mp4
| 03 - Big Omega and Theta.txt
| 04 - Additional Examples [Review - Optional].mp4
| 04 - Additional Examples [Review - Optional].txt
|
+---03 - Divide & Conquer Algorithms
| +---Slides
| | slides_algo-closest1-annotated-final.pptx
| | slides_algo-closest1.pdf
| | slides_algo-closest2-annotated-final.pptx
| | slides_algo-closest2.pdf
| | slides_algo-inversions1.pdf
| | slides_algo-inversions1.pptx
| | slides_algo-inversions2.pdf
| | slides_algo-inversions2.pptx
| | slides_algo-strassen.pdf
| | slides_algo-strassen.pptx
| |
| \---Videos
| 01 - O(n log n) Algorithm for Counting inversions I.mp4
| 01 - O(n log n) Algorithm for Counting inversions I.txt
| 02 - O(n log n) Algorithm for Counting inversions II.mp4
| 02 - O(n log n) Algorithm for Counting inversions II.txt
| 03 - Strassens Subcubic Matrix Multiplication Algorithm.mp4
| 03 - Strassens Subcubic Matrix Multiplication Algorithm.txt
| 04 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional].mp4
| 04 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional].txt
| 05 - O(n log n) Algorithm for Closest Pair II [Advanced - Optional].mp4
| 05 - O(n log n) Algorithm for Closest Pair II [Advanced - Optional].txt
|
+---04 - The Master Method
| +---Slides
| | slides_algo-master1.pdf
| | slides_algo-master1.pptx
| | slides_algo-master2-annotated.pptx
| | slides_algo-master2.pdf
| | slides_algo-master3.pdf
| | slides_algo-master3.pptx
| | slides_algo-master4.pdf
| | slides_algo-master4.pptx
| | slides_algo-master5-annotated.pptx
| | slides_algo-master5.pdf
| | slides_algo-master6.pdf
| | slides_algo-master6.pptx
| |
| \---Videos
| 01 - Motivation.mp4
| 01 - Motivation.srt
| 02 - Formal Statement.mp4
| 02 - Formal Statement.srt
| 03 - Examples.mp4
| 03 - Examples.srt
| 04 - Proof I.mp4
| 04 - Proof I.srt
| 05 - Interpretation of the 3 Cases.mp4
| 05 - Interpretation of the 3 Cases.srt
| 06 - Proof II.mp4
| 06 - Proof II.srt
|
+---05 - Quicksort Algorithm
| +---Slides
| | slides_algo-qsort-correctness-annotated.pdf
| | slides_algo-qsort-correctness-annotated.pptx
| | slides_algo-qsort-intro-annotated.pdf
| | slides_algo-qsort-intro-annotated.pptx
| | slides_algo-qsort-partition-annotated.pdf
| | slides_algo-qsort-partition-annotated.pptx
| | slides_algo-qsort-pivot-annotated.pdf
| | slides_algo-qsort-pivot-annotated.pptx
| |
| \---Videos
| 5 - 1 - Quicksort- Overview (12 min).mp4
| 5 - 1 - Quicksort- Overview (12 min).srt
| 5 - 2 - Partitioning Around a Pivot (25 min).mp4
| 5 - 2 - Partitioning Around a Pivot (25 min).srt
| 5 - 3 - Correctness of Quicksort [Review - Optional] (11 min).mp4
| 5 - 3 - Correctness of Quicksort [Review - Optional] (11 min).srt
| 5 - 4 - Choosing a Good Pivot (22min).mp4
| 5 - 4 - Choosing a Good Pivot (22min).srt
|
+---06 - Quicksort - Analysis
| +---Slides
| | notes_qsort.pdf
| | slides_algo-qsort-analysis1-annotated.pdf
| | slides_algo-qsort-analysis1-annotated.pptx
| | slides_algo-qsort-analysis2-annotated.pdf
| | slides_algo-qsort-analysis2-annotated.pptx
| | slides_algo-qsort-analysis3-annotated.pdf
| | slides_algo-qsort-analysis3-annotated.pptx
| |
| \---Videos
| 6 - 1 - Analysis I- A Decomposition Principle [Advanced - Optional] (22 min).mp4
| 6 - 1 - Analysis I- A Decomposition Principle [Advanced - Optional] (22 min).srt
| 6 - 2 - Analysis II- The Key Insight [Advanced - Optional] (12min).mp4
| 6 - 2 - Analysis II- The Key Insight [Advanced - Optional] (12min).srt
| 6 - 3 - Analysis III- Final Calculations [Advanced - Optional] (9min).mp4
| 6 - 3 - Analysis III- Final Calculations [Advanced - Optional] (9min).srt
|
+---07 - Probability Review
| +---Slides
| | slides_algo-prob_review1-annotated.pdf
| | slides_algo-prob_review1-annotated.pptx
| | slides_algo-prob_review2-annotated.pdf
| | slides_algo-prob_review2-annotated.pptx
| |
| \---Videos
| 7 - 1 - Part I [Review - Optional] (25 min).mp4
| 7 - 1 - Part I [Review - Optional] (25 min).srt
| 7 - 1 - Part I [Review - Optional] (25 min).txt
| 7 - 2 - Part II [Review - Optional] (17 min).mp4
| 7 - 2 - Part II [Review - Optional] (17 min).srt
| 7 - 2 - Part II [Review - Optional] (17 min).txt
|
+---08 - Linear-Time Selection
| +---Slides
| | algo-select-dalgorithm.pptx
| | slides_algo-select-dalgorithm.pdf
| | slides_algo-select-dalgorithmanalysis-annotated.pdf
| | slides_algo-select-dalgorithmanalysis-annotated.pptx
| | slides_algo-select-danalysis.pdf
| | slides_algo-select-danalysis.pptx
| | slides_algo-select-ralgorithm-annotated.pdf
| | slides_algo-select-ralgorithm-annotated.pptx
| | slides_algo-select-ranalysis-annotated.pdf
| | slides_algo-select-ranalysis-annotated.pptx
| | slides_algo-select-sortinglb-annotated.pdf
| | slides_algo-select-sortinglb-annotated.pptx
| |
| \---Videos
| 8 - 1 - Randomized Selection - Algorithm (22 min).mp4
| 8 - 1 - Randomized Selection - Algorithm (22 min).srt
| 8 - 1 - Randomized Selection - Algorithm (22 min).txt
| 8 - 2 - Randomized Selection - Analysis (21 min).mp4
| 8 - 2 - Randomized Selection - Analysis (21 min).srt
| 8 - 2 - Randomized Selection - Analysis (21 min).txt
| 8 - 3 - Deterministic Selection - Algorithm [Advanced - Optional] (17 min).mp4
| 8 - 3 - Deterministic Selection - Algorithm [Advanced - Optional] (17 min).srt
| 8 - 3 - Deterministic Selection - Algorithm [Advanced - Optional] (17 min).txt
| 8 - 4 - Deterministic Selection - Analysis I [Advanced - Optional] (22 min).mp4
| 8 - 4 - Deterministic Selection - Analysis I [Advanced - Optional] (22 min).srt
| 8 - 4 - Deterministic Selection - Analysis I [Advanced - Optional] (22 min).txt
| 8 - 5 - Deterministic Selection - Analysis II [Advanced - Optional] (13 min).mp4
| 8 - 5 - Deterministic Selection - Analysis II [Advanced - Optional] (13 min).srt
| 8 - 5 - Deterministic Selection - Analysis II [Advanced - Optional] (13 min).txt
| 8 - 6 - Omega(n log n) Lower Bound for Compasion-Based Sorting [Advanced - Optional] (13 min).mp4
| 8 - 6 - Omega(n log n) Lower Bound for Compasion-Based Sorting [Advanced - Optional] (13 min).srt
| 8 - 6 - Omega(n log n) Lower Bound for Compasion-Based Sorting [Advanced - Optional] (13 min).txt
|
+---09 - Graphs and the contradiction algorithm
| +---Slides
| | slides_algo-karger-algorithm-annotated.pdf
| | slides_algo-karger-algorithm-annotated.pptx
| | slides_algo-karger-analysis-annotated.pdf
| | slides_algo-karger-analysis-annotated.pptx
| | slides_algo-karger-counting-annotated.pdf
| | slides_algo-karger-counting-annotated.pptx
| | slides_algo-karger-overview-annotated.pdf
| | slides_algo-karger-overview-annotated.pptx
| | slides_algo-karger-representations-annotated.pdf
| | slides_algo-karger-representations-annotated.pptx
| |
| \---Videos
| 9 - 1 - Graphs and Minimum Cuts (16 min).mp4
| 9 - 1 - Graphs and Minimum Cuts (16 min).srt
| 9 - 1 - Graphs and Minimum Cuts (16 min).txt
| 9 - 2 - Graph Representations (14 min).mp4
| 9 - 2 - Graph Representations (14 min).srt
| 9 - 2 - Graph Representations (14 min).txt
| 9 - 3 - Random Contraction Algorithm (9 min).mp4
| 9 - 3 - Random Contraction Algorithm (9 min).srt
| 9 - 3 - Random Contraction Algorithm (9 min).txt
| 9 - 4 - Analysis of Contraction Algorithm (30 min).mp4
| 9 - 4 - Analysis of Contraction Algorithm (30 min).srt
| 9 - 4 - Analysis of Contraction Algorithm (30 min).txt
| 9 - 5 - Counting Minimum Cuts [Advanced - Optional] (7 min).mp4
| 9 - 5 - Counting Minimum Cuts [Advanced - Optional] (7 min).srt
| 9 - 5 - Counting Minimum Cuts [Advanced - Optional] (7 min).txt
|
+---10 - Graph search and connetivity
| +---Slides
| | notes_scc.pdf
| | slides_algo-graphs-bfs (1).pdf
| | slides_algo-graphs-bfs (2).pdf
| | slides_algo-graphs-bfs.pdf
| | slides_algo-graphs-dfs-annotated (1).pdf
| | slides_algo-graphs-dfs-annotated.pdf
| | slides_algo-graphs-scc.pdf
| | slides_algo-graphs-sccanalysis.pdf
| | slides_algo-graphs-search.pdf
| | slides_algo-graphs-web-annotated.pdf
| |
| \---Videos
| 10 - 1 - Graph Search - Overview (23 min).mp4
| 10 - 1 - Graph Search - Overview (23 min).srt
| 10 - 1 - Graph Search - Overview (23 min).txt
| 10 - 2 - Breadth-First Search (BFS)- The Basics (14 min).mp4
| 10 - 2 - Breadth-First Search (BFS)- The Basics (14 min).srt
| 10 - 2 - Breadth-First Search (BFS)- The Basics (14 min).txt
| 10 - 3 - BFS and Shortest Paths (8 min).mp4
| 10 - 3 - BFS and Shortest Paths (8 min).srt
| 10 - 3 - BFS and Shortest Paths (8 min).txt
| 10 - 4 - BFS and Undirected Connectivity (13 min).mp4
| 10 - 4 - BFS and Undirected Connectivity (13 min).srt
| 10 - 4 - BFS and Undirected Connectivity (13 min).txt
| 10 - 5 - Depth-First Search (DFS)- The Basics (7 min).mp4
| 10 - 5 - Depth-First Search (DFS)- The Basics (7 min).srt
| 10 - 5 - Depth-First Search (DFS)- The Basics (7 min).txt
| 10 - 6 - Topological Sort (22 min).mp4
| 10 - 6 - Topological Sort (22 min).srt
| 10 - 6 - Topological Sort (22 min).txt
| 10 - 7 - Computing Strong Components- The Algorithm (29 min).mp4
| 10 - 7 - Computing Strong Components- The Algorithm (29 min).srt
| 10 - 7 - Computing Strong Components- The Algorithm (29 min).txt
| 10 - 8 - Computing Strong Components- The Analysis (26 min).mp4
| 10 - 8 - Computing Strong Components- The Analysis (26 min).srt
| 10 - 8 - Computing Strong Components- The Analysis (26 min).txt
| 10 - 9 - Structure of the Web [Optional] (19 min).mp4
|
+---11 - Dijkstra's Shortest-Path Algorithm
| \---Videos
| 11 - 1 - Dijkstra's Shortest-Path Algorithm (21 min).mp4
| 11 - 1 - Dijkstra's Shortest-Path Algorithm (21 min).srt
| 11 - 1 - Dijkstra's Shortest-Path Algorithm (21 min).txt
| 11 - 2 - Dijkstra's Algorithm- Examples (13 min).mp4
| 11 - 2 - Dijkstra's Algorithm- Examples (13 min).srt
| 11 - 2 - Dijkstra's Algorithm- Examples (13 min).txt
| 11 - 3 - Correctness of Dijkstra's Algorithm [Advanced - Optional] (19 min).mp4
| 11 - 3 - Correctness of Dijkstra's Algorithm [Advanced - Optional] (19 min).srt
| 11 - 3 - Correctness of Dijkstra's Algorithm [Advanced - Optional] (19 min).txt
| 11 - 4 - Dijkstra's Algorithm- Implementation and Running Time (26 min).mp4
| 11 - 4 - Dijkstra's Algorithm- Implementation and Running Time (26 min).srt
| 11 - 4 - Dijkstra's Algorithm- Implementation and Running Time (26 min).txt
|
\---12 - Data Structures
\---Videos
12 - 1 - Data Structures- Overview (5 min).mp4
12 - 1 - Data Structures- Overview (5 min).srt
12 - 1 - Data Structures- Overview (5 min).txt
12 - 2 - Heaps- Operations and Applications (18 min).mp4
12 - 2 - Heaps- Operations and Applications (18 min).srt
12 - 2 - Heaps- Operations and Applications (18 min).txt
12 - 3 - Heaps- Implementation Details [Advanced - Optional] (21 min).mp4
12 - 4 - Hash Tables- Operations and Applications (19 min).mp4
12 - 4 - Hash Tables- Operations and Applications (19 min).srt
12 - 4 - Hash Tables- Operations and Applications (19 min).txt
12 - 5 - Hash Tables- Implementation Details, Part I (19 min).mp4
12 - 5 - Hash Tables- Implementation Details, Part I (19 min).srt
12 - 5 - Hash Tables- Implementation Details, Part I (19 min).txt
12 - 6 - Hash Tables- Implementation Details, Part II (22 min).mp4
12 - 6 - Hash Tables- Implementation Details, Part II (22 min).srt
12 - 6 - Hash Tables- Implementation Details, Part II (22 min).txt
12 - 7 - Universal Hashing- Motivation [Optional] (22 min).mp4
2012/6/13 Nicolas Tarzia <admini...@nicolastarzia.com>
Att.
Leonardo da Silva Campos
"Keep distance, coder coding!"
Reply all
Reply to author
Forward
0 new messages