0% found this document useful (0 votes)
115 views7 pages

Syllabus First Year First Semester

This course covers fundamental concepts in discrete mathematics over 4 units. Unit 1 covers topics like the pigeonhole principle, finite combinatorics, and generating functions. Unit 2 discusses partial and linear orderings, lattices, and Boolean algebras. Unit 3 defines various types of graphs like trees, bipartite graphs, and planar graphs. The course aims to provide students with core knowledge in discrete structures and their applications.

Uploaded by

snehasispal.sp
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
115 views7 pages

Syllabus First Year First Semester

This course covers fundamental concepts in discrete mathematics over 4 units. Unit 1 covers topics like the pigeonhole principle, finite combinatorics, and generating functions. Unit 2 discusses partial and linear orderings, lattices, and Boolean algebras. Unit 3 defines various types of graphs like trees, bipartite graphs, and planar graphs. The course aims to provide students with core knowledge in discrete structures and their applications.

Uploaded by

snehasispal.sp
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Course Name: Real Analysis

Course Code: Core – 1 Course Credit: 4

Unit Course Details


No.

Unit – Review of algebraic and order properties of R, ε-neighborhood of a point in R.


1 Idea of countable sets, uncountable sets and uncountability of R. Bounded above
sets, bounded below sets, bounded sets, unbounded sets. Suprema and infima.
Construction of Reals from Rationals, Cantor’s nested interval Theorem,
Completeness property of R and its equivalent properties. The Archimedean
property, density of rational (and irrational) numbers in R, intervals. Limit
points of a set, isolated points, open set, closed set, derived set, Bolzano-
Weierstrass theorem for sets, compact sets in R, Heine-Borel Theorem.
Unit – Sequences, bounded sequence, convergent sequence, limit of a sequence, lim
2 inf, lim sup. Limit theorems. Monotone sequences, monotone convergence
theorem. Subsequences, divergence criteria. Monotone subsequence theorem,
Bolzano Weierstrass theorem for sequences. Cauchy sequence, Cauchy’s
convergence criterion.
Unit – Infinite series, convergence and divergence of infinite series, Cauchy criterion,
3 tests for convergence: comparison test, limit comparison test, D’Alembert’s
test, Raabe’s test, Cauchy’s nth root test, Gauss test, Logarithmic test, Integral
test. Alternating series, Leibniz test. Absolute and conditional convergence,
Rearrangement of series, Riemann’s theorem on conditionally convergent
series.
References:
1. R.G. Bartle and D. R. Sherbert, Introduction to Real Analysis, 3rd Ed., John Wiley and
Sons (Asia) Pvt. Ltd., Singapore, 2002.
2. S.K. Berberian, A First Course in Real Analysis, Springer Verlag, New York, 1994.
3. Terence Tao, Analysis – I, Hindustan Book Agency, 2009.
4. Richard R. Goldberg, Methods of Real Analysis, Oxford and IBH Publishing Co. Pvt.
Ltd.
5. S. Abbott, Understanding Analysis, Undergraduate Text in Mathematics, Springer.
6. W. Rudin, Principles of Mathematical Analysis, Macgraw Hill Inc.
7. Apostol, Mathematical Analysis, Narosa Publication.

Pre-requisites for the course: 10 + 2 level mathematics


Course Name: Geometry and Linear Algebra

Course Code: Core – 2 Course Credit: 4

Unit Course Details


