Bca Syllabus

*Regulations, Scheme of Study and Examination for B.C.A.
degree course
under Semester System(Y2K8 scheme)*
*(Revised w.e.f. 2008– 2009)*
* *
*R 1. *a)* *Title of the course: Bachelor of Computer Applications

2. Duration of the Course: The course shall be of three years
duration spread over six semesters.
3. Scheme of study:
i) There shall be five theory papers and two practicals from first
semester to
fourth semester. The practical paper corresponds to one or two theory
papers. The papers having no practical component carry 100 marks (90+10)
and the papers carrying practical component also carry 100 marks (60+30+10).
ii) There shall be four theory papers and one project work during fifth
and sixth
semesters.
iii) The project work shall be carried out either independently or
jointly (maximum of three students).
iv) Medium of Instruction: The medium of instruction shall be English.
4. Scheme of Examination:
i) At the end of each semester there shall be University examination
of three hours duration in each of the theory paper/practical.
ii) Continuous Evaluation (CE) carrying 10 marks in each of theory
papers shall
be based on the performance of the students in two written tests of one
hour
duration. No minimum marks for passing is required in IA.
iii) At the end of the fifth and sixth semesters each student shall have
to submit the completed project report for the evaluation which shall be
certified by internal and/external guide and duly signed by the
Principal/Chairman/Head/Course Coordinator.
The project report shall be evaluated by two examiners for 100 marks
and Viva
– voce shall carry 100 marks.
*R 2.* Each semester shall be of 4 months duration
*R 3.* Attendance: As per Bangalore Universityregulations in force

for science degree courses.
*R 4.* A Candidate is allowed to carry over all the previous uncleared
(failed) theory papers and/Practicals to subsequent semesters as per
Bangalore Universityregulations in force for science degree courses.
*R 5.* The maximum period for completion of the course shall be six
years from the date
* *of admission.
*R 6. *Eligibility for admission:
1. Any student who has passed PUC – II Science, Arts or Commerce
securing a minimum of 35% of marks
*OR*
2. Any student who has passed JODC or Diploma in Engg. (of three year
duration of Govt. of Karnataka) with minimum of 35% of marks in
aggregate in all the semesters/years.
*R 7.* Admission Procedure:
1. Through Counseling in respective colleges
2. 50% weightage for entrance test in respective colleges
3. 50% weightage for performance at qualifying examination.
4. Merit list shall be prepared based on item No. 7(b) and 7 (c)
5. Reservation: As per the notifications/Govt. orders from the
University/Govt. from time to time.
6. Tuition and other fees: As fixed by the University from time to time
*R 8.*The total number of students to be admitted to the course shall be
as decided by the
* *University.
*R 9.* Results: Results of candidate shall be declared and the classes

awarded as per the
procedure followed by the University for B.Sc. courses.

* *
*R 10.* *POWER TO REMOVE DIFFICULTIES*
1) If any difficulty arises in giving effect to the provisions of these
regulations,
the Vice – Chancellor may by order make such provisions not inconsistent
with
the Act, Statutes, Ordinances or other Regulations, as appears to be
necessary
or expedient to remove the difficulty.
2) Every order made under this rule shall be subject to ratification by the
appropriate University Authorities.
* *
*Title of Papers and Scheme of Study & Examination for BCA (Bachelor of
Computer Applications) Revised w.e.f. 2008– 2009*
* *
* *
*Sem.*
* *
* *
* *
*Paper *
* *
* *
*Title of the paper*
* *
*Hrs/Wk*
*Theory*
*Practical*
* *
* *
*CE*
*Total Marks*
*Max.*
*Marks*
*Max.*
*Marks*
I
BCA101
Indian Language
90
10
100
BCA102
English
90
-
10
100
BCA103
Computer Fundamentals
90
10
100
BCA104
Electronics
60
30
10
100
BCA105
Programming Concepts Using C
60
30
10
100
II
BCA201
Indian Language
90
10
100
BCA202
English
90
10
100
BCA203
Mathematics
90
10
100
BCA204
OOPS Using C++
4
60
30
10
100
BCA205
Data Base Management Systems
60
30
10
100
III
BCA301
Indian Language
4
90
10
100
BCA302
English
90
10
100
BCA303
Indian Constitution
100
-
-
100
BCA304
Operating Systems
90
10
100
BCA 305
Data Structures Using C
60
30
10
100
BCA306
Numerical Analysis and Linear Programming
60
30
10
100
IV
BCA401
Indian Language
90
10
100
BCA402
English
90
10
100
BCA403
Environmental Studies
90
10
100
BCA404
Data communications and Networks
4
90
10
100
BCA405
Visual Programming
60
30
10
100
BCA406
UNIX Programming
60
30
10
100
BCA501
Software Engineering
90
10
100
BCA502
Computer Architecture
90
10
100
BCA503
Banking and insurance
90
10
100
BCA504
JAVA Programming
60
30
10
100
BCA505
Project
90
10
100
BCA 506
Soft Skills & Personality Development Lab
90
10
100
VI
BCA601
Design & Analysis of Algorithms

4
90
10
100
BCA602
Systems Programming
90
10
100
BCA603
Computer Graphics
90
-
10
100
BCA604
Web Programming
60
30
10
100
BCA 605
Project
180
20
200
* *
*Note: *1) The practical classes during the course of the semester
shall be as in other science courses.
2) Examination for Theory/Practicalshall be of three hours duration.
3) In the evaluation of projectsin fifth and sixth semesters,
during the practical examination the
demonstration of the project carries 50% of marks and

viva-voce carries 40% of marks.
4) The papers should be taught only by people who have
specialization in the area.
5) For theory papers the paper number may be suffixed with T and
for practical papers with P,
e.g., 604T and 604P.
6) The question paper pattern and mode of evaluation to be as
finalized earlier for I and II
semester BCA. Any further requirement in the matter may be
decided by the Chairman, BOS in
consultation with BOS members.
FIRST SEMESTER
*BCA101**T**- INDIAN LANGUAGE*
Syllabus as per the one prescribed for science courses of Tumkur University
* *
*BCA102**T**- ENGLISH*
* *
*BCA103**T**– COMPUTER FUNDAMENTALS*
*BCA104**T**–ELECTRONICS*
*Introduction to network theorems and AC
fundamentals** *8 HOURS
*Ohm’s law:*Statement, explanation. *Kirchhoff’s law:*Statement &
explanation of KCL and KVL. *Mesh/loop*analysis (up to 2 loops) and
*node voltage*method, numerical problems. *Delta/star & star/delta
transformation: *No derivations for interconversion equations,
Introduction of network, port of network (one port network, two port
network), unilateral network, bilateral network, linear network. Need
for application of network theorems. (DC Circuits only). *Superposition
theorem:*Statement, (Only with TWO voltage sources) steps to apply the
theorem, explanation by considering a simple resistive network and
problems. *Thevenin’s theorem:*Statement, (Only with ONE voltage source)
steps to apply the theorem, explanation by considering a simple
resistive network and problems. *Norton’s theorem:*Statement, (Only with
ONE voltage source) steps to apply the theorem, explanation by
considering a simple resistive network and problems. *Maximum power
transfer theorem:*Statement, explanation of theorem by considering a
simple resistive network, expression for maximum power delivered
(PL(max)= Vth2/4Rth) (no derivation), graph of RLVs PL, numerical
problems and applications. *Reciprocity theorem*: Statement, explanation
using resistive network with dc source and numerical problems. *AC
Fundamentals:*Representation of ac sine wave, instantaneous value , peak
value, peak to peak value, average value, r.m.s value, cycle, time
period, frequency. (No derivations, only mention the expressions)
Representation of non sinusoidal waves.
*SEMICONDUCTOR DEVICES** ** **
** ** **12 HOURS*
*Introduction*, atomic structure, energy level, energy band diagram in
solids, classification of conductors, insulators and semiconductors.
*Semiconductor*, properties, crystal structure of semiconductor,
types-intrinsic and extrinsic semiconductor. *Intrinsic Semiconductor:*
Crystalstructure (Ge & Si), thermally generated charges (electron &
holes) carriers, the effect of temp on their motion. *Extrinsic
Semiconductor:*Doping, donor, acceptor impurities, n-type, p-type
semiconductor, majority & minority carriers, their currents, concept of
immobile ions. *Semiconductor devices:*PN junction diode, formation of
pn junction, depletion layer, potential barrier, energy level diagram
of pn junction , Biasing of pn junction , behavior of pn junction under
forward and reverse biasing, break down in pn junction , avalanche and
zener break down. *Diode characteristics:*V-I characteristics, forward
and reverse bias, diode parameters, bulk resistance, knee voltage,
static and dynamic resistance, PIV. *Application of diode*: As a
rectifier, as logic gate, as a switch, etc. *Rectifier*: Types, Half
wave, Full wave. *Half wave rectifier*: Circuit, working, wave forms and
expression for ripple factor and efficiency (no derivation), advantages
& disadvantages. *Full wave rectifier*: Center tapped rectifier,
Circuit, working, wave forms and expressions for ripple factor and
efficiency (no derivation), advantages & disadvantages. *Bridge wave
rectifier*: Circuit, working, wave forms and expressions for ripple
factor and efficiency (no derivation), advantages & disadvantages.*Logic
families:*Scale of integration, Digital IC’s, classifications, DTL, TTL,
ECL, MOS, CMOS, *Mention of features:*speed of operation, power
dissipation, propagation delay, fan-in, fan-out.
* *
*NUMBER SYSTEMS** ** **
** **
** **12 HOURS*
Introduction to number systems – positional and non-positional, Base/
Radix. Decimal number system – Definition, digits, radix/base. Binary
number system – Bit, Byte, *Conversions:*Binary to Decimal and Decimal
to Binary. Octal number system – Conversion from Octal to Decimal,
Decimal to Octal, Octal to Binary and binary to Octal. Hexadecimal
number system-Conversions: Decimal to Hex, Hex to decimal, Hex to
Binary, Binary to Hex, Octal to Hex , Hex to Octal. Binary arithmetic-
binary addition, subtraction, multiplication and division (only Integer
part). 1’s and 2’s complement – 2’s complement subtraction. *Binary
codes:*BCD numbers, 8421 code, 2421 code- examples and applications.
*Gray code*- Conversions- Gray to binary and Binary to Gray, application
of gray code (Mention only). *Excess – 3 code *- Self complementing
property and applications. Definition and nature of *ASCII*code.
Introduction to *error detection and correction*code, parity check.
*Boolean algebra: -*Laws and
Theorems.
AND, OR, NOT Laws, Commutative law, associative law, distributive law,
Duality theorem. *Demorgan’s theorems*– Statements, proof using truth
tables; Simplification of Boolean expressions using Boolean laws.
Definition of product term, sum term, minterm , maxterms, SOP, standard
SOP, POS and Standard POS. Conversion of Boolean expression to Standard
SOP and Standard POS forms. Karnaugh maps- Definition of Karnaugh map,
K- map for 2, 3 and 4 variables. Conversion of truth tables into k-map,
grouping of cells, redundant groups and don’t care conditions. Karnaugh
map technique to solve 3 variable and 4 variable expressions.
Simplification of 3 and 4 variable Boolean expression using K-maps (SOP
only).
*Logic gates** ** **
** ** ** **
** **12 HOURS*
AND Gate: Definition, symbol, truth table, timing diagram, Pin diagram
of IC 7408. OR Gate: Definition, symbol, truth table, timing diagram,
Pin diagram of IC 7432. NOT Gate: Definition, symbol, truth table,
timing diagram, Pin diagram of IC 7404. NAND Gate: Definition, symbol,
truth table, Pin diagram of IC 7400. NOR Gate: Definition, symbol, truth
table, timing diagram, Pin diagram of IC 7402. Exclusive OR Gate:
Definition, symbol, truth table, timing diagram, applications, Pin
diagram of IC 7486. Exclusive NOR Gate: Definition, symbol, truth table,
timing diagram. Combinational logic circuits: Definition, applications.
Half Adder: Symbol, Logic circuits using XOR and basic gates, Truth
table. Full Adder: Symbol, Logic circuits using XOR and basic gates,
Truth table. Half Subtractor: Symbol, Logic circuits using XOR and basic
gates, Truth table. Full Subtractor: Symbol, Logic circuits using XOR
and basic gates, Truth table. Adder - Subtractor: Logic circuit, pin
diagram IC 7483, IC 7486. Parallel Adder: 4 - bit parallel binary adder,
BCD adder, IC 7483. NAND - NOR implementation of Adders.
*SEQUENTIAL CIRCUITS** ** **
** **10** **HOURS*
Importance of clock in digital circuit and introduction to flip flop.
Flip-flop-difference between latch and flip-flop. Qualitative study of
level and edge triggering. RS latch/unclocked, symbol and truth table.
RS flip-flop using NAND gate, symbol, truth table and timing diagram. D
flip-flop-Logic symbol, RS flip-flop as a D flip flop, truth table and
timing diagram. J-K flip-flop- Symbol, truth table, Realization of JK
flip-flop using NAND gates, working, and timing diagram. Race around
condition, preset and clear inputs, pin diagram of IC 74112. T flip flop
- Logic symbol, JK flip flop as a T flip-flop, truth table and timing
diagram. Master slave flip flop: Logic circuit, truth table and timing
diagram, advantage of M/S flip flop, pin diagram of IC 7473, IC 7476.
Registers: Definition, types of registers - Serial in serial out, Serial
in parallel out, Parallel in serial out, Parallel in parallel out shift
register (Block diagram representation for each), truth table, timing
diagram and speed comparison.
*BCA104P - PRACTICALS IN **ELECTRONICS*
_List of experiments_ _- (At least 10 experiments to be conducted)_
1. Study of Logic Gates- AND, OR, NOT, NAND, NOR, XOR.
(using respective ICs)
2. Realization of AND, OR and NOT gates using Universal Gates.
3. Design and Realization of Half Adder/Subtractor using NAND Gates.
4. Design and Realization of Full Adder using Logic Gates.
5. Design and Realization of 4 bit Adder/Subtractor using IC 7483.
6. Design and Realization of BCD Adder using IC 7483.
7. Realization of R-S flip flop using NAND gates.
8. Realization of J-K flip flop using IC 7400 and 7410.
9. Realization of T and D flip flop using IC 7476.
10) Implementation of SISO Shift Registers using flip flops
(IC 7476).
11) Implementation of SIPO Shift Registers using flip flops
(IC 7476).
12) Implementation of PISO Shift Registers using flip flops.
(IC 7476).
13) Implementation of PIPO Shift Registers using flip flops.
(IC 7476).
14) Implementation of Half wave and Full wave rectifier using
Semiconductor diode. (Ripple factor)
15) Design and implementation of odd and even parity checker
Generator using IC 74180.
*BCA105**T**– PROGRAMMING CONCEPTS Using C*
*Total: 52 Hrs *
*1.0** Computer Programming : ** **
** ** ** ** *
Basic Programming concepts - Algorithm, Flowcharts, Modular Programming
and structured programming.
*(3 Hrs)*
*2.0 ‘C’ PROGRAMMING ** *
*2.1* Problem solving using Computers, Concept of flowcharts and
algorithms.*( 5 Hrs)*
*2.2 Overview of C : ** **
** ** ** **
** ** *
Introduction, Importance of ‘C’, Sample ‘C’ Programs, Basic structure of
‘C’ programs, Programming style, Executing a ‘C’ Program.
*(3 Hrs)*
3. * Constants, Variables and Data types : **
** ** ** *
‘C’ Tokens, keywords, and identifiers, constants, variables, datatypes,
declaration of variables, assigning values to variables, defining
symbolic constants. *(3 Hrs) *
*3.0 Operators and expression : ** **
** ** ** ** *
Arithmetic operators, Relational operators. Logical operators,
Assignment operators, increment and decrement operators, conditional
operators, bitwise operators, special operators, some computational
problems, type conversion in expressions, operator precedence and
associativity. Mathematical functions.
*(5 Hrs)*
1. * Managing input and output operators : **
** ** ** *
Input and Output statements, reading a character, writing characters,
formatted input, formatted output statements.
*(3 Hrs)*
2. * Decision making, Branching and looping :
** ** **
** *
Decision making with IF statement, simple IF statement, The IF-ELSE
statement, nesting of IF .. ELSE statements, The ELSE –IF ladder, The
switch statement, The ?: operator, The GOTO statement, The WHILE
statement, The DO statement, The FOR statement, jumps in
loops.
*(6 Hrs)*
*4.0 Arrays : ** ** **
** ** ** **
** ** *
One dimensional arrays, Two-dimensional arrays, initializing
two-dimensional array, Multidimensional arrays.
*(5 Hrs)*
1. * Handling of character strings :**
** ** **
** ** *
Declaring and initializing string variables, reading string from
terminal, writing string to screen, arithmetic operations on characters,
putting strings together. Comparison of two strings, string handling
functions-strlen, strcat, strcmp, strcpy *(5 hrs)*
*5.0 User defined functions : ** **
** ** ** **
** *
Need for user-defined functions, a multi-functional program, the form
of ‘C’ function, Return values and their types, calling a function,
category of functions- No arguments and no return values, arguments but
no return values, arguments with return values, handling of non-integer
functions, nesting of functions, recursion, functions with
arrays.
*(4 Hrs)*
*6.0 Structure and union :** **
** ** ** **
** *
Structure definition, giving values to members, structure
initialization, comparison of structure variables, array as structure,
array within structure, union. *( 5
Hrs)*
*7.0 Pointers :** ** **
** ** ** **
** ** *
Understanding pointers, accessing the address of variables, declaring
and initializing pointers, accessing a variable through its
pointer. *(3 Hrs)*
*Text books : *
* *
1. E.Balaguruswamy. : Programming in ANSI C” Tata Mc Graw-Hill (1998)
2. Kamthane, Programming with ANSI and Turbo C. Pearson
Education 2003
*References :*
1. V.Rajaraman.: “Fundamentals of Computers”, PHI (EEE) (1999)

