Udacity - Intro To Algorithms (2015)

http://pan.baidu.com/s/1gdtxlUN 密码: sd2w

Udacity - Intro to Algorithms (2015)
MP4 | AVC 1005kbps | English | 852x480 | 29.97fps | 6 hours | AAC stereo 96kbps | 3.28 GB
Genre: Video Training
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. 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 PathCorrectness of Na?veRussian Peasants AlgorithmMeasuring TimeSteps for Naive, Steps for RussianDivide and Conquer
Lesson 2: Growth Rates in Social Networks
Objective: Use mathematical tools to analyze how things are connected.
Chain, Ring and Grid NetworksBig ThetaPlanar GraphsNodes, Edges, RegionsGrowth Rate of Edges in Planar GraphHypercubeRandomly Generated GraphsN SquaredTangled Hypercube
Lesson 3: Basic Graph Algorithms
Objective: Find the quickest route to Kevin Bacon.
Properties of Social NetworksClustering CoefficientConnected ComponentsRunning Time of Connected ComponentsChecking Pairwise ConnectivityPairwise Shortest PathDepth vs. Breadth First SearchRecursion ReplacementMarvel “Social” NetworkFinding Bridge Edges
Lesson 4: It’s Who You Know
Objective: Learn to keep track of your Best Friends using heaps.
Degree CentralityTop K Via PartitioningThree Partitioning CasesProperties of a HeapPatch Up a HeapDown HeapifyHeap Sort
Lesson 5: Strong and Weak Bonds
Objective: Work with Social Networks that have edge weights.
Make a TreeStrength of ConnectionsWeighted Social NetworksHow to Find the Shortest PathDijkstra’s Shortest Path AlgorithmFloyd-Warshall IntroRandomizing Clustering CoefficientBounds on the Estimate

Lesson 6: Hardness of Network Problems
Objective: Explore what it means for a Social Network problem to be "harder" than other.
TetristanExponential Running TimeDegrees of HardnessReduction: Long and Simple PathPolynomial Time Decidable ProblemsNon-deterministic Polynomial Time Decidable ProblemClique Problem in NPFind the StrangersGraph 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