Department of Applied Mathematics

Delhi Technological University,

(Formerly Delhi College of Engg.)
Bawana Road, Delhi – 42.

(Mathematics and Computing)

Scheme and Detail of courses for 2nd year B.Tech.

Semester-III
S.No. Course Category Course Code Course Title Credits

1. Interdisciplinary Engineering MC 209 Data Structure 4

Science Course-1 (ESC)
2. Departmental Core Course-2 MC 201 Real Analysis 4
(DCC)
3. Departmental Core Course-3 MC 203 Modern Algebra 4
(DCC)
4. Departmental Core Course-4 MC 205 Probability and Statistics 4
(DCC)
5. Departmental Core Course-5 MC 207 Database Management 4
(DCC) Systems
6. AEC/VAC* 2
Total 22
*To be floated centrally

Semester-IV
S.No. Course Category Course Code Course Title Credits

1. Interdisciplinary Engineering MC 210 Operating Systems 4

Science Course-2 (ESC)
2. Departmental Core Course-6 MC 202 Analysis and Design of 4
(DCC) Algorithms
3. Departmental Core Course-7 MC 204 Scientific Computing 4
(DCC)
4. Departmental Core Course-8 MC 206 Differential Equations 4
(DCC)
5. Departmental Core Course-9 MC 208 Linear Algebra 4
(DCC)
6. AEC/VAC* 2
Total 22
*To be floated centrally

0
 Department of Applied Mathematics
Delhi Technological University,
(Formerly Delhi College of Engg.)
Bawana Road, Delhi – 42.

(Mathematics and Computing)

Scheme and Detail of courses for 2nd year B.Tech.

Scheme and details of courses of 3rd semester

Teaching Scheme Contact hours / week
S.No. Subject Course Title Subject Credit L T P
Code area
1 MC201 Real Analysis DCC 4 3 1 0

2 MC203 Modern Algebra DCC 4 3 1 0

3 MC205 Probability and Statistics DCC 4 3 0 2

4 MC207 Database Management DCC 4 3 0 2

Systems
5 MC209 Data Structure ESC 1 4 3 0 2

6 AEC/VAC* 2
Total Credit 22
*To be floated centrally

Scheme and details of courses of 4th semester

Teaching Scheme Contact hours / week
S.No. Subject Course Title Subject Credit L T P
Code area
1 MC202 Analysis and Design DCC 4 3 1 0
of Algorithms
2 MC204 Scientific Computing DCC 4 3 0 2

3 MC206 Differential Equations DCC 4 3 0 2

4 MC208 Linear Algebra DCC 4 3 1 0

5 MC210 Operating Systems ESC 2 4 3 0 2

6 AEC/VAC* 2
Total Credit 22
*To be floated centrally

1
 THIRD SEMESTER
Details of Course

Course Title Course Structure Pre-Requisite

MC 201 : Real Analysis L T P Nil
3 1 0

Course Objective: To impart knowledge of real numbers system, sequences, metric spaces, and
Riemann integral.

Course Outcome (CO):

CO1 Describe the basic concepts of Real numbers system, sets and bounds.
CO2 Explain the convergence of real sequences.
CO3 Demonstrate the understanding of Metric spaces and its topology.
CO4 Explain continuity and uniform continuity in Metric spaces.
CO5 Identify the Riemann integrability of a given function.

S. No. Contents Contact

hours
1. Real number system ℝ, Peano’s Postulate/Axiom, countable and 8
uncountable sets, concepts of bounds, least upper bound & greatest lower
bound, order and completeness properties of ℝ, Archimedean property of
real numbers.

2. Definition of real sequence, sub-sequence, bounded sequence, 9

convergence of a sequence (Limit of a sequence), monotone sequences and
their convergence, operations on convergent and divergent sequences,
Bolzano-Weierstrass theorem for sequences, Cauchy sequence, Cauchy’s
general principle for convergence, Nested intervals.
3. Definition and examples of Metric Spaces, limits of functions in a metric 9
space, Pseudo metric space, Euclidean space, continuity of functions, open
and closed spheres, open sets, closed sets, closure, inverse image of an
open or a closed set, convergent sequences in metric space.

4. Cluster points, Convergent sequences in metric space, Cauchy sequence in 8