2. V.Rajaraman.: “Programming in C ”, PHI (EEE) (2000)
3. S.ByronGottfried. : “Programming with C” , Tata McGraw-Hill(2000)
4. Yashawant Kanetkar : “Let us C”
5. Rajesh Hongal : “Computer Concepts & C language”
6. Brain verminghan & Dennis M. Ritchie “ANSI C Programming “ (PHI)
7. Ramkumar & Rakesh Aggarwal “ANSI C Programming” Tata McGraw Hill
8. Kernighan, C – Programming Language ANSI C Version. Pearson Education.
9. Venkateshmurthy, Programming Techniques through C. Pearson Education.
10. E. Balaguruswamy – Computer Fundamentals and C Programming. TMH 2008
11. Bronson : ANSI C Programming , 1ST Edition, 2008 Cengage
Learning India
12. Forouzan : Computer Science A Structured Programming Approach
Using C 3rd Edition, Cengage Learning India
*BCA105P - **PRACTICALS IN C PROGRAMMING*

*List of programs *
PART A
1. Write a Program to find the root of the given quadratic equation
using switch case.
2. Write a C Program to generate and print first N FIBONACCInumbers.
3. Write a Program to find the GCD and LCM of two integer numbers
4. Write a C Program that reverse a given integer number and check
whether the number is palindrome or not.
5. Write a Program to find whether a given number is prime number or not
6. Write a C Program to input numbers and to find mean variance and
standard deviation.
7. Write a C Program to read two matrices and perform addition and
subtractions of two matrices.
8. Write a C Program to read a string and check whether it is
palindrome or not.
9. Write a Program to find the factorial of a number using function
PART B
10. Write a C Program to find if a character is alphabetic or numeric
or special character.
11. Write a C Program to compute the sum of even numbers and the sum
of odd numbers using a function.
12. Write a C Program to find trace and normal of a square matrix
using functions.
13. Write a C Program to accept a sentence and convert all lowercase
characters to uppercase and vice –versa.
14. Write a Program to accept different goods with the number, price
and date of purchase and display them.
15. Write a C Program to find the length of a string without using the
built – in function.
16. Copying the contents of one file into another.
17. Write a C program to accept the reverse of a string using pointers.
Note : The list of programs has been divided into two parts for the sake
of practical
examination in which two programs are to be given one from each part.
*SECOND SEMESTER*
*BCA201**T**– INDIAN LANGUAGE*
Syllabus as per the one prescribed for science courses of Tumkur University.
*BCA202 **T**– ENGLISH*

*BCA203**T**– MATHEMATICS*
Total*:**52 hrs*
1. *Matrices:*Review of fundamentals: Defn. matrix, order,Types of
matrices: zero, row, column, square, diagonal, scalar, unit,
symmetric, skew-symmetric
*Determinant*: Value of determinant of order 2×2, 3×3, minors,
cofactors, adjoint, inverse of a matrix.
Solutions of linear equations: Cramers rule and matrix method involving
two and three variables.
eigen values and eigenvectors: Defn., characteristic equation,
characteristic roots, characteristic vectors(without any theorems) only
2x2 order.
Cayley Hamilton theorem.(only statement), verification of Cayley
Hamilton theorem.( only 2x2 matrices), using the same finding the powers
of A (A4, A5, A-1, A-2), inverse of a matrix using Cayley Hamilton theorem.
2. *Integral **C**alculus*
Defn., Problems of the type: i). , ii). ,
iii). iv)., v). , vi). vii). , viii).
ix). x)., xi).,
xii).
Integration by partial fractions, Integration by parts,
Problems of the type , Definite integrals, properties(no proofs), problems.
*3.** Algebraic **S**tructure*
Binary operation, Defn. of group, properties(only statement),
problems(both finite and infinite groups), subgroup, theorems( no
proof), problems.
*Vectors: *Defns. of vector and scalar, vector addition, dot and cross
product, projection of a vector on the other(no geometrical meaning),
area of parallelogram, area of a triangle, scalar triple product, volume
of parallelepiped, coplanarity of three vectors, vector triple product.
*4**. Differential **C**alculus*

Differentiation of nthderivatives: dervations of xm, (ax + b)m, 1/ax +b,
log(ax + b), sin(ax + b), cos(ax + b), eaxsin(bx + c), eaxsin(bx + c)
and problems. Leibnitz rule (statement only), problems.
*5**. Differential **E**quations: *Defn., solution(no formation),
order and degree.
First order and first degree equations:
a). Variable seperable
b). homogeneous
c). Exact equation Mdx + N dy = 0 ( reducible to exact/ Integrating
Factor not
included)
d). Linear equation.
*6**. Analytical Geometry *

Defn. of vector , magnitude, problems, distance between two points,
finding and *, *direction cosine, ratio, l2 + m2+ n2= 1, problems i).
Finding the direction cosines of A and B, ii) sin2α + sin2β + sin2γ = 2
iii).

An le etween two lines: cosθ nd sinθ, pro lems: n le etween two
vectors,
n les of tri n le, n le etween di on ls of cu e, n le
etween di on ls of rect n le.
*Eu tion of line*: (one point), (two point form),

Directpro lems: i) condition for lines to e p r llel nd perpendicul r
ii) point of intersection of lines
*Eu tion of Pl ne:*i). , ii) norm l form lx + my + nz = p

Pro lems: i) ii) im e or reflection
* *
*BCA204**T**– OOPS Usin C++*
*Tot l: 52 Hrs*
*1. Introduction
: *Procedur l Ln u es, definition of OOP, B sic
concept of OOP,O ject, Cl ss, D t A str ction, D t Enc psul tion,
D t Hidin mem er functions, Reus ility, Inherit nce, Cre tin new
D t Types, Polymorphism, Overlo din , Dyn mic indin , nd Mess e
p ssin .
*(2 Hrs)*
*2.** **C++ Fe tures: *The iostre m cl ss, C++ Comments,
C++ Keywords, V ri le decl r tion, The Const Qu lifier. The Endl, Set
W, set precision, M nipul tors, The scope resolution oper tor, The new &
delete Oper tors. *(2 Hrs)*
*3.** **Functions: *Simple Functions: Function
decl r tion, c llin the function, function definition; P ssin r ument

to, returnin v lue from function; p ssin const nts, V ri les, p ss y
v lue, p ssin structure v ri les, pss y reference, Def ult
r uments, return
st tements, return y reference, overlo ded functions;
Different num er of r uments, Different Kinds of r uments, inline
function.
*(8 Hrs)*

*4.** **Ojects & Cl sses : *Cl sses & O jects, Clss
Decl r tion, Cl ss mem
ers; D t Constructors, Destructors, Mem er
functions, Cl ss memer visi ility; priv te, pu lic, protected. The
scope of the cl ss o ject constructors; Def ult Constructor, Constructor
with r ument, constructor with def ult r uments, Dyn mic constructor,
copy constructor, Overlo ded constructor, O jects s function r uments;
mem er functions
defined outside the cl ss, O jects s r uments,
returnin o jects from functions, cl ss conversion, m nipul tin priv te
D t mem ers, Destructors, cl sses, o jects & memory, rr y s cl ss
mem er d t , Arr y of o jects, strin s cl ss mem er
*(12 Hrs)*
*5.** **Oper tor Overlo din : *Overlo din un ry oper tor:
Oper tor Keyword,
Oper tor Ar uments, Oper tor return v lue, N meless

tempor ry o jects, limit tions of increment oper tor, overlo din in ry
oper tor, rithmetic oper tors, comp rison oper tor,
rithmetic
ssi nment oper tor,D t conversion; conversion etween B sictypes,
Conversion etween o jects & B sic types, conversion etween o jects of
different cl sses. *(6 Hrs.)*
*6.** **Inherit nce : *Derived Cl ss & Bse Cl ss :
Specifyin the Derived cl ss ccessin B se cl ss mem ers, the protected
ccess specifier,
Derived cl ss constructor, Overridin mem er
functions, pu lic nd priv te inherit nce; Access Com in tions, Cl sses
& Structures, Access
Specifiers, Level of inherit nce; Multilevel

inherit nce, Hy rid inherit nce, Multiple inherit nce; mem er functions
in multiple inherit nce, constructors in multiple inherit nce,
Cont inership; Cl sses within cl sses, Inherit nce & Pro r m
Development. *(8 Hrs)*

*7.** **Virtul Functions: *Norm lmem er function ccessed
with pointers, Virtu l mem er functions ccessed with pointers, Dyn mic

indin , pure virtu l functions, Friend function; Friendsfor function l
not tion, friend cl sses, the this pointer; Accessin Mem er D t with
this, usin this for returnin v lues.
*(5 Hrs)*
*8.** **Templ tes & Exception H ndlin : *Introduction,
Templ tes, Cl ss Templ tes, function templ tes, Mem er function
templ tes, Templ te r uments, Exception H ndlin . *(4 Hrs)*
*9.** **Stre ms : *The Stre m cl ss Hier rchy, Stre m

cl sses He der file, strin J/O : Writin strin s, re din strin s,
ch r cter J/O, Detectin
End – of – file. O ject J/O; writin
n o ject
to disk, re din n o ject from disk, J/O with multiple o jects; the f
stre m cl ss, The open function, File Pointers; Specifyin the position,
Specifyin the offset. The tell Function, Disk J/O with Memory
Functions; Closin Files, Error H ndlin , Comm nd Line Ar uments. *(5
Hrs)*
* *

*Text ooks:*
1 Pr t : C++ Primer Plus, 4/e Pe rson Educ tion

