Pondicherry University Syllabus MCA

I have joined the Pondicherry University as a faculty and I will teach the student of the MCA student. Can you please share the syllabus of the Pondicherry University MCA course so I can teach my student according to syllabus? I am grateful to you.

Can you provide me the syllabus for Master of Computer Applications (MCA) Program offered by Pondicherry University as I need it for preparation of the exam?

[Neelu Bhasin]

The syllabus for Master of Computer Applications (MCA) Program offered by Pondicherry University is as follows:


COMS 301: MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE

UNIT I
Mathematical Logic : Connectives Negation, Conjunction, disjunction, Statement
Formulas and TT, Conditional and Biconditional, Well formed formulas, tautologies, Equivalence of statement formulae, Duality law, Tautological implications, Functionally
complete set of connectives; Normal Forms Disjunctive, Conjunctive, Principal
disjunctive and principal conjunctive normal forms.


UNIT II
The theory of inference for statement calculus, Validity using TT, rules of inference, consistency of premises and indirect method of proof, Automatic Theorem proving- Predicate Calculus, Predicates, the statement function, variables and quantifiers.


UNIT III
Set Theory : Basic Concepts of Set theory, Notation, Inclusion and equality , Power set, Operations on sets, Set identities, Ordered pairs and n-tuples, Cartesian products - Relations and Ordering , Relations, Properties of binary relation- relation matrix and
graph of a relation, partition and covering of a set, equivalence relations, composition of
binary relations, partial ordering, partially ordered set - Functions, Definition,
composition, Inverse, Binary and n-ary operations, characteristic function of a set, hashing function- Recursions, Functions, sets and predicates.


UNIT IV
Lattices and Boolean Algebra : Lattices as partially ordered sets, properties of lattices,
Lattices as Algebraic systems, Some special lattices - Boolean algebra, functions, representation and minimization.


UNIT V
Graph theory : Definition, Examples, Paths and Cycles, Planarity, colouring graphs


TEXT BOOKS
1. J.P. Tremblay and R.Manohar, Discrete Mathematical structures with applications to Computer Science, Tata McGraw Hill publishers, 2008.
2. Robin. J.Wilson, Introduction to Graph theory. (Fourth edition)


Syllabus Master of Computer Applications (MCA) Program Pondicherry University