B.sc. Mathematics

DEPARTMENT OF MATHEMATICS
B.Sc. MATHEMATICS
(Students admitted during 2019-2020 Onwards)
(Under CBCS with Outcome Based Education (OBE) Pattern)
SYLLABUS
V & VI SEMESTER
GOBI ARTS & SCIENCE COLLEGE

(Govt. Aided Autonomous Co-educational Institution, Affiliated to
Bharathiar University, Coimbatore, Accredited with 'A' Grade by NAAC (4 th cycle)
and Recognised as a STAR College by DBT, Government of India)
KARATTADIPALAYAM POST,
GOBICHETTIPALAYAM - 638453
ERODE DISTRICT.
1
BLOOM’S TAXONOMY BASED ASSESSMENT PATTERN
K1-Remember; K2- Understanding; K3- Apply; K4-Analyze; K5- Evaluate
I. END OF SEMESTER (EOS) EXAMINATIONS:
1. Part I, II & III-Theory: 70 Marks

Knowledge Level Section Marks Description Total
K1 A (Answer All) 15 × 1 = 15 MCQ
K2 B (Either or Pattern) 5 × 5 = 25 Short answers 70
K3 & K4 C (Answer 3 out of 5) 3 × 10 = 30 Descriptive/Detailed
2. Practical Examinations: 70 Marks

Section
Knowledge Level Total
Practical Record work
K3
K4 60 10 70
K5
II. CONTINUOUS INTERNAL ASSESSMENT (CIA):
1. Test – I & II: 30 Marks (Theory)

Knowledge Level Section Marks Description Total
K1 A (Answer All) 10 × 1 = 10 MCQ
K2 B (Answer 2 out of 3) 2 × 5 = 10 Short answers 30
K3 & K4 C (Answer 1 out of 2) 1 × 10 = 10 Descriptive/Detailed
2. Practical Internal Assessment: 30 Marks
Section
Knowledge Level Total
Test Lab Performance
K3
K4 20 10 30
K5
Components of Continuous Internal Assessment (CIA)
Components Calculation CIA Total
Test 1 30 Test 1 + Test 2
30
Test 2 30 2
Programme Code: B.Sc. Programme Title: Mathematics

Course Code: 19UAMA09 Course Title: Batch: 2019
Total Hours: 90 Real Analysis - I Semester: V
2
Credits: 6.0
Course Objective
The course aims
 To acquire the knowledge of basic topological properties in the field of real number system.
 To understand the notions and simple proof techniques of mathematical analysis.
 To perform simple theoretical analysis involving functions of single variable (continuity and
differentiation) in the field of Science and Engineering.
Course Outcomes (CO)
On the successful completion of the course, students will be able to
Knowledge CO
Course Outcome
Level Number
K1, K2 CO1 Acquire rigorous theoretical knowledge by analysis of sets.
K2 CO2
Demonstrate the nature of finite series with the help of limits.
Applying the concept of convergence in infinite series based on several
K3 CO3
comparison tests.
Equip adequate understanding of limits, continuity and differentiability
K2, K4 CO4
of real functions.
K2 CO5 Enhance their knowledge on metric space and its related concepts.
K1 – Remember; K2 – Understanding; K3 – Apply; K4 – Analyze; K5 – Evaluate
SYLLABUS
No. of
Unit Content
Hours
Real Numbers: Introduction - Field Structure and Order Structure - Bounded
and Unbounded Sets: Supremum, Infimum - Completeness in the Set of Real
I Numbers. 18
Open Sets, Closed Sets and Countable Sets: Introduction - Limit Point of a
Set - Closed Sets: Closure of a Set - Countable and Uncountable Sets.
Real Sequences: Sequences - Limit Points of a Sequence - Limits-Inferior
II and Superrior - Convergent Sequences - Non-Convergent 18
Sequences(Definitions) - Cauchy’s General Principle of Convergence .
Infinite Series: Introduction - Positive Term Series - Comparison Test for
III 18
Positive Term Series - Cauchy’s Root Test - D’Alembert’s Ratio Test.
Functions of a Single Variable (I): Limit and Continuity: Limits -
Continuous Functions - Functions Continuous on Closed Intervals -
IV 18
Uniform Continuity.
Functions of a Single Variable (II): The Derivative - Continuous Functions.
Metric Spaces: Introduction - Definition and Examples - Bounded Sets in a
V Metric Spaces - Open Ball(Open Sphere) in a Metric Space - Open Sets - 18
Subspace - Interior of a Set – Closed Sets.
Text Books:
3
1. S.C.Malik, Savita Arora, Mathematical Analysis, New Age International Publishes(1982),
5th edition. (B1)
2. Dr. S.Arumugam and Mr. A.Thangapandi Issac, modern analysis, New Gamma Publishing
House, 2015. (B2)
Unit-I:
Chapter- I: Page No: 1 - 20
Chapter- II: Page No: 27 - 43 (B1)
Unit-II:
Chapter-III: Page No: 44 - 64 (B1)
Unit-III:
Chapter-IV: Page No: 99 - 116 (B1)
Unit-IV:
Chapter-V: Page No: 145 - 176
Chapter-VI: Page No: 177 - 180 (B1)
Unit-V:
Chapter-II: Page No: 17 - 26, 35 – 43, 53 - 63 (B2)
Reference Books:
1. Introduction of Real Analysis by Robert G.Bartle, Donald R.Sherbert.
2. Foundations of Mathematical Analysis by C.Ponnusamy.
E-references:
1. https://www.google.com/url?sa=t&source=web&rct=j&url=http://
ramanujan.math.trinity.edu/wtrench/texts/
TRENCH_REAL_ANALYSIS.PDF&ved=2ahUKEwjE2L_etbnvAhWhzzgGHXjwCIoQFj
ASegQIJhAC&usg=AOvVaw3BSg11ZvA4zDaGp0RjBwM
2. http://www.math.louisville.edu/~lee/RealAnalysis
Mapping with Programme Specific Outcomes
PSO
PSO1 PSO2 PSO3 PSO4 PSO5
CO
CO1 M M S H M
CO2 H S S H M
CO3 S H M M S
CO4 M S H S M
CO5 M M H S M
S-Strong; H-High; M- Medium; L- Low
4
Semester: V
Total Hours: 90 Complex Analysis - I
Credits: 6.0
Course Objective
The course aims
 To introduce the basic concepts of complex number and analytic functions.
 To study about bilinear transformations and mapping by elementary functions.
 To learn the concepts of power series and elementary functions.