1. L fore Ro ert
: O ject Oriented Pro r mmin in Tur o C++,
G l oti Pu lic tions
* *
*References:*
1. Lippm n: C++ Primer,3/e Pe rson Educ tion
2. E. B l urusw my: O ject Oriented Pro r mmin with C++, T t
McGr w Hill Pu lic tions.
3. Strousstrup: The C++ Pro r mmin L n u e, Pe rson Edition,
3rdEdition
4. K mth ne: O ject Oriented Pro r mmin with ANSI nd Tur o C++,
Pe rson Educ tion
5. Bh ve: O ject Oriented
Pro r mmin Usin C++, Pe rson Educ tion
6. E.B l urusmy – O ject Oriented Pro r mmin with C++ 4/e TMH 2008
7. F rrell : O ject Oriented Pro r mmin Usin C++, 1ST Edition 2008,
Cen e Le rnin Indi
*BCA204P - **PRACTICALS IN C**++**PROGRAMMING*

*List of pro r ms *
* *
1. Write pro r m to implement diit l clock
2. Write pro r m to sw p two num ers usin friend function
3. Write pro r m to c lcul te re nd circumference of circle
usin inline function

4. Write pro r m to cre te electricity ill
5. Write pro r m to prep re shoppin lists
6. Write pro r m to perform nk tr ns ction
7. Write pro r m to perform ddition of two m trices usin oper tor
overlo din .
8. Write pro r m for multiplic tion of two m trices usin oper tor
overlo din .
9. Write pro r m to find sum of complex num er usin friend function.
10. Write pro r m to implement oper tion onst ck.
11. Write pro r m to dd two dist nce v ri le.
12. Write pro r m to implement oper tion on ueue.
13. Write pro r m to sort elements usin templ tes.
14. Write pro r m to find the m ximum of two num ers usin templ te.
15. Write pro r m
to comp re two strin usin e u l to oper tor.
16. Write pro r m to conc ten te two strin s.
17. Write pro r m to find m ximum of 2 Nos. usin friend function.
18. Write pro r m to cre te student report usin inherit nce
techniue.
19. Write pro r m to dd two time v ri le
20. Write pro r m to implement re of eometric l fi ures
* *
*BCA205**T**– DATA BASE MANAGEMENT SYSTEMS*
*TOTAL: 52 hrs*

1. *Introduction:
*D t se nd D t se Users,
Ch r cteristics of
the D t se Appro ch, Different people ehind DBMS, Implic tions
of D t se Appro ch., Adv nt es of usin DBMS, When not to use
DBMS. *(5Hrs)*
2. *D t se System Concepts nd Architecture: *D t Models, Schem s,
nd Inst nces., DBMS Architecture nd D t Independence., D t se
l n u es nd interf ces.,
The D t se system Enviournment,
Cl ssific tion of D t se M n ement Systems.
*(4 Hrs)*
3. *D t Modelin Usin the Entity-Rel tionship Model: *Hi h level
Conceptu l D t Models for D t se Desi n with n ex mple.,
Entity types, Entity sets, Attri utes, nd Keys, ER Model
Concepts, Not tion for ER Di r ms, Proper n min of Schem
Constructs, Rel tionship types of de ree hi her th n
two. *(5 Hrs)*
4. *Record Stor e nd Prim ry File Or niz tion: *Second ry Stor e
Devices. Bufferin of Blocks. Pl cin file Records on Disk.
Oper tions on Files, File of unordered Records (He p files), Files
of Ordered Records (Sorted files), H shin Techniues, nd Other
Prim ry file Or niz tion.
*(6 Hrs)*
5. *Function
l Dependencies nd Norm liz tion for Rel tion l
D t ses : *Inform l Desi n Guidelines for Rel tion l Schem s,
Function l Dependencies, Norm l Forms B sed on Prim ry Keys.,
Gener l Definitions of Second nd Third Norm l Forms, Boyce–Codd
Norm lForm.
*(6 Hrs)*
6. *Rel tion l D t Model nd Rel tion l Al e r : *Rel tion l Model
Concepts., Rel tion l Model Constr ints nd Rel tion l D t se
Schem , Definin Rel tions, Upd te Oper tions on Rel tions., B sic
Rel tion l Al e r Oper tions, Addition l Rel tion l Oper tions.,

Ex mples
of Queries in the Rel tion l Al e r ., Rel tion l
D t se desi n Usin ER – to – Rel tion l
M ppin . *(6 Hrs)*
7. *Rel tion l D t se L n u e: *D t definition in SQL, Queries in
SQL, Insert, Delete nd Upd te St tements in SQL, Views in SQL,
Specifyin
Gener l Constr ints s Assertions, Specifyin indexes,
Em edded SQL. *(5 Hrs)*
8. *PL / SQL: *Introduction, Exceptions & Cursor M n ement, D t se
Tri ers, Functions, Procedures nd
p ck es.
*(8 Hrs)*
9. *Tr ns ction Processin Concepts: *Introduction, Tr ns ction nd
System Concepts,
Desir le properties
of tr ns ction, Schedules
nd Recover ility, Seri liz ility of Schedules, Tr ns ction
Support in SQL, Lockin Techniues for Concurrency Control,
Concurrency Control sed on time st mp orderin , Optimistic
Concurrency control techniues, Usin locks for Concurrency
Control in Indexes. *(7 Hrs)*
* *

*Text ook :*
1. P trick O’Neil, D t B se Principles, Pro r mmin & Perform nce
2ndEdn. Ac demic Press, 2002.
2. Elm sri & N v the, Fund ment ls of D t se Systems (Fourth
Edition), Pe rson Educ tion, 2003.
3. Sund rr m n, Or cle 9i pro r mmin A Primer,1/e Pe rson Educ tion.
4. ROBCORONEL,
DBMS, Implement tion nd M n ement, 5thEdn., Thomson
Pu ., 2005.
*References*:

1. K h te, Introduction to D t se M n ement System, Pe rson
tion 2004.
Educ
2. A r h msi. Sil ersch t , Henry. F. Korth, S. Sud rsh n, D t se
System Concepts, Mc. r w hill.
3. Jefry. D. Ullm n , Principles of d t se system.
4. Or cle Press : ORACLE - Computer reference
5. C.J. D te, Introduction to d t se systems, Sixth Edition,
Addison Wesley, 1995.
6. R hu R m Krishn n, D t se M n ement Systems, Second Edition,.
Mc.Gr w
Hill, 2000

7. Leon–
Fundment l of D t se M n ement System
8. Ro : D t se M n ement Systems: Desi n, Implement tion nd
M n ement, 7thEdition, 2008 , Cen e Le rnin Indi
9. Pr tt: Concepts of D t se M n ement , 5thEdition, 2008 ,
Cen e Le rnin
Indi
*BCA205P - **PRACTICALS IN **DBMS*

Pro r ms must e developed in the pr ctic l cl sses in such w y th t
inte r tion of the pro r ms le ds to n ppliction pro r m. This
should e pre-cursor to the mini projects to e t ken up y the
students in the fifth nd sixth semesters.
*THEORY AND PRACTICAL EXAMINATIONS*

* *
The p tternof uestion p per nd the scheme of ev lu tion re s per
the prescri ed ones for science de ree courses.
*Text Book** for BCA M them tics p per *:
1.Grew l, B.S, Hi her en ineerin M them tin s, L testEdition
*Reference Books* *for BCA M them tics p per*:
1. S stry S.S. En ineerin M them tics,2000

2. Peter V. O’Neil, Adv nced En ineerin M them tics, 5thEdition.
3. Liu – Elements of Discrete M them tics (SIE) 3/e
* *
*Text Book* *for BCA Electronics p per* :

1. Bi nell & Donov n, Di it l Electronics, 4thEdn. Thompson Pu .
2. V . K. Meht , B sic Electric l nd Electronics En ineerin .
3.Thom s L. Floyd, “ Di it l Fund ment ls”, Pe rson Educ tion Inc, New
Delhi, 2003
*Reference Books* *for BCA Electronics p per*:
1. Thom s C. B rtee, Di it l fund ment ls

2. Morris M no, Di it l Desi n, 3rded, Prentice H ll of Indi
Pvt.Ltd, New Delhi.
3. R. P J in, Modern Di it l Electronics, 3rded,T t Mc Gr w Hill, 2003.
4. M lvino nd Le ch, Di it l Electronics*.*
5. S liv h n n – Electronic Devices nd Circuits 2/e TMH
*THIRD SEMESTER*

Syll us s per the one prescri ed for science courses of Tumkur University.
*BCA302**T**– ENGLISH*

* *
*BCA303**T**- INDIAN CONSTITUTION*
Unit – 1

1. Fr min of the Indi n Constitution:
Role of the Constituent Assem
ly.
2. Philosophy of the Constitution: O jectives, resolution, pre m le,
fund ment l Ri hts nd Duties. Hum n ri hts nd Environment l
protection. 10 hrs
Unit-2
1. Speci l Ri hts cre ted in the Constitution of D lits, B ckw rd
Cl sses, Women nd Children, nd reli ious nd linuistic minorities.
2. Directive Principles of St te policy: The need to l nce
fund ment l ri hts with directive principles.
10 hrs
Unit – 3
1. Union Execution : President, Prime Minister nd Council of
Ministers: powers nd functions, co lition Government, pro lems in
their workin .
2. Union Le isl ture : Lok S h nd R jyo S h , powers nd
functions. Recent trends in their functionin .
08 hrs
Unit – 4
. St te Government : Governor, Chief Minister nd Council of ministers,
Le isl ture.

. Centre – St te rel tion: Politic l, fin nci l, dministr tive :
Recent Trends. 12 hrs
Unit-5

1. Judici ry : Supreme Court, Judici l Review, Writs Pu lic interest
liti tions. Enforcin ri hts throu h writs.
2. Emer ency provision (Article 356)
10 hrs
_BOOKS FOR REFERENCE:_
1. D.D B su – Introduction to the Indi n Constitution.
2. A.S N r n – Indi n Constitution, Government
nd Polities.
3. N ni P lkhiv l – we the People, UBS Pu lishers, New Delhi, 1999.
4. A.G Noor ni – Indi n Government nd Polities.
5. J.C Joh ri – Indi n Government nd Polities Vol-I nd II, Vish l,
New Delhi.
6. Gr n Ville Austin – The Indi n Constition – Corner Stone of
N tion, Oxford, New Delhi, 2000.
7. M.U. Pylee, Constitution l Government in Indi .
8. K.K. Gh i, Indi n Constitution.
9. J.N P ndy,l Constitution of Indi .
* *
* *
* *
* *
* *
*BCA30**4T**– OPERATING SYSTEMS*
*Tot l: 52 Hrs*

1. *Introduction: *B tch Systems,Concepts of Multipro r mmin nd
Time Sh rin , P r llel, Distri uted nd re l time Systems,
Oper tin System Structures, Components & Services, System c lls,
System pro r ms, Virtu l m chines *(6 Hrs)*
2. *Process M n ement: *Process Concept, Process Schedulin , Co –
Oper tin process, Thre ds, Inter process communic tion, CPU
Schedulin Criteri , Schedulin l orithm, Multiple Processor
Schedulin , Re l time Schedulin , Al orithm
evolution. *(8 Hrs)*
3. *Process
Synchroniz tion nd de dlocks: *The Critic l Section
Pro lem, Synchroniz tion h rdw re, Sem phores, Cl ssic l pro lems
of synchroniz tion, Critic l re ions, monitors, De d locks –
System model, Ch r cteriz tion, De d lock prevention,
void nce
nd detection, Recovery from de d lock, Com ined ppro ch to
de dlock h ndlin . *(10 Hrs)*
4. *Memory M n ement: *Lo ic l nd Physic l ddress sp ce, Sw ppin ,
Conti uous lloc tion, P in , Se ment tion, Se ment tion with
p in in M stics nd Intel 386, Virtu l memory – Dem nd p in
nd it’s perform nce, P e repl cement l orithms, Alloc tion of
fr mes, thr shin , p e size nd other consider tions. Dem nd
Se ment tion *(10 Hrs)*
5. *File m n ement (Systems, Second ry Stor e Structure): *File
Concepts, Access methods, Directory Structure, Protection nd
consistency sem ntics, File system structure, Alloc tion methods,
Free sp ce m n ement, Directory Implement tion, Efficiency nd
Perform nce, Recovery.
*(8 Hrs)*
6. *Disk M n ement (Structure, Disk Schedulin Methods):*Disk
Structure & Schedulin methods, Disk m n ement, Sw p – Sp ce
m n ement,* ** (5 Hrs)*
7. *Protection nd Security: *Go ls of protection, Dom in Protection,
Access m trix, Security Pro lem, Authentic tion, One time
p ssword, pro r m thre ts, System thre ds. *(5 Hrs)*

*Text ooks:*

1. A r h m Sil ersch tz nd peter B er G lvin, Oper tin System
Concepts, Fifth Edition, Pe rson Educ tion 1989 (Ch pter
1,3.1,3.2,3.3,3.4,3.6,4,5,6 (Except 6.8,6.9), 7, 8,9,10,11,13,
(Except 13.6) 19 (Except 19.6),20(Except 20.8, 20.9), 22,23)
2. Nutt: Oper tin Systems, 3/e Pe rson Educ tion 2004
*3. *Stu rt : Oper tin sytems : Principles , Desi n nd
Implement tion, 1st Edition
2008, Cen e Le rnin Indi
* *
*References:*
1. Mil n Milonkovic, Oper tin System Concepts nd
desi n, II nd Edition, McGr w Hill 1992.
2. Rich rd Peterson , Linux- The complete reference.
3. T nen um, Oper tion System Concepts. Pe rson
Educ tion.
4. Nutt, Oper tin Systems. Pe rson Educ tion.
5. St llin s, Oper tin Systems, Pe rson Educ tion.
6. Dh mdhere – Oper tin Systems 2/e TMH 2007
7. Flynn : Oper tin Systems , 1st Edition, 2008, Cen e
Le rnin Indi
* *
* *
*BCA30**5T**– DATA STRUCTURES Usin C*
*Tot l: 52 Hrs*
*Introduction to D t structures: *Definition, Cl ssific tion of d t
structures : primitive nd non primitive. Oper tions on d t
structures.
*(2
Hrs)*
*Dyn mic memory lloc tion nd pointers:** * Definition

