7:13 PM
Posted by
Amit Rawat

general identities on sets

composition of functions, recursively defined functions.

Theorem proving Techniques: mathematical induction (simple and strong), pigeonhole

principle, prove by contradiction.

group, properties of groups, Subgroup, cyclic groups, Cosets, factor group, Permutation groups,

Normal subgroup, Homomorphism and isomorphism of Groups, example and standard results,

Rings and Fields: definition and standard results.

ordered set, isomorphic ordered set, well ordered set, properties of Lattices, bounded I and

complemented lattices.

tautologies, Contradictions, Algebra of Proposition, logical implications, logical equivalence,

predicates, Universal and existential quantifiers.

Combination, Probabilistic Permutation & Combination

1. Liptschutz, Seymour, “** Discrete Mathematics**”, McGraw Hill. 3rd edition

**downlaod from these links**

*http://depositfiles.com/files/k1r2zrml0 *

or

http://hotfile.com/dl/35985954/cf4b8c1/Schaum_s_Outline_of_Discrete_Mathematics__3rd_Ed.rar.html

or

http://uploading.com/files/293c3acd/Schaum_s_Outline_of_Discrete_Mathematics__3rd_Ed.rar/

or

http://www.megaupload.com/?d=NE369IS6

or

http://filecom.net/oDvdZjkBiq/

or

http://hotfile.com/dl/35985954/cf4b8c1/Schaum_s_Outline_of_Discrete_Mathematics__3rd_Ed.rar.html

or

http://uploading.com/files/293c3acd/Schaum_s_Outline_of_Discrete_Mathematics__3rd_Ed.rar/

or

http://www.megaupload.com/?d=NE369IS6

or

http://filecom.net/oDvdZjkBiq/

Computer Science”, McGraw Hill, Reprint 2010

1. Discrete Mathematics & its application with combinatory and graph theory,K.H.Rosen, TMH(6th edition).

2. C.L.Liu, ‘Discrete Mathematics’ TMH.

INFORMATION AND LINKS REGARDING B.TECH C.S. Coming Soon With All Other Branch's Notes......

Powered by Blogger.

©2011- 2013 Csdoon : Easy Notes All Rights Reserved