No.
Unit – Pole and polars. Diameters and conjugate diameters. Systems of conics. Polar
1 equation of a conic referred to a focus as pole. Equations of tangent, normal,
chord of contact. Sphere: General Equation. Great circle, Sphere through the
intersection of two spheres. Radical Plane, Tangent, Normal. Cone: Right circular
cone. General homogeneous second degree equation. Section of cone by a plane
as a conic and as a pair of lines. Condition for three perpendicular generators.
Reciprocal cone. Cylinder: Generators parallel to either of the axes, general form
of equation. Right-circular cylinder. Ellipsoid, Hyperboloid, Paraboloid:
Canonical equations only. Tangent planes, Normal, Enveloping cone. Generating
lines of hyperboloid of one sheet and hyperbolic paraboloid.
Unit – Vectors in ℝn, notions of linear independence and dependence, linear span of a
2 set of vectors, vector subspaces of ℝn, basis of a vector subspace. Systems of
linear equations, matrices and Gauss elimination, row space, null space, column
space, rank of a matrix. Vector spaces (over R or C), subspaces, algebra of
subspaces, quotient spaces, linear combination of vectors, linear span, linear
independence, basis and dimension.
Unit – Linear transformations, null space, range, rank and nullity of a linear
3 transformation, matrix representation of a linear transformation, Different
notion of matrices, Eigen values, Eigen vectors and characteristic equation of a
matrix. Cayley-Hamilton theorem. Algebra of linear transformations.
Isomorphisms. Isomorphism theorems, invertibility and isomorphisms, change
of coordinate matrix.
References:
1. R.J.T. Bell, Elementary Treatise on Coordinate Geometry of Three Dimensions,
McMillan India Ltd., 1994.
2. M.C. Chaki, A Text Book of Analytical Geometry, Calcutta Publishers., 1979
3. Stephen H. Friedberg, Arnold J. Insel, Lawrence E. Spence, Linear Algebra, 4th Ed.,
Prentice- Hall of India Pvt. Ltd., New Delhi, 2004.
4. Kenneth Hoffman, Ray Alden Kunze, Linear Algebra, 2nd Ed., Prentice-Hall of India
Pvt. Ltd., 1971.
5. S. Kumaresan, Linear Algebra- A Geometric Approach, Prentice Hall of India, 1999.
6. S. Lang, Introduction to Linear Algebra, 2nd Ed., Springer, 2005.
7. S.L. Loney, The Elements of Coordinate Geometry, McMillan and Company, London.
8. Gilbert Strang, Linear Algebra and its Applications, Thomson, 2007.

Pre-requisites for the course: 10 + 2 level mathematics


Course Name: Mathematics – 1

Course Code: Minor – 1 Course Credit: 4

Unit No. Course Content


Unit – 1 General equation of second degree, concept of poles and polars, diameters &
conjugate diameters, system of circles, Polar equation of a conic. Sphere,
equation of circle in three dimensions, conicoids.
Unit – 2 Triple products of vectors – its properties and application to geometry and
mechanics. Vector functions: gradient, divergence, curl, line, surface, volume
integral and allied theorems.
Unit – 3 Successive differentiation and Leibnitz theorem. Rolle’s theorem (statement
only), Lagrange’s mean value theorem, Taylor’s theorem, Maclaurin’s series
and expansion of standard function, Indeterminate forms, Maxima and
Minima, point of inflexion. Function of several variables – limit, continuity,
partial derivatives. Euler’s theorem.
Unit – 4 Fundamental theorem of integral calculus, properties of definite integrals,
Improper integrals, Beta and Gamma functions, application of definite
integrals to geometric problems. Multiple integrals.
References 1. S. L. Loney, The Elements of Coordinate Geometry, McMillan and
Company, London.
2. R.J.T. Bell, Elementary Treatise on Coordinate Geometry of Three
Dimensions, McMillan India Ltd., 1994.
3. S.K. Berberian, A First Course in Real Analysis, Springer Verlag, New
York, 1994.
4. M. R. Speigel, Schaum’s outline of Vector Analysis
5. T. M. Apostol, Calculus, Volumes I and II
Pre-requisites for the course: 10 + 2 level mathematics
Course Name: Computer Science – 1

Course Code: Minor – 1 Course Credit: 4 (3 for Theory and 1 for Practical)

Unit No. Course Content


Unit – 1 Language Design and Translation Issues: Programming Language Concepts,
Paradigms and Models, Programming Environments, Virtual Computers and
Binding Times, Programming Language Syntax, Stages in Translation, Formal
Transition Models, Elementary Data Types: Properties of Types and Objects,
Scalar and Composite Data Types.
Unit – 2 Programming in C: Tokens, Identifiers, Data Types, Sequence Control,
Subprogram Control, Arrays, Structures, union, String, Pointers, Functions, File
Handling, Command Line Arguments, Preprocessor.
Unit – 3 Object Oriented Programming: Class, Object, Instantiation, Inheritance,
Encapsulation, Abstract Class, Polymorphism.
Unit – 4 Programming in C++: Variables and Constants, Data Types, Operators, Control
Statements, Functions parameters passing, Virtual Functions, Class and
Objects, Constructors and Destructors, Overloading, Inheritance, Templates,
Exception and Event Handling, Streams and Files, Multifile Programs.
Unit – 5 Web Programming: HTML, DHTML, XML, Scripting, Java, Servlets, Applets.