Accessin the ddress of v ri le, Decl rin nd initi lizin
pointers. Accessin v ri le throu h its pointer. Me nin of st tic
nd dyn mic memory lloc tion. Memory lloc tion functions : m lloc,
c lloc, free nd re lloc.
*(4 Hrs)*
*Recursion: *Definition, Recursion in C, Writin Recursive pro r ms –
Binomi l coefficient, Fi on cci, GCD.
*(4 Hrs)** *
*Se rchin nd Sortin Se rch:- *B sic Se rch Techniues : Se rch
l orithm se rchin techniues : seuenti l se rch, Bin ry se rch –

Iter tive nd Recursive methods. Comp rison etween se uenti l nd
in ry se rch.
*(4 Hrs)*

*Sort-*Gener l B ck round: Definition, different types: Bu le sort
,Selection sort, Mer e sort, Insertion sort, Quick sort
*( 10 Hrs)* *St ck – *Definition, Arr y

represent tion of st ck, Oper tions on st ck : Infix, prefix nd postfix
not tions Conversion of n rithmetic expression from Infix to
postfix. Applic tions of st ks.
*(7
Hrs)*
*Queue** **- *Definition, Arr y represent tion of ueue,
Types of ueue: Simple ueue, circul r ueue, doule ended ueue (deue)
priority ueue, oper tions on ll types of Queues
*(7 Hrs)*
*Linked list – *Definition, Components of linked list, Represent tion of
linked list, Adv nt es nd Dis dv nt es of linked list. Types of
linked list : Sin ly linked list, Dou ly linked list,
Circul r linked list nd circul r dou ly linked list. Oper tions on
sin ly linked list : cre tion, insertion, deletion, se rch nd
displ y.
*(7 Hrs)*

*Tree - *Definition : Tree, Bin ry tree, Complete in ry tree, Bin ry
se rch tree, He p Tree terminolo y : Root, Node,
De ree of node nd
tree, Termin l nodes, Non-termin l nodes, Si lin s, Level, Ed e, P th,
depth, P rent node, ncestors of node.
Bin ry tree : Arr y
represent tion of tree, Cre tion of in ry tree. Tr vers l of Bin ry
Tree : Preorder, Inorder nd postorder. *
** ** ** **
** ** ** **
** **(7 Hrs)*
* *

*Text ooks : *
* *
1. K mth ne: Introduction to D t Structures in C. Pe rson Educ tion
2005.
2. L n s m, Ausenstein M oshe & M. T nen um A ron D t Structures
usin C nd C++ Pe rson Educ tion
*References :*
1. Weiss, D t Structures nd Al orithm An lysis in C, II Edition,
Pe rson Educ tion, 2001
2. Lipschutz:
Sch um’s outline series D t structures T t McGr w-Hill
3. Ro ert
Kruse D t Structures nd pro r m desi nin usin ‘C’
4. Trem ley nd Sorenson D t Structures
5. E. B l urusw my Pro r mmin in ANSI C.
6. B ndyop
dhy y, D t Structures Usin C Pe rson Educ tion, 1999
7. Tenen um, D t Structures Usin C. Pe rson Educ tion, 2000
8. Krishn moorthy – D t Structures usin C TMH 2008
9. Forouz n : Computer Science A Structured Pro r mmin Appro ch
usin C, 2nd
Edition, 2008 Cen e Le rnin Indi

10. Gil er : D t Structure Pseudocode Appro ch usin
C, 2ndEdition, 2008,
Cen e Le rnin Indi .
* *

*BCA305P – D t Structures Usin C - L *
* *
1. Write C pro r m to se rch for n element in n rr y usin
Bin ry se rch
2. Write C pro r m to sort list of N elements usin Bu le sort

Techni ue
3. Write C pro r m to demonstr te the workin of st ck ofsize N
usin n rr y. The elements of thest ck m y ssume to e of type
inte er or re l, the oper tions to e supported re 1. PUSH 2. POP
3. DISPLAY. The pro r m should print ppropri te mess es for
STACK overflow, Under flow nd empty, use sep r te functions to
detect these c ses
4. Write C pro r m to simul te the workin of n ordin ry Queue
usin n rr y. Provide the oper tions QINSERT, QDELETE nd
QDISPLAY. Check the Queue st tus for empty nd full.
5. Write C pro r m to simul te the workin of n Circul r Queue
usin n rr y. Provide the oper tions CQINSERT, CQDELETE nd
CQDISPLAY. Check the Circul r Queue st tus for empty nd full.
6. Usin dyn mic v ri les nd pointers Write C pro r m to
construct sin ly linked list consistin of the followin
inform tion in e ch node;
Roll – No (Inte er), N me (Ch r cter strin )

The oper tions to e supported re ;
1. LINSERT Insertin node inthe front of the list
2. LDELETE Deletin the node sed on Roll – No
3. LSEARCH Se rchin node sed on Roll-No
4. LDISPLAY Displ yin ll the nodes in the list
7. Write C pro r m to sort list of N elements usin Mer e sort
Al orithm
8. Usin Dyn mic v ri les nd pointers construct Bin ry se rch tree
of inte ers , Write C functions to do the followin ;
1. Given KEY, Perform se rch in Bin ry se rch tree . If it is
found displ y Key found else insert the key in the Bin ry se rch tree.
2. While constructin the Bin ry se rch tree do not dd ny duplic te
3. Displ y the tree usin ny of the tr vers l method
9. Write C pro r m to sort list of N elements of inte er type
usin he p sort Al orithm
C pro r m to simul te the workin of Towers of H noi
10. Write
pro lem for N disks , print the tot l num er of Moves t ken y the
pro r m.
11. Write C pro r m to sort list of N elements of inte er type
usin uick sort Al orithm
12. Write C pro r m to find ncrusin recursion
13. Write C pro r m to convert nd print iven v lid fully
p renthesized in fix rithmetic expression to post fix expression,
the expression consists of sin le ch r cter (letter or di it) s
oper nds nd +, -, * , / s oper tors, ssume th t only in ry
oper tors re llowed in the expression
14. Write C pro r m to se rch for n element usin seuenti l se rch
15. Write C pro r m to cre te file for N students, it should cont in
Roll-No, N me nd

M rks in two su jects. Usin the ove cre ted file, cre te n
out put file which

cont ins Roll-No, N me, M rks in su jects, Tot l nd Aver e.
* *
* *
*BCA30**6T**–* *NUMERICAL ANALYSIS nd LINEAR PROGRAMMING*
*Tot l: 52 Hrs*
1. Flo tin -point represent tion nd errors-Norm lized flo tin -point
forms,
Errors in representin num ers, Flo tin point m chine
num er nd m chine epsilon, Loss of si nific nce nd its
void nce(Ch pter 2 in Cheney nd Kinc id ).
*6 Hrs*
2. Roots of eu tions-loc tin roots of f(x)=0 Bisection method nd

conver ence n lysis, Newton’s method
nd conver ence n lysis,
f ilure of Newton’s method due to d st rtin points,
modific tion of Newton’s method for multiple roots, Newton’s
method for System of Non-line r eu tions, Sec nt method nd
conver ence n lysis, Golden r tio (Ch pter 3 in Cheney nd
Kinc id).
*8**Hrs*
3. Interpol tion nd numeric l differenti tion-polynomi l

interpol tion nd its existence L r n e nd Newton form of
interpol tin Polynomi l, Divided difference nd recursive
property , Inverse interpol tion ,Error in Polynomi l
interpol tion, First nd Second deriv tive formul e vi
interpol tion Polynomi ls. (Ch pter 4 in Cheney nd
Kinc id).
*8**Hrs*
4. Numeric l inte r tion-Tr pezoid l, Simpson’s nd d ptive Simpson

rules nd Error n lysis, (Ch pters 5 nd 6 in Cheney nd
Kinc id). *6 Hrs*

5. System
of line r eu tions-G usssi n elimin tion nd ck
su stitution –p rti l nd complete pivotin , Tridi on l nd
pent di on l nded systems, Thom s l orithm, Doolittle,

Cholesky nd Crout LU decomposition methods, J co i nd G uss
–Seidel iter tive methods nd conver ence theorems. Power ( nd
inverse power) method of o t inin l r est ( sm llest) ei env lue
nd correspondin ei envector. (Ch pters 7 nd 8 in Cheney nd
Kinc id). *8**Hrs*

6. Ordin ry differenti l eu tions- initi l v lue pro lem, Pic rd’s,
T ylor series, Run e-Kutt first, second nd fourth order methods,
d ptive Run e-Kutt method of fifth order (deriv
tion of only
Rune-Kutt first nd second order methods), ound ry v lue
pro lems-shootin methods for line r differenti l eu tions.
(Ch pters 10, 11 nd 14 in Cheney nd Kinc id).
*8**Hrs*
VII. Line r pro r mmin -first Prim l form, Gr phic l solution

method, Tr nsformin pro lems into first prim l form, du l pro lem,
Theorem on prim l nd du l pro lems, Second Prim l form. Simplex
method , Approxim te solution of inconsistent line r systems. (Ch pter
17 in Cheney nd Kinc id). *8**Hrs*
*Text Book*
1.Chen y E. W. nd Kinc id D. R. “Numeric l Method nd Applic tions,
Cen e le rnin (Book/cole/)-Indi n Edition(2008).
*Reference Books*
1.J in M. K. ,Iyen r S. R. K. nd J in R. K. “ Numeric l methods for
Scientific nd
En ineerin Comput tion “.
2.S stry S. S. “ Introductory methods of Numeric l An lysis “, PHI(2005).
* *

*BCA306P – **NUMERICAL ANALYSIS nd LINEAR PROGRAMMING** **L *
1. Write pro r m to find the roots of n eu tion f (x) = 0 usin

Bisection method.
2. Write pro r m to find the simple/multiple roots of f (x) = 0
usin Newton– R phson method.
3. Write pro r m to find the roots of system of non-line r
l e r ic eu tions usin Newton’s method.
4. Write pro r m to find the roots of f(x) = 0 usin Sec nt method.
5. Write pro r m to find the inte r l of function usin
Tr pezoid l rule.
6. Write pro r m to find the inte r l of function usin Simpson’s
1/3rd nd 3/8thrule usin switch c se.
7. Write pro r m to find the inte r l of function usin d ptive
Simpson method
8. Write pro r m to solve the system of eu tions Ax = in
tridi on l form usin Thom s Al orithm.
9. Write pro r m to solve the system of eu tions Ax = usin
G uss elimin tion method.

10. Write pro r m to solve the system of e u tions Ax = usin
J co i Iter tion method.
11. Write pro r m to solve the system of eu tionsAx = usin
G uss-Seidel method
12. Write pro r m to find the l r est (or sm llest) Ei en v lue nd
correspondin ei en vector of su re m trix usin power (or
inverse power) method.
13. Write pro r m to solve first nd second order ordin ry
differenti l eu tions (

initi l v lue pro lem) usin Run e-Kutt fourth order method.
14. Write pro r m to solve first order ordin ry differenti l
eu tions (initi l v lue pro lem) usin d ptive Run e-Kutt method .
15. Write pro r m to solve second order ordin ry differenti l
eu tions ( ound ry v lue pro lem) usin shootin method sed on
d ptive Run e-Kutt method nd Newton-R phson method.
16. Write pro r m to solve the optimiz tion pro lem solv le y
Simplex method.
*FOURTH SEMESTER*

*BCA402**T**– ENGLISH*

Syll us s per the one prescri ed for science courses of TumkurUniversity.
*BCA403**T**– ENVIRONMENTAL STUDIES*

*As pproved y the Environment l Science Bo rd*
*Tot l : 52 hrs*
*Unit 1: N ture of environment l studies: *Definition, scope nd
importnce, Multimedisciplin ry n ture of environment l studies, need
for pu lic w reness.

*N tur l resources nd ssoci ted pro lems: *( ) *Forest resources: *Use
nd over-exploit tion, deforest tion tim er extr ction, minin , d ms nd
their effects on forests nd tri l people, ( ) *W ter resources: *Use
nd over-utiliz tion of surf ce nd round w ter, floods, drou ht,
conflicts over w ter, d ms- enefits nd pro lems. (c) *Miner l
resources: *Use nd exploit tion, environment l effects of extr ctin
nd usin minerl resources. (d) *Food resources: *World food pro lems,
ch n es c used y riculture
effects of modern riculture,
fertilizer-pesticide
pro lems. (e) *Ener y resources: *Growin ener y
needs, renew le nd non renew le ener y sources, use of ltern te
ener y sources. (f) *L nd resources: *l nd s resources, nd l nd
de r d tion, m n induced l ndslides, soil erosion nd desertific tion.

