MASTER OF COMPUTER APPLICATIONS

SCHEME
1st SEMESTER
No. Of periods Duration of
NO. SUBJECT per week Uty. exam Max. Marks TOTAL
Lecture Lab in hours Sessional Uty. Exam MARKS

MCA101 Mathematical 4 -- 3 25 75 100

Foundation Of
Computer Science
MCA102 Probability And 4 -- 3 25 75 100
Statistics
MCA103 Fundamentals Of 4 -- 3 25 75 100
Computer System
MCA104 Principles Of 4 -- 3 25 75 100
Digital System
MCA105 Problem Solving 4 -- 3 25 75 100
And Computer
Programming in ‘C’
MCA106 Software Lab I -- 6 -- 100 -- 100
(C-programming)
Total 20 6 -- 225 375 600

1 Period is 1 hour duration

 SYLLABUS

MCA 101 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE

Sets, relations & Functions: -

Definition of sets and subsets; combination of sets – union,
intersection, compliments etc; de-morgans laws; Relations-equvalance relations and
partitions; mappings-one-one,onto etc; Countable and uncountable sets; Mathematical
induction.

Logic:-
Mathematical propositions; logical operations like AND,OR etc; truth tables ;
theory of inference and deduction ;predicate calculas.

Graph theory:-
Basic terminology-directed and undirected graphs; weighted graphs; shortest
paths in weighted graphs; Eulerian paths and circuits ;necessary and sufficient conditions;
Hamiltonian paths –sufficient conditions; traveling salesman problem ;Bipartite graphs.

Trees:-
Definition and characterization; rooted and binary trees; spanning trees;
fundamental circuits; cut sets and cut vertices; fundamental cut set; minimum spanning
tree.

Planar graphs:-
Combinatorial and geometric duals; kuratowskis graphs and theorem;
direction of planarity; matrix representation of graphs.

Colourings:-
Chromatic number. chromatic polynomial; the six and five colour theorems; the
four colour problem.
Applications of graphs in computer science.

References;
1.korthage.R.T; Discrete Computational structures-Academic press,1974
2.Preparata.F.P- ,Yeh R.J-Introduction to Discrete structures-Addison Wesely,1973
3.C.L.Liu-Elements of Discrete Mathematics, Mc Graw Hill, 1985.
4.Trembely J.P and Manohar R.P-Discrete Mathematical structures with application to
computer science-mc Graw Hill, 1975.
5.Hararay F Graph Theory,Addison Wesely 1972.
6 Deo.N Graph Theory with applications to Engg & Computer science ,prentice
Hall,1974.
 MCA 102 – PROBABILITY AND STATISTICS

PROBABILITY

Probability theory :-Sample spaces; events and probability; Discrete probability;

union, intersection and compliments of events; conditional probability; bays theorem;

Random variables and distribution :- Random variables, discreate probability

distributions –Binomial, poisson density functions and distributions functions; continuous
probability distributions uniform, exponential, normal, students T Ψ2,F

Expectations and higher order moments :-characteristic functions, laws of large

numbers :-Weak laws and strong laws of large numbers; central limit theorem and other
limit theorems.

STATISTICS

Basic statistics :- measures of central tendencies :-Mean , Meadian, Mode;

Measures of dispersion: Range, varient and standard deviation, frequency distributions
and cumulative frequency distributions, Moment and moment generating functions, linear
correlation coefficient; Linear regression; Sampling; theory of sampling; population and
sample ; Sampling survey methods and estimation.

Testing of Hypothesis and inference.

Books:

1.Hogg, R.V, Craig, A.L: Introduction of Mathematical statistics, American Publishing

Co. Rt.Ltd
2. Yule,U.G, Kendall, M.G : An Introduction to the theory of statistics, chailes Griffin
&Co.ltd
3.Brokes B.C and Dick E.F.L:An Introduction to statistical Method Heinemann
Educational Books,1969
4.K.L.Chung: Elementary of Probability theory with stochastic process – Springer
International , 1984.
5.K.S Trivedi: Probability to statistics with reliability, queueing and computer science
applications- Prentice Hall, 1997
 MCA 103 – FUNDAMENTALS OF COMPUTER SYSTEMS

Basic Components:- Basic components of a digital computer-(Block diagram

explanation).

CPU:- Basic components of CPU- ALU, Control unit, Registers, clock speed, math
coprocessor, internal math coprocessor.

MEMORY
RAM:-Static RAM(SRAM),Dynamic RAM(DRAM),EDO DRAM,SDRAM.
ROM:-Mask ROM, PROM, EPROM, EEPROM, EAROM, Flash RAM(Flash
memory), CMOS memory.
Physical memory organization:- DIP, SIMM, DIMM, SIPP, memory speed, memory
capacity of the motherboard.

SECONDARY STORAGE DEVICES

Hard disk:- Hard disk drive components, disk platter, Read/write head, head arm/head
slider ,spindle motor, Logic board, air filter, Head Actuator mechanism.
Disk geometry:- Data recording method, writing on and reading from a magnetic disk,
Data encoding methods :- FM, MFM, RLL, encoding scheme, interleave, skew.
Hard disk interfacing:- IDE ,SCSI Controllers, Hard disk Formatting:-Low level and
high level .
Other sec.storage devices. Floppy disks, CD ROM, CD-R, CD-RW, DVD-ROM
Expansion Bus/Slots:- 8 bit ISA, 16-bit ISA, EISA, and VESA
Local bus (VL bus), PCI local bus.
ROM BIOS and Boot up process: - BIOS, POST, Disk booting.

