Discrete mathematics /
Bisht, R. K.
Discrete mathematics / R.K. Bisht (Associate Professor, Department of Computer Science and Applications, Amrapali Group of Institutes, Haldwani (Uttarakhand)), H.S. Dhami (Vice-Chancellor, Kumaun University, Nainital). - New Delhi, India : Oxford University Press, 2015 - xxiv, 600 p. : illustrations ; 23 cm. - Oxford higher education .
Related resources available online.
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
"A textbook designed for the students of computer science engineering, information technology, and computer applications to help them develop the foundation of theoretical computer science ... Adopting a solved problems approach to explain the concepts, the book presents numerous theorems, proofs, practice exercises, and multiple-choice questions."--Page 4 of cover.
9780199452798 0199452792 (pbk)
Mathematics
Computer science--Mathematics.
510 / B5419
Discrete mathematics / R.K. Bisht (Associate Professor, Department of Computer Science and Applications, Amrapali Group of Institutes, Haldwani (Uttarakhand)), H.S. Dhami (Vice-Chancellor, Kumaun University, Nainital). - New Delhi, India : Oxford University Press, 2015 - xxiv, 600 p. : illustrations ; 23 cm. - Oxford higher education .
Related resources available online.
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
"A textbook designed for the students of computer science engineering, information technology, and computer applications to help them develop the foundation of theoretical computer science ... Adopting a solved problems approach to explain the concepts, the book presents numerous theorems, proofs, practice exercises, and multiple-choice questions."--Page 4 of cover.
9780199452798 0199452792 (pbk)
Mathematics
Computer science--Mathematics.
510 / B5419
