Online Course
Algorithm Design and Analysis
University of Pennsylvania via edX
-
710
-
- Write review
Overview
How do you optimally encode a text file? How do you find shortest paths in a map? How do you design a communication network? How do you route data in a network? What are the limits of efficient computation?
This course, part of the Computer Science Essentials for Software Development Professional Certificate program, is an introduction to design and analysis of algorithms, and answers along the way these and many other interesting computational questions.
You will learn about algorithms that operate on common data structures, for instance sorting and searching; advanced design and analysis techniques such as dynamic programming and greedy algorithms; advanced graph algorithms such as minimum spanning trees and shortest paths; NP-completeness theory; and approximation algorithms.
After completing this course you will be able to design efficient and correct algorithms using sophisticated data structures for complex computational tasks.
Syllabus
Week 1: Mathematical Preliminaries; Asymptotic analysis and recurrence relations; Sorting and Searching; Heaps and Binary Search Trees
Week 2: Algorithm Design Paradigms - Divide-and-Conquer algorithms, Dynamic Programming, Greedy Algorithms
Week 3: Graphs and graph traversals; minimum spanning trees; shortest paths
Week 4: Flows; NP-completeness; Approximation Algorithms
Taught by
Sampath Kannan
Tags
Related Courses
-
Algorithms
Stanford University
-
Design and analysis of algorithms
Chennai Mathematical Institute, NPTEL
3.0 -
Introduction to Graduate Algorithms
Georgia Institute of Technology
-
Data Structures and Algorithms
Georgia Institute of Technology
-
Data Structures
University of Madras, Chennai, CEC
-
Data Structures & Algorithms IV: Pattern Matching, Djikstra’s, MST, and Dynamic Programming Algorithms
Georgia Institute of Technology
Reviews
4.0 rating, based on 1 reviews
-
Anonymous completed this course.
I am a Ph.D student. And I want to developed myself.I am a Ph.D student. And I want to developed myself.I am a Ph.D student. And I want to developed myself.I am a Ph.D student. And I want to developed myself.I am a Ph.D student. And I want to developed myself.I am a Ph.D student. And I want to developed myself.I am a Ph.D student. And I want to developed myself.I am a Ph.D student. And I want to developed myself.I am a Ph.D student. And I want to developed myself.I am a Ph.D student. And I want to developed myself.I am a Ph.D student. And I want to developed myself.