Algorithms: Design and Analysis I course review

I would like to review the course “Algorithms: Design and Analysis, Part 1” available at Coursera. It is offered by Professor Tim Roughgarden of Stanford University and is extremely informative.

The course covers asymptotic notations for algorithm analysis, divide and conquer paradigm, sorting algorithms, a variety of graph algorithms including graph search and shortest-path algorithms; and various data structures including hash tables, heaps, bloom filters and BSTs.

It has weekly quizzes and programming assignments, which reciprocate the lecture content, test understanding of the material and require some creativity and ingenuity on the student’s part. It is a great introductory course to algorithm design and analysis. I would highly recommend this course to all CS enthusiasts.

2 thoughts on “Algorithms: Design and Analysis I course review

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s