# Advanced Algorithmics and Graph Theory with Python

, , Prof. Vincent Gripon 0.0 ( Reviews) 7929 Students Enrolled

Updated On 02 Feb, 19

, , Prof. Vincent Gripon 0.0 ( Reviews) 7929 Students Enrolled

Updated On 02 Feb, 19

Strengthen your skills in algorithmics and graph theory, and gain experience in programming in Python along the way.

Algorithmics and programming are fundamental skills for engineering students, data scientists and analysts, computer hobbyists or developers.

Learning how to program algorithms can be tedious if you aren’t given an opportunity to immediately practice what you learn. In this course, you won't just focus on theory or study a simple catalog of methods, procedures, and concepts. Instead, you’ll be given a challenge wherein you'll be asked to beat an algorithm we’ve written for you by coming up with your own clever solution.

To be specific, you’ll have to work out a route faster than your opponent through a maze while picking up objects.

Each week, you will learn new material to improve your artificial intelligence in order to beat your opponent. This structure means that as a learner, you’ll confront each abstract notion with a real-world problem.

We’ll go over data-structures, basic and advanced algorithms for graph theory, complexity/accuracy trade-offs, and even combinatorial game theory.

This course has received financial support from the Patrick and Lina Drahi Foundation.

- Ways to express a computational problem (such as pathfinding) using graph theory
- How to choose the appropriate algorithm to solve the given computational problem
- How to code the algorithmic solution in python
- Methods for evaluating the proposed solution in terms of its complexity (amount of resources, scalability) or performance (accuracy, latency)

Some familiarity with Python 3 and basic mathematics.

Week 1: Fundamentals of Graph Theory, Problem Solving, Good Programming Practices

Week 2: Graph Traversal, Routing, Queuing Structures

Week 3: Shortest Paths, Min-Heaps, Algorithmic Complexity

Week 4: NP-Completeness, Traveling Salesman Problem, Backtracking

Week 5: Heuristics, Greedy Approaches, Accuracy/Complexity tradeoff

Week 6: Combinatorial Game Theory, Winning Strategies

Sam

March 29, 2018

Sed sollicitudin risus eget nisl accumsan, nec gravida metus fringilla accumsan magna a lorem auctor sagittis.

Dembe

March 29, 2018

Etiam volutpat, orci quis vulputate sodales, metus diam scelerisque ligula, sit amet conggaugue orci ut leo. Sed mattis suscipit urna sed finibus.