SYLLABUS FOR POSTGRADUATE

PROGRAMME IN MATHEMATICS
(Master of Arts (M.A.)/Master of Science ([Link].)
Examination)

UNDER
CHOICE BASED CREDIT SYSTEM (CBCS)
&
Learning Based Outcomes
2023

Department of Mathematics
Ravenshaw University
Cuttack-753003

1
About the Department
The Department of Mathematics is one of the oldest and prestigious departments of
erstwhile Ravenshaw College, established in 1868 and now Ravenshaw University since
2006. It was established in 1925 with Prof. S.K. Ganguli as Professor and Head of the
Department. Mathematics being an indispensable tool to comprehend almost all streams of
Science/Technology, viz., Industrial Engineering, Biological Systems, Climate Science,
Economics, finance, Computer Science, Information Technology, etc., the department strives
not only to educate the students of mathematics but also to cater the academic requirement of
many disciplines of this university. The department is on course to be a centre of excellence
by promoting teaching and research activities by actively collaborating with reputed
academic and research institutes of India and abroad. The objectives of the department
include instilling mathematical culture and temperament in our society, enhance problem
solving skills, making a sound foundation of mathematics and develop thinking potentials
among the students to offer solution of many modern day problems arising in different strata
of life. The department currently runs B.A./ [Link]. (Mathematics Honours), B.A./[Link]. [Link].
(Mathematics Honours), M.A./[Link]., M. Phil. and Ph.D. programmes. The current faculty
with a dedication to teaching, complement one another with diversified research interests in
fields like Analysis, Algebra, Fluid Dynamics, Numerical Analysis, Approximation Theory,
Probability and Reliability Theory, Data Science etc. The faculty’s qualitative publications
are a milestone in research that enhances the scope for further research in the department. The
department has a well-versed curriculum framed according to the U.G.C. guidelines. The
courses of different programmes are periodically updated to meet the challenges of present
time and withstand the changing scenarios keeping pace with latest research and
developments in different fields of Mathematics. The course curriculum of all the
programmes of the department are designed in concurrence with the choice based credit
system (CBCS) & Learning Outcomes-Based Curriculum Framework (LOCF) prescribed by
University Grant Commission. The department possess the infrastructure resource such as
well equipped classrooms, smart classroom, seminar hall, computer lab and departmental
library in order to impart the teaching, learning and research involving the latest designed
course curriculum of different programmes. The department regularly organises academic
programmes such as seminars, workshops, invited lectures, etc. involving the recent research
directions in Mathematics. They also get good job opportunities at the state and national
levels. The Department has produced several outstanding scholars, academicians,
administrators, and professionals who have contributed to different fields of service in India
and abroad. To connect with our rich alumni from India and abroad, the Department conducts
different alumni meetings from time to time. They join in good number and give their
valuable suggestions that become helpful for the entire Mathematics fraternity. The
department plans to establish a Centre of Data Science in collaboration with Department of
Statistics, Computer Science, establish an Industry–University incubator centre to promote
industry oriented research involving Pure and Applied Mathematics. For further information
please click here ([Link]

1
 M.A./[Link]. in Mathematics under Choice Based
Credit System (CBCS) with Learning Outcomes
About the Programme
M.A./[Link]. Mathematics having electives and optional for students under CBCS is
designed with learning objectives and outcomes aims at offering a general framework within
which post graduate Mathematics teaching will be organised. It serves the goals of
responding to the needs of students to grow as competent, self-reflective learners with
relevant academic and professional skills and to prepare them as contributors to the growing
discipline as per the local, regional, national and global need. The programme has been
designed with the objective to develop in-depth knowledge of students in frontier areas of
mathematics science and methods, so that they are able to use the knowledge to study the
changing and growing aspects in the subjects. The course has a strong focus on theoretical,
applied, practical and scientific research skills and train students to meet personal, local,
regional, national and global need. The programme offers specialised optional courses, which
allow student to pursue their studies in their area of interest. This framework is intended to
help maintaining the standards of teaching, its periodic review against graduate and post
graduate attributes, qualification descriptors, program learning outcomes and course level
learning outcomes. It is viewed in the spirit of innovation in teaching-learning process and
adopted according to local conditions, regional priorities, national and global needs along
with the availability of the expertise.

Looking at the diversity and complexity of the subject and diversified students’
background along with subject dynamism, the curriculum is developed considering various
aspects such as:-

 Entry level expectations of students coming from various colleges, universities and
institutions and their socio-economic background.
 General expectations from a post graduate programme.
 The changing profile of the post graduate students under rapidly changing and
innovation in the concerned and allied subject.

Keeping the above aspect in mind the proposed outcome based curriculum, has been adapted
to the local, regional and linguistic diversities with the changing academic scenario and
conditions. Further, the learning outcomes has been framed with a projected scope on the
basis of the extent of academic facilities available (e.g. availability of faculty and their
expertise, resources and opportunities for field training).
2
Post Graduate Attributes in Mathematics
The graduate attributes in mathematics are the summation of the expected course learning
outcomes mentioned in the beginning of each course. Some of them are stated below.
Disciplinary knowledge: Capability of demonstrating comprehensive knowledge of
mathematics and understanding of one or more disciplines which form a part of an
undergraduate programme of study.
Communications skills:
 Ability to communicate various concepts of mathematics effectively using examples
and their geometrical visualizations.
 Ability to use mathematics as a precise language of communication in other branches
of human knowledge.
 Ability to communicate long standing unsolved problems in mathematics.
 Ability to show the importance of mathematics as precursor to various scientific
developments since the beginning of the civilization.
 Ability to explain the development of mathematics in the civilizational context and its
role as queen of all sciences.
Critical thinking and analytical reasoning:
 Ability to employ critical thinking in understanding the concepts in every area of
mathematics.
 Ability to analyze the results and apply them in various problems appearing in
different branches of mathematics.
Problem solving:
 Capability to solve problems in computer graphics using concepts of linear algebra.
 Capability to solve various models such as growth and decay models, radioactive
decay model, drug assimilation, LCR circuits and population models using techniques
of differential equations.
 Ability to solve linear system of equations, linear programming problems and network
flow problems.
 Ability to provide new solutions using the domain knowledge of mathematics
acquired during this programme.
Research-related skills:
 Capability for inquiring about appropriate questions relating to the concepts in various
fields of mathematics.
 To know about the advances in various branches of mathematics.

3
Information/digital literacy:

 Capability to use appropriate softwares to solve system of equations and differential

equations.
 Capability to understand and apply the programming concepts of C++ to
mathematical investigations and problem solving.

Self-directed learning: Ability to work independently and do in-depth study of various

notions of mathematics.

Moral and ethical awareness/reasoning: Ability to identify unethical behaviour such as

fabrication, falsification or misrepresentation of data and adopting objective, unbiased and
truthful actions in all aspects.

Lifelong learning: Ability to think, acquire knowledge and skills through logical reasoning
and to inculcate the habit of self-learning

Qualification Descriptors for a Master Degree Program in Mathematics

Upon successful completion of the course, the students receive a master degree in the
Mathematics. M.A./[Link]. Mathematics post-graduates of this department are expected to
demonstrate knowledge of major portion of pure and applied mathematics and the ability to
provide an overview of scholarly debates relating to Mathematics. Also, it is expected that
after the completion of this course they will be in a position to pursue their research in
Mathematics. Along with mathematical skills, it is also expected that they will learn life skills
of argumentation, communication and general social values which are necessary to live rich,
productive and meaningful lives. The list below provides a synoptic overview of possible
career paths provided by a postgraduate training in Mathematics:
 Teaching
 Research
 Engineering
 Computer programming (In different MNC’s)
 Statistician
 Defense Research and Development Organization (DRDO) and Indian Space
Research Organization (ISRO).
 Can go for UPSC/Civil services exam.
 Finance
 Science and business

4
Programme Outcomes of M.A./[Link]. Programme
The programme outcomes and attributes are attained by the postgraduate students of
Ravenshaw University through learning acquired on completion of a programme of study.
Individual programmes of study has a defined programme specific learning outcomes which
needs to be attained for the award of a specific degree. The programme learning outcomes of
Ravenshaw University focus on various aspects of knowledge and skills that prepare students
for further study, employment, and citizenship. Therefore, the PG programme of the
Ravenshaw University has been designed with the objective to develop in-depth knowledge
of students in frontier areas of concerned subject and seeks to achieve the following:
PO1: Critical Thinking: Students will have the capability to apply analytic thought to a
body of knowledge; analyse and evaluate evidence, arguments, claims, and beliefs
on the basis of empirical evidence; identify relevant assumptions or implications;
formulate coherent arguments; critically evaluate practices, policies and theories
by following scientific approach to knowledge development
PO2. Effective Communication: Students will acquire the ability to express thoughts and
ideas effectively in writing and orally in English and regional and make
meaningful interpretation by people, ideas, books, media and technology.
PO3: Social Interaction: Elicit views of others, mediate disagreements and help reach
conclusions in group settings.
PO4. Effective Citizenship: Demonstrate empathetic social concern and equity centred
national development, and the ability to act with an informed awareness of issues
and participate in civic life through volunteering.
PO5. Values and Ethics: Recognize different value systems including own, understand the
moral dimensions of different decisions, and accept responsibility for them.
PO6. Environment and Sustainability: Understand the issues of environmental contexts
and sustainable development.
PO7. Self-directed and Life-long Learning: Acquire the ability to engage in independent
and life-long learning in the broadest context of socio-technological changes
Programme Specific Learning Outcome (PSO)
PSO-1: Will have a strong foundation in both pure and applied mathematics.
PSO-2: Will be able to apply mathematical skills for solving problems and for preparing
various competitive exams.
PSO-3: Will be able to communicate mathematical knowledge effectively, in writing as
well as orally.

5
 PSO-4: Will identify applications of mathematics in other disciplines, leading to
enhancement of career prospects in different fields and research areas.
PSO-5: Will have basic knowledge of programming and computational techniques as
required for employment.
PSO-6: Should have the knowledge of the fundamental axioms in mathematics and
capability of developing ideas based on them and inculcate mathematical
reasoning.
PSO-7: Will be able to locate and analyse the different mathematical texts with appropriate
theoretical framework.
PSO-8: Have the knowledge of a wide range of mathematical techniques and application of
mathematical methods/tools in science, social science, engineering and
technology.
Mapping Course with Programme Specific Outcome (PSO) in Mathematics
PROGRAMME SPECIFIC PROGRAMME
Paper
Course Title OUTCOME (PSO) OUTCOME (PO)
Code 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7
M 1.1.1 Abstract Algebra
√ √ √ √ √ √ √ √ √ √ √ √ √

M 1.1.2 Real Analysis

√ √ √ √ √ √ √ √ √ √ √

M 1.1.3 Complex Analysis

√ √ √ √ √ √ √ √ √ √ √ √ √ √ √

M 1.1.4 Topology
√ √ √ √ √ √ √ √ √ √ √ √ √

M 1.1.5 Linear Algebra

√ √ √ √ √ √ √ √ √ √ √ √ √

M 1.2.1 Discrete
√ √ √ √ √ √ √ √ √ √ √ √
Mathematics
M 1.2.2 Optimization Theory
√ √ √ √ √ √ √ √ √ √ √ √

M 1.2.3 Probability and

√ √ √ √ √ √ √ √ √ √ √ √ √ √ √
Statistical Inference
M 1.2.4 Numerical Analysis
√ √ √ √ √ √ √ √ √ √ √ √

M 1.2.5 Functional Analysis

√ √ √ √ √ √ √ √ √ √ √ √ √

M 2.3.1 Operator Theory

√ √ √ √ √ √ √ √ √ √ √ √

6
 PROGRAMME SPECIFIC PROGRAMME
Paper
Course Title OUTCOME (PSO) OUTCOME (PO)
Code 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7
M 2.3.2 Differential
√ √ √ √ √ √ √ √ √ √ √ √
Equations
M 2.3.3 Computer
√ √ √ √ √ √ √ √ √ √ √ √
Programming
M 2.3.4 Elective-A (Paper-I)
√ √ √ √ √ √ √ √ √ √ √ √

M 2.3.5 Elective-B (Paper-I)

√ √ √ √ √ √ √ √ √ √ √ √ √

M 2.4.1 Differential
√ √ √ √ √ √ √ √ √ √ √ √ √ √
Geometry
M 2.4.2 Advanced Calculus
√ √ √ √ √ √ √ √ √ √ √ √ √

M 2.4.3 Elective-A (Paper-II)

√ √ √ √ √ √ √ √ √ √ √ √

M 2.4.4 Elective-B (Paper-II)

√ √ √ √ √ √ √ √ √ √ √ √

M 2.4.5 Project/ Dissertation

√ √ √ √ √ √ √ √ √ √ √ √

AO-01 Fundamental Aspects of

Discrete Mathematical √ √ √ √ √ √ √ √ √ √ √ √ √ √
Structure

VA-01 Data Analytics

√ √ √ √ √ √ √ √ √ √ √ √ √

Teaching Learning Process

Teaching and learning is a continuous process which is surrounded by students’
attitude to learn & share the knowledge, academic curiosity, reading & practicing, creativity,
thinking ability and extending knowledge levels. Therefore, the teaching learning process of
the programme focus on learner-centric pedagogies, and interactive and participatory
pedagogies. Planning for teaching constitute a critical dimension. The teaching and learning
process revolves around a well-structured and sequenced acquisition of knowledge and skills.

Teaching and learning under this programme involves classroom lectures as well
tutorials. The tutorials allow a closer interaction between the students and the teacher
as each student gets individual attention. For a visual and better learning outcomes instructors
would use ICT facilities, e-learning platforms and other innovative e-content platforms for
student-centric learning methods. As part of participative teaching-learning practices few
courses include seminars, presentations and group discussions. To cater the needs of slow and

7
advance learners, special, remedial and peer teaching classes will be encouraged. Apart from
these, exposure visits, special lectures by invited experts, workshops, and
National/International seminars are to be held to augment knowledge, encourage innovative
ideas and expose the students to global academic and research advancement. There is also the
provision of mentor- mentee for each class where the mentor can keep track of each student’s
progress and address her/his individual difficulties. For the experiential learning course on
project work is offered (i.e. short-term projects, research projects, assignments and field
works), which is the integral components of the programme that enable the students to solve
practical problems. The provision of written assignments and projects submitted by students
as part of the course, are also to be discussed in special classes. All the courses under this
programme have a laboratory component of minimum weightage 25% that meant to enhance
the practical and research skills including an appreciation of the link between theory
and experiment. For each course students will be assigned regular home assignments and
will be tested periodically through quizzes and class tests to ensure that they have properly
learnt the course material.

Assessment Methods / Evaluation Scheme

Assessment methods and evaluation schemes will be as per the Ravenshaw University
Examination Rules and Regulation. Each compulsory, optional and elective papers will have
maximum 100 marks with 4 credits whereas skill enhancement courses (SEC), the value
added (VA) and add on (AO) courses if any will have maximum 50 marks with 2 credits. The
distribution of marks for assessment and evaluation is follows:

I. 20 marks will be assessed and evaluated by internal assessment

II. 80 marks will be assessed and evaluated by end term examination

The internal assessment and evaluation may be done through a continuous process having
assignments, class test, review works, writing of term papers, quiz or examination.

Practical Test will be conducted through submission of practical records/laboratory

experiments/specimen identification and evaluated by internal/external examiners.

The end term examination will be based on written examination for theory paper and the
question will be set following Bloom’s taxonomy which will cover the entire syllabus of the
course. For the research project paper, the student will submit the project write up and defend
his/her project through presentation/Viva-Voce as per the University rule.

8
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

COURSE STRUCTURE OF PG MATHEMATICS

SEMESTER COURSE COURSE COURSE NAME CREDIT TOTAL MARK
TYPE CODE (Mid + End)
1.1.1 Abstract Algebra 04 100(80+20)
1.1.2 Real Analysis 04 100(80+20)
SEM-I Compulsory 1.1.3 Complex Analysis 04 100(80+20)
1.1.4 Topology 04 100(80+20)
1.1.5 Linear Algebra 04 100(80+20)
Total 20 500
1.2.1 Discrete Mathematics 04 100(80+20)
1.2.2 Optimization Theory 04 100(80+20)
SEM-II Compulsory 1.2.3 Probability and Statistical Inference 04 100(80+20)
1.2.4 Numerical Analysis 04 100(80+20)
1.2.5 Functional Analysis 04 100(80+20)
Total 20 500
2.3.1 Operator Theory 04 100(80+20)
Compulsory 2.3.2 Differential Equations 04 100(80+20)
SEM-III 2.3.3 Computer Programming 04 100
Optional 2.3.4 * 04 100(80+20)
2.3.5 * 04 100(80+20)
Total 20 500
Compulsory 2.4.1 Differential Geometry 04 100(80+20)
2.4.2 Advanced Calculus 04 100(80+20)
SEM-IV Optional 2.4.3 * 04 100(80+20)
2.4.4 * 04 100(80+20)
Compulsory 2.4.5 Project/ Dissertation 04 100
Total 20 500
Total 80 2000
*NB: Students will select one paper from elective-A and Elective-B for semester-III and IV respectively.
Elective – A Elective – B
1. Operations Research I and II 1. Fluid Dynamics I and II
2. Number Theory and Cryptography I and II 2. Numerical Solution of Differential Equations I and II
3. Computational Finance I and II 3. Design and Analysis of Algorithms I and II
4. Fuzzy sets and their applications I and II 4. Stochastic Processes I and II
5. Data Science I and II

Value Added and Add On Courses offered beyond the prescribed syllabus
Total Contact
Semester Course Code Course name Credits
Marks Hours
VA-01 Data Analytics 2 50 30
Any
Fundamental Aspects of Discrete Mathematical 2 50 30
Semester AO-01
Structure

9
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

SEMESTER-I
M 1.1.1 (Abstract Algebra)
Full Marks: 100 (Mid Semester: 20, End Semester:80) CREDIT-4

Course Objectives:

1. The main objective of this course is to imbibe in the minds of the students of deeper idea
about abstract algebra.
2. Having fundamental background of group theory, ring theory, matrices and linear
algebra, they will acquire advance phase of knowledge of these topics.

Learning Outcomes: Having finished this course, the students will able to

CO1: The students will be able to understand the structure of a group.

CO2: The students will able to identify the direct and semi-direct products, nilpotent and
solvable groups.
CO3: The students will be able to analyse various advanced concepts such as Euclidean
Domains (U.D.), Principal Ideal Domains (P.I.D), Unique Factorization Domains
(U.F.D) and Polynomial Rings over fields having Grobner bases.
CO4: The students will be able to understand the concept of field extensions and Galois
Theory.
CO5: The students will be able to understand what is Noetherian ring and Affine algebraic
sets.
CO6: The students will be able to analyze many problems of different applied sciences such
as X-ray crystallography, Organic Chemistry, Coding Theory, Network Security and
Cryptography, etc. by applying the concepts acquired in this area.

Unit-I 20 Marks

Group Theory: Automorphisms, the Sylow Theorems, the Simplicity of 𝐴𝑛, Direct Products, the
Fundamental theorem of finitely generated Abelian, Table of Groups of small products,
Recognizing Direct products, Semi Direct Products, p-groups, Nilpotent Groups and Solvable
Groups.

Unit-II 20 Marks

Ring Theory: Ring Homomorphism and Quotient Rings, Properties of Ideals, Rings of Fractions,
Euclidean Domains (U.D.), Principal Ideal Domains (P.I.D), Unique Factorization Domains
(U.F.D), Irreducible Criteria, Polynomial Rings over Fields. Polynomials in Several variables
over a Field and Grobner Bases.

10
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Unit-III 20 Marks

Field Theory and Galois Theory: Basic Theory of Field Extensions, Algebraic Extensions,
Spitting Field and Algebraic Closures, Cyclotomic Polynomials and Extensions, Basic definition
of Galois theory, the Fundamental theorem of Galois theory, Finite Fields.

Unit-IV 20 Marks

Commutative Rings: Noetherian Ring and Affine Algebraic sets, Integral extensions and
Hilbert’s Nullstellensatz, Artinian Rings, Discrete Valuation Rings.

Book Recommended:

David S., Dummit and Richard M. Foote: Abstract Algebra, Third Edition, Wiley Student
Edition, 2013.

Unit-I Chapter-4(4.4 -4.6), Chapter-5 (5.1-5.5), Chapter-6 (6.1)

Unit-II Chapter-7(7.3-7.5), Chapter-8(8.1- 8.3), Chapter-9(9.4-9.6)

Unit-III Chapter-13(13.1, 13.2, 13.4, 13.6) Chapter-14(14.1-14.3)

Unit-IV Chapter-15(15.1, 15.3), Chapter-16(16.1, 16.2)

M 1.1.2 (Real Analysis)

Full Marks: 100 (Mid Semester: 20, End Semester:80) CREDIT-4

Course Objectives:

1. The main objective is to familiarize with the Riemann-Stieltjes Integral, convergence of

sequence and series of real valued function Lebesgue outer measure,
2. Measurable sets, Measurable functions, Integration, Convergence of sequences of functions
and their integrals, Functions of bounded variation, 𝐿𝑝 -spaces.

Learning Outcomes:

CO1: The students will be able to understand the condition of existence of integral and their
evaluation, convergence of sequence and series of real valued function and complex
valued functions

11
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

CO2: The students will be able to identify whether a set of real numbers and a function of
real variable is measurable.
CO3: The students will understand the requirement and the concept of the Lebesgue integral
(a generalization of the Riemann integration) along with its properties.
CO4: The students will be able to understand the fundamental results of integral calculus
and their applications.
CO5: The students will be able to understand the concepts of functions of bounded
variations and the absolute continuity of functions and the relations between them.
CO6: The students will be able to discuss concepts of outer measure in an abstract space
and integration with respect to a measure, Holder and Minkowski inequalities in 𝐿𝑝 -
spaces, and the notion completeness of 𝐿𝑝 --spaces and convergence in measures.

Unit-I 20 Marks
The Riemann - Stieltjes Integral: Definition and Existence of the integral, Properties of the
integral, Integration and differentiation, Integration of vector valued functions.

Unit-II 20 Marks
Sequences and Series of Functions: Uniform convergence, Uniform convergence and Continuity,
Uniform convergence and Integration, Uniform convergence and Differentiation, Equicontinous
Families of function, the Stone-Weierstress theorem.

Unit-III 20 Marks
Lebesgue Measure and Integral: Introduction, Outer measure, Measurable sets and Lebesgue
measure, A non-measurable set, measurable function. The Riemann integral, The Lebesgue
integral of a bounded function over a set of finite measure. The Riemann integral, the Lebesgue
integral of a bounded function over a set of finite measure, the integral of a non-negative
function, the general Lebesgue integral.

Unit-IV 20 Marks
Differentiation and Integration: Differentiation of monotone functions, Functions of bounded
variations, Differentiation of an integral, absolute continuity. The 𝐿𝑝 spaces, the Holder and
Minkowski inequalities, Convergence and Completeness, Bounded linear functionals on the
𝐿𝑝 spaces spaces.

12
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Books Recommended:

1. Walter Rudin: Principles of Mathematical Analysis, Third Edition, McGraw-Hill Int. Edition.
Unit-I Chapter - 6(6.1-6.25),
Unit-II Chapter-7(7.1 to 7.27)

2.H. L. Royden: Real Analysis, Third Edition, MacMillan Publishing Co., Inc., New York.
Unit-III Chapter-3(1 to 5), Chapter-4(1 to 4)
Unit-IV Chapter-5(1 to 4), Chapter-6.

Book for References:

G. de Barra: Measure Theory and Integration, New Age Int. (P) Ltd, 2000.

M 1.1.3 (Complex Analysis)

Full Marks: 100 (Mid Semester: 20, End Semester: 80) CREDIT-4

Course Objectives:

1. The course on complex analysis is aimed to introduce the theories of functions of

complex variables; analytic functions and their power series representation; Mobius
transformation;
2. Know the application of Cauchy’s theorem, Cauchy integral formula and residue theorem
to evaluate contour integration.

Learning Outcomes:

CO1: The students will be able to analyze limit, continuity and differentiation of functions of
complex variables.
CO2: The students will be able to apply concepts of Cauchy-Riemann equations, harmonic
functions and analytic functions, understand the concept of Mobius transformation and its
properties.
CO3: The students apply Cauchy’s Theorem and Cauchy’s Integral Formula to evaluate
complex integrations.
CO4: The students will be able to identify the type of singularities and residues and apply
residue theorem to evaluate the complex integrals.

13
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Unit – I 20 Marks
Elementary Properties of Analytic Functions: Power series, Analytic functions, Cauchy-Riemann
equations, Branches of many valued functions.

Unit – II 20 Marks
Analytic functions as mappings, Mobius transformations, Complex integration.

Power series representation of analytic functions, Zeros of an analytic functions.

Unit – III 20 Marks

Index of a closed curve, Cauchy's theorem and Integral formula, Counting zeros, Open mapping
theorem, Goursat's theorem

Unit – IV 20 Marks
Singularities and Classifications, Laurent series, Residues evaluation of integrals, Argument
principle, Rouche's theorem. The Maximum modulus theorem, the Maximum principle,
Schwartz’s lemma.

Book Recommended:

J. B. Conway: Functions of one Complex Variable, Springer-Verlag, International Student-

Edition, Narosa Publishing House, 1980.

Unit-I Chapter -III

Unit-II Chapter –III, IV

Unit-III Chapter -IV

Unit-IV Chapter –V, Chapter –VI (except 3, 4)

M 1.1.4 (Topology)
Full Marks: 100 (Mid Semester: 20, End Semester: 80) CREDIT-4

Course Objectives:

1. The main objective of this course is to make the student aware of topology, which is the
major branch of modern mathematics.

14
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

2. This course is used in many branches of mathematics, such as differentiable equations,

Riemann surfaces in complex analysis etc. the pre-requisites are sets, relations and
functions and countability.
3. The course is designed to introduce the students to elementary properties of topological
spaces and structures defined on them, maps between the topological spaces.
Learning Outcomes:

CO1: The students will be able to understand the elementary properties of topological spaces
and structures defined on them.
CO2: The students will be able to identify maps between topological spaces.
CO3: The students will be able to understand the concepts of metric spaces and their role in
mathematics.
CO4: The students will be able to apply the concepts learned in this course to prove the basic
results about completeness, connectedness and convergence within these structures.
CO5: The students will be able to understand the notion of separable spaces and separable
axioms, differentiating regular and normed spaces, components and path components,
Uryson lemma and Urysohn Metrization theorem.
Unit – I 20 Marks
Finite sets, Countable and uncountable sets, Infinite sets and the Axiom of choice, Well-ordered
sets.
Unit – II 20 Marks
Topological spaces, Basis for a topology, the Order topology, the Product topology on X × 𝑌,
the Subspace topology, Closed sets and limit points. Continuous functions.

Unit – III 20 Marks

Connectedness: Connected Spaces, Connected sets in the real line, Components and path
Components, Local Connectedness.

Compactness: Compact Spaces, Compact sets in the real line, Limit point compactness, Local
compactness.

Unit – IV 20 Marks
Countable axioms: First and second Countable Spaces, Lindel of Space, Separable Spaces.

Separable axioms: Hausdorff, Regular and Normal Spaces, Urysohn lemma, Urysohn
metrization theorem.

Book Recommended:

J. R. Munkres: Topology A First course, PHI.

Unit-I Chapter-1(1.6, 1.7, 1.9, 1.10); Unit –II Chapter-2(2.1-2.9)

15
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Unit-III Chapter -3(3.1-3.8); Unit-IV Chapter-4(4.1-4.4)

Book for References:

1. K. D. Joshi: Introduction to General Topology, Wiley Eastern Ltd., 1983.
2. W. J. Pervin: Foundation of General Topology, Academic Press, 1964.
3. S. Nanda and S. Nanda: General Topology, Macmillan India.

M 1.1.5 (Linear Algebra)

Full Marks: 100 (Mid Semester:20, End Semester:80) CREDIT-4

Course Objectives:
1. The main objective is to familiarize with algebra of linear transformations, representation
of transformations by Matrices, Linear functional, double dual,
2. Know the transpose of linear transformation, Modules, elementary canonical forms,
triangulation, and
3. Learn diagonalization, Jordan forms, computation of invariant factors, Inner product
spaces and bilinear forms.

Learning Outcomes:

CO1: The students will be able to understand linear transformations and algebra of linear
transformations. The students will be able to represent transformation by matrices and
vice-versa.
CO2: The students will be able to identify a basis for a double dual space. The students will be
able to acquire knowledge on primary decomposition theorem.
CO3: The students will be able to identify the different canonical forms of a given matrix, and
test the similarity of two matrices.
CO4: The students will be able acquire the knowledge of Inner product spaces with idea of
adjoints, unitary operators and normal operators.
CO5: The students will be able to identify by a test if a linear transformation is diagonalizable.

16
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Unit – I 20 Marks

Linear Transformations: Linear transformations, the Algebra of linear transformations,

Isomorphism, Representation of transformations by Matrices, Linear functional, the Double dual,
the transpose of linear transformation, Modules.

Unit – II 20 Marks
Elementary Canonical Forms: Introduction, Characteristic values , Annihilating polynomials,
Invariant Subspaces, Simultaneous Triangulation; Simultaneous Diagonalisation, Direct-sum
Decompositions, Invariant Direct sums, the Primary Decomposition Theorem.

Unit – III 20 Marks

The Rational and Jordan Forms: Cyclic subspaces and Annihilators, Cyclic Decompositions and
the Rational Form, the Jordan Form, Computation of Invariant Factors.
Inner Product Spaces: Inner Products, Inner Product Spaces, Linear Functional and Adjoints,
Unitary Operators, Normal Operators.

Unit – IV 20 Marks
Operators on Inner Product Spaces: Introduction, Forms on inner product spaces, Positive
Forms, More on Forms, Spectral Theory.
Bilinear Forms: Bilinear Forms, Symmetric Bilinear Forms, Skew-Symmetric Bilinear Forms.

Book Recommended:

K. Hoffman & R. Kunz: Linear Algebra, 2nd Edition, Pearson, 2018.

Unit-I Chapter-3(3.1-3.7), Chapter-5(5.5)

Unit-II Chapter-6(6.1-6.8); Unit-III Chapter-7(7.1-7.4), Chapter-8(8.1-8.5)

Unit-IV Chapter-9(9.1-9.5), Chpter-10(10.1-10.3)

17
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

SEMESTER-II
M 1.2.1 (Discrete Mathematics)
Full Marks: 100 (Mid Semester: 20, End Semester: 80) CREDIT-4

Course Objectives:

1. The course on discrete mathematics is aimed to provide the concept of relation and
digraphs, order relations, Hasse diagrams, lattices and operations on relations.
2. The students are introduced to graph theory and its applications; Boolean algebra; and
network flows.
Learning Outcomes:

CO1: The students will be able to acquire the knowledge on notion of directed graphs, special
properties of binary relations, order relations, lattices and operations on relations.
CO2: The students will be able to understand the basic concepts of graph and identify the
adjacency matrix of a graph.
CO3: The students will be able to acquire knowledge of the notions of planar, Eulerian and
Hamiltonian graphs, and bipartite graphs and their properties.
CO4: The students will be able to understand the four color problem, identify spanning trees of
graphs.
CO5: The students will be able acquire knowledge on basic operations in Boolean algebra and
identify equivalent truth table related to Boolean operations and Boolean expressions.
CO6: The students will be able to analyze and simplify Boolean functions by applying the basic
Boolean properties; and minimize Boolean functions by applying Karnaugh maps.
CO7: The students will be able to identify a model to study the flow of commodities as graphs
and apply the flow techniques to design network optimization problems.
Unit – I 20 Marks
Relations and Digraphs: Relation and directed graphs, Special properties of binary relations,
Equivalence relation, Order relations, Lattices, Enumerations, Operation on relations, Paths and
closures, Directed graphs and Adjacency matrices, Applications.

Unit-II

20 Marks
Graphs: Basic concepts, Isomorphic graphs, Sub-graphs, Trees and properties, Spanning trees,
Directed trees and Binary trees. Planar graphs, Euler formula, Multi graphs and Euler Circuits,
Hamiltonian graphs, Chromatic numbers, Four Color Problem.

Unit -III
20 Marks

18
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Boolean Algebras: Introduction, Boolean algebra, Boolean functions, Switching mechanisms,

Minimization of Boolean functions.
Unit- IV 20 Marks

Network flows: Graphs as models of flow of commodities, flows, Maximal flows and minimal
cuts, Max-flow Min-cut theorem, Applications.

Book Recommended:

J. L. Mott, A. Kandel and T. P. Baker: Discrete Mathematics for Computer Scientists and
Mathematician, 2nd Edition, Prentice-Hall of India Ltd.

Book for References:

Kenneth H Rosen: Discrete Mathematics and Its Applications, 7th Edition, McGraw Hill
Education Pvt. Ltd., 2016.

M 1.2.2 (Optimization Theory)

Full Marks: 100 (Mid Semester: 20, End Semester: 80) CREDIT-4

Course Objectives:

1. The main objective of this course is to make the student aware of different types of
optimization
2. Know its application through case study.

Learning Outcomes:
CO1: The students will be able to understand one-dimensional optimization, unconstrained
gradient-based optimization methods
CO2: The students will be able to acquire knowledge of linear programming, convex analysis,
duality, and dual simplex method.
CO3: The students will be able understand the notion of constrained optimization methods.
CO4: The students will acquire knowledge of both theory and applications of optimization.

Unit-I 20 Marks

19
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

One-Dimensional Optimization: Introduction, Function Comparison Methods, Polynomial

Interpolation methods, Iterative Methods.

Unit-II 20 Marks

Unconstrained Gradient based Optimization Methods: Gradient and Conjugate Gradient Type
Algorithms, Newton Type Methods, Quasi Newton Methods.

Unit-III 20 Marks

Linear Programming: Convex Analysis, Simplex Method, Finding Initial Solution, Duality, Dual
Simplex Method.

Unit-IV 20 Marks

Constrained Optimization Methods: Lagrange Multipliers, Kuhn-Tucker Conditions, Convex

Optimization, Transformation Methods, Linearization Methods, Direction Generation Methods.
Book Recommended:
M.C. Joshi and K.M. Moudgalya, Optimization: Theory and Practice, Narosa Publishing House,
2015.
Unit-I Chapter-2; Unit-II Chapter-3

Unit-III Chapter-4; Unit-IV Chapter-5

Book for References:

J.A. Snyman: Practical Mathematical Optimization, Springer Sciences, 2005.

M 1.2.3 (Probability Theory and Statistical Inference)

Full Marks: 100 (Mid Semester:20, End Semester:80) CREDIT-4

Course Objectives:

1. The aim of the course is to pay a special attention to role of random variables in the
probability theory, concept of Probability distributions and its properties,
2. Understanding of Weak Law of Large Numbers, Strong Law of Large Numbers and the
Central Limit Theorem with their applications, Theory of Estimation and Testing of
Hypothesis.

20
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Learning Outcomes:

CO1: The student will be able to understand the concepts of random variables, probability
distributions and independence of random variables related to measurable functions,
CO2: The students will be able to understand the concepts of measurable functions, sequence of
random variables, convergence, modes of convergence,
CO3: The students will be able to understand the concepts of weak and strong laws of large
numbers and central limit theorem,
CO4: The students will be able to apply various estimation methods and testing procedures to
deal to real life problems,
CO5: The students will be able to understand Fisher Information, Lower bounds to variance of
estimators, MVUE,
CO6: The students will be able to understand Neyman-Pearson fundamental lemma, UMP test,
Interval estimation and confidence interval.

Unit – I 20 Marks

Random Variables: Discrete random variables, Continuous random variables, Functions of

random variables, Joint Distributions: Discrete random variables, Continuous random variables,
independent random variables, Conditional Distributions, Functions of Jointly Distributed
random variables, Expected Values: Expected value of a random variable, Variance and Standard
deviation, Covariance and Correlation, Conditional expectation, moment generating function.

Unit II 20 Marks
Limit Theorems: Law of Large numbers, convergence in distribution, central limit theorem,
Distributions derived from normal distribution: chi-square, t and F distributions, Sample mean
and variance, Survey Sampling: Population parameters, Simple random sampling, Estimation of
a ratio.
Unit III 20 Marks

Estimation of Parameters: Parameter Estimation, method of moments, The method of Maximum

likelihood, Efficiency and the Cramer Rao Lower bound, Sufficiency, Factorization Theorem,
The Rao-Blackwell theorem.

Unit IV 20 Marks

Testing of Hypothesis: The Neyman-Pearson Paradigm, Optimal Tests, The Neyman-Pearson

Lemma, The duality of Confidence Intervals and Hypothesis Tests, The Generalized Likelihood
Ratio tests, Likelihood Ratio for Multinomial distribution, Test for Normality.
21
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Book Recommended:
John A. Rice: Mathematical Statistics and Data Analysis, Cengage Learning.

Book for References:

Larry Wasserman: All of Statistics-A Concise Course in Statistical Inference, Springer.

M 1.2.4 (Numerical Analysis)

Full Marks: 100 (Mid Semester:20, End Semester:80) CREDIT-4

Course Objectives:

1. Numerical analysis is an integral part of scientific computation. A strong background of

mathematical analysis is required for developing efficient numerical methods.
2. Therefore, this course in numerical analysis consists of both theoretical and
computational aspects.
3. Thus the main objective is to prepare the students for future research in this area.

Learning Outcomes

CO1: The students will be able acquire knowledge on approximation of functions.

CO2: The students will be able to identify the numerical solution of system of linear equations.
CO3: The students will be able to acquire the knowledge of different methods pertaining the
solution of ordinary differential equations
CO4: The students will be able to understand various types of interpolations.

Unit – I 20 Marks
Approximation of Functions: Weierstrass theorem and Taylor’s theorem, Minimax
approximation problem, Least square approximation problem, Orthogonal polynomials, Least
square approximation problem (Continued).

Unit – II 20 Marks
Numerical Solution of Systems of Linear Equations: Gaussian Elimination, pivoting and scaling
in Gaussian Elimination, Variants of Gaussian Elimination, Error analysis, Residual correction
method, Iteration methods, Error prediction and acceleration.

22
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Unit – III 20 Marks

Numerical Methods for Ordinary Differential Equations: Existence, uniqueness and stability
theory, Euler’s method, Multistep methods, Midpoint methods, Trapezoidal method, Low-
order predictor-corrector algorithm, Derivation of higher order multistep methods,
Convergence and Stability for multistep methods.

Unit - IV 20 Marks
Eigen value location, error and stability results; Hermite Interpolation, Piecewise
polynomial interpolation (Cubic Spline Interpolation, B-Spline curves).

Book Recommended:
Kendall E. Atkinson: An introduction to Numerical Analysis, 2nd Edition, Wiley.
Unit-I Chapter-4(4.1-4.5)
Unit-II Chapter-8(8.1-8.7)
Unit-III Chapter-6(6.1-6.8)
Unit-IV Chapter-3(3.6, 3.7), Chapter-9(9.1)

M 1.2.5 (Functional Analysis)

Full Marks: 100 (Mid Semester:20, End Semester:80) CREDIT-4

Course Objectives:

1. The main objective of this course is familiarize the students to the ideas and some of the
fundamental theorem of functional analysis, to cover theoretical needs of partial differential
equation, measure theory and other branches of mathematics.
2. It aims to study normed linear spaces and some of linear maps between them. Further, the
objective of the course is the study of the main properties of uniform boundedness along
with open mapping theorem.
3. Also, the students will be familiarized with the basic results associated to different types of
convergences in normed spaces and some of its applications.
4. Another objective of this course aims at duality and Inner product spaces with formation of
orthonormal sets. The prerequisites of this course are set theory and algebra of functions.

Learning Outcomes

CO1: The students will be able to understand to recognize the fundamental properties of
normed spaces and of the transformation between them.
23
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

CO2: The students will be able to understand inner product spaces

CO3: The students will be able to apply the concepts learned in this course to construct
orthonormal sets.
CO4: The students will be able to identify the correlation between functional analysis and the
problem arising in uniform boundedness along with concept of closed graph and open
mapping theorems.

Unit-I 20 Marks

Normed spaces, Continuity of Linear maps, Hahn- Banach theorems.

Unit-II 20 Marks

Uniform Boundedness Principle, Closed Graph and Open Mapping Theorems.

Unit-III 20 Marks

Duals and Transposes.

Unit-IV 20 Marks

Inner Product Spaces, Orthonormal Sets, Riesz Representation Theorems.

Book Recommended:
B.V. Limaye: Functional Analysis, 3rd Edition, New Age International Ltd., 2015.

Unit-I Chapter- II ( 5.1-5.5, 6.1-6.3, 6.6, 7.5, 7.8 )

Unit-II Chapter III ( 9.1, 10.1, 10.2, 10.6, 11.1)

Unit-III Chapter IV ( 13.1-13.4)

Unit-IV Chapter VI( 21, 22.1, 22.4--22.7, 24.1-24.3)

Book for References:

Erwin Kreyszig: Introductory Functional Analysis with Applications, Wiley Student Edition,
2010.

24
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

SEMESTER-III
M 2.3.1 (Operator Theory)
Full Marks: 100 (Mid Semester: 20, End Semester: 80) CREDIT-4

Course Objectives:

1. The main objective of this course is to familiarize the students with Adjoint operators,
Spectral theory in finite dimensional normed spaces
2. Know Banach algebra and their properties
3. Study Compact linear operators with their spectral properties, Self-adjoint linear operators,
Projection operators
4. Learn unbounded linear operators, Hilbert adjoint operators, Closed linear operators.

Learning Outcomes:

CO1: The students will be able to acquire knowledge about different types of operators such as
adjoint, unitary, and normal.
CO2: The students will be able to understand the notion of spectral theory of bounded linear
operators, compact linear operators and study their resolvent and spectrum.
CO3: The students will be able to acquire the knowledge about Banach algebra, positive
operators and projection operators.
CO4: The students will be able to acquire the knowledge about Hilbert-adjoint operator,
unbounded linear operators, and study their properties.
CO5: The students will be able to understand the notion of spectral properties of Self-adjoint
linear operators, Hilbert-adjoint operator, closed linear operator and closures.

Unit-I 20 Marks

Hilbert –Adjoint Operator, Self-Adjoint, Unitary and Normal Operators. Spectral Theory in finite
dimensional normed spaces, Basic concepts, Spectral properties of Bounded Linear Operators,
Further properties of Resolvent and Spectrum.

25
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Unit-II 20 Marks
Banach Algebras, Further properties of Banach Algebras. Compact Linear Operator on normed
spaces, Further properties of Compact Linear Operators, Spectral properties of Compact Linear
Operators on normed spaces.

Unit-III 20 Marks

Spectral properties of Bounded Self-Adjoint Linear Operators, Further Spectral properties of

Bounded Self-Adjoint Linear Operators. Positive Operators, Projection Operators.

Unit-IV 20 Marks

Unbalanced Linear Operators and their Hilbert-Adjoint Operators, Hilbert-Adjoint Operators,

Symmetric and Self-Adjoint Linear Operators, Closed Linear Operators and Closures, Spectral
properties of Self-Adjoint Linear Operators.

Book Recommended:
Erwin Kreyszig: Introductory Functional Analysis with Applications, Wiley Student Edition,
2010.
Unit-I Chapter- 3(3.9, 3.10), Chapter-7(7.1-7.4)

Unit-II Chapter-7 (7.6, 7.7), Chapter-8(8.1-8.3)

Unit-III Chapter-9 (9.1-9.3, 9.5)

Unit-IV Chapter -10(10.1-10.4)

M 2.3.2 (Differential Equations)

Full Marks: 100 (Mid Semester:20, End Semester:80) CREDIT-4

Course Objectives:

1. The main objective of teaching this paper is to prepare the students to learn different
methods for solving ordinary differential equations and boundary value problems.
2. They can acquire advance phase of knowledge and their applications to real life problems.

26
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Learning Outcomes:

CO1: The students will be able to understand the boundary value problems and its method of
solution, power series solution and special functions.
CO2: The students will be able to understand Picard’s theorem, Fixed point theorem, Fourier
series and Fourier transform.
CO3: The students will be to acquire the knowledge on how to solve Wave equation, Laplace
equation and Diffusion equation applying Fourier series and Fourier transforms
CO4: The students will be able to apply Fourier series and Fourier transforms to BVPs.

Unit – I 20 Marks
Boundary Value Problems for ODEs: Introduction, Sturm-Liouville problem, Orthogonality of
eigen functions; Green's functions, Solution of BVP using the appropriate Green’s functions.

Power Series Solutions and Special Functions: Series solution about an ordinary point, Legendre
equation and Legendre polynomial, Power series solution about singular points(Frobenius
method), Bessel’s equation and Bessel functions. Properties of Bessel functions.

Unit – II 20 Marks

Existence and Uniqueness of Solutions: Introduction, Lipschitz condition &Lipschitz constant,

Gronwall Inequality, Successive approximations, Picard’s theorem, Continuation and
dependence on initial conditions, Existence of solutions in the large, Existence and uniqueness of
solutions of systems, Fixed point method.

Unit – III 20 Marks

Fourier Series and Fourier Transform: Periodic functions and Fourier series, Fourier series for a
function with arbitrary period, Half-range Fourier series; Fourier transform, Application of
Fourier series and Fourier transforms to BVPs.

Wave Equation: Solution of the one-dimensional wave equation, D'Alembert's solution of the
wave equation, three-dimensional wave equation, n-dimensional wave equation, Solution of
wave equation by method of Fourier transforms.

27
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Unit – IV 20 Marks
Laplace Equation: Boundary value problem for Laplace’s equation, Fundamental or Elementary
solution of Laplace’s equation, Integral representation of harmonic functions, Mean value
formula for harmonic functions, Green's function for Laplace's equation, Solution of the
Dirichlet problem for a ball, Solution of Laplace’s equation by separation of variables, Solution
of Laplace's equation for a disk.
Diffusion Equation: Elementary solution of one-dimensional diffusion equation, Method of
separation of variables, Solution of diffusion equation in n-dimensions using method of Fourier
transforms.
Books Recommended:

1. S. G. Deo, V. Lakshmikantham and [Link]: Text Book of Ordinary

Differential Equations, 2nd Edition, TMH, 2011.
Unit-II Chapter-5
2.J. Sinha Roy and S. Padhy: A Course on Ordinary and Partial Differential

Equations, Kalyani Publishers, 4th Edition, 2014.

Unit-I Chapter-10(10.1-10.3), Chapter-7(7.1-7.3.1, 7.4-7.4.2)
Unit-III Chapter-14(14.1-14.6), Chapter-16(16.1-16.5)
Unit-IV Chapter-15(15.1-15.5), Chapter-17(17.1-17.4)

28
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

M 2.3.3 (Computer Programming)

Full Marks: 100
(Exp-60, Viva - 20, Record – 20) CREDIT-4
Course Objectives:

1. The main objective of teaching this paper is to compute different problems pertaining to
statistical and numerical methods using MATLAB / MATHEMATICA / MAPLE /
SCILAB/ PYTHON etc.
Learning Outcomes:
CO1: The students will be able to analyse the concepts of using of MATLAB /
MATHEMATICA / MAPLE / SCILAB/ PYTHON etc. in computation of mean and
standard deviation, Pearson’s coefficient of correlation,
CO2: The students will be able to apply the notion of Gauss elimination, Gauss Jordern
elimination to solve a system of linear equations.
CO3: The students will be able to identify the Eigenvalues and Eigen vectors using
programming.
CO4: The students will be able to apply programming in Runge Kutta’s method to solve initial
value problem involving an ODE.
CO5: The students will be able to understand the implementation of minimax approximation by
Chebyshev’s polynomials.
CO6: The students will be able to identify the approximate value of a definite integral by
Newton-Cotes and Gauss quadrature rule.

PRACTICAL/LAB WORK TO BE PERFORMED ON A COMPUTER

Use of computer aided software (CAS), for example MATLAB / MATHEMATICA / MAPLE /
SCILAB/ PYTHON etc., for developing the following Numerical programs:
1. To calculate mean & standard deviation.
2. To calculate Pearson’s coefficient of correlation.
3. To find area under a curve.
4. Gauss elimination.
5. To find eigen values & eigen vectors.

29
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

6. Runge-Kutta methods.
7. Finding minimax approximation to 𝑒 by Chebyshev’s polynomials.
8. Approximating definite integral by Newton-Cotes, Gauss quadrature rule.

Elective-A [M 2.3.4 (Paper-I)]

1. Operations Research-I
Full Marks: 100 (Mid Semester: 20, End Semester: 80) CREDIT-4

Course Objectives:

1. The main objective of this paper is to make the student aware of some numerical
techniques of operations research.

Learning Outcomes:

CO1: The students will be able to understand about Integer programming problems
CO2: The students will be able to acquire about Goal programming problems.
CO3: The students will be able to understand the advanced techniques of linear programming
problem and Queuing theory.
CO4: The students will be able to acquire the knowledge of different methods to solve different
problems of operations research.

Unit-I 20 Marks
Integer Programming Problem, Goal Programming.

Unit-II 20 Marks
Sequencing Problems, Dynamic Programming

Unit-III 20 Marks
Linear Programming Problem-Advanced Techniques.

Unit-IV 20 Marks
Queuing Theory-Introduction to Poisson Queuing Systems.

Book Recommended:
Kanti Swarup, P. K. Gupta and Man Mohan: Operations Research, Sultan Chand & Sons,
NewDelhi, 2020.
Unit-I Chapter-7, Chapter-8.
30
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Unit-II Chapter-12, Chapter-13

Unit-III Chapter-9
Unit-IV Chapter-21(21.1-21.9)

2. Number Theory and Cryptography-I

Full Marks: 100 (Mid Semester:20, End Semester:80) CREDIT-4

Course Objectives:

1. The main objective of this course is to build up the basic theory of the integers, prime
numbers and their primitive roots
2. Know the theory of congruence, quadratic reciprocity law and number theoretic functions,
finite fields and Quadratic Residues, finite fields
3. To acquire knowledge in cryptography especially in RSA encryption and decryption,
enciphering matrices.

Learning Outcomes:

Upon successful completion of this course students will able to

CO1: The students will be able to understand the basic definitions and theorems in number
theory.
CO2: The students will be able to identify the order of an integer, primitive roots, Euler's
criterion, the Legendre symbol, Jacobi symbol and their properties.
CO3: The students will be able to acquire knowledge of the basic concepts of finite field.
CO4: The students will be able to understand modular arithmetic number-theoretic functions
and apply them to cryptography.

Unit - I 20 Marks

Some Topics in Elementary Number Theory, Divisibility and the Euclidean algorithm.

Unit-II 20 Marks

Congruence’s, Some applications to Factoring.

Unit - III 20 Marks

Finite Fields and Quadratic Residues Finite fields, Quadratic residues and reciprocity.

Unit – IV 20 Marks

31
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Cryptography, Same simple cryptosystem, Enciphering matrices.

Book Recommended:
Neal Koblitz: A Course in Number Theory and cryptography, 2nd Edition, Springer.

Chapter -I (2, 3, 4), II, III.

3. Computational Finance-I
Full Marks: 100 (Mid Semester: 20, End Semester: 80) CREDIT-4

Course Objectives:

1. Computational Finance aims to introduce students to the market tools required for analyzing
the financial markets
2. Helps to model various financial instruments
3. Learn to find solutions of the problems faced by various players of these markets.

Learning Outcomes:

After successful completion of this course, student will be able to

CO1: The student will be able to understand the intricacies of the market derivatives.
CO2: The students will be able to analyze the intricacies of derivatives quantitatively.
CO3: The students will be able to model and analyze the jumps observed in security markets
CO4: The students will be able to acquire knowledge which will enable them to take up
research to be able to attempt to fill the gap between the markets and academics.
Unit-I 20 Marks

Basic concepts of Financial – Stock options, Forward and futures, Speculation, Hedging, Put-call
parity, Principle of non-arbitrage pricing, Computation of volatility Derivation of Black-Scholes
differential equation and Black –Scholes Option Pricing formula.

Unit-II 20 Marks

Greeks and Hedging strategies. Finite difference methods for partial differential methods- finite
difference approximation to derivatives, Explicit and Implicit methods for parabolic equations.

32
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Unit-III 20 Marks

Iterative methods for solution of a system of liner algebraic equations, two dimensional parabolic
equations, alternating-direct implicit method, convergence, stability and consistency of finite
difference schemes.

Unit-IV 20 Marks

Binomial pricing models, Explicit and implicit finite difference methods for European and
American options, Monte Carlo simulation.
Books Recommended:

1. J Bax and G Chacko: Financial Derivatives: Pricing, Applications and

Mathematics-Cambridge University Press, 2004.
2. G. D. Smith: Numerical Solution of Partial Differential Equations, Oxford
University Press.
3. P. Wilmott: Qualitative Finance, John Wiley, 2000.

4. Fuzzy Sets and their Application-I

Full Marks: 100 (Mid Semester:20, End Semester: 80) CREDIT-4

Course Objectives:
1. The main objective of this paper is to guide the students to learn Fuzzy sets,
2. Know relations and their applications to real life problems.
Learning Outcomes:

CO1: The students will be able to understand the basic concepts of Fuzzy sets
CO2: The students will be able to acquire the knowledge of operations of Fuzzy sets, Zadeh’s
extension principle image, and inverse image of Fuzzy arithmetic.
CO3: The students will be able to understand the notion of Fuzzy relation and Fuzzy graphs.
CO4: The students will be able to understand the comparison between the possibility theory
and the probability theory.

33
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Unit – I 20 Marks

Fuzzy sets - Basic definition a -level sets. Convex fuzzy sets. Baic operations Fuzzy sets. Type of
Fuzzy sets. Cartesian products. Algebraic products. Bounded sum and difference t-norms and t-
conorms.

Unit-II 20 Marks

The extension Principle- The Zadeh’s extension principle image and inverse image of Fuzzy
arithmetic.

Unit – III 20 Marks

Fuzzy Relation and Fuzzy Graphs-Fuzzy equivalence equations. Fuzzy graphs, Similarity
relation.

Unit - IV 20 Marks

Possibility theory-Fuzzy measures, Evidence theory necessity measure, Possibility theory versus
probability theory.

Books Recommended:

1. U. Z. Zimmermann: Fuzzy Set Theory and its Application, Allied Publisher, New
Delhi,1991.

2. G J Klir & B Yuan: Fuzzy Set and Fuzzy Logic, Prentice Hall of India, New Delhi, 1995.

34
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

5. Data Science-I
Full Marks: 100 (Mid Semester:20, End Semester: 80) CREDIT-4

Course Objectives:

1. The objective of this course to comprehend the idea of Linear Methods for Regression and
Classification
2. To discuss Model Assessment and Selection, Additive Models, Support Vector Machines
(SVM).

Learning Outcomes:

CO1: The students will be able to understand the basic idea of regression models and least
squares.
CO2: The students will be able to understand the apply the notion of Multiple regression.
CO3: The students will be able to acquire knowledge of the notion of Logistic regression.
CO4: The students will be able to understand the concepts of Bootstrap methods, conditional
and expected test error.
CO5: The students will be able to acquire knowledge of Support Vector Machines (SVM),
SVM for regression.

Unit - I 20 Marks

Linear Methods for Regression and Classification: Overview of supervised learning, Linear
regression models and least squares, Multiple regression, Subset selection, Ridge regression,
least angle regression and Lasso, Linear Discriminant Analysis, Logistic regression.

Unit - II 20 Marks

Model Assessment and Selection: Bias, Variance and model complexity, Bias-variance trade off,
Optimism of the training error rate, Estimate of In-sample prediction error, Effective number of
parameters, Bayesian approach and BIC, Cross-validation, Boot strap methods, conditional or
expected test error.

Dimensionality reduction (PCA, Kernel PCA, Independent Component analysis, ISOMAP, LLE,
feature Selection, Non-negative matrix factorization and collaborative filtering).

35
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Unit - III 20 Marks

Additive Models, Trees and Boosting: Generalized additive models, Regression and
classification trees, Boosting methods-exponential loss and AdaBoost, Numerical Optimization
via gradient boosting, Examples ( Spam data, California housing , New Zealand fish,
Demographic data), random forests.

Unsupervised Learning and Random forests: Cluster analysis( k-means, Hierarchical clustering,
spectral clustering).

Unit-IV 20 Marks

Support Vector Machines(SVM) and K-nearest Neighbor: Basis expansion and

regularization,Kernel smoothing methods, SVM for classification, Reproducing Kernels, SVM
for regression.

K-nearest –Neighbour classifiers (Image Scene Classification), Gaussian mixtures and EM

algorithm.

Lab work (This can be examined as Mid Semester):

Implementation of following methods using PYTHON Software:

Simple and multiple linear regression, Logistic regression, Linear discriminant analysis, Ridge
regression, Cross-validation and boot strap, Fitting classification and regression trees, K-nearest
neighours, Principal component analysis, K-means clustering.

Books Recommended:

1. Trevor Hastie, Robert Tibshirani, Jerome Friedman: The Elements of Statistical

Learning-Data Mining, Inference and Prediction, 2nd Edition, Springer Verlag, 2009.
2. G. James, D. Witten, T. Hastie, R. Tibshirani: An Introduction to Statistical Learning
withApplications in R, Springer, 2013.

Book for References:

1. C. M. Bishop: Pattern Recognition and Machine Learning, Springer,2006

2. L. Wasserman: All of Statistics.

36
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Elective-B [M 2.3.5 (Paper-I)]

1. Fluid Dynamics-I
Full Marks: 100 (Mid Semester: 20, End Semester: 80) CREDIT-4

Course Objectives:

1. The course on fluid mechanics is devised to introduce fundamental concepts and notions
used in fluid dynamics;
2. Apply concepts of conservation of mass, momentum and energy to the fluid flows;
3. Understand the role of governing non-dimensional parameters in flow dynamics;
4. Study analytical solutions to variety of simplified problems.

Learning Outcomes:

CO1: The students will be able to understand the types of flows, the fundamental properties of
fluids and stress-strain relationship in fluids.
CO2: The students will be able to derive the equations of continuity, momentum, and energy
applied to fluid motions.
CO3: The students will be able to apply dimensional analysis to predict physical parameters
that influence the fluid flow.
CO4: The students will be able to identify and analyze the solution governing equations of a
fluid motion with simplified Navier-Stokes equation.
Unit – I 20 Marks
Basic Concepts.

Unit – II 20 Marks
Fundamental Equations of the Flow of Viscous Fluids.
Unit – III 20 Marks
Dynamical Similarity and Inspection & Dimensional Analysis.

Unit – IV 20 Marks
Exact Solutions of the Navier-Stokes’ Equations.

Book Recommended:

J. L. Bansal: Viscous Fluid Dynamics, Oxford & IBH Publishing Co. Pvt. Ltd., New Delhi.

37
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Unit-I Chapter -1
Unit-II Chapter –2

Unit-III Chapter -3(3.1-3.4, 3.8, 3.9)

Unit-IV Chapter –4(4.1-4.6)

2. Numerical Solution of Differential Equations-I

Full Marks: 100 (Mid Semester:20, End Semester:80) CREDIT-4

Course Objectives:

1. In view of wide application of numerical solution of differential equations in tackling

physical problems occurring in science and technology, there is a need to built the foundation
of the students in this topic.

Learning Outcomes:

CO1: The students will be able to understand the different techniques of numerical solution of
ordinary differential equation such as: Euler method, Backward Euler method and their
error analysis.
CO2: The students will be able to understand different methods for solving initial value
problems (IVPs) such as: Adams–Bashforth methods, Adams–Moulton methods and their
error analysis.
CO3: The students will be able to acquire the knowledge of the methods to solve boundary
value problems (BVPs).
CO4: The students will be able to identify the solution of initial value and boundary value
problems by applying finite difference methods, Shooting methods and Collocation
methods.

Unit-I 20 Marks

Ordinary Differential Equations (ODE): Solutions of Initial value problems by Euler’s method,
Error analysis of Euler’s method, Asymptotic error analysis, Numerical stability; Backward
Euler method and the Trapezoidal method.

Unit-II 20 Marks

38
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Ordinary Differential Equations(ODE): Solutions of Initial value problems by Taylor methods;

Runge–Kutta methods, A general framework for explicit Runge–Kutta methods, Convergence,
Stability and Asymptotic error, Error prediction and control, Implicit Runge–Kutta methods,
Two-point Collocation methods.
Unit-III 20 Marks
Multistep Methods: Adams–Bashforth methods, Adams–Moulton methods, Truncation error,
Convergence, A general error analysis, Stability theory, Convergence theory, Relative stability
and weak stability.
Unit-IV 20 Marks
Two-point Boundary Value Problems: A finite-difference method, Convergence, Numerical
examples, Boundary conditions involving the derivative; Nonlinear two-point boundary value
problems, Finite difference methods, Shooting methods, Collocation methods.
Book Recommended:
Kendall E. Atkinson, Weimin Han and David E. Stewart: Numerical Solution of Ordinary
Differential Equations, Wiley, 2009.
Book for References:
1. Kendall E. Atkinson: An Introduction to Numerical Analysis, 2nd Edition, Wiley.
2. S. S. Sastry: Introductory methods of Numerical Analysis, 5th Edition, PHI.

3. Design and Analysis of Algorithms – I

Full Marks: 100 (Mid Semester:20, End Semester:80) CREDIT-4

Course Objectives:

1. The main objective of this paper is to prepare the students for designing algorithms of
different numerical methods and their analysis.
2. With this knowledge the students can write efficient computer programmes in future.

Learning Outcomes:
CO1: The students will be able to understand the different methods of preparing algorithms of
problems having computation priority.
CO2: The students will be able to acquire knowledge on elementary data structures.
CO3: The students will be able to apply dynamic problems matrix chain multiplication,
accounting methods.

39
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

CO4: The students will be able to apply different types of analysis based on designing
algorithm.

Unit - I 20 Marks

Growth of Functions: Asymptotic notation, Standard notations and common functions. Divide-
and-Conquer: The maximum-subarray problem, Strassen’s algorithm for matrix multiplication,
The substitution method for solving recurrences, The recursion-tree method and the master
method for solving recurrences.

Unit - II 20 Marks

Heapsort: Heaps, Maintaining the heap property, Building a heap, The heap sort algorithm,
Priority queues. Quicksort: Description of quicksort, Performance of quicksort, A randomize ed
version of quicksort, Analysis of quicksort. Sorting in Linear Time: Lower bounds for sorting,
Counting sort, Radix sort, Bucket sort.

Unit - III 20 Marks

Elementary Data Structures: Stacks and queues, Linked lists, Implementing pointers and objects,
Representing rooted trees. Binary Search Trees: What is a binary search tree? , Querying a binary
search tree, Insertion and deletion. Red-Black Trees: Properties of red-black trees, Rotations,
Insertion, Deletion.

Unit-IV 20 Marks

Dynamic Programming: Matrix-chain multiplication, Elements of dynamic programming,

Longest common subsequence. Greedy Algorithms: An activity-selection problem, Huffman
codes. Amortized Analysis: Aggregate analysis, The accounting method, The potential method.

Books Recommended:

1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein:

Introduction to Algorithms, 3rdEdition, Prentice Hall of India.
2. E. Horowitz & S Sahni: Fundamentals of Computer Algorithm.

3. Aho, Hopcraft, Ullman: The Design and Analysis of Computer Algorithms,

40
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Pearson Education, 2008.

4. LEE: Design & Analysis of Algorithms (POD), Mc-Graw Hill.

4. Stochastic Processes-I
Full Marks: 100 (Mid Semester:20, End Semester:80) CREDIT-4

Course Objectives:

1. The main objective of this course is to develop awareness for the use of stochastic models for
representing random phenomena evolving in time such as inventory or queuing situations or
stock prices behavior.

Learning Outcomes:

CO1: The students will be able to apply the notions of long-time behaviour including
transience, recurrence, and equilibrium in applied situations such as branching processes
and random walk.
CO2: The students will be able to identify and analyze the transition matrices for Markov
dependent behaviour
CO3: The students will be able to understand the methods of information processing.
CO4: The students will be able to apply the selected statistical distributions for modeling
various phenomena.
CO5: The students will be able to understand the principles and objectives of model building
based on Markov chains, Poisson processes.

Unit-I 20 Marks

Stochastic Processes, specification of stochastic process, stationary process, martingales, random

walk and ruin problems, expected duration of the game, generating function of the duration of
the game and for the first passage times, random walk in the plane and space.

Unit-II 20 Marks

Markov chains – Definition and Examples, Higher Transition probabilities, Generalisation of

Independent Bernoulli trials: Sequence of chain dependent trials, classification of states and
chains, and related problems. Determination of higher transition probabilities.

41
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Unit-III 20 Marks

Stability of a Markov system, graph theoretic approach, Markov chain with denumerable
number of states, reducible chains, statistical inference for Markov chains, markov chains with
continuous state space, non-homogeneous chains.

UNIT-IV 20 Marks

Markov processes with discrete state space – Poisson process, poison process and related
distributions. Generalization of Poisson process, birth and death process, Markov Processes with
discrete state space.

Books Recommended:

Medhi, J.: Stochastic Processes, 3rdEdition, New Academic Science.

Book for References:

Sheldon M. Ross: Stochastic Processes, 2nd Edition, Wiley.

SEMESTER-IV
M 2.4.1 (Differential Geometry)
Full Marks: 100 (Mid Semester:20, End Semester:80) CREDIT-4

Course Objectives:

1. The main objective of teaching this paper is to make the student aware of abstract knowledge
about differential geometry.

Learning Outcomes:

CO1: The students will be able to understand topological manifold, abstract manifold, tangent
space.
CO2: The students will be able to acquire knowledge about vector fields, differentiable
manifolds and bilinear forms.
CO3: The students will be able to analyze and interpret Riemannian manifolds as metric spaces.
CO4: The students will be able to acquire knowledge about tensor fields, different types of
multiplications of tensors and exterior differentiation.

Unit - I 20 Marks
Topological Manifold, Cutting and Pasting, Abstract Manifolds, The Space of Tangent Vectors
at a point of 𝑅𝑛, Another definition of 𝑇𝑎(𝑅𝑁).
42
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Unit - II 20 Marks
Vector Fields on Open Subsets of 𝑅𝑛, The Inverse Function theorem, The definition of a
Differentiable Manifolds.

Unit - III 20 Marks

The tangent Space at a point of a Manifold, Vector Fields, Tangent Co-vectors, Bilinear Forms,
The Riemannian Metric, Riemannian Manifolds as Metric Spaces.

Unit - IV 20 Marks
Tensor Field, Multiplication of Tensors, Exterior differentiation, Differentiation of Vector
Fields on Sub-manifolds of 𝑅𝑛, Differentiation on Riemannian Manifolds.

Book Recommended:

William M. Boothby: An introduction to Differentiable Manifolds and Riemannian

Geometry, Academic Press, New York.

Unit –I: Chapter-I (3, 4, 5), Chapter-II ( 3, 4)

Unit –II: Chapter-II (5, 6), Chapter-III (1)

Unit –III: Chapter-IV (1, 2), Chapter-V(1, 2, 3)

Unit-IV: Chapter-V(5, 6, 8), Chapter-VII( 2, 3)

M 2.4.2 (Advanced Calculus)

Full Marks: 100 (Mid Semester:20, End Semester:80) CREDIT-4

Course Objectives:

1. The aim of the course is to comprehend the concepts of variation and its properties,
introductory concepts of integral equations, homogenous Fredholm equations with kernels,
solutions of Fredholm and Voltera integral equations by successive approximation method,
introductory concepts involving matrix calculus.

Learning Outcomes:

CO1: The students will be able to understand the variational problems with fixed boundaries,
the variational problems involving functionals and variational problems in parametric

43
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

form,

44
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

CO2: The students will be able to understand the concepts of integral equations and kernels, the
methods to transform ordinary differential equations into integral equations,
CO3: The students will be able to identify the solution of Fredholm and Volterra integral
equations and finding iterative and resolvent kernels by method of approximation.
CO4: The students will be able to acquire knowledge of the introductory concepts of matrix
calculus such as differential and vector calculus, Kronecker product, Hessian, Maximum
likelihood

Unit-I 20 Marks

Variational Problems with Fixed Boundaries: Concept of variation and its properties, Euler’s
equation, Variational problems for functionals of the form, Functionals dependent on functions
of several independent variables, Variational problem in parametric form.

Unit-II 20 Marks

Integral Equation, linear and nonlinear integral equations, Fredholm integral equation, Volterra
integral equation, Special kind of kernels, Iterated kernels, or functions, Resolvent kernels or
Reciprocal kernels, Eigen values, Eigen functions, Leibnitz rule, Conversion of ordinary
differential equation into integral equation.

Unit-III 20 Marks

Homogenous Fredholm integral equations of the second kind with separable kernel or degenerate
kernels, Fredholm integral equations of the second kind with separable kernel.
Method of successive approximations: Iterated kernel, Resolvent kernel, Solution of Fredholm
integral equation of the second kind by successive approximations, Solution of Volterra integral
equation of the second kind by successive approximations.

Unit-IV 20 Marks

Matrix Calculus: Introduction, Differentials, Vector calculus, Optimization, Least squares,

Matrix calculus, Interlude on linear and quadratic forms, The second differential, Chain rule for
second differentials, Four examples, The Kronecker product and vector operator, Identification,
The commutation matrix, From second differential to Hessian, Symmetry and the duplication
matrix, Maximum likelihood.

Books Recommended:

45
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

1. A. S. Gupta: Calculus of Variations with Applications, PHI, 2015.

Unit-I Chapter –1(1.1-1.6)
2. M. D. Raisinghania: Integral Equations and Boundary Value Problems, 8th Edition, S.
Chand Publishing, 2015.
Unit-II Chapter –1(1.3-1.6, 1.8, 1.10, 1.11-1.14, 1.17, 1.18)
Chapter –2(2.1-2.6)
Unit-III Chapter –3(3.1-3.3), Chapter –4(4.1-4.2)
Chapter –5(5.1-5.3, 5.7-5.9, 5.11-5.13)
3. J. R. Magnus, H. Neudecker: Matrix Differential Calculus with Applications in Statistics
and Econometrics, 3rd Edition, John Wiley & Sons Ltd., 2019.
Unit-IV Chapter –18(18.1-18.16)
Book for References:

1. S. K. Pundir, R. Pundir: Integral Equations and Boundary Value Problems, 5th Edition,
Pragati Prakashan, 2014.
2. S. K. Pundir, R. Pundir: Calculus of Variations, 4th Edition, Pragati Prakashan, 2014.

Elective-A [M 2.4.3 (Paper-II)]

1. Operations Research-II
Full Marks: 100 (Mid Semester:20, End Semester:80) CREDIT-

Course Objectives:

1. The main objective is to make the student aware of non-linear programming models and the
methods of solutions.

Learning Outcomes:

CO1: The students will be able to understand notions of quadratic programming, separability
and Geometric programming.
CO2: The students will be able to acquire knowledge on Wolf’s and Beale’s method and
separable programming algorithm,
CO3: The students will be able to apply constrained and unconstrained solution of Geometric
programming hailed from arithmetic mean-geometric mean inequality.
46
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

CO4: The students will be able to understand what is inventory and how to minimize the total
cost in different situations.

Unit-I 20 Marks

Non-linear Programming.

Unit-II 20 Marks

Non-linear Programming Methods, Quadratic Programming (Wolfe’s and Beale’s Methods),

Separable Convex Programming, Separable Programming Algorithm.

Unit-III 20 Marks

Geometric Programming.

Unit-IV 20 Marks

Inventory Control-I.

Book Recommended:

Kanti Swarup, P. K. Gupta and Man Mohan: Operations Research, Sultan Chand & Sons,
NewDelhi, 2020.

Unit-I Chapter-27

Unit-II Chapter-28

Unit-III Chapter-29

Unit-IV Chapter-19(19.1-19.11)

2. Number Theory and Cryptography-II

Full Marks: 100 (Mid Semester:20, End Semester:80) CREDIT-4

Course Objectives:

1. The objective of this course to comprehend the idea of public key cryptography, RSA,
Discrete log, Knapsack,
2. Primality and factoring, Pseudo primes, the rho method, Format factorization and factor
bases, continued fraction method, Elliptic curve cryptosystem, Elliptic curve primality test.

47
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Learning Outcomes:

CO1: The students will be able to understand the basic idea of public key cryptography and
RSA.
CO2: The students will be able to understand the concepts of Discrete log, Knapsack, Primality
and factoring, Pseudo primes.
CO3: The students will be able to understand the rho method, Format factorization method, and
continued fraction method.
CO4: The students will be able to apply the concept of Elliptic curve and public cryptosystem.

Unit-I 20 Marks

Public Key, the idea of public key cryptography, RSA.

Unit-II 20 Marks

Discrete log, Knapsack, Primality and factoring, Pseudo primes.

Unit-III 20 Marks

The rho method, Format factorization and factor bases, continued fraction method.

Unit-IV 20 Marks

Elliptic curves, Basic facts, Elliptic curve cryptosystem, Elliptic curve primality test.

Book Recommended:

Neal Koblitz: A Course in Number Theory and Cryptography, Springer.

Chapter IV (1,2,3,4), V (1,2,3,4), VI (1,2,3)

48
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

3. Computational Finance-II
Full Marks: 100 (Mid Semester:20, End Semester:80) CREDIT-4

Course Objectives:

1. This course aims to enlighten the students on computational schemes and option on the
stock indices, Extensions of Black -Scholes models, Greeks and Hedging strategies, Finite
difference methods for partial differential equations, interest rates and their derivatives,
Heath-Jarrow-Merton model, Risk measurement and management.

Learning Outcomes:

CO1: The students will be able to understand the different options on stock markets such as
Exotic and Path dependent options, Barrier options, Asian options, Look back options,
computational Schemes, etc. Extensions of Black-Scholes model-such as discrete
Hedging, Transaction costs, volatility smiles, stochastic volatility, Jump diffusion,
dividend modeling, pricing models for multi-asset options, understand Greeks and
Hedging strategies,
CO2: The students will be able to apply the Finite difference approximation schemes to solve
partial differential equations, Explicit and Implicit methods for parabolic equations
CO3: The students will be able to acquire knowledge about the concepts of fixed income
products and analysis, swaps, one factor and multi-factor interest rate models, interest
rate derivatives, Heath-Jarrow-Merton model.
CO4: The students will be able to understand the concepts such as portfolio management, value
at risk, credit risk, credit derivatives, risk metrics and credit metrics.

Unit-I 20 Marks

Exotic and Path dependent options, Introduction, Barrier options, Asian options, Look back
options, computational Schemes, option on stock indices, Currencies and futures.

Unit-II 20 Marks
Extensions of Black-Scholes model- Limitations of Black-Scholes model, Discrete Hedging,
Transaction costs, volatility smiles, stochastic volatility, Jump diffusion, dividend modeling,
pricing models for multi-asset options.

49
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Unit-II 20 Marks
Greeks and Hedging strategies. Finite difference methods for partial differential methods- finite
difference approximation to derivatives, Explicit and Implicit methods for parabolic equations

Unit-III 20 Marks

Interest rates and their derivatives: Fixed income products and analysis (yield, duration and
convexity), swaps, one factor and multi-factor interest rate models, interest rate derivatives,
Heath-Jarrow-Merton model.

Unit-IV 20 Marks

Risk measurement and management, Portfolio management, value at risk, credit risk, credit
derivatives, risk metrics and credit metrics.

Books Recommended:

1. J Bax and G Chacko: Financial Derivatives: Pricing, Applications and

Mathematics, Cambridge University Press, 2004.
2. Y.K. Kwok: Mathematical Models for FinancialDerivatives, Springer-Verlang.
3. J.C. Hull-Options: Futures and other Derivatives, Prentice Hall of India, 2003.

4. Fuzzy Sets and their applications-II

Full Marks: 100 (Mid Semester:20, End Semester:80) CREDIT-4

Course Objectives:

1. The main objective of this course is to prepare the students to know the Fuzzy logic and
approximate reasoning, Fuzzy languages, Fuzzy decisions making, Fuzzy dynamic
programming and Fuzzy linear programming.

Learning Outcomes:

CO1: The students will be able to acquire knowledge about Fuzzy logic and approximate
reasoning, Fuzzy languages

50
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

CO2: The students will be able to apply Fuzzy linear programming and Symmetric fuzzy linear
programming.
CO3: The students will be able to identify the solutions of different Fuzzy dynamic
programming in logistics,
CO4: The students will be able to apply the fuzzy approach to transportation problems and
other associated models.

Unit – I 20 Marks
Fuzzy Logic and Approximate reasoning: Linguistic variables, Fuzzy logic, Truth tables
and Linguistic approximation, approximate reasoning.

Unit – II 20 Marks
Fuzzy languages, Decision making in fuzzy environments: Fuzzy decisions, fuzzy linear
programming, symmetric fuzzy LP.

Unit – III 20 Marks

Fuzzy dynamic programming, Fuzzy set models in Operations Research: Introduction,
fuzzy set models in Logistics, fuzzy approach to transportation problems.

Unit – IV 20 Marks
Fuzzy linear programming in logistics, fuzzy set decision model as optimization criterion, and
other associated models

Books Recommended:

1. U. Z. Zimmermann: Fuzzy Set Theory and its Applications, Allied Publisher, New
Delhi,1991.
2. G J Klir & Bo Yuan: Fuzzy Set and Fuzzy Logic, Prentice Hall of India, New Delhi, 1995.

51
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

5. Data Science-II
Full Marks: 100 (Mid Semester:20, End Semester:80) CREDIT-4

Course Objectives:

1. The objective of this course to comprehend the idea of Markov Models, Markov Random
fields, Conditional Random fields. Neural Networks, Convolution Networks, Practical
Methodology, Linear Factor Models.

Learning Outcomes:
CO1: The students will be able to understand the basic idea of Conditional Random fields.
CO2: The students will be able to apply the Exact inference for graphical models, Learning
undirected Gaussian graphical models, Neural Networks Perceptron, MLP and back
propagation.
CO3: The students will be able to apply Basic Algorithms, Parameter Initialization Strategies,
Algorithms with Adaptive Learning Rates.
CO4: The students will be able to understand approximate Second-order Methods,
Optimization Strategies and Meta-Algorithms.

Unit - I 20 Marks

Graphical Models: Directed Graphical models (Bayesian networks), Markov and Hidden
Markov Models, Markov Random fields, Conditional Random fields. Exact inference for
graphical models, Learning undirected Gaussian graphical models.

Reinforcement Learning and Control: Elements of reinforcement learning, Markov reward

process, Markov Decision Process (MDP policies and policy evaluation, policy search, value
iterations and policy iteration) Q-learning, SARSA.

Unit - II 20 Marks

Neural Networks Perceptron, MLP and back propagation , Methods of acceleration of

convergence of BPA.
Regularization for Deep Learning: Parameter Norm Penalties, Norm Penalties as Constrained
Optimization, Regularization and Under-Constrained Problems, Dataset Augmentation, Noise
Robustness, Semi-Supervised Learning, Multitask Learning, Early Stopping, Parameter Tying

52
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

and Parameter Sharing, Sparse Representations, Bagging and Other Ensemble Methods,
Dropout, Adversarial Training, Tangent Distance, Tangent Prop and Manifold Tangent
Classifier.
Optimization for Training Deep Models: How Learning Differs from Pure Optimization,
Challenges in Neural Network Optimization, Basic Algorithms, Parameter Initialization
Strategies, Algorithms with Adaptive Learning Rates, Approximate Second-order Methods,
Optimization Strategies and Meta-Algorithms.

Unit - III 20 Marks

Convolution Networks: The Convolution Operation, Motivation, Pooling, convolution and

Pooling as an infinitely strong prior, Variants of the Basic Convolution Function, Structured
Outputs, Data Types, Efficient convolution Algorithms, Random or Unsupervised Features, The
Neuroscientific Basis for Convolutional Networks, Convolutional Networks and the History of
Deep Learning.
Sequence Modeling, Recurrent and Recursive Nets: Unfolding Computational Graphs, Recurrent
Neural Networks, Bidirectional RNNs, Encoder-Decoder Sequence-to-Sequence Architecture,
Deep recurrent Networks, Recursive Neural Networks, The Challenge of Long-Term
Dependencies, Echo State Networks, Leaky Units and Other Strategies for Multiple Time Scales,
The Long Short-Term Memory and Other Gated RNNs, Optimization for Long-Term
Dependencies, Explicit Memory.

Unit-IV 20 Marks

Practical Methodology: Performance Metrics, Default Baseline Models, Determining Whether to

Gather More Data, Selecting Hyperparameters, Debugging Strategies, Example-Multi-Digit
Number Recognition.

Linear Factor Models: Slow Feature Analysis, Sparse Coding.

Autoencoders: Under complete Autoencoders, Regularized Autoencoders, Representational
Power, Layer Size and Depth, Stochastic Encoders and Decoders, Denoising, Autoencoders,
Learning Manifolds with Autoencoders, Contractive Autoencoders, Predictive Sparse
Decomposition, Applications of Autoencoders.
Lab work (This can be examined as Mid Semester):

53
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Implementation of following algorithm using PYTHON Software:

1. Bayesian Network, HMM

2. Back Propagation Algorithm
3. Convolution Neural network (CNN)
4. Recurrent Neural Network (RNN)
5. Autoencoder

Books Recommended:

1. Ian Goodfellow, Yoshua Bengio and Aaron Courville: Deep Learning, MIT Press, 2016.
2. Kevin P. Murphy: Machine Learning-A Probabilistic Prospective, MIT Press ,2012.
3. R. S. Sutton and A. G. Barto: Reinforcement Learning, MIT Press, 2nd Edition, 2018.

Elective-B [M 2.4.4 (Paper-II)]

1. Fluid Dynamics-II
Full Marks: 100 (Mid Semester: 20, End Semester: 80) CREDIT-4

Course Objectives:

1. This course is implemented to introduce the boundary layer equations, concept of wall shear
and boundary layer thickness and apply the integral methods for solving laminar boundary
layer equations.

Learning Outcomes:

CO1: The students will be able to understand the theory of laminar boundary layers
CO2: The students will able to understand the application of Karman-Pohlhausen approximate
method
CO3: The students will be able to acquire knowledge on the solution of momentum integral
equation.
CO4: The students will be able to understand thermal boundary layer in two dimensional flows.

54
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Unit – I 20 Marks
Exact Solutions of the Navier-Stokes’ Equations.

Unit – II 20 Marks
Exact Solutions of the Navier-Stokes’ Equations.

Unit – III 20 Marks

Theory of Laminar Boundary Layers.

Unit – IV 20 Marks
Integral Methods for the Approximate Solution of Laminar Boundary Layer Equations, Thermal
Boundary Layer in Two-dimensional Flow.

Book Recommended:

J. L. Bansal: Viscous Fluid Dynamics, Oxford & IBH Publishing Co. Pvt. Ltd., New Delhi.

Unit-I Chapter -4 (4.8-4.11)

Unit-II Chapter -4 (4.12-4.13, 4.15, 4.16)

Unit-III Chapter -6 (6.1-6.4)

Unit-IV Chapter –7(7.1-7.4), Chapter –8(8.1-8.2)

2. Numerical Solution of Differential Equations-II

Full Marks: 100 (Mid Semester:20, End Semester:80) CREDIT-4

Course Objectives:

1. Most of the models in fluid dynamics ultimately reduce to partial differential equations
(PDEs).
2. So, there is a need for the students to make them aware of solving numerically, PDEs to
enable themselves for future research in this area.

Learning Outcomes:
CO1: The students will be able to identify solutions of partial differential equations by applying
finite difference numerical schemes.

55
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

CO2: The students will be able to understand the Jacobi’s iteration method, Gauss-Seidel
iteration method.
CO3: The students will be able to apply Successive Over-Relaxation or SOR method and ADI
method for solving Laplace’s equation and Poisson’s equation.
CO4: The students will be able to apply Blender-Schmidt’s, Crank-Nicolson and DuFort-
Frankel methods for Parabolic and hyperbolic PDEs.
Unit – I 20 Marks
Partial Differential Equations (PDE): Classification of PDEs, Finite difference approximations to
PDEs. Numerical solutions of Elliptic, Parabolic and Hyperbolic PDEs.
Unit – II 20 Marks
Solution of Laplace’s equation by Libermann’s iteration procedure, Jacobi’s iteration method,
Gauss-Seidel iteration method, Successive Over-Relaxation or SOR method, ADI method,
Poisson’s equation.
Unit – III 20 Marks
Explicit formula for Parabolic PDE; Solution of parabolic equation by Blender-Schmidt’s,
Crank-Nicolson, DuFort-Frankel methods for Parabolic PDE.

Unit – IV 20 Marks
Explicit formula for Hyperbolic PDE; Solution by method of finite difference, Explicit formula
for Hyperbolic PDE. Consistency, Stability and Convergence aspects of these methods.

Books Recommended:

1. S. S. Sastry: Introductory methods of Numerical Analysis, 5th Edition, PHI.

2. G. D. Smith: Numerical Solution of Partial Differential Equations, 3rd Edition, Oxford
University Press.

56
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

3. Design and Analysis of Algorithms – II

Full Marks: 100 (Mid Semester:20, End Semester:80) CREDIT-4

Course Objectives:

1. The main objective of this course is to make the students aware of theoretical aspects of
computations problem such as: B-Trees, Data structures for disjoint sets, Minimum
spanning trees, Maximum flow of networks, Polynomial-time verification and also
write the efficient algorithms of this problem. The main objective of this course is to make
the students aware of theoretical aspects of computations problem such as: B-Trees, Data
structures for disjoint sets, Minimum spanning trees, Maximum flow of networks,
Polynomial-time verification and write the efficient algorithms.

Learning Outcomes:

CO1: The student will be able to understand the notion of B-Trees and their operations.
CO2: The students will be able to understand the concept of Data structures for disjoint sets.
CO3: The students will be able to acquire knowledge of Minimum spanning trees, Maximum
flow of networks, Polynomial-time verification.
CO4: The students will be able to design the efficient algorithms of this problem.

Unit - I 20 Marks
B-Trees: Definition of B-trees, Basic operations on B-trees, Deleting a key from a B-tree. Data
Structures for Disjoint Sets: Disjoint-set operations, Linked-list representation of disjoint sets,
Disjoint-set forests. Elementary Graph Algorithms: Representations of graphs, Breadth-first
search, Depth-first search.

Unit - II 20 Marks

Minimum Spanning Trees: Growing a minimum spanning tree, The algorithms of Kruskal and
Prim. Single-Source Shortest Paths: The Bellman-Ford algorithm, Single-source shortest paths in
directed acyclic graphs, Dijkstra’s algorithm. All-Pairs Shortest Paths: The Floyd-Warshall
algorithm.

57
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Unit - III 20 Marks

Maximum Flow: Flow networks, The Ford-Fulkerson method. Polynomials and the FFT:
Representing polynomials, The DFT and FFT. String Matching: The naive string-matching
algorithm, The Rabin-Karp algorithm.

Unit-IV 20 Marks

NP-Completeness: Polynomial time, Polynomial-time verification, NP-completeness and

reducibility, NP-complete problems. Approximation Algorithms: The vertex-cover problem, The
traveling-salesman problem, The set-covering problem, The subset-sum problem.

Books Recommended:
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein:
Introduction to Algorithm, 3rdEdition, Prentice Hall of India.
2. E. Horowitz & S Sahni: Fundamentals of Computer Algorithms.
3. Aho, Hopcraft, Ullman: The Design and Analysis of Computer Algorithms, Pearson
Education, 2008.
4. LEE: Design & Analysis of Algorithms (POD), Mc-Graw Hill.

4. Stochastic Processes-II
Full Marks: 100 (Mid Semester:20, End Semester:80) CREDIT-4

Course Objectives:

1. The main objective of this course is to comprehend Markov processes with continuous state
space, Renewal Processes and Theory, and Statistical analysis of time series and stationary
processes.

Learning Outcomes:

After successful completion of this course, student will be able to

CO1: The students will be able to understand the features involving Markov processes with
continuous state space such as Brownian motion, Wiener process, and
Kolmogorov equations

58
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

CO2: The students will be able to understand the notions of renewal processes in continuous
time, Wald’s equation, Renewal theorems,
CO3: Delayed and Equilibrium Renewal Processes, Residual and Excess Lifetimes.
CO4: The students will be able acquire knowledge about the Markov renewal equation.
CO5: The students will be able to understand the notion of statistical Analysis of Time series.

UNIT-I 20 Marks

Markov processes with continuous state space – Brownian motion, Wiener process, differential
equations for a Wiener process, Kolmogorov equations, first passage time distribution for
Wiener process.

Unit-II 20 Marks

Renewal Processes and Theory: Renewal processes, Renewal processes in continuous time,
renewal equation, Stopping time: Wald’s equation, Renewal theorems, Delayed and Equilibrium
Renewal Processes, Residual and Excess Lifetimes.

Unit-III 20 Marks

Markov Renewal and Semi- Markov Processes: Definitions and Preliminary results, Markov
renewal equation, Limiting behaviour, First passage time.

Unit-IV 20 Marks

Stationary Processes and Time series: Models of Time series, Time and Frequency domain,
Statistical Analysis of Time series.

Book Recommended:

Medhi, J.: Stochastic Processes, 3rd Edition, New Academic Science.

Book for References:

Sheldon M. Ross, Stochastic Processes, 2nd Edition, Wiley.

59
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

M 2.4.5 (PROJECT/DISSERTATION)
Full Marks: 100
(Project Proposal-60, Presentation-20, Viva – 20) CREDIT-4
Course Objectives:

1. To enhance skill and thinking potential to possess comprehensive depth in any of the recent
topics of Mathematics which will enable students for framing mathematical modeling of
various real life problems and hence solving them.

Learning Outcomes:

CO1: The students will acquire significant ideas for carrying out independent work in research
and development.
CO2: The students will be able to address the challenges of real-life problems.
CO3: The students will be able to acquire motivation to go for further studies.
CO4: The students will be able to understand the newer concepts of research areas.

VALUE ADDED COURSE

Subject Name: Data Analytics Paper Code: MATH-PG-VA-01

Full Marks: 50 Credit: 02 Total Lectures: 30Hours

Course Objectives:

1. The objective of this course to comprehend the idea of linear methods for regression and
classification, Model assessment and selection, Additive models, Support Vector Machines
(SVM).

Learning Outcomes: Upon successful completion of this course students will able to:

CO1: Know about data exploration, data integration and Boot strap methods along with
performance of classification algorithms
CO2: Know various aspects of predictive analytics using machine learning and multiple
regression,
CO3: Apply Support Vector Machines(SVM) for classification and learn principal component
Analysis
60
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Unit-I 10 Hours

Getting to know your data (Data Objects and attributes types), Graphical methods for data
exploration( Histograms, Box plots, Quantile Plots, Bag plots, Glyph Plots, Scatter plots,
Dynamic Graphics, Co-plots, Dot Charts, Plotting Points as Curves, Bi plots). Data pre-
processing (Why pre-process data? Data cleaning, data integration, data transformation and
reduction), Performance of methods of learning from data(Loss function , training and testing
error, Bias, Variance, and model complexity, Bias-variance decomposition, Cross-validation,
Boot strap methods, Performance of classification algorithms(Confusion Matrix, Precision,
Recall and ROC Curve).

Unit-II 10 Hours

Predictive Analytics using Machine Learning: Overview of supervised learning, KNN and
Naïve Bayes Classifiers, Multiple linear regression, Shrinkage methods (Ridge regression, Lasso
regression, elastic net), Logistic regression, Linear Discriminant Analysis, Feature subset
selection.
Unit-III 10 Hours

SVM for classification, and non-linear regression, Regression and classification trees, Random
forest, Clustering (K-means), Feature Extraction (Principal Component Analysis), Non-negative
matrix factorization and collaborative filtering, Mixture of Gaussians and applications to
clustering and anomaly detection.
Note: Methods studied above to be implemented using Python (May be assessed in the

Mid-Semester Examination).

Books Recommended:

1. Trevor Hastie, Robert Tibshirani, Jerome Friedman: The Elements of Statistical

Learning-Data Mining, Inference, and Prediction, 2nd Edition, Springer Verlag, 2009.
[Chapters: 1, 2(excluding 2.8), 3(3.1-3.4, 3.6), 4(4.3-4.4), 7(7.1-7.3, 7.10, 7.11,
9(9.2),12(12.1-12.3), 13(13.1-13.3), 14(14.3.1, 14.3.6-14.3.8, 14.5.1, 14.6), 15(15.1-
15.3)].
2. Jiawei Han, Micheline Kamber and Jian Pei, Data Mining Concepts and
Techniques,3rdEdition, Elsevier, 2011.

61
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

3. Andreas C. Muller and Sarah Guido: Introduction to Machine Learning with Python-A
Guide for Data Scientists, O’Relly, (SPD), 2017.
(Relevant portions for Python Implementation)

Book for References:

Gareth James. Daniela Witten. Trevor Hastie. Robert Tibshirani: An Introduction toStatistical
Learning with Applications in R, Springer, 2013.

ADD ON COURSE
Subject Name: Fundamental Aspects of Discrete
Mathematical Structure

Paper Code: MATH-PG-AO-01 Full Marks: 50 Credit: 02

Total Lectures: 30Hours

Objective:

1. This is a preliminary course for the basic courses in mathematics and all its applications.
The objective is to acquaint students with basic counting principles, set theory and logic,
matrix theory and graph theory.
Learning Outcomes:

CO1: After finishing this course, students will acquire knowledge about following things:
CO2: Gain strong back ground of logic to handle different types of proofs to solve
mathematical problems.
CO3: Learn fundamentals of matrix algebra including method of solution of system of linear
equation and eigenvalues and eigenvectors of matrices.
CO4: Gain the basic knowledge of graph theory.

Unit-I 10 Hours

Sets, relations, Equivalence relations, partial ordering, well ordering; Functions, cardinals and
ordinals, statements, compound statements, proofs in Mathematics, Truth tables, Algebra of
propositions, logical arguments, Well-ordering property of positive integers, Division algorithm,
Divisibility and Euclidean algorithm, Congruence relation between integers, Fermat’s little
theorem, principles of mathematical induction.

62
 PG MATHEMATICS SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Unit-II 10 Hours

Matrices, algebra of matrices, determinants, fundamental properties, minors and cofactors,

product of determinant, adjoint and inverse of a matrix, Rank and nullity of a matrix, Systems
of linear equations, row reduction and echelon forms, solution sets of linear systems,
applications of linear systems, Eigen values, Eigen vectors of a matrix.
Unit-III 10 Hours

Graph terminology, types of graphs, subgraphs, isomorphic graphs, Adjacency and

incidence matrices, Paths, Cycles and connectivity, Eulerian and Hamiltonian paths.
Book Recommended:

Edgar G. Goodaire and Michael M. Parmenter: Discrete Mathematics with Graph Theory, 3rd
Ed., Pearson Education (Singapore) P. Ltd., Indian Reprint, 2005.

63