Knowledge CO
Course Outcome
Level Number
Introduce the complex plane and to derive the Cauchy – Riemann
K1, K2 CO1
equations.
K2, K3 CO2 Discuss the analytic functions and Harmonic functions.
Understand the basic concepts of Bilinear transformations and Cross
K1, K2 CO3
Ratio.
K2 CO4 Explain Power series and elementary functions.
Analyze concepts of Conformal mapping and mapping by elementary
K2, K3 CO5
functions.
SYLLABUS
No. of
Unit Content
Hours
COMPLEX NUMBERS – Introduction – Complex numbers – Regions in the
complex plane – The Extended complex plane.
I ANALYTIC FUNCTIONS – Introduction – Functions of a complex variable 18
– Limits – Continuous functions – Differentiability – The Cauchy-Riemann
Equations.
II ANALYTIC FUNCTIONS – Analytic functions – Harmonic functions. 18
BILINEAR TRANSFORMATIONS – Introduction – Elementary
III Transformations – Bilinear Transformations – Cross Ratio- Fixed points of 18
bilinear transformations – Some special bilinear transformations.
POWER SERIES – Introduction – Sequences and series – Sequences and
IV 18
series of functions – Power series – Elementary functions
ANALYTIC FUNCTIONS – Conformal Mapping. MAPPING BY
V ELEMENTARY FUNCTIONS – The mapping w=z2 – The mapping w=ez – 18
The mapping w=sin z – The mapping w=cos z – The mapping w=1/2(z+1/z)
5
Text Book:
Complex Analysis By S.Arumugam, A.Thangapandi Issac & A.Somasundaram.
Unit-I:
Chapter-1: Sections 1.0, 1.1, 1.8, 1.9
Chapter-2: Sections 2.0 – 2.2, 2.4 – 2.6
Unit-II:
Chapter-2: Sections 2.7, 2.8
Unit-III:
Chapter-3: Sections 3.0 – 3.5
Unit-IV:
Unit-V:
Chapter-2: Section 2.9
Chapter-5: Sections 5.1, 5.3 -5.5, 5.7
Reference Book:
Functions of a Complex Variable by J.N.Sharma.
E-references:
1. https://youtu.be/P51wtDp7GjA
2. https://youtu.be/OxVBT83x8oc
3. https://youtu.be/WGq0PgUR_2Q
PSO
CO
CO1 S H M S M
CO2 M S S H M
CO3 S S H S S
CO4 S M S H M
CO5 S M H M S
6
Semester: V
Total Hours: 90 Abstract Algebra
Credits: 6.0
Course Objective
The course aims
 To identify, create and use mappings, binary operations, Isomorphism and permutations.
 To know about groups, rings, fields and their properties and usage.
