The University of California, San Diego is offering free online course on Graph Algorithms. In this course, part of the Algorithms and Data Structures Micro Masters program, you will learn what are graph and its most important properties.
In this six week course, applicants will learn how to use algorithms to explore graphs, compute shortest distance, spanning tree, and connected components. This course will start on June 1, 2018.
Course At A Glance
Length: 6 weeks
Effort: 8-10 hours pw
Institution: University of California, San Diego and edx
Certificate Available: Yes, Add a Verified Certificate for $150
Session: Course Starts on June 1, 2018
The University of California, San Diego (UC San Diego) is a student-centered, research-focused, service-oriented public institution that provides opportunity for all. This young university has made its mark regionally, nationally and internationally.
About This Course
If you have ever used a navigation service to find the optimal route and estimate time to destination, you’ve used algorithms on graphs.
Graphs arise in various real-world situations, as there are road networks, water and electricity supply networks, computer networks and, most recently, social networks! If you’re looking for the fastest time to get to work, you’ll go to work with graphs and algorithms on graphs.
Why Take This Course?
In this course, part of the Algorithms and Data Structures Micro Masters program, you will learn what are graph and its most important properties. You’ll learn several ways to traverse graphs and how you can do useful things while traversing the graph in some order. We will also talk about shortest paths algorithms.
- Graph exploration and decomposition into connected components
- Shortest paths algorithms, including breadth-first search, Dijkstra’s algorithm and Bellman-Ford algorithm
- Minimum spanning tree algorithms
Daniel is an assistant professor at UCSD with a joint appointment between the Department of Computer Science and Engineering and the Department of Mathematics.
Alexander S. Kulikov
Alexander is a research fellow at Steklov Mathematical Institute in St. Petersburg, Russia and a visiting professor at the University of California, San Diego.
Michael serves as chief data scientist at Yandex.Market (Yandex is the leading Internet company in Russia, and Yandex.
Basic knowledge of:
- At least one programming language-loops, arrays, stacks, recursion.
- Math-proof by induction, proof by contradiction
- The Algorithmic Toolbox and Data Structures classes
How To Join This Course
- Go to the course website link
- Create an edX account to SignUp
- Choose “Register Now” to get started.
- EdX offers honor code certificates of achievement, verified certificates of achievement, and XSeries certificates of achievement. Currently, verified certificates are only available in some courses.
- Once applicant sign up for a course and activate their account, click on the Log In button on the edx.org homepage and type in their email address and edX password. This will take them to the dashboard, with access to each of their active courses. (Before a course begins, it will be listed on their dashboard but will not yet have a “view course” option.)