Discrete Mathematics

What Hacker News says

1. grepLeighAug 2024
   Discrete Mathematics and It's Applications by Kenneth H. Rosen helped me get an A in CS70 (Discrete Math and Probability) at UC Berkeley this past summer.

   The textbook is quite large, but the content is very accessible. I'm also self-taught, finally taking formal math/physics coursework in my 30s to fill in the gaps.

   Another amazing resource has been California Community Colleges. So far every math teacher I've had has been extraordinarily passionate. Most math classes have an async/online section, and it's pretty common for adults to take the classes just for fun/self-improvement.

   Show morethread
2. kelvinrusselOct 2014
   Discrete Mathematics and it's applications - Kenneth Rosen http://www.bookdepository.com/Discrete-Mathematics-Its-Appli...

   Once you finish that, get to Concrete Mathematics by Donald Knuth et. al.

   thread
3. morty_sNov 2021
   CLRS does about 5 pages on linked lists. If you want more, my advice would be to implement one in your language of choice, then look at the API for the standard lib impl of a linked list in your language of choice (if there is one).

   Otherwise, for more reading on linked lists, read through adlist.c from redis, by antirez.

   Next, one of the best books (IMO) on algorithmic thinking is SICP. Get through a few chapters, do the exercises, grok recursion, etc.

   In no particular order:

   Algorithm Design Manual, Skiena

   Algorithm Design, by Kleinberg/Tardos

   Algorithms, Sedgwick 4th ed. (also Algorithms in C)

   If you find you need or would like more math:

   Discrete Mathematics (Epp is an easier read, Rosen seems more verbose)

   Mathematical Proofs, Charrand

   For interview prep:

   Elements of Programming Interviews (EPI)

   Designing Data Intensive Applications

   Show morethread