Algorithms Design and Analysis, Part 1

seeders: 0
leechers: 0
Added on September 29, 2013 by SogeThuggein Other > Tutorials
Torrent verified.



Algorithms Design and Analysis, Part 1 (Size: 870.78 MB)
 2 - 1 - The Gist (14 min).mp427.68 MB
 2 - 5 - Additional Examples [Review - Optional] (8 min).mp47.72 MB
 2 - 4 - Big Omega and Theta (7 min).mp47.49 MB
 2 - 3 - Basic Examples (7 min).mp47.3 MB
 2 - 2 - Big-Oh Notation (4 min).mp44.13 MB
 3 - 4 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min).mp436.22 MB
 3 - 3 - Strassens Subcubic Matrix Multiplication Algorithm (22 min).mp423.57 MB
 3 - 5 - O(n log n) Algorithm for Closest Pair II [Advanced - Optional] (19 min).mp420.14 MB
 3 - 2 - O(n log n) Algorithm for Counting Inversions II (17 min).mp417.19 MB
 3 - 1 - O(n log n) Algorithm for Counting Inversions I (13 min).mp412.8 MB
 4 - 6 - Proof II (16 min).mp416.6 MB
 4 - 3 - Examples (13 min).mp414.4 MB
 4 - 5 - Interpretation of the 3 Cases (11 min).mp413.11 MB
 4 - 4 - Proof I (10 min).mp411.46 MB
 4 - 2 - Formal Statement (10 min).mp410.42 MB
 4 - 1 - Motivation (8 min).mp48.25 MB
 8 - 4 - Deterministic Selection - Analysis I [Advanced - Optional] (22 min).mp422.82 MB
 8 - 1 - Randomized Selection - Algorithm (22 min).mp421.4 MB
 8 - 2 - Randomized Selection - Analysis (21 min).mp420.62 MB
 8 - 3 - Deterministic Selection - Algorithm [Advanced - Optional] (17 min).mp417.55 MB
 8 - 5 - Deterministic Selection - Analysis II [Advanced - Optional] (13 min).mp412.83 MB
 slides-algo-select-ranalysis_typed.pdf2.05 MB
 slides-algo-select-ralgorithm_typed.pdf1.94 MB
 9 - 4 - Analysis of Contraction Algorithm (30 min).mp429.87 MB
 9 - 2 - Graph Representations (14 min).mp415.69 MB
 9 - 1 - Graphs and Minimum Cuts (16 min).mp415.21 MB
 9 - 3 - Random Contraction Algorithm (9 min).mp48.28 MB
 9 - 5 - Counting Minimum Cuts (7 min).mp47.41 MB
 9-3.pdf626.84 KB
 9-4.pdf613.31 KB
 9-1.pdf496.72 KB
 9-2.pdf461.31 KB
 slides_algo-karger-counting_typed.pdf279.53 KB
 5 - 2 - Partitioning Around a Pivot (25 min).mp424.84 MB
 5 - 4 - Choosing a Good Pivot (22min).mp421.74 MB
 5 - 4 - Choosing a Good Pivot (22min)_2.mp421.74 MB
 5 - 1 - Quicksort Overview (12 min).mp412.19 MB
 5 - 3 - Correctness of Quicksort [Review - Optional] (11 min).mp411.82 MB
 5 - 3 - Correctness of Quicksort [Review - Optional] (11 min)_2.mp411.82 MB
 6 - 1 - Analysis I A Decomposition Principle [Advanced - Optional] (22 min).mp421.65 MB
 6 - 2 - Analysis II The Key Insight [Advanced - Optional] (12min).mp411.98 MB
 6 - 3 - Analysis III Final Calculations [Advanced - Optional] (9min).mp48.92 MB
 recoded_videos_4.4 scc1 [a7a75b82].mp429.5 MB
 recoded_videos_4.5 Sccanalysis [970d3288].mp426.77 MB
 recoded_videos_4.1 search [8c8d19c3].mp423.25 MB
 recoded_videos_4.3b Topological Sort [ab8e1fef].mp422.08 MB
 recoded_videos_webs1 optional video 1.mp418.63 MB
 recoded_videos_4.2 BFS-basics [7ed1905b].mp414.28 MB
 recoded_videos_4.2c BFS-uc [81cf5c30].mp413.7 MB
 recoded_videos_4.2b BFS-sp [851474ea].mp47.9 MB
 recoded_videos_4.3 DFS-basics [b2b59f7c].mp47.16 MB
 5.pdf3.15 MB
 1 - 3 - Karatsuba Multiplication (13 min).mp421.66 MB
 1 - 8 - Guiding Principles for Analysis of Algorithms (15 min).mp417.99 MB
 1 - 4 - About the Course (17 min).mp417.37 MB
 1 - 2 - Integer Multiplication (9 min).mp416.86 MB
 1 - 6 - Merge Sort Pseudocode (13 min).mp4.mp415.01 MB
 1 - 7 - Merge Sort Analysis (9 min).mp411.31 MB
 1 - 5 - Merge Sort Motivation and Example (9 min).mp410.68 MB
 1 - 1 - Why Study Algorithms (4 min).mp47.98 MB

Description

COURSERA DESC.

In this course you will learn several fundamental principles of algorithm design. You'll learn the divide-and-conquer design paradigm, with applications to fast sorting, searching, and multiplication. You'll learn several blazingly fast primitives for computing on graphs, such as how to compute connectivity information and shortest paths. Finally, we'll study how allowing the computer to "flip coins" can lead to elegant and practical algorithms and data structures. Learn the answers to questions such as: How do data structures like heaps, hash tables, bloom filters, and balanced search trees actually work, anyway? How come QuickSort runs so fast? What can graph algorithms tell us about the structure of the Web and social networks? Did my 3rd-grade teacher explain only a suboptimal algorithm for multiplying two numbers?

Related Torrents

torrent name size seed leech

Sharing Widget


Download torrent
870.78 MB
seeders:0
leechers:0
Algorithms Design and Analysis, Part 1