Discrete Mathematics = 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 and exclusion, and the pigeonhole principle, among others. To help readers adapt to the course's characteristics—such as numerous concepts, abstract content, and strong logical rigor—the textbook strives to present clear, accurate concepts, rigorous yet accessible reasoning. 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 trend, the textbook has made certain selections and omissions in classical 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 flexible content and credit options to meet the teaching requirements of both single-credit and multi-credit discrete mathematics courses. 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.