Question World

MCA Semester 2 Question Paper

MCA 201--ORGANIZATIONAL STRUCTURE AND PERSONNEL MANAGEMENT(2006-2007)*
Download--

MCA 202--DATA AND FILE STRUCTURE USING ‘C’(2006-2007)
Download--

MCA 203--UNIX AND SHELL PROGRAMMING(2006-2007)
Download--

MCA 204--PARADIGMS OF PROGRAMMING(2006-2007)
Download--

MCA 205--SYSTEM ANALYSIS AND DESIGN(2006-2007)
Download--

MCA 206--COMPUTER ARCHITECTURE & MICROPROCESSOR(2006-2007)
Download--


Note * mark have no link Read More......

MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE MCA 101

Unit-I
Relation: Type and compositions of relations, Pictorial representation of relations, Closures of relations,
Equivalence relations, Partial ordering relation.
Function: Types, Composition of function, Recursively defined function
Mathematical Induction: Piano’s axioms, Mathematical Induction
Discrete Numeric Functions and Generating functions
Simple Recurrence relation with constant coefficients, Linear recurrence relation without constant
coefficients, Asymptotic Behavior of functions
Algebraic Structures: Properties, Semi group, Monoid, Group, Abelian group, properties of group,
Subgroup, Cyclic group, Cosets, Permutation groups, Homomorphism, Isomorphism and Automorphism
of groups.
Unit –II
Propositional 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 Diagram, Lattices: Introduction, Ordered set, Hasse diagram of
partially ordered set, Consistent enumeration, Isomorphic ordered set, Well ordered set, Lattices, Properties
of lattices, Bounded lattices, Distributive lattices, and Complemented lattices.
Unit-III
Introduction to defining language, Kleene Closure, Arithmetic expressions, Chomsky Hierarchy, Regular
expressions, Generalized Transition graph.
Unit-IV
Conversion of regular expression 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, and Introduction
to Turing Machine and its elementary applications to recognition of a language and computation of
functions.
References
1. Liptschutz, Seymour, “Discrete Mathematics”, TMH
2. Trembley, J.P & R. Manohar, “Discrete Mathematical Structure with Application to Computer
Science”, TMH
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 and
Computation”, Narosa Publishing House, New Delhi
8. C.L.Liu, “Elements of Discrete Mathematics”, McGraw Hill”
9. Peter Grossman, “Discrete Mathematics for Computer”, Palgrave Macmillan




Unit-1
Accounting: Principles, concepts and conventions, double entry system of accounting, Ledger posting and
Trial balance.
Final accounts: Trading, profit and loss accounts and balance sheet of sole proprietary concern 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 of cash flows,
annuity. Practical applications of compounding and present value techniques.
Long-term sources of finance: Introduction 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(Present value, NPV, IRR)
Ratio Analysis: Meaning, advantages, limitations of ratio analysis, Types of ratios and their usefulness.
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 marginal costing.
Inventory control system: The need, cost of inventory, methods of inventory costing.
Unit-V
Introduction to Computerized Accounting System: Coding logic and codes required, master files,
transaction files, introduction to documents used for data collection. Processing of different files and
outputs obtained.
References:
1. S.N. Maheswari & S. K. Maheswari, “Introduction to Financial Accountancy”, Vikas Publication.
2. S.N. Maheswari & S. K. Maheswari, “Advanced Accountancy”, Vikas Publication.
3. S.N. Maheswari & S. K. Maheswari, “Financial Management”, Viaks 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.



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-map simplification, Half
Adder, Full Adder, Subtractor, 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), Instruction Cycle,
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 Registers
Unit-III (Memory Organization)
Memory Hierarchy, Main memory (RAM/ROM chips), Auxiliary memory, Associative memory, Cache
memory, Virtual Memory, Memory Management Hardware, hit/miss ratio, magnetic disk and its
performance, magnetic Tape etc.
Unit-IV (I/O Organization)
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), Assembly Instruction
Set, Assembly language program of (8085): Addition of two numbers, Subtraction, Block Transfer, find
greatest number, Table search, Numeric Manipulation, Introductory Concept of pipeline, Flynn’s and
Feng’s Classification, Parallel Architectural classification.
References:
1. William Stalling, “Computer Organization & Architecture”, Pearson education Asia
2. Mano Morris, “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.