a metric space, Neighbourhood.
5. Concept of set of measure zero, Riemann sums, Riemann integral, criterion 8
for integrability, properties of Riemann integral, fundamental theorem of
calculus.
Total 42

2
Suggested Books:

S. No. Name of Books/Authors/Publishers Year of

Publicati
1 Richard R. Goldberg, Methods of Real Analysis, Oxford & IBH publishing Co. on
2020
Pvt. Ltd.
2 Bartle, R.G., and Sherbert, D.R., Introduction to real analysis (4th edition), 2011
John Wiley & Sons, Inc., New York.

3 Mathematical Analysis, Apostol, Narosa pub. House (2nd Edition). 2002

4 Mathematical Analysis, S.C. Malik and Savita Arora (5th Edition) New Age 2017
International publishers.
5 Principles of Mathematical Analysis, Walter Rudin, 3rd Edition, Mc Draw 2017
Hill.

3
Details of Course

Course Title Course Structure Pre-Requisite

MC 203 : Modern Algebra L T P Basic knowledge of set
3 1 0 theory

Course Objective: To impart the knowledge of algebraic structure of Groups, Rings,

Integral Domains and Fields.

Course Outcome (CO):

CO1 Identify different algebraic structures like groups, rings, fields etc. and to apply them
in various science related problems.
CO2 Apply concepts of abstract algebra with various scientific tools to evolve new ideas to
solve practical problems.

CO3 Demonstrate problem solving skills in the context of abstract algebra topics through
consideration of examples, pattern exploration, conjecture, proof construction, and
generalization of results.

CO4 Apply algebraic concepts such as groups and ring theory to model, analyze and solve
real-world problems.

CO5 Comprehend abstract definitions and theorem statements by building examples and
non-examples of definitions, and drawing conclusions using definitions and theorems
given mathematical information.

S. No. Contents Contact

hours
1. Groups, Abelian groups, Subgroups, Centre of a group, Order of a group 08
and an element, Cyclic groups, groups of prime order. Cayley’s digraph
of cyclic groups.
2. Permutation groups, Alternating subgroup, Important examples of 09
groups such as S3(Symmetric group of order 6), K4 (Klein’s 4 –group)
and Q8 (Quaternion group) groups. Cosets, Lagrange’s Theorem for
finite groups, Normal subgroup, Quotient group.
3. Group Homomorphism, Isomorphism, Kernel of group homomorphism, 09
Fundamental theorem of group homomorphism, Cayley’s theorem.

4. Ring, Subring, Integral domain, Field, Ideal of a ring, Quotient ring, Ring 08
homomorphism, Isomorphism, and some elementary properties.
5. Prime ideal, Maximal ideal, Ring of polynomials and their properties. 08
Total 42

4
Suggested Books:
S. No. Name of Books/Authors/Publishers Year of
Publication
1 Joseph A. Gallian, Contemporary Abstract Algebra (10th Edition), Narosa 2021
Publishing House.
2 N. S. Gopalakrishnan, University Algebra, New Age International 2004
Publishers.
3 I. N. Herstein, Topics in Algebra (2nd Edition), Wiley Eastern Limited 2006
4 Khanna and Bhamri, A course in Abstract Algebra (5th Edition), Vikas 2017
Publishing House.
5 D. S. Dummit and R. M. Foote, Abstract Algebra (3rd Edition), John 2011
Wiley and Sons.

5
Details of Course

Course Title Course Structure Pre-Requisite

L T P
MC 205: Probability & Statistics 3 0 2 Nil

Course Objective: To acquire knowledge on descriptive statistics, random variables, specific

probability distributions and their real life applications specifically, in science and engineering.
Acquaintance with the tools for the large and small sample testing.

Course Outcome (CO):

CO1 Prepare the data set and Summarize its main features. (exploratory data analysis). Also
student shall be able to calculate and infer for real problems on the basis of
probabilistic theory.
CO2 Describe and identify the various probability distribution function and infer their
statistical properties. The student shall be able to derive the relation between bivariate
random variables.
CO3 Analyze and apply the laws of Sampling. Also, be able to perform random sampling,
identify the methods of estimation and main properties of estimators and find
confidence intervals for parameter estimates.
CO4 Compute and interpret the results of Bivariate Regression and Correlation Analysis, for
forecasting and investigating the relationships between them. Define and perform
hypothesis testing and perform ANOVA.
CO5 Demonstrate the qualitative and quantitative properties of data using appropriate
diagrams, tabulations, hypotheses testing and summaries using SPSS.

