## Thursday, January 10, 2013

### MA9221 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE SYLLABUS | ANNA UNIVERSITY MCA 2nd SEMESTER SYLLABUS REGULATION 2009 2011 2012-2013

Latest: TNEA 2014 Engineering Application Status, Counselling Date, Rank List
MA9221 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE SYLLABUS | ANNA UNIVERSITY MCA 2nd SEMESTER SYLLABUS REGULATION 2009 2011 2012-2013 BELOW IS THE ANNA UNIVERSITY SECOND SEMESTER MCA MASTER OF COMPUTER APPLICATIONS DEPARTMENT SYLLABUS, TEXTBOOKS, REFERENCE BOOKS,EXAM PORTIONS,QUESTION BANK,PREVIOUS YEAR QUESTION PAPERS,MODEL QUESTION PAPERS, CLASS NOTES, IMPORTANT 2 MARKS, 8 MARKS, 16 MARKS TOPICS. IT IS APPLICABLE FOR ALL STUDENTS ADMITTED IN THE YEAR 2011 2012-2013 (ANNA UNIVERSITY CHENNAI,TRICHY,MADURAI,TIRUNELVELI,COIMBATORE), 2009 REGULATION OF ANNA UNIVERSITY CHENNAI AND STUDENTS ADMITTED IN ANNA UNIVERSITY CHENNAI DURING 2009

MA9221 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE LT P C
3 1 0 4
UNIT I MATRIX ALGEBRA 12
Matrices, Rank of Matrix, Solving System of Equations-Eigen Values and Eigen Vectors-
Inverse of a Matrix - Cayley Hamilton Theorem
UNIT II BASIC SET THEORY 12
Basic Definitions - Venn Diagrams and set operations - Laws of set theory - Principle of
inclusion and exclusion - partitions- Permutation and Combination - Relations-
Properties of relations - Matrices of relations - Closure operations on relations -
Functions - injective, surjective and bijective functions.
UNIT III MATHEMATICAL LOGIC 12
Propositions and logical operators - Truth table - Propositions generated by a set,
Equivalence and implication - Basic laws- Some more connectives - Functionally
complete set of connectives- Normal forms - Proofs in Propositional calculus - Predicate
calculus.
UNIT IV FORMAL LANGUAGES 12
Languages and Grammars-Phrase Structure Grammar-Classification of Grammars-
Pumping Lemma For Regular Languages-Context Free Languages.
UNIT V FINITE STATE AUTOMATA 12
Finite State Automata-Deterministic Finite State Automata(DFA), Non Deterministic
Finite State Automata (NFA)-Equivalence of DFA and NFA-Equivalence of NFA and
Regular Languages.
TOTAL : 60 PERIODS
REFERENCES:
1. Kenneth H.Rosen, “ Discrete Mathematics and Its Applications”, Tata McGraw Hill,
Fourth Edition, 2002 (Unit 1,2 & 3).
2. Hopcroft and Ullman, “Introduction to Automata Theory, Languages and
Computation”, Narosa Publishing House, Delhi, 2002. ( Unit 4,5)
3. A.Tamilarasi & A.M.Natarajan, “Discrete Mathematics and its Application”, Khanna
Publishers, 2nd Edition 2005.
4. M.K.Venkataraman “Engineering Mathematics”, Volume II, National Publishing
Company, 2nd Edition,1989.