MATHEMATICS FOR COMPUTER SCIENCE ---- SEM I

Mathematics for Computer Science

UNIT I

Mathematical Logic: Statement Calculus – Connectives – normal forms – Predicate Calculus – Theory of inference for statement Calculus – Predicate Calculus including theory of inference.

UNIT II

Set Theory: Basic concepts of set theory – relations and ordering – functions –recursion.

UNIT III

Algebraic Structures: Semigroups – monoids- grammars and languages – groups and subgroups – Polish experiments and their compilation.

UNIT IV

Roots of Equations: Graphical Method – Bisection Method – False- Position Method – Fixed-Point Iteration – Newton-Raphson Method – Secant Method – Roots of Polynomials: Conventional Methods – Muller’s Method – Bairstow’s Method. Algebraic Equations: Gauss Elimination –Gauss-Jordan – LU Decomposition – Matrix Inverse –Gauss-Seidel.

UNIT V

Numerical Differentiation - Integration: Trapezoidal Rule – Simpson’s Rule – Romberg Integration – Differential equations: Taylor’s method – Euler’s method –Runge-Kutta 2nd and 4th order methods – Predictor – corrector methods.

Text Books

(i) J.P. Tremblay and R. Manohar, 1975, Discrete Mathematical Structures with Applications to Computer Science, Tata McGraw-Hill, New Delhi (ii) S.S. Sastri, 1977, Introductory Methods of Numerical Analysis, Prentice Hall India, New Delhi

Reference Books

(i) J. Truss, 1999, Discrete Mathematics for Computer Scientists, 2nd Edn., Addison Wesley, Boston. (ii) S. C. Chapra and R. P.Canale, 2002, Numerical Methods for Engineers, Fourth Edition, McGraw Hill International Edition. (iii) Kolman, Busby and Ross, 2005, Discrete mathematical structures, 5th edition, PHI, New Delhi. (iv) P.Niyogi, 2003, Numerical Analysis and Algorithms, Tata McGraw Hill, New Delhi.

PRACTICA III------ Data Structures Lab using C++

Data Structures Lab using C++

1. Implementation of Arrays (Single and Multi-Dimensional)
2. Polynomial Object and necessary overloaded operators.
3. Singly Linked Lists.
4. Circular Linked Lists.
5. Doubly Linked Lists.
6. General Lists.
7. Implementation of Stack (using Arrays)
8. Implementation of Queue (Using Pointers)
9. Implementation of Circular Queue (using Arrays and Pointers)
10. Evaluation of Expressions- ITP (Infix to Prefix).
11. Binary Tree implementations and Traversals using recursion.
12. Binary Search Trees.
13. Shortest path (Dijkstra’s)
14. Search methods in graphs (DFS & BFS) using recursion.

OBJECT ORIENTED PROGRAMMING WITH C++ -------------SEM II

Object Oriented Programming with C++

UNIT I

Introduction to OOP – Overview of C++ - Classes – Structures – Union – Friend Functions – Friend Classes – Inline functions – Constructors – Destructors – Static Members – Scope Resolution Operator – Passing objects to functions – Function returning objects.

UNIT II

Arrays – Pointers – this pointer – References – Dynamic memory Allocation – functions Overloading – Default arguments – Overloading Constructors – Pointers to Functions – Ambiguity in function overloading.

UNIT III

Operator Overloading – Members Operator Function – Friend Operator Function – Overloading some special operators like [ ] , ( ) , a and comma operator – Inheritance – Types of Inheritance – Protected members – Virtual base Class – Polymorphism – Virtual functions – Pure virtual functions.

UNIT IV

Class templates and generic classes – Function templates and generic functions – Overloading function templates – power of templates – Exception Handling – Derived class Exception – overhandling generic functions – Exception handling Functions – terminate () unexpected () – Uncaught – exception ()

UNIT V

