Computability, Complexity & Algorithms
Learn tools and techniques that will help you recognize when problems you encounter are intractable and when there an efficient solution.
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 • 18 mentions • top 6 shown below
3 points • captainAwesomePants
By theoretical stuff, I mostly mean data structures, algorithms, and complexity. All of these things can be pretty complicated, but for purposes of job hunting, you mostly just need the very basics. Data structures like hash tables, algorithms like depth first searches, and being able to tell the difference between a linear and logarithmic time algorithm.
I haven't tried it, but this is the sort of course that goes somewhat past those basics: https://www.udacity.com/course/computability-complexity-algorithms--ud061
5 points • anon35202
1 points • GPBisMyHero
This is the original course on Udacity: https://www.udacity.com/course/computability-complexity-algorithms--ud061
But you definitely can't enroll in it with GT anymore. They swapped it out for GA because that seemed to be more "compatible" for OMSCS students than CCA was.
1 points • slimydude
In case anyone is interested, the lectures remain available even though you can't actually take it: https://www.udacity.com/course/computability-complexity-algorithms--ud061
1 points • truongsinhtn
Nice, I see that https://omscs.gatech.edu/cs-6505-computability-algorithms still has the course on Udacity (https://www.udacity.com/course/computability-complexity-algorithms--ud061), but year no longer available for enrolment.
You also mentioned CS-6550, but that's a different course (https://www.cc.gatech.edu/\~vigoda/6550/) and does not seem to mention Church–Turing thesis?
3 points • bmw95
Below is a list I set up for myself to get better at python and algorithms. Might help you as well :)