Role of n individu l in conserv tion of n tur l resources Euit le use
of resources for sust in le lifestyles.
*(10 Hrs)*
* *
*Unit 2: Ecosystems: *Concept of n ecosystem, Structure nd function of
n ecosystem, Producers, consumers nd decomposers, Ener y flow in the
ecosystem, Ecolo ic l succession, Food ch ins, food we s nd ecolo ic l
pyr mids, Introduction, types, Ch r cteristic fe tures, structure
nd
function of the followin ecosystem: ) Forest ecosystem ) Gr ssl nd
ecosystem c) Desert ecosystem d) Au tic ecosystems (ponds, stre ms,
l kes, rivers, oce ns, estu ries)
*(10 Hrs)*
* *
*Unit 3: Biodiversity nd its conserv tion: *Introduction-Definition:
enetic, species nd ecosystem diversity, Bio eo r phic l cl ssific tion
of Indi , V lue of iodiversity: consumptive use, productive use,
soci l, ethic l, esthetic nd option v lue, Biodiversity t lo l,
n tion l nd loc l levels, Indi s me -diversity n tion, Western
h t s io-diversity,
Hot-spots of iodiversity, Thre ts to
iodiversity: h it t loss, po chin of wildlife, m n-wildlife
Conflicts, End n ered nd endemic species of Indi , Conserv tion of
iodiversity: In-situ nd Ex-situ, Conserv tion of
iodiversity.
*(10 Hrs)*
* *
*Unit 4: Environment l Pollution: *Definition,
c uses, effects nd
control me sures of: ) Air pollution ) W ter pollution c) Soil
pollution d) M rine pollution e) Noise pollution f) Therm l pollution )
Nucle r h zrds., Solid w ste m n ement: c uses, effects nd control
me sures ur n nd industri l w stes, Role of n individu l in
prevention of pollution, Dis ster m n ement: folds, e rthu ke, cyclone
nd l ndslides, Tsun mi. *(10 Hrs)*
* *

*Unit 5:Soci l Issues nd Environment:
*From Unsust in le to
Sust in le development, Ur n pro lems rel ted to ener y, W ter
conserv tion, r in w ter h rvestin , w tershed m n ement, Resettlement
nd reh ilit tion of people;
its pro lems nd concerns, Environment
l
ethics: Issues nd possi le solutions, Clim te ch n e, lo l w rmin ,
cid r in, ozone l yer depletion, nucle r ccidents nd holoc ust,
W stel nd recl m tion, consumerism nd w ste products, Environment
protection Act, Air (Prevention nd control of pollution) Act., W ter
(Prevention nd control of pollution) Act., Wildlife protection ct,
Forest conservtion Act, Issues involved in enforcement of environment l
le isl tion pu lic w reness. *(8 Hrs)*
*Unit 6: Hum n Popul tion nd the Environment: *Popul tion rowth,
v ri tion mon n tions, Popul tion explosion, F mily welf re pro r mme,
Environment nd hum n he lth, V lue Educ tion, Women nd Child Welf re,
Role of inform tion technolo y in Environment l nd hum n
he lth.* ** ** **
** ** ** (4 Hrs)*
* *
*References: *

1. S. Sinh , M. Shukl & R. Shukl , Text ook of Environment l
studies AITBS Pu lishers, Delhi. (2005)
2. A rw l, K.C., 2001 Environment l Biolo y, Nidi Pu l. Ltd. Bik ner.
3. Bh ruch Erch, The Biodiversity of Indi , M pin pu lishin Pvt.
Ltd. Ahmed d-380013, Indi .
4. Brunner R.C., 1989, H z rdous W ste Inciner tion, McGr w Hill Inc.
480p.
5. Cl rk R.S. M rine pollution, Cl nderson Press Oxford.
6. Cunnin h m, W.P. Cooper, T.H. Gorh ni, E & Hepworth, M.T. 2001
Environment l Encyclopedi , J ico Pu l. House. Mum i, 1196p.
7. De. A.K. Environment l Chemistry, Wiley E stern Ltd.,
8. Down to E rth, Centre for Science nd Environment.
9. Gleick, H.P. 1993 W ter in crisis, p cific institute for studies
in Dev. Environment l & Security. StockholmEnv. Institute. Oxford
Universitypress 473p.
10. H wkins R.E. Encyclopedi of Indi n N tur l History, Bom yN tur l

History Society, Bom y,
11. J dh v H & Bhosle V.M. 1995 Environment l Protection nd l ws.
Him l y sPu . House Delhi, 284p
12. Mckinney M.L. & Schocl R.M. 1996 Environment l Science systems &
Solutions We . Enh nced edition 639p.
13. Heywood,
Vh & W tson R.T. 1995 Glo l iodiversity Assement
C m rid e Univ. press1140p
14. Mh sk r A.K. M tter H z rdous Techno-Science Pu lic tions.
15. Miller T.G. Jr. Environment Science W dsworth pu lishin co.
16. Odum E.P. 1971 Fund ment l of Ecolo y W.B. S unders Co. USA574p
17. R o M.N. & D t A.K. 1987 W ste W ter tre tment, Oxford nd IBH
Pu l. Co pvt, ltd 345p
18. Sh rm B.K. 2001 Environment l chemistry Goel Pu l. House, Meerut.
19. Townsend C. H rper. J. nd Michel Be on, Esseseti ls of Ecolo y
Bl ckwell Science.
20. Trivedi R.K. H nd ook of Environment l L ws, rules, uidelines,
ompli nces nd St nd rds, Vol I nd II Enviro Medi .
21. Trivedi R.K. nd P.K. Goel introduction to ir pollution,
Techno-Science Pu lic tions.
22. W ner K.D. 1998 Environment l M n ement. W.B. S und rs Co.
Phil delphi , U.S.A.499p.
23. Benny Joseph – Environment l Studies 2/e TMH 2008
24. Miller : Environment l Science , 11th Edition 2008, Cen e
Le rnin Indi
*BCA404T**– DATA COMMUNICATION AND NETWORKS*

*Tot l: 52 Hrs*
*1. Communic tion Networks & Services
** ** *
Appro ches to Network desi n: Network Go ls, Network Topolo ies,
Switchin Techniues: Mess e, P cket nd Circuit switchin ,
Evolution of Network Architecture nd Services
1. Tele r ph Networks nd Mess e switchin
2. Telephone Networks nd Circuit switchin
3. Internet, Computer Network nd P cket switchin
Essenti l elements of Network Architecture
Key f ctors in Communic tion Network Evolution
(*6 **h**rs)*
*2. L yered Architecture &Applic tions

** ** *
Ex mples of L yerin : OSI Reference Model, TCP/IP Model
Applic tion L yer Protocols nd TCP/IP utilities : Telnet, FTP, HTTP nd
IP utilities like PING, TRACEROUTE, IPCONFIG, NETSTAT
*(4 hrs)*
*3. Di it l Tr nsmission **
** *
Di it l represent tion of inform tion, B sic properties of di it l
tr nsmission systems, Ch r cteriz tion of communic tion ch nnels:
Freuency dom in nd Time dom in, Fund ment l limits in di it l
tr nsmission: Nyuist si n lin r te, Sh nnonch nnel c p city, Line codin .
Modems nd Di it l modul tion: Amplitude shift keyin , Freuency shift
keyin , Ph se shift keyin .

Tr nsmission medi : Twisted P ir, Co xi l c le, Optic l Fi re, R dio
tr nsmission, Infr red Li ht.
Error detection nd correction: Error detection, two dimension l p rity
checks,
internet checksum, polynomi l codes nd their error detection
c p ility
Multiplexin : Freuency Division Multiplexin , Time Division
Multiplexin , W velen th Division Multiplexin , SONET Multiplexin
Circuit Switches: Sp ce division switches, time division
switches *(12 hrs)*
*4. Peer-To-Peer Protocols **

** ** *
nd connectionless service models, Fe tures of

Connection oriented
Services offered y iven l yer, Peer to peer protocols in end to end
nd sin le hop network

ARQ protocols: Stop nd w it, o ck N, Selective Repe t
Other peer to peer protocols: Slidin windowflow control, Timin
recovery for synchronous services, TCP Reli le stre m service nd flow
control
D t Link Control – Fr min , Point to Point Protocol (PPP), Hi h level
D t Link Control (HDLC).
*(10 **h**rs)*
*5. Medium Access Control Protocols

** ** ** ** *
Multiple ccess communic tions,
R ndom ccess MAC protocols: ALOHA, Slotted ALOHA, CSMA, CSMA/CD
Schedulin ppro ches to medium ccess control: Reserv tion systems,
pollin , Token p ssin rin s,
Comp rison of Schedulin ppro ches in medium ccess control,
Comp rison of r ndom ccess nd schedulin medium ccess controls
Ch nneliz tion: FDMA, TDMA, CDMA
*(7 h**rs)*
*6**. Loc l Are

Networks
** *

LAN structure, MAC su l yer, Lo ic l Link Control l yer (LLC),
LAN St nd rds: Ethernet nd IEEE 802.3 LAN st nd rd, Token Rin nd IEEE
802.5 LAN st nd rd, FDDI,
Wireless LANs nd IEEE
802.11 st nd rd, LAN
rid es: Tr nsp rent rid es, Source Routin rid es, Mixed-medi
rid es.
*(7 **h**rs)*
* *
*7**. P cket Switchin
Networks
** ** ** *
Network services nd Intern l Network oper tion, P cket network
topolo y, D t r ms nd Virtu l circuits, Connectionless p cket
switchin : Virtu l circuit p cket switchin , Structure of p cket switch
Routin
in p cket networks : Routin l orithm cl ssific tion, Routin
t les, Floodin , Hier rchic l Routin , Shortest p th routin
l orithms ( Bellm n Ford Al orithm, Dijkstr ’s Al orithm), Link St te
routin , Dist nce Vector Routin
Con estion control l orithms: Open Loop control nd Closed Loop
control *(6 **h**rs)*
* *

*Text ooks*
1. Dou l s E Comer. “Networks nd Internet with Internet

Applic tions”. Prentice H ll, 2004.
2. St llin s, D t nd Computer Communic tions, 7/e, Pe rson
tion, 2003
Educ
3. Al erto Leon-G rci & Indr Widj j , Communic tion Networks –
Fund ment l Concepts & Key rchitectures, Mc.Gr w Hill – 2000.
*References*

1. Andrew S T nen um ComputerNetworks, 4/e, Pe rsonEduc tion
2. S. Kesh v, An En ineerin Appro ch to Computer Networks,
Pe rsonEduc tion.
3. Behrouz Ferouz n, Introduction to D t Communic tions &
Networkin TMH, 1999.
4. L rry& Peterson& Bruce S D vis; Computer Networks Second Edition,
Mor n K ufm n, 2000.
5. H ls , D t Communic tion, Computer Networks nd Open Systems.
Held, Underst ndin D t Communic tions.
6. Forouz n – D t Communic tions nd Networkin 4/e (SIE)
7. White : D t Communic tions nd Networkin 1st Edition, 2008,
Cen e Le rnin Indi
* *
*BCA405**T**– **VISUAL PROGRAMMING*
*Tot l: 52 hrs*
*Unit 1*: Windows Pro r mmin : Tr dition l Pro r mmin P r di ms –
Overview of Windows Pro r mmin – D t Types – Resources – Windows
es – Device Contexts – Document Interf ces – Dyn mic Linkin
Mess
Li r ries – Softw re Development Kit (SDK) Tools – Context
Help.
*10 hrs*

*Unit 2*: Visu l B sic Pro r mmin : Introduction – Forms – V ri les,
Types – Properties – Decision M kin – Loopin – Modules – Procedures –
Functions-Tool
Box Controls – Menus – Grid Controls
– Di lo Boxes –
D t se M n er – D t Control – Record set O jects. *20 hrs*

*Unit 3*: Visu l C++ Pro r mmin : O jects – Cl sses - VC++ Components
– Resources – Event H ndlin – Menus – Di lo Boxes – Importin VBX
Controls – Files – MFC File H ndlin – Document View Architecture –
Seri liz tion. *10 hrs*
*Unit 4*: Interf cin Other Applic tions – Multiple Document Interf ce
(MDI) – Splitter
Windows – Exception
H ndlin – De u in – O ject
Linkin nd Em eddin (OLE) – D t se Applic tion – DLL –
ODBC.
*12 hrs*
*Text Books*:

1.Visu l B sic 6 y Gurumit sin h (Am n) , Firew ll medi .
2. Deitel, Visu l B sics 6- How to pro r m. Pe rson Educ tion
*Reference Books*:

1. Windows Pro r mmin y Ch rles Petzold,
Microsoft Press.
2. Visu l B sic 6 from the round up y G rry Cornell, TMH.
3. Visu l C++ Pro r mmin
y Steven Holzner, PHI.
4. Visu l Pro r mmin y Y shw nt K nitk r.
* *
*BCA405P – VISUAL PROGRAMMING LAB*

* *Minimum of 15 rel ted pro r ms must e developed in the
pr ctic l cl sses in such w y th t inte
r tion of the pro r ms le ds
to n ppliction pro r m. This should e pre-cursor to the mini
projects to e t ken up y the students in the fifth nd sixth semesters.
* *
*BCA40**6T**– **UNIX PROGRAMMING*
*Tot l: 52 Hrs*
1. *Introduction *
History,s lient fe tures, Unix system rchitecture, Unix comm nd form t,
Unix intern l nd extern l comm nds, Directory comm nds, File rel ted
comm nds, Disk rel ted comm nds, ener l utilities.
( *6**)*
2. *Unix File System*

Boot inode, super nd d t lock, in-core structure, Directories,

conversion of p thn me to inode, inode to new file, Disk lock
lloc tion. *( 2**)*
3. *Process M n ement*
Process st te nd d t structures of Process, User vs. kernel node,
context of Process, ck round processes, Process schedulin comm nds,
Process termin tin nd ex minin comm nds.
*( 6 )*
4. *Second ry Stor e M n ement*

Form ttin , m kin file system, checkin disk sp ce, mount le file
system, disk p rtitionin , file compression.
*( 6 )*
5. *Speci l Tools nd Utilities*

