8/9/2019 mcasylsem1

1/7

Subject : Mathematical Foundation of Computer Science

Code :- MCA - 101

Unit I

Relation: Type and compositions relations, Pictorial representation of relations, closures ofrelations, Equivalence relations, partial ordering relation.Function: Types, Compositions of function, recursively defined function.

Mathematical Induction: Pianos axioms, mathematical induction.Discrete numeric functions and generating functions.Simple recurrence relation with constant coefficients. Linear recurrence relation withoutconstant coefficients, asymptotic behavior of functions.Algebraic Structures: Properties, semi group, Monoid group, abelian group, properties ofgroup, subgroup, Cyclic Group, Cosets, Permutation Groups, Homomorphism, Isomorphismand Automorphism Group.

Unit II

Prepositional Logic: Preposition, first Order Logic, Basic Logical Operations Tautologies,Contradictions, Algebra of Proposition, Logical Implication, Logical Equivalence Normal forms,Inference Theory, Predicates and Quantifiers, Posets, Hasse Diagrams.Lattices: Introduction, Ordered set, Hasse diagram of partially ordered sets, Consistent

enumeration, Isomorphic ordered set, Well ordered set, Lattices, Properties of lattices,Bounded lattices, and complemented lattices.

Unit III

Introduction to Defining Language, Kleene Closure, Arithmetic expressions, ChomskyHierarchy, Regular expressions, Generalized Transition graph.

Unit IV

Conversion of regular expressions to Finite Automata, NFA, DFA, Conversion of NFA to DFA,Optimizing DFA, FA with output, Moore machine, Mealy Machine, Conversions.Unit V

Non regular language: Pumping Lemma, Myhill Nerode Theorem, Pushdown Automata andintroduction to Turing Machine and its elementary applications to recognition of a languageand computation of functions.

Reference:

1. Liptschutz, Seymour, Discrete Mathematics TMH.2. Trembley, J.P. & R. Manohar, Discrete Mathematical Structure with Applications to

Computer Science. TMS.3. Kenneth H. Rosen, Discrete Mathematics and its Applications. TMH.4. Doerr Alan & Levasseur Kenneth, Applied Discrete Structures for Computer Science.

Galgotia Pub. Pvt. Ltd.5. Gersting. Mathematical Structure for Computer Science. WH Freeman & Macmillan.6. Kumar Rajendra, Theory of Automata: Languages and Computation. PPM.7. Hopcroft J.E. Ullman J.D. Introduction to Automata Theory, Languages andComputation. Narosa Publishing House, New Delhi.8. C.L.Liu, Elements of Discrete Mathematics. McGraw Hill.9. Peter Grossman, Discrete Mathematics for Computer. Palgrave Macmillan.

8/9/2019 mcasylsem1

2/7

Subject:- Accounting And Financial Management

Code: MCA- 102

Unit I

Accounting: Principles, concepts and conventions, double entry system of accounting, Ledgerposting and Trail Balance.Final Accounts: Trading, profit and loss accounts and balance sheet of sole proprietaryconcern with normal closing entries. Introduction to manufacturing account, final account of

partnership firms, limited company.

Unit II

Financial Management: Meaning role and scope of financial management.Basic Financial Concepts: Time value of money, present value, future value of a series ofcash flows, Annuity, Practical Applications of Compounding and Present Value Techniques.Long term sources of finance: Introducing to shares, debentures, preference shares.

Unit III

Capital Budgeting: Meaning, importance difficulties, introduction to evaluation techniques-Traditional techniques (ARR Payback method). Discounting cash flow techniques (Presentvalue, NPV, IRR).

Ratio Analysis: Meaning, advantages, limitations of ratio analysis, types, of ratios and theirusefulness.

Unit IV

Costing: Nature, importance and types of cost.Marginal Costing: Nature, scope and importance of marginal costing, break-even analysis,its uses and limitations, construction of break-even charts, practical applications of marginalcosting.Inventory Control System: The need, cost of inventory, methods of inventory costing.

Unit V

Introduction to Computerized Accounting System: Coding login and codes required,

master transaction files, introduction to documents used for data collection. Processing ofdifferent files and outputs obtained.

