Doesn't help that the textbook is still a buggy WIP, and there are no written solutions to problems in the book or the homeworks.
Everyone is in agreement that the course improved significantly since the first year he taught it (Fall 2017). Fall 2017 it was ROUGH, but I have absolutely zero complaints about his teaching last semester.
I can see the argument that this
"open sources" the literature and brings students closer to it.
However - students are not experts in the subject matter and this makes for anxiety-inducing and frankly ineffective pedagogy. You are there to learn, but never know if the proof you are reading is correct or not. The errors get in the way.
Source-TA ing an algorithms course with tardos
1) Anyone know of a good roadmap, breaking down what the major sections are and offering summaries? (Or if they cared to post their own here, that'd be great :) doesn't have to be super comprehensive.)
2) Can anyone recommend a good second book for readers who've already gone through Sipser? —or is there not even a natural follow up since it just depends on which specialization you want to go in from there?
"Computation Complexity: A Modern Approach" by Arora and Barak
2) Author is heavily inspired by Sipser and the previous CS121 course taught by Harry Lewis. So this is your natural follow-up.
>Produced using pandoc and panflute with templates derived from gitbook and bookdown.
At the moment the code is rather messy and somewhat tied to my windows setup , but eventually I plan to open source it as well.