BASIC I/O DEVICES

Input devices: -Working of Keyboard, Mouse Joy stick, Track ball

Output Devices: -Display devices Working of monochrome and co lour CRT, LCD
panel.
Printer: -Working of dot matrix, laser, inkjet, and colour thermal and dye-sublimation
colour printers
Scanners:-Flat-bed, sheet-fed and hand held scanners

VIDEO BASICS: - display adapter, memory and video subsystem, creating screen
image, video display modes, Display resolution, the use of colour.

Mother Board:- CPU socket, Add-in card bus slots for ISA, EISA, PCI, Memory and
secondary cache sockets or chips, ROM BIOS and BIOS CMOS, Mother Board clock,
Back plane I/O ports for serial, parallel, mouse and key board ports, Universal serial bus
(USB),On board connector for power, IDE bus, SCSI, Floppy, battery.
Types and Generation of Computers: - Micro, Mini, PC, Main Frame and Super
Computers.

System Software’s: An overview of Operating system, compiler, linker, loader, editor,

assembler, interpreter, computer systems arch. Concepts of Multi programming, Multi
tasking, Time sharing, Real-time, multi processor and distributed systems.

References:
1. Modern all about motherboard by Lotia/Nair, BPB Publications.
2. Modern all about Hard disk drive by Mahahar Lotia, Pradeep Nair, Bijala Lotia-
BPB Publications.
3. How Computer work by RON White-BPB Publications.
4. Peter Norton’s guide to Upgrading PC and Repairing PC’s by Peter Norton and
Michel Desmand-Techmedia.
5. The NEW Peter Norton’s Programming Guide to the PC & PS/2 by Peter Norton
and Richard Wilson-BPB Publications.

MCA – 104 PRINCIPLES OF DIGITAL SYSTEMS

Prerequisite:- Knowledge of active and passive components, resistors, capacitors

inductors, diodes, bipolar transistors and CMOS devices.

Number Systems and Codes: Efficiency of a number system, Radix conversion, Binary
numbers, Relation ship between binary-octal and binary-hexadecimal numbers.1’s
compliment, 2’s compliment, addition, subtraction, multiplication and division of binary
numbers. BCD nos, BCD arithmetic, weighted codes, excess 3 codes, gray code, cyclic
code, reflected codes, self complimenting codes, Alpha numeric codes, Error detection
using parity bits, error detecting and correcting codes-hamming codes.

Logic Gates: Basic Logic gates-AND, OR, NOT, NAND, NOR, EX-OR, EX-NOR
symbols, Truth tables and Timing diagrams.

Boolean Algebra: - Basic laws, postulates, duality and theorems of Boolean algebra.
Boolean function, truth tables, canonical forms:-SOP, POS, conversion between
canonical forms, Minimization of Boolean functions using K-map method, realization
using logic gates and universal gates, don’t care condition

Combinational Logic Circuits:- Half adder, full adder, subtractor, magnitude

comparator, seven-segment decoder, encoder-Decimal to BCD, multiplexers,
demultiplexers, parity generator, PLA, PLA programming and implementation of
combinational circuit using PLA

Sequential Logic circuits:- Flip-flops, RS, JK, T&D FF’s, clocked Flip-flops,
Triggering of Flip-flops, Master –slave flip flops.
 MCA - 105 PROBLEM SOLVING AND COMPUTER PROGRAMMING IN C

Problem solving :- problem solving with digital computer –steps in computer

programming ,features of good program, modular programming, structured ,object
oriented-top down and bottom up approaches –algorithms-flow chart- pseudo code,
examples, time and space complexity.
C fundamentals:- the c character set, key words, data types, constants, variables and
array declarations expression, statement ,symbolic constants.
Operators and expressions:- arithmetic, unary, relational, logical assignment and
conditional operators
Data input and output:-the getchar, putchar, scanf, printf , gets and puts functions,
interactive programming.
Control statements:-decision control statements: the if, if-else and nested if else
statements different forms of if statement.
Loop control statements:-the while loop, do-while loop, or loop nested loop the switch
statement, the break ,continue, continue and goto statements, the comma operator.
Functions:-defining and accessing a function. Function declaration and prototypes,
passing arguments to a function-call by value call by reference , recursion.
Arrays:- defining an array ,processing an array, passing arrays to function, multi
dimensional arrays ,arrays and strings
Pointers:-fundamentals, pointer declaration passing pointers to a function pointer and
arrays, arrays of pointers dynamic memory allocation.
Structure and union:-defining a structure, processing a structure ,user defined data
type(type def) ,structures and pointers passing pointer to a function, union.
Files:-opening and closing a data file, creating and processing a data file, unformatted
data files.
Low level programming;-register variables, bitwise operations, bit fields.
Additional features of c:-enumerations, command lie parameters ,macros, the c pre
processor define include ,if and endif statements

TEXT BOOKS
1.programming with c gottfried (schaumm’s outline series),TMH

References:

1. let us c –yashwant kanethkar, bpb publications.

2. computer programming in c-kernning han and ritchie.
3. pointers in c-yashwant kanetkar, bpb publication