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">它的设计基于刷卡为所有流的工科学生学习离散数学。它几乎囊括其中涵盖章聪明的所有重要主题。

第1集理论，关系，函数，定理证明技术

1.集合论

2.数和不可数集

3.维恩图

一些普通的身份在维恩图组关系4.证明

5种关系

关系6.组成

7.等价关系

8.偏序关系

9.一对一的功能

10.进，到功能

11.反函数

12.鸽巢原理

第2章代数结构

1.代数结构

2.交换群

3.群

4.环基

5.同态和组的同构

6.环和字段

第3章命题逻辑

1.命题

2.条件语句

复合命题3.真值表

4.逻辑和位操作

5.命题等价

6.逻辑等价

7.建设新的逻辑等价

8.谓词

9.量词

10.无限的国家和无限状态转换

11.有限状态机作为语言识别器

第4章图论

图表1.简介

2.基本术语图论

3.刨床图

4.多图

5.同构图

6.路径，循环，创新，和电路

7.最短路径

8.欧拉和哈密尔顿路径和电路

9.图形着色

10色数

11.同态和组的同构

第5章偏序集，Hasse图和棱子

1.偏序集，Hasse图

2.有序集

3.哈塞图

4.同构的有序集合

5.良好有序集

格的6特性

7.界和补充格

8.组合数学

9.排列组合

10.二项式定理

11.介绍递归关系和递归算法

常系数线性12递推关系

13.均质解决方案</div> <div class="show-more-end">

Discrete Mathematics

Discrete Mathematics的最新版本

其他版本