Knowledg CO
Course Outcome
e Level Number
Know basic properties of mappings, groups, subgroups and quotient
K1 CO1 groups.
K2 CO2 Understand homomorphism, Cayley’s theorem and its application.
K3 CO3 Know the basic concepts of rings and field.
K2 CO4 Understand different kinds of rings, fields and their properties.
K1 - Remember; K2 - Understanding; K3 - Apply; K4 - Analyze; K5 – Evaluate
SYLLABUS
No. of
Unit Content
Hours
Preliminary: Sets, Mappings, Relations and Binary operations, Groups,
Definition and example - Basic properties, Subgroups - Normal Subgroups and
I 18
quotient groups.
Chapter: 1, 2. Sections 1.1, 1.2 & 2.1 to 2.6.
Homomorphisms – Automorphisms - Cayley’s theorem - Permutation groups.
II 18
Chapter: 2 Sections 2.7 to 2.10.
Rings: Definitions and examples - Basic properties - Special classes of rings
III -Integral domain and fields - Homomorphisms of rings. 18
Ideals and quotient rings - Maximal and principal ideals - The field of
IV quotients of an integral domain. 18
Euclidean rings - A particular Euclidean ring.
V 18
Chapter: 3 Sections 3.7, 3.8.
Text Book:
“Topics in Algebra” by I.N.HERSTEIN
Reference Book:
Modern Algebra by A.R.Vasishta.
7
E-reference:
http://ocw.mit.edu/courses/mathematics

PSO
CO
CO1 H M M M L
CO2 S M M L H
CO3 S H H M H
CO4 S H H S H
S - Strong; H - High; M - Medium; L - Low
8
Semester: V
Total Hours: 60 Programming in C
Credits: 4.0
Course Objective
The course aims
 To know the concepts of C language.
 To write simple programs using files, structures, operators, decision making if statements
etc.,
 To write simple applications using C language.
Knowledge CO
Course Outcome
Level Number
Remember and understand the basic data types, operators and to write
K1, K3, K4 CO1
& compile simple programs.
K1, K2, K3 CO2 Understand the conditional statements & loops in programs.
Understand and apply the concept of arrays & functions and design the
K2 CO3
application programs.
Analyze the usage of structures, Unions, Pointers and make them to
K4 CO4
efficiently access the memory.
Understand and evaluate the file operations and write programs to
K4 CO5
handle the data using files.
SYLLABUS
No. of
Unit Content
Hours
Constants, variables and data types: Introduction – character set – C tokens –
keywords and identifiers – constants – variables – Data types – Declaration
of variables – Assigning values to variable – defining symbolic constants.
Operators and Expressions: Introduction – Arithmetic operators – relational
I operators – Logical operators – Assignment operators – Increment and 12
decrement – operators – conditional operators – Bitwise operators – special
operators – Arithmetic expressions – Evaluation of expressions – precedence
of arithmetic operators – some computation problems – Type conversions in
expressions – operator precedence and associatively mathematical
functions.
Managing input and output operators: Introduction – reading a character –
writing a character – formatted input - formatted output – case studies –
Decision making and Branching.
II Introduction – decision making with IF statement - The IF – ELSE statement 12
– Nesting of IF – ELSE STATEMENT – The ELSE IF ladder – The
SWITCH statement – The?:operator – The GOTO statement – case studies –
Decision making and looping: Introduction – The WHILE statement – The
DO statement – The FOR statement – Jumps in loops.
9
Arrays: Introduction – one dimensional array – two dimensional arrays –
initializing two dimensional arrays – multidimensional arrays.
Handling of character strings: Introduction – Declaring and initializing string
variables – Reading strings from terminal – str-ings to screen – Arithmetic
operations on characters – putting strings together – comparison of two
strings – string handling functions - table of strings.
III User defined functions: Introduction – Need for user defined functions – A 12
multifunction program – The form of C functions – Return values and their
types – calling a function – category of functions – No arguments and no
return values – Arguments but to return values – Arguments with return
values – Handling of non –integer functions – Nesting of functions –
Recursion – Functions with arrays – The scope and life time of variables in
functions – ANSI C functions.
Structure and Unions: Introduction – Structure definition – giving values to
members – structure initialization – comparisons of structure variables –
IV 12
Arrays of structures – Arrays with in structure – structures with in structures
– structures and functions – unions – size of structures - Bit fields.
Pointers: Introduction – understanding pointers – accessing the address of
variable – Declaring and initializing pointers – Accessing a variable through
its pointer – pointer expressions – pointer increments and scale factors –
V 12
pointers and functions – Pointers and structures – points on pointers.
File managements in C: Introduction – Defining and opening a file – Closing
a file – Input/ Output operations on files.
Text Book:
Programming in ANSI C by E.Balagurusamy, Tata McGraw Hill Publishing Company
Limited, 2nd Edition, 1989.
Reference Books:
1. Computer programming in C by V.Rajaraman, Prentice, Hall of india Private Limited, 1995.
2. The spirit of ’C’ – An introduction to modern programming by Henry Mullish and Herbert
L.Cooper, Jaico Publishing House 1996.
E-references:
1. http://www.cprogramming.com/reference/
2. http://en.cppreference.com/w/c/language
3. http://developerinsider.co/co/best -c-programming-book-for-beginners/

