Algorithms: Design and Analysis - Part 1 [Coursera / Stanford University]

seeders: 22
leechers: 9
Download torrent
Added on December 14, 2014 by diypromoin Other > Tutorials
Torrent verified.


Algorithms: Design and Analysis - Part 1 [Coursera / Stanford University] (Size: 1.24 GB)
 015_algo-closest2_typed.pdf3.88 MB
 023_algo-qsort-partition_typed.pdf3.87 MB
 043_algo-graphs-bfs_typed.pdf2.7 MB
 034_algo-select-danalysis_typed.pdf2.22 MB
 044_algo-graphs-dfs_typed.pdf2.09 MB
 014_algo-closest1_typed.pdf2.08 MB
 032_algo-select-ranalysis_typed.pdf2.05 MB
 042_algo-graphs-search_typed.pdf1.99 MB
 031_algo-select-ralgorithm_typed.pdf1.94 MB
 013_algo-strassen_typed.pdf1.83 MB
 014_3 - 4 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min).srt51.98 KB
 060_16 - 3 - Binary Search Tree Basics, Part II (30 min).srt47.51 KB
 048_10 - 7 - Computing Strong Components_ The Algorithm (29 min).srt46.18 KB
 040_9 - 4 - Analysis of Contraction Algorithm (30 min).srt42.61 KB
 029_7 - 1 - Part I [Review - Optional] (25 min).srt40.88 KB
 054_11 - 4 - Dijkstra's Algorithm_ Implementation and Running Time (26 min).srt40.52 KB
 049_10 - 8 - Computing Strong Components_ The Analysis (26 min).srt39.5 KB
 042_10 - 1 - Graph Search - Overview (23 min).srt38.09 KB
 023_5 - 2 - Partitioning Around a Pivot (25 min).srt36.76 KB
 031_8 - 1 - Randomized Selection - Algorithm (22 min).srt35.55 KB
 014_3 - 4 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min).mp436.22 MB
 060_16 - 3 - Binary Search Tree Basics Part II (30 min).mp429.97 MB
 040_9 - 4 - Analysis of Contraction Algorithm (30 min).mp429.87 MB
 048_10 - 7 - Computing Strong Components The Algorithm (29 min).mp429.5 MB
 049_10 - 8 - Computing Strong Components The Analysis (26 min).mp426.77 MB
 054_11 - 4 - Dijkstras Algorithm Implementation and Running Time (26 min).mp426.46 MB
 068_14 - 2 - Universal Hashing Definition and Example [Advanced - Optional] (26 min).mp426.15 MB
 029_7 - 1 - Part I [Review - Optional] (25 min).mp425.42 MB
 023_5 - 2 - Partitioning Around a Pivot (25 min).mp424.84 MB
 013_3 - 3 - Strassens Subcubic Matrix Multiplication Algorithm (22 min).mp423.57 MB

Description

Publisher: Coursera / Stanford University
Author: Tim Roughgarden
Duration: 6 weeks / 19:33

Video: H263 (MP4), 960:540, 30fps
Audio: mp4a, 44100 Hz, stereo

Get Algorithms: Design and Analysis - Part 2 Here

Description

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
1.24 GB
seeders:22
leechers:9
Algorithms: Design and Analysis - Part 1 [Coursera / Stanford University]

All Comments

TechieAce
Thanks
viru338
Thanks mate :)