Cargando…

Discrete mathematics /

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Vatsa, B. S.
Otros Autores: Vatsa, Suchi
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New Delhi : New Age International (P) Ltd., 1993.
Edición:4th rev. ed.
Temas:
Acceso en línea:Texto completo

MARC

LEADER 00000cam a2200000 a 4500
001 EBOOKCENTRAL_ocn587497315
003 OCoLC
005 20240329122006.0
006 m o d
007 cr cnu---unuuu
008 100330s1993 ii o 001 0 eng d
040 |a N$T  |b eng  |e pn  |c N$T  |d IDEBK  |d OCLCQ  |d OCLCF  |d YDXCP  |d OCLCQ  |d EBLCP  |d OCLCQ  |d ZCU  |d MERUC  |d OCLCQ  |d ICG  |d OCLCQ  |d DKC  |d OCLCQ  |d OCLCO  |d OCLCQ  |d OCLCL 
019 |a 904256358  |a 909466164  |a 923652228 
020 |a 9788122425062  |q (electronic bk.) 
020 |a 8122425062  |q (electronic bk.) 
029 1 |a DEBBG  |b BV044087073 
035 |a (OCoLC)587497315  |z (OCoLC)904256358  |z (OCoLC)909466164  |z (OCoLC)923652228 
050 4 |a QA76.9.M35  |b V38 1993eb 
072 7 |a COM  |x 052000  |2 bisacsh 
072 7 |a COM  |x 037000  |2 bisacsh 
072 7 |a COM  |x 013000  |2 bisacsh 
072 7 |a COM  |x 032000  |2 bisacsh 
072 7 |a COM  |x 018000  |2 bisacsh 
072 7 |a COM  |x 014000  |2 bisacsh 
072 7 |a COM  |x 067000  |2 bisacsh 
082 0 4 |a 004.01/51  |2 22 
049 |a UAMI 
100 1 |a Vatsa, B. S. 
245 1 0 |a Discrete mathematics /  |c B.S. Vatsa, Suchi Vatsa. 
250 |a 4th rev. ed. 
260 |a New Delhi :  |b New Age International (P) Ltd.,  |c 1993. 
300 |a 1 online resource (xi, 302 pages) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
588 0 |a Print version record. 
505 0 |a Cover -- Preface to the Fourth Edition -- Contents -- Chapter 1. Mathematical Logic -- 1.1 Logical Statement or Proposition -- 1.2 Type of Propositions -- 1.3 The Propositional Calculus -- 1.4 The Negation of a Proposition -- 1.5 Disjunction -- 1.6 Conjunction -- Problem -- 1.7 Tautologies and Contradictions -- 1.8 Logical Equivalence -- Problem 1.3 -- 1.9 The Algebra of Propositions -- Problem 1.4 -- 1.10 Conditional Propositions -- 1.11 Converse, Inverse and Contrapositive Propositions -- 1.12 The Negation of a Conditional Proposition 
505 8 |a 1.13 Biconditional PropositionsProblem 1.5 -- 1.14 Arguments -- Problem 1.6 -- Chapter 2. Set Theory -- 2.1 Sets -- 2.2 Set Designation -- 2.3 Null Sets and Unit Sets -- 2.4 Special Sets of Numbers -- 2.5 Universal Set -- Problem 2.1 -- 2.6 Subsets: Proper Subsets and Equal Sets -- Problem 2.2 -- 2.7 Set Operations -- 2.8 Union Operation -- 2.9 Properties of Union Operations -- 2.10 Intersection -- 2.11 Properties of Intersection Operation -- 2.12 Distributive Properties -- 2.13 Complementation 
505 8 |a 2.14 Relative Complement (or Difference of Sets)2.15 Properties of Complement -- 2.16 Properties of Difference -- 2.17 Symmetric Difference -- Problem 2.3 -- 2.18 Power Set -- Problem 2.4 -- 2.19 Cartesian Prodcuts -- Problem 2.5 -- 2.20 Generalized Set Theory -- Problem 2.6 -- Chapter 3. Relation and Functions -- 3.1 Relation -- Problem 3.1 -- 3.2 Equivalence Relation -- 3.3 Partition -- 3.4 Partial Order Relation -- Problem 3.2 -- 3.5 Functions (Mappings) -- Problem 3.3 -- 3.6 Inverse Mapping -- 3.7 Composition of Mappings 
505 8 |a Problem 3.43.8 Binary Operations -- Problem 3.5 -- 3.9 Countable and Uncountable Sets -- Problem 3.6 -- Chapter 4. Ordered Sets and Lattices -- 4.1 Poset -- 4.2 Product Set and Order -- 4.3 Hasse Diagrams of Partially Ordered Sets -- 4.4 Minimal and Maximal, and First and Last Point -- Problem 4.1 -- 4.5 Lattices -- 4.6 Lattices and Partially Ordered Sets -- 4.7 Principle of Quality -- Problem 4.2 -- 4.8 Lattices as Algebraic Systems -- 4.9 Lattice and Order -- 4.10 Sublattices -- 4.11 Direct Product of Two Lattices 
505 8 |a 4.12 Isomorphic LatticesProblem 4.3 -- 4.13 Complete Lattice -- 4.14 Complemented Lattices -- 4.15 Distributive Lattice -- 4.16 Modular Lattices -- Problem 4.4 -- Chapter 5. Boolean Algebra and Switching Circuits -- 5.1 Introdcution -- Problem 5.1 -- 5.2 Boolean Functions -- 5.3 Normal Form -- 5.4 Fundamental Forms of Boolean/Functions -- Problem 5.2 -- 5.5 Application to Switching Networks -- Problem 5.3 -- Chapter 6. Matrices -- 6.1 Revision -- 6.2 Diagonal, Scalar, Unit and Triangular Matrix -- 6.3 Equal Matrices 
590 |a ProQuest Ebook Central  |b Ebook Central Academic Complete 
650 0 |a Computer science  |x Mathematics  |v Textbooks. 
650 7 |a COMPUTERS  |x Reference.  |2 bisacsh 
650 7 |a COMPUTERS  |x Machine Theory.  |2 bisacsh 
650 7 |a COMPUTERS  |x Computer Literacy.  |2 bisacsh 
650 7 |a COMPUTERS  |x Information Technology.  |2 bisacsh 
650 7 |a COMPUTERS  |x Data Processing.  |2 bisacsh 
650 7 |a COMPUTERS  |x Computer Science.  |2 bisacsh 
650 7 |a COMPUTERS  |x Hardware  |x General.  |2 bisacsh 
650 7 |a Computer science  |x Mathematics  |2 fast 
655 7 |a Textbooks  |2 fast 
700 1 |a Vatsa, Suchi. 
758 |i has work:  |a Discrete mathematics (Text)  |1 https://id.oclc.org/worldcat/entity/E39PCGJFdvykXhPYQwbPhm8t8C  |4 https://id.oclc.org/worldcat/ontology/hasWork 
776 0 8 |i Print version:  |a Vatsa, B.S.  |t Discrete mathematics.  |b 4th rev. ed.  |d New Delhi : New Age International (P) Ltd., 1993  |z 9788122425741 
856 4 0 |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=3017400  |z Texto completo 
938 |a EBL - Ebook Library  |b EBLB  |n EBL3017400 
938 |a EBSCOhost  |b EBSC  |n 307447 
938 |a YBP Library Services  |b YANK  |n 3291143 
994 |a 92  |b IZTAP