Udacity - Intro to Algorithms Videos

seeders: 0
leechers: 4
Added on November 19, 2015 by hichysin Other > Tutorials
Torrent verified.



Udacity - Intro to Algorithms Videos (Size: 3.28 GB)
 1 - Top Two.mp413.38 MB
 06 - Names And Boxes Problem.srt10.94 KB
 12 - Getting To Point B.srt10.56 KB
 08 - Statistical Measures In Networks.srt8.69 KB
 16 - Social Algorithms.srt8.09 KB
 02 - Spy Control Setup.srt6.27 KB
 20 - Duncan Watts.srt5.37 KB
 05 - Puzzles and Algorithms.srt5.22 KB
 11 - Social Networks In Security And Politics.srt5.11 KB
 15 - Practical Algorithms.srt4.14 KB
 22 - Pathway That Can Use Two Nodes.srt3.56 KB
 28 - Bridge Edges.srt8.95 KB
 30 - Finding Bridge Edges.srt8.52 KB
 24 - BFS Code.srt7.33 KB
 17 - Recursion Replacement.srt6.62 KB
 11 - Connected Components Code.srt6.61 KB
 05 - Clustering Coefficient.srt5.91 KB
 15 - Pairwise Shortest Path.srt5.69 KB
 12 - Running Time of Connected Component.srt5.17 KB
 03 - Properties of Social Networks.srt4.72 KB
 04 - Properties of Social Networks.srt4.64 KB
 25 - Randomizing Clustering Coefficient.srt7.89 KB
 11 - How to Find the Shortest Path.srt7.87 KB
 07 - Matrix Multiplication.srt6.18 KB
 27 - Bounds on the Estimate.srt5.57 KB
 15 - Code for Dijkstra.srt5.55 KB
 20 - Using Heaps.srt5.19 KB
 24 - Floyd-Warshall.srt5.09 KB
 06 - Strength of Connections.srt4.78 KB
 23 - Floyd-Warshall Intro.srt4.62 KB
 08 - Weighted Social Networks.srt4.24 KB
 41 - Gadgets.srt7.67 KB
 36 - Reduce 3-Colorability to SAT.srt5.58 KB
 14 - Reduction Long and Simple Path.srt5.11 KB
 17 - Accepting Certificate.srt4.6 KB
 40 - Making a SAT graph.srt4.45 KB
 06 - Degrees of Hardness.srt4.38 KB
 44 - Coloring Planar Graphs.srt4.22 KB
 27 - Find the Strangers.srt4 KB
 23 - Exponential Upperbound.srt3.94 KB
 10 - Decision Problems.srt3.82 KB
 02 - Magic Trick.srt6.42 KB
 07 - Case Study.srt5.23 KB
 28 - Divide And Conquer.srt5.01 KB
 09 - Correctness Naive.srt4.95 KB
 06 - Algorithms Are Cool.srt4.94 KB
 05 - Eulerian Path Solution.srt4.45 KB
 04 - Eulerian Path.srt4.41 KB
 03 - Magic Trick.srt4.24 KB
 15 - Correctness Russian.srt4.03 KB
 14 - Example.srt3.88 KB
 06 - Ring Network.srt6.16 KB
 37 - Tangled Hypercube Solution.srt5.06 KB
 12 - Big-Theta Examples.srt4.47 KB
 35 - N Squared.srt4.39 KB
 24 - Hypercube.srt4.14 KB
 20 - Eulers Formula.srt3.97 KB
 29 - Randomly Generated Graphs.srt3.96 KB
 04 - Chain Network.srt3.14 KB
 08 - Grid Network Solution.srt3.14 KB
 23 - Complete Graph Solution.srt2.97 KB
 2 - Subsets.srt6.14 KB
 5 - Combination Locks.srt2.89 KB
 6 - Make A Combination Lock.srt1.16 KB
 7 - Erdos Renyi.srt1.13 KB
 4 - Planar Graphs.srt828 bytes
 3 - Function Comparision.srt654 bytes
 1 - Star Network.srt423 bytes
 27 - Analysis Of Top K.srt5.86 KB
 41 - Down Heapify.srt5.81 KB
 19 - Top K Problem.srt5.33 KB
 21 - Randomized Top K.srt5.07 KB
 50 - Inserting Elements.srt4.16 KB
 02 - Introduction.srt3.88 KB
 44 - Build Heap.srt3.83 KB
 30 - Heaps Of Fun Solution.srt3.57 KB
 20 - Top K Problem Solution.srt3.44 KB
 03 - Introduction Solution.srt3.4 KB
 06 - Create Graph With Eulerian Tour Solution.srt3.5 KB
 02 - Eulerian Path Solution.srt1.26 KB
 15 - Clique Solution.srt1.12 KB
 17 - General Clique Solution.srt1.1 KB
 04 - Counting Eulerian Paths Solution.srt1 KB
 18 - Challenge Find Eulerian Tour.srt893 bytes
 07 - Representing A Graph.srt820 bytes
 05 - Create Graph With Eulerian Tour.srt808 bytes
 11 - Recursive Naive Solution.srt601 bytes
 08 - Naive Multiplication Algorithm.srt433 bytes
 1 - Top Two.srt3.13 KB
 2 - Recurrence Relation.srt2.5 KB
 3 - Subsets.srt1.46 KB
 1 - Star Network.srt669 bytes
 6 - Combination Locks.srt503 bytes
 4 - Function Comparision.srt384 bytes
 5 - Planar Graphs.srt348 bytes
 7 - Make A Combination Lock.srt328 bytes
 8 - Erdos-Renyi.srt190 bytes
 02 - Magic Trick.mp430.01 MB
 09 - Correctness Naive.mp426.44 MB
 28 - Divide And Conquer.mp423.08 MB
 04 - Eulerian Path.mp422.19 MB
 07 - Case Study.mp421.54 MB
 15 - Correctness Russian.mp420.12 MB
 06 - Algorithms Are Cool.mp419.25 MB
 05 - Eulerian Path Solution.mp418.72 MB
 03 - Magic Trick.mp417.95 MB
 14 - Example.mp417.75 MB
 06 - Ring Network.mp429.82 MB
 12 - Big-Theta Examples.mp422.88 MB
 37 - Tangled Hypercube Solution.mp421.78 MB
 35 - N Squared.mp419.43 MB
 24 - Hypercube.mp417.91 MB
 20 - Eulers Formula.mp416.89 MB
 09 - Big-Theta.mp415.97 MB
 29 - Randomly Generated Graphs.mp415.94 MB
 08 - Grid Network Solution.mp415.2 MB
 04 - Chain Network.mp413.33 MB
 28 - Bridge Edges.mp443.37 MB
 30 - Finding Bridge Edges.mp438.98 MB
 24 - BFS Code.mp435.12 MB
 17 - Recursion Replacement.mp432.1 MB
 15 - Pairwise Shortest Path.mp429.93 MB
 05 - Clustering Coefficient.mp428.95 MB
 03 - Properties of Social Networks.mp427.95 MB
 11 - Connected Components Code.mp427.65 MB
 04 - Properties of Social Networks.mp425.06 MB
 12 - Running Time of Connected Component.mp424.51 MB
 41 - Down Heapify.mp433.52 MB
 27 - Analysis Of Top K.mp432.73 MB
 19 - Top K Problem.mp430.61 MB
 21 - Randomized Top K.mp429.25 MB
 50 - Inserting Elements.mp421.16 MB
 02 - Introduction.mp420.99 MB
 20 - Top K Problem Solution.mp420.97 MB
 44 - Build Heap.mp420.76 MB
 25 - Three Partitioning Cases.mp419.99 MB
 30 - Heaps Of Fun Solution.mp418.78 MB
 11 - How to Find the Shortest Path.mp438.41 MB
 25 - Randomizing Clustering Coefficient.mp435.7 MB
 07 - Matrix Multiplication.mp428.83 MB
 24 - Floyd-Warshall.mp425.9 MB
 15 - Code for Dijkstra.mp425.29 MB
 20 - Using Heaps.mp424.91 MB
 27 - Bounds on the Estimate.mp424.6 MB
 23 - Floyd-Warshall Intro.mp422.33 MB
 06 - Strength of Connections.mp420.91 MB
 08 - Weighted Social Networks.mp417.56 MB
 41 - Gadgets.mp441.22 MB
 36 - Reduce 3-Colorability to SAT.mp433.04 MB
 14 - Reduction Long and Simple Path.mp430.96 MB
 40 - Making a SAT graph.mp427.2 MB
 17 - Accepting Certificate.mp426.96 MB
 06 - Degrees of Hardness.mp423.72 MB
 44 - Coloring Planar Graphs.mp422.95 MB
 27 - Find the Strangers.mp422.13 MB
 10 - Decision Problems.mp421.76 MB
 23 - Exponential Upperbound.mp421.75 MB
 22 - Pathway That Can Use Two Nodes.mp432.77 MB
 06 - Create Graph With Eulerian Tour Solution.mp413.07 MB
 17 - General Clique Solution.mp46.38 MB
 15 - Clique Solution.mp45.99 MB
 04 - Counting Eulerian Paths Solution.mp44.83 MB
 02 - Eulerian Path Solution.mp44.81 MB
 18 - Challenge Find Eulerian Tour.mp43.32 MB
 05 - Create Graph With Eulerian Tour.mp42.99 MB
 07 - Representing A Graph.mp42.87 MB
 11 - Recursive Naive Solution.mp42.63 MB
 09 - Naive Multiplication Algorithm Solution.mp42.09 MB
 2 - Recurrence Relation.mp412 MB
 3 - Subsets.mp47.55 MB
 1 - Star Network.mp42.79 MB
 6 - Combination Locks.mp42.46 MB
 4 - Function Comparision.mp42.41 MB
 5 - Planar Graphs.mp42.06 MB
 7 - Make A Combination Lock.mp41.66 MB
 8 - Erdos-Renyi.mp41.53 MB
 2 - Subsets.mp440.25 MB
 5 - Combination Locks.mp419.17 MB
 7 - Erdos Renyi.mp46.21 MB
 3 - Function Comparision.mp45.67 MB
 6 - Make A Combination Lock.mp45.62 MB
 4 - Planar Graphs.mp45.46 MB
 1 - Star Network.mp43.01 MB
 2 - Bipartite I.mp45.22 MB
 8 - Eulerian Tour Revisited.mp43.87 MB
 1 - Clustering Coefficient.mp43.23 MB
 7 - Centrality.mp42.81 MB
 4 - Bipartite III.mp41.06 MB
 6 - Mark Component.mp41.05 MB
 5 - Bipartite IV.mp4984.67 KB
 3 - Bipartite II.mp4531.78 KB
 1 - Clustering Coefficient.mp48.48 MB
 4 - Bipartite III.mp47.61 MB
 3 - Bipartite II.mp45.52 MB
 2 - Bipartite I.mp44.61 MB
 5 - Bipartite IV.mp43.33 MB
 7 - Centrality.mp4680 KB
 6 - Mark Component.mp4680 KB
 8 - Bridge Edges.mp4680 KB
 1 - Build a Heap.mp41.53 MB
 2 - Up Heapify.mp418.88 MB
 3 - Actor Centrality.mp48.81 MB