Filters, Stre m editor SED nd AWK, Unix system c lls nd li r ry
functions, Processes, si n ls nd Interrupts, stor e nd compression
f cilities. *( 8 )*
6. *Shell Pro r mmin *
Vi editor, shell types, shell comm nd line processin , shell script
fe tures, executin shell script, system nd user-defined v ri les,
comm nd, shell screen interf ce, re d nd echo st tement, comm nd
expr
su stitution, esc pe seuence ch r cters, shell script r uments,
position l p r meters, test comm nd, file test, strin test, numeric test.
Condition l Control Structures – if st tement, c se st tement
Loopin Control Structure – while, until, for, st tements.

Jumpin Control Structures – re k, continue, exit.
*( **16**)*
7. *Unix System Communic tion*

Introduction, write, re d, w ll comm nds, sendin nd h ndlin
m ils. *( **4**)*
8. *System Administr tion*

Roles of System Administr tor, File System M inten nce, System St rtup
nd Shutdown, UserM n ement, B ckup nd Restore, D emons, Dom in N me
System DNS, Distri uted File System.
( *4*)
* *
*Text Books*
1. Forouz n : Unix nd Shell Pro r mmin , 1st Edition, 2008 Cen e
Le rnin Indi
2. R ymond, The Art of
Unix Pro r mmin , Pe rson Educ tion, Asi 2002.
3. Kerni h n B W & Ro ert B, The Unix pro r mmin environment.
4. UNIX nd Shell Pro r mmin , Arch n Verm , Firew ll Medi .
*References *
1. Gl ss, Unix for Pro r mmers nd Users, 3/e Pe rsonEduc tion
2. Kerni
h n, The Unix Pro r mmin Environment
3. So ell G, A pr ctic l Guide to Unix System.
4. Koch n,Unix Shell Pro r mmin , Pe rson
5. Sumith D s – UNIX: Concepts nd Applic tions 4.e
* *
* *
*BCA406P **- UNIX* *PROGRAMMING **LAB*
*SECTION A*
Write Shell pro r ms for the followin :

1. To count the num er of ch r cters in iven strin
2. To find whether the iven ye r is le p ye r or not

3. To check whether iven num er is even or odd

4. To find the f ctori l of iven num er.
5. To print strin in the reverse order.
in iven strin .
6. To count the num er ofvowels
7. To print ll prime num ers etween m nd n (m<n).
8. To check whether iven strin is p lindrome or not.
9. Write shell script th t displ ys ll the files in the current
directory.
10. To write shell script th t cre tes file nd compresses it usin :

) compress ) p ck
*SECTION B*
11. Cre te file cont inin the followin fields: student No.,
student n me, e, sex, hei ht nd wei ht. Print ll the det ils
in ne t form t.

Write menu sed shell pro r ms with t le st 3 options for the followin :
12. P yroll system
*FIFTH SEMESTER*
*BCA501**T**– SOFTWARE ENGINEERING*
*Tot l: 52 Hrs*
1. *Introduction:*Definition of Softw re en ineerin , Softw re
product nd softw re process, Softw re ttri utes, Softw re
En ineerin ch llen es, Softw re development life cycle, Process
model: W ter f ll model, Bohemi ’s Spir l model, Iter tive
enh ncement model, Overview
of risk m n ement, Project
m n ement,
Process visi ility, Profession l nd ethic l
responsi ility. *(4 Hrs)*
2. *System En ineerin :*System nd their environment, System
Procurement, System En ineerin Process, System Architecture
modelin , Hum n F ctors, System Reli ility
En ineerin .
*(3 Hrs)*
3. *Softw re Reuirement An lysis nd Specific tion:*
Softw re Reuirements - Function l nd Non Function l,
Reuirement elicit tion nd An lysis, SRS document, Reuirement
specific tion, Reuirement En ineerin Process, Reuirement
V lid tion, Reuirement M n ement. Soci l 7 or niz tion l
f ctors, System Models – Types of models, Metrics.
*(8 Hrs)*
4. *Softw re Prototypin :*Prototypin in softw re process,
Prototypin techniues, User interf ce prototypin .
*(2 Hrs)*
5. *Softw re Desi n: *Desi n types*, *Desi n principles – Pro lem
p rtitionin , A str ction, Modul rity, Top-Down nd Bottom-up,
Desi n process, Desi n Str te ies, Desi n u lity, Couplin nd
Cohesion, Desi n not tion nd specific tion, Desi n methodolo ies,
Dom in Specific rchitecture. *(5 Hrs)*
6. *O ject oriented desi n nd function
oriented desi n:*O ject
oriented
concepts-Cl sses
nd o jects, inherit nce, polymorphism,
O ject identific tion, O ject oriented n lysis nd desi n
ex mple, Desi n models, o ject interf ce specific tion, D t flow
desi n, Structur l decomposition, Det iled desi n.
*(5 Hrs)*
7. *User Interf ce Desi n: *Desi n Issues, User inter ction,
Inform tion present tion, User interf ce desi n process, user
n lysis, user interf ce prototypin , Interf ce
ev lu tion.
*(3Hrs)*
8. *Reli ility nd reus ility: *Softw re reli ility metrics,
softwre reli ility specific tions, st tistic l testin ,
reli ility rowth modelin , f ult void nce, f ult toler nce,
exception h ndlin nd defensive pro r mmin , softw re development

with reuse, reuse l ndsc pe, desi n p tterns, Gener tor sed
reuse, Applic tion system reuse – COTS product reuse, softw re
product lines.
*(8 Hrs)*
9. *Testin : *Testin fund ment ls – error, f ult nd f ilure, Test
c ses nd test criteri
, process, test pl n nd str te ies, Types
of testin – Bl ck ox, White ox, structur l nd interf ce
testin , Pro r m inspection, Levels of testin , M them tic lly
sed verific tion, St tic n lysis tool, Metrics.
*(8 Hrs)*
10. *Softw re M n ement:*Project m n ement, u lity m n ement, cost
estim tion, cost estim tion models, Risk m n ement, softw re
m inten nce. *(6 Hrs)*
*Text Books*
* *
*1. I n Sommerville - *Softw re En ineerin , 6th Edition, Pe rson
Educ tion Ltd.
*Reference Books*
1. *Ro er S. Pressm n - *Softw re En ineerin , A Pr ctitioner’s
ppro ch, 5thEdition, McGr w-hill ook comp ny
2. *Rich rd F irly – *Softw
re En ineerin Concepts*, *First Edition,
TATA Mc r w Hill Pu lishin Co Ltd.
3. *P nk j J lote – *An inte r ted ppro ch to Softw re En ineerin –
N ros

Pu lishin house.
*4*. *J w dek r*- Softw re En ineerin : A Primer TMH 2008
*BCA502**T**– COMPUTER ARCHITECTURE*

*Tot l: 52 Hrs*

DIGITAL LOGIC CIRCUITS:
Lo ic tes Boole n l e r , m p
simplific tion, com in tion l circuits, flip-flop, seuenti l
circuits.
*(05)*
INTEGRATED CIRCUITS AND DIGITAL FUNCTIONS: Di it l inter ted circuits,

IC flip-flops nd re isters, decoders nd multiplexers, in ry counters,
shift re isters, r ndom - ccess memories (RAM) re d-only memories
(ROM)
*(10)*
DATA REPRESENTATION : D t types, fixed-point

represent tion,
flo in -point represent tion, other in ry codes, error detection
codes. *(05)*
BASIC COMPUTER ORGANIZATION AND DESIGN: Instruction codes, computer

instruction, timin nd control, execution nd instruction, input-output
nd interrupt, desi n of computer.
*(10)*

CENTRAL PROCESSOR ORGANIZATION: Processor us or niz tion, rithmetic
lo ic unit (ALU), instruction form ts, ddressin modes, d t tr nsfer
nd m nipul tion, pro r m control, microprocessor
or niz tion.
*(10)*
INPUT-OUTPUT ORGANIZATION: Peripher l devices, synchronous d t

tr nsfer, direct memory ccess (DMA), priority interrupt, input-output
processor (IOP). *(06)*
MEMORY ORGANIZATION : Auxili ry memory, microcomputer, memory
hier rchy, ssoci tive memory, virtu l memory, c che memory.
* **(06)*
*References:*
1. M.Moris M no, Computer System Architecture, 2ndEdition Prentice
H ll of Indi (1991).
2. Heurin nd Jord n, Computer systems desi n nd Architecture,
Pe rson Educ tion (2003)
3. Willi m St llin s, Computer Or niz tion nd Architecture, Pe rson
Educ tion (2003)
4. Floyd, Di it l Fund ment ls, 8thEdition, Pe rson Educ tion (2003)
5. Andrew S. Tenen um, Structured Computer Or niz tion, 3rdEdition,
Prentice H ll of Indi (1990)
6. D vid P tterson & .Hennessy, Computer Or niz tion & Desi n,
Elsevier, 2005.
7. C rter – Computer Architecture (SIE) (Sch um’s Outline Series)
* *
*BCA503**T**– **BANKING**AND INSURANCE*
*Tot l: 52 Hrs*

UNIT I: Fin nci l System: Institutions, M rkets – Prim ry, Second ry,
Money & C pit l m rkets, instruments of money m rket, Functions nd
their economic si nific nce.
*(12)*

UNIT II: Commerci l B nks-Functions, Structure of Commerci l nks in
-Sources of funds, Investment norms-f
Indi ctors determinin
liuidity
of nks-Asset Structure of Commerci l nks-profit ility of
nks
*(12)*
UNIT III: The concept of Risk & Insur nce – cl ssific tion of
insur nce-life insur nce—types ofGener l Insur nce – insur nce of
property, pecuni ry interest, li ility nd person – types of policies
fire, m rine, motor, en ineerin , vi tion, riculture, li ility nd
person.
*(08)*

UNIT IV: Essenti ls of contr ct- Principles pplic le to insur nce
usiness- utmost ood f ith- insur le interest-indemnity-su ro tion
nd contri ution – proxim te c use- fin nci l principles- premium funds-
investments-reserves-surplus-v lu tion of funds. Introduction to risk-
Risk Appr is l-risk selection-underwritin -Reinsur nce-concepts nd
methods-f cult tive, tre ty reinsur nces nd v rious methods.
*(12)*
UNIT V: Growth nd development of insur nce – present d y

Re ul tory environment-Insur nce Act, 1938-IRDA Act, 1999-Present M rket
environment- intermedi ries – Office
or niz tion-dep rtments-files-correspondence-new technolo y,
controls. *(08)*
*References:*
1. G. Kotresw r, Risk M n ement, Insur nce nd
Deriv tives- Him l y

Pu lishin House.
2. T.T. Seth, Insur nce Principles nd Pr ctice- S
Ch nd, New Delhi
3. Courses IC 01, IC 02, IC 11, IC 12, IC 25 of
Insur nce Institute of Indi , Mum i
4. L.M. Shole – Fin nci l Institutions nd M rkets,
TMH.
5. K.C. Shek r & L kshmy
Shek r, B nkin Theory &
Pr ctice, Vik s Pu lic tion
(2001).
*BCA504**T**– **JAVA **PROGRAMMING*

*Tot l: 52 Hrs*
1.*Introduction: *Internet ori in nddevelopment – internet
rchitecture fr me work-world Wide We .
2. *Introduction to JAVA: *JAVA Evolution: J v History, J v Fe tures,

How J v Differs from C nd C++, J v nd Internet, J v nd World Wide
We , We Browsers, H rdw re nd Softw re reuirements, J v Support
Systems, J v Environment. Overview of JAVA L n u e: Introduction,
Simple J v Pro r m, More of J v , An Applic tion with Two Cl sses J v
Pro r m structure, J v Tokens, J v St tements, Implementin J v
Pro r m, J v Virtu l Mchine, Comm nd Line Ar uments, Pro r mmin
Style. Const nts, V ri les, nd D t Types: Introduction, Const nts,
V ri les, D t Types, Decl r tion of V ri les, Givin V lues to

V ri les, Scope of v ri les, Sym olic Const nts, Type C stin , Gettin
V lues of V ri les, St nd rd Def ult V lues, Oper tors nd Expressions;
Introduction, Arithmetic Oper tors, Rel tion l Oper tors, Lo ic l
Oper tors, Assi nment Oper tors, Increment nd Decrement Oper tors,
Condition l Oper tors, Bitwise Oper tors, Speci l Oper tors, Arithmetic
Expressions, Ev lu tion of Expressions, Precedence of Arithmetic
Oper tors, Type conversion nd Associ tivity, M them tic l Functions.
Decision M kin nd Br nchin : Introduction, Decision M kin with if
St tement, Simple if St tement, The if …… else St tement, Nestin of if
……… else St tements, The else if L dder, The Switch St tement, The ?:
Oper tor. Decision M kin nd Loopin : Introduction. The while
St tement, The do St tement, The for St tement, Jumps in Loops L eled
Loops.
*(12 Hrs)*

