Search result for Courses taught by Tim Roughgarden
FollowFilter ![]()
Filter ![]()
Showing 6 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
Algorithms: Design and Analysis, Part 1
by Tim Roughgarden- 0.0
-
![]()
![]()
![]()
![]()
![]()
6 Weeks
Welcome to the self paced course, Algorithms: Design and Analysis! Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. Learners will practice and master the fundamentals of algorithms through several types of assessments....
$149
Algorithms: Design and Analysis, Part 2
by Tim Roughgarden- 0.0
-
![]()
![]()
![]()
![]()
![]()
6 Weeks
Welcome to the self paced course, Algorithms: Design and Analysis, Part 2! Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This course is an introduction to algorithms for learners with at least a little programming experience. The course concludes with a multiple-choice final....
$149
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
by Tim Roughgarden- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 17 hours to complete
The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts). Week 1 Why Study Algorithms? Integer Multiplication Karatsuba Multiplication About the Course Merge Sort: Motivation and Example...
Graph Search, Shortest Paths, and Data Structures
by Tim Roughgarden- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 15 hours to complete
The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from deduplication to social network analysis). Week 1 Graph Search - Overview Breadth-First Search (BFS): The Basics...
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
by Tim Roughgarden- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 15 hours to complete
The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees). Week 1 Application: Internet Routing Application: Sequence Alignment Introduction to Greedy Algorithms Application: Optimal Caching Problem Definition A Greedy Algorithm Correctness Proof - Part I...
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
by Tim Roughgarden- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 14 hours to complete
The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search). Week 1 Single-Source Shortest Paths, Revisted Optimal Substructure The Basic Algorithm I The Basic Algorithm II...
Top Online Courses and Specializations | Coursera
- 0.0
-
![]()
![]()
![]()
![]()
![]()
Find Courses and Specializations from top universities like Yale, Michigan, Stanford, and leading companies like Google and IBM. Join Coursera for free and transform your career with degrees, certificates, Specializations, & MOOCs in data science, computer science, business, and dozens of other topics....
Coursera | Online Courses & Credentials From Top Educators. Join for Free
- 0.0
-
![]()
![]()
![]()
![]()
![]()
Learn online and earn valuable credentials from top universities like Yale, Michigan, Stanford, and leading companies like Google and IBM. Join Coursera for free and transform your career with degrees, certificates, Specializations, & MOOCs in data science, computer science, business, and dozens of other topics....
Course Definition & Meaning - Merriam-Webster
- 0.0
-
![]()
![]()
![]()
![]()
![]()
course: [noun] the act or action of moving in a path from point to point....
Free Online Courses | Stanford Online
- 0.0
-
![]()
![]()
![]()
![]()
![]()
Free Online Courses. Our free online courses provide you with an affordable and flexible way to learn new skills and study new and emerging topics. Learn from Stanford instructors and industry experts at no cost to you....
Online Courses - Learn Anything, On Your Schedule | Udemy
- 0.0
-
![]()
![]()
![]()
![]()
![]()
Udemy is an online learning and teaching marketplace with over 185,000 courses and 49 million students. Learn programming, marketing, data science and more....
