Discrete Mathematics for Computer Scientists and Mathematicians
Mott, Joe L.
Discrete Mathematics for Computer Scientists and Mathematicians - 2nd Ed. - New Delhi PRENTICE HALL, 1986 - xiv, 751 p. 18x24 cm
This is a lucidly written fine-tuned introduction to discrete mathematics. It is eminently suited for students pursuing BCA, MCA and B.E./B.Tech courses. Considering the importance of the subject, quite a number of universities have sought to introduce discrete mathematics as a core subject in the engineering curriculum. Table of Contents Preface. Acknowledgments. A Note to the Reader. Foundations. Elementary Combinatorics. Recurrence Relations. Relations and Digraphs. Graphs. Boolean Algebras. Network Flows. Representation and Manipulation of Imprecision. Bibliography. Index.
Including with reference and index
8120315022
Mathematics, Discreet Mathematics, Sets, Fundamentals of Logic, Elementary Combination, Recurrence Relation, Relation and Digraph, Graphs, Boolean Algebra, Network Flows, Fuzzy Sets, Possibility Theory
511.6 / MOT
Discrete Mathematics for Computer Scientists and Mathematicians - 2nd Ed. - New Delhi PRENTICE HALL, 1986 - xiv, 751 p. 18x24 cm
This is a lucidly written fine-tuned introduction to discrete mathematics. It is eminently suited for students pursuing BCA, MCA and B.E./B.Tech courses. Considering the importance of the subject, quite a number of universities have sought to introduce discrete mathematics as a core subject in the engineering curriculum. Table of Contents Preface. Acknowledgments. A Note to the Reader. Foundations. Elementary Combinatorics. Recurrence Relations. Relations and Digraphs. Graphs. Boolean Algebras. Network Flows. Representation and Manipulation of Imprecision. Bibliography. Index.
Including with reference and index
8120315022
Mathematics, Discreet Mathematics, Sets, Fundamentals of Logic, Elementary Combination, Recurrence Relation, Relation and Digraph, Graphs, Boolean Algebra, Network Flows, Fuzzy Sets, Possibility Theory
511.6 / MOT