B.A. (Prog.

) Semester-V with Mathematics as Major

Category-II
DISCIPLINE SPECIFIC CORE COURSE (DSC-5): LINEAR PROGRAMMING

CREDIT DISTRIBUTION, ELIGIBILITY AND PRE-REQUISITES OF THE COURSE

Course title & Credits Credit distribution of the course Eligibility Pre-requisite
Code criteria of the course
Lecture Tutorial Practical/ (if any)
Practice

Linear 4 3 1 0 Class XII pass NIL

Programming with
Mathematics

Learning Objectives: The primary objective of this course is to introduce:

• The solution of linear programming problem using simplex method.
• The solution of transportation and assignment problems.
• Game theory which makes possible the analysis of the decision-making process of two
interdependent subjects.

Learning Outcomes: This course will enable the students to:

• Learn about the simplex method used to find optimal solutions of linear
optimization problems subject to certain constraints.
• Write the dual of a linear programming problem.
• Solve the transportation and assignment problems.
• Learn about solution of rectangular games using graphical method and dominance.
• Formulate game to a pair of associated prima-dual linear programming problems.
SYLLABUS OF DSC-5
UNIT-I: Linear Programming Problem, Simplex Method, and Duality (18 hours)
Standard form of the LPP, graphical method of solution, basic feasible solutions, and
convexity; Introduction to the simplex method: Optimality criterion and unboundedness,
Simplex tableau and examples, Artificial variables; Introduction to duality, Formulation of
the dual problem with examples.

UNIT-II: Transportation and Assignment Problems (15 hours)

Definition of transportation problem, finding initial basic feasible solution using
Northwest-corner method, Least-cost method, and Vogel approximation method;
Algorithm for solving transportation problem; Hungarian method of solving assignment
problem.
UNIT-III: Two-Person Zero-Sum Games (12 hours)
Introduction to game theory, rectangular games, Mixed strategies, Dominance principle;
Formulation of game to primal and dual linear programming problems.

Essential Readings

34
3. Thie, Paul R., & Keough, G. E. (2014). An Introduction to Linear Programming and
Game Theory. (3rd ed.). Wiley India Pvt. Ltd.
4. Taha, Hamdy A. (2017). Operations Research: An Introduction (10th ed.). Pearson.

Suggestive Readings
• Hadley, G. (1997). Linear Programming. Narosa Publishing House. New Delhi.
• Hillier, F. S., & Lieberman, G. J. (2021). Introduction to Operations Research (11th
ed.).McGraw-Hill Education (India) Pvt. Ltd.

DISCIPLINE SPECIFIC CORE COURSE – 5 (Discipline A-5): ELEMENTS OF REAL ANALYSIS

CREDIT DISTRIBUTION, ELIGIBILITY AND PRE-REQUISITES OF THE COURSE

Course title & Credits Credit distribution of the course Eligibility Pre-requisite
Code criteria of the course
Lecture Tutorial Practical/ (if any)
Practice

Elements of 4 3 1 0 Class XII pass NIL

Real Analysis with
Mathematics

Learning Objectives: The primary objective of this course is to introduce:

• The real line with algebraic, order and completeness properties.
• Convergence and divergence of sequences and series of real numbers with applications.

Learning Outcomes: This course will enable the students to:

• Understand the basic properties of the set of real numbers, including completeness
and Archimedean with some consequences.
• Recognize bounded, convergent, monotonic and Cauchy sequences
• Learn to apply various tests such as limit comparison, ratio, root, and alternating series
tests for convergence and absolute convergence of infinite series of real numbers.
SYLLABUS OF DISCIPLINE A-5
UNIT-I: Basic Properties of the Set of Real Numbers (12 hours)
Field and order properties of ℝ, basic properties and inequalities of the absolute value of
a real number, bounded above and bounded below sets, Suprema and infima, The
completeness axiom and the Archimedean property of ℝ.

UNIT-II: Real Sequences (18 hours)

Convergence of a real sequence, Algebra of limits, The squeeze principle and applications,
Monotone sequences, Monotone convergence theorem and applications, Cauchy
sequences, Cauchy criterion for convergence and applications.

35
UNIT-III: Infinite Series of Real Numbers (15 hours)
Convergence and divergence of infinite series of real numbers, Necessary condition for
convergence, Cauchy criterion for convergence of series, Tests for convergence of positive
term series, Applications of the integral test, Comparison tests, D’Alembert’s ratio test,
Cauchy’s nth root test, Raabe’s test; Alternating series, Leibniz alternating series test,
Absolute and conditional convergence.

Essential Reading
1. Denlinger, Charles G. (2011). Elements of Real Analysis. Jones & Bartlett India Pvt.
Ltd. Student Edition. Reprinted 2015.

Suggestive Readings
• Bartle, Robert G., & Sherbert, Donald R. (2011). Introduction to Real Analysis (4th
ed.). John Wiley & Sons. Wiley India Edition 2015.
• Bilodeau, Gerald G., Thie, Paul R., & Keough, G. E. (2010). An Introduction to
Analysis (2nd ed.). Jones & Bartlett India Pvt. Ltd. Student Edition. Reprinted 2015.

36
 DSE Courses of B.A. (Prog.) Semester-V
Category-II

DISCIPLINE SPECIFIC ELECTIVE COURSE – 1(i): COMBINATORICS

CREDIT DISTRIBUTION, ELIGIBILITY AND PRE-REQUISITES OF THE COURSE

Course title & Credits Credit distribution of the course Eligibility Pre-requisite
Code criteria of the course
Lecture Tutorial Practical/ (if any)
Practice

Combinatorics 4 3 1 0 Class XII pass NIL

with
Mathematics

Learning Objectives: The primary objective of this course is to:

• Introduce various techniques of permutations, combinations, and inclusion-exclusion.
• Learn basic models of generating functions and recurrence relations in
their application to the theory of integer partitions.
Learning Outcomes: After completing the course, student will:
• Enhance the mathematical logical skills by learning different enumeration techniques.
• Be able to apply these techniques in solving problems in other areas of mathematics.
• Be trained to provide reasoning and arguments to justify conclusions.
SYLLABUS OF DSE-1(i)
UNIT – I: Basics of Combinatorics (15 hours)
Basic counting principles, Permutations and Combinations (with and without repetitions),
Binomial coefficients, Multinomial coefficients, Counting subsets of size k; Set-partitions,
The inclusion-exclusion principle and applications.

UNIT – II: Generating Functions and Recurrence Relations (18 hours)

Generating functions: Generating function models, Calculating coefficients of generating
functions, Polynomial expansions, Binomial identity, Exponential generating functions.
Recurrence relations: Recurrence relation models, Divide-and-conquer relations, Solution
of linear recurrence relations, Solutions by generating functions.

UNIT – III: Partition (12 hours)

Partition theory of integers: Ordered partition, Unordered partition, Ferrers diagram,
Conjugate of partition, Self-conjugate partition, Durfee square, Euler’s pentagonal theorem.

Essential Readings
1. Sane, Sharad S. (2013). Combinatorial Techniques. Hindustan Book Agency (India).
2. Tucker, Alan (2012). Applied Combinatorics (6th ed.). John Wiley & Sons, Inc.
Suggestive Readings
• Brualdi, Richard A. (2009). Introductory Combinatorics (5th ed.). Pearson Education.
• Cameron, Peter J. (1994). Combinatorics: Topics, Techniques, Algorithms. Cambridge
University Press.

37