Discrete_Mathematics_and_Algorithm

CRLS and Discrete_Mathematicsand_Its_Applications book notes

How I chose the textbooks

• from teachyourselfcs, the 2 books it recommends don't have full solutions for corresponding exercises (1. The Algorithm Design Manual 2. MIT related book 2015 or github).
  • So I chose Discrete Mathematics and its Applications by this with full solutions
    • after all, this not well known book may be also well.
    • Also many recommend Discrete Mathematics with Applications.
    • Also see this comparison among them.
  • and CRLS 4th with almost full 3rd solutions although teachyourselfcs doesn't recommend for the complexity.
    • sol
      • 1
      • 3rd Instructor’s Manual
      • 3rd solution list they are less detailed than wojtask (See 1.1 answers)
    • it is enough to read it to cover the "data structures" although too serious.
• More detailed see this related contexts.
• I didn't use Algorithms, Fourth Edition by Sedgewick referred to in teachyourselfcs although it has one full solution (This is not full) due to
  1. it is based on Java including Web Exercises / programming exercises. Although there are other versions of solutions, pseudocode may be more appropriate for others to learn.
  2. It is published in 2011 which may be inappropriate in 2024.
  3. It cares about testing instead of strict mathematical proof

  then testing the hypotheses by running the algorithms in realistic contexts. The emphasis is on testing algorithms in the context of meaningful applications.

  • This is also implied by

    Do I need any special mathematical background? No, we assume only a basic high school background. So it doesn't even need calculus? (CRLS also needs linear algebra)

  • Notice 3rd may be different from the 4th.

    Sedgewick’s Algorithms in C/C++/Java, Third Edition is more appropriate as a reference or a text for an advanced course

  • TODO
    • read more after Algorithm Science
    • check course in CS 2013 or 2023
    • "Dynamic visualizations"
    • I didn't find FFT
  • This book is very detailed but in Java
    • Take this as one example

      The booksite expands on the exercises in the book by adding drill exercises (with answers available with a click), a wide variety of examples illustrating the reach of the material, programming exercises with code solutions, and challenging problems.

      • challenging problems may mean Creative Problems.

      • programming exercises with code solutions Web Exercises

      • examples i.e. contents before Exercises.

      • drill exercises i.e. "Exercises"

  • Links to related material TODO may mean this

• Other books recommended In summary, we can use books with @ mark as reference. Books strikethroughed are not recommended.
  • by amazon
    • Computer Algorithms Best Seller
      • @Algorithms Illuminated: Omnibus Edition has no shared ebook
        • Recommended if you like videos
        • It also has one separate forum
      • Hello World: Being Human in the Age of Algorithms seems have no algorithms and math...
    • Computer Algorithms skipped due to overlap with the rest links and many books about AI.
    • Programming Algorithms
      • Algorithms by Sanjoy Dasgupta is too old and has only 1st edition.
      • The Bible of Algorithms and Data Structures: A Complex Subject Simply Explained length "123 pages" is too short
    • Data Structure and Algorithms
      • Cracking the Coding Interview: 189 Programming Questions and Solutions (Cracking the Interview & Career) is too targeted for Interview
      • The rest is almost all based on one specific language, so skipped.
    • "algorithms"
      • Grokking Algorithms, Second Edition is skipped by this reddit post which recommends only CRLS and manual it may be just introductory
  • by reddit
    • Stack Overflow doc although shut down now due to (I read before "Will anything come out of this experiment?" partly)

      In addition, it’ll be a very long time before that work will pay off in terms of bringing new users to Stack Overflow. Our interviews showed even very experienced users of T-SQL felt inadequate to contribute documentation.

    • CRLS is used more often in university.
    • “Algorithm design” by Kleinberg and Tardos cares more about design
      • lecture
    • This doesn't recommend CRLS
      • he doesn't recommend to spend too much time on one heavy book although it may be inappropriate
      • Jay Wengrow - A Common-Sense Guide to Data Structures and Algorithms, Second Edition: Level Up Your Core Programming Skills by this
      • Algorithms by Jeff Erickson
        • compared with CRLS

          For instance, one thing that disappoints me about CLRS is that in covering dynamic programming, it doesn’t emphasize enough that the secret sauce comes from thinking about problems recursively. In general, CLRS doesn’t shy away from throwing low-level details at you when explaining algorithms. But that’s because I already have a big picture framework in my head. If I wanted to learn how to think about algorithms, having never studied the subject before, CLRS would not be my first choice of a textbook. CLRS is still more comprehensive overall (like an encyclopedia) though.

          • Dasgupta, Papadimitriou and Vazirani’s Algorithms

            It’s not at all comprehensive though, and so I have to supplement it a lot, including with material from CLRS and Erickson’s book.

      • CRLS is not easy
        • See this
          • TAOCP

            it's an amazing book if you like the combinatorial puzzles that Knuth have worked through over the years

          I do go through it from time to time, and by this point, I'm familiar enough with the subject area that I no longer find it as daunting as I did all those years ago As a textbook, it works okay for a classroom, that's about it. This book was great when it first came out because it was one of the first comprehensive self-contained textbooks it is fairly accessible (relative to anything else at the time) Pick any modern Algorithm Design text: Skiena, Kleinberg, Sedgwick, and go through its table of contents.

          • It lacks a certain coherence Within specific chapters, the problems and examples presented seem to jump all over the place as well. There really isn't a unifying thesis for each chapter (or even each problem it discusses), let alone some practical grandiose theory of algorithm design embodied by the book. there aren't any algo-design texts out there that have solved this problem down into mechanization ... (In fact, take any two of Skiena, Kleinberg, Sedgwick, and Dasgupta and you'll have a more readable presentation of everything covered in CLRS).

            • Dasgupta this is incomplete without 336 pages

          I took both of my undergrad and graduate courses in Algo through Kleinberg and the one thing that I am most grateful for in my second attempt to understand this material is the clarity of the presentation.

      • CRLS said by this

        pretty useless if you want to be an engineer though. may be not true as teachyourselfcs says.

      • This is really good to say CRLS relationship with Skiena manual.
      • Competitive Programming Steven Halim, Felix Halim, and Suhendry Effendy see
      • I skips all after wwww4all included.
    • CRLS order with SICP
      • course

textbooks used by

Discrete Mathematics with Applications

1. The University of Pittsburgh

How to read these books

• We should read the appendix first as the order of 'Eighth Edition SOLUTIONS' although when reading 'Discrete Mathematics with Applications' I read the main part first. See this appendix of one different book got by "Should I read appendix of the "textbook" first". Although for novels it's not recommended to read the appendix first.
• Since I have one book as the main book and the other as the complement, it is better to read them at the same time. Since reading the other book after having read one book, some contents have been learnt are blurred and it took some unnecessary time to review them.
• Notice to read errata.

miscs

• check markdown size to ensure indexed in GitHub by find . -name "*.md" | xargs -I{} du -h {}
• This repo can be searched by "Discrete Mathematics and Its Applications 8th solution site:github.com" although not in the top list when 2024 June 2.