Discrete mathematics for new technology
Author(s)
Bibliographic Information
Discrete mathematics for new technology
A. Hilger, c1992
- : hbk
- : pbk
Available at / 29 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
- Volume
-
: hbk ISBN 9780750301350
Description
In a comprehensive yet easy-to-follow manner, Discrete Mathematics for New Technology follows the progression from the basic mathematical concepts covered by the GCSE in the UK and by high-school algebra in the USA to the more sophisticated mathematical concepts examined in the latter stages of the book. The book punctuates the rigorous treatment of theory with frequent uses of pertinent examples and exercises, enabling readers to achieve a feel for the subject at hand. The exercise hints and solutions are provided at the end of the book. Topics covered include logic and the nature of mathematical proof, set theory, relations and functions, matrices and systems of linear equations, algebraic structures, Boolean algebras, and a thorough treatise on graph theory.
Although aimed primarily at computer science students, the structured development of the mathematics enables this text to be used by undergraduate mathematicians, scientists, and others who require an understanding of discrete mathematics.
Table of Contents
Sections include: Logic: Propositions and truth tables. Logical equivalence and logical implication. Algebra of propositions. Arguments in predicate logic Mathematical proof: Axioms and axiom systems. Mathematical induction. Sets: Operations on sets. Algebra of sets. Relations: Intersections and unions. Hasse diagrams. Functions: Injections and surjections. Databases - functional dependence and normal forms. Matrix algebra: Operations. The inverse of a matrix. Systems of linear equations: Matrix inverse method. Gaussian elimination. Algebraic structures: Some families of groups. Substructures. Morphisms. Boolean algebra: Switching circuits. Logic networks. Graph theory: Paths and circuits. Isomorphism of graphs. Trees. Applications of graph theory: Searching strategies. Networks and flows.
- Volume
-
: pbk ISBN 9780750301367
Description
Discrete Mathematics for New Technology has been designed to cover the core mathematics requirement for undergraduate computer science students in the UK and the USA. This has been approached in a comprehensive way whilst maintaining an easy to follow progression from the basic mathematical concepts covered by the GCSE in the UK and by high-school algebra in the USA, to the more sophisticated mathematical concepts examined in the latter stages of the book. The rigorous treatment of theory is punctuated by frequent use of pertinent examples. This is then reinforced with exercises to allow the reader to achieve a "feel" for the subject at hand. Hints and solutions are provided for these brain-teasers at the end of the book. Although aimed primarily at computer science students, the structured development of the mathematics enables this text to be used by undergraduate mathematicians, scientists and others who require an understanding of discrete mathematics. The topics covered include: logic and the nature of mathematical proof, set theory, relations and functions, matrices and systems of linear equations, algebraic structures, Boolean algebras and a thorough treatise on graph theory. The authors have extensive experience of teaching undergraduate mathematics at colleges and universities in the British and American systems. They have developed and taught courses for a variety of non-specialists and have established reputations for presenting rigorous mathematical concepts in a manner which is accessible to this audience. Their current research interests lie in the fields of algebra, topology and mathematics education. Discrete Mathematics for New Technology is therefore a rare thing; a readable, friendly textbook designed for non-mathematicians, presenting material which is at the foundations of mathematics itself. It is essential reading.
Table of Contents
Logic: Propositions and truth values. Logical connectives and truth tables. Tautologies and contradictions. Logical equivalence and logical implication. The algebra of propositions. More about conditionals. Arguments. Predicate logic. Arguments in predicate logic. Mathematical proof: The nature of proof. Axioms and axiom systems. Methods of proof. Mathematical induction. Sets: Sets and membership. Subsets. Operations on sets. Counting techniques. The algebra of sets. Families of sets. The cartesian product. Relations: Relations and their representations. Properties of relations. Intersections and unions of relations. Equivalence relations and partitions. Order relations. Hasse diagrams. Application: relational databases. Functions: Definitions and examples. Composite functions. Injections and surjections. Bijections and inverse functions. More on cardinality. Databases: functional dependence and normal forms. Matrix algebra: Introduction. Some special matrices. Operations on matrices. Elementary matrices. The inverse of a matrix. Systems of linear equations: Introduction. Matrix inverse method. Gauss-Jordan elimination. Gaussian elimination. Algebraic structures: Binary operations and their properties. Algebraic structures. More about groups. Some families of groups. Substructures. Morphisms. Group codes. Boolean algebra: Introduction. Properties of Boolean algebras. Boolean functions. Switching circuits. Logic networks. Minimization of Boolean expressions. Graph theory: Definitions and examples. Paths and circuits. Isomorphism of graphs. Trees. Planar graphs. Directed graphs. Applications of graph theory: Introduction. Rooted trees. Sorting. Searching strategies. Weighted graphs. The shortest path and travelling salesman problems. Networks and flows. References and further reading. Hints and solutions to selected exercises. Index.
by "Nielsen BookData"