Discrete mathmatics
Author(s)
Bibliographic Information
Discrete mathmatics
（Oxford higher education）
Oxford University Press, 2015
Available at / 1 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. [593]) and index
Description and Table of Contents
Description
Discrete Mathematics is a textbook designed for the students of computer science engineering, information technology, and computer applications to help them develop their foundations of theoretical computer science.
With a detailed introduction to the propositional logic, set theory, and relations, the book in further chapters explores the mathematical notions of functions, integers, counting techniques, probability, discrete numeric functions and generating functions, recurrence relations, algebraic structures, poset and lattices. The discussion ends with the chapter on theory of formal and finite automata, graph theory and applications of discrete mathematics in various domains.
Adopting a solved problems approach to explaining the concepts, the book presents numerous theorems, proofs, practice exercises, and multiple choice questions.
Table of Contents
- 1. INTRODUCTION TO DISCRETE MATHEMATICS AND PROPOSITIONAL LOGIC 1
- 2. SET THEORY
- 3.RELATIONS
- 4. FUNCTIONS
- 5. PROPERTIES OF INTEGERS
- 6. COUNTING TECHNIQUES
- 7. FUNDAMENTALS OF PROBABILITY
- 8. DISCRETE NUMERIC FUNCTIONS AND GENERATING FUNCTIONS
- 9. RECURRENCE RELATIONS
- 10. ALGEBRAIC STRUCTURES
- 11. POSETS AND LATTICES
- 12. FORMAL LANGUAGES AND FINITE AUTOMATA
- 13. GRAPH THEORY
- 14. APPLICATIONS OF DISCRETE MATHEMATICAL STRUCTURES
by "Nielsen BookData"