i'd probably put some kind of ordering on these. start with algorithm analysis and basic data structures etc in CLRS. (ch 3,4,10,11,12) and then go back and fill in the more advanced concepts. dasgupta, papadimitriou, vazirani is good too http://www.cs.berkeley.edu/~vazirani/algorithms.html for the compilers book, it's necessary to go through the assembly, and some of sipser (need DFA/NFA/context free grammars), as well as structure and interpretation of computer programs. OS could come after the algorithms and preferably after assembly but before the compilers book.
Typographic jacket · original cover not fetched
FROM THE SHARED SHELF · 2006–2026 SAMPLE
Introduction to Algorithms
1 reader recommends it across 1 discussion
Topics are model-inferred labels.
Keep it on your reading list
THE WORD OF MOUTH
What made it worth passing on?
Original Hacker News comments, in the readers’ own words.