Have you ever played Kevin Bacon game? The course provides an extensive lesson about algorithms and shows you how the game works. You will also be able to explore how individuals are connected.

In the course, you will be familiar with Algorithm Analysis, and able to use mathematical tools to analyse how things are connected. Then the course teaches you the basic Graph Algorithms where you will explore the quickest route to Kevin Bacon. Next, you will know how to keep track of your Best Friends using heaps.

Upon completion, you will be able to analyse the efficiency of the above mention algorithms.

**Assessment**

This course does not involve any written exams. Students need to answer 5 assignment questions to complete the course, the answers will be in the form of written work in pdf or word. Students can write the answers in their own time. Each answer need to be 200 words (1 Page). Once the answers are submitted, the tutor will check and assess the work.

**Certification**

Edukite courses are free to study. To successfully complete a course you must submit all the assignment of the course as part of assessment. Upon successful completion of a course, you can choose to make your achievement formal by obtaining your Certificate at a cost of £49.

Having an Official Edukite Certification is a great way to celebrate and share your success. You can:

- Add the certificate to your CV or resume and brighten up your career
- Show it to prove your success

Course Credit: Udacity

### Course Curriculum

A Social Network Magic Trick | |||

Introduction | 00:01:00 | ||

Magic Trick | 00:04:00 | ||

Eulerian Path | 00:03:00 | ||

Algorithms Are Cool | 00:02:00 | ||

Case Study | 00:03:00 | ||

Correctness: Naive | 00:03:00 | ||

Running Time | 00:02:00 | ||

Russian Peasants Algorithm | 00:01:00 | ||

Example | 00:02:00 | ||

Correctness: Russian | 00:03:00 | ||

How Many Additions | 00:01:00 | ||

Which Is Faster | 00:01:00 | ||

Measuring Time | 00:02:00 | ||

Counting Steps | 00:02:00 | ||

Steps For Naive | 00:01:00 | ||

Halving | 00:02:00 | ||

Steps For Russian | 00:02:00 | ||

Divide And Conquer | 00:03:00 | ||

Recurrence Relation | 00:02:00 | ||

Problem Set 1 | |||

Eulerian Path | 00:01:00 | ||

Counting Eulerian Paths | 00:01:00 | ||

Create Graph With Eulerian Tour | 00:01:00 | ||

Representing A Graph | 00:01:00 | ||

Naive Multiplication Algorithm | 00:01:00 | ||

Recursive Naive | 00:01:00 | ||

Russian Multiplication Algorithm | 00:01:00 | ||

Clique | 00:01:00 | ||

General Clique | 00:01:00 | ||

Challenge Find Eulerian Tour | 00:01:00 | ||

Growth Rates in Social Networks | |||

Recap | 00:01:00 | ||

Introduction | 00:01:00 | ||

Divisible By Five | 00:01:00 | ||

Chain Network | 00:02:00 | ||

Ring Network | 00:04:00 | ||

Grid Network | 00:01:00 | ||

Big-Theta | 00:02:00 | ||

Big-Theta Reflexive | 00:01:00 | ||

Big-Theta Examples | 00:03:00 | ||

Other sets of Functions | 00:01:00 | ||

Big-Theta Practice | 00:01:00 | ||

Planar Graphs | 00:02:00 | ||

Nodes, Edges, Regions | 00:01:00 | ||

Regions In A Planar Graph | 00:01:00 | ||

Eulers Formula | 00:02:00 | ||

Growth Rates | 00:01:00 | ||

Complete Graph | 00:01:00 | ||

Hypercube | 00:02:00 | ||

Hypercube Edges | 00:01:00 | ||

Tree Graphs | 00:01:00 | ||

Randomly Generated Graphs | 00:02:00 | ||

Recursive Graphs | 00:01:00 | ||

Recurrence Relation | 00:01:00 | ||

Number Of Edges | 00:01:00 | ||

N Squared | 00:02:00 | ||

Tangled Hypercube | 00:01:00 | ||

Problem Set 2 | |||

Star Network | 00:01:00 | ||

Recurrence Relation | 00:02:00 | ||

Subsets | 00:01:00 | ||

Function Comparision | 00:01:00 | ||

Planar Graphs | 00:01:00 | ||

Combination Locks | 00:01:00 | ||

