SYLLABUS & PROGRAMME STRUCTURE

Mathematics
(Honours)
(Choice Based Credit System)
(Effective from the Academic Session 2017-2018)

Fifth Semester

MAHARAJA BIR BIKRAM UNIVERSITY

AGARTALA, TRIPURA: 799004
 Mathematics (Honours) | Semester - V
PROGRAMME STRUCTURE

Structure of Proposed CBCS Syllabus B.A/B.Sc/B.Com Honours.

Semester Core Course Ability Skill Discipline Generic Elective

(14) Enhancement Enhancement Specific (GE) (4)
Honours Compulsory Course Course (SEC) Elective
(AECC) (2) (2) (DSE) (4)

1 C1 GE1
C2 AECC1: (Paper-I of selected
Environmental subject other than
Science Hons subject)
2 C3 AECC2 : GE2
C4 (English/MIL (Paper-II of
(Communication) selected subject
other than Hons
subject)
3 C5 SEC1 GE3
C6 (Paper-III of
C7 selected subject
other than Hons
subject)
4 C8 SEC2 GE4
C9 (Paper-IV of
C10 selected subject
other than Hons
subject)
5 C11 DSE1
C12 DSE2
6 C13 DSE3
C14 DSE4
 Mathematics (Honours) | Semester - V
Semester - V
Core Course - XI
5.1 MATHEMATICAL ANALYSIS
TOTAL MARKS – 100
(End Semester – 80, Internal - 20)
Unit –I
Functions of Bounded variation. Bounded variation on finite intervals. Definition and example.
Lipschitz condition. Properties of functions of bounded variation. Algebra of functions of bounded
variation. Variation function. Decomposition theorem (Jordan Theorem). Continuous functions of
Bounded variation.

Absolutely Continuous Functions. Definition and example. Relationship with continuity, uniform
continuity and functions of bounded variation. Properties of Absolutely continuous function. Simple
problems.
Unit – II
Multiple Integrals. Double integrals on rectangular regions, condition of Integrality. Some integrable
functions, properties of integrable functions, Repeated integrals, Double integrals over a region (Other
than rectangles). Change in order of integration.
Idea of triple integral calculation of triple integral with the help of repeated integral and by change of
variable. Evaluation of volume and surface area by multiple integrals. Simple problems.

Unit – III (Metric Spaces - I)

Definition and examples of metric space, bounded metric, open sphere, neighborhoods, Limit Points,
Open and closed sets, closure and interior, boundary points, dense subset.
Subspace of metric space, Cauchy sequence, completeness, R, C, 𝑅𝑅 𝑛𝑛 , 𝐶𝐶 𝑛𝑛 , 𝑙𝑙2 , 𝐶𝐶[𝑎𝑎, 𝑏𝑏]𝑒𝑒𝑒𝑒𝑒𝑒. Cantor
intersection theorem. Simple problems.

Unit – IV (Metric Spaces - II)

Continuity and uniform continuity of functions between two metric spaces, theorems relating to them,
Homomorphic and isometric metric space and their relationship. Banach Fixed points
theorem.Compactness in metric space totally bounded sets. Separable metric space, compactness and
continuity. Simple problems.

Suggested Readings:
1. Mathematical Analysis – S.C. Malik and Savita Arora, New Age International Publishers.
2. Advanced Mathematical Analysis – Utpal Chatterjee, Academic Publishers.
3. Theory of Functions of Real variable Vol-I – I.P. Natanson, Scribd.
4. Elements of Functional Analysis – B.K. Lahiri, World Press.
5. First course in Functional Analysis – Goffman & Pedrick, AMS Chelsea Publishing.
6. A Course of Mathematical Analysis – Shanti Narayan, S. Chand.
7. Mathematical Analysis – T. M. Apastol, New Age International.
8. Advanced Calculus - Widder D. U., Prentice hall of India.
9. Introduction to Real variable Theory – S. C. Saxena and S. M. Shah, Prentice Hall of India.

_______________
 Mathematics (Honours) | Semester - V
Semester - V
Core Course - XII
5.2 Computer Programming in C and practical
TOTAL MARKS – 100
(Theory – 70 : End Semester – 60, Internal - 10)
(Practical – 30)
Group – A
Computer Programming in C
Unit-I
Introduction to C. History of C. Importance of C. Algorithm and Flowchart, executing a C
program. Fundamental of C language. Characters used in C, Identifiers, Keywords, Constants,
Variables, Data types, Declaration of variables, operators and expressions.
Unit-II
Control Statements and Loop Control Statements in C. If-else statement, Nested if-else Statement, Switch
Statement, Loop Control Statements, for Loop, while Loop, do-while Loop, goto, break, continue
statements.
Array and String in C. Introduction to Array, One dimensional Array, Two dimensional Array, Array
Declaration, Declaring and initializing. String variables, Reading and Writing string, Putting string
together, Comparison of string, string handling Function, Table of Strings.
Unit-III
Function in C. User of Function, User defined Function, Function Declaration, Calling of
Function, Recursive Function, Local and Global Variables, void ( ) Function, other features of
Functions.
Structures and Unions. Defining a Structure, Declaring a Structure variable, Structure
initialization, Structures with in Structures, Unions and their uses.
Unit-IV
Pointers. Pointer Declaration, Pointer as Function arguments, Pointers with Array, Dynamic
Memory Allocation, Pointers with String, Pointers with Structures, Pointer to Functions.
File Management in C. Defining and opening a File, Closing a File, Input and Output Operation
on Files.

Group – B
Practical - Computer Programming in C

Suggested Readings:
1. A First Cours in Programming with C, T. Jeyapoovan, VIKAS
2. Programming in ANSI C, 6th Edition, E. Balagurusamy, Tata McGraw Hill
3. The C Programmin Language, Brain W. Kernighan &Dennis M. Ritchie, PHI.

_____________
 Mathematics (Honours) | Semester - V

Semester - V
DSE - Paper – I (Honours)
5.1 STATICS AND DYNAMICS
TOTAL MARKS – 100
(End Semester – 80, Internal - 20)
Unit - I (Statics - I).
Composition and resolution of forces – (m, n) theorem, examples. Equilibrium of concurrent forces –
triangle of forces, Polygon of forces, Lani’s theorem, examples. Parallel forces, moment of forces,
Varignon’s theorem, cuples. Simple problems.

Unit - II (Statics - II).

Coplanar of forces – Reduction of coplanar forces, equation of the line of action of the resultant, condition
for equilibrium, Astatic equilibrium, Astatic centre. Simple problems. Stability of equilibrium – The
energy test of stability, stable and unstable, equilibrium, examples. Virtual work – Principle of virtual
work, conditions of equilibrium of a particle under coplanar forces from the principle of virtual work.
Simple problems.
Unit - III (Dynamics of a particle - I)
Expression for velocity and acceleration of a particle moving in along a straight line and along a plane
curve. Rectilinear motion of a particle under attractive forces. Simple Harmonic Motion – velocity and
acceleration in Cartesian coordinates, angular velocity and angular acceleration, relation between angular
and linear velocity, tangential and normal accelerations, normal acceleration for circular motion, velocity
and acceleration along radial and transverse directions. Simple problems.
Unit - IV (Dynamics of a particle - II)
Central orbits – Central force, motion of a particle under central force, velocity under central force.
Differential equations of central orbit in polar and pedal forms, examples. Motion in resisting medium –
vertical motion when resistance varies with velocity, examples. Motion of varying mass – Equation of
motion, examples. Planetary motion – Kepler’s laws of planetary motion, Geo stationary satellites. Simple
problems.

Suggested Readings:
1. Dynamics of a Particle and of Rigid Bodies - S. L. Lony, Radha Publishing House.
2. Dynamics of Particle and Rigid Bodies - Chakroborty and Ghosh, U.N.Dhur and Sons.
3. Analytical Statics – M. C. Ghosh.
4. The Elements of Statics and Dynamics – S. L. Loney, Arihant.
5. Statics – M. Rahman, New Central Book Agency.
6. A Text Book on Dynamics – M. Ray and G. C. Sharma, S. Chand.
7. Advanced Analytical Statics – S. Mondal, U.N.Dhur and Sons.

_____________
 Mathematics (Honours) | Semester - V

Semester - V
DSE – Paper – II (Honours)
5.2 LINEAR PROGRAMMING PROBLEM AND GAME THEORY
TOTAL MARKS – 100
(End Semester – 80, Internal - 20)
Unit-I
(Linear Programming Problem-I)
What is LPP? Mathematical form of LPP formulation. LPP in matrix notation. Graphical solution of LPP.
Basic solution, Basic feasible solution (BFS), optimal solution, degenerate and non-degenerate BFS.
Euclidean space, hyperplane, convex set, extreme points, convex functions and concave functions, the
hyperplane in convex set. Intersection of two convex sets is convex set, the collection of all feasible
solution of a LPP constitutes a convex set. A BFS to a LPP corresponds to an extreme point of convex set
of feasible solutions. Slack, surplus and artificial variables, standard form of LPP.

Unit-II
(Linear Programming Problem-II)
Fundamental theorem of LPP and its applications. Theory and application of the simplex method of
solution of LPP. Charne’s M-technique. Degeneracy. The two phase method.

Unit-III
(Linear Programming Problem-III)
Duality theory. The dual of the dual is primal, relation between the objective function value of dual and
primal problems. Relation between their optimal values. Statement of fundamental theorem of duality.
Dual simplex method. Transportation Problem (TP). TP in LPP form, Balanced TP. Solution of TP.
Optimality test of BFS. Assignment Problem (AP). Solution of AP [(Maximization, unbalanced, negative
cost and impossible assignment.
Unit-IV
(Theory of Games)
Introduction. Basic idea of theory of games. Payoff matrix. Rectangular games. Strategies. Pure and
mixed strategy problems. Minimax and Maximin criterion. Saddle point. Dominance principle, graphical
method of solution.

Note: Problem should be set on simplex and Charne’s method, two phase method in such way that it may
contain at most three or four tableau with approximate marks.

Suggested Readings:
1. Linear Programming Problems - Chakroborty and Ghosh - U. N. Dhur and Sons.
2. Operations Research – Kanti Swarup, P. K. Gupta and Manmohan, Sultan Chand and Sons.
3. Linear Programming and Theory of Games - P. M. Karak, Central Book Agency.
1. An Introduction to Linear Programming and Game Theory – Paul R. Thie and Gerard E.
Keough, Wiley.

_______________