Discrete mathematics for new technology

Garnier, Rowan

Discrete mathematics for new technology - 1st - Bristol ; Philadelphia : A. Hilger, ©1992. - xvii, 678 pages : illustrations ;

Ch. 1. Logic. 1.1. Propositions and Truth Values. 1.2. Logical Connectives and Truth Tables. 1.3. Tautologies and Contradictions. 1.4. Logical Equivalence and Logical Implication. 1.5. The Algebra of Propositions. 1.6. More about Conditionals. 1.7. Arguments. 1.8. Predicate Logic. 1.9. Arguments in Predicate Logic --
Ch. 2. Mathematical Proof. 2.1. The Nature of Proof. 2.2. Axioms and Axiom Systems. 2.3. Methods of Proof. 2.4. Mathematical Induction --
Ch. 3. Sets. 3.1. Sets and Membership. 3.2. Subsets. 3.3. Operations on Sets. 3.4. Counting Techniques. 3.5. The Algebra of Sets. 3.6. Families of Sets. 3.7. The Cartesian Product --
Ch. 4. Relations. 4.1. Relations and Their Representations. 4.2. Properties of Relations. 4.3. Intersections and Unions of Relations. 4.4. Equivalence Relations and Partitions. 4.5. Order Relations. 4.6. Hasse Diagrams. 4.7. Application: Relational Databases --
Ch. 5. Functions. 5.1. Definitions and Examples. 5.2. Composite Functions. 5.3. Injections and Surjections. 5.4. Bijections and Inverse Functions. 5.5. More on Cardinality. 5.6. Databases: Functional Dependence and Normal Forms --
Ch. 6. Matrix Algebra. 6.1. Introduction. 6.2. Some Special Matrices. 6.3. Operations on Matrices. 6.4. Elementary Matrices. 6.5. The Inverse of a Matrix --
Ch. 7. Systems of Linear Equations. 7.1. Introduction. 7.2. Matrix Inverse Method. 7.3. Gauss-Jordan Elimination. 7.4. Gaussian Elimination --
Ch. 8. Algebraic Structures. 8.1. Binary Operations and their Properties. 8.2. Algebraic Structures. 8.3. More about Groups. 8.4. Some Families of Groups. 8.5. Substructures. 8.6. Morphisms. 8.7. Group Codes --
Ch. 9. Boolean Algebra. 9.1. Introduction. 9.2. Properties of Boolean Algebras. 9.3. Boolean Functions. 9.4. Switching Circuits. 9.5. Logic Networks. 9.6. Minimization of Boolean Expressions --
Ch. 10. Graph Theory. 10.1. Definitions and Examples. 10.2. Paths and Circuits. 10.3. Isomorphism of Graphs. 10.4. Trees. 10.5. Planar Graphs. 10.6. Directed Graphs.

"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 varied 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."--Jacket.

9780750301350 075030135X

Computer science -- Mathematics.

512 / GAR

© University of Vavuniya