Description

image
Course Summary

Ever played the Kevin Bacon game? This class will show you how it works by giving you an introduction to the design and analysis of algorithms, enabling you to discover how individuals are connected.

Why Take This Course?

By the end of this class you will understand key concepts needed to devise new algorithms for graphs and other important data structures and to evaluate the efficiency of these algorithms.

Prerequisites and Requirements

This class assumes an understanding of programming at the level of CS101, including the ability to read and write short programs in Python; it also assumes a comfort level with mathematical notation at the level of high school Algebra II or the SATs.

See the Technology Requirements for using Udacity.

What Will I Learn?

Syllabus

Lesson 1: A Social Network Magic Trick

Objective: Become familiar with Algorithm Analysis.

Eulerian Path
Correctness of Naïve
Russian Peasants Algorithm
Measuring Time
Steps for Naive, Steps for Russian
Divide and Conquer
Lesson 2: Growth Rates in Social Networks

Objective: Use mathematical tools to analyze how things are connected.

Chain, Ring and Grid Networks
Big Theta
Planar Graphs
Nodes, Edges, Regions
Growth Rate of Edges in Planar Graph
Hypercube
Randomly Generated Graphs
N Squared
Tangled Hypercube
Lesson 3: Basic Graph Algorithms

Objective: Find the quickest route to Kevin Bacon.