Streams – Formatted I/O with ios class functions and manipulators – creating own manipulator – overloading << and >> - File I/O – Name spaces – conversion functions – Array based I/O – Standard Template Library (STL).

Text Books

(i) H. Schildt, 2003, C++ The Complete Reference, 4th Edition, Tata McGraw-Hill, New Delhi.

Reference Books

(i) J.P. Cohoon and J.W. Davidson, 1999, C++ Program Design – An Introduction to Programming and Object-oriented Design, 2nd Edition, Tata McGraw-Hill, New Delhi. (ii) Johnston, 2002, C++ programming today, PHI, New Delhi. (iii) A. N Kanthane, 2005, Object Oriented Programming with ANSI & Turbo C++ , Pearson Education, New Delhi. (iv) Farrel , 2001, Object Oriented Programming using C++ , 2 nd Edition, Thomson Learning, Singa[pore.

STATISTICAL METHODS----SEM II

Statistical Methods

UNIT I

Sample spaces - events - Axiomatic approach to probability - conditional probability - Independent events - Baye's formula - Random Variables - Continuous and Discrete random variables - distribution function of a random variables - Characteristic of distributions - Expectation, variance - coefficient of variation, moment generation function - Chebyshev's inequality

UNIT II

Bivariate distribution - conditional and marginal distributions - Discrete distributions - discrete uniform, Binomial poison and geometric Distributions - Continuous distributions - Uniform, Normal, Exponential and Gamma distributions.

UNIT III

Correlation coefficient - Rank correlation coefficient of determination - Linear Regression - Method of Least squares - Fitting of the curve of the form ax + b, ax2 + bx + c, abx and axb - multiple and partial correlation (3 - variables only).

UNIT IV

Concept of sampling – Methods of sampling - simple random sampling - Systematic sampling and stratified random sampling (descriptions only) - concepts of sampling distributions and standard error - point estimation (concepts only) - Interval Estimation of mean and proportion. Tests of Hypotheses - Critical Region - two types of Errors - Level of significance - power of the test - Large sample tests for mean and proportion - Exact tests based on Normal, t, F and Chi-square distributions.

UNIT V

Basic principles of experimentation - Analysis of variance - one way and two way classifications - computing randomized design - Randomized Block design - Time series Analysis - Measurement of Trend and Seasonal variations.

Text Books

(i) Mood, A.M., Graybill, F. and Boes, 1974, Introduction to Mathematical Statistics, McGraw-Hill. (ii) Trivedi, K.S, 1994, Probability and Statistics with Reliability, Queuing and Computer Science Applications. Prentice Hall India, New Delhi.

Reference Books

(i) Arnold O. Allen, 1978, Probability, Statistics and Queuing Theory with Computer Science Application. (ii) Bajpai, A.C. Calus, I.M. Fairley, J.A., 1979, Statistical Methods for Engineers and Scientists. John Wiley & Sons. (iii) Doughlas, C.,Montagomery, Lynwood,A. & Johnson, 1976, Forecasting and Time Series Analysis, Tata McGraw-Hill, New Delhi. (iv) Baisnab, A.P. and Manoranjan Jas, 1993, Elements of Probability and Statistics, Tata McGraw-Hill, New Delhi. (v) Kossack, C.F. and Hensschkec, C.I., Introduction to Statistics and Computer Programming, Tata McGraw-Hill, New Delhi.

MICROPROCESSORS AND ITS APPLICATIONS

Microprocessors and its Applications

UNIT I

Introduction to 8086 assembly language programming - Development steps – Construction - Writing Programs and Development Tools – Standard program structures – simple Programs – Jumps – While-do – repeat-until- Delay loops.

UNIT II

Strings – Procedures – Macros – Instruction Descriptions – Assembler Directives.

UNIT III

8086 Microcomputer – Observing Bus signals – Minimum mode System – Troubleshooting – 8086 interrupts – Interrupt Applications – Programmable timer/Counter – Interrupt Controller.

UNIT IV

Parallel Ports – Handshaking – Interfacing Digital Devices – Analog Interfacing – Industrial Control.

UNIT V

DMA – DRAMS – Cache Memories – Co-Processors – EDA Tools – 80286 80386 and 80486 microprocessors.

Text Books

(i) D. V. Hall , 1992, Microprocessors and Interfacing, Programming and Hardware, 2nd Edition, Tata McGraw-Hill, New Delhi.

Reference Books

(i) K. Udaya Kumar and B.S. Uma shankar, 1998, Advanced Microprocessors and IBM, PC Assembly Language Programming, Tata McGraw-Hill, New Delhi. (ii) A. P. Mathur, 1989, Introduction to Microprocessors, 3rd Edn., Tata McGraw-Hill, New Delhi. (iii) Yu Cheng Liu & Glenn A Gibson – 2005-Microcomputer Systems 8086/8088 Family- 2 nd Edition –PHI- New Delhi

DATA STRUCTURES -----SEM II

Data Structures

UNIT I

Abstract data types - asymptotic notations – complexity analysis – Arrays- representation of arrays – operations on arrays – ordered lists – polynomials.

UNIT II

Linked lists: Singly linked list- circular linked lists - doubly linked lists – general lists – stacks -queues - circular queues – Evaluation of expressions.

UNIT III

Trees – Binary Trees – Binary Tree Traversals – Binary Tree Representations – Binary Search Trees – Threaded Binary Trees – Application of Trees (Sets) – Representation of Graphs – Graph Implementation – Graph Traversals- Application of Graph Traversals- Minimum Cost Spanning Trees – Shortest Path Problem

UNIT IV

Internal Sorting – Optimal Sorting Time – Sorting Large Objects – Sorting with Tapes- Sorting with Disks.

UNIT V

Hashing – AVL Trees - Red-Black Trees – Splay Trees – B-Trees.

Text Books

(i) E.Horowitz, S. Sahni and Mehta, 1999, Fundamentals of Data Structures in C++, Galgotia, New Delhi

Reference Books

(i) G. L. Heileman, 1996, Data Structures, Algorithms and Object Oriented Programming, Tata McGraw-Hill, New Delhi. (ii) A.V.Aho, J.D. Ullman, J.E. Hopcraft, 1983, Data Structures and Algorithms, Addison Wesley, Boston. (iii) S. Sahni , 2001, Data structures , Algorithms & Applications, Tata McGraw-Hill, New Delhi. (iv) Yedidyah Langsam Augensteil, Tanenbaum, Data Structures using C and C++ , PHI, New Delhi (v) Gilberg , Forouzan, 2002, Data Structures,Thomson Asia, Singapore.

MADRAS UNIVERSITY SYLLABUS FOR MCA

NOTE: The syllabus given in this blog for reference only for your actual accurate syllabus contact IDE of Madras University.

( IF U ARE STILL NOT ABLE TO FIND U R SYLLABUS PLS FOLLOW THIS BLINDLY :-) )

BEST WISHES FOR EVERYBODY TO GET THEIR TEXT BOOKS AND STUDY MATERIALS  BEFORE EXAMINATION FOR JUNE 2013 EXAMS.

Theory Papers

Mathematics for Computer Science ------ for more information on the subject contact Professor Mr. Raman  or the Maths wiz Murugan fa10 MCA.

Programming in C and Unix ---hope u got the text book for this! if not atleast come to university once.

Digital Computer Fundamentals---available in IDE counter

System Software---available in ide counter

Practical Papers

Practical – I: Programming in C

Practical – II: Unix and Shell Programming

SEMESTER II

Theory Papers

Microprocessors and its Applications

Statistical Methods

Object Oriented Programming with C++

Data Structures

Practical Papers

Practical – III: Data Structures Lab using C++. Data Structure Lab Exercise Programs

Practical – IV: Microprocessor Lab ------this one changed to pc lab ---contact lab