What topic in discrete mathematics is considered a prerequisite for a course of data structures?

I want to read a book on data structures and algorithms, but I would like to know if there is any specific topic in discrete mathematics that is considered very important as a prerequisite for understanding the materials presented in the data structure book.

PS I am a self-taught programmer; I did not take any courses in computer science.

+3
source share
6 answers

"Discrete mathematics" is rather a buzzword containing the basics of a dozen different topics (logic, algorithms, calculation theory, number theory, digital design, etc.), all of them are slightly related to programming. Reading a separate book in mathematics will be about the same as reading the first or two books on all of these topics.

The most important thing to understand is logical logic , which you are probably already very good if you are self-taught; algorithms are also very important. The theory of computational materials is quite interesting, but not very useful if you really do not use algorithms or do not want to write your own parser. Number theory is good to find out if you want to break into cryptography.

You do not need to know any of these things to read about data structures.

+7

, , , . .

BTW, : , , Patashnik.

, , . . , .

+3

, .

+1

, , / , :

  • /:
  • , , , .
  • : .

, , . , .

, / , , . , , , . , , , .

PS: , , : " : " " " ( " " )

+1

, , , . , , .

, , .

0

if you are interested not only in data structure, but in all areas of computer science, discrete mathematics includes Boolean algebra and its application, which is the basis of computer architecture and assembly language, but I do not think that this is related to data structures and algorithms

0
source

Source: https://habr.com/ru/post/1730365/


All Articles