Introduction to Graduate Algorithms

share ›
‹ links

Below are the top discussions from Reddit that mention this online Udacity course.

Learn advanced techniques for designing algorithms and apply them to hard computational problems.

Reddacity may receive an affiliate commission if you enroll in a paid course after using these buttons to visit Udacity. Thank you for using these buttons to support Reddacity.

Reddit Posts and Comments

0 posts • 9 mentions • top 9 shown below

r/cscareerquestions • comment
2 points • R0b0tJesus

Here's the course. it was tough, but I learned a lot.

r/OMSCS • comment
5 points • tennalinikka

There used to be an option to show OMSCS classes in Udacity's filters, but looks like they've removed it. Your best bet now is to go here, filter by "free courses" and ctrl + F the class you're interested in. This is the link for the new GA class btw - the one above is for the old one, CCA.

r/OMSCS • post
2 points • ericjonwilson
Could anyone share syllabus for Spring Graduate Algorithms?

I like to try and pre-plan the semesters schedule and would love to see what it looked like previously (even if it changed)

Bonus question is if anyone knows if this the current lecture series for the course on Udacity

r/OMSCS • comment
1 points • Aaahhhaaaaa

>https://www.udacity.com/course/introduction-to-graduate-algorithms--ud401

Got it. Thanks!

r/OMSCS • comment
1 points • Maximum_Expression
r/compsci • comment
1 points • damlek

https://www.udacity.com/course/introduction-to-graduate-algorithms--ud401

r/gatech • comment
1 points • hamolton

You should get hyped about Algos! For that class, I really enjoyed watching the Grad Algos lectures which cover the same topics.

r/OMSCS • comment
1 points • another_josh

I think this is the Udacity link but I'm not sure as I haven't taken in the class: https://www.udacity.com/course/introduction-to-graduate-algorithms--ud401

r/OMSCS • comment
1 points • Wrong_Consideration

I too have an EE undergrad and no formal DS (data structure) or algo experience. Heck the hardest thing I learned in undergrad was recursing a fibonacci sequence and finding the min max value of a list in O(n) time lol. I am averaging a high C and after this next test a low/high B.

​

If you have the tenacity to do well with no formal background, I highly recommend watching ALL the lectures on ud401 https://www.udacity.com/course/introduction-to-graduate-algorithms--ud401 and solving (to the best of your ability) the first 10 problems of each chapter in Dasgupta et al. [DPV] http://algorithmics.lsi.upc.edu/docs/Dasgupta-Papadimitriou-Vazirani.pdf . Don't stress if you can't do it, just get an idea of how the course is laid out.