Make A Combination Lock | 00:01:00 | ||

Erdos-Renyi | 00:01:00 | ||

Problem Set 2 Solution | |||

Star Network | 00:01:00 | ||

Subsets | 00:05:00 | ||

Function Comparision | 00:01:00 | ||

Planar Graphs | 00:01:00 | ||

Combination Locks | 00:03:00 | ||

Make A Combination Lock | 00:01:00 | ||

Erdos Renyi | 00:01:00 | ||

Basic Graph Algorithms | |||

Initial Foray | 00:01:00 | ||

Properties of Social Networks | 00:04:00 | ||

Clustering Coefficient | 00:04:00 | ||

Clustering Coefficient Quiz | 00:01:00 | ||

Clustering Coefficient Code | 00:02:00 | ||

Connected Components | 00:01:00 | ||

Connected Components Code | 00:04:00 | ||

Running Time of Connected Component | 00:03:00 | ||

Checking Pairwise Connectivity | 00:01:00 | ||

Pairwise Shortest Path | 00:04:00 | ||

Depth vs Breadth First Search | 00:02:00 | ||

Recursion Replacement | 00:04:00 | ||

Depth First without Recursion | 00:01:00 | ||

Breadth First without Recursion | 00:02:00 | ||

Searching a Tree | 00:01:00 | ||

Marvel “Social” Network | 00:01:00 | ||

BFS Code | 00:04:00 | ||

Single Source Shortest Paths | 00:03:00 | ||

Centrality | 00:03:00 | ||

Bridge Edges | 00:06:00 | ||

Finding Bridge Edges | 00:05:00 | ||

Proof | 00:03:00 | ||

Problem Set 3 | |||

Clustering Coefficient | 00:01:00 | ||

Bipartite I | 00:01:00 | ||

Bipartite II | 00:01:00 | ||

Bipartite III | 00:01:00 | ||

Bipartite IV | 00:01:00 | ||

Mark Component | 00:01:00 | ||

Centrality | 00:01:00 | ||

Eulerian Tour Revisited | 00:01:00 | ||

Problem Set 3 Solution | |||

Clustering Coefficient | 00:01:00 | ||

Bipartite I | 00:01:00 | ||

Bipartite II | 00:01:00 | ||

Bipartite III | 00:01:00 | ||

Bipartite IV | 00:01:00 | ||

Mark Component | 00:01:00 | ||

Centrality | 00:01:00 | ||

Bridge Edges | 00:01:00 | ||

It's Who You Know | |||

Welcome | 00:01:00 | ||

Introduction | 00:03:00 | ||

Types Of Centrality | 00:01:00 | ||

Degree Centrality | 00:01:00 | ||

Computing Statistics | 00:01:00 | ||

Types Of Statistics | 00:01:00 | ||

Statistics By Sorting | 00:01:00 | ||

Statistics On Unsorted Lists | 00:02:00 | ||

Mean | 00:01:00 | ||

Extreme Values | 00:02:00 | ||

Order Statistics | 00:02:00 | ||

Code For 2nd Highest | 00:02:00 | ||

Top K Problem | 00:04:00 | ||

Randomized Top K | 00:04:00 | ||

Partitioning Around V | 00:02:00 | ||

Top K Via Partitioning | 00:02:00 | ||

Three Partitioning Cases | 00:03:00 | ||

Top K Code | 00:02:00 | ||

Analysis Of Top K | 00:04:00 | ||

Top K Summary | 00:02:00 | ||

Heaps Of Fun | 00:02:00 | ||

Heap Height | 00:02:00 | ||

Properties Of A Heap | 00:01:00 | ||

Heap Number | 00:01:00 | ||

Establishing The Heap Property | 00:02:00 | ||

Patch Up A Heap | 00:01:00 | ||

Down Heapify | 00:04:00 | ||

Running Time Of Down Heapify | 00:01:00 | ||

Build Heap | 00:02:00 | ||

Remove Min | 00:02:00 | ||

Heap Sort | 00:01:00 | ||

Heap Sort Performance | 00:01:00 | ||

Inserting Elements | 00:03:00 | ||

Problem Set 4 | |||

Build a Heap | 00:01:00 | ||

Problem Set 4 Solution | |||

Finding the Mode | 00:04:00 | ||

Up Heapify | 00:02:00 | ||