Reference:

1. S.N.Maheswari & S.K. Maheswari, Introduction to Financial Accountancy. VikasPublication.

2. S.N.Maheswari & S.K. Maheswari, Advanced Accountancy. Vikas Publication.3. S.N.Maheswari & S.K. Maheswari, Financial Management. Vikas Publication.4. Jawahar Lal, Financial Accounting. Wheeler Publishing.5. Khan & Jain, Management Accounting. Tata McGraw Hill Publication.6. K.S. Sastry & Nand Dhamesa, The Practices of Management Accounting. Wheeler

Publishing.7. I.M. Pandey Financial Management. Vikas Publications.8. J Khan & Jain, Financial Management. Tata McGraw Hill Publication.9. Geoffrey Knott, Financial Management Palgrave Macmillan.

8/9/2019 mcasylsem1

3/7

Subject :- Computer Organiza tion

Code:- MCA- 103

Unit- I

(Representation of information and Basic building blocks)Introduction to computer, computer hardware generation, number System binary octal,Hexadecimal, Character Codes (BCD, ASCII, EBCDIC), Logic gates, Boolean Algebra, K-mapsimplifications, Half Adder, full adder, Sub tractor, Decoder, Encoders, multiplexer,

demultiplexer, Carry lookahead adder, Combinational logic Design, Flip-Flops, Registers,Counters (synchronous & asynchronous), ALU, Micro-Operation.ALU-chip, Faster Algorithm and Implementation (multiplication & Division).

Unit- II

(Basic Organization)-Von Neumann Machine (IAS Computer), Operational flow chart (Fetch, Execute), InstructionCycle, Organization of Central Processing Unit, Hardwired & micro programmed control unit,single organization, General register Organization, stack, Organization, Addressing modes,Instruction formats, data transfer & Manipulation, I/O, Organization, Bus Architecture,Programming Register.

Unit- II I

(Memory Organization)Memory Hierarchy, Main Memory (RAM/ROM chips), Auxiliary memory, Associative memory,Cache memory, Virtual memory, memory management hardware, hit/miss, ratio, magneticdisk and its performance, magnetic tape etc.

Unit- IV

(I/ O, Organisation)Peripheral Devices, I/O, interface, Modes of Transfer, Priority interrupt, direct memory access,input-output processor, and serial communication.I/O, Controllers, Asynchronous data transfer, Strobe Control, Handshaking.

Unit- V

(Process Organization)Basic Concept of 8-bit Micro Processor (8085) and 16-bit Micro Processor (8086), AssemblyInstruction set, Assembly language program of (8085). Addition of two numbers, subtraction,block transfer, find greatest number, table search, numeric manipulation, introductory conceptof pipeline, Flynns and Fengs classification, parallel architectural classification.

Reference:

1. William Stalling, Computer Organization & Architecture. Pearson education Asia.2. Mano Marris, Computer System Architecture. PHI.3. Zaky & Hamacher, Computer Organization. McGraw Hill.4. B. Ram, Computer Fundamental Architecture & Organization. New Age.5. Tannenbaum, Structured computer organization. PHI.

8/9/2019 mcasylsem1

4/7

Subject:- COMPUTER & C PROGRAMMI NG

Code:- MCA- 104

Unit- I

Introduction To Computers: Computer hardware components, Disk Storage, memory,keyboard, mouse, printers, monitors, CD etc., and their functions, comparison based analysisof various hardware components.

Unit- II

Basic Operating System Concepts: MS-DOS, WINDOWS, Functional knowledge of theseoperating systems, introduction to basic commands of DOS, Managing file and directories invarious operating systems, introduction to Internet basic terms related with Internet, TCP/IP.

Unit- II I

Programming in C: History, introduction to C Programming Languages, Structure of Cprograms, compilations, and execution of C Programs, Debugging Techniques, Data Types andSizes, Declaration of variables, Modifiers, Identifiers and keywords, symbolic constants,storage classes (automatic, external, register and static), Enumerations, command lineparameters, macros. The C Preprocessor.

Unit- IV