S.No. Contents Contact

Hours
1 Descriptive statistics, Axioms on probability, Conditional probability, 8
Addition and multiplication rules, Bayes’ Theorem. Random variables: Discrete
and Continuous, Probability mass and density functions, Joint marginal and
conditional distributions.
2 Mathematical Expectation, Variance, Covariance, Moment generating 8
function, Markov’s inequality, Chebyshev’s inequality. Correlation and
Regression, Rank Correlation.
3 Binomial, Negative binomial, Poisson, Geometric, Hypergeometric, 8
U n i f o r m , Normal, Exponential, Gamma, Weibull, Erlang and Beta
distributions
4 Central limit theorem. Types of sampling, Parameter and statistic. Sampling 9
distribution, Confidence intervals, Hypothesis testing, Sampling of attributes
and variables, Tests of significance for large sample testing.
5 Exact sampling distributions: Chi-square, Student’s t, Snedecor’s F and their 9
applications. ANOVA: one and two-way classification.
Total 42

6
Suggested Books
S.No Name of Books/Authors/Publishers Year of
Publication
1 Sheldon M. Ross, Introduction to Probability and Statistics for 2021
Engineers and Scientists, Academic Press.
2. Probability and Statistics for Engineers and Scientists, Walpole 2013
3 Fundamentals of Mathematical Statistics, S C Gupta & V K Kapoor, Sultan 2017
Chand and Sons.
4 Meyer, Introductory Probability and Statistical Application, Oxford and IBH 2002
Publishing.
5 Kishor S. Trivedi, Probability and Statistics with Reliability, Queuing and 2006
Computer Science Application, Wiley.

7
Details of Course:

Course Title Course Structure Pre-Requisite

MC 207 : L T P NIL
Database Management 3 0 2
System

Course Objective: To provide knowledge about the principles, concepts and applications of
Database Management System.

Course Outcome (CO):

CO1 Describe the fundamental elements of relational database management systems and
related concepts.
CO2 Explain the basic concepts of different data models, relational database design,
relational algebra, and SQL and Design ER-models to represent real-life database
applications.
CO3 Apply the concepts to design the relational database from the ER-model and formulate
SQL and PL/SQL queries for implementation and maintenance of the database.
CO4 Improve the database design by performing the concept of normalization.
CO5 Apply basic database storage structures and access techniques like file and page
organizations, indexing methods including B tree, and hashing for optimal database
organization.

S. No. Contents Contact

hours
1. Introduction: Database system concepts and its architecture, Data 8
models, schema and instances, Data independence and data base
language and interface, Data definition languages, DML
Data modeling using Entity Relationship Model: ER model concept,
notation for ER diagrams mapping constraints, Keys, Concept of super
key, candidate key, primary key generalizations, Aggregation,
transforming ER diagrams to tables, extended ER model.
2. Relational Data Model and Language: Relational data model concepts, 9
integrity constraints, Keys domain constraints, referential integrity,
assertions, triggers, Database language, Relational algebra, relational
calculus, domain and tuple calculus, SQL data definition queries and
updates in SQL.
3. Database Design: Functional dependencies, normal forms, 1NF, 2NF, 8
3NF and BCNF, multi-valued dependencies, fourth normal form, join
dependencies and fifth normal forms, loss less join decompositions,
normalization using FD, MVD and JDs.
4. File Organization, Indexing and Hashing: Basic concepts, Static Hashing, 8
Dynamic Hashing, Ordered indices, Multi-level indexes, B-Tree index
files, B+-Tree index files, Buffer Management

8
 5. Transaction processing concepts: Transaction processing 9
system, schedule and recoverability, Testing of serializability,
serializability of schedules, conflict & view serializable schedule
recovery from transaction failures, deadlock handling.
Concurrency Control Techniques: Locking Techniques, time stamping
protocols, multiple granularities and multi-version schemes.
Total 42

Suggested Books:
S. No. NameofBooks/Authors/Publishers Year of
Publication
1. Elmasri, Navathe, “Fundamentals of Database systems”, Addison 2010, 6th Edition
Wesley
2. Korth, Silbertz, Sudarshan, “Data base concepts”, McGraw-Hill. 2019
3. Ramakrishna, Gehkre, “Database Management System”, 2003, 3rd Edition
McGraw-Hill

