17 OCT 2024 - Welcome Back to TorrentFunk!
Get your pirate hat back out. Streaming is dying and torrents are the new trend.
Account Registration works again and so do Torrent Uploads.
We invite you all to start uploading torrents again!

TORRENT DETAILS

Coursera - Algorithms Part 1 (2013)

TORRENT SUMMARY

	Status:	This torrent has NOT been verified.
Category:	Other
Infohash	0dcf2c97893be74b5b2b8234d1a703990c909b46
Size:	1.2 GB in 99 files
Release Date(s):	Torrent Release: 18-10-2014 by user
Swarm:	0 Seeds & 0 Peers
Vote:	No votes yet.

DESCRIPTION

VISITOR COMMENTS (0

)

FILE LIST

Filename		Size
	slides/009_algo-asymptotic3_typed.pdf	989.5 KB
	slides/010_algo-asymptotic4_typed.pdf	822.4 KB
	slides/011_algo-inversions1_typed.pdf	915.1 KB
	slides/013_algo-strassen_typed.pdf	1.8 MB
	slides/014_algo-closest1_typed.pdf	2.1 MB
	slides/015_algo-closest2_typed.pdf	3.9 MB
	slides/018_algo-master3_typed.pdf	855.2 KB
	slides/019_algo-master4_typed.pdf	944.4 KB
	slides/021_algo-master6_typed.pdf	825.7 KB
	slides/022_algo-qsort-intro_typed.pdf	1.3 MB
	slides/023_algo-qsort-partition_typed.pdf	3.9 MB
	slides/024_algo-qsort-correctness_typed.pdf	1 MB
	slides/025_algo-qsort-pivot_typed.pdf	1.5 MB
	slides/026_algo-qsort-analysis1_typed.pdf	1.4 MB
	slides/028_algo-qsort-analysis3_typed.pdf	999.5 KB
	slides/029_algo-prob_review1_typed.pdf	1.5 MB
	slides/030_algo-prob_review2_typed.pdf	1.2 MB
	slides/031_algo-select-ralgorithm_typed.pdf	1.9 MB
	slides/032_algo-select-ranalysis_typed.pdf	2 MB
	slides/033_algo-select-dalgorithm_typed.pdf	1.7 MB
	slides/034_algo-select-danalysis_typed.pdf	2.2 MB
	slides/042_algo-graphs-search_typed.pdf	2 MB
	slides/043_algo-graphs-bfs_typed.pdf	2.7 MB
	slides/044_algo-graphs-dfs_typed.pdf	2.1 MB
	slides/045_algo-graphs-scc_typed.pdf	1.5 MB
	slides/053_algo-ds-heaps-guts_typed.pdf	1 MB
	slides/058_algo-ds-hash-guts_typed.pdf	1.6 MB
	video/001_1 - 1 - Introduction Why Study Algorithms (19 min).mp4	19.1 MB
	video/002_1 - 2 - About the Course (17 min).mp4	17.4 MB
	video/003_1 - 3 - Merge Sort Motivation and Example (9 min).mp4	10.7 MB
	video/004_1 - 4 - Merge Sort Pseudocode (13 min).mp4	15 MB
	video/005_1 - 5 - Merge Sort Analysis (9 min).mp4	11.3 MB
	video/006_1 - 6 - Guiding Principles for Analysis of Algorithms (15 min).mp4	18 MB
	video/007_2 - 1 - Big-Oh Notation (4 min).mp4	4.1 MB
	video/008_2 - 2 - Basic Examples (7 min).mp4	7.3 MB
	video/009_2 - 3 - Big Omega and Theta (7 min).mp4	7.5 MB
	video/010_2 - 4 - Additional Examples [Review - Optional] (8 min).mp4	7.7 MB
	video/011_3 - 1 - O(n log n) Algorithm for Counting Inversions I (13 min).mp4	12.9 MB
	video/012_3 - 2 - O(n log n) Algorithm for Counting Inversions II (17 min).mp4	17.2 MB
	video/013_3 - 3 - Strassens Subcubic Matrix Multiplication Algorithm (22 min).mp4	23.6 MB
	video/014_3 - 4 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min).mp4	36.2 MB
	video/015_3 - 5 - O(n log n) Algorithm for Closest Pair II [Advanced - Optional] (19 min).mp4	20.1 MB
	video/016_4 - 1 - Motivation (8 min).mp4	8.3 MB
	video/017_4 - 2 - Formal Statement (10 min).mp4	10.4 MB
	video/018_4 - 3 - Examples (13 min).mp4	14.4 MB
	video/019_4 - 4 - Proof I (10 min).mp4	11.5 MB
	video/020_4 - 5 - Interpretation of the 3 Cases (11 min).mp4	13.1 MB
	video/021_4 - 6 - Proof II (16 min).mp4	16.6 MB
	video/022_5 - 1 - Quicksort Overview (12 min).mp4	12.2 MB
	video/023_5 - 2 - Partitioning Around a Pivot (25 min).mp4	24.8 MB
	video/024_5 - 3 - Correctness of Quicksort [Review - Optional] (11 min).mp4	11.8 MB
	video/025_5 - 4 - Choosing a Good Pivot (22min).mp4	21.7 MB
	video/026_6 - 1 - Analysis I A Decomposition Principle [Advanced - Optional] (22 min).mp4	21.6 MB
	video/027_6 - 2 - Analysis II The Key Insight [Advanced - Optional] (12min).mp4	12 MB
	video/028_6 - 3 - Analysis III Final Calculations [Advanced - Optional] (9min).mp4	8.9 MB
	video/029_7 - 1 - Part I [Review - Optional] (25 min).mp4	25.4 MB
	video/030_7 - 2 - Part II [Review - Optional] (17 min).mp4	17.3 MB
	video/031_8 - 1 - Randomized Selection - Algorithm (22 min).mp4	21.4 MB
	video/032_8 - 2 - Randomized Selection - Analysis (21 min).mp4	20.6 MB
	video/033_8 - 3 - Deterministic Selection - Algorithm [Advanced - Optional] (17 min).mp4	17.6 MB
	video/034_8 - 4 - Deterministic Selection - Analysis I [Advanced - Optional] (22 min).mp4	22.8 MB
	video/035_8 - 5 - Deterministic Selection - Analysis II [Advanced - Optional] (13 min).mp4	12.8 MB
	video/036_8 - 6 - Omega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional] (13 min).mp4	13.7 MB
	video/037_9 - 1 - Graphs and Minimum Cuts (16 min).mp4	15.2 MB
	video/038_9 - 2 - Graph Representations (14 min).mp4	15.7 MB
	video/039_9 - 3 - Random Contraction Algorithm (9 min).mp4	8.3 MB
	video/040_9 - 4 - Analysis of Contraction Algorithm (30 min).mp4	29.9 MB
	video/041_9 - 5 - Counting Minimum Cuts (7 min).mp4	7.4 MB
	video/042_10 - 1 - Graph Search - Overview (23 min).mp4	23.3 MB
	video/043_10 - 2 - Breadth-First Search (BFS) The Basics (14 min).mp4	14.3 MB
	video/044_10 - 3 - BFS and Shortest Paths (8 min).mp4	7.9 MB
	video/045_10 - 4 - BFS and Undirected Connectivity (13 min).mp4	13.7 MB
	video/046_10 - 5 - Depth-First Search (DFS) The Basics (7 min).mp4	7.2 MB
	video/047_10 - 6 - Topological Sort (22 min).mp4	22.1 MB
	video/048_10 - 7 - Computing Strong Components The Algorithm (29 min).mp4	29.5 MB
	video/049_10 - 8 - Computing Strong Components The Analysis (26 min).mp4	26.8 MB
	video/050_10 - 9 - Structure of the Web [Optional] (19 min).mp4	18.6 MB
	video/051_11 - 1 - Dijkstras Shortest-Path Algorithm (21 min).mp4	21 MB
	video/052_11 - 2 - Dijkstras Algorithm Examples (13 min).mp4	12.9 MB
	video/053_11 - 3 - Correctness of Dijkstras Algorithm [Advanced - Optional] (19 min).mp4	20.3 MB
	video/054_11 - 4 - Dijkstras Algorithm Implementation and Running Time (26 min).mp4	26.5 MB
	video/055_12 - 1 - Data Structures Overview (5 min).mp4	4.7 MB
	video/056_12 - 2 - Heaps Operations and Applications (18 min).mp4	18.6 MB
	video/057_12 - 3 - Heaps Implementation Details [Advanced - Optional] (21 min).mp4	20.9 MB
	video/058_16 - 1 - Balanced Search Trees Operations and Applications (11 min).mp4	11 MB
	video/059_16 - 2 - Binary Search Tree Basics Part I (13 min).mp4	13.3 MB
	video/060_16 - 3 - Binary Search Tree Basics Part II (30 min).mp4	30 MB
	video/061_16 - 4 - Red-Black Trees (21 min).mp4	21.8 MB
	video/062_16 - 5 - Rotations [Advanced - Optional] (8 min).mp4	10.3 MB
	video/063_16 - 6 - Insertion in a Red-Black Tree [Advanced] (15 min).mp4	20.8 MB
	video/064_13 - 1 - Hash Tables Operations and Applications (19 min).mp4	19.7 MB
	video/065_13 - 2 - Hash Tables Implementation Details Part I (19 min).mp4	19.9 MB
	video/066_13 - 3 - Hash Tables Implementation Details Part II (22 min).mp4	22.5 MB
	video/067_14 - 1 - Pathological Data Sets and Universal Hashing Motivation (22 min).mp4	22.5 MB
	video/068_14 - 2 - Universal Hashing Definition and Example [Advanced - Optional] (26 min).mp4	26.2 MB
	video/069_14 - 3 - Universal Hashing Analysis of Chaining [Advanced - Optional] (19 min).mp4	18.5 MB
	video/070_14 - 4 - Hash Table Performance with Open Addressing [Advanced - Optional] (16 min).mp4	15.6 MB
	video/071_15 - 1 - Bloom Filters The Basics (16 min).mp4	15.4 MB
	video/072_15 - 2 - Bloom Filters Heuristic Analysis (13 min).mp4	13.6 MB

RELATED DOWNLOADS

Torrent Name

Added

Size

Seeds

Peers

Uploader

Health