Operators: Unary operations, arithmetic &logical operations, bit wise operators, Assignmentoperators and expressions, Conditional expression, precedence and order of evaluation.Control Statements: if-else, switch, break, continue, the comma operator, go to statements.Loops: for, while, do-while.Functions: built in and user defined, function declaration, definition and function call,parameter passing, call by value, call by reference, recursive functions, multifile programs.Arrays: linear arrays, multidimensional arrays, passing arrays to function, arrays and strings.

Unit - V

Structure and Union: definition and differences, self-referential structure, pointer to pointer,dynamic memory allocation, calloc and malloc functions.File Handling in C: opening and closing a data file, creating a data file, read and writefunctions, unformatted data files.

References:

1. V. Rajaraman, Fundamental of Computers, PHI2. Peter Nortons, Introduction to Computers, TMH3. Hahn, The internet complete reference, TMH4. Peter Nortons, DOS Guide, Prentice Hall of India.5. Gottfried, Programming in C, Schaums series, TMH6. Kenighan, Ritchie, The C Programming Language, PHI7. Yashwant Kanitkar, Workinh with C, BPB8. Yashwant Kanitkar, Pointer in C, BPB9. Yashwant Kanitkar, Let us C, BPB10. Bajpai, Kushwaha, Yadav, Computer and C Programming, New Age.11. E. Balaguruswamy, Programming in ANSI C, TMH

8/9/2019 mcasylsem1

5/7

Subject: Computer Based Numerical and Statistical Techniques

Code: MCA 105

Unit I:

Floating Point Airthmatic: Representation of floating point numbers, operation,normalization, pitfalls of floating point representation, errors in numerical computation.Iterative method: Zeros of a single transcendental equation and zeros of polynomial using

Bisection method, iteration method, regula-falsi method, Newton rhapsody method, secantmethod, rate of convergence of iteractive methods.

Unit II

Simultaneous Linear Equation: Solution of system of linear equation, gauss eliminationdirect method and pivoting, ill conditioned system of equation, refinement of solution, gaussseidal iterative method, rate of convergence.Interpolation and approximation: Finite differences, difference tables.Polynomial interpolation: Newtons forward and backward formula.Central difference formulae: Gauss backward and forward formula, Stirlings Bessels,Everetts formula.Interpolation with unequal intervals: language interpolation, Newton divided differenceformula, hermites interpolation, approximation of function by Taylors series and Chebyshev

polynomial.

Unit III

Numerical Differentiation and Integration: introduction, numerical differentiation,numerical integration, trapezoidal rules, simpsons rule, booles rule, weddles rule, euler-maclaurin formula.Solution of differential equation: Picards method, Eulers method, Taylors method,Runge-Kutta methods, Predictor-corrector method, automatic error monitoring, stability ofsolution.

Unit IV

Curve fitting, cubic spline and approximation: Method of least squares, fitting of straight

lines, polynomial, exponential curves, etc.Frequency chart: different frequency chart like histogram, frequency curve, pi-chart.Regression analysis: linear and non-linear regression, multiple regression.

Unit V

Time series and forcasting: Moving averages, smoothening of curves, forcasting models andmethods, statistical quality control methods.Testing of Hypothesis: Test of significance, chi-square test, anova, f-test. Application tomedicine, agriculture, etc.

References:

1. Rajaraman, V, Computer oriented numerical methods, PHI2. Gerald and Wheatley, Applied numerical analysis, AW3. Jain, Iyengar and Jain, Numerical methods for scientific and engineering

computation, New Age Intl.4. Grewal, B. S, Numerical methods in engineering and science, Khanna

Publishers, Delhi.5. T. Veerajan, T. Ramachandaran, Theory and problems in Numerical

methods, TMH6. Pradip Niyogi, Numerical Analysis and algorithm, TMH7. Francis Scheld, Numerical Analysis TMH8. Gupta S. P., Statistical Methods, Sultan and Sons.

8/9/2019 mcasylsem1

6/7

Subject: Combinatorics and Graph Theory

Code: MCA 106

Unit I

Rules of sum and products, permutation, combination, permuation groups and application,probability, ramsey theory, discrete numeric function and generating function, combinatorialproblems, difference equation.