9
Details of Course:

Course Title Course Structure Pre-Requisite

MC 209 : L T P Basic Mathematics and
Data Structure 3 0 2 Discrete structures

Course Objective: To introduce the concept of complexity of algorithms and to introduce different
kinds of data structures with their respective operations.

Course Outcome (CO):

CO1 Represent and organize data using different data structures.

CO2 Design algorithms to create and manipulate data structures.
CO3 Estimate and compare the performance of various operations performed on the data
structures.
CO4 Employ various sorting techniques to sort the data.
CO5 Illustrate the usage of hashing functions and collision resolution techniques.

S. No. Contents Contact

hours
1. Introduction: Introduction to abstract data types, design, implementation 10
and applications. Introduction to Algorithm, Time complexity and Space
complexity Trade off. Introduction Arrays and Strings: Representation of
Arrays in Memory: one dimensional, Two dimensional and
Multidimensional, operations on array. Strings and String Operations.
Stacks: Introduction, Operations on Stacks, Array representation of Stacks
Applications of Stacks: recursion, Polish expression and their compilation
conversion of infix expression to prefix and postfixexpression.
Queues: Introduction, Operations of Queues, Representations of Queues
Applications of Queues, Priority queues.
2. Linked Lists: Singly linked lists, Representation of linked list, Operations of 7
Linked list such as Traversing, Insertion and Deletion, Searching.
Applications of Linked List. Concepts of Circular linked list and Doubly
linked list and their Applications. Stacks and Queues as linked list.
3. Graphs: Introduction to types of graphs, representation and transversal, 10
shortest path, and transitive closure. Activity networks, topological sort,
and critical paths. Spanning trees, Binary search trees, various operations
on Binary search trees like traversing, searching, Insertion and Deletion.
Applications of Binary search Trees, Complete Binary trees, Extended
binary trees. General trees, AVL trees, Threaded trees, B trees, B+ trees.
4. Sorting: Insertion Sort, Quick sort, Merge sort, Heap sort, sorting 8
on different keys, External sorting.
5. File Structure: File Organization, Indexing & Hashing, Hashing Functions, 7
Collision Resolution Techniques.
Total 42

10
Suggested Books:
S. No. Name of Books/Authors/Publishers Year of
Publication
1. “Fundamentals of Data structures in C”, E. Horowitz, Sartaj Sahni, Susan 2017
Anderson-Freed, Universities Press
2. “Data Structures using C”, Tannenbaum, Yedidyah Langsam, Augenstein, 2019
Pearson.
3. “An introduction to data structures with application”, Jean Paul 2017
Tremblay & Pal G. Sorenson, McGraw Hill
4. “Data Structure and Program Design in C”, R.L. Kruse, B.P. Leary, 2009
C.L. Tondo, PHI

11
 FOURTH SEMESTER

Details of Course:

Course Title Course Structure Pre-Requisite

MC 202: L T P Data Structures
Algorithm Design and 3 1 0
Analysis

Course Objective: To introduce the concept of algorithmic efficiency by analyzing various

algorithms such as Searching,Sorting, Divide-and-Conquer algorithms and to know detail
about Greedy Paradigm, Principle of Dynamic Programming, Back Tracking, Branch and
Bound, and Computational Complexity.

Course Outcome (CO):

CO1 Design efficient algorithms for real-life problems using different algorithmic
paradigms and identify the limitations of each algorithmic paradigms for problem
solving
CO2 Design and analyze the running time of algorithms in terms of asymptotic notation.
CO3 Describe different paradigms of algorithm design, such as Divide & Conquer, Greedy,
Dynamic Programming, etc., and conclude the correctness.
CO4 Compare the notion of tractable and intractable problems and develop algorithms
for computationally intractable problems.
CO5 Solve and analyze the inter-disciplinary real-world problems including sorting
problems, trees and graphs problems, and recurrence relations.

S. Contents Contact
No. hours
1. Introduction: Concept of algorithmic efficiency, run time analysis of 8
algorithms, Asymptotic Notations. Growth of Functions, Recurrence
Relation, Master’s Theorem, Correctness of Algorithm.
Divide and Conquer Approach: Introduction, Analysis of Run time and
Correctness of divide and conquer based Searching and Sorting
algorithms, Heap sort, Strassen’s matrix multiplication.