Unit – I
Introduction To Computers: Computer hardware Components, Disk Storage, memory, keyboard, mouse,
printers, monitors, CD etc., and their functions, Comparison Based analysis of various hardware
components.
Unit – II
Basic operating System Concepts: MS-DOS, WINDOWS, Functional Knowledge of these operating
systems. Introduction to Basic Commands of DOS, Managing File and Directories in various operating
Systems, Introduction to Internet, Basic terms related with Internet, TCP/IP.
Unit – III
Programming in C: History, Introduction to C Programming Languages, Structure of C programs,
compilation and execution of C programs, Debugging Techniques, Data Types and Sizes, Declaration of
variables, Modifiers, Identifiers and keywords, Symbolic constants, Storage classes (automatic, external,
register and static), Enumerations, command line parameters, Macros, The C Preprocessor.
Unit – IV
Operators: Unary operators, Arithmetic & logical operators, Bit wise operators, Assignment operators and
expressions, Conditional expressions, Precedence and order of evaluation.
Control statements: if-else, switch, break, continue, the comma operator, goto statement.
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 functions, Arrays and strings.
Unit – V
Structure and Union: definition and differences, self-referential structure.
Pointers: value at (*) and address of (&) operator, pointer to pointer, Dynamic Memory Allocation, calloc
and malloc functions, array of pointers, function of pointers, structures and pointers.
L T P
3 1 0
(4)
File Handling in C: opening and closing a data file, creating a data file, read and write functions,
unformatted data files.
References:
1. V. Rajaraman, “Fundamentals of Computers”, PHI
2. Peter Norton’s, “Introduction to Computers”, TMH
3. Hahn, “The Internet complete reference”, TMH
4. Peter Norton’s, “DOS Guide”, Prentice Hall of India
5. Gottfried, “Programming in C”, Schaum’s Series, Tata McGraw Hill
6. Kernighan, Ritchie, “The C Programming Language”, PHI
7. Yashwant Kanitkar, “Working with C”, BPB
8. Yashwant Kanitkar, “Pointer in C”, BPB
9. Yashwant Kanitkar, “Let us C”, BPB
10. Bajpai, Kushwaha, Yadav, “Computers & C Programming”, New Age
11. E. Balagurusamy, “Programming in ANSI C”, TMH


Unit-I
Floating point Arithmetic: Representation of floating point numbers, Operations, Normalization, Pitfalls
of floating point representation, Errors in numerical computation
Iterative Methods: Zeros of a single transcendental equation and zeros of polynomial using Bisection
Method, Iteration Method, Regula-Falsi method, Newton Raphson method, Secant method, Rate of
convergence of iterative methods.
Unit-II
Simultaneous Linear Equations: Solutions of system of Linear equations, Gauss Elimination direct
method and pivoting, Ill Conditioned system of equations, Refinement of solution. Gauss Seidal iterative
method, Rate of Convergence
Interpolation and approximation: Finite Differences, Difference tables
Polynomial Interpolation: Newton’s forward and backward formula
Central Difference Formulae: Gauss forward and backward formula, Stirling’s, Bessel’s, Everett’s formula.
Interpolation with unequal intervals: Langrange’s Interpolation, Newton Divided difference formula,
Hermite’s Interpolation
Approximation of function by Taylor’s series and Chebyshev polynomial
Unit-III
Numerical Differentiation and Integration: Introduction, Numerical Differentiation, Numerical
Integration, Trapezoidal rule, Simpson’s rules, Boole’s Rule, Weddle’s Rule Euler- Maclaurin Formula
Solution of differential equations: Picard’s Method, Euler’s Method, Taylor’s Method,
Runge-Kutta methods, Predictor-corrector method, Automatic error monitoring, stability of solution.
Unit-IV
Curve fitting, Cubic Spline and Approximation: Method of least squares, fitting of straight lines,
polynomials, 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, forecasting models and methods.
Statistical Quality Controls methods
Testing of Hypothesis: Test of significance, Chi-square test, t-test, ANOVA, F-Test
Application to medicine, agriculture etc.
References:
1. Rajaraman V., “Computer Oriented Numerical Methods”, PHI
2. Gerald & Wheatley, “Applied Numerical Analyses”, AW
3. Jain, Iyengar and Jain, “Numerical Methods for Scientific and Engineering Computations”, New
Age Int.
4. Grewal B. S., “Numerical methods in Engineering and Science”, Khanna Publishers, Delhi
5. T. Veerarajan, T Ramachandran, “Theory and Problems in Numerical Methods”, TMH
6. Pradip Niyogi, “Numerical Analysis and Algorithms”, TMH
7. Francis Scheld, “Numerical Analysis”, TMH
9. Gupta S. P., “Statistical Methods”, Sultan and Sons