Unit II

Recurrence relation introduction, linear recurrence relation with constant coefficient.Homogeneous solution, particular solution, total solution, solution by the method of generatingfunction.

Unit III

Graphs, sub-graphs, some basic properties, walks, path and circuits, connected graphs,disconnected graphs and component, eular and Hamiltonian graphs, various operation ongraphs, tree and fundamental circuits, distance diameters, radius and pendent vertices, rootedand binary trees, counting trees, spanning trees, finding all spanning trees of a graph and aweighted graph.

Unit IV

Cut-sets and cut vertices, some properties, all cut sets in a graph, fundamental circuit and cutset, connectivity and seperatability, network flows, mincut theorem, planar graphs,combinatorial and geometric dual, kuratowski to graph detection of planarity, thickness andcrossing, vector space of a graph and vectors, basis vectors, cut set vector, circuitvector,circuit and cut set verses sub spaces, orthogonal vector and sub space. Incidencematrix of graphs, sub matrices of A (G), circuit matrix, cut set matrix, path matrix andrelationship among, A, B, C, fundamental circuit matrix and range of B adjacency matrix, ranknullity theorem.

Unit V

Coloring and covering partitioning of graph, chromatic number, chromatic partitioning,chromatic polynomials, matching, covering, four color problem, directed graph, types ofdirected graphs, directed paths and connectedness, euler digraph, trees with directed edges,fundamental circuit in digraph, matrices A, B, C of digraph adjacency matrix of digraph,enumeration and its type, counting of labeled and unlabeled trees, polyas theorem, graphenumeration with polyas theorem, graph theoretic algorithm.

References:

1. Deo Narsing, Graph Theory with application to engineering and computerscience, PHI

2. Tremblay and Manohar, Discrete mathematical structures with application tocomputer science, TMH

3. Joshi, K. D., Fundamental of discrete mathematics, New Age Intl.4. John, Truss, Discrete mathematics for computer scientist5. C. L. Liu, Discrete Mathematics.

8/9/2019 mcasylsem1

7/7

Subject:- Programming Lab

Code: MCA 171

1. Write C program to find largest of three integers.2. Write C program to check whether the given string is palindrome or not.3. Write C program to find whether the given integer is:

(i) a prime number(ii) an amstrong number.

4. Write C program for pascal triangle5. Write C program to find sum and average of n integer using linear array6. Write C program to perform addition, multiplication, transpose on matrices.7. Write C program to find fabbonacci series of iterative method using user defined

function.8. Write C program to find factorial of n by recursion using user defined function.9. Write C program to perform following operations by using user defined functions.

i) concatenationii) reverseiii) string matching

10. Write C program to find sum of n terms of series:n n*2/2! + n*3/3! n*4/4! + ---------------

11. Write C program to interchange two values usingi) call by valueii) call by reference

12. Write C program to sort the list of inegers using dynamic memory allocation.13. Write C program to display the mark sheet of a student using structure14. Write C program to perform following operations on data files:

i) read from data fileii) write to data file

15. Write C program to copy the content of one file to another file using command lineargument.

Subject: Organisation Lab

Code: MCA 172

1. Study and bread board realization of logic gates, k-map, flip-flop equation, realizationof characteristics and excitation table of various flip-flops.

2. Implementation of half adder, full adder and subtractor3. Implementation of ripple counters and registers.4. Implementation of decoder and encoder circuits.5. Implementation of multiplexer and d-multiplexer circuits.

Subject: Numeri cal Techniques Lab

Code: MCA 173

1. To implement floating point arithmetic operations i.e. addition, subtraction,multiplication and division.

2. To deduce errors involved in polynomial interpolation. Algebraic and trancedentalequation using bisection, newton, raphson. Iterative, method of false position, rate ofconversion of roots in tabular form for each of these methods.

3. To implement formulae by bessels, Newton, stirling, langreges, etc.4. To implement method of least square curve fitting.5. Implement numerical differentiation.6. Implement numerical integration using simpsons 1/3 and 3/8 rules, trapezoidal rule.7. To show frequency chart, regression analysis, linear square fit and polynomial.