2. Greedy Method: Overview of the greedy paradigm examples of exact 9

optimization solution: minimum cost spanning tree, approximate
solutions: Knapsack problem, Kruskal’s algorithm and Prim’s algorithm
for finding Minimum cost spanning tree, Dijkstra’s algorithm for single
source shortest path problem.

3. Dynamic programming: Principle of dynamic programming. 8

Applications: Bellman Ford Algorithm for single source shortest path
problem, Floyd-Warshall algorithm for all pair shortest path problem,
0/1 Knapsack Problem, Matrix chain multiplication, Traveling salesman
Problem, longest Common sequence (LCS).
12
4. Back tracking: Overview, 8-queen problem, and 0/1 Knapsack problem, 8
Subset Sum Problem, Traveling Salesman problem.
Branch and bound: LC searching Bounding, FIFO branch and
bound, LC branch and bound application: 0/1 Knapsack problem.

5. Computational Complexity: Complexity measures, Polynomial Vs 9

non-polynomial time complexity; NP-hard and NP-complete classes,
examples: Circuit Satisfiablity, Vertex cover, Subset Sum problem,
Randomized Algorithms, String Matching, NP-Hard and NP-
Completeness, Approximation Algorithms, Sorting Network, Matrix
Operations, Polynomials and FFT, Number Theoretic Algorithms.
Total 42

Suggested Books:
S. No. Name of Books/Authors/Publishers Year of
Publication
1. Cormen, Thomas H., Charles E. Leiserson, Ronald L. Rivest, and Clifford 4th
Stein. “Introduction to Algorithms”, MIT Press. edition
2022
2. Horowitz, Ellis, Sartaj Sahni, and Sanguthevar Rajasekaran. “Computer 1997
algorithms C++: C++ and pseudocode versions” Macmillan.
3. Sara Baase and Allen Van Gelder. “Computer algorithms: 3rd
introduction to design and analysis” Pearson Education India, 2009. edition
2009

13
Details of Course

Course Title Course Structure Pre-Requisite

MC 204 : Scientific L T P Nil
Computing 3 0 2

Course Objective: The course will develop numerical methods aided by technology to solve
algebraic, transcendental, and differential equations, and to calculate derivatives and
integrals. The course will also develop an understanding of the elements of error analysis
for numerical methods and certain proofs. The course will further develop problem solving
skills.

Course Outcome (CO):

CO1 Apply numerical methods to obtain the errors and the approximate solutions to the
linear and non-linear transcendental and polynomial equations.
CO2 Describe the Eigen value problems for the system of linear algebraic equations and
analyze the applications.
CO3 Identify numerical methods for various mathematical operations and tasks, such as
interpolation formulae like forward, backward, and divided difference formulae.
CO4 Apply the appropriate techniques for numerical differentiation and integration
problems
CO5 Design the numerical solution of initial value problems of the ordinary differential
equations with implicit and explicit methods as appropriate

S. No. Contents Contact

hours
1. Solution of Transcendental and polynomial equations: Types of error 8
in numerical methods, significant digits, Bisection method, Fixed point
iteration method, Secant method, Regula Falsi method, Newton -
Raphson method and their convergence, Solution of system of
nonlinear equations using Newton -Raphson method.
2. System of Linear Algebraic equations and Eigen value problems: Ill 8
conditioned equations, Methods for solving system of equations:
Direct and Iterative methods, convergence of iterative methods,
power method.
3. Interpolation: Finite Difference operators and their properties, 9
Interpolation of equal spacing intervals: Newton and Gauss forward
and backward formula, Bessel’s and Sterling Interpolation formulae,
Interpolation of Unequal intervals: Newton’s Divided difference
Central difference formulae: Lagrange’s method, Hermite
interpolation, Piecewise and quadratic Spline Interpolation.

14
 4. Numerical Differentiation and Integration: Optimum choice of step 8
length, Differentiation: formulae, derivatives with unequal intervals,
Integration: Newton’s Cotes formula, Gauss Quadrature formula,
Trapezoidal formula, Simpson’s (1/3)rd rule and error estimates,
Method of undetermined coefficients, Romberg integration,
Richardson Extrapolation.
5. Numerical solution of ODE: Initial Value Problems: Picard’s method, 8
Taylor series method, Convergence of Numerical methods and
Routh- Hurwitz criteria for stability, Euler’s and Modified Euler’s
method, Classical Runge- Kutta method, Predictor- Corrector method,
Milne’s method, Adams- Moulton method.
Total 42

