Discrete mathematics, as a course of computer department, has some similarities with other courses, and of course it has its own characteristics. Now we will simply analyze its characteristics as an examination content.
1, many definitions and theorems.
Discrete mathematics is a logical reasoning subject based on a large number of definitions. Therefore, understanding concepts is the core of our study of this subject. On the basis of these concepts, we should pay special attention to the relations between concepts, and the entities that describe these relations are a lot of theorems and properties.
Part of the examination is to examine the memory, understanding and application of definitions and theorems. For example, in the examination questions of Shanghai Jiaotong University in 2002, what was the compatibility relationship? If you know, it is easy to score; If you don't know, you won't get points anyway. This kind of topic is often ignored in review because of its low difficulty. In fact, this is a rather wrong understanding. In the examination questions of postgraduate courses, there are often questions that directly examine the memory of a certain knowledge point. For this kind of topic, candidates should be able to reproduce this knowledge point accurately, comprehensively and completely. Any ambiguity and omission will result in extremely regrettable loss of points. We suggest that readers, when reviewing, must take the above-mentioned "accuracy, comprehensiveness and completeness" as the standard to demand themselves. If they can't reach it, it means they still have to work hard. On this point, we will emphasize it in the later chapters, and let it run through the whole review process of discrete mathematics.
The definition of discrete mathematics is mainly distributed in the relations and functions of set theory, as well as in groups, rings, fields, lattices and Boolean algebras of algebraic systems. Be sure to learn by heart and understand well.
2. Strong methodology.
In the proof of discrete mathematics, the method is very strong. If you know how to prove a problem, you can prove it easily, otherwise you will get twice the result with half the effort. Therefore, in the usual review, we should be good at summing up, so that we can be comfortable with unfamiliar questions. In this book, we have summarized many problem-solving methods for readers. Readers should first be familiar with and know how to use these methods. At the same time, we also encourage readers to think hard and explore as many solutions to a problem as possible.
3. There is poverty.
Because discrete mathematics is inflexible, it is difficult to work out new problems.