Unit 1
Rules of sum and products, Permutation, Combination, Permutation groups and application, Probability,
Ramsey theory, Discrete numeric function and generating function, Combinatorial problems, Difference
equation.
Unit II
Recurrence Relation-Introduction, Linear recurrence relation with constant coefficient,
Homogeneous solution, Particular solution, Total solution, Solution by the method of generating function.
Unit III
Graphs, sub-graphs, some basic properties, Walks, Path & circuits, Connected graphs, Disconnected graphs
and component, Eular and Hamiltonian graphs, Various operation on graphs, Tree and fundamental
circuits, Distance diameters, Radius and pendent vertices, Rooted and binary trees, Counting trees,
Spanning trees, Finding all spanning trees of a graph and a weighted graph.
Unit IV
Cut-sets and cut vertices, some properties, All cut sets in a graph, Fundamental circuit and cut sets,
Connectivity and seperatability, Network flows, mincut theorem, Planar graphs, Combinatorial and
geometric dual, Kuratowski to graph detection of planarity, Geometric dual, Some more criterion of
planarity, Thickness and Crossings, Vector space of a graph and vectors, basis vectors, cut set vector,
circuit vector, circuit and cut set verses sub spaces, orthogonal vector and sub space.
Incidence matrix of graphs, sub matrices of A(G), circuit matrix, cut set matrix, path matrix and
relationship among Af, Bf, Cf, fundamental circuit matrix and range of Bf adjacency matrix, rank nullity
theorem.
Unit V
Coloring and covering partitioning of graph, Chromatic number, Chromatic partitioning, Chromatic
polynomials, Matching, covering, Four color problem, Directed graph, Types of directed 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 types, Counting of labeled
and unlabeled trees, Polya’s theorem, Graph enumeration with polyas theorem, Graph theoretic algorithm.
References
1. Deo Narsing, “Graph Theory with applications to engineering & computer science”, PHI
2. Tremblay & Manohar, “ Discrete mathematical structures with applications to computer
Science”, TMH
3. Joshi K. D., “Fundamental of discrete mathematics”, New Age International
4. John Truss, “Discrete mathematics for computer scientist”
5. C. L. Liu, “Discrete mathematics” Read More......

Syllabus: COMBINATORICS & GRAPH THEORY

Unit 1
Rules of sum and products, Permutation, Combination, Permutation groups and application, Probability, Ramsey theory, Discrete numeric function and generating function, Combinatorial problems, Difference equation.
Unit II
Recurrence Relation-Introduction, Linear recurrence relation with constant coefficient,
Homogeneous solution, Particular solution, Total solution, Solution by the method of generating function.
Unit III
Graphs, sub-graphs, some basic properties, Walks, Path & circuits, Connected graphs, Disconnected graphs and component, Eular and Hamiltonian graphs, Various operation on graphs, Tree and fundamental circuits, Distance diameters, Radius and pendent vertices, Rooted and binary trees, Counting trees, Spanning trees, Finding all spanning trees of a graph and a weighted graph.
Unit IV
Cut-sets and cut vertices, some properties, All cut sets in a graph, Fundamental circuit and cut sets, Connectivity and seperatability, Network flows, mincut theorem, Planar graphs, Combinatorial and geometric dual, Kuratowski to graph detection of planarity, Geometric dual, Some more criterion of planarity, Thickness and Crossings, Vector space of a graph and vectors, basis vectors, cut set vector, circuit vector, circuit and cut set verses sub spaces, orthogonal vector and sub space. Incidence matrix of graphs, sub matrices of A(G), circuit matrix, cut set matrix, path matrix and relationship among Af, Bf, Cf, fundamental circuit matrix and range of Bf adjacency matrix, rank nullity theorem.
Unit V
Coloring and covering partitioning of graph, Chromatic number, Chromatic partitioning, Chromatic
polynomials, Matching, covering, Four color problem, Directed graph, Types of directed 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 types, Counting of labeled and unlabeled trees, Polya’s theorem, Graph enumeration with polyas theorem, Graph theoretic algorithm.





References
1. Deo Narsing, “Graph Theory with applications to engineering & computer science”, PHI
2. Tremblay & Manohar, “ Discrete mathematical structures with applications to computer
Science”, TMH
3. Joshi K. D., “Fundamental of discrete mathematics”, New Age International
4. John Truss, “Discrete mathematics for computer scientist”
5. C. L. Liu, “Discrete mathematics” Read More......