PSO
CO
CO1 M S L S M
CO2 L S H S S
CO3 M S M L S
CO4 L M H S M
CO5 S S M M H
S-Strong; H-High, M- Medium, L- Low
10
Course Code: 19UAMAP1 Course Title: Batch: 2019
Major Core Practical: Semester: V
Total Hours: 30
Programming in C Credits: 2.0
Course Objective
The course aims
 To know the concepts of C language.
 To write programs in c using files, structures, operators, decision making if statements etc.,
 To write simple applications using C programming.
Course Outcome
Knowledg CO
Course Outcome
e Level Number
Remember basic data types, operators and to write simple programs
K3, K4 CO1
using them.
K2, K3 CO2 Understand the conditional statements & loops in C programs.
Apply the concept of arrays & functions and design the application
K2 CO3
programs.
Analyze the usage of structures, Unions, Pointers and make them to
K4 CO4
efficiently to solve problems.
Evaluate the file operations and write programs to handle the data
K4 CO5
using file concept.
K1 - Remember; K2 - Understanding; K3 - Apply; K4 - Analyze; K5 - Evaluate
SYLLABUS
No. of
Unit Content
Hours
Programme list:
1. Leap year
2. Biggest Number Among Three
3. Sum and the Average
4. Number of Years, Months and Days
5. Reverse of the Given Number
6. Convertion of Decimal to Binary
7. Fibonacci series 30
8. Armstrong Numbers
9. Ramanujam Number
10. Multiplication table
11. Arithmetic operators using switch command
12. Prime Numbers
13. Sorting Names
14. Swapping of two variables
15. Quadratic Equation.
11
Text Book:
Reference Books:
1. Computer programming in C by V.Rajaraman, Prentice, Hall of india Private Limited, 1995.
2. The spirit of ’C’ – An introduction to modern programming by Henry Mullish and Herbert
L. Cooper, Jaico Publishing House 1996.
E-references:
1. http://www.cprogramming.com/referencee/
2. http://en.cppreference.com/w/c/language
3. http://developerinsider.co/co/best -c-programming-book-for-beginners/
Mapping with Programme Outcomes

PSO
CO
CO1 M S L S M
CO2 L S L S S
CO3 M S M H S
CO4 L M H S M
CO5 S S M M H
S - Strong; H - High; M - Medium; L – Low
12
Semester: VI
Total Hours: 90 Real Analysis - II
Credits: 6.0
Course Objective
The course aims
 To acquire knowledge of basic topological properties in the field of real numbers and to
expose the concept of convergence, continuity of sequence and series of functions.
 To construct simple mathematical proofs and possess the ability to verify them.
 To apply abstract ideas and rigorous methods in mathematical analysis to practical problems
in various fields.
Knowledge CO
Course Outcome
Level Number
Acquire the knowledge of fundamental properties of real number sys-
K1 CO1
tems and familiar with basic proof techniques.
K2, K4 CO2 Analyze countability, compact and connectedness of sets.
Understanding limits and their uses in sequences and series for the test
K4 CO3
of convergence.
Demonstrate the knowledge of continuity and its approach to compact-
K2, K3 CO4
ness and connectedness
Apply the Mean value theorem and the Taylor’s theorem of Calculus
K4 CO5 problems in the context of real analysis and interconnected to various
fields in science in general.
SYLLABUS
No. of
Unit Content
Hours
The Real and Complex Number Systems: Introduction – Ordered Sets –
I Fields – The Real Fields – The Extended Real Number System – The 18
Complex Field – Euclidean Spaces.
Basic Topology: Finite, Countable and Uncountable Sets – Metric Spaces –
II 18
Compact Sets – Perfect Sets – Connected Sets.
Numerical Sequence and Series: Convergent Sequences – Subsequences –
Cauchy Sequences – Upper and Lower Limits – Some Special Sequences –
III 18
Series – Series of Nonnegative Terms – The Number e – The Root and Ratio
Tests – Power Series – Summation by Parts – Absolute Convergence.
Continuity: Limits of Functions – Continuous Functions – Continuity and
IV Compactness – Continuity and Connectedness – Discontinuities – 18
Monotonic functions – Infinite Limits and Limits at infinity.
Differentiation: The Derivative of a Real Functions – Mean Value Theorems
V – The Continuity of Derivatives – L'Hospital's Rule – Derivative of Higher 18
Order – Taylor's Theorem – Differentiation of Vector-Valued Functions.
13
Text Book:
Walter Rudin, Principles of Mathematical Ananlysis, McGraw-Hill Book Company (1953), Third
edition.
Unit I : Chapter 1: 1.1 to 1.38

