mca Syllabus

Discrete Mathematical Structure
Code: MM101
CONTACTS: 3L + 1 T
CREDITS: 4
Set Theory foundation mapping (bijective, surjective, injective), Relations-equivalence, Poset, Lattice
Mathematical induction, Propositional logic, Logical equivalence.
Permutation and combinations.
Generating functions, Recurrence relations.
Concepts of Graph Theory, sub-graphs, cyclic graphs.
Trees, spanning trees, binary trees.
Algorithms- Kruskal’s , Prim’s , Dijkstra’s , Flyod’s ,Warshall’s, DFS, BFS.
Isomorphism, Homomorphism of Graphs.
Finite automata – Construction & Conversion of NFA, DFA, State minimization, Mealy
M/C, Moore M/C.
Definition Of Grammars – Type 0,1,2,3.
Fuzzy sets – basic properties

Books:
1.Theory of Computer Science, Mishra & Chandrasekharan, PHI
2.Discrete Mathematics for Comp. Scientists & Mathematicians, Mott, Kandel & Baker, PHI
3.Discrete Mathematical Structure, C.L.Liu,TMH
4.Discrete Mathematical Structure, G.S.RAO,New Age International
5.Discrete Mathematics With Applications, Rosen, TMH, 5th Ed
6. Discrete Mathematics, Ash & Ash, MH.
7. Discrete Mathematical Structure, Somasundaram, PHI
8. Discrete Mathematical Structure, Dubey, EXCEL BOOKS
9. Discrete Mathematics, Iyenger, VIKAS
10.Discrete Structure and Graph Theory, Bhisma Rao,Scitech
11.Invitation to Graph Theory,Arumugam,Scitech
12. Discrete Structure and Graph Theory,S.K.S Rathore,EPH