Discrete Mathematics

Author: Qiao Weisheng et al.
Publisher:
Publish Date: 2005-01-01
Features: This textbook is compiled based on the teaching requirements of applied undergraduate computer science programs. The book is divided into five parts and twelve chapters, covering main topics such as propositional logic, predicate logic, sets, relations, functions, graph theory basics, typical graph theory problems, algebraic systems, groups and lattices, basic combinatorial counting methods, difference equations, the principle of inclusion-exclusion, and the pigeonhole principle, etc. To help readers adapt to the course's characteristics—such as numerous concepts, abstract content, and strong logical structure—the textbook strives to present clear, accurate, rigorous yet accessible explanations. Due to the development of information science and technology, the computer science curriculum has undergone significant changes in recent years, especially with the integration of data communication, information security theory and technology into undergraduate teaching. To accommodate this, the textbook has made certain adjustments to the traditional discrete mathematics content, setting combinatorial mathematics as a separate part. Depending on the focus of each institution's program and the number of credits, the book offers optional content and hours to meet the teaching requirements of both single-course and multi-course discrete mathematics. This textbook can serve as a teaching material for computer science programs in general applied undergraduate institutions, as well as a reference book for information systems programs or corresponding courses in non-computer science disciplines.