Unit II : Chapter 2: 2.1 to 2.47
Unit III: Chapter 3: 3.1 to 3.46
Unit IV: Chapter 4: 4.1 to 4.34
Unit V : Chapter 5: 5.1 to 5.19
Reference Books:
1. S.C.Malik, Savita Arora, Mathematical Analusis, New Age International publishes (1982), 5th
edition.
2. Introduction of Real Analysis by Robert G.Bartle, Donald R.Sherbert.
E-references:
1. http://www.math.louisville.edu/~lee/RealAnalysis/
2. https://www.google.com/url?sa=t&source=web&rct=j&url=http://ramanujan.math.trinity.edu/
wtrench/texts/
TRENCH_REAL_ANALYSIS.PDF&ved=2ahUKEwjE2L_etbnvAhWhzzgGHXjwCIoQFjAS
egQIJhAC&usg=AOvVaw3BSg11ZvA4zDaGp0RjBwM
PSO
CO
CO1 M M M S H
CO2 S H S M M
CO3 S H S M M
CO4 M S H M M
CO5 M H S M S
14
Semester: VI
Total Hours: 90 Complex Analysis - II
Credits: 6.0
Course Objective
The course aims
 To know the basic concepts of Complex integration.
 To study Zeros and Singularities of an analytic function.
 To evaluate definite integrals using Residues.
Knowledge CO
Course Outcome
Level Number
Introduce the basic concepts of complex integration and derive
K1, K3 CO1
Cauchy’s Integral Formula.
Find the integral formula for Higher Derivatives and derive Taylor’s
K3 CO2
series.
K1, K2 CO3 Discuss the Zeros and types of Singularities of an analytic function.
K1, K3 CO4 Find the Residues of an analytic function.
K2, K3 CO5 Evaluate the Definite integrals using Residue theorem.
SYLLABUS
No. of
Unit Content
Hours
COMPLEX INTERGRATION– Introduction – Definite Integral – Cauchy's
I 18
Theorem – Cauchy's Integral Formula.
COMPEX INTERGRATION – Higher Derivatives.
II 18
SERIES EXPANSIONS – Introduction – Taylor's series.
SERIES EXPANSIONS – Laurent's series – Zeros of an Analytic Function –
III 18
Singularities.
CALCULUS OF RESIDUES – Introduction – Residues – Cauchy's Residue
IV 18
Theorem.
V CALCULUS OF RESIDUES – Evaluation of definite integrals. 18
Text Book:
Complex Analysis by S.Arumugam, A.Thangapandi Issac & A.Somasundaram.
Unit-I:
Unit-II:
15
Chapter-7: Sections 7.0, 7.1
Unit-III:
Unit-IV:
Unit-V:
Reference Book:
Functions of a Complex Variable by J.N.Sharma.
E-references:
1. https://youtu.be/egRCpSGeo3g
2. https://youtu.be/YqFpfSTXY3U
3. https://youtu.be/UI3-uQ9o9tY
PSO
CO
CO1 S H S M H
CO2 S H M H S
CO3 H S M H S
CO4 S S H M H
CO5 H M H S H
16
Semester: VI
Total Hours: 90 Linear Algebra
Credits: 6.0
Course Objective
The course aims
 To different types of matrices and eigen values and vectors of matrix.
 To prove the some theorems of vector space.
 To apply the theorems in linear transformations and different forms of matrices.
Knowledge CO
Course Outcome
Level Number
K2, K3 CO1 Study the types of elementary matrix.
K3 CO2 Explain vector space and subspace of a vector space.
K1, K2 CO3 Explain concepts of inner product on vector space.
Investigate properties of vector spaces and subspaces using by linear
K1, K2 CO4
transformation.
K2, K3 CO5 Represent linear transformation by matrices.
SYLLABUS
No. of
Unit Content
Hours
MATRICES: Algebraic operation – triangular – Diagonal scalar and unit
matrices Transpose, adjoint and inverse of a square matrix – symmetric and
I skew – symmetric Hermitian and skew Hermitian matrices – orthogonal and 18
unitary matrices- rank of matrix – characteristic roots and characteristic
vectors of a square matrix.
Vector space: Definition and examples – Basic properties – Linear
II independence – Bases – Dimensions 18
(Chapter - 4: Section - 4.1, 4.2)
Dual spaces – Inner product spaces
III 18
Linear transformations- Algebra of linear transformations- characteristic
IV 18
roots. (Chapter - 6: Section - 6.1, 6.2)
Matrices – Canonical form; Triangular form.
V 18
Text Book:
For Unit - I: “Modern Algebra” by R.Balakrishnan & M.Rmaabhadran.
For Units - II, III, IV & V: “Topics in Algebra” by I.N,Herstein.
Reference Book:
Linear algebra by Stephen H.Friedberg, Arnold J.Insel and Lawrence E.Spence.
17
E-references:
1. https://youtu.be/Y49wZ4MCWnY
2. https://youtu.be/4PCktDZJH8E
3. https://youtu.be/4lAyqscuTc8
4. https://youtu.be/KHYoxbGuusE
PSO
CO
CO1 S S H S S
CO2 H H M M M
CO3 H M M M H
CO4 M M S H M
CO5 S S H M S
18
Discrete Mathematical Semester: VI
Total Hours: 90
Structures Credits: 6.0
Course Objective
The course aims
 To translate statements from a natural language into its symbolic structures in logic.
 To perform the operations associated with sets, functions and relations.
 To understand some basic properties of graphs.
