PREMIUM ACCOUNTS

Support downtopc by buying or renewing your premium account using below links:







Partners
warezload

movieblogarea download
katzdownload

Design and Analysis of Algorithms I

Category: Courses / Others
Author: AD-TEAM
Date added: 18.12.2024 :23:19
Views: 0
Comments: 0










Description material
Design and Analysis of Algorithms I
768.39 MB | 31min 46s | webm | 960X540 | 16:9
Genre:eLearning |Language:English



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



Join to our telegram Group
Information
Users of Guests are not allowed to comment this publication.
Choose Site Language
Keep downtopc Online Please

PREMIUM ACCOUNTS

Support downtopc by buying or renewing your premium account using below links: