Mathematics

Download as pdf or txt
Download as pdf or txt
You are on page 1of 44

-\*

RANCHI UNIVERSITY

\- RANCHI

! uNDER GRADUATE MATHEMATTCS (HONS.)/ GENERAL

SYTLABUS W.E. F. 2OL6-L7

(UNDER CHOTCE BASED CREDTT SYSTEM)

-tS'
v

UNIVERSITY DEPARTMENT OF MATHEMATICS

RANCHI UNIVERSITY

RANCHI

\-,.
Course Structure

SEM€sTER I

Y Theory - 4 Credits
Core Course 1
Analytic Geometry 2D, Higher
UCCMATH 101 Assignment - 1 Credit
Algebra & Trigonometry
Tutorial - 1 Credit
Theory - 4 Credits
Core Course 2 UCCMATH 102
Differential Calculus & Vector
Assignment - 1 Credit
Calculus
Tutorial - 1 Credit
Environmental
Ability Enhancement
UAECC 101 5cience/(English/M L/Regional
Compulsory Course 1
I Theory - 2 Credit
Languages Commu nication)
Theory - 4 Credits
Generic Elective 1 UGEMATH 101
Differential Calculus & coordinate Assignment - 1 Credit
Geometry 2D Tutorial - 1 Credit

SEMESTER II

Theory - 4 Credits
Core Course 3 UCCMATH 203
Assignment - 1 Credit
Analysis I
Tutorial - I Credit

Theory - 4 Credits
lntegral Calculus & Analytic
v Core Course 4 UCCMATH 204
Geometry 3D
Assignment - 1 Credit
Tutorial - 1 Credit

Environmental
AbilityEnhancement
UAECC 202 Science/(English/M lLlRegional
Compulsory Course 2 Theory - 2 Credits
Languages Communication)
Theory - 4 Credits
lntegral Calculus, Vector Calculus & Assignment - 1 Credit
Generic Elective 2 U GEMATH 2O2
Trigonometry Tutorial - 1 Credit

SEMESTER IIi
Theory - 4 Credits
Core Course 5 UCCMATH 305 Theory of Real Functions
Assignment - 1 Credit
Tutorial - 1 €redit
Core Course 6
Theory - 4 Credits
UCCMATH 305 Group Theory & Matrices
Assignment - 1 Credit
Tutorial - 1 Credit
Theory - 4 Credits
Core Course 7 UCCMATH 307 Differential Equations
Assignment - 1 Credit
I Tutorial - 1 Credit
Skill Enhancement Theory - 1 Credits
USECMATH 301 Logic and Sets
Course L Assignmentfiutorial - 1

Credit
Generic Elective 3 UGEMATH 303 Theory - 4 Credits
Real Analysis l, Group Theory &
--) Assisnment - 1 Credit

t(a
II \
{" . ,r:i't
';1J3"
t-

Differential Equations Tutorial - 1 Credit

SEMESTER IV

Theory - 4 Credits
Core Course 8 UCCMATH 408 Analysis ll Assignment - 1 Credit
Tutorial - 1 Credit

Theory - 4 Credits
Core Course 9 UCCMATH 409 Mechanics I Assignment - 1 Credit
Tutorial - 1 Credit

Theory - 4 Credits
Core Course 10 UCCMATH 410 Ring Theory Assignment - 1 Credit
Tutorial - 1 Credit

Skill Enhancement
Theory - 1 Credit

Course 2
USECMATH 402 Graph Theory Assignment/Tutorial - 1

Credit

Theory - 4 Credits
Real Analysis ll, Complex Variable,
Generic Elective 3 UGEMATH 404 Assignment - 1 Credit
Set Theory & Matrices
Tutorial - 1 Credit

w,

SEMESTER V

Core Course 11 UCCMATH 51]. Analysis lll {Metric Space & Theory - 4 Credits
Complex Analysis) Assignment - l Credit
Tutorial - 1 Credit

Core Course 12 UCCMATH 512 Linear Algebra Theory - 4 Credits


Assignment - I Credit
Tutorial - 1 Credit

Discipline Specific UDSEMATH 501 NumberTheory Or Portfolio Theory - 4 Credits


Elective 1 Optimization Or Analytic Assignment - 1 Credit
Geometry Tutorial - L Credit

Discipline Specific UDSEMATH 502 Probability & statistics Or Boolean Theory - 4 Credits
Elective 2 Algebra & Automata Theory Or Assignment - 1 Credit
Special Functions Tutorial - 1 Credit

SEMESTER VI

Core Course 13 UCCMAT 613 Mechanics ll Theory - 4 Credits


Assignment - 1 Credit
Tutorial - 1 Credit

Core Course 14 UCCMATH 614 Numerical Analysis Theory - 4 Credits


Assienment - 1 Credit

: ^-tA
II o !:.^),
Tutorial - 1 Credit

Linear Programming Or Theory Of Theory - 4 Credits


Discipline SPecific
Assignment - 1 Credit
Equations Or Bio - Mathematics
Tutorial - 1 Credit

Fluid Mechanics Or Mathematical Theory - 4 Credits


Assignment - 1 Credit
Modeling Or Differential GeometrY
Tutorial - 1 Credit

Semester wise distribution of credits and marks '

Max. Marks

urrrrv. arnrrn. Ivrro srvr

UCCMATH 101

UAECC 10L

UGEMATH 101/UGDSCMATH 101

MID SEM

UCCMATH 203

UCCMATH 204

UGEMATH2O2/ UGDSCMATH2O2

1r:i::idill

.\_
Semester lll

Max. Marks
Paper Code credits
UNIV. EXAM. MID SEM

UCCMATH 305 6 70 30

UCCMATH 306 6 70 30

UCCMATH 307 6 70 30

USECMATH 301 2 50

UGEMATH3O3/ UGDSCMATH3O3 6 L00

S emester V

Max. Marks
Paper Code credits
UNIV. EXAM. MID SEM

UCCMATH 408 6 70 30

UCCMATH 409 6 70 30

UCCMATH 410 5 70 30

USECMATH 402 2 50

UG EMATH4O4I UGDSCMATH O4 6 100

Semester V

Max. Marks
Paper Code credits
UNIV. EXAM. MID sEM

UCCMATH 511 6 70 30

UCCMATH 512 6 70 30

UDSEMATH 501 6 70 30

t{ \b
O
o>-
UDSEMATH 502 5 70 30

UGDSEMATH 501
6 100
(For General Students)

Semester Vl

Max. Marks
Paper Code credits
UNIV. EXAM. MID SEM

UCCMATH 613 6 70 30

UCCMATH 614 6 70 30

UDSEMATH 603 6 70 30

UDSEMATH 604 6 70 30

UGDSEMATH602 {For General


6 L00
Students)

Note: For Core or Discipline Specific Courses having practical the breaks up of
marks will be as follows:

Univ. Exam - 50, Practical (Univ.Examl - 25, and Mid Sem. Exam - 25.
Paper Code: UCCMATH 101

Analytic Geometry 2D, Higher Algebra &Trigonometry

Credits: 6, Full Marks: 70, Time: 3 Hours

Nine questions will be set. Candidates will be required to answer 5 questions. Question 1
will be compulsory, consisting of 10 short answer type questions covering entire syllabus
uniformly. Candidates will be required to answer any 7 out of these 10 questions; each
question will be of 2 marks. Out of the remaining 8 questions, candidates will be required to
answer any 4 questions selecting at least one from each group. Questions may contain two
parts of equal marks.

UNIT I - ANALYTICAL GEOMETRY OF 2D

Change of rectangular axes.


Conditions for the general equation of second degree to
represent parabola, ellipse, hyperbola and reduction into standard forms, Equations of
tangent and normal (Using Calculus). (2 Questions)

Equations of Chord of contact, Pole and Polar, Pair of tangents, in reference to general
equation of conic. Axes, centre, director circle, in reference to general equation of conic.
Polar equation of conic.
(2 Questions)

UNIT II - HIGHER ALGEBRA & TRIGONOMETRY


Statement and proof of binomial theorem for any index, exponential and logarithmic
series.
De Moivre's theorem and its applications. (l Questions)

Trigonometric and Exponential functions of complex argument and hyperbolic functions.


Summation of Trigonometrical series.
Factorisation of sin 0 , cos9. ' (3 Questions)

Books Recommended:

1". Analytical Geometry & Vector Analysis - B. K. Kar, Books & Allied Co., Kolkata
2. dnalytical Geometry of two dimension - Askwith
3. Coordinate Geometry - S L LoneY.

4. Trigonometry - Das and Mukherjee


5. Trigonometry - Dasgupta
8

Paper Code: UCCMATH 102

Differential Calculus and Vector Calculus


Credits: 6, Full Marks: 70, Time: 3 Hours

Nrne questions will be set. Candidates will be required to answer 5 questions. Question 1
will be compulsory, consiiting of 10 short answer type questions covering entire syllabus
uniformly. Candidates will be required to answer any 7 out of these 10 questions; each
question will be of 2 meks. Out of the remaining 8 questions, candidates will be required to
answer any 4 questions selecting at least one from each group. Question may contain two
parts of equal marks.

UNIT I . DIFFERENTIAL CALCULUS

Successive differentiation, Leibnitz's theorem. Maclaurin and Taylor series expansions.


Partial differentiation, Euler's theorem for functions of two variables, Total differential,
Jacobian. (2 Questions)

Tangent and normal, curvature. Asymptotes. Maxima and Minima of functions of two
variables, Lagrange's multipliers. (2 euestions)

UNIT II - VECTOR CALCULUS

Product of three and four vectors, work done, moment of a vector about a point and a line.

(2 Questions)

Scalar and vector point functions, differentiation of a vector function of scalar variables.
Gradient, Divergence and Curl, second order operators in Cartesian coordinate system.

(2 Questions)

Books Recommended :

L. Calculus - G B Thomas & R L Finney.


2. Differential Calculus - Das & Mukherjee.
3. Vector Calculus - Dasgupta.
4. Vector Calculus - Shanti Narayan

I
Paper Code: UCCMATH 203

Analysis I

Credits: 6, Full Marks: 70, Time: 3 Hours

Nine questions will be set. Candidates will be required to answer 5 questions. Question 1
will be compulsory, consisting of 10 short answer type questions covering entire syllabus
uniformly. Candidates will be required to answer any 7 out of these 10 questions; each
question will be of 2 marks. Out of the remaining 8 questions, candidates will be required to
answer any 4 questions selecting at least one from each group. Question may contain two
parts of equal marks.

UNIT I_ANALYSIS - I

Axioms of least upper bound and greatest lower bound in R. The completeness
property of R, Archimedean property, density of rational and irrational numbers in R.
Neighbourhoods and limit point of a set, open and closed sets, isolated points,
Bolzano - Weierstrass theorem for sets (Statement only). (2 Questions)-a

Sequences, bounded sequence, convergent sequence, monotonic sequence,


subsequence, cauchy sequence and cauchy's general principle of convergence.
(2 Questions)

lnfinite series, Convergence and divergence of infinite series of real numbers,


Pringsheim's theorem, comparison test, cauchy's root test, D'Alembert's ratio test,
Raabe's test, De-Morgan's and Bertrand's test, Gauss's ratio test, Cauchy's
condensation test, lntegral test, Alternating Series, Leibnitz test, Absolute and
conditional convergence. (4 Questions)

Books Recommended :

1. Elements of Real Analysis - Shanti Narayan & M D Raisinghania.


2. Higher Algebra - S Bernard & J M Child

o<'
=
.)-\ t.
''
r

v
t0

Paper Code: UCCMATH 204

lntegral Calculus and Analytic Geometry 3D

Credits: 6, Full Marks: 70, Time: 3 Hours

Nine questions will be set. Candidates will be required to answer 5 questions. Question 1
will be compulsory, consisting of L0 short answer type questions covering entire syllabus
uniformly. Candidates will be required to answer any 7 out of these 10 questions; each
question will be of 2 marks. Out of the remaining 8 questions, candidates will be required to
answer any 4 questions selecting at least one from each group. Question may contain two
parts of equal marks.

UNIT I - INTEGRAL CALCULUS

lntegration of rational and irrational functlons. (l Question)

Evaluation of definite integrals, Special integrals, differentiation and integration


under the sign of integration (Beta and Gamma functions are excluded), reduction
formulae. (2 Questions)

Point of inflexion, double point, curve tracing. Length of plane curye, area bounded
by plane curves. Volume and surface area of solid of revolution.

(2 Questions)

UNIT I_ ANALYTICAL GEOMETRY 3D

Rectangular, spherical-polar and cylindrical co-ordinates, direction cosines.


(l Question)

Angle between two straight lines, equation of planes and straight lines, shortest
distance between two lines. (l Question)

Sphere. (l Question)

Books Recommended :

L. Calculus - G B Thomas & R L Finney.


2. lntegral Calculus - Das & Mukherjee.
3. lrntegral Calculus - Lalji Prasad.
4. Coordinate Geometry of 3D - J T Bell
5. Analytical Geometry of 3D - Lalji Prasad.
-
-^n}i
- fa u)'
ttgQs' o-." L) ol-

$PseB"'
il

Paper Code: UCCMATH 305

Theory of Real Functions

Credits: 6, Full Marks: 70, Time: 3 Hours

questions. Question 1
Nine questions will be set. Candidates will be required to answer 5
will be compulsory, consisting of 10 short answer type questions covering entire syllabus
questions; each
uniformly. candidates will be required to answer any 7 out of these 10
question will be of 2 marks. Out of the remaining 8 questions, candidates will be required
to
answer any 4 questions selecting at least one from each group' Question may
contain two
parts of equal marks.

UNIT I

Limit of functions: Limit, algebra of limit of functions. Continuity and discontinuities,


algebra

of continuous functions. lntermediate value theorem, location of roots theorem,


preservation of intervals theorem. Uniform continuity, functions of bounded variations.
(2 Questions) ,

and
Derivability: Derivability, relationship with continuity, Rolle's theorem, Lagrange's
Cauchy Mean value theorem, Taylor's theorem, Maclaurin's theorem, remainder
after n

terms, series expansion of (l +x)",sinx,cosI,e",logx. using suitable remainder


Power
(2 Questions)
after n terms.

UNIT II

Riemann lntegration: Definition, Darboux theorem I and ll, integrability conditions.


Particular classes of bounded integrable functions, Primitive, Fundamental theorem,
First

and Second Mean value theorems.


. (4 Questions)

Books Recommended:

L. lntroduction to Real Analysis- R Bartle & D R Sherbert


2. Elements of RealAnalysis- shanti Narayan & M D Raisinghania.

-.**"-8?':'
r\e{
,- ---. . u.-,'"'"
'...;
{+".
t2

Paper Code: UCCMATH 306


' Group Theory & Matrices

Credits: 6, Full Marks: 70, Time: 3 Hours

Nine questions will be set. Candidates will be required to answer 5 questions. Question 1
will be compulsory, consisting of 10 short answer type questions covering entire syllabus
uniformly. Candidates will be required to answer any 7 out of these 10 questions; each
question will be of 2 marks. Out of the remaining 8 questions, candidates will be required to
answer any 4 questions selecting at least one from each group. Question may contain two
parts of equal marks.

UNITI-GROUPTHEORY

Groups: Definitions, Preliminary results, equivalent definitions, Subgroups, Cyclic Group and
its subgroups, Cosets of a subgroup in a group, Lagrange's Theorem and it's applications.
(2 Questions)

Normal subgroups, Quotient group, Homomorphism, Fundamental theorem of ,


homomorphism.
(l Question)
Permutations, Permutation group, Symmetric and Alternating groups. Caylay's Theorem.
(l Question)
UNIT II - MATRICES
Different types of Matrices, Algebra of Matrices, Adjoint and inverse of a Matrix, different
ways of finding inverses.
(l Question)
Elementary row and column operations. Elementary matrices, equivalent matrices, Rank of
a matrix, lnvariance of rank through elemeltary row/column operations, rank of sum and
product of matrices and related theorems.
(2 Questions)
Solution of a system of linear equations via matrix methods, Consistency, lnconsistency
conditions.
(l Question)

Books Recommended:

1. John B. Fraleigh, A First Course in Abstroct Algebra, Tth Ed., Pearson, 2002.
2. Joseph A. Gallian, Contemporary Abstract Algebra,4th Ed., Narosa Publishing House, New
Delhit, 1999.
3. Topics in Algebra : I N Herstein.
4. Basic Abstract Algebra: P B Bhattacharya, Cambridge Univ. Press.
5. Matrices - Shanti Narayan.
6. Matrices - A R Vashishtha.
l3

Paper Code: UCCMATH 307


Differential Equations
Credits:6, Full Marks: 70, Time: 3 Hours

Nrne questions will be set. Candidates will be required to answer 5 questions. Question 1
will be compulsory, consisting of 10 short answer type questions covering entire syllabus
questions; each
uniformly. candidates will be required to answer any 7 out of these 10
question will be of 2 marks. Out of the remaining 8 questions, candidates will be required
to
answer any 4 questions selecting at least one from each group. Questions may
contain two
parts of equal marks.

UNIT I

Differential equation of first order but not of first degree, clairaut's form, singular solutions.
Differential equations with constant coefficients'
(l Question)
problems.
Orthogonal trajectories and its simple application in geometrical and mechanical
(t Question)

Solutions of Linear differential equations of higher order with constant coefficients'


Differential equations with variable coefficients.
(2 Questions)

UNIT II
parameter and
Linear differential equations of second order by method of variation of
bY

change of indePendent variable-


(l Question)
Total differential equation in three independent variables.
(l Question)
Partial differential equations: Lagrange's linear partial differential equations,
CharPit's

method. ' (2 Questions)

Books Recommended

1. Differential Equations - M D Raisinghania'


a"

\-
t4

Paper Code: USECMATH 301

TOGIC AND SETS

Credits: 2, Full Marks: 50, Time: l{ Hours

Five questions will be set. Candidates will be required to answer 3 questions. Question 1 will
be compulsory, consisting of 6 short answer type questions covering entire syllabus
uniformly. Candidates will be required to answer any 5 out of these 6 questions; each
question will be of 2 marks. Out of the remaining 4 questions, candidates will be required to
answer any 2 questions selecting at least one from each group. Questions may contain two
parts of equal marks.

UNIT I

Statements, truth value of a statement, truth tables, negation, conjunction and disjunction.
Conditional and Biconditionalstatements.Converse, inverse and contrapositive
propositions.Tautologies and contradictions.Equivalent statements and law of duality.
(2 Questions)

UNIT II

Sets, subsets, Set operations and the laws of set theory and Venn diagrams.Examples of
finite and infinite sets.Finite sets and counting principle. Empty set, properties of empty set.
Power set of a set. (2 Questions)

Books Recommended:

l-. Discrete Mathematics - M K Gupta


15

Paper Code: UCCMATH 408


Analysis ll

Credits: 6, Full Marks: 70, Time: 3 Hours

Nine questions will be set. candidates will be required


to answer 5 questions' Question 1
questions covering entire syllabus
will be compulsory, consisting of 10 short answer type
uniformly. candidate will be required to answer any
7 out of these 10 questions; each
questions, candidates will be required to
question will be of 2 marks. out of the remaining 8
answer any 4 questions selecting at least one
from each group' Question may contain two
parts of equal marks.

UNIT I

Convergence of improper integrals, comparison


tests, absolute convergence, Abel's and
(l Question)
Dirichlet's tests.

of & Gamma functions and their


Frullani's lntegrals Definition & convergence
Beta
(l Question)
properties, duplication formula, inter-relation'

of Dirichlet's form, Liouville's


Evaluationofdoubleandtripleintegrals.Multiplelntegrals
(2 Questions)
extension.

of variables' (l Question)
Change of order of integration and change

UNIT II
volume integral, Green's theorem in R2'
Vector integration: Line integral, surface integral,
Stoke 's theorem, Gauss Divergence theorem'
(3 Questions)

Books Recommended :
1. Higher Engineering Mathematics - B S
Grewal
2. Elements of Real Analysis - Shanti Narayan
& M D Raisinghania'
3. Mathematical Analysis-J N Sharma &ARVashishtha'

O< ,\Jo
a-<' , -i.. ,,_-rrt
-
tl . \{ -C4
--' l :, -
,:ri;'"
t'bo** 'UL'"t
,-. ^s1'-i;
rr' !
t.

t6
\J

Paper Code: UCCMATH 409

Mechanics I

Credits: 6, Full Marks: 70, Time: 3 Hours

Nine questions will be set. Candidates will be required to answer 5 questions. Question 1
will be compulsory, consisting of 10 short answer type questions covering entire syllabus
uniformly. Candidates will be required to answdr any 7 out of these 10 questions; each
question will be of 2 marks. Out of the remaining 8 questions, candidates will be required to
answer any 4 questions selecting at least one from each group. Questions may contain two
parts of equal marks.

UNIT I - STATICS

Reduction of system of coplanar forces, equation of resultant, condition for equilibrium.


Astatic centre.
Laws, angles and cone of friction, equilibrium on a rough inclined plane, particle constrained
to move on a rough curve under any given forces. (4 Questions)

UNIT II - DYNAMICS

Kinematics in two dimension: Tangential, normal, radial, transverse velocities and


acceleration. Angular velocity and acceleration. Rectilinear motion and simple pendulum.
S.H.M., compounding of two S.H.M. Repulsive motion. Motion under inverse square law.
Rectilinear Motion (Kinetics): Newton's law, Work, K.E., work energy principle, lmpulse,
Torque and angular momentum, conservation of energy, momentum and angular
momentum, Hooke's law, extension of an elastic string: Horizontal & vertical case.
(4 Questions)

Books Recommended:
l.Statics-SLLoney
2.Dynamics-SLLoney
3. Mechanics -Singh & Sen, Bharti Bhawan Publications.
l7

Paper Code: UCCMATH 410


Ring Theory

Credits: 6, Full Marks: 70, Time: 3 Hours

Nlne questions will be set. Candidates will be required to answer 5 questions.


euestion 1
will be compulsory, consisting of 10 short answer type questions covering entire syllabus
uniformly. Candidates will be required to answer any 7 out of these 10 questions; each
question will be of 2 marks. Out of the remaining 8 questions, candidates will be required to
answer any 4 questions selecting at least one from each group. Questions may contain two
parts of equal marks.

UNIT I

Ring: Definition and examples, commutative ring, ring with unity, unit in a ring, Matrix ring,
Boolean ring, Ring of continuous functions. Direct product of rings, properties of rings,
subrings. (l question)
Nilpotent element, idempotent element , zero divisors, integral domain, division ring and
field. Characteristic of a ring. (1 euestion)
ldeal, ideal generated by a subset of a ring, simple ring, factor rings, operations on ideals,
prime and maximal ideals. (2 Questions)
Ring homomorphisms, properties of ring homomorphisms, lsomorphism theorems l, ll and
lll, field of quotients. (l Question)

UNIT II

Polynomial rings over commutative rings, division algorithm and consequences, principal
ideal domains, factorization of polynomials, reducibility tests, irreducibility tests,
Eisenstein's criterion. (3 Questions)

Books Recommended:

1.. John B- Fraleigh, A First course in Abstroct Algebra, Tth Ed., pearson, 2002.
2. Joseph A- Gallian, Contemporory Abstract Algebro,4th Ed., Narosa publishing House, New Delhi,
L999.
3. c Musili, lntroduction to Rings and Moduleg 2nd edition, Narosa publishing House.
4. Modern Algebra - I N Herstein
l8

Paper Code: USECMATH 402

GRAPH THEORY

Credits: 2,Full Marks: 50, Time: lI Hours

Five questions will be set. Candidates will be required to answer 3 questions. Question l will
be compulsory, consisting of 6 short answer type questions covering the entire syllabus
uniformly. Candidate will be required to answer any 5 out of these 5 questions; each
question will be of 2 marks. Out of the remaining 4 questions, candidates will be required to
answer any 2 questions selecting at least one from each group. Questions may contain two
parts of equal marks.

Unit-1

Definition, examples and basic properties of graphs, pseudo graphs, complete graphs, bi-
partite graphs, isomorphism of graphs, paths and circuits. (2 Questions)

Unit-2

Eulerian circuits, Hamiltonian cycles, the adjacency matrix, weighted graph, travelling
salesman's problem, shortest path, Dijkstra's algorithm. (2 Questions)

Books Recommended:

1. B.A. Davey and H.A. Priestley, lntroduction to Lattices and Order, Cambridge University
Press, Cambridge, 1990.

Edgar G. Goodaire and Michael M. Parmenter, Discrete Mathematics with Graph Theory,
2nd Edition, Pearson Education (singapore) P. Ltd., lndian Reprint 2003.

3. Discrete Mathematics - M K Gupta


u
l9

Paper Code: UCCMATH 511


Analysis - lll (Metric Space & Complex Analysis)
Credits: 5, Full Marks: 70, Time: 3 Hours

Nine questions will be set. Candidates will be required to answer 5 questions. Question 1
will be compulsory, consisting of 10 short answer type questions covering the entire syllabus
uniformly. Candidate will be required to answer any 7 out of these 10 questions; each
question will be of 2 marks. Out of the remaining 8 questions, candidates will be required to
answer any 4 questions selecting at least one from each group. Questions may contain two
parts of equal marks.

UNIT I- METRIC SPACE

Metric spaces: Definition and examples of metric spaces. Sequences in metric space, Cauchy
sequence, complete metric space. (l euestion)
Open and closed balls, neighborhood, open set, interior of a set. Limit point of a set, closed
set. (l Question)

Diameter of a set, Cantor's theorem. Subspaces, dense sets, perfect sets. Baire's Category
theorern. (1 euestion)

Continuous mappings, sequential criterion and characterizations of continuity by open sets,


Homeomorphism. (l Question)
UNIT II _ COMPLEX ANALYSIS

Complex numbers, continuity and differentiability of functions of complex variable. Analytic


function, Cauchy - Riemann differential equations in Cartesian and polar forms.
(2Questions)

Conformal representation , some general transformations, bilinear transformation. critical


points, fixed points, cross ratio, preservance of cross ratio, fixed points of bilinear
transformation.
(2 Questions)

Books Recommended:
l. lntroduction to Topology - G F Simmons.
2. Metric Spaces - P K Jain & Khalil Ahmad.
3. Complex variable - Churchil and Brown
I ,
20

Paper Code: UCCMATH 512


Linear Algebra
Credits: 6, Full Marks: 70, Time: 3 Hours

Nine questions will be set. candidates will be required to answer questions.


5 euestion 1
: will be compulsory, consisting of 10 short answer type questions covering
entire syllabus
uniformly- candidates will be required to answer any 7 out of these 10 questions;
each
question will be of 2 marks. out of the remaining 8 questions,
candidates wil be required to
answer any 4 questions selecting at least one from each group.
euestions may contain two
parts of equal marks.

UNIT I

Vector spaces, subspaces, algebra of subspaces, linear combination


of vectors, linear span, linear
dependence and linear independence, basis and dimension, co-ordinate
vector of a vector relative
to a basis. Complement of a subspace, direct sum and quotient space.
{2 Questions}
Linear transformations, null space, range, rank and nullity of linear
a transformation, sylvester,s law
of nullity- Matrix representation of a linear transformation, algebra of linear
transformations.
lsomorphism, isomorphism theorems, invertibility and isomorphism,
change of coordinate matrix.
(3 Queations)

UNIT II

Linear functional, dual spaces, dual basis, double dual, transpose


of a linear transformation and its
matrix in the dual basis' characteristic polynomial and characteristic
values of a linear operator,
diagonalizability, Cayley-Hamilton theorem and its applications.
(3 euestions)

Books Recommended:
L. LinearAlgebra - K Hoffman & R Kunze.
2. HigherAlgebra -S K Mapa.
3. Linear Algebra - A R Vashishtha.
os ...
.-
-..'r!"t
.lii
: ; l i'-
I

*rifi€$- rl ;'o'rr-i'
tl!+l)o* i.,, U;r' '
'uu*t'n'

l
2t

Paper Code: UDSEMATI{ 501A

NUMBER THEORY
Credits: 6, Full Marks: 70, Time: 3 Hours

Nrne questions will be set. Candidates will be required to answer 5 questions. euestion 1
will be compulsory, consisting of 10 short answer type questions covering entire syllabus
uniformly. Candidates will be required to answer any 7 out of these 10 questions; each
question will be. of 2 marks. Out of the remaining 8 questions, candidates will be required to
answer any 4 questions selecting at least one from each group. Questions may contain two
parts of equal marks.

UNIT I

Divisibility and primes, H.C.F., Euclid's Algorithm, unique factorization, perfect numbers.

(1 Question)

Residue class, complete and reduced residue system, congruences and their properties,
Fermat's theorem, Wilson's theorem. (1 euestion)

Arithmetical functions, Euler's and Mobius function, Mobius inversion formula.


(2 Questions)

Algebraic Congruence, solution by inspection, Solution of ax:6(modc), systern of linear


congruences, Chinese remainder theorem. (1 question)

UNIT II

The Diophantine equations : ax +by=", ,2 + y2 = 12.


Farey sequence, continued fractions, Pell's equation. (3 Questions)

Books Recommended:
1. NumberTheory- G H Hardy & E M Wright.
1. Number Theory- S G Telang.
2. Number Theory - Harikisan

OR

\, Paper Code: UDSEMATH 501 B

FINANCIAL MATHEMATICS
Credits: 6, Full Marks: 70, Time: 3 Hours
Nine questions will be set. Candidates will be required to answer 5 questions. Question 1
will be compulsory, consisting of 10 short answer type questions covering entire syllabus
uniformly. Candidates will be required to answer any 7 out of these 10 questions; each
question will be of 2 marks. Out of the remaining 8 questions, candidates will be required to
answer any 4 questions selecting at least one from each group. Questions may contain two
parts of equal marks.

Portfolio Optimization

Financial markets. Investment objectives. Measures of return and risk. Types of risks. Risk
free assets. Mutual funds. Portfolio of assets. Expected risk and return of portfolio.
(2 Questions)

Diversification. Mean-variance portfolio optimization- the Markowitz model and the two-
fund theorem, risk-free assets and one fund theorem, efficient frontier. Portfolios with short
sales. Capital market theory. (3 Questions)

Capital assets pricing model- the capital market line, beta of an asset, beta of a portfolio,
security market line. Index tracking optimization models. Portfolio performance evaluation
measures. (3 Questions)

Books Recommended:
l. F. K. Reilly, Keith C. Brown, Investment Analysis and Portftlio Management,l0thEd.,
South-Western Publishers, 201 l.
2. H.M. Markowitz, Mean-Variance Analysis in Portfolio Choice and Capital Markets,
[]lackwell, New York, 1987.
i. M.J. Best, Portfolio Optimization, Chapman
and Hall, CRC Press, 2010.
4. D.C. Luenberger,lnvestment Science,2nd Ed., Oxford University Press, 2013.

OR

Paper Code: UDSEMATH 501C


Credits: 6, Full Marks: 70, Time: 3 Hours

Nine questions will be set. Candidates will be required to answer 5 questions. Question 1
will be compulsory, consisting of 10 short answer type questions covering entire syllabus
uniformly. Candidates will be required to answer any 7 out of these 10 questions; each
t qudstion will be of 2 marks. Out of the remaining 8 questions, candidates will be required to
answer any 4 questions selecting at least one from each group. Questions may contain two
parts of equal marks.

Mechanics
j{-f, \a
--
,,<&t:'.'..,,-,*
-
^B*'-" !\cr"
goy-^;;l$ "
$ts*
23

UNIT I

Moment of a force about a point and an axis, couple and couple moment, Moment of a couple
about a line, resultant of a force system, distributed force system, free body diagram, free
body involving interior sections, generalequations of equilibrium, two point equivalent
loading, problems arising from structures, static indeterminacy. ( 2 euestions)

Laws of Coulomb friction, application to simple and complex surface contact friction
problems, transmission of power through belts, screw jack, wedge, first moment of an area
and the centroid, other centers, Theorem of Pappus-Guldinus, second moments and the
product of area of a plane are4 transfer theorems, relation betrveen second moments and
products of area, polar moment of area, principalaxes. (3 Questions)

LINIT II

Conservative force field, conservation for mechanical energy, work energy equation, kinetic
energy and work kinetic energy expression based on center of mass, moment of momentum
equation fora single parlicle and a system of particles, translation and rotation of rigid
bodies, Chasles' theorem. general relationship between time derivatives of a vector for
different references, relationship between velocities of a particle for different references,
acceleration of particle for different references. (3 Questions)

Books Recommended:
l. LH. Shames and G. Krishna Mohan Rao, Engineering Mechanics: Statics and Dynamics,
- (4tn Ed.), Dorling Kindersley (lndia) Pvt. LtJ. (Pearson Education), Derhi, z00g:
2. R.C. Hibbeler and Ashok Gupta, Engineering Mechanics: Statics and Dynamr'cs, I lth Ed.,
Dorling Kindersley (lndia) Pvt. Ltd. (Pearson Education), Delhi.

L.
24

Paper Code: UDSEMATH 502 A

PROBABI LITY AND STATISTICS

Credits: 6, Full Marks: 70, Time: 3 Hours

Nine questions will be set. Candidates will be required to answer 5 questions. euestion 1
will be compulsory, consisting of l-0 short answer type questions covering entire syllabus
uniformly. CandidateS will be required to answer any 7 out of these 10 questions; each
question will be of 2 marks. Out of the remaining 8 questions, candidates will be required to
answer any 4 questions selecting at least one from each group. Questions may contain two
parts of equal marks.

UNIT I

lntroduction to random variables (discrete and continuous), cumulative distribution


function(c.d.f.), probability mass/density functions, joint p.d.f., joint p.m.f., marginal and
conditional distributions, joint c.d.f. and its properties. (2 Questions)

Mathematical expectations, moments , moment generating function : limitations and


properties, characteristic function. (2 euestions)

UNIT II

Discrete distributions: uniform, binomial& Poisson. Continuous distributions: uniform and


normal' {2 Questions}
Properties of a Random sample: Basic concepts of Random sample, convergence in
probability, almost sure convergence, convergence in distribution. Order statistics and their
distributions. (2 Questions)

Books Recommended:

1. Robert V. Hogg, Joseph W. McKean and Allen T. Craig, lntroduction to Mathematical


Statistics,Pearson Education, Asia, 2007.
2. lrwin Miller and Marylees Miller, John E. Freund, Mathematical Statistics with
Applications, 7th Ed., Pearson Education, Asia, 2006.
3. Fundamentals of Mathematical statistics - s c Gupta & v K Kapoor.

OR

tapLr Code: UDSEMATH 502 B

Boolean Algebra and Automata Theory


Credits:6, Full Marks:70, Time: 3 Hours
25

Nine questions will be set. Candidates will be required to answer 5 questions. Question 1
will be compulsory, consisting of 10 short answer type questions covering entire syllabus
uniformly. Candidates will be required to answer any 7 out of these 10 questions; each
question will be of 2 marks. Out of the remaining 8 questions, candidates will be required to
answer any 4 questions selecting at least one from each group. Questions may contain two
parts of equal marks.

UNITI_BOOLEANALGEBRA

Definition, examples and basic properties of ordered sets, maps between ordered sets, duality
principle, lattices as ordered sets, lattices as algebraic structures, sublattices, products and
homomorphisms. (2 Questions)

Definition, examples and properties of rnodular and distributive lattices, Boolean algebras,
Boolean polynomials. minimal forms of Boolean polynomials, Quinn-McCluskey method,
Karnaugh diagrams, switching circuits and applications of switching circuits.
(2 Questions)

UNIT II AUTOMATA THEORY

Introduction: Alphabets, strings, and languages. Finite Automata and Regular Languages:
deterministic and non-deterministic finite automata, regular expressions, regular languages
and their relationship with finite automata, pumping lemma and closure properties of regular
languages. ( I Question)

Context Free Crammars and Pushdown Automata: Context free grammars (CFG), parse trees,
ambiguities in grammars and languages, pushdown automaton (PDA) and the language
accepted by PDA, deterministic PDA, Non- deterministic PDA, properties of context free
languages; normal forms, pumping lemma, closure properties, decision properties.
(l Question)
'l'uring Machines: Turing machine as a moddl of computation, programming with a Turing
machine, variants of Turing machine and their equivalence
Undecidability: Recursively enumerable and recursive languages, undecidable problems
about
Turing machines: halting problem, Post Correspondence Problem, and undecidability
problems about CFGs. (2 Questions)

Books Recommended
l. B A. Davey and H. A. Priestley, Introduction to Lattices and Order, Cambridge University
Press, Cambridge, 1990.
2. Edgar G. Coodaire and Michael M. Parmenter, Discrete Mathematics with Graph Theory,
(2nd Ed.), Pearson Education (Singapore) P.Ltd., lndian Reprint 2003.
3. Rudolf Lidl and G0nter Prlz, Applied Ab.stract Algebra,2nd Ed., Undergraduate Texts in
Mathematics, Springer (SIE), Indian reprint, 2004.
4. J. E. Hopcroft, R. Motwaniand J. D. Ullman, Introduction to Automata'Theory,
Languages, and Computation, Znd Ed., Addison-Wesley, 2001.
5. H.R. Lewis, C.H. Papadimitriou, C. Papadimitriou, Elements of the Theory of
Computation, 2nd Ed., Prentice-Hall, NJ, 1997.
6. J.A. Anderson, Automata Theory with Modern Applications, Cambridge University Press,
26

2006.

OR

Paper Code: UDSEMATH 502 C

SPECIAL FUNCTIONS

Credits: 6, Full Marks: 70, Time: 3 Hours

Nine questions will be set. Candidates will be required to answer 5 questions. Question 1
will be compulsory, consisting of 10 short answer type questions covering entire syllabus
uniformly. Candidates will be required to answer ariy 7 out of these 10 questions; each
question will be of 2 marks. Out of the remaining 8 questions, candidates will'be required to
answer any 4 questions selecting at least one from each group. Questions may contain two
parts of egual marks.

UNIT I

Series Solution: Ordinary point, singular point(regular), general methods and forms
of series solution (lndicial equation -
Frobenius method) [ N.B.: Results of analysis
regarding validity of series solution are taken to be grantedl. (1 Question)

Bessel's equation: Solution, recurrence formula for Jr(x), Generating function for

J,(x), equations reducible to Bessel's equation, Orthogonality of Bessel's function.


(2 Questions)

UNIT II

Legendre's equation: Solution, Rodrigue's formula, Legendre's polynomials,


generating function for P,(x), orthogonality of Legendre's polynomials.
(zQuestions)

Hypergeometric Functions: Special cases, integral representation, summation


theorem. (l Question)

Laplace Transform: Definition, Laplace Transform of elementary functions,


properties, uniqueness and inverse Laplace Transform, Laplace Transform of
derivatives and integrals. (l Question)
Multiplication by /', division by t. Convolution theorem, Application of Laplace
transform to differential equations. (l Question)

Books Recommended :

ffi.,,n . Ci t'l. . ,
-f,
r"<r.j"
,,,Ji..-,
11e9srll'- \- ""
"-u-,"-
-

S'a""--
27

1,.Advance differential equations - M D Raisinghania'


2. Differential Equations -J N Sharma

;l:
28

Paper Code: UCCMATH 513

Mechanics ll

Credits: 6, Full Marks: 70, Time: 3 Hours

Nine questions will be set. Candidates will be required to answer 5 questions. Question 1
will be compulsory, consisting of 10 short answer type questions covering entire syllabus
uniformly. Candidates will be required to answer any 7 out of these 10 questions; each
question will be of 2 marks. Out of the remaining 8 questions, candidates will be required to
answer any 4 questions selecting at least one from each group. Questions may contain two
parts of equal marks.

UNIT I . STATICS

Condition of equilibrium of forces in three dimension. Central axis, Wrench, Pitch, Null lines.
(l Question)

Principle of virtual work and its application in two dimensionalcases. (1 Question)

Common Catenary (l Question)

Stable equilibrium, energy test of stability (problems involving one variable only).
(1" Question)

UNIT II - DYNAMICS

Motion of a particle under a central force, differential equations of central orbit in both
polar and pedal co-ordinates. (l question)
Newton's law of gravitation, planetary orbits, Keplar's laws of motion. (l question)
Motion of a projectile under gravity in a non-resisting medium. (l question)

Motion of mass centre and motion relative to mass centre, D' Alembert's principle. Two
dimensionalmotion of a rigid body, compound pendulum. (l Question)

Books Recommended :

l.Statics-SLLoney.
2. Statics - Goyal & Gupta
3.pvnamics-SLLoney.
4. Dynamics - RK Gupta & DC Agarwal
', ,'rrrr'lr'l'u, l

29

Paper Code: UCCMATH 614

Numerical Analysis

Credits: 5, Full Marks: 70, Time: 3 Hours

Nine questions will be set. Candidates will be required to answer 5 questions. Question 1
will be compulsory, consisting of 10 short answer type questions covering entire syllabus
uniformly. Candidate will be required to answer any 7 out of these 10 questions, each
question will be of 2 marks. Out of the remaining 8 questions, candidates will be required to
answer any 4 questions selecting at least one from each group. Question may contain two
parts of equal marks.

UNIT I

Solution of algebraic and transcendental equations: Bisection method, Regula-Falsi method,


Newton-Raphson method. (l Question)
Solution of simultaneous equations: Gauss's elimination method, Matrix inversion by
triangularization method. (l Question)

Calculus of finite difference: The operators A,V,E, factorialnotation, their properties and
inter-relation between them, Fundamental theorem of difference calculus, divided
differences. (l Question)
lnterpolation: Newton's forward and backward difference interpolation formula, Lagrange's
interpolation formula, centraldifference interpolation, Gauss's forward, backward and
central difference interpolation formula. (2 questions)

UNIT II

Numerical differentiation: Derivative using forward, backward and centraldifference


interpolation formulae. (l Question)
Numerical integration: General quadrature formula, Simpson's one-third and three -eighth
rule, Weddle's rule, Newton-Cote's method. (l Question)
Solution of ordinary differential equations: Picard's method of successive approximations.
(l Question)

NB': USE OF SCIENTIFIC CALCULATOR ALLOWED.

Books Recommended :

1. Numerical Analysis - J B Scarborough.


2. Numerical Methods -
B S Grewal.
3. Numerical Analysis - G Shankar Rao, New Age lnt. Publishers.
t ^ gZ1----,
%f -?- \ t li'
b,.:
-.6r.1 it:''
- t..,r-'ilgitCh!
",-.rgr j" * '
3oS3(',-; L: i..'' -t
S85it*'
m"

4. Numerical Analysis - GS Mallik 3o


Paper Code: UDSEMATH 603 A

TINEAR PROGRAMMING

Credits: 6, Full Marks: 70, Time: 3 Hours

Nine questions witl be set. candidates will be required to answer 5 questions.


euestion 1
will be compulsory, consisting of 10 short answer type questions covering
entire syllabus
uniformly. Candidates will be required to answer any 7 out of these 10 questions;
each
question will be of 2 marks. out of the remaining 8 questions,
candidates will be required to
answer any 4 questions selecting at least one from each group.
euestions may contain two
parts of equal marks.

UNIT I

Convex sets and their properties, lntroduction to linear programming problem,


solution by
graphical method.
{2 questions)

simplex method, optimality and unboundednes, artificialvariables, two-phase


method,
Big-M method. Duality, formulation of the dual problem, primal-dual
relationships,
economic interpretation of the dual.
Questions}
{2

UNIT II

Transportation problem and its mathematicalformulation, northwest-corner


method, least
cost method and Vogel approximation method for determination of
starting basic solution,
algorithm for solving transportation problem. (2 Questions)
Assignment problem and its mathematical formulation, Hungarian
method for solving
assignment problem. (2 Questions)

Books Recommended:
1' Mokhtar S. Bazaraa, John J. Jarvis and Hanif D. Sherali; Linear progromming
ond Network
Flows,2nd Ed.,John Wiley and Sons, lndia, 2004
2- F.S. Hillier and G.J. Lieberman, tntroduction to Operations Research, gth
Ed., Tata McGraw
Hill, Singapore,2009.
3. Hamdy A- Taha, operations Research, An lntroduction, Sth Ed., prentice-Hall
lndia, 2006.
4. G. Hadley, Lineor programming, Narosa publishing House, New
Delhi, 2002.
5. Operations Research - S D Sharma.
6. Linear Programming problems - R K Gupta.

a---e. ,. *1,;,
-t'?gl . -" J'
ft'tt) .-" U.,,..""
S*Pt*'
3t

OR

Paper Code: UDSEMATH 603 B

Theory of Equations
Credits: 6, Full Marks: 70, Time: 3 Hours

Nrne questions will be set. candidates will be required to answer 5 questions. euestion 1
will be compulsory, consisting of L0 short answer type questions covering entire syllabus
uniformly. Candidates willbe required to answer any 7 out of these 10 questions; each
question will be of 2 marks. Out of the remaining 8 questions, candidates will be required to
answer any 4 questions selecting at least one from each group. Questions may contain two
parts of equal marks.

UNIT I
General properties of polynomials, graphical representation of a polynomial, maximum and
minimum values of a polynomial, general properties of equations, Descarte's rule of sign,
Relation between the roots and the coefficients of equations. (2 Questions)

Symmetric functions of roots, their applications and Newton's theorem on the sums of
powers of the roots, transformation of equations, discriminant and nature of roots,
Cardon's solution of cubic equations. (3 questions)

UNIT II

Solution of biquadratic equation by Descarte's rule. (l Question)

Separation of the roots of equations, Strums theorem, Applications of Strum's theorem,


Conditions for reality of the roots of an equation and biquadratic. Solution of numerical
equations. (2 Questions)

Books Recommended:
1. W.S. Burnside and A.W. Panton, The Theory of Equations, Dublin University Press, 1954.
2. C. C. MacDuffee, Theory of Equations, John Wiley & Sons lnc., 1954.
2. Theory of Equations - talji Prasad.

OR

,
Paper Code: DSEMATH 603 C
-r ,C.\(
Bio-Mathematics -6 'orr,li .i
Credits: 6, Full Marks: 70, Time: 3 Hours
32

Nine questions will be set. Candidates will be required to answer 5 questions. euestion 1
will be compulsory, consisting of 10 short answer type questions covering entire syllabus
uniformly. Candidates will be required to answer any 7 out of these 10 questions; each
question will be of 2 marks. Out of the remaining 8 questions, candidates will be required to
answer any 4 questions selecting at least one from each group. Question may contain two
parts of equal marks.

LINIT I

Mathematical Biology and the modeling process: an overview. Continuous models: Malthus
model, logistic growth, Allee effect, Gompertz growth, Michaelis-Menten Kinetics, Holling
type growth, Bacterial groMh in a Chemostat, Harvesting a single natural population, Prey
predator systems and Lotka Volterra equations, Populations in competitions, Epidemic
Models (SI, SIR,SIRS, SIC), Activator-lnhibitor system, lnsect Outbreak Model: Spruce
Budworm, Numerical solution of the models and its graphical representation. Qualitative
analysis of continuous models: Steady state solutions, stability and linearization, multiple
species communities and Routh-Hurwitz Criteria, Phase plane methods and qualitative
solutions, bifurcations and limit cycles with examples in the context of biological scenario.
Spatial Models: One species rnodel with diffusion, Two species model with diffusion,
Conditions for diffusive instability, Spreading colonies of microorganisms, Blood flow in
circulatory system, Travelling wave solutions, Spread of genes in a population.
( 5 Questions)

IJNIT II

Discrete Models: Overview of difference equations, steady state solution and linear stability
analysis, Introduction to Discrete Models, Linear Models, Growth models, Decay models,
Drug Delivery Problem, Discrete Prey-Predator models, Density dependent growth models
with harvesting, Host-Parasitoid systems (Nicholson-Bailey model), Numerical solution of
the models and its graphical representation. Case Studies: Optimal exploitation models,
Models irr Cenetics, Stage Structure Models, Age Structure Models.
(3 Questions)

Books Recommended:
l. L.E. Keshet, Mathematical Models in Biologt, SIAM, 1988.
2. J. D. Murray, Mathematical Biologt, Springer, 1993.
3. Y.C. Fung, Biomechanics, Springer-Verlag, 1990.
4. F. Brauer, P.v.D. Driessche and J. wu, Mathematical Epidemiologr, Springer,2008.
5. M. Kot, Elements of Mathematical Ecologt, Cambridge University Press,200l.

Paper Code: UDSEMATH 504 A

Fluid Mechanics

Credits: 6, Full Marks: 70, Time: 3 Hours


33

Nrne questions wiil be set. candidates wiil be required to answer


5 questions. Question 1
will be compulsory, consisting of 10 short answer
type questions covering entire syllabus
uniformly' candidates will be required to answer
any 7 out of these 10 questions; each
question will be of 2 marks' out of the remaining
8 questions, candidates will be required
to
answer any 4 questions selecting at least one
from each group. euestion may contain
parts of equal marks. two

UNIT I- HYDROSTATICS
Nature and properties of fruid pressure, pressure
of heavy riquids. (l Question)
Equilibrium of fluids under given system of forces.
(l Question)
Centre of pressure.
(l Question)
Thrust on plane and curved surfaces.
(2 Questions)

UN]T II - HYDRODYNAMICS
Fluid Motion : Lagrangian and Eulerian methods.
Equation of continuity in different forms.
Euler,s equation of motion for perfect fruid. Bernourti,s
theorem. (3 questions)

Book Recommended :

1. Hydrostatics - M Rahman
2. Hydrostatics - J p Sinha
3. Hydrodynamics - Shanti Swaroop
4. Hydrodynamics - M D Raisinghania

OR

Paper Code: DSEMATH 604 B

Mathematical Modelting
Credits:6, Full Marks: 70, Time: 3 Hours

Nrne questions wiil be set. Candidates wiil be required to answer questions.


5 Question 1
will be compulsory, consisting of 10 short answer
type questions covering entire syllabus
uniformly' candidates will be required to answer any
7 out of these 10 questions, each
question will be of 2 marks' out of the remaining
8 questions, candidates will be required
to
answer any 4 questions selecting at least one from
each group. euestions may contain two
parts of equal marks.

UNIT I
34

Power series solution of a differential equation about an ordinary point, solution about a
regular singular point, Bessel's equation and Legendre's equation. (2 Questions)

Laplace transform and inverse transform, application to initial value problem up to second
order. (2 Questions)

UNIT II

Monte Carlo Simulation Modeling: simulating deterministic behavior (area under a curve,
volume under a surface), Generating Random Numbers: middle square method, linear
congruence. (2 Questions)

Queuing Models: harbor system, morning rush hour, Overview of optimization


modeling, Linear Programming Model: geometric solution algebraic solution, simplex
method, Sensitivity analysis. (2 Questions)

List of Practicals (using any software)

(i) Plottingof Legendre polynomial forn: I to 5 in the interval [0,1]. Verifying


graphically that all the roots of Pn (x) lie in the interval [0,1].
(ii) Automatic cornputation of coefficients in the series solution near ordinary points.
(iii) Plotting of the Bessel's function of first kind of order 0 to 3.
(iv) Automating the Frobenius Series Method.
(v) Random number generation and then use it for one of the following (a) Simulate area
under a curve (b) Simulate volume under a surface.
(vi) Programming of either one of the queuing model(a) Single server queue (e.g. Harbor
system) (b) Multiple server queue (e.g. Rush hour).
(vii) Programming of the Simplex method for 213 variables.

Books Recommended
l. Tyn Myint-tJ and Lokenath Debnath, Linear Partial Dffirential Equation for Scientists
and
Engineers, Springer, Indian reprint, 2006.
2. Frank R. Ciordano, Maurice D. Weir and William P. Fox, A Firsi Cour.se in Mathematical
Modeling, Thomson Learning, London and New York, 2003.

OR
Paper Code: UDSEMATH 504 C

Differential Geometry

Crdits: 6, Full Marks: 70, Time: 3 Hours

Nine questions will be set. Candidates will be required to answer 5 questions. Question 1

will be compulsory, consisting of 10 short answer type questions covering entire syllabus
uniformly. Candidate will be required to answer any 7 out of these 10 questions, each
question will be of 2 marks. Out of the remaining 8 questions, candidates will be required

1 r i-

ila*- 'tJ -"'


{La'
35

answer any 4 questions selecting at least one from each group. Question may contain two
parts of equal marks.

LINIT I

Theory of Space Curves: Space curves, Planer curves, Curvature, torsion and Serret-Frenet
formulae. Osculating circles, Osculating circles and spheres. Existence of space curves.
Evolutes and involutes of curves. (l question)
Theory of Surfaces: Parametric curves on surfaces. Direction coefficients. First and second
Fundamental forms. Principal and Gaussian curvatures. Lines of curvature, Euler's theorem.
Rodrigue's formula, Conjugate and Asymptotic lines. (2 questions)

Developables: Developable associated with space curves and curveson surfaces, Minimal
surfaces. (l Question)

UNIT II

Geodesics: Canonical geodesic equations. Nature of geodesics on a surface of revolution.


Clairaut's theorem. Normal property of geodesics. Torsion of a geodesic. Geodesic
curvature. Gauss-Bonnet theorem. Surfaces of constant curvature. Conformal mapping.
Geodesic mapping. Tissot's theorem. (2 Questions)

Tensors: Summation convention and indicial notation, Coordinate transformation and


Jacobian, Contra-variant and Covariant vectors, Tensors of different type, Algebra of tensors
and contraction, Metric tensor and 3-index Christoffel symbols, Parallel propagation of
vectors, Covariant and intrinsic derivatives, Curvature tensor and its properties, Curl,
Divergence and Laplacian operators in tensor form, Physical components.
(2 Questions)

Books Recommended

1. T.J. Willmore, An lntroduction to DifferentialGeometry, Dover Publications,2Ot2.


2. B. O'Neill, Elementary Differential Geometry,2nd Ed.; Academic Press, 2006.
3. C.E. Weatherburn, Differentiol Geometry of Three Dimensions, Cambridge University
Press,2003.
4. D.l. Struik, Lectures on Clossical Differential Geometry, Dover Publications, 1988.
5. S. Lang, Fundamentols of DifferentialGeometry, Springer, 1999.
6. B. Spain, Tensor Calculus: A Concise Course, Dover Publications, 2003.

,k***rk
',
'r'rtnlnuo,

36

For B. Sc. General Science Students having Mathematics as one of the


subjects.

Paper Code: UGEMATH 101/ UGDSCMATH101

DIFFERENTIAL CATCULUS & COORDINATE GEOMETRY 2D

Credits: 6, Full Marks: 100, Time: 3 Hours '

Nine questions will be set. Candidates will be required to answer 5 questions. Question 1
will be compulsory, consisting of 12 short answer type questions covering entire syllabus
uniformly. Candidate will be required to answer any 10 out of these 12 questions, each
question will be of 2 marks. Out of the remaining 8 questions, candidates will be required to
answer any 5 questions selecting at least one from each group. Question may contain two
parts of equal marks.

UNIT I . DIFFERENTIAL CALCULUS

Successive differentiation, nth order derivative of some standard functions. Leibnitz's


theorem. Taylor's and Maclaurin's series expansions of functions. Applications of Taylor's
and Maclaurin's series. (2 Questions)

Tangent and Normal, their equations in the. Cartesian form, parametric form. Angle
between two curves. Length of tangent, normal, sub tangent, subnormal in Cartesian forms.
partial Differentiation, Euler's theorem. Curvature. Asymptotes. Maxima and Minima of
functions of two variables. (3 Questions)

UNIT II - COORDINATE GEOMETRY 2D & TRIGONOMETRY

Change of rectangular axes, Rotation and Shifting of origin. Transformation of the general equation
ofthe second degree. Conditions for the general equation of second degree to represent a
parabola, ellipse and hyperbola. Equations of the tangent and normal to a given curve using
calculus. Polar equation. (3 Questions)

Books Recommended:
1. Differential Calculus: A Das Gupta & S B Prasad.
2. Differential Calculus: Lalji Prasad'
3. Coordinate Geometry: A Das Gupta. *{+
al -nt''-'.
1' a \'+'
tr1gQ'"' :"r' "
"
sP:+-
,,,,,,,n,n,,,0,,

|
L
I

t-
I

lv
l.
I

| - 4. Coordinate Geometry, Lalji Prasad.

I
I

'.,
I

| -
I

Paper code: UGEMATH 2O2l UGDSCMATHaO2


\-.
INTEGRAL CALCULUS, VECTOR CATCULUS & TRIGONOMETRY
\-
Credits: 6, Full Marks: 100, Time: 3 Hours
\_
Nine questions will be set. Candidates will be required to answer 5 questions. Question 1
will be compulsory, consisting of 12 short answer type questions covering entire syllabus
'\* uniformly. Candidate will be required to answer any 10 out of these 12 questions, each
\* question will be of 2 marks. Out of the remaining 8 questions, candidates will be required to
answer any 5 questions selecting at least one from each group. Question may contain two
'v parts of equal marks.

UNIT I - INTEGRAL CALCULUS

lntegration of rational and irrational functions. lntegration by substitution, by parts, partial


fractions, lntegration by transformations, lntegration by substitution , lntegration by parts.
(2 Questions)

Evaluation of definite integrals, reduction formulae, curve tracing, length and area, Surface
area and volume of solids of revolution. (2 Questions)

UNIT II - VECTOR CALCULUS & TRIGONOMETRY

Scalar and Vector point functions, vector function of scalar variables, Continuity of a vector
function. Differentiation of a vector with respect to the scalar variable "t". Differentiation of
a vector function. Derivatives of a sum of vectors, derivatives of a product of vectors (both
scalar and vector products). (2 question)

Gradient, Divergence and curl and second order vector differential operators in Cartesian
coordinates systems. (1 question)

Demoivre's Theorem and applications. (L question)

Books Recommended;
L. lntegral Calculus: Dasgupta & Prasad.
2. integral Calculus: Lalji Prasad.
3. Vector Calculus: Dasgupta & Prasad.
4. Vector calculus: Lalji Prasad.
5. Trigonometry : DasguPta & Prasad.
6. Trigonometry: lalji Prasad.
rr"

38

Paper Code: UGEMATH 3O3l UGDSCMATH3O3

REAr ANALYS|S t, GROUP THEORY & DTFFERENTTAL EQUATTONS

Credits:6, Full Marks: 100, Time: 3 Hours

Nine questions will be set. Candidates will be required to answer 5 questions. Question 1
will be compulsory, consisting of 12 short answer type questions covering entire syllabus
uniformly. Candidate will be required to answer any 10 out of these 12 questions, each
question will be of 2 marks. Out of the remaining 8 questions, candidates will be required to
answer any 5 questions selecting at least one from each group. Question may contain two
parts of equal marks.

UNIT I_ REAL ANALYSIS i


Sequence: Definition, Bounds, Limit of a sequence, Monotonic Sequences and their
Convergence, Algebraic operations and limits, Cauchy Sequence, General principle of .

convergence of a sequence.
(l Question)

Series: Definition, Convergent 5eries, Divergent Series, Pringsheim's theorem, Comparison


tests, Cauchy,s root test , D'Alembert's ratio test, Alternating series and Leibnitz test,
Absolutely convergent series. (2 Questions)

UNIT II - GROUP THEORY & DIFFERENTIAL EQUATIONs

GROUP THEORY
Binary operations, Notion of group, Abelian group and non-Abelian group with examples.
Uniqueness of identity element and inverse elements in a group, different ways of defining a
group, concept of Subgroup and cyclic group, Cosets, Lagrange's theorem.
(2 questions)

DI FFERENTIAL EQUATIONS

Differential equations of first order and higher degree, Clairaut's form, singular solution,
orthogonal trajectories. (l Questions)

Linear Equation with constant co-efficients, Homogenous linear equations with variable

.PORs
coefficients. Simultaneous equation + =+ =$ and total differential equation

P dx + Q dy + R dz = 0 together with their geometric significance.


(2 Questions)

Books Recommended:
39

1. Real Analysis: Shanti Narayan & M D Raisinghania


2. RealAnalysis: talji Prasad.
3. Abstract algebra: A R vashishtha
4. Modern Algebra: Lalji Prasad.
5. Differential Equations: M D Raisinghania.

Paper Code: UGEMATII 4O4l UGDSCMATH4O4


REAL ANALYSIS II, COMPLEX VARIABLE, SETTHEORY & MATRICES

Credits: 6, Full Marks: 100, Time: 3 Hours

Nine questions will be set. Candidates will be required to answer 5 questions. Question 1
will be compulsory, consisting of 12 short answer type questions covering entire syllabus
uniformly. Candidate will be required to answer any 10 out of these 12 questions, each
question will be of 2 marks. Out of the remaining 8 questions, candidates will be required to
answer any 5 questions selecting at least one from each group. Question may contain two
parts of equal marks.

UNIT I- REAL ANALYSIS II & COMPLEX VARIABLE

REAL ANALYSIS II

Riemann lntegration, definition, Oscillatory sum and integrability condition. lntegrability of


monotonic and continuous functions. Fundamental theorem of integral calculus.
(l Questions)

COMPLEX VARIABLES

Realfunctions of two variables: Simultaneous and iterated limits: Continuity, partial


derivatives, Differentiability and related necessary and sufficient conditions. Functions of
complex variables limit, Continuity, derivative, Cauchy-Riemann Equations, Analytic
function, Harmonic function. (2 Questions)

Standard transformations w=z+c , w=cz, w=t/2, s7=(az+b) / lcz+dl (bilinear). Conformal


transformation as transformation effected by analytic function. (1 Question)

UTVIt' II _ sET THEORY & MATRICES

SET THEORY

lndexed family of sets, Generalised set of operations & Demorgan laws, Set mapping.
Countable and uncountable sets, partition of a set, equivalence relation and related

,i.* '-:iit
t

40

fundamental theorem of partition. Partial order relation and relate concepts of u.b., 1.b.,
inf., sup, maximal element, minimal element and lattice (definition and examples only).
(2 Questions)

MATRICES

Matrices, operations on matrices, matrix algebra, kinds of matrices, Transpose, adjoint and
inverse of a matrix, solution of system of linear equations.
(2 Questions)

Books recommended:
1. RealAnalysis: Shanti Narayan & M D Raisinghania.
2. RealAnalysis: Lalji Prasad.
3. Complex Variables: J N Sharma.
4. Set Theory: K K jha.
5. Matrices: A R Vashishtha.

Paper Code : UGDSEMATH 501A

NUMERICAT ANATYSIS

Credits: 6, Full Marks: L00, Time: 3 Hours

Nine questions will be set. Candidates will be required to answer 5 questions. euestion 1
will be compulsory, consisting of 12 short answer type questions covering entire syllabus
uniformly. Candidate will be required to answer any 10 out of these 12 questions, each
question will be of 2 marks. Out of the remaining 8 questions, candidates will be required to
answer any 5 questions selecting at least one from each gioup. Question may contain two
parts of equal marks.

UNIT I

Solution of algebraic and transcendental equations: Bisection method, Regula-Falsi method,


Newton-Raphson method, (l euestion)
Calculus of finite difference: The operators A, V, E, factorial notation, their properties and
inter-rplation between them, Fundamental theorem of difference calculus, divided
differences. (l Question)

lnterpolation: Newton's forward interpolation formula, Lagrange's interpolation formula,


central difference interpolation, Gauss's forward and central difference interpolation
formula.

. i1:-_'
:' '-'r'''t:'i
1l*t
-t -- .' '
"roflL--,
a
- ,r,i'* --
!-rv ^lal "
Satrt"'
4l

UNIT II

Numerical differentiation: Derivative using forward, backward and central difference


interpolation formulae. (l euestion)

Numerical integration: General quadrature formula, Simpson's one-third and three -eighth
rule; Weddle's rule. (2 Questions)

Solution of ordinary differential equations: Picard's method of successive approximations.


(l Question)
NB : USE OF SCIENTIFIC CATCULATOR ALLOWED.

Books Recommended :
1. Numerical Analysis - J B Scarborough.
2. Numerical methods - B S Grewal.
2. Numerical Analysis - G S Mallik
3. Numerical Analysis - G Shankar Rao, New Age lnt. publishers.

OR

Paper Code : UGDSEMATH 501 B

PROBABI LITY AN D STATISTICS

Credits: 6, Full Marks: 100, Time: 3 Hours

Nrne questions will be set. Candidates will be required to answer 5 questions. euestion 1
will be compulsory, consisting of 12 short answer type questions covering entire syllabus
uniformly. Candidate will be required to answer any 10 out of these 12 questions, each
question will. be of 2 marks: Out of the remaining 8 questions, candidates will be required to
answer any 5 questions selecting at least one from each group. Question may contain two
parts of equal marks.

UNIT I

lntroduction to random variables (discrete and continuous), cumulative distribution


function(c.d.f.), probability mass/density functions, joint p.d.f., joint p.m.f., marginal and
condithcnal distributions, joint c.d.f. and its properties. Mathematical expectations,
moments , moment generating function : limitations and properties, characteristic function.
(4 Questions)

UNIT II

.u€
42

Discrete distributions: uniform, binomial& Poisson.


continuous distributions: uniform and
normal' (2 euestions)
Properties of a Random sample: Basic concepts of
Random sample, convergence in
probability, almost sure convergence, convergence
in distribution. order statistics and their
distributions. (2 euestions)
Books Recommended:

1' Robert V' Hogg, Joseph w. McKean and Allen T. craig, rntroduction to
Mathematical
Statistics,Pearson Education, Asia, 2007.
2' lrwin Miller and Marylees Milter, John E. Freund, Mathematicalstatistics
with
Applications, 7th Ed., pearson Education, Asia, 2006.

3. Fundamentals of Mathematical statistics


-s c Gupta & v K Kapoor.

Paper Code : UGDSEMATH 602 A

LINEAR PROGRAMMING

Credits: 6, Full Marks: 100, Time: 3 Hours

/Vine questions will be set. candidates will be required to answer 5 questions.


euestion 1
will be compulsory, consisting of 12 short answer type questions
covering entire syllabus
uniformly' candidate will be required to answer any 10 out
of these 12 questions,
question will be of 2 marks. out of the remaining questions,
8 "";;
candidates will be required to
answer any 5 questions selecting at least one from each group.
euestion may contain two
parts of equal marks.

UNIT I

convex sets and their properties, lntroduction to linear programming


problem, solution by
graphical method, simplex method, optimality and
unboundednes, gis-M method.
(2 Questions)

Duality, formulation of the duar probrem, primar-duar rerationships.


, (2 Question)
UNIT II

Transportation problem and its mathematical formulation, northwest-corner


method, least
cost method and Vogel approximation method for determination
of starting basic solution,
algorithm for solving transportation problem. (2 Questions)

(L\
, -^-,.L1
,.{

uie?'",^,t' u'"' i -"

S'Bir--
43

Assignment problem and its mathematicalformulation, Hungarian method for solving


assignment problem. (2 Questions)

Books Recommended:
L. Mokhtar S. Bazaraa, John J. Jarvis and Hanif D. Sherali, Linear Progromming and Network
Flows,2nd Ed., John Wiley and Sons, lndia, 2004.
2. F.S. Hillier and G.J. Lieberman, tntroduction to Operations Reseorch, 9th Ed., Tata McGraw
Hill, Singapore, 2009.
3. Hamdy A. Taha, Operations Research, An lntroduction, 8th Ed., Prentice-Hall lndia, 2006.
4. G. Hadley, Linear Programming, Narosa Publishing House, New Delhi, 2002.
5. Operations Research - S D Sharma.
6. Linear Programming Problems - R K Gupta.

OR

Paper Code : UGDSEMATH 602 B

Theory of Equations

Credits: 6, Full Marks: 1-00, Time: 3 Hours

Nine questions will be set. Candidates will be required to answer 5 questions. Question 1
will be compulsory, consisting of 12 short answer type questions covering entire syllabus
uniformly. Candidate will be required to answer any 10 out of these 12 questions, each
question will be of 2 marks. Out of the remaining 8 questions, candidates will be required to
answer any 5 questions selecting at least one from each group. Question may contain two
parts of equal marks.

UNIT I

General properties of polynomials, graphical representation of a polynomial, maximum and


minimum values of a polynomial, general properties of equations, Descarte's rule of sign,
Relation between the roots and the coefficients of equations. (2 Questions)

Symmetric functions of roots, their applications and Newton's theorem on the sums of
powers of the roots, transformation of equations, discriminant and nature of roots,
Cardon's solution of cubic equations. (3 Question)

,
UNIT II

Solution of biquadratic equation by Descarte's rule. {l Questions)

Separation of the roots of equations, Strums theorem, Applications of Strum's theorem,

,
-'+r
44

Conditions for reality of the roots of an equation and biquadratic. Solution of numerical
equations. (2 Questions)

\-
Books Recommended:
1. W.S. Burnside and A.W. Panton, The Theory of Equotions, Dublin University Prbss, 1954.
2. C. C. MacDuffee, Theory of Equations, John Wiley & Sons lnc., 1954.
3. Theory of Equations - Lalji Prasad.

\
,/-
(-v
'Ll
-
,'"'''
^''' "^**5\'
*t'.-" . \$l'
6t- ..;.
.1&Y
- ^gV,'
$s"

You might also like