MCA-103 Discrete Mathematical Structures

[vc_row][vc_column width=”2/3″][vc_column_text]

MCA-103 Discrete Mathematical Structures !

Group and Subgroups: Group axioms, Permutation Groups, Subgroups, Cosets, Normal subgroups, Semi-groups, Free Semi-groups,Modular arithmetic,grammars, language, Regular Expression,Finite State Machine.

Graphs: Directed and undirected graphs, chains, Circuits, paths, Cycles, connectivity, Adjacency and incedence matrices,Algorithms for determining cycle and minimal paths, Trees, polish notation , Flows in networks.

Lattices and Boolean Algebra: Relations to partial ordering, Lattices, Hasse diagram, Axiomatic definition of Boolean algebra as algebraic structures with two operations, Boolean Functions,Switching circuits, Gate circuits.

Finite Fields: Definition Representation, Structure, Integral domain Irreducible polynomial, Polynomial roots, Splitting field.

[/vc_column_text][/vc_column][vc_column width=”1/3″][vc_wp_custommenu nav_menu=”160″][/vc_column][/vc_row]

Leave a Reply

Your email address will not be published. Required fields are marked *