A textbook on discrete mathematics?


Warning: count(): Parameter must be an array or an object that implements Countable in /home/styllloz/code-flow.club/qa-theme/donut-theme/qa-donut-layer.php on line 274
0 like 0 dislike
53 views
It so happened that at the Institute this section of the tower we decided not to include in the program. But in the process of learning programming, I began to notice that the knowledge of discrete mathematics I would be very useful. Sites, of course, possible without her writing, but something more — alas.

And the question arose. Books different a lot. Written somewhere more, somewhere less. Somewhere simple and clear language, and somewhere in the book rather than the textbook, and the Handbook that will not understand without training.

You need a textbook covering that can be useful to the programmer.
by | 53 views

7 Answers

0 like 0 dislike
I "Discrete analysis" Romanovsky like. Simple and to the point.
The author read us the eponymous course at Mat-fur of St. Petersburg state University.
by
0 like 0 dislike
It is strange that still no one advised Haggerty or Anderson.
by
0 like 0 dislike
studying these three books:
Cormen — www.ozon.ru/context/detail/id/2429691/
Novikov — discrete mathematics for programmers www.ozon.ru/context/detail/id/3510820/
Romanovsky — discrete analysis www.ozon.ru/context/detail/id/3858826/
\r
in algorithms it is sometimes useful Visualizers view — rain.ifmo.ru/cat/view.php/vis
by
0 like 0 dislike
It is not quite clear, you need algorithms that will be needed only when programming, or you want the subject to study?
If first:
\r
\r
    \r
  1. "Algorithms. The construction and analysis" (Thomas Cormen, Charles Leiserson, Ronald Rivest, Clifford Stein) Link to Ozon -> buy
  2. \r
  3. "The art of computer programming" (Donald E. Knuth) all 4 volumes needed if you really want to learn everything. Link to Ozon -> Whip. The art of computer programming books List:
    \r
      \r
    • "The art of computer programming. Volume 1. Basic algorithms"
    • \r
    • "The art of computer programming. Volume 2. Polycycline algorithms"
    • \r
    • "The art of computer programming. Volume 3. Sorting and searching"
    • \r
    • "The art of computer programming. Volume 4. Issue 4. The generation of all trees. The history of combinatorial generation"
    • \r

    \r
  4. \r

\r
If the second high school textbooks. To suggest specific unfortunately can't.
by
0 like 0 dislike
www.hse.ru/org/persons/10586198
see the links under "Lecture for the course "Discrete mathematics"
reads in HSE and MIPT... some of them do.
by
0 like 0 dislike
For starters — University textbook Novikov, "Discrete mathematics". Don't listen to those who wrote about the Carrot and Cormen — this is a level significantly higher.
by
0 like 0 dislike
and yet... You happen to speak Ukrainian?)
by

Related questions

0 like 0 dislike
4 answers
0 like 0 dislike
3 answers
0 like 0 dislike
4 answers
asked Mar 23, 2019 by Zlobober
110,608 questions
257,186 answers
0 comments
23,425 users