Free Algorithms Course by Princeton University (Coursera)
Princeton University is offering a free two-part algorithm course series. Both courses have gotten a 4.9 out of 5 rating from students, making them one of the highest ranked algorithms courses on Coursera. The courses cover algorithms and data structures, with an emphasis on applications and scientific performance analysis of Java implementations. Despite the fact that the concepts are language neutral, the solutions and implementations are written in Java.
- Algorithms, Part I – It covers elementary data structures (like linked lists, stacks, queues, binary heaps, and hash tables etc.) and sorting & searching algorithms (like binary search, quicksort, mergesort, insertion sort, selection sort, shellsort etc.)
- Algorithms, Part II – It focuses on graph and string processing algorithms and more advanced concepts used in application development. It covers undirected graphs, directed graphs, minimum spanning tree problem, shortest-paths problems, maximum flow and minimum cut problems and algorithms used for solving these problems.
Kevin Wayne and Robert Sedgewick, the professors for these courses, are widely regarded authors and presenters. Robert Sedgewick and Kevin Wayne co-wrote the Algorithms book, which is one of the greatest publications for learning Data Structures and Algorithms in Java.
This lecture series focuses on algorithm understanding through implementation and testing. It assumes students have a basic understanding of Java and expects all programming tasks to be submitted in Java. All course materials, including graded assignments, are free, and no certificate is awarded upon completion of the courses.
Key Highlights
- Top free course on algorithms with an average rating of 4.9 and more than 671000 student enrolments
- Learn to analyze the performance of algorithms using scientific methods
- Explore various applications of stacks and queues ranging from parsing arithmetic expressions to simulating queueing systems
- Discuss application of sorting to computing the convex hull via the Graham scan algorithm
- Learn B-trees that are widely used to implement file systems
- Learn about core data structures and algorithms used in everyday applications and understand the trade-offs ivolved with choosing each data structure along with traversal, retrieval, and update algorithms
- Study and implement several classic data compression schemes
Duration : 6 weeks, 8-10 hours per week
Google Rating : 4.9/5.0
Enroll here: coursera.org/learn/algorithms-part1
