Ask HN: How Sound Is the “Teach Yourself CS” Learning Resource?

Re:Ask HN: How Sound Is the “Teach Yourself CS” Learning Res... by eru on Monday February 10, 2020 @12:49AM (#22286700)

Sounds like you would make a good mathematician.

I had a very similar reaction to the much vaunted 'Algorithm Design Manual'. It was all fluff with not much substance.

I found http://jeffe.cs.illinois.edu/teaching/algorithms/ pretty good for an overview over Algorithms.

If you like something in a similar vein to TAOCP, the book 'Combinatorial Optimization' by Alexander Schrijver fits the bill. It teaches you everything you ever wanted to know and then some on the mathematics behind problems in P. Just like TAOCP it is also a detailed overview over known results. See https://homepages.cwi.nl/~lex/files/book.pdf for the list of contents.

[ Parent | on HN ]

Re:Ask HN: How Sound Is the “Teach Yourself CS” Learning Res... by epelesis on Monday February 10, 2020 @02:22PM (#22292270)

I'm taking Jeff's 473 class right now and if you like his writing style, all of his lectures for both algorithms classes he teaches are online as videos - it can be a good companion to the textbook if you want worked examples. [my video] links should be raw MP4's that are not password protected.

374 (Introduction to Algorithms Videos): https://courses.engr.illinois.edu/cs374/fa2019/A/schedule.ht...

473 (Algorithms Videos): https://courses.engr.illinois.edu/cs473/sp2020/lectures.html

[ Parent | on HN ]

Re:Ask HN: How Sound Is the “Teach Yourself CS” Learning Res... by eru on Monday February 10, 2020 @11:50PM (#22296153)

Thanks! I don't really like videos for math-y content, but I have recommended his books to people who will definitely appreciate the videos.

Btw, I tried to reach out to Jeff for a linear time solution to an exercise in the chapter on matroids in section 8.2. It's about 'Scheduling with Deadlines', and his best solution is O(n log n).

But alas, I never got a reply.

[ Parent | on HN ]