Program Structure for Second Year Computer Engineering

UNIVERSITY OF MUMBAI (With Effect from 2020-2021)

Semester IV

Teaching Scheme
Course Credits Assigned
Course Name (Contact Hours)
Code
Theory Pract. Tut. Theory Pract. Tut. Total
Engineering Mathematics-
CSC401 3 -- 1* 3 -- 1 4
IV
CSC402 Analysis of Algorithm 3 -- -- 3 -- -- 3
Database Management
CSC403 3 -- -- 3 -- -- 3
System
CSC404 Operating System 3 -- -- 3 -- -- 3
CSC405 Microprocessor 3 -- -- 3 -- -- 3
CSL401 Analysis of Algorithm Lab -- 2 -- -- 1 -- 1
Database Management
CSL402 -- 2 -- -- 1 -- 1
System Lab
CSL403 Operating System Lab -- 2 -- -- 1 -- 1
CSL404 Microprocessor Lab -- 2 -- -- 1 -- 1
Skill Base Lab Course:
CSL405 -- 2*+2 -- -- 2 -- 2
Python Programming
CSM401 Mini Project 1-B -- 4$ -- -- 2 -- 2
Total
15 16 1 15 7 1 24

Examination Scheme
Term Pract
Theory Total
Work & oral
Course End Exam.
Course Name Internal Assessment Sem. Duration
Code
Exam. (in Hrs)
Test
Test 2 Avg.
1
Engineering Mathematics-
CSC401 20 20 20 80 3 25 -- 125
IV
CSC402 Analysis of Algorithm 20 20 20 80 3 -- -- 100
Database Management
CSC403 20 20 20 80 3 -- -- 100
System
CSC404 Operating System 20 20 20 80 3 -- -- 100
CSC405 Microprocessor 20 20 20 80 3 -- -- 100
CSL401 Analysis of Algorithm Lab -- -- -- -- -- 25 25 50
Database Management
CSL402 -- -- -- -- -- 25 25 50
System Lab
CSL403 Operating System Lab -- -- -- -- -- 25 25 50
CSL404 Microprocessor Lab -- -- -- -- -- 25 -- 25
Skill Base Lab Course:
CSL405 -- -- -- -- -- 25 -- 25
Python Programming
CSM401 Mini Project 1-B -- -- -- -- -- 25 25 50
Total -- -- 100 400 -- 175 100 775
*Should be conducted batchwise and
$ indicates workload of Learner (Not Faculty), Students can form groups with minimum 2 (Two)
and not more than 4 (Four), Faculty Load: 1 hour per week per four groups.
Course Code Course Name Credits
CSC401 Engineering Mathematics-IV 4

Pre-requisite: Engineering Mathematics-I, Engineering Mathematics-II, Engineering

Mathematics-III, Binomial Distribution.

Course Objectives: The course aims to learn:

1 Matrix algebra to understand engineering problems.
2 Line and Contour integrals and expansion of a complex valued function in a power series.
3 Z-Transforms and Inverse Z-Transforms with its properties.
4 The concepts of probability distributions and sampling theory for small samples.
5 Linear and Non-linear programming problems of optimization.

Course Outcomes: On successful completion, of course, learner/student will be able to:

1 Apply the concepts of eigenvalues and eigenvectors in engineering problems.
2 Use the concepts of Complex Integration for evaluating integrals, computing residues &
evaluate various contour integrals.
3 Apply the concept of Z- transformation and inverse in engineering problems.
4 Use the concept of probability distribution and sampling theory to engineering problems.
5 Apply the concept of Linear Programming Problems to optimization.
6 Solve Non-Linear Programming Problems for optimization of engineering problems.

Module Detailed Contents Hours