Suggested Books:
S. No. Name of Books/Authors/Publishers Year of
Publication

1 Numerical Methods for Scientific and Engineering Computation by M. K. 2007

Jain and S.R.K. Iyengar, New Age International Publishers.

2 Applied Numerical Analysis, Gerald &Wheatley, Addison – Wesley. 2003

3 Elementary Numerical Analysis, S.D. Conte, & C. Deboor, Tata Mc- Graw 2005
hill.
4 A First Course in Numerical Methods, By Uri Ascher, SIAM 2011

5 R. S. Gupta, Elements of Numerical Analysis, 2nd Edition 2015

15
Details of Course

Course Title Course Structure Pre-Requisite

MC206: Differential L T P Basic knowledge of calculus and
Equations 3 0 2 matrix

Course Objective: To impart the knowledge of ordinary and partial differential equations and to
analyze and solve the physical problems.

Course Outcome (CO):

CO1 Evaluate linear systems of differential equations, both homogeneous and non-
homogeneous by matrix method and Sturm-Liouville boundary value problems
including orthogonality properties.
CO2 Analyse the stability of linear and non-linear differential equations through phase
portrait diagram.
CO3 Formulate partial differential equations, evaluate linear, quasi linear and non-linear
first order PDEs and address Cauchy’s problem for first order PDE.
CO4 Solve homogeneous and non- homogeneous linear PDE with constant coefficients and
classify second order PDE to determine characteristics.
CO5 Apply the method of separation of variables to solve initial and boundary value
problem including heat equation, wave equation and Laplace equation.

S. No. Contents Contact

hours
1. Ordinary differential Equations I (ODEs): Solutions of linear system of 8
differential equations (homogenous and non-homogenous) by matrix
method, Sturm-Liouville boundary values problems including
characteristic functions and orthogonality.
2. Ordinary differential equations II: Linear and Non-linear autonomous 8
systems, Phase plane, Paths, Critical Points and its types, Stability of
the critical points, Phase plane analysis, Liapunov’s direct method,
periodic solutions, limit cycle.
3. Partial differential equations I (PDEs): Formation of PDEs, Linear and 8
Quasi- linear first order PDEs (Lagrange form), Cauchy’s problem for
first order PDEs, Non-linear first order PDEs: Standard forms and
Charpit’s method.
4. Partial differential equations II: Linear Homogeneous and Non- 9
homogeneous second and higher order PDEs with constant
coefficients, Classification of second order PDEs, Characteristic
equations and characteristic curves, method of separation of
variables.
5. Applications of partial differential equations: One-dimensional heat 9
equation, one-dimensional wave equation, two-dimensional heat
equation (solution of Laplace equation in Cartesian and polar
coordinates).
Total 42
16
Suggested Books:
S. No. Name of Books/Authors/Publishers Year of
Publication

1. Martin Braun, Differential equations and their applications, Springer, 4th 1993
Edition
2. S. L. Ross, Introduction to Ordinary Differential Equations, John Wiley 1989
& Sons, 4th Ed.
3. R.K Jain and S.R.K. Iyengar, Advanced Engineering Mathematics, 2017
Narosa, 5th Ed.
4. K S Rao, Introduction to Partial Differential Equations, Prentice 2011
Hall India, 3rd Edition
5. E. Kreyszig, Advanced Engineering Mathematics, Wiley Publications, 2017
10th Edition
6. Peter V.O. Neil: Partial Differential equations: Peter V. O’Neil, Wiley 2014
Publication, 3rd Ed.

17
Details of Course

Course Title Course Structure Pre-Requisite

MC 208 : Linear Algebra L T P Nil
3 1 0

Course Objective: The objective of this paper is to impart knowledge of vector space, linear
transformation, bilinear form and Inner Product spaces.
Course Outcome (CO):

CO1 Explain computational techniques and algebraic skills essential for the study of systems
of linear equations and matrix algebra.
CO2 Apply geometric properties and strategies to model and solve problems of vector
spaces.
CO3 Compute and recognise the properties of special matrices.
CO4 Apply eigen vectors in obtaining canonical forms of matrices.
CO5 Describe inner product spaces, bilinear forms and positive definiteness of real
quadratic forms.