3. *Cl sses, Arr ys, Strin s nd Vectors: *Cl sses, O jects nd Methods:
Introduction,
Definin Cl ss, Addin V ri les, Addin Methods,
Cre tin O jects, Accessin Cl ss Mem ers, Constructors, Methods
Overlo din , St tic Mem ers, Nestin ofMethods, Inherit nce: Extendin
Cl ss Overridin
Methods, Fin l V ri les nd Methods, Fin lizer
methods, A str ct Methods nd Cl sses, Visi ility Control. Arr ys,
Strin s nd Vectors: Arr ys, One – dimension l Arr ys, Cre tin n
Arr y, Two – dimension l Arr ys, Strin s, Vectors, Wr pper
Cl sses.
*(8 Hrs)*
4. *Interf ces, P ck es, nd Multithre ded Pro r mmin : Interf ces:
*Multiple Inherit nce: Introduction, Definin Interf ces, Extendin
Interf ces, Implementin Interf ces, Accessin Interf ce V ri les.
*P ck es: *Puttin Cl sses to ether: Introduction, J v API P ck es,
Usin System P ck es, N min Conventions, Cre tin P ck es, Accessin
P ck e, Usin P ck e, Addin Cl ss to P ck e, Hidin Cl sses.
*Multithre ded Pro r mmin : *Introduction, Cre tin Thre ds, Extendin
the Thre d Cl ss, Stoppin nd Blockin thre d, Life Cycle of
thre d, Usin Thre d Methods, Thre d Exceptions,
Thre d Priority,
Synchroniz tion, Implementin the ‘Runn le’ Interf ce.*
** ** ** ** (10 Hrs)*
5. *M n in Exceptions, Applet Pro r mmin : M n in Errors nd
Exception: *Introduction, Types of Errors, Exceptions, Synt x of
Exception H ndlin Code, Multiple C tch St tements, Usin Fin lly
St tement, Throwin Our Own Exceptions, Usin Exceptions for De u in .
Applet Pro r mmin : Introduction, How Applets Differ from Applic tions,
Prep rin to Write Applets, Buildin Applet Code,
Applet Life Cycle,
Cre tin n Execut le pplet, Desi nin We P e, Applet T , Addin
Applet to HTML File, runnin the Applet, More outApplet T , P ssin
P r meters to Applets, Ali nin the Displ y, More A out HTML T s,
Displ yin Numeric l V lues, Gettin Input from the Usr.
*(12 Hrs)*
6. *Gr phics Pro r mmin , Input / Output: Gr phics Pro r mmin :
*Introduction, The Gr phics Cl ss, Lines nd rect n les, circles, nd
Ellipses, Dr win Arcs, Dr win Poly ons, Line Gr phs, Usin Control
Loops in Applets, Dr win B r Ch rts. *M n in * *Input / Output Files
in JAVA: *Introduction, Concept of Stre ms, Stre m Cl sses, Byte Stre m
Cl sses, Ch r cter Stre m Cl sses, Usin Stre ms, Other Useful I/O
Cl sses, Usin the File Cl ss, Input/Output Exceptions, Cre tion of
Files, Re din /Writin Ch r cters, Re din /Writin Bytes, H ndlin
Primitive D t Types, Conc ten tin nd Bufferin Files, Inter ctive
Input nd output, Other Stre m Cl sses.
*(10 Hrs)*
* *
*Text Books: *

1. Shishir Gund v r m, CGI Pro r mmin on the World Wide We ,
O’Reilly nd Associ tes, (1996). (Ch pter 1 – 7)
2. E. B l urusw my, Pro r mmin with JAVA, A Primer, 2ndEdition.,
TMH (1999), (Ch pter 2 – 16)
3. H thleen H l t , Internet
Pro r mmin with VB Script nd J v
Script, Thomson Pu 2005.
*References:*
1. Thom s Boutel, CGI pro r mmin in C nd Perl, Addison – Wesley,
(1996).
2. Jefry Dwi ht et l, Usin CGI, (Second Edition), Prentice H ll,
Indi , (1997).
3. D rrel Ince & Ad m Freem n, Pro r mmin the Internet with J v ,
Addison – Wesley, (1997).
4. KenArnold & J mes Goslin , The J v Pro r mmin L n u e, Addison
– Wesley, (1998)
5. P trick N u hton & Her ert Schildt, JAVA 2: The Complete
Reference, 3rdEdition,
TMH, (1999).
6. Schildt: JAVA The Complete Reference 7/e
7. Kh lid Mu h l : JAVA Actu lly, 1st Edition 2008, Cen e
Le rnin Indi
8. Wi lesworth : JAVA Pro r mmin Adv nced Topics 3rd Edition,
2008,Cen e Le rnin Indi .
* *

*BCA504**P**– **JAVA **PROGRAMMING**L *

1. Write pro r m to find f ctori l of list of num er re din input
s comm nd line r ument.
2. Write pro r m to displ y ll prime num ers etween two limits.
3. Write pro r m to sort list of elements in scendin nd
descendin order nd show the exception
h ndlin .
4. Write pro r m to implement Rhom us p ttern re din the limit
form user.
5. Write pro r m to implement ll strin oper tions.
6. Write pro r m to find re of eometric l fi ures usin method.
7. Write pro rm to implement constructor overlo din y p ssin
different num er of p r meter of different types.
8. Write pro r m to
cre te student report usin pplet,
re d the
input usin text oxes nd displ y the o/p usin uttons.
9. Write pro r m to c lcul te onus for different dep rtments usin
method overridin .
10. Write pro r m to implement thre d priorities.

11. Write pro r m to implement
thre d, pplets nd r phics y
implementin nim tion of ll movin .
12. Write pro r m to implement mouse
events.
13. Write pro r m to implement key o rd events.
* *
* *
*BCA505**P**–* *PROJECT*
* *
*BCA 506P - SOFT SKILLS & PERSONALITY DEVELOPMENT*
*_The self concept_*: Wh t is ttitude? The process of ttitude

form tion. You re the chief rchitecture of your self .Self m n ement
techniues.
* *
*_Believe in your self _*: Self im e nd self
esteem ,Buildin self
confidence ,Environment we mix with, how to uild self im e ? ,Me nin
nd definition of person lity.
*_Person l pl nnin nd success ttitude_*: Prioritizin , cre tin the

m ster
pl n , ctive positive visu liz tion nd positive ttitude, How
to uild success ttitude, Spot n lysis .
tion & communic tion :_*Levels of motiv tion ,power

*_Self motiv of
irresisti le enthusi sm ,etiuettes nd m nners in roup, pu lic
spe kin , or l nd written communic tion , Body l n u e, Import nce of
listenin nd respondin , Tips for technic l writin .
*_Le dership s process :_*co-ordin tion while workin in te m,

Le dership styles, Le der & Te m pl yer , M n ement of conflict,
Profiles of re t nd successful person lities, Role of c reer pl nnin
in person lity development, How to f ce person l interviews nd roup
discussions.

*_Reference ooks : _*
1. W ll ce : Person lity Development 1st Edition, 2008 Cen e
Le rnin Indi
2. Succeed for your self -Rich rd Denny (3rd edition)- Ko n p e Indi
_www.viv roupindi .com_ <http://www.viv roupindi .com>
3)Unle shin Le dership – John Hoover & An elo V lenti – J ico
pu lishin House
–WWW.JAICOBOOKS.COM
4) Kundu, C.l.- Person lity development, Sterlin B n lore.
5) Listenin nd Respondin – S ndr D.Collins-Cen e Le rnin Indi
6)1,001 w ys to inspire your or niz tion, your te m nd your self –
D vid E. Rye-

J ico pu lishin house

*_O jectives of the course_*:
1. To provide n underst ndin of wh t is person lity nd wh t re
the processes of developin one ‘s person lity.
2. To m ke student w re of his or her role in different settin s
such s son, d u hter, sister, rother ,nei h or ,citizen nd so on.
3. To cre te w reness out physic l, intellectu l, emotion l,
soci l, educ tion l spects of person lity.
4. To provide skills of written nd or l communic tion with focus on
skill development.
* *

*Methodolo y of testin ev lu tion will e iven in the e innin of the
c se studies, present tions mock interviews
semester. Group discussions,
re the ener l methods to e followed p rt from convention l tr inin
nd co chin .*
* *
*SIXTH SEMESTER*
* *
*BCA601**T**– DESIGN AND ANALYSIS OF ALGORITHMS*
1) *Introduction:*Definition of l orithm, Ch r cteristic of l orithm,

Different Control Structures, Writin Structured Pro r ms, An lysis of
l orithm (*7 hrs)*
* *
2. *Divide nd Conuer: *Gener l Method, Bin ry Se rch, Findin M ximum
& Minimum., Mer e Sort, Quick Sort. * **
** ** ** **
** ** **(10 hrs)*

3. *Greedy Method:*Gener l method, Kn ps ck Pro lem, Jo Seuencin with
de dline, Minimum – cost Sp nnin trees, Sin le – Source Shortest
P ths *(10 hrs)*
4. *Dyn mic Pro r mmin : *Introduction to Gr phs, Definition types,

Terms rel ted to r ph, Gener l Method, Multist e Gr phs, All
p ir
Shortest P ths, 0/1 – kn ps ck, The tr velin s lesperson pro lem, Flow
Shop Schedulin .
*(10 hrs)*
* *
5. *B sic tr vers l & Se rch techniues: *Se rch & tr vers l techniues
for trees, Se rch & tr vers l techniues for r phs.
*(**8 hrs**)*

6.*B cktr ckin : *Gener l method, The 8- Queens Pro lem, Sum of su sets,
Gr ph Colorin .
*(7 Hrs)*

*Text ooks:*
1. Aho Ullm n & Hopkr ft “Desi n & n lysis of Al orithms”.
2. S r B se, Allen V n Gelder, Computer Al orithms , Introduction to
desi n nd
An lysis, 3rdedn (9threprint), Pe rson, 2005.
3. Desi n & An lys of lo orithm- Horowitz & S hni
4. Fund ment ls of Computer l orithm – Ellis Horowitz, S rt j S hni,
S n uthev r
R j sek r n.
*References:*
1. Berm n : Al orithms , 1stEdition 2008, Cen e Le rnin Indi
*BCA602**T**– SYSTEMS PROGRAMMING*

* *
1. *B ck round: *M chine Structure,
Evolution of the Components of
Pro r mmin System., Assem ler, Lo ders, M cros, Compilers, Form l
Systems. (*3 Hrs)*

2. *M chine Structure, M chine L n u e nd
ssem ly l n u e.: *Gener l
M chine Structure, M chine L n u e, Assem ly L n u e
(*8 Hrs)*

3. *Assem lers: *Gener l Desi n Procedure, Desi n of ssem ler,

St tement of Pro lem, Dt structure, Form t of d t ses, l orithm,
look for modul rity, T le Processin : Se rchin
nd Sortin ., The
pro lem, Se rchin t le, line r Se rch, in ry Se rch, Sortin ,
interch n e sort, Shell Sort, Bucket Sort, R dix Exch n e Sort, ddress
c lcul tion sort, comp rison of sorts, h sh or r ndom entry
se rchin . (*10 Hrs)*
*MACRO LANGUAGE AND THE MACRO PROCESSOR: *M croinstruction, Fe tures of
m cro f cility, M cro instruction r uments, condition l m cro
Exp nsion, m cro c lls within m cros, m cro
instructions definin
m cros., Implement tion, St tement of pro lem, implement tion of
restricted f cility, A two p ss l orithm. A sin le p ss l orithm,
implement
tion of m cro c lls within m cros. Implement tion within n
ssem les.
*(10 Hrs)*
*LOADERS:
*Lo der schemes,
Compile & o, Gener l lo din Scheme,
solute lo ders, Su routine L n u es, Reloc tin lo ders, Direct
linkin lo ders, other
lo din Schemes– Binders, linkin lo ders,
Overl ys, Dyn mic inders. Desi n of solute lo der., Desi n of
Direct linkin lo der Specific
tion of pro lem, Specific tion of d t
structure, form t of d t ses l orithm.
*(10 Hrs)*

*COMPILERS:
*St tement of pro lem, Pro lem1: Reco nizin sic Elements,

Pro lem2: Reco nizin Synt ctic cutis & interpretin me nin , Pro lem3:
Stor e lloc tion., Pro lem4: Code Gener tion. Optimiz tion (m chine
independent) optimiz tion(m chine dependent), Assem ly Ph se, Gener l
model of compiler *(6Hrs)*
*PHASES OF COMPILERS: *Simple Structure of Compiler, Brief introduction
to 7 Ph ses of Compilers,
*(5 Hrs)*

*Text ooks:*
1. John J. Donowon , System Pro r mmin , TATA McGr w-Hil.
2. Beck: System Softw re, 3/e Pe rson Educ tion
*References:*
1. Dh mdhere: System pro r mmin nd Oper tin System TMH
* *
* *
* *
* *
* *
* *
* *
* *
*BCA603**T**– COMPUTER GRAPHICS*
*Tot l: 52 Hrs*

1. *Gr phics Systems*:
Applic tion of CG, CG cl ssific tion-Gr phic softw res- CRT
Functionin - F ctors Affectin CRT- R ster sc n System – Sh dow m sk
method, Displ y Processor with r ster system- R ster co-ordin te system-
color m ppin - Instruction set nd R ster System
pplic tions.
*(6 hrs)*
2. *Output Primitives*

Line dr win methods-Direct, DDA nd Bresenh ms, line ttri utes, -
Circle dr win -Direct nd midpoint circle dr win -Ellipse Dr win -
Bresenh ms Ellipse
Al orithm-Are fillin - sc n- line re fillin nd
ch r cter ttri utes.
*(8 hrs)*
3. *Two_dimension l* *Tr nsform tion*_:_

B sic Tr nsform tion, Tr nsl tion, Rot tion, Sc lin - Reflection nd
Sheer m trix represent tions- Homo eneous co-ordin tes- composite
tr nsform tion- R ster methods for tr nsform tion.
*(8 hrs)*
4.*Windowin nd Clippin *:

Viewin Tr nsform tions, Clippin process, Point clippin , Line
Clippin , Cohen Sutherl nd line clippin l orithm, Midpoint Su division
l orithm, Are clippin , Sutherl nd nd Hod em n Poly on clippin
Al orithm, Text clippin .
*(6 hrs)*
5.*Three Dimension l Gr phics*:

3D-coordin te system, 3D-Displ y techniues, 3D-tr nsform tions,
Poly on surf ces, Octrees, Bezier curves, Hidden surf ce remov l, Depth
uffer nd sc n-line method. * ** **(6 hrs)*
6.*Se ments*:
Introduction,
functionsfor se mentin , displ y file, se ment
ttri utes, displ y file compil tion.
*(6 hrs)*
7.*Gr phic l Input Techniues*:

Positionin techniues, Grid, Constr ints, Dyn mic m nipul tion,
Gr vity field,

