Algorithms, Part I
This course covers the essential information that every serious programmer needs to know about data structures and algorithms (DSA), with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and searching algorithms.
The lecture discusses the union–find data type and its several implementations. Finally, union–find data type is applied to the percolation problem from physical chemistry.
The lecture discusses the scientific method to analyze the performance of algorithms. Computational experiments were performed to measure the running times of test programs and these measurements were used to develop hypothesis about performance.
Being a EEE student, I did not get an opportunity to take DSA courses. However, this course gave an in-depth understanding of all the essential algorithms and data structures to write efficient programs. The lectures are enriched with detailed explanation of the concepts and the assignments complemented well with the lecture videos.
- Wayne .K, & Sedgewick .R (n.d.). Algorithms, Part I [MOOC]. Coursera. https://www.coursera.org/learn/algorithms-part1/home/info