Tuesday, January 31, 2012

MC9222 OBJECT ORIENTED PROGRAMMING ANNA UNIVERSITY MCA 2ND SEMESTER SYLLABUS | MC 9222 OBJECT ORIENTED PROGRAMMING SYLLABUS

MC9222 OBJECT ORIENTED PROGRAMMING


UNIT I FUNDAMENTALS 


Object–Oriented Programming concepts – Encapsulation – Programming Elements –
Program Structure – Enumeration Types –– Functions and Pointers – Function
Invocation – Overloading Functions – Scope and Storage Class – Pointer Types –
Arrays and Pointers – Call–by–Reference – Assertions – Standard template library.


UNIT II IMPLEMENTING ADTS AND ENCAPSULATION 


Aggregate Type struct – Structure Pointer Operators – Unions – Bit Fields – Data
Handling and Member Functions – Classes – Constructors and Destructors – Static
Member – this Pointer – reference semantics – implementation of simple ADTs.


UNIT III POLYMORPHISM 


ADT Conversions – Overloading – Overloading Operators – Unary Operator Overloading
– Binary Operator Overloading – Function Selection – Pointer Operators – Visitation –
Iterators – containers – List – List Iterators.


UNIT IV TEMPLATES 


Template Class – Function Templates – Class Templates – Parameterizing – STL –
Algorithms – Function Adaptors.


UNIT V INHERITANCE 




Derived Class – Typing Conversions and Visibility – Code Reuse – Virtual Functions –
Templates and Inheritance – Run–Time Type Identifications – Exceptions – Handlers –
Standard Exceptions.


REFERENCES:
1. Ira Pohl, “Object–Oriented Programming Using C++”, Pearson Education, Second
Edition, 2003.
2. Stanley B.Lippman, Josee Lajoie, “C++ Primer”, Pearson Education, Third Edition,
2004.
3. Kamthane,” Object Oriented Programming with ANSI and Turbo C++”, Person
Education, 2002.
4. Bhave , “ Object Oriented Programming With C++”, Pearson Education , 2004.

MA9221 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE ANNA UNIVERSITY MCA 2ND SEMESTER SYLLABUS|MA 9221 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE SYLLABUS


MA9221 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 


UNIT I MATRIX ALGEBRA 


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 


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 


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 


Languages and Grammars-Phrase Structure Grammar-Classification of Grammars-
Pumping Lemma For Regular Languages-Context Free Languages.


UNIT V FINITE STATE AUTOMATA 


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.


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.