Skip to content
HomeVideosBooks
AllTopicsTrends
BlogsPodcasts
HistoryListsWatch laterLiked videosFollowing

The videos, books, blogs and podcasts Hacker News keeps recommending, all in one place.

VideosBooksBlogsPodcastsAboutPrivacySettings

Data from Hacker News, HackerTube, HackerBooks, HackerBlogs and Open Library. Credits · Not affiliated with Y Combinator.

HomeVideosBooksBlogsPodcasts
Ctrl K
    Cover of Schaum's outline of discrete mathematics

    Schaum's outline of discrete mathematics

    Seymour Lipschutz · 2007

    Computer ScienceMathematicsProgramming
    Open LibraryAmazon
    Stats for nerds
    3recommend
    4mentions
    4people
    2012–2017years
    75% recommend25% neutral

    Mentions per year

    201220132014201520162017

    What Hacker News says

    1. radicalbyteApr 2014
      I'm self taught :)

      Algorithms in a Nutshell does a great job of introducing data structures and algorithms. It's also very short. Data structures and particularly basic graph algorithms (DFS, BFS, DSP) are very powerful and can solve a lot of common problems.

      After that, study Math. Algebra, Set Theory, Automata and Calculus were real eye openers. Schaum's Outline of Discrete Mathematics is a good start in discrete math.

      Automata: if you can, try and get hold of the Coursera course on the subject. It's excellent. It is hard work, but it got it through my thick skull :)

      Then, compilers! They're awesome. They changed the way I think about development, and also in one feel swoop destroyed a lot of respect I had for the industry. I read "Engineering a Compiler" and followed the excellent Coursera course.

      Did learning that make me a better developer? In some ways, yes. I'm capable of solving problems that I thought were impossible a few years ago. On the other hand, it is now clear to me that our industry is building castles on sand too often, and that makes me sad.

      I feel like Algernon.

      thread
    2. user_235711Jan 2014
      There is plenty of math that does not lie on the academic beaten path (i.e. arithmetic -> algebra -> calculus --> etc.) I would recommend trying to figure out what area of math you are most interested in first, that way you will be enthusiastic about learning it. Once you have the mathematical momentum from that you will probably be able to learn whatever math you need to. A couple of books that helped me to find a direction were Mathematical Ideas[1] and Concepts of Modern Mathematics[2], which cover many different areas with just enough depth to give you a feel for each. If you are wanting to learn math solely for CS I would also recommend something like Schaum's Outline of Discrete Mathematics[3].

      [1]http://www.amazon.com/Mathematical-Ideas-Edition-Charles-Mil...

      [2]http://www.amazon.com/Concepts-Modern-Mathematics-Dover-Book...

      [3]http://www.amazon.com/Schaums-Outline-Discrete-Mathematics-R...

      thread
    3. benkantJun 2012
      Statistics and probability don't directly relate to anything in TADM from what I can recall. There's not much to the maths beyond high school stuff. Some discrete maths will help though. Graphs theory, trees and functions especially. Schaum's Outline of Discrete Mathematics is decent.

      Obviously Skiena's book is in C- so be somewhat familiar with it. Again no need to go crazy deep into C before you start. You can learn as you go.

      I'd recommend just diving in and using other resources as references if you come across anything you don't know, rather than spending too much time working though "pre-requisites".

      thread
    4. todd8Dec 2017
      First, keep solving problems. Mathematical brainteasers got me started problem solving when I was in grade school. I really like Martin Gardner's books[1] and those by Robert Smullyan[2]. These kinds of problems develop the flexibility of thought that helps find creative solutions.

      Actual, specific approaches to tackling tough problems are taught by the famous Hungarian mathematician George Polya in his classic book How to Solve It [3].

      Discrete Mathematics is a field that covers a number of areas, but especially in counting problems (from combinatorics) and graph theory there are a number of results that are not hard to grasp but lead to beautiful solutions for real problems. There are many powerful theorems and principles in discrete math that will unlock seemingly impossible problems. Unfortunately, the books for this subject are mostly written for math majors that are interested not only the application of these results but how to prove them and consequently the books may not appeal to everyone. Perhaps something like Schaum's Outline of Discrete Mathematics would suitably cover the way to apply some of the important theorems without bogging down in the proofs.

      Finally, I think there is value in doing small interesting programming projects. Two older books, available used, with interesting projects are Etudes for Programmers by Wetherell [5] and Software Tools in Pascal by Kernighan and Plauger [6]. Etudes has my favorite exercise for trying out new programming languages, building an interpreter for the simple TRAC programming language; Software Tools has a number of programs in Pascal that do interesting things, try implementing the programs in your programming language--they cover a range of difficulties and the book has a nice discussion for each that explains why the programs are structured the way they are.

      A more advanced book, Structure and Interpretation of Programming Languages, available as a downloadable pdf [7] is a classic book for those wanting to become better programmers.

      [1] https://www.amazon.com/Martin-Gardner/e/B000AP8X8G/ref=sr_tc...

      [2] https://www.amazon.com/Raymond-M.-Smullyan/e/B000AQ1NF0/ref=...

      [3] https://www.amazon.com/How-Solve-Mathematical-Princeton-Scie...

      [4] https://www.amazon.com/Schaums-Outline-Discrete-Mathematics-...

      [5] https://www.amazon.com/Etudes-Programmers-Charles-Wetherell/...

      [6] https://www.amazon.com/Software-Tools-Pascal-Brian-Kernighan...

      [7] http://web.mit.edu/alexmv/6.037/sicp.pdf

      thread

    Related

    Cover of Algorithms in a nutshell
    2009–2024

    Algorithms in a nutshell

    George T. Heineman
    12 recommend · 23
    Schaum's outlinesSeymour Lipschutz
    2008–2026

    Schaum's outlines

    Seymour Lipschutz
    10 recommend · 18
    Cover of Code
    2008–2026

    Code

    Charles Petzold
    243 recommend · 385
    Cover of Discrete mathematics
    2014–2021

    Discrete mathematics

    László Lovász
    2 recommend · 2
    Cover of Discrete Mathematics and Its Applications
    2008–2025

    Discrete Mathematics and Its Applications

    Kenneth H. Rosen
    14 recommend · 20
    Cover of Discrete mathematics for computer science
    2015–2022

    Discrete mathematics for computer science

    Kenneth P. Bogart
    0 recommend · 2
    Cover of Mathematics for Computer Science
    2009–2025

    Mathematics for Computer Science

    Eric Lehman
    37 recommend · 70
    Cover of The art of computer programming
    2007–2026

    The art of computer programming

    Donald Knuth
    336 recommend · 1,799