Knowledg CO
Course Outcome
e Level Number
Enable the students to understand the inference theory of the statement
K1, K2 CO1 calculus by using the construction of truth tables.
Make the students to be familiar with the construction of Principal Dis-
K2, K3 CO2 junctive and Conjunctive normal forms.
Acquire basic knowledge of the axiomatic approach to sets, relations,
K1, K2 CO3 ordering and recursive functions.
Adequate basic knowledge of Boolean algebra and its application to
K2, K4 CO4 switching theory and sequential machines.
Gain knowledge regarding elements of graph theory which are indis-
K1, K3 CO5 pensable in almost all computer science areas.
SYLLABUS
No. of
Unit Content
Hours
Mathematical Logic:
Connective: Negation – conjunction – Disjunction – Standard formulas and
Truth Tables – conditional and biconditional -Well formed formulas –
I 18
Tautologies – Equivalence of formulas – Duality Law – tautological
implications – formulas with distinct Truth Tables – Functionally complete sets
of connectives.
Other Connectives – Normal forms – Disjunctive normal forms – conjunctive
II normal forms – principle disjunctive normal forms - principle conjunctive 18
normal forms – Ordering and uniqueness of normal forms.
Set theory:
Relations and ordering – relations – properties of binary relations in a set –
Relation matrix and the graph of a relation – partition and covering of a set –
III Equivalence relations – Compatibility relations – Composition of binary 18
relations partial ordering – partial Ordered set – Representation and Associated
terminology Functions Inverse functions – Binary and n-ary operations –
Characteristic function of set.
Lattices and Boolean Algebra:
Lattices as partially sets – some properties of Lattices – Lattices as Algebraic
IV 18
systems – Sub lattices, Direct product, and Homomorphism.
Boolean Algebra – sub algebra, Direct product and Homomorphisms.
19
Graph Theory:
V Basic Concepts of Graph Theory – paths, Reachability and connectedness – 18
Matrix representation of graphs – Trees.
Text Book:
“Discrete Mathematical Structures with Application to Computer Science” - J.P .Tremblay,
R.Manohar.
Unit I : Chapter 1: 1.1 to 1.2.4, 1. 2.6 to 1.2.13

Unit II : Chapter 1 : 1.2.14 & 1.3.1 to 1. 3.5
Unit III : Chapter 2 : 2.3.1 to 2.3.9 & 2.4.1 to 2.4.5
Unit IV : Chapter 4 : 4 .1.1 to 4.1.4 & 4 .2.1 to 4 . 2.2
Unit V : Chapter 5 : 5.1.1 to 5 .1.4

E-references:
1. https://nptel.ac.in/courses/106/106/106106094
2. https://nptel.ac.in/courses/106/106/106103205

PSO
CO
CO1 S M L H M
CO2 H S M S M
CO3 M L H M H
CO4 H S M S M
CO5 M S S H S
S - Strong; H - High; M - Medium; L - Low
20
Course Code: 19UEMA01 Course Title: Batch: 2019
Major Skill Based Paper: Semester: VI
Total Hours: 60
Numerical Methods Credits: 4.0
Course Objective
The course aims
 To find numerical approximations to the roots of an equation by Bisection method, False
position, Newton – Raphson methods.
 To find numerical solution to a system of linear equations by Gauss elimination, Gauss –
Siedal - Iteration methods.
 To find numerical solution of a differential equation by Euler’s, modified Euler’s, Predictor
– Corrector and Runge Kutta methods and integration methods.

