Everyone

Arvind Kumar

Ice Cream Sandwich

It is designed swipe based for engineering student of all streams to learn  discrete mathematics. It almost cover all important topics which are covered chapter wise.

Chapter 1 Set Theory, Relation, Function, Theorem Proving Techniques	

1.	Set Theory		

2.	countable and uncountable sets		

3.	Venn Diagrams		

4.	proofs of some general identities on sets Relation in Venn Diagrams		

5.	types of relation		

6.	composition of relations		

7.	Equivalence relation		

8.	Partial ordering relation	

9.	one-to-one Function		

10.	into and onto function		

11.	Inverse Functions		

12.	Pigeonhole Principle

Chapter 2 Algebraic Structures		

1.	Algebraic structures		

2.	Abelian group		

3.	Subgroups		

4.	cyclic group		

5.	Homomorphism and isomorphism of Groups		

6.	Rings and Fields

Chapter 3 Propositional Logic		

1.	Proposition		

2.	Conditional Statements		

3.	Truth Tables of Compound Propositions		

4.	Logic and Bit Operations		

5.	PROPOSITIONAL EQUIVALENCES		

6.	Logical Equivalences		

7.	Constructing New Logical Equivalences		

8.	Predicates	

9.	Quantifiers		

10.	Infinite States and Infinite State Transitions		

11.	Finite state machines as language recognizers

Chapter 4 Graph Theory		

1.	Introduction of graphs		

2.	Basic Terms of Graph Theory		

3.	Planer graphs		

4.	multigraph		

5.	isomorphic Graph		

6.	paths, cycles, trails, and circuits		

7.	Shortest paths			

8.	Eulerian and Hamiltonian paths and circuits

9.	Graph coloring		

10.	chromatic number		

11.	Homomorphism and isomorphism of Groups

Chapter 5 Posets, Hasse Diagram and Lattices

1.	Posets, Hasse Diagram		

2.	ordered set		

3.	Hasse diagrams		

4.	isomorphic ordered set		

5.	well ordered set		

6.	properties of Lattices		

7.	bounded and complemented lattices		

8.	Combinatorics	

9.	Permutation and combination		

10.	Binomial Theorem		

11.	Introduction to Recurrence Relation and Recursive algorithms		

12.	Linear recurrence relations with constant coefficients		

13.	Homogeneous solutions

</div> <div jsname="WJz9Hc" style="display:none">Hal ini dirancang menggesek berdasarkan untuk mahasiswa teknik dari semua aliran belajar matematika diskrit. Hampir mencakup semua topik penting yang akan dibahas bab bijaksana.

Bab 1 Teori, Hubungan, Fungsi, Teorema Membuktikan Teknik

1. Teori

2. dihitung dan terhitung set

3. Venn Diagram

4. bukti dari beberapa identitas umum pada set Hubungan di Venn Diagram

5. jenis hubungan

6. komposisi hubungan

7. Kesetaraan hubungan

8. Partial memesan hubungan

9. satu-ke-satu Fungsi

10. ke dalam dan ke fungsi

11. Fungsi Inverse

12. Prinsip Pigeonhole

Bab 2 Struktur Aljabar

1. struktur aljabar

2. kelompok Abelian

3. Subkelompok

4. kelompok siklik

5. homomorfisma dan isomorfisma dari Grup

6. Rings dan Fields

Bab 3 proposisional Logika

1. Proposisi

2. Laporan Bersyarat

3. Tabel Kebenaran Proposisi Majemuk

4. Logika dan Bit Operasi

5. ekuivalensi proposisional

6. Ekivalensi Logical

7. Membangun Ekivalensi Logical New

8. Predikat

9. Quantifiers

10. Tak Terbatas Amerika dan Tak Terbatas Negara Transisi

11. mesin negara Finite sebagai recognizers bahasa

Bab 4 Teori Grafik

1. Pengenalan grafik

2. Syarat Dasar Teori Grafik

3. Planer grafik

4. Multigraph

5. Grafik isomorfik

6. jalur, siklus, jalan, dan sirkuit

7. jalur terpendek

8. Eulerian dan Hamiltonian jalur dan sirkuit

9. Grafik mewarnai

10. bilangan kromatik

11. homomorfisma dan isomorfisma dari Grup

Bab 5 Posets, Hasse Diagram dan Lattices

1. Posets, Hasse Diagram

2. memerintahkan set

3. diagram Hasse

4. isomorfik memerintahkan set

5. baik memerintahkan set

6. sifat Lattices

7. dibatasi dan dilengkapi kisi

8. Kombinasi

9. Permutasi dan kombinasi

10. Binomial Teorema

11. Pengantar kekambuhan Hubungan dan Rekursif algoritma

12. Linear hubungan kekambuhan dengan koefisien konstan

13. solusi homogen</div> <div class="show-more-end">

Discrete Mathematics

Versi Terakhir dari Discrete Mathematics

Versi lain