Discrete Mathematics: MCA 101
Marks Scale : 100 marks (End Sem. Exam : 60, Int. : 40) Credits: 4
(3-1-0)
UNIT I: 15L
Sets and Relations: Definition of sets, subsets, complement of a set, universal set, intersection
and union of sets, De-Morgan’s laws, Cartesian products, Equivalent sets, Countable and
uncountable sets, minset, Partitions of sets, Relations: Basic definitions, graphs of relations,
properties of relations.
Number Theory:The Principal of induction, Euclidean algorithms the greatest common divisor,
equivalence relation, Fibonacci numbers.
UNIT II: 15L
Matrix:Introduction of a Matrix, its different kinds, matrix addition and scalar multiplication,
multiplication of matrices, transpose etc. Square matrices, inverse and rank of a square matrix,
solving simultaneous equations using Gauss elimination, Gauss Jordan Methods, Matrix
Inversion method.
Combinations:Basics of counting, the Pigeonhole principle, permutation and combination,
Discrete Probability generating functions, recurrence notation, Divide and conquer relation,
Inclusion and exclusion with applications.
UNIT III: 15L
Propositional Logic: Proposition, First order logic, Basic logical operations, Tautologies,
Contradictions, Algebra of Proposition, Logical implication, Logical equivalence, Normal forms,
Inference Theory, Predicates and quantifiers. Principle of mathematical Induction.
Graph Theory : A general introduction, simple and multi graphs, directed and undirected
graphs, Eulerian and Hamiltonian Graphs, Shortest path algorithms, Chromatic number, Bipartite
graph, graph coloring,the travelling salesman problem,planargraphs,cutsets,minimum spanning
tree.
UNIT IV: 15L
Differential and Integral Calculas:
Binomial Theorem, Trigonometric functions and their graphs, Real numbers and real line,
Functions.Limit and Continuity: L’Hospital rule, Continuity, Tangent lines, Differentiation rules,
Implicit differentiation, Mean value Theorem, Extreme values, Asymptotes.
Integration: Indefinite integrals, Integration by parts, Partial Fractions, Integration by
substitution,Definite Integrals, Fundamentals theorem of calculus(statement only), Properties of
integrals,area, Evaluation of definite integrals.
Text Books:
1. Kenneth N. Rosen : “Discrete Mathematics and its applications”, Tata McGraw
Hill,Seventh Edition (2011).
2. C.L. Liu : “Elements of Discrete mathematics”, Tata McGraw Hill,Third Edition (2008).
3. Norman.L.Biggs: “DiscreteMathematics”,Oxford University Press,Second Edition
(2003).
4. Vinay Kumar : “Discrete Mathematics”, BPB, India (2002).
Programming in C: MCA 102
Marks Scale : 100 marks (End Sem. Exam : 60, Int. : 40) Credits: 4
(3-1-0)
Introduction to ‘C’ Language: History, Function as building blocks, Language Fundamentals,
Data Types, Types of operators, Operator Precedence and Associativity, Expression, Statement
and types of statements.
Built-in Function and Control Structure: Console based I/O and related built-in I/O function:
printf(), scanf(), getch(), getchar(), putchar(); Concept of header files, Preprocessor directives,
Control Structures.
Unit II: 15L
Functions: Basic types, Declaration and definition, Function Call, Types of function, Parameter
passing: Call by value &Call by reference, Scope of variables, Storage classes, Recursion.
Arrays: Definition, declaration and initialization, Types of Definition, Accessing and displaying
array elements, Sorting arrays, Arrays and function, Memory representation of array.
Pointers: Definition and declaration, Initialization of pointer, Indirection operator, address of
operator, Pointer arithmetic, Dynamic memory allocation, Arrays and Pointers, Function and
Pointers.
Unit III: 15L
Strings: Definition, declaration and initialization of strings, Standard library functions,
Implementation without using standard library functions.
Structures: Definition and declaration, Variable initialization, Accessing fields and structure
operations, Nested structures, Union: Definition and declaration.
C Preprocessor: Definition, Macro substitution directives, File inclusion directives, Conditional
compilation, Storage Classes, Storage Classes in a single source file: auto, extern and static,
register, Storage Classes in a multiple source files: extern and static
Unit IV: 15L
File Handling: Definition, Opening modes of files, Standard function: fopen(), fclose(),eof(),
fseek(), rewind(), Using text files: fgetc(), fputc(), fprintf(), fscanf().
Graphics in C: Introduction,the display adapters, setting the text modes, drawing object in C
:line, circle, rectangle and ellipse. Command Line Arguments.
Text Books:
1. YashavantKanetkar: Let us C, 13th Edition, BPB publications (2012).
2. E. Balaguruswamy: Programming in ANSI C, 6th Edition, TMG (2012).
3. Herbert Schildt, C: The Complete Reference, 4th Edition, TMH (2000).
4. Byron S.Gottfried, Schaums: Outline of Programming with C, 2nd Edition, Schaums
Outlines (1996).
5. R Sethi&K.V.Viswanatha: Programming Languages: Concepts & Constructs, 2nd
Edition, Pearson (2006).
Financial Accounting & Management: MCA 103
Marks Scale : 100 marks (End Sem. Exam : 60, Int. : 40) Credits: 4
(3-1-0)
UNIT I: 15L
Basic Accounting Concepts: Nature,Meaning& Scope of Accounting, Differences between
Management Accounting and Financial Accounting, objectives of Accounting. Basic
Accounting Terms.JournalazingTransactions , Rules of Debit & Credit, Compound Journal
Entry, Opening Journal Entry. Sub-division of Journal, Ledger Posting,Relationship between
Journal & Ledger, Rules Regarding posting.
UNIT II: 15L
Preparation of Final Accounts: Preparation of Trial Balance.Meaning& Preparation of Trading
Account, Profit & Loss Account and Balance Sheet with and without Adjustments. Rectification
of errors, Location of errors, Suspense account, Rectifying Accounting entries.
UNIT III: 15L
Management Accounting: Meaning, Functions & Scope of Management Accounting.
Limitations of Management Accounting.
Analysis of Financial Statements: Meaning & Types, Nature and Limitations of Financial
Statements, Analysis and Interpretation of Financial Statements. Ratio Analysis ,Types of
ratios,Advantages& Disadvantages of Ratio Analysis.Dupont Analysis.Analysis of Statements of
Changes in Financial Position - Funds Flow Statement and Cash Flow Statement.
UNIT IV: 15L
Cost Accounting :Meaning, nature and importance of cost accounting,types of costs and
preparation of cost sheet.Variable cost and Fixed cost, contribution, P/V Ratio, Break-Even-
Point,Limitations of Cost-Volume-Profit Analysis.
Budgeting:Meaning, objectives and importance of budgeting in anorganisation, Budget
&Budgetory Control. Preparation of cash budget, fixed and flexible budgets, zero-base
budgeting.
Text Books:
1. S.N.Maheshwari,A textbook of Accountancy for Management,VikasPublications,Second
Edition,2010.
2. R.Narayanaswamy,FinancialAccounting:AManagerialPerspective,Prentice Hall India
FourthEdition, 2011.
3. MNArora:Cost and Management Accounting, VikasPublications,Eighth Edition,2009.
4. Prasanna Chandra, “Financial Management : Theory and Practices”, Tata McGrawHill
5th Edition, 2001.
Digital Fundamentals: MCA 104
Marks Scale : 100 marks (End Sem. Exam : 60, Int. : 40) Credits: 4
(3-1-0)
UNIT I: 15L
Adder and Subtracter - Binary parallel adder, carry propagation, carry Look ahead adder,
Decimal adder, BCD adder, Half and full subtractor, BCD subtractor
Encoder and decoder – 3 to 8 line decoder, 2 to 4 decoder, 4 to 16 decoder, BCD to decimal
decoder, Decimal to BCD Encoder, octal to binary encoder
Comparator – Magnitude comparator, 1 bit and 2 bit comparator
Multiplexer and de-multiplexer – 4:1, 8:1, 16:1 and 32:1 Multiplexer, Multiplexer tree, Demultiplexer
tree.
UNIT II: 15L
Flip Flops – 1 bit memory cell, preset and clear, JK, SR, T, D, Master-Slave flip flop
Registers and Counters – Shift register, serial transfer mode, Serial addition, 4-bit ripple
counter, BCD Ripple counter, Synchronous and Asynchronous counter, 4-bit up-down counter
and Johnson counter.
D/A and A/D Converters - Weighted resistor and R-2R ladder type D/A converter; Parallelcomparator
type; Successive approximation type.
UNIT III: 15L
Timing Circuits: Free running Multivibrator, Retriggerable and NonretriggerableMonostableMultivibrator,
Monostable and astablemultivibrator, Schmitt Trigger,
OP AMP Comparator, Regenerative comparator, 555 Timer
UNIT IV:
15LIntroduction to Semiconductor – Doping, Intrinsic and Extrinsic, Donor and
Acceptor, p-type and n-type.
p-n Junction Diode – Forward Bias, Reverse Bias, Volt-Ampere characteristics, Zener Diode,
Schottky Diode.
Bipolar Junction Transistor (BJT) – Transistor Configurations, Transistor as a switch,
Schottky Transistor.
MOSFET – Enhanced and Depletion MOSFET, MOS and CMOS.
Text Books:
1. Jain: Modern Digital Electronics, 3rd Edition, Tata Mcgrow Hill (2010).
2. Morris Mano: Digital Logic Design, 5th edition, Prentice Hall of India (2008),
3. H.Taub&D.Shilling: Digital Integrated Electronics, 2nd Edition, McGraw Hill (1999).
4. Givone: Digital Principles & Design, 1st Edition, Tata Mc Grow Hill (2002).
5. Virendra Kumar: Digital Technology, 1st edition, New Age (1999).
Computer Organization & Architecture: MCA 105
Marks Scale : 100 marks (End Sem. Exam : 60, Int. : 40) Credits: 4
(3-1-0)
Introduction to Computer Arithmetic:
Decimal Representation, Complements, Fixed point representation, Addition, Subtraction with
Signed- magnitude, Signed 2’s Complement method, Booth Multiplication Algorithm, Array
Multiplier, Division Algorithm, hardware Implementation, Floating Point Arithmetic operations.
Register Transfer Language:
Register Transfer, Bus and Memory transfer, Arithmetic Micro operations, Logic Micro
operations, Shift Micro operations, Arithmetic logic and shift operations.
Unit II: 15L
Instruction Set Design :
Assembly/machine language, Von Neumann machine cycle, Microprogramming/firmware,
Memory addressing, Classifying instruction set architectures, Computer Registers, General
Registers Organization, Computer Instructions, Timing and control, Instruction Cycle, Memory
Reference Instructions, Input-output and interrupt, Instruction Format, Addressing modes, Data
transfer and manipulation, program Control, RISC and CISC.
Pipelining :
General considerations, Comparison of pipelined and nonpipelined computers, Instruction and
arithmetic pipelines – examples, Structural hazards and data dependencies, Branch delay and
multicycle instructions, Superscalar computers
Unit III: 15L
Programming the Basic Computer:
Introduction to Machine Language, Assembly language, Program loops, Programming
arithmetic and logic operations, Subroutines, Input-output programming.
I/O Fundamentals:
Typical I/O devices, Programmed I/O, Peripherals Devices, Input-Output Interface,
Asynchronous Data Transfer, Modes of transfer, Priority Interrupt, DMA, I/O Processor, CPUIOPCommunication,
Serial Communication, Interrupts and DMA, I/O bus operation, TRAP
instruction, Role of OS.
Unit IV: 15L
Memory Organization :
Memory Hierarchy, Main memory, Auxiliary Memory, Associative memory, Cache memory,
Virtual Memory, Memory management hardware, Case study of PC architecture and hardware,
bias and interrupts, DMA control, Different types of bus, ISA, EISA.
Multiprocessor and Multiple Computers :
SISD, SIMD and MIMD architectures, Centralized and distributed shared memory-architectures.
Text Books:
1.M. Morris Mano, “Computer System Architecture”, Pearson Education, Third Edition,2008.
2.Carter Nicholas, “Computer Architecture”, Schaun outline Sevies , Tata McGraw-Hill, Second
Edition, 2010.
3.J.P. Hayes, “Computer Architecture & Organization”, Tata McGraw Hill,Third Edition, 1998.
4.David A Patterson and John L Hennessy, “Computer Architecture: A Quantitative Approach” ,
Morgan KaufmnnPublishers,Fourth Edition,2006.
Programming Laboratory: MCA 191
Marks Scale : 100 marks (End Sem. Exam : 60, Int. : 40) Credits: 2
(0-0-3)
1. Write a C program to find the sum of digit.
2. Write a C program to find the sum of odd numbers and even numbers.
3. Write a C program to display n Fibonacci nos.
4. Write a C program to find the sum of all prime numbers between N to M.
5. Write a C program to find the reverse of a number.
6. Write a C program to check whether the given number is a prime or not.
7. Write a C program to calculate Floyd’s Triangle.
8. Write a recursive function to find factorial of the given number.
9. Write a C program to check whether the string entered is palindrome or not.
10. Write a C program to print the sum of all the prime numbers between 1-100.
11. Write a C program to create pyramid with size n.
12. Write a C program to convert the entered string lowercase into uppercase and uppercase
into lowercase.
13. Write a C function that has three inputs which are integers. The function returns true if the
first number raised to the power of the second number equals the third number.
14. Write a C program to search for an item in n number of elements using linear search.
15. Write a C program to count the number of vowel and consonant in a given string.
16. Write a C program to find the roots of a quadratic equation.
17. Write a C program using array of structure to print the details of a students like Roll no,
name, address, city and phone number.
18. Write a C program to swap two numbers using call by reference.
19. Write a C program to extract words from any text file and store in another file. Sort the
words in alphabetical order and store them in the same file. Read the sorted file and print
the frequency of each word.
20. Write a C program to create one text file, store some information into it and print the same
information on terminal.
21. Given a file which contains some integers. From this file create another two files one for
odd and second for even numbers. Print the result of both files.
22. Create one file and insert some information using fprintf() and fscanf() function.
23. Write a C program to draw a line, rectangle, circle, ellipse by using graph.
24. Write a C program to change the color and the font of a given text.
Digital Fundamentals Laboratory: MCA 192
Marks Scale : 100 marks (End Sem. Exam : 60, Int. : 40) Credits: 2
(0-0-3)
1. Implementation of the following Logic Gates -
a) Logic Gates AND
b) Logic Gates OR
c) Logic Gates NOT
d) Logic Gates XOR
e) Logic Gates NAND
f) Logic Gates NOR
2. Implementation of SOP form.
3. Implementation POS form.
4. Study of half adder circuits.
5. Study of full adder circuits.
6. Study of half subtractor.
7. Realization of SR flip flop.
8. Realization of JK flip flop.
9. Realization of T flip flop.
10. Realization of D flip flop.
11. Study of 3 bit binary counter.
12. Study of 1 bit comparator.