Knowledge CO
Course Outcome
Level Number
Understand the basics of numerical Algebraic and Transcendental
K1,K3, K4 CO1
Equations, Remember and solve the problems
K1,K2, K3 CO2 Remember the concepts of interpolation analysis and its applications.
Choose, formulate and implement appropriate numerical methods for
K2 CO3
solving integration problems.
Understand and solve simultaneous Linear Algebraic Equations using
K4 CO4
various methods.
Understand, analyse and evaluate various methods of ordinary
K4 CO5
Differential Equations.
SYLLABUS
No. of
Unit Content
Hours
Solution of Algebraic and transcendental Equations: Bisection method –
I Iteration method – Method of false position and Newton –Raphson method. 12
Interpolation: Errors in polynomial interpolation – Finite differences of
II polynomial – Newton’s formulae – Gauss Central difference formulae – 12
Stirling’s formula – Bessel’s formula –Evrett’s formula.
Numerical differentiation and Integration:
III Numerical differentiation – Numerical Integration – Trapezoridal rule – 12
simpson’s 1/3 rule – Simpson’s 3/8 rule.
Linear systems of Equations:
Solutions of Linear systems – Matrix inversion method – Gaussian
IV elimination method – Modification of the Gauss method to compute the 12
inverse of a matrix – Method of Factorization – Iterative methods – Gauss –
Seidal method – Gauss Jacobi method.
V Numerical solution of ordinary differential equations. 12
Solution by Taylor’s series – Picard’s method of successive approximations –
Euler’s method – Modified Euler’s method – Runge – Kutta methods –
21
Predictor – Corrector method – Adam’s Moulton method – Milne’s method.
Text Book:
“Introductory methods of Numerical Analysis”
S.S Sastry, Fourth Edition – Prentice Hall of India, New Delhi.
Unit - I: Chapter: 2: 2.1 - 2.5
Unit - II: Chapter: 3: 3.2 - 3.3, 3.5 - 3.7
Unit - III: Chapter: 5: 5.2, 5.4.1 - 5.4.3.
Unit - IV: Chapter: 6: 6.3.1 - 6.3.4, 6.3.6 - 6.3.7, 6.4
Unit - V: Chapter: 7: 7.2 - 7.6
Reference Books:
1. V.Rajaraman, “Computer Oriented Numerical Methods”, Third Edition, PHI Learning Private
Limited, 2011.
2. E.V. Krishnamurthy, S.K. Sen, “Numerical Algorithms”, Third Eition, Affilited Eat-West
Press Private Limited, 1986.
3. P. Kandasamy, K. Thilagavathi, K. Gunavathi, “Numerical methods”, Third Edition, Chand &
Company Ltd, New Delhi, 2005.
E-references:
1. http://www.math.ust.hk/~machas/numerical-methods.pdf
2. http://en.wikibooks.org/wiki/Numerical_Methods/Equation_Solving
3. http://mathworld.wolfram.com/NumericalIntegration.html

PSO
CO
CO1 M S L S M
CO2 L S H S S
CO3 M S M H S
CO4 L M H S M
CO5 S S M M H
22
Course Code: 19UEMAP1 Course Title: Batch: 2019
Semester: VI
Total Hours: 30 Major Skill Based Practical
Credits: 2.0
Course Objective
The course aims
 To find numerical approximations to the roots of an equation by Bisection method, False
position, Newton – Raphson methods.
 To find numerical solution to a system of linear equations by Gauss elimination, Gauss –
Siedal - Iteration methods.
 To find numerical solution of a differential equation by Euler’s, modified Euler’s, Predictor –
Corrector and Runge Kutta methods and integration methods.
Course Outcome
Knowledg CO
Course Outcome
e Level Number
Understand the basics of numerical methods by Algebraic and
K3, K4 CO1
Transcendental Equations, Remember and solve the problems.
Remember the concepts of interpolation analysis and its
K2, K3 CO2
applications.
Choose, formulate and implement appropriate numerical methods
K2 CO3
for solving integration problems.
Understand and solve simultaneous Linear Algebraic Equations
K4 CO4
using various methods.
Understand, analyse and evaluate various methods of ordinary
K4 CO5
Differential Equations.
K1 - Remember; K2 - Understanding; K3 - Apply; K4 - Analyze; K5 - Evaluate
SYLLABUS
No. of
Unit Content
Hours
Program List:
1. Newton’s Raphson method

2. Newton’s method for Linear interpolation.
3. Gauss elimination method
4. Gauss- Jacobi iteration method
30
5. Gauss – Seidal iteration method
6. Euler’s method
7. Taylor’s series method
8. Modified Euler’s method
9. Runge – Kutta method of Second order
10. Runge – Kutta method of Fourth order
Text Book:
23
“Introductory methods of Numerical Analysis”
S.S Sastry, Fourth Edition – Prentice Hall of India, New Delhi.
Reference Book:
Mapping with Programme Outcomes

PSO
CO
CO1 M S L S M
CO2 L S H S S
CO3 M S M H S
CO4 L M H S M
CO5 S S M M H
24
Question Paper Pattern
(Common for Major, Allied, Allied Optional and Major Optional Papers)
For EOS Examinations: 70 Marks

The Question Paper is to be divided into THREE Sections.
Section-A Carries 15 Marks, Section-B Carries 25 Marks and Section-C Carries 30 Marks.
Section-A Contains 15 Multiple Choice Questions. (15 x 1 = 15 Marks)

Three Questions from each unit. (Q. No: 1 to 15)
Section-B Contains 5 Either or Choice Questions. (5 x 5 = 25)

Each Question carries 5 Marks. Both (a) and (b) from the same unit.
Q. No.: 16 (a) or (b) to 20(a) or (b)
Section-C Contains 5 Questions out of which, 3 Questions are to be answered. (3 x 10 = 30)

Each Question carries 10 Marks. One Question from each unit. Q. No.: 21 to 25
For CIA Examinations: 30 Marks

Section-A: 10 Multiple Choice Questions. (10 x 1 = 10)
Section-B: Two Questions out of Three. (2 x 5 = 10)
Section-C: One Question out of Two. (1 x 10 = 10)
25
Programme Code: ALL U.G. Programme Title: Major Optional
Course Code: 19UFMA01 Course Title: Batch: 2019
Semester: V
Total Hours: 90 Operations Research
Credits: 4.0
Course Objective
The course aims
 To impart knowledge in concepts and tools of OR.
 To understand the transportation, assignment, game theory and sequencing problems to
