Design and Analysis of Algorithms I - Algorithms and Data Structures I [2012, ENG]

seeders: 7 leechers: 1
Added 14 years ago by intellect in Other
Downloaded 0 time.
RuTracker.org
Design and Analysis of Algorithms I - Algorithms and Data Structures I [2012, ENG]

Torrent Contents Size: 768.39 MB

Design and Analysis of Algorithms I - Algorithms and Data Structures I [2012, ENG]
I. INTRODUCTION (Week 1)
1 Introduction Why Study Algorithms (19 min).webm
WEBM
13.77 MB
2 About the Course (17 min).webm
WEBM
12.07 MB
3 Merge Sort Motivation and Example (9 min).webm
WEBM
8.96 MB
4 Merge Sort Pseudocode (13 min).webm
WEBM
13.36 MB
5 Merge Sort Analysis (9 min).webm
WEBM
10.25 MB
6 Guiding Principles for Analysis of Algorithms (15 min).webm
WEBM
13.79 MB
II. ASYMPTOTIC ANALYSIS (Week 1)
1 Big-Oh Notation (4 min).webm
WEBM
3.14 MB
2 Basic Examples (7 min).webm
WEBM
5.65 MB
3 Basic Examples (7 min).webm
WEBM
5.85 MB
4 Additional Examples [Review - Optional] (8 min).webm
WEBM
6.23 MB
III. DIVIDE & CONQUER ALGORITHMS (Week 1)
1 O(n log n) Algorithm for Counting Inversions I (13 min).webm
WEBM
10 MB
2 O(n log n) Algorithm for Counting Inversions II (17 min).webm
WEBM
14.41 MB
3 Strassen's Subcubic Matrix Multiplication Algorithm (22 min).webm
WEBM
16.18 MB
4 O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min).webm
WEBM
23.76 MB
5 O(n log n) Algorithm for Closest Pair II [Advanced - Optional] (19 min).webm
WEBM
14.92 MB
IV. THE MASTER METHOD (Week 2)
1 Motivation (8 min).webm
WEBM
6.59 MB
2 Formal Statement (10 min).webm
WEBM
8.95 MB
3 Examples (13 min).webm
WEBM
10.44 MB
4 Proof I (10 min).webm
WEBM
9.34 MB
5 Interpretation of the 3 Cases (11 min).webm
WEBM
10.11 MB
6 Proof II (16 min).webm
WEBM
12.38 MB
IX. GRAPHS AND THE CONTRACTION ALGORITHM (Week 3)
1 Graphs and Minimum Cuts (16 min).webm
WEBM
11.44 MB
2 Graph Representations (14 min).webm
WEBM
10.54 MB
3 Random Contraction Algorithm (9 min).webm
WEBM
6.24 MB
4 Analysis of Contraction Algorithm (30 min).webm
WEBM
22.2 MB
5 Counting Minimum Cuts [Advanced - Optional] (7 min).webm
WEBM
5.46 MB
V. QUICKSORT - ALGORITHM (Week 2)
1 Quicksort- Overview (12 min).webm
WEBM
6.37 MB
2 Partitioning Around a Pivot (25 min).webm
WEBM
17.9 MB
3 Correctness of Quicksort [Review - Optional] (11 min).webm
WEBM
8.95 MB
4 Choosing a Good Pivot (22min).webm
WEBM
15.72 MB
VI. QUICKSORT - ANALYSIS (Week 2)
1 Analysis I- A Decomposition Principle [Advanced - Optional] (22 min).webm
WEBM
15.79 MB
2 Analysis II- The Key Insight [Advanced - Optional] (12min).webm
WEBM
8.58 MB
3 Analysis III- Final Calculations [Advanced - Optional] (9min).webm
WEBM
6.24 MB
VII. PROBABILITY REVIEW (Weeks 2-3)
1 Part I [Review - Optional] (25 min).webm
WEBM
18.81 MB
2 Part II [Review - Optional] (17 min).webm
WEBM
12.88 MB
VIII. LINEAR-TIME SELECTION (Week 3)
1 Randomized Selection - Algorithm (22 min).webm
WEBM
16.34 MB
2 Randomized Selection - Analysis (21 min).webm
WEBM
14.33 MB
3 Deterministic Selection - Algorithm [Advanced - Optional] (17 min).webm
WEBM
13.38 MB
4 Deterministic Selection - Analysis I [Advanced - Optional] (22 min).webm
WEBM
16.32 MB
5 Deterministic Selection - Analysis II [Advanced - Optional] (13 min).webm
WEBM
9.54 MB
6 Omega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional] (13 min).webm
WEBM
9.8 MB
X. GRAPH SEARCH AND CONNECTIVITY (Week 4)
1 Graph Search - Overview (23 min).webm
WEBM
16.42 MB
2 Breadth-First Search (BFS)- The Basics (14 min).webm
WEBM
10.43 MB
3 BFS and Shortest Paths (8 min).webm
WEBM
5.48 MB
4 BFS and Undirected Connectivity (13 min).webm
WEBM
10.59 MB
5 Depth-First Search (DFS) The Basics (7 min).webm
WEBM
5.39 MB
6 Topological Sort (22 min).webm
WEBM
15.57 MB
7 Computing Strong Components- The Algorithm (29 min).webm
WEBM
22.21 MB
8 Computing Strong Components- The Analysis (26 min).webm
WEBM
18.94 MB
9 Structure of the Web [Optional] (19 min).webm
WEBM
13.4 MB
XI. DIJKSTRA'S SHORTEST-PATH ALGORITHM (Week 5)
1 Dijkstra's Shortest-Path Algorithm (21 min).webm
WEBM
15.11 MB
2 Dijkstra's Algorithm- Examples (13 min).webm
WEBM
9.15 MB
3 Correctness of Dijkstra's Algorithm [Advanced - Optional] (19 min).webm
WEBM
14.21 MB
4 Dijkstra's Algorithm- Implementation and Running Time (26 min).webm
WEBM
20.3 MB
XII. DATA STRUCTURES (Week 5)
1 Data Structures- Overview (5 min).webm
WEBM
3.42 MB
2 Heaps- Operations and Applications (18 min).webm
WEBM
13.64 MB
3 Heaps- Implementation Details [Advanced - Optional] (21 min).webm
WEBM
15.84 MB
4 Hash Tables- Operations and Applications (19 min).webm
WEBM
14.94 MB
5 Hash Tables- Implementation Details, Part I (19 min).webm
WEBM
13.86 MB
6 Hash Tables- Implementation Details, Part I (19 min).webm
WEBM
16.78 MB
7 Universal Hashing- Motivation [Optional] (22 min).webm
WEBM
16.7 MB
8 Universal Hashing- The Mathematics, Part I [Optional] (27 min).webm
WEBM
19.03 MB

Description

Related Torrents

Location

Trackers

Tracker name
http://bt.t-ru.org/ann?magnet
http://bt1.t-ru.org/ann
http://bt2.t-ru.org/ann
http://bt4.t-ru.org/ann
udp://tracker.opentrackr.org:1337
udp://open.stealth.si:80/announce
udp://tracker.torrent.eu.org:451/announce
udp://exodus.desync.com:6969
udp://open.demonii.com:1337/announce
udp://tracker.coppersurfer.tk:6969
udp://p4p.arenabg.com:1337
udp://tracker.internetwarriors.net:1337
Torrent hash: