Intro to Algorithms
UdacityFree
Important information
 Course
 Online
 When:
Flexible
This class will give you an introduction to the design and analysis of algorithms, enabling you to analyze networks and discover how individuals are connected.
Starts  Location 

Flexible 
Online

What you'll learn on the course
Networks  Works  Algorithms  Design  
Magic Trick 
Course programme
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
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
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
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
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
 FloydWarshall Intro
 Randomizing Clustering Coefficient
 Bounds on the Estimate
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
 Nondeterministic Polynomial Time Decidable Problem
 Clique Problem in NP
 Find the Strangers
 Graph Coloring is NPComplete

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

Interview with Tina EliassiRad (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