solve by various methods.
 To provide a tight and sufficient control of the management of complex projects through an
integrated system of forced planning and evaluation.
Course Outcome
Knowledge CO
Course Outcome
Level Number
Identify and express a decision problem in mathematical form and solv-
ing them using graphical and simplex methods. Constructing L.P. models
K1, K2 CO1 for various types of problems- distinguish the feasible solution, optimal
solution and basic feasible solution.
Recognize and formulate transportation, assignment problems and obtain
K3 CO2 their optimal solution.
K1, K2 CO3 Understand the concepts of Game theory.
Analyze the concepts of Sequencing problems in order to minimize the
K2, K3 CO4 total elapsed time.
Understand and analyze different techniques of project management us-
K2, K3 CO5 ing CPM / PERT.
SYLLABUS
No. of
Unit Content
Hours
Operations Research – an overview – meaning – scope – models – Limitations.
I Linear Programming problem – Mathematical formulation - Graphical solution – 18
general LPP – Canonical and standard forms of LPP – simplex Method.
Transportation problem-North west Corner rule -Matrix minima method – Vogel’s
Approximation method.
II 18
Assignment problems – Hungarian Assignment method – Minimization and
maximization problems.
Game theory – two – person zero – sum games – Maximin minimax principle –
III 18
Graphical solutions of 2xn and mx2 games – Dominance property.
Sequencing problems – problems with n-jobs through two machines – n- jobs
IV 18
through K machines.
Network scheduling by PERT/CPM – network and basic components – rules of
network construction- critical path analysis.
V 18
PERT-PERT probability Consideration in PERT – PERT calculations – Distinction
between PERT and CPM.
26
Text Book:
Operations Research by Kanti Swarup, P.K.Gupta, and ManMohan. Eleventh Revised Edition
(2003).
UNIT - I:
Chapter 1: Sections 1.1 to 1.3, 1.8.
Chapter 2: Sections 2.1, 2.2.
Chapter 3: Sections 3.1 to 3.5.
Chapter 4: Sections4.1, 4.3.
UNIT - II:
Chapter 10: Sections 10.1 to 10.3, 10.9.
Chapter 11: Sections 11.1to11.4.
UNIT - III:
UNIT - IV:
Chapter 12: Sections 12.1to12.5.
UNIT - V:
E-references:
1. https://simplesnippets.tech/linearprorammingproblem#LPP
2. https://amzn.to/2vgimyJ
3. https://simplesnippets.tech/graphicalsolution#operationsresearch
4. https://Binghamton.edu/seorl
5. https://youtu.be/fSuqTgnCVRg

PSO
CO
CO1 S M H S H
CO2 M H S M M
CO3 H M H M H
CO4 M M M M H
CO5 S H H S S
27

B.sc. Mathematics

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

B.sc. Mathematics

Uploaded by

Copyright:

Available Formats

DEPARTMENT OF MATHEMATICS

(Students admitted during 2019-2020 Onwards)

(Under CBCS with Outcome Based Education (OBE) Pattern)

GOBI ARTS & SCIENCE COLLEGE

K1-Remember; K2- Understanding; K3- Apply; K4-Analyze; K5- Evaluate

I. END OF SEMESTER (EOS) EXAMINATIONS:

1. Part I, II & III-Theory: 70 Marks

2. Practical Examinations: 70 Marks

1. Test – I & II: 30 Marks (Theory)

Programme Code: B.Sc. Programme Title: Mathematics

Mapping with Programme Specific Outcomes

Mapping with Programme Specific Outcomes

Mapping with Programme Specific Outcomes

Mapping with Programme Specific Outcomes

Mapping with Programme Outcomes

Unit I : Chapter 1: 1.1 to 1.38

Mapping with Programme Specific Outcomes

Mapping with Programme Specific Outcomes

Mapping with Programme Specific Outcomes

Unit I : Chapter 1: 1.1 to 1.2.4, 1. 2.6 to 1.2.13

Unit V : Chapter 5 : 5.1.1 to 5 .1.4

Mapping with Programme Specific Outcomes

Course Outcomes (CO)

Mapping with Programme Specific Outcomes

1. Newton’s Raphson method

Mapping with Programme Outcomes

For EOS Examinations: 70 Marks

Section-A Contains 15 Multiple Choice Questions. (15 x 1 = 15 Marks)

Section-B Contains 5 Either or Choice Questions. (5 x 5 = 25)

Section-C Contains 5 Questions out of which, 3 Questions are to be answered. (3 x 10 = 30)

For CIA Examinations: 30 Marks

Section-B: Two Questions out of Three. (2 x 5 = 10)

Section-C: One Question out of Two. (1 x 10 = 10)

Mapping with Programme Specific Outcomes

You might also like