SEMESTER – 2

2BCA1 MATHEMATICS-1
(ADVANCED CALCULAS AND MATRICES)
UNIT – I
Definition of a function as a between sets, Definition of a real valued function of a variable.

Graphical representation of a map function as a curve in 2-dimention. Equation of a straight line and of a

curve. Tangent to a curve. Equation of tangent to a curve. Representation of & real numbers on a

computer on a computer. Graphical representation of a function on a computer screen.

UNIT – II
Derivative as tangent to a curve. Continuity and differentiability. Definition of a limit, and

derivative as a limit, Derivate as a linear map. Derivatives of products and composites; Leibniz rule and

chain rule, Application to maxima and minima. Second derivative, and its use for testing extrema.

Applications to root finding.

UNIT – III
Integral as anti- derivates. Relation to integral as area under a curve. Integral as a limit,

Integration by parts. Change of variables formula. Elementary techniques of numerical quadrate.

UNIT – IV
Higher derivatives. Statement of Taylor’s theorem in one variable. Euler-Maclaurin expansion

and its application to numerical computing. Difficulties in numerical computation of derivatives as limits.

UNIT-V
Ordinary differential equations. Statement of Peano’s existence theorem. Calculation of

numerical solution by Euler’s method . Basics of Range-Kutta methods.

UNIT-VI
Matrix algebra: addition and multiplication of matrices. Inverse of a non-singular matrix.

Determinant of a matrix. Testing no singularity using determinants. Solution of system of linear

equations using matrices and determinants.

(Numerical methods)
UNIT-1
Representation of numbers on a computer. Differences between floating point and real arithmetic.

Different types of errors and their estimates.

UNIT – II
Representation of a function on a computer, Discrimination, Table look-up interpolation. Function

evaluation, Numerical differentiation. Numerical Quadrature.

UNIT – III
Root finding and numerical maxima and minima. Solution of nonlinear equation. Conjugate gradient

method.

UNIT – IV
Solution of linear equations. Gaussian elimination, iterative methods, Eigen value problems.

UNIT-V
Integration of ordinary differential equations. Picard’s method of successive approximation. Euler’s

method, Range Kutta methods, Predicator-Corrector method.

UNIT-VI
Introduction to integration of partial differential equations.

UNIT-VII
Introduction to integration of stochastic differential equations.

TEXTS AND REFERENCE BOOKS: -

S.S SASTRI,”ENGINEERING MATHEMATICS”, Prentice Hall of India

S.S SASTRI,”Numerical Methods(volume 2)”, Prentice Hall of India

2BCA2-DATA STRUCTURE
UNIT – I
The concept of data structure. Abstract data structure. Analysis of Algorithm. The concept of list

introduction to stack & Primitive operation on stack. Stack as an abstract data type. Multiple stack,

Stacks application; Infix, post fix, Prefix and Recursion, Introduction to queues. Primitives operation on

the Queues, Queues as an abstract data type, Circular queues, Require. Priority queue. Application of

queue.

UNIT-II
Introduction to the linked list of stacks, Basic operation on linked list, stacks and queues as a circular

linked list, Header nodes, Doubly linked List, Circular Linked List, stacks & Queues as a Circular Linked

List. Application of Linked List.

.
UNIT-III
TREES- Basic Terminology, Binary Trees Representation as Array & Linked List, Basic operation on

Binary tree, Traversal of binary Trees: - In order, Preorder & post order, Application of Binary tree,

Threaded binary tree, B-tree & Height balanced tree, B & B* trees, 2 – 3 trees, Binary tree
representation of trees, Counting binary trees.

UNIT-IV
Sequential searching, Binary search, Insertion sort, Selection sort, Quick Sort Bubble sort, Heap sort,

Comparison of sorting methods.

Unit-v
Hash Table, Collision resolution Techniques to graphs, definition, Terminology, Directed, Undirected &

Weighted graph, Representation of graphs, Graph Traversal-Depth first & Breadth first search, Spanning

Trees, m minimum spanning Tree, shortest path algorithm.

TEXT & REFERENCE BOOKS

FUNDAMENTALS OF DATA STRUCTURE, By S. Sawhney & E. Horowitz

DATA STRUCTURE : By Trembley & Sorrenson

DATA STRUCTURE :By lipschuists (Schnum’s Outline Series Hill Publication)

FUNDAMENTALS OF COMPUTER ALGORITHM : By Ellis Horowitz and sartaj sawhney

2BCA3-OBJECT ORIENTED PROGRAMING WITH C+ +

UNIT-I
Overview of C+ +: Object oriented programming, Introducing C+ + classes, Concepts of object oriented

programming. Classes & Object: Classes, Structure & classes, Union & Classes, Friend classes, inline

function. Scope resolution operator, static class members: static data member, static member function,

Passing objects to function, Returning objects, Objects assignment.

UNIT-II
Array, Pointers references & the Dynamic Allocation operators : Array of objects, Pointers to object,

type checking C + + pointers, the This pointer, Pointer to derived types, pointer to class members,

References : References parameter, Passing references to objects, Returning reference, Independent

reference, C + +’s dynamic allocation operators, Initializing allocated memory, allocating Array,

Allocating objects, Constructor & Destructor.

UNIT-III
Function & operator overloading : Function overloading, Overloading constructor function finding the

address of an overloaded function, Operator Overloading; Creating Prefix & Postfix forms of the

increment & decrement operation , Overloading the shorthand operation (i.e. +=,-= etc). Operator

overloading restriction, Operator overloading using friend function, Overloading New & Delete,

Overloading some special operators, Overloading []. (), - , comma operator, Overloading<<.

UNIT-IV
Inheritance :Base class Access control, Inheritance & protected members, Protected base class

inheritance, Virtual base classes, Virtual function & Polymorphism : Virtual function. Pure Virtual

functions. Early vs. late binding.

UNIT-V
The C + + I/O system basics: C + + streams classes: C + + predefined streams, Formatted I/O: Formatting

using the ios members. Setting the format flags. Clearing format flags. An overloaded form of setf (),

Examining the formatted flags. Setting all flags. Using width Precision () and fill(), Using manipulating to

format I/o, Creation your own manipulators.

TEXT & REFERENCE BOOKS :

Rohit khurana, “Object Oriented Programming with C + +”,Vikas publishing House, New Delhi.

E. Balguruswamy, “C + +”, TMH publication

IBCA4 – COMPUTER PRACTICALS:
UNIT-I
Data Structure Implementation in C Language

UNIT-II
Object Oriented Programming With C + +