Discrete Mathematical Structures(MCA603)

Course Name: 

Discrete Mathematical Structures

Programme: 

MCA

Semester: 

First

Category: 

Programme Core (PC)

Credits (L-T-P): 

(4-0-0) 4

Content: 

Fundamental of logic: Propositional and predicate calculus, Graph Theory: trees, Representations of graphs,Spanning Tree and shortest path algorithms, Planarity, Connectivity, Traversability, Colorability, Network flow algorithms, Search procedure, Recurrence relations and generating functions, Group Theory: Groups, Subgroups,Lagrange's Theorem, Cyclic groups, Permutation groups, Normal subgroups, Lattice Theory: Order relations, Partialorder, Linear order, Lattices, Boolean lattices, Boolean algebra.

References: 

J.P. Tremblay and R. Manohar, Discrete Mathematical Structures with applications to Computer Science
McGraw Hill. Judith L. Gerstring, Mathematical Structures for Computer Science, Freeman, 5th edn
Ralph P. Grimoldi, Discrete and Combinatorial Mathematics, An applied introduction, Pearson Education, 4th edn

Department: 

Mathematical and Computational Sciences
 

Contact us

B R Shankar, Associate Professor and Head
Department of MACS, NITK, Surathkal
P. O. Srinivasnagar, Mangalore - 575 025
Karnataka, India.

  • Hot line: +91-0824-2474048

Connect with us

We're on Social Networks. Follow us & get in touch.