1 Linear Algebra (Theory of Matrices) 7
1.1 Characteristic Equation, Eigenvalues and Eigenvectors, and properties
(without proof)
1.2 Cayley-Hamilton Theorem (without proof), verification and reduction
of higher degree polynomials
1.3 Similarity of matrices, diagonalizable and non-diagonalizable matrices
1.4 Self-learning Topics: Derogatory and non-derogatory matrices,
Functions of Square Matrix, Linear Transformations, Quadratic forms.
2 Complex Integration 7
2.1 Line Integral, Cauchy’s Integral theorem for simple connected and
multiply connected regions (without proof), Cauchy’s Integral formula
(without proof).
2.2 Taylor’s and Laurent’s series (without proof).
2.3 Definition of Singularity, Zeroes, poles off(z), Residues, Cauchy’s
Residue Theorem (without proof)
2.4 Self-learning Topics: Application of Residue Theorem to evaluate real
integrations.
3 Z Transform 5
3.1 Definition and Region of Convergence, Transform of Standard
Functions:
{𝑘 𝑛 𝑎𝑘 }, {𝑎|𝑘| }, { 𝑘+𝑛𝑛𝐶. 𝑎𝑘 }, {𝑐 𝑘 sin(𝛼𝑘 + 𝛽)}, {𝑐 𝑘 sinh 𝛼𝑘}, {𝑐 𝑘 cosh 𝛼𝑘}.
3.2 Properties of Z Transform: Change of Scale, Shifting Property,
Multiplication, and Division by k, Convolution theorem.
3.3 Inverse Z transform: Partial Fraction Method, Convolution Method.
3.4 Self-learning Topics: Initial value theorem, Final value theorem,
Inverse of Z Transform by Binomial Expansion
4 Probability Distribution and Sampling Theory 7
4.1 Probability Distribution: Poisson and Normal distribution
 4.2 Sampling distribution, Test of Hypothesis, Level of Significance,
Critical region, One-tailed, and two-tailed test, Degree of freedom.
4.3 Students’ t-distribution (Small sample). Test the significance of mean
and Difference between the means of two samples. Chi-Square Test:
Test of goodness of fit and independence of attributes, Contingency
table.
4.4 Self-learning Topics: Test significance for Large samples, Estimate
parameters of a population, Yate’s Correction.
5 Linear Programming Problems 6
5.1 Types of solutions, Standard and Canonical of LPP, Basic and Feasible
solutions, slack variables, surplus variables, Simplex method.
5.2 Artificial variables, Big-M method (Method of penalty)
5.3 Duality, Dual of LPP and Dual Simplex Method
5.4 Self-learning Topics: Sensitivity Analysis, Two-Phase Simplex
Method, Revised Simplex Method.
6 Nonlinear Programming Problems 7
6.1 NLPP with one equality constraint (two or three variables) using the
method of Lagrange’s multipliers
6.2 NLPP with two equality constraints
6.3 NLPP with inequality constraint: Kuhn-Tucker conditions
6.4 Self-learning Topics: Problems with two inequality constraints,
Unconstrained optimization: One-dimensional search method (Golden
Search method, Newton’s method). Gradient Search method

References:
1 Erwin Kreyszig, “Advanced Engineering Mathematics”, John Wiley & Sons.
2 R. K. Jain and S. R. K. Iyengar, “Advanced Engineering Mathematics”, Narosa.
3 Brown and Churchill, “Complex Variables and Applications”, McGraw-Hill Education.
4 T. Veerarajan, “Probability, Statistics and Random Processes”, McGraw-Hill Education.
5 Hamdy A Taha, “Operations Research: An Introduction”, Pearson.
6 S.S. Rao, “Engineering Optimization: Theory and Practice”, Wiley-Blackwell.
7 Hira and Gupta, “Operations Research”, S. Chand Publication.

Term Work:
General Instructions:
1 Batch wise tutorial shave to be conducted. The number of students per batch will be as per
University pattern for practical.
2 Students must be encouraged to write at least 6 class tutorials on the entire syllabus.
3 A group of 4-6 students should be assigned a self-learning topic. Students should prepare a
presentation/problem solving of 10-15 minutes. This will be considered as a mini project in
Engineering Mathematics. This project will be graded out of 10 marks depending on the
performance of the students.
The distribution of Term Work marks will be as follows:
1 Attendance (Theory and Tutorial) 05 marks
2 Class Tutorials on entire syllabus 10 marks
3 Mini project 10 marks

Assessment:
Internal Assessment Test:
The assessment consists of two class tests of 20 marks each. The 1stclass test (Internal
Assessment I) has to be conducted when approximately 40% of the syllabus is completed. The
2nd class test has to be conducted (Internal Assessment II) when an additional 35% syllabus is
completed. The duration of each test will be for one hour.

End Semester Theory Examination:

1 The question paper will comprise a total of 6 questions, each carrying 20 marks.
2 Out of the 6 questions, 4 questions have to be attempted.
3 Question 1, based on the entire syllabus, will have 4sub-questions of 5 marks each and is
compulsory.
4 Question 2 to Question 6 will have 3 sub-questions, each of 6, 6, and 8 marks, respectively.
5 Each sub-question in (4) will be from different modules of the syllabus.
6 Weightage of each module will be proportional to the number of lecture hours, as
mentioned in the syllabus.