Affiliate Post Computer and IT

Course on Algorithms Specialization by Stanford [Online, 4 Months]: Registrations Open

By: Gurjit Kaur | 24 Mar 2020 11:15 AM

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.

The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists.

There are 4 Courses in this Specialization
  • Divide and Conquer, Sorting and Searching, and Randomized Algorithms: 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).
  • Graph Search, Shortest Paths, and Data Structures: 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).
  • Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming: 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).
  • Shortest Paths Revisited, NP-Complete Problems and What To Do About Them: 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).
Instructor

Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications.

To enroll for this course, click the link below.

Course on Algorithms Specialization by Stanford

Note: NoticeBard is associated with Coursera through an affiliate programme

Get Noticebard’s Posts in Your Email.

Jobs, internships, conferences, scholarships, etc.
Join 38,000 other people!

Related Posts

About the Author

Gurjit Kaur

Comment via Facebook

Comment via Website

Your email address will not be published. Required fields are marked *