Ru er nd, Selection techniue, Menu, Pointin nd selection y
n min . *( 8 hrs)*
8.*Gr phic l Input Devices*:

Key o rds, Mouse, Joystick, Touch P nels, Tr ck ll.
*(4 hrs)*
*Text Books*:
1. Don ld He rn & M. P uline B ker, Computer Gr phics C version, PHI 1990
2. Steven H rrin ton, Computer Gr phics, MCGH.
*References*:
1. Newm n & Sproull, Principles of Inter ctive Computer Gr phics,
McGr w Hill.
2. Yeshw nt K netk r, Gr phics Under C, BPB pu lic tions.
3. J.D. Foley, A.V. D m, S.K. Feiner & J.F. Hu hes, Computer
Gr phics, Addison Wesley, 1997.
4. Cooley, The Essence of Computer Gr phics, Pe rson Educ tion
5. Sinh – Computer Gr phics
* *
* *
* *
* *
* *
* *
*BCA604**T**- **WEB PROGRAMMING*
*Tot l Hours : 52 ** ** **
** ** *

*1. Fund ment ls of We ** ** * *
** ** ** **
** 15 Hrs*

Internet, WWW, We Browsers, nd We Servers, URLs, MIME, HTTP,
Security, The We Pro r mmers Tool ox. XHTML: Ori ins nd evolution of
HTML nd XHTML, B sic synt x, St nd rd XHTML document
structure, B sic
text m rkup, Im es, Hypertext
Links, Lists, T les, Forms, Fr mes,
Synt ctic differences etween HTML nd XHTML.
*2. CSS ** ** ** **
** ** ** **
** ** **6 Hrs*
Introduction, Levels of style sheets, Style specific tion form ts,
Selector forms, Property v lue forms, Font properties, List properties,
Color, Ali nment of text, The Box model, B ck round im es, The <sp n>
nd <div> t s, Conflict resolution.
*3. J v Script ** ** **
** ** ** **
** ** ** **10 Hrs*

Overview of J v Script; O ject orient tion nd J v Script; Gener l
synt ctic ch r cteristics;
Primitives, oper tions, nd expressions;
Screen output nd key o rd input; Control st tements; O ject cre tion
nd modific tion; Arr ys; Functions; Constructor; P ttern m tchin usin
re ul r expressions; Errors in scripts; Ex mples.
*4. J v Script nd HTML Documents, Dyn mic Documents with J v Script
** * *15 Hrs*

The J v Script execution environment; The Document O ject Model; Element
ccess in J v Script; Events nd event h ndlin ; H ndlin events from
the Body elements, Button elements, Text ox nd P ssword elements; The
DOM 2 event model; The n vi tor o ject; DOM tree tr vers l nd
modific tion.
Introduction to dyn mic
documents; Positionin elements; Movin
elements; Element visi ility; Ch n in colors nd fonts; Dyn mic
content; St ckin elements; Loc tin the mouse cursor; Re ctin to
mouse click; Slow movement of elements; Dr in nd droppin elements.
*5. XML** ** ** **
** ** ** **
** ** ** **6 Hrs*
Introduction; Synt x; Document structure; Document Type definitions;
N mesp ces; XML schem s; Displ yin r w XML documents; Displ
yin XML
documents with CSS; XSLT style sheets; XML processors; We services.
*Text Books*

1. Ro ert W. Se est : Pro r mmin the World Wide We , 4th Edition,
Pe rsonEduc tion, 2008. (Ch pters 1 to 9)
*Reference Books*

1. M. Deitel, P.J. Deitel, A. B. Gold er : Internet & World Wide We
How to pro r m,3rd Edition, Pe rson Educ tion / PHI, 2004.
2. Chris B tes: We Pro r mmin Buildin Internet Applic tions,
3rdEdition, Wiley Indi , 2006.
3. Xue B i et l: The We Wrrior Guide to We Pro r mmin , Thomson, 2003
4. Skl r : Principles of we desi n , 1stEdition, 2008 Cen e
Le rnin Indi
5. Skl r : The We W rrior Guide to We Desi n Technolo ies, 1st
Edition, Cen e Le rnin Indi

*BCA604P - **We Pro r mmin L *
* *

1. Cre te
form h vin num er of elements (Text oxes, R dio uttons,

Check oxes, nd so on). Write J v Script code to count the num er
of elements in form.

2. Cre te HTML form th t h s num er
of Text oxes. When the form
runs in the Browser fill the text oxes with d t . Write J v Script
codeth t verifies
th t ll text oxes h s een filled. If
textoxes h s een left empty, popup n lert indic tin which
text ox h s een left empty.
3. Develop HTML Form, which ccepts ny M them tic l expression.

Write J v Script code to Ev lu tes the expression nd Displ ys the
result.
4. Cre te p e with dyn mic effects. Write the code to include
l yers nd sic nim tion.

5. Write J v Script code to find the sum of N n tur l Num ers. (Use
user-defined function)
6. Write J v Script code to find f ctori l of N. (Use recursive

function)

7. Write J v Script code lock usin rr ys nd ener te the
current d te in words, this should include the d y, month nd ye r.
8. Cre te form for Student inform tion. Write J v Script code to
find Tot l, Aver e, Result nd Gr de.
9. Cre te form for Employee inform tion. Write J v Script code to
find DA, HRA, PF, TAX, Gross p y, Deduction nd Net p y.
10. Cre te form consists of two Multiple choice lists nd one
sin le choice list,
* The first
multiple choice list, displ ys the M jor dishes
v il le.
* The second
multiple choice list, displ ys the St rters
v il le.
* The sin le choice list, displ ys the Soft drinks v il le.

The selected items from ll the lists should e c ptured nd displ yed
in Text
Are lon with their respective costs. On clickin the ‘Tot l
Cost’ utton, the tot l cost of ll the selected items is c lcul ted nd
displ yed t the end in the Text Are . A ‘Cle r’ utton is provided to
cle r the Text Are .

11. Write J v Script code lock, which checks the contents entered
in form’s Text element. If the text entered is in the lower
c se, convert to upper c se. M ke use of function to Upperc se ( ).

12. Cre te we p e usin two im e files, which switch etween one
nother s the mouse pointer moves over the im es. Use the
onMouseOver nd onMouseOut eventh ndlers.
* *
*BCA605**P**–PROJECT*
*ANNEXURE-I*
vÀÄ ÀÄPÀÆ ÀÄ « Àé«zÁå®AiÀÄzÀ ©.¹.J ¥ÀzÀ«UÉ PÀ£ÀßÀ ¨sÁµÁ ¥ÀoÀå «µÀAiÀÄ:
©.¹.J I, II, III ÀÄvÀÄÛ IV£ÉÃ ¸É«Ä¸ÀÖ ï UÀ½UÉ PÀ£ÀßÀ ¨sÁµÁ ¥ÀoÀå 2009
-2010 £ÉÃ ¸Á°UÉ ÉÆzÀ® ¸É«Ä¸ÀÖ ïUÉ:
PÁ Àå ZÉÊvÀæ-1 ¸ÀA¥ÁzÀPÀ ÀÄ: ¥ÉÆæ.©. ÀÄAeÉÃUËÀ, vÀÄ ÀÄPÀÆ ÀÄ «.«,

vÀÄ ÀÄPÀÆ ÀÄ.
©.J¸ï.¹, ©.¹.J ÀÄvÀÄÛ «eÁÕ£À ¤PÁAiÀÄUÀ½UÉ J ÀÀ£ÉÃ ¸É«Ä¸ÀÖ ï, ÀÄÆ À£ÉÃ

¸É«Ä¸ÀÖ ï ÀÄvÀÄÛ £Á®Ì£ÉÃ ¸É«Ä¸ÀÖ ï UÀ½UÉ PÀ£ÀßÀ ¨sÁµÁ ¥ÀoÀå À£ÀÄß
ÀÄÄAzÉ w½¸À‾ÁUÀÄ ÀÅzÀÄ.
[Á||J¸ï.UÀÄ ÀÄ¥ÀæPÁ ï]
¸ÀzÀ¸Àå ÀÄ, ©.M.J¸ï
32
p e (if you h ve permission)

Edit this
<Doc?t =edit&dr=true&id=dctc
tt_5dz6n7hfr> |
Goo le Docs -- We word processin , present tions nd spre dsheets. </>

Bca Syllabus

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Bca Syllabus

Uploaded by

Copyright:

Available Formats

*Regulations, Scheme of Study and Examination for B.C.A.

*R 1. *a)* *Title of the course: Bachelor of Computer Applications

*R 3.* Attendance: As per Bangalore Universityregulations in force

*R 9.* Results: Results of candidate shall be declared and the classes

procedure followed by the University for B.Sc. courses.

Programming Concepts Using C

OOPS Using C++

Data Base Management Systems

Data Structures Using C

Data communications and Networks

Banking and insurance

Soft Skills & Personality Development Lab

Design & Analysis of Algorithms

demonstration of the project carries 50% of marks and

1. V.Rajaraman.: “Fundamentals of Computers”, PHI (EEE) (1999)

*BCA105P - **PRACTICALS IN C PROGRAMMING*

*BCA202 **T**– ENGLISH*

*4**. Differential **C**alculus*

*6**. Analytical Geometry *

*9.** **Stre ms : *The Stre m cl ss Hier rchy, Stre m

*BCA204P - **PRACTICALS IN C**++**PROGRAMMING*

*BCA205P - **PRACTICALS IN **DBMS*

*THEORY AND PRACTICAL EXAMINATIONS*

*Text Book** for BCA M them tics p per *:

1.Grew l, B.S, Hi her en ineerin M them tin s, L testEdition

*Reference Books* *for BCA M them tics p per*:

1. S stry S.S. En ineerin M them tics,2000

*Reference Books* *for BCA Electronics p per*:

1. Thom s C. B rtee, Di it l fund ment ls

*Tot l: 52 Hrs*

*( 10 Hrs)* *St ck – *Definition, Arr y

2. Roots of eu tions-loc tin roots of f(x)=0 Bisection method nd

3. Interpol tion nd numeric l differenti tion-polynomi l

4. Numeric l inte r tion-Tr pezoid l, Simpson’s nd d ptive Simpson

VII. Line r pro r mmin -first Prim l form, Gr phic l solution

1. Write pro r m to find the roots of n eu tion f (x) = 0 usin

*BCA403**T**– ENVIRONMENTAL STUDIES*

*BCA404T**– DATA COMMUNICATION AND NETWORKS*

*2. L yered Architecture &Applic tions

*4. Peer-To-Peer Protocols **

nd connectionless service models, Fe tures of

*5. Medium Access Control Protocols

*6**. Loc l Are

1. Dou l s E Comer. “Networks nd Internet with Internet

2. *Unix File System*

4. *Second ry Stor e M n ement*

5. *Speci l Tools nd Utilities*

7. *Unix System Communic tion*

8. *System Administr tion*

Write Shell pro r ms for the followin :

2. To find whether the iven ye r is le p ye r or not

12. P yroll system

*BCA502**T**– COMPUTER ARCHITECTURE*

INTEGRATED CIRCUITS AND DIGITAL FUNCTIONS: Di it l inter ted circuits,

DATA REPRESENTATION : D t types, fixed-point

BASIC COMPUTER ORGANIZATION AND DESIGN: Instruction codes, computer

INPUT-OUTPUT ORGANIZATION: Peripher l devices, synchronous d t

*Tot l: 52 Hrs*

UNIT V: Growth nd development of insur nce – present d y

*BCA504**T**– **JAVA **PROGRAMMING*

2. *Introduction to JAVA: *JAVA Evolution: J v History, J v Fe tures,

*_The self concept_*: Wh t is ttitude? The process of ttitude

*_Person l pl nnin nd success ttitude_*: Prioritizin , cre tin the

R 1. a)* *Title of the course: Bachelor of Computer Applications

R 3. Attendance: As per Bangalore Universityregulations in force

R 9. Results: Results of candidate shall be declared and the classes

BCA202 T– ENGLISH

*4. Differential C**alculus*

9. Stre ms : The Stre m cl ss Hier rchy, Stre m

*BCA204P - PRACTICALS IN C++**PROGRAMMING*

BCA205P - PRACTICALS IN DBMS

THEORY AND PRACTICAL EXAMINATIONS

Reference Books for BCA M them tics p per:

Reference Books for BCA Electronics p per:

Tot l: 52 Hrs

( 10 Hrs) St ck – Definition, Arr y

BCA403T– ENVIRONMENTAL STUDIES

2. Unix File System

4. Second ry Stor e M n ement

5. Speci l Tools nd Utilities

7. Unix System Communic tion

8. System Administr tion

BCA502T– COMPUTER ARCHITECTURE

Tot l: 52 Hrs

BCA504T– JAVA PROGRAMMING

2. Introduction to JAVA: JAVA Evolution: J v History, J v Fe tures,

_The self concept_: Wh t is ttitude? The process of ttitude

_Person l pl nnin nd success ttitude_: Prioritizin , cre tin the

_Le dership s process :_co-ordin tion while workin in te m,

1) Introduction:Definition of l orithm, Ch r cteristic of l orithm,

4. Dyn mic Pro r mmin : Introduction to Gr phs, Definition types,

BCA602T– SYSTEMS PROGRAMMING

Tot l: 52 Hrs

3. Two_dimension l Tr nsform tion_:_

4.Windowin nd Clippin :

5.Three Dimension l Gr phics:

7.Gr phic l Input Techniues:

8.Gr phic l Input Devices:

vÀÄ ÀÄPÀÆ ÀÄ « Àé«zÁå®AiÀÄzÀ ©.¹.J ¥ÀzÀ«UÉ PÀ£ÀßÀ ¨sÁµÁ ¥ÀoÀå «µÀAiÀÄ: