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.
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.
Objective: Become familiar with Algorithm Analysis.
Objective: Use mathematical tools to analyze how things are connected.
Objective: Find the quickest route to Kevin Bacon.
Objective: Learn to keep track of your Best Friends using heaps.
Objective: Work with Social Networks that have edge weights.
Objective: Explore what it means for a Social Network problem to be "harder" than other.
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