Properties of Social Networks
Clustering Coefficient
Connected Components
Running Time of Connected Components
Checking Pairwise Connectivity
Pairwise Shortest Path
Depth vs. Breadth First Search
Recursion Replacement
Marvel “Social” Network
Finding Bridge Edges
Lesson 4: It’s Who You Know

Objective: Learn to keep track of your Best Friends using heaps.

Degree Centrality
Top K Via Partitioning
Three Partitioning Cases
Properties of a Heap
Patch Up a Heap
Down Heapify
Heap Sort
Lesson 5: Strong and Weak Bonds

Objective: Work with Social Networks that have edge weights.

Make a Tree
Strength of Connections
Weighted Social Networks
How to Find the Shortest Path
Dijkstra’s Shortest Path Algorithm
Floyd-Warshall Intro
Randomizing Clustering Coefficient
Bounds on the Estimate
Lesson 6: Hardness of Network Problems

Objective: Explore what it means for a Social Network problem to be "harder" than other.

Tetristan
Exponential Running Time
Degrees of Hardness
Reduction: Long and Simple Path
Polynomial Time Decidable Problems
Non-deterministic Polynomial Time Decidable Problem
Clique Problem in NP
Find the Strangers
Graph Coloring is NP-Complete
Lesson 7: Review and Application

Interview with Peter Winker (Professor, Dartmouth College) on Names and Boxes Problem && Puzzles and Algorithms

Interview with Tina Eliassi-Rad (Professor, Rutgers University) on Statistical Measures in Network && Social Networks in Security and Protests

Interview with Andrew Goldberg (Principal Researcher, Microsoft Research) on Practical Algorithms

Interview with Vukosi Marivate (Graduate Student, Rutgers University) on Social Algorithms

Interview with Duncan Watts (Principal Researcher, Microsoft) on Pathway That Can Use Two Nodes

Intro to Graph Search Animation

Instructors & Partners


▸ Michael Littman
INSTRUCTOR


image

Sharing Widget


Download torrent
3.28 GB
seeders:0
leechers:4
Udacity - Intro to Algorithms Videos