Actor Centrality | 00:03:00 | ||

Strong and Weak Bonds | |||

Introduction | 00:01:00 | ||

Save the Turtles | 00:02:00 | ||

Make a Tree | 00:01:00 | ||

Strength of Connections | 00:02:00 | ||

Matrix Multiplication | 00:04:00 | ||

Weighted Social Networks | 00:02:00 | ||

How to Find the Shortest Path | 00:05:00 | ||

How to Find the Shortest Path | 00:05:00 | ||

Simulate this Algorithm | 00:01:00 | ||

Dijkstra’s Shortest Path Algorithm | 00:01:00 | ||

Code for Dijkstra | 00:03:00 | ||

What is Missing? | 00:01:00 | ||

Implementing Shortest Distance | 00:02:00 | ||

Using Heaps | 00:03:00 | ||

All Pairs Shortest Paths | 00:01:00 | ||

Floyd-Warshall Intro | 00:03:00 | ||

Floyd-Warshall | 00:03:00 | ||

Randomizing Clustering Coefficient | 00:05:00 | ||

Bounds on the Estimate | 00:03:00 | ||

Hardness Of Network Problems | |||

Introduction | 00:01:00 | ||

Tetristan | 00:01:00 | ||

Efficient Algorithms | 00:01:00 | ||

Exponential Running Time | 00:02:00 | ||

Degrees of Hardness | 00:03:00 | ||

Lower Bound on Complexity | 00:03:00 | ||

Decision Problems | 00:03:00 | ||

Longest Simple Path | 00:02:00 | ||

Reduction: Long and Simple Path | 00:03:00 | ||

Polynomial Time Decidable Problems | 00:01:00 | ||

Non-deterministic Polynomial Time Decidable Problem | 00:03:00 | ||

Accepting Certificate | 00:04:00 | ||

Clique Problem | 00:01:00 | ||

Clique Problem in NP? | 00:02:00 | ||

Good Guessing | 00:02:00 | ||

Exponential Upperbound | 00:03:00 | ||

P=NP? | 00:02:00 | ||

NP-Hard | 00:02:00 | ||

Find the Strangers | 00:03:00 | ||

Reducing to Clique | 00:02:00 | ||

SAT is NP-Hard | 00:02:00 | ||

NP-Completeness | 00:03:00 | ||

Graph Coloring is NP-Complete | 00:03:00 | ||

Solving 3-Colorability | 00:02:00 | ||

Reduce 3-Colorability to SAT | 00:04:00 | ||

Generating a Formula | 00:01:00 | ||

Reduce SAT to 3-Colorability | 00:03:00 | ||

Making a SAT graph | 00:03:00 | ||

Gadgets | 00:05:00 | ||

4-Colorabiity | 00:02:00 | ||

Coloring Planar Graphs | 00:03:00 | ||

Wrap Up | 00:01:00 | ||

Lesson 7 | |||

Intro | 00:01:00 | ||

Spy Control Setup | 00:05:00 | ||

Spy Control | 00:01:00 | ||

Puzzles and Algorithms | 00:04:00 | ||

Names And Boxes Problem | 00:09:00 | ||

Big Data | 00:01:00 | ||

Statistical Measures In Networks | 00:06:00 | ||

Homophily | 00:01:00 | ||

Social Networks In Security And Politics | 00:03:00 | ||

Getting To Point B | 00:08:00 | ||

Networks | 00:02:00 | ||

Practical Algorithms | 00:03:00 | ||

Social Algorithms | 00:05:00 | ||

Algorithms In Industry | 00:01:00 | ||

Learning More About Crunching Social Networks | 00:03:00 | ||

The Future | 00:02:00 | ||

Duncan Watts | 00:04:00 | ||

Intro to Music Video | 00:01:00 | ||

Pathway That Can Use Two Nodes | 00:04:00 | ||

Intro to Graph Search Animation | 00:01:00 | ||

Graph Search Animation | 00:04:00 | ||

Wrap Up | 00:01:00 | ||

Extra Challenge Problems | |||

Top Two | 00:02:00 | ||

Assessment | |||

Submit Your Assignment | 00:00:00 | ||

Certification | 00:00:00 |

### Course Reviews

No Reviews found for this course.

**4 STUDENTS ENROLLED**