S. No. Contents Contact

hours
1. Vector spaces, Properties of vector spaces, Subspaces, Linear
dependence and independence, Linear span, Bases and Dimension, 8
Linear Sum, Direct Sum, Quotient Spaces.
2. Linear transformations, Range and Null spaces, Rank–Nullity 10
theorem and its application, Inverse linear transformation,
Representation of linear transformations by matrices, Change of
basis, Dual space, Dual bases .
3. Transpose of a linear transformation, Eigen values and Eigen vectors, 8
Cayley–Hamilton Theorem, Diagonalization, Minimal polynomials,
Jordan canonical form.
4. Inner product spaces, norm of a vector, orthogonality, orthonormal 8
set, orthonormal basis, Gram-Schmidt orthonormalization,
orthogonal projections, Linear functional and adjoints, Hermitian,
self-adjoint.
5. Unitary and normal operators, Bilinear forms, Symmetric and skew- 8
symmetric bilinear forms, Real quadratic forms, Positive definiteness

Total 42

18
Suggested Books:
S. No. Name of Books/Authors/Publishers Year of
Publication

1 K. Hoffmann and R. Kunze, Linear Algebra, 2nd Edition , Pearson 2015

2 Education 2002
G. Hadley, Linear Algebra, Narosa publication
3 Gilbert Strang, Linear Algebra and its applications, Cengage Learning, 2007
4th edition
4 Serge Lang, Introduction to Linear Algebra, Springer 2004
5 Linear Algebra, Fourth edition, Schaum’s outlines 2015

19
Details of Course:

Course Title Course Structure Pre-Requisite

MC 210 : L T P Nil
Operating System 3 0 2

Course Objective: To familiarize with the fundamental principles of the operating system, its
services and functionalities, the concepts of processes, synchronization and scheduling,
memory management and need for protection in computer systems.

Course Outcome (CO):

CO1 Describe the design principles and basic elements like processes, threads, memory,
files, I/O devices etc. of the operating system.
CO2 Compare the performance and design trade-offs of design options and issues involved
in process scheduling and synchronization and deadlock management.
CO3 Explain the concepts of memory management techniques and compare the design
trade-offs of methods for allocating space to files and processes for main memory,
virtual memory, and hard disk management.
CO4 Implementing operating system concepts and system calls.
CO5 Contrast the various types of operating systems and their functionalities.

S. No. Contents Contact

hours
1. Operating System – Introduction and Evolution of Operating System 8
(OS) - Batch, Interactive, Time-Sharing, Real-Time System, System
protection. Computer-System Organization and Architecture, OS
Structure - System Components, System structure, OS Services, User -
OS Interface, System Calls.
2. Process Management I - Process concept, Inter Process 8
Communication, Process operations. Process Threads - Introduction
and Multithreading Models. CPU Scheduling - Scheduling Concept,
Performance Criteria, Scheduling Algorithms, Multiple-Processor
Scheduling.
3. Process Management II - Process Concurrency - Producer Consumer 9
Problem, Critical Section problem and Solution, Mutex Locks,
Semaphores, Classical problems in Concurrency. Deadlock
Management - System Model, Deadlock Characterization, Prevention,
Avoidance, Banker's Algorithm, Deadlock Detection, Recovery from
deadlock.
4. Memory Management - Basics, Memory protection, 9
Multiprogramming with fixed partition and variable partition, Multiple
base register, Paging, Segmentation, Page Table Structure. Virtual
Memory - Basic concepts, Demand paging, Copy-on-write,
Performance, Page replacement algorithms, Thrashing.

20
 5. Disk Management - Disk Structure and its attachments, Disk 8
Scheduling Algorithms. File Management - File Concept and Access
Methods, File System structure and its Implementation, Directory
Structure and its implementation. I/O Management - I/O devices and
organization, I/O functions, I/O Buffering. Case studies – Windows
Linux and Unix
Total 42

Suggested Books:
S. No. Name of Books/Authors/Publishers Year of
Publication

1. 9th Edition/
Abraham Silberschatz, Peter B. Galvin, “Operating System Concepts”
2013
2. Andrew Tanenbaum, Albert Woodhull, “Operating Systems Design and 3rd Edition /
Implementation” 2015
3. William Stallings, "Operating Systems: Internals and Design 9th Edition /
Principles" 2018

21