K
K
kirsan_vlz2010-11-02 19:47:04
Books
kirsan_vlz, 2010-11-02 19:47:04

Discrete math textbook?

It so happened that at the institute we decided not to include this section of the tower in the program. But in the process of learning programming, I began to notice that knowledge of discrete mathematics would be very useful to me. Sites, of course, can be written without it, but here's something more - alas.
And a question arose. There are a lot of different books. Somewhere written more, somewhere less. Somewhere a simple and understandable language, but somewhere the book is more likely not a textbook, but a reference book that you will not understand without preparation.
What is required is a textbook covering what a programmer might need.

Answer the question

In order to leave comments, you need to log in

7 answer(s)
A
apangin, 2010-11-02
@apangin

I like Romanovsky's Discrete Analysis. Simple and on topic.
The author gave us a course of the same name on math-mecha at St. Petersburg State University.

S
Skiminok, 2010-11-03
@Skiminok

Strange that so far no one has advised Haggarty or Anderson .

R
Rustam, 2010-11-04
@Rustam

I study these three books:
Kormen - 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/
sometimes it is useful to see visualizers using algorithms - rain.ifmo.ru/cat/view.php/vis

S
Sergey Aganezov, 2010-11-02
@Karde

It's not entirely clear, do you need algorithms that will only be needed when programming, or do you want to study the subject?
If the first:

  1. "Algorithms. Construction and Analysis” (Thomas Kormen, Charles Leizerson, Ronald Rivest, Clifford Stein) Link to Ozon -> buy
  2. The Art of Programming (Donald E. Knuth) all 4 volumes are needed if you really want to learn everything. Link to Ozon -> Whip. The Art of Programming Book List:
    • “The Art of Programming. Volume 1. Basic Algorithms»
    • “The Art of Programming. Volume 2. Obtained Algorithms»
    • “The Art of Programming. Volume 3. Sorting and searching»
    • “The Art of Programming. Volume 4. Issue 4. Generation of all trees. History of combinatorial generation»


If the second - university textbooks to help. I can't give you specific advice, unfortunately.

M
mydoom, 2010-11-02
@mydoom

www.hse.ru/org/persons/10586198
see links under the heading “He
reads lectures on the course “Discrete Mathematics” at the Higher School of Economics and at the Physicotechnical Institute…some like it.

A
andreycha, 2010-11-04
@andreycha

For starters - Novikov's high school textbook "Discrete Mathematics". Do not listen to those who write about Knut and Kormen - this is already a level much higher.

M
mydoom, 2010-11-02
@mydoom

and more... Do you by any chance speak Ukrainian?)

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question