References 1. Robert W. Sebesta: Concepts of Programming Languages, Pearson.


2. Grady Booch, Robert A. Maksimchuk, Michake W Engle, Bobbi J. Young,
Jim Connalen, Kelli A. Houston: Object-Oriented Analysis and Design
with Applications
3. Dennis Ritchie, Brian Kerninghan: The C Programming Language,
Addition-Wesley
4. Bjarne Stroustrup: The C++ Programming Language, Addition-Wesley

Pre-requisites for the course: 10 + 2 level mathematics


Course Name: Discrete Mathematics

Course Code: MDC – 1 Course Credit: 3

Unit No. Course Content


Unit – 1 Pigeon hole principle. Finite combinatorics. Generating functions. Partitions.
Recurrence relations. Linear difference equations with constant coefficients.

Unit – 2 Partial and linear orderings. Chains and antichains. Lattices. Distributive
lattices. Complementation. Boolean algebras, Duality, Atoms, Boolean
functions. Normal forms.

Unit – 3 Graphs: Subgraph, Complete graph, Bipartite graph, Connected graph, Tree,
Eulerian graph, Hamiltonian graph, planar graph.

References 1. Discrete Mathematics: Theory and Applications, D. S. Malik and M. K.


sen, Cengage Learning, 2013.
2. Discrete Mathematics, Seymour Lipschutz and Marc Lars Lipson,
Schaum.s Outlines
3. Graph Theory, Frank Harary, Narosa Publ. House Pvt. Ltd., 1988
4. Introduction to Graph Theory, Douglas B. west, Prentice-Hall of India,
2003.
5. Discrete and Combinatorial Mathematics, Ralph P. Grimaldi, Addison-
Wesley Publ. Company, 1994.
6. Discrete Mathematics, Richard Johnsonbaugh, Pearson Education India,
2001.
7. Discrete Mathematics, Norman L. Biggs, Oxford University Press, 2003.
8. Introduction to Graph Theory, D. S. Malik, M. K. Sen and S. Ghosh,
Cengage Learning, 2014.
9. Essentials of Discrete Mathematics, David J. Hunter, Jones & Barlett
Student Edition, 2019.
10. Introductory Discrete Mathematics, V. K. Balakrishnan, Prentice-Hall
International Edition, 1991.
11. Introduction to Deiscrete Mathematics, M. K. Sen and B. C. Chakraborty,
Books and Allied Pvt. Ltd., 2002.
12. Discrete Mathematics for Computer Scientists & Mathematicians, J. L.
Mott, A. Kandel and T. P. Baker, Prentice-Hall of India, 2009.
Pre-requisites for the course: 10 + 2 level mathematics
Course Name: MATLAB Programming

Course Code: SEC – 1 Course Credit: 3 (2 for Theory and 1 for Practical)

Unit No. Course Details

Unit – 1 Introduction to MATLAB: Command window, Editor Window, Figure


Window, Help Window; Data Types in MATLAB: Scalars, Vectors, Arrays,
Strings; Matrix manipulation: Matrix addition, Matrix subtraction, Matrix
multiplication, Element-by-Element operations.
Unit – 2 Relational and Logical Operators, Conditional statements: if-end structure,
if-else-end structure, switch-case, Loop: for-end loop, while-end loop,
nested loops; break and continue,
Unit - 3 Different inbuilt functions, Common system commands, Syntax and
Operators, Programming in MATLAB through M-file Editor, User defined
functions, M-file function.
Unit – 4 Two-dimensional Plot: Plot of given data, plot of a given function, Multiple
graphs in the same plot; Formatting a plot, Symbolic Math.
References 1. Amos Gilat, MATLAB: An Introduction with Applications, John
Wiley, 2005
2. Peter I. Kattan, MATLAB for Beginners: A Gentle Approach, Petra
Books
3. Rudra Pratap, Getting Started with MATLAB: A Quick Introduction
for Scientists & Engineers, Oxford University Press, 2019.
4. R.K. Bansal, A.K. Goel, M.K. Sharma, MATLAB and its applications in
Engineering, Pearson, 2010.
Pre-requisites for the course: 10+2 mathematics
Course Name: English

Course Code: AEC – 1 Course Credit: 2

Provided by the Faculty

Course Name: Provided by the Faculty

Course Code: CVAC – 1 Course Credit: 4

Provided by the Faculty

You might also like