AC 14/7/2016, Item No. 4.

64

UNIVERSITY OF MUMBAI

Bachelor of Engineering

First Year Engineering (Semester I & II), Revised course

(REV- 2016) from Academic Year 2016 – 17,
(Common for All Branches of Engineering)

(As per Choice Based Credit and Grading System

with effect from the academic year 2016–2017)
From Coordinator’s Desk:-

To meet the challenge of ensuring excellence in engineering education, the issue of quality needs
to be addressed, debated taken forward in a systematic manner. Accreditation is the principal means
of quality assurance in higher education. The major emphasis of accreditation process is to measure
the outcomes of the program that is being accredited. In line with this Faculty of Technology of
University of Mumbai has taken a lead in incorporating philosophy of outcome based education in
the process of curriculum development.
Faculty of Technology, University of Mumbai, in one of its meeting unanimously resolved that,
each Board of Studies shall prepare some Program Educational Objectives (PEO’s) give freedom
to affiliated Institutes to add few (PEO’s) course objectives course outcomes to be clearly defined
for each course, so that all faculty members in affiliated institutes understand the depth approach of
course to be taught, which will enhance learner’s learning process. It was also resolved that,
maximum senior faculty from colleges experts from industry to be involved while revising the
curriculum. I am happy to state that, each Board of studies has adhered to the resolutions passed
by Faculty of Technology, developed curriculum accordingly. In addition to outcome based
education, Choice Based Credit and Grading System is also introduced to ensure quality of
engineering education.
Choice Based Credit and Grading System enables a much-required shift in focus from teacher-
centric to learner-centric education since the workload estimated is based on the investment of time
in learning not in teaching. It also focuses on continuous evaluation which will enhance the quality
of education. University of Mumbai has taken a lead in implementing the system through its
affiliated Institutes Faculty of Technology has devised a transparent credit assignment policy
adopted ten points scale to grade learner’s performance. Credit grading based system was
implemented for First Year of Engineering from the academic year 2016-2017. Subsequently this
system will be carried forward for Second Year Engineering in the academic year 2017-2018, for
Third Year Final Year Engineering in the academic years 2018-2019, 2019-2020, respectively.

Dr. S. K. Ukarande
Co-ordinator,
Faculty of Technology,
Member - Academic Council
University of Mumbai, Mumbai

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [1]
Program Structure for
First Year Engineering (Semester I & II)
Mumbai University
(With Effect from 2016-2017)

Semester I
Teaching Scheme
Course Credits Assigned
Course Name (Contact Hours)
Code
Tut.
Theory Pract. Tut. Theory TW/Pract Total

FEC101 Applied Mathematics-I 04 - 01 04 - 01 05

FEC102 Applied Physics-I 03 01 - 03 0.5 - 3.5

FEC103 Applied Chemistry -I 03 01 - 03 0.5 - 3.5

FEC104 Engineering Mechanics 05 02 - 05 01 - 06

Basic Electrical
FEC105 04 02 - 04 01 - 05
Engineering
FEC106 Environmental studies 02 - - 02 - - 02
Basic Workshop
FEL101 - 04 - - 02 - 02
Practice-I
Total 21 10 01 21 05 01 27
Examination Scheme
Theory
Course Internal Assessment
Course Name End Term
Code Work
Pract Oral Total
Sem
Test1 Test2 Avg Exam

FEC101 Applied Mathematics-I 20 20 20 80 25 - - 125

FEC102 Applied Physics-I 15 15 15 60 25 - - 100

FEC103 Applied Chemistry –I 15 15 15 60 25 - - 100

FEC104 Engineering Mechanics 20 20 20 80 25 - 25 150

Basic Electrical
FEC105 20 20 20 80 25 - 25 150
Engineering
FEC106 Environmental studies 15 15 15 60 - - - 75
Basic Workshop
FEL101 - - - - 50 - - 50
Practice-I
Total 105 420 175 50 750

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [2]
Semester II
Teaching Scheme
Course Credits Assigned
Course Name (Contact Hours)
Code
Tut.
Theory Pract. Tut. Theory TW/Pract Total

FEC201 Applied Mathematics-II 04 - 01 04 - 01 05

FEC202 Applied Physics-II 03 01 - 03 0.5 - 3.5

FEC203 Applied Chemistry -II 03 01 - 03 0.5 - 3.5

FEC204 Engineering Drawing 03 04 - 03 02 - 05

Structured
FEC205 Programming 04 02 - 04 01 - 05
Approach
FEC206 Communication Skills 02 02 - 02 01 - 03
Basic Workshop
FEL201 - 04 - - 02 - 02
Practice-II
Total 19 14 01 19 07 01 27
Examination Scheme
Theory
Course Internal Assessment
Course Name End Term
Code Work
Pract Oral Total
Sem
Test1 Test2 Avg Exam

FEC201 Applied Mathematics-II 20 20 20 80 25 - - 125

FEC202 Applied Physics-II 15 15 15 60 25 - - 100

FEC203 Applied Chemistry -II 15 15 15 60 25 - - 100

FEC204 Engineering Drawing 15 15 15 60 25 50 - 150

Structured
FEC205 Programming 20 20 20 80 25 25 - 150
Approach
FEC206 Communication Skills 10 10 10 40 25 - - 75
Basic Workshop
FEL201 - - - - 50 - - 50
Practice-II
Total 95 380 200 75 - 750

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [3]
Teaching Scheme
Course Credits Assigned
Course Name (Contact Hours)
Code
Theory Pract. Tut. Theory TW/Pract Tut. Total
FEC101 Applied Mathematics-I 04 - 01 04 - 01 05

Examination Scheme
Theory
Course Internal Assessment
Course Name End Term
Code Av of Pract Oral Total
Sem Work
Test1 Test2 Test 1 Exam
&2
FEC101 Applied Mathematics-I 20 20 20 80 25 - - 125

Objectives
1. To provide students with sound foundation in applied mathematics to solve real life problems
in industry.
2. To provide hands on experience in using Scilab software to handle real life problems.

Outcomes: Learner will be able to…

1. Apply the concepts of complex numbers to the engineering problems.
2. Apply the knowledge of nth order derivatives of standard functions to engineering problems.
3. Apply the principles of basic operations of matrices to the engineering problems.
4. Apply the basic principles of partial differentiation to engineering problems.
5. Apply concepts of partial differentiation (maxima and minima, Jacobian), expansion of
functions as an application of successive differentiation.
6. Apply SCILAB programming techniques to model problems based on solution of
simultaneous linear algebraic equations.

Module Detailed Contents Hrs.

Complex Numbers
Pre‐requisite: Review of Complex Numbers‐Algebra of Complex Number, Different
representations of a Complex number and other definitions, D’Moivre’s Theorem.
1.1. Powers and Roots of Exponential and Trigonometric Functions.
01 1.2. Expansion of sinn θ, cosn θ in terms of sines and cosines of multiples of θ and 3
Expansion of sinnθ, cosnθ in powers of sinθ, cosθ 2
1.3. Circular functions of complex number and Hyperbolic functions. Inverse Circular and
Inverse Hyperbolic functions. Separation of real and imaginary parts of all types 4
of Functions.
Logarithm of Complex Numbers , Successive Differentiation
2.1 Logarithmic functions, Separation of real and Imaginary parts of Logarithmic Functions. 4
02
2.2 Successive differentiation: nth derivative of standard functions. Leibnitz’s Theorem
(without proof) and problems 4
Matrices
Pre‐requisite: Inverse of a matrix, addition, multiplication and transpose of a matrix
Types of Matrices (symmetric, skew‐ symmetric, Hermitian, Skew Hermitian, Unitary, 9
03 Orthogonal Matrices and properties of Matrices). Rank of a Matrix using Echelon forms,
reduction to normal form, PAQ in normal form, system of homogeneous and non –
homogeneous equations, their consistency and solutions. Linear dependent and independent
vectors. Application of inverse of a matrix to coding theory.
Partial Differentiation
4.1 Partial Differentiation: Partial derivatives of first and higher order. Total differentials, 6
04
differentiation of composite and implicit functions.

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [4]
4.2. Euler’s Theorem on Homogeneous functions with two and three independent 3
variables (with proof).Deductions from Euler’s Theorem
Applications of Partial Differentiation , Expansion of Functions
5.1 Maxima and Minima of a function of two independent variables, Jacobian.
05 5.2 Taylor’s Theorem (Statement only) and Taylor’s series, Maclaurin’s series (Statement 4
only).Expansion of 𝑒 𝑥 , sin(x), cos(x), tan(x), sinh(x), cosh(x), tanh(x), log(1+x),
𝑠𝑖𝑛−1 (𝑥),𝑐𝑜𝑠 −1 (𝑥),𝑡𝑎𝑛−1 (𝑥), Binomial series. 4
Indeterminate forms, Numerical Solutions of Transcendental Equations and System
of Linear Equations
6.1 Indeterminate forms, L‐ Hospital Rule, problems involving series. 2
6.2 Solution of Transcendental Equations: Solution by Newton Raphson method and 4
06
Regula –Falsi Equation.
6.3 Solution of system of linear algebraic equations, by (1) Gauss Elimination Method, (2) 3
Gauss Jacobi Iteration Method, (3) Gauss Seidal Iteration Method. (Scilab programming
for above methods is to be taught during lecture hours)

Term Work:
General Instructions:
1. Batch wise tutorials are to be conducted. The number of students per batch should be as per
University pattern for practicals.
2. Students must be encouraged to write Scilab Programs in tutorial class only. Each Student
has to write at least 4 Scilab tutorials (including print out) and at least 6 class tutorials on
entire syllabus.
3. SciLab Tutorials will be based on (i) Guass Elimination Method (ii) Guass Seidal Iteration
method (iii) Gauss Jacobi Iteration Method (iv) Newton Raphson Method (v) Regula –Falsi
method (vi) Maxima and Minima of functions of two variables

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. SciLab Tutorials : 10 marks

Assessment:

Internal Assessment Test:

Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 35% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of total 06 questions, each carrying 20 marks.
2. Total 04 questions need to be solved.
3. Question No: 01 will be compulsory and based on entire syllabus wherein sub-questions of 2
to 5 marks will be asked.
4. Remaining questions will be randomly selected from all the modules.
5. Weightage of each module will be proportional to number of respective lecture hrs as
mentioned in the syllabus.

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [5]
References:
1. A text book of Applied Mathematics, P.N.Wartikar and J.N.Wartikar, Vol – I and –II by Pune
VidyarthiGraha.
2. Higher Engineering Mathematics, Dr.B.S.Grewal, Khanna Publication
3. Advanced Engineering Mathematics, Erwin Kreyszig, Wiley EasternLimited, 9thEd.
4. Matrices, Shanti Narayan.S. Chand publication
5. Numerical Methods, Dr. P. Kandasamy , S. Chand Publication
6. Howard Anton and Christ Rorres. Elementary Linear Algebra Application Version. 6th edition.
John Wiley & Sons, INC.
7. Eisenberg, Murray. Hill Ciphers and Modular Linear Algebra. 3 Nov 1999 (accessed
November - 2 December 2001)
8. <http://www.math.umass.edu/~murray/Hillciph.pdf>

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [6]
Teaching Scheme
Course Credits Assigned
Course Name (Contact Hours)
Code
Theory Pract. Tut. Theory TW/Pract Tut. Total
FEC102 Applied Physics – I 03 01 -- 03 0.5 -- 3.5

Examination Scheme
Theory
Course Internal Assessment
Course Name End Term
Code Av of Pract Oral Total
Sem Work
Test1 Test2 Test 1 Exam
&2
FEC102 Applied Physics – I 15 15 15 60 25 -- -- 100

Objectives
1. To impart knowledge of basic concepts in applied physics.
2. To provide the knowledge and methodology necessary for solving problems in the field of
engineering.

Outcomes: Learner will be able to…

1. Apply the concepts of crystallography and to use XRD techniques for analysis of crystal
structure .
2. Apply the knowledge of Quantum mechanics to uncertainty principle and motion of free
particle.
3. To comprehend the basic concepts of semiconductor physics and apply the same to electronic
devices.
4. Apply the knowledge of superconductivity to SQUID and Magnetic levitation.
5. Apply the reasons for Acoustic defects and use this in the proper design of a Hall/Auditorium.
6. Use the knowledge of Piezoelectric and Magnetostriction effect for production of ultrasonic
waves and its application in various fields.

Module Detailed Contents Hrs.

CRYSTAL STRUCTURE
Introduction to crystallography; Study of characteristics of unit cell of Diamond, ZnS, NaCl
and HCP; Miller indices of crystallographic planes & directions; interplanar spacing; X-ray 07
01
diffraction and Bragg’s law; Determination of Crystal structure using Bragg’s
diffractometer; Frenkel and Schotkey crystal defects; Ionic crystal legancy (3,4,6,8); Liquid
crystal phases.
QUANTUM MECHANICS
Introduction, Wave particle duality; de Broglie wavelength; experimental verification of de
Broglie theory; properties of matter waves; wave packet, phase velocity and group velocity;
02 Wave function; Physical interpretation of wave function; Heisenberg’s uncertainty principle; 09
Electron diffraction experiment and Gama ray microscope experiment; Applications of
uncertainty principle; Schrodinger’s time dependent wave equation; time independent wave
equation; Motion of free particle; Particle trapped in one dimensional infinite potential well.
SEMICONDUCTOR PHYSICS
Splitting of energy levels for band formation; Classification of semiconductors(direct &
indirect band gap, elemental and compound); Conductivity, mobility, current density (drift
03 & diffusion) in semiconductors(n type and p type); Fermi Dirac distribution function; Fermi 14
energy level in intrinsic & extrinsic semiconductors; effect of impurity concentration and
temperature on fermi level; Fermi Level diagram for p-n junction(unbiased, forward bais,
reverse bias); Breakdown mechanism (zener&avalanchy), Hall Effect

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [7]
Applications of semiconductors: Rectifier diode, LED, Zener diode, Photo diode,
Photovoltaic cell, BJT, FET, SCR., MOSFET
SUPERCONDUCTIVITY
Introduction, Meissner Effect; Type I and Type II superconductors; BCS Theory (concept of 03
04
Cooper pair); Josephson effect
Applications of superconductors- SQUID, MAGLEV
ACOUSTICS
Conditions of good acoustics; Reflection of sound(reverberation and echo); absorption of 03
05
sound; absorption coefficient; Sabine’s formula; Acoustic Design of a hall; Common
Acoustic defects and acoustic materials
ULTRASONICS
Ultrasonic Wave generation; Magnetostriction Oscillator; Piezoelectric Oscillator; 03
06
Applications of ultrasonic: Eco sounding; NDT; ultrasonic cleaning(cavitation); ultrasonic
sensors; Industrial applications of ultrasonic(soldering, welding, cutting, drilling)

Suggested Experiments: (Any five)

1. Study of Diamond, ZnS, NaCl crystal structure.
2. Study of HCP structure.
3. Study of Miller Indices, Plane and direction.
4. Study of Hall Effect.
5. Determination of energy band gap of semiconductor.
6. Study of Ultrasonic Distance Meter.
7. Study of I / V characteristics of Zener diode.
8. Determination of ‘h’ using Photo cell.
9.Study of I / V characteristics of semiconductor diode

The distribution of Term Work marks will be as follows –

1. Attendance (Theory and Practical) : 05 marks
2. Assignments : 10 marks
3. Laboratory work (Experiments and Journal) : 10 marks

Assessment:
Internal Assessment Test:
Assessment consists of two class tests of 15 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 35% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of total 06 questions, each carrying 15 marks.
2. Total 04 questions need to be solved.
3. Question No: 01 will be compulsory and based on entire syllabus wherein sub-questions of 2
to 3 marks will be asked.
4. Remaining questions will be randomly selected from all the modules.
5. In question paper weightage of each module will be proportional to number of respective
1. lecture hrs as mentioned in the syllabus.

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [8]
References:
1. A text book of Engineering Physics-Avadhanulu&Kshirsagar, S.Chand
2. Applied Solid State Physics –Ranikant, Wiley India
3. Solid State Electronic Devices- B. G. Streetman, Prentice Hall Publisher
4. Physics of Semiconductor Devices- S. M. Sze, John Wiley & sons publisher
6. Modern Engineering Physics – Vasudeva, S.Chand
7. Concepts of Modern Physics- ArtherBeiser, Tata McGraw Hill
8. Engineering Physics- V. Rajendran, Tata McGraw Hill
9. Introduction to Solid State Physics- C. Kittle, John Wiley & Sons publisher
10. Engineering Physics-H. K. Malik, McGraw Hill

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [9]
Teaching Scheme
Course Credits Assigned
Course Name (Contact Hours)
Code
Theory Pract. Tut. Theory TW/Pract Tut. Total
FEC103 Applied Chemistry – I 03 01 -- 03 0.5 -- 3.5

Examination Scheme
Theory
Course Internal Assessment
Course Name End Term
Code Av of Pract Oral Total
Sem Work
Test1 Test2 Test 1 Exam
&2
FEC103 Applied Chemistry – I 15 15 15 60 25 -- -- 100

Objectives
1. To provide necessary background in applied chemistry relevant to chemical industries.
2. To provide exposure in conducting experiments and interpret and report the results in
professional format.

Outcomes: Learner will be able to…

1. Apply the knowledge of types of hardness of water and its estimation.
2. Apply the knowledge of various softening and disinfecting methods.
3. Apply the knowledge of various polymers, their synthesis, properties and uses along with their
fabrication techniques.
4. Apply the knowledge of thermodynamics in studying different chemical systems in equilibrium
obeying Gibb's phase rule.
5. Apply the knowledge of lubricants, types, properties and mechanisms to avoid frictional
resistance.
6. Demonstrate the knowledge of Portland cement and carbon nanomaterials.

Module Detailed Contents Hrs.

Water
Impurities in water, Hardness of water, Determination of Hardness of water by EDTA
method and problems, Softening of water by Hot and Cold lime Soda method and numerical
problems. Zeolite process and numerical problems. Ion Exchange process and numerical
01 problems. Potable water standard as per BIS w.r.t. i) pH, ii) Alkalinity, iii) TDS, iv) 12
Hardness; Drinking water or Municipal water -Treatments removal of microorganisms by
adding Bleaching powder, Chlorination (no breakpoint chlorination), Disinfection by Ozone,
Electrodialysis, Reverse osmosis, and Ultra filtration. BOD, COD- definition & significance,
sewage treatment (only activated sludge process), Numerical problems related to COD.
Polymers
Introduction to polymers, Classification, Types of polymerization, Thermoplastic and
Thermosetting plastic; Compounding of plastic, Fabrication of plastic by Compression,
Injection, Transfer and Extrusion moulding. Preparation, properties and uses of Phenol
02 formaldehyde, PMMA, Kevlar. Effect of heat on the polymers (Glass transition 12
temperature), Viscoelasticity. Conducting polymers, Engineering Plastics, Polymers in
medicine and surgery. Rubbers :
Natural rubber- latex, Drawbacks of natural rubber, Vulcanization of rubber, Preparation,
properties and uses of Buna-S, Silicone and Polyurethane rubber.
Lubricants
Introduction, Definition, Mechanism of lubrication, Classification of lubricants, Solid
03 lubricants (graphite & Molybdenum disulphide), Semisolid lubricants, Liquid lubricants, 07
Additives in blended Oils. Important properties of lubricants - Definition and significance of
- Viscosity, Viscosity index, Flash and fire points, Cloud and pour points, Oiliness,

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [10]
Emulsification, Acid value and numerical problems, Saponification value and numerical
problems.
Phase Rule
Gibb’s Phase Rule, Terms involved with examples, One Component System (Water),
04 04
Reduced Phase Rule, Two Component System (Pb- Ag), Advantages and Limitations of
Phase Rule.
Important Engineering Materials
Cement – Manufacture of Portland Cement, Chemical Composition and Constitution of
05 Portland Cement, Setting and Hardening of Portland Cement, Concrete, RCC and Decay. 05
Nanomaterials, preparation (Laser and CVD) method, properties and uses of CNTS,
Fullerene - properties and uses.

Suggested Experiments:
1) To determine total, temporary and permanent hardness of water sample.
2) Removal of hardness using ion exchange column.
3) To determine acid value of a lubricating oil.
4) To determine free acid pH of different solutions using pHmeter
5) To determine metal ion concentration using colorimeter.
6) To determine flash point and fire point of a lubricating oil
7) To determine Chloride content of water by Mohr’s Method.
8) To determine melting point and /or glass transition temperature of a polymer
9) Molecular weight determination of polymers by Oswald Viscometer.
10) To determine the percentage of lime in cement.
11) Hardening and setting of cement using Vicat’s apparatus
12) Determination of Viscosity of oil by Redwood Viscometer.

Term Work shall consist of minimum five experiments. The distribution of marks for term work
shall be as follows:
1 Attendance (Practical and Theory) : 05 marks
2 Laboratory Work (Experiments and journal) : 10 marks
3 Assignments and Viva on practical’s : 10 marks

Assessment:

Internal Assessment Test:

Assessment consists of two class tests of 15 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 35% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of total 06 questions, each carrying 15 marks.
2. Total 04 questions need to be solved.
3. Question No: 01 will be compulsory and based on entire syllabus wherein sub-questions of
3 marks will be asked.
4. Remaining questions will be mixed in nature.( e.g. Suppose Q.2 has part (a) from module 3
then part (b) will be from any module other than module 3 )
5. In question paper weightage of each module will be proportional to number of respective
lecture hrs as mentioned in the syllabus.

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [11]
References:
1. Engineering Chemistry - Jain& Jain (DhanpatRai)
2. Engineering Chemistry – Dara&Dara (S Chand)
3. Engineering Chemistry - Wiley India (ISBN – 9788126519880)
4. A Text Book of Engineering Chemistry – Shashi Chawla (DhanpatRai)

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [12]
Teaching Scheme
Course Credits Assigned
Course Name (Contact Hours)
Code
Theory Pract. Tut. Theory TW/Pract Tut. Total
FEC104 Engineering Mechanics 05 02 - 05 01 - 06

Examination Scheme
Theory
Course Internal Assessment
Course Name End Term
Code Av of Pract Oral Total
Sem Work
Test1 Test2 Test 1 Exam
&2
FEC104 Engineering Mechanics 20 20 20 80 25 -- 25 150

Objectives
1. To acquaint the concept of equilibrium in two and three dimensional system.
2. To study and analyse motion of moving bodies.

Outcomes: Learner will be able to…

1. Illustrate the concept of force, moment and apply the same along with the concept of
equilibrium in two and three dimensional systems with the help of FBD.
2. Demonstrate the understanding of Centroid and its significance and locate the same.
3. Correlate real life application to specific type of friction and estimate required force to
overcome friction.
4. Establish relation between velocity and acceleration of a particle and analyse the motion by
plotting the relation
5. Illustrate different types of motions and establish Kinematic relations for a rigid body
6. Analyse body in motion using force and acceleration, work-energy, impulse-momentum
principles

Module Detailed Contents Hrs.

1.1 System of Coplanar Forces: 05
Resultant of concurrent forces, parallel forces, non-concurrent
01 Non-parallel system of forces, Moment of force about a point, Couples, Varignon’s
Theorem. Force couple system. Distributed Forces in plane.
1.2 Centroid for plane Laminas. 04
2.1Equilibrium of System of Coplanar Forces:
Condition of equilibrium for concurrent forces, parallel forces and non-concurrent non- 06
parallel general forces and Couples.
02 2.2Types of support: Loads, Beams, Determination of reactions at supports for various 03
types of loads on beams.(Excluding problems on internal hinges)
2.3Analysis of plane trusses: By using Method of joints and Method of sections. 05
(Excluding pin jointed frames).
3.1 Forces in space:
Resultant of Non-coplanar Force Systems: Resultant of concurrent force system, parallel 05
force system and non-concurrent non-parallel force system.
Equilibrium of Non-coplanar Force Systems: Equilibrium of Concurrent force system,
parallel force system and non-concurrent non-parallel force system.
03
3.2 Friction: 07
Introduction to Laws of friction, Cone of friction, Equilibrium of bodies on inclined plane,
Application to problems involving wedges, ladders.
1.3 Principle of virtual work: 04
Applications on equilibrium mechanisms, pin jointed frames.

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [13]
4.1 Kinematics of a Particle: -Rectilinear motion, Velocity & acceleration in terms of 10
04 rectangular co-ordinate system, Motion along plane curved path, Tangential& Normal
component of acceleration, Motion curves (a-t, v-t, s-t curves), Projectile motion.
5.1 Kinematics of a Rigid Body :- Introduction to general plane motion, 06
05 Instantaneous center of rotation for the velocity, velocity diagrams for bodies in plane
motion.
6.1 Kinetics of a Particle: Force and Acceleration: -Introduction to basic concepts, 04
D’Alemberts Principle, Equations of dynamic equilibrium, Newton’s second law of
motion.
06 6.2 Kinetics of a Particle: Work and Energy: Principle of work and energy, Law of 03
conservation of energy.
6.3 Kinetics of a Particle: Impulse and Momentum: Principle of linear impulse and 03
momentum. Law of conservation of momentum. Impact and collision.

List of Experiments:-
1. Polygon law of coplanar forces.
2. Non-concurrent non-parallel (General).
3. Bell crank lever.
4. Support reaction for beam.
5. Inclined plane (to determine coefficient of friction).
6. Collision of elastic bodies (Law of conservation of momentum).
7. Kinematics of particles
8. Kinetics of particles

Any other experiment based on above syllabus.

Term work:-
Term work shall consist of minimum six experiments (at least one experiments on Dynamics),
assignments consisting numerical based on above syllabus, at least 3 numerical from each
module.
The distribution of marks for term work shall be as follows:
1. Attendance (Theory and Practical) : 05 marks
2. Laboratory work (Experiment/ programs and journal) : 10 marks
3. Assignments : 10 marks

Assessment:
Internal Assessment Test:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 35% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of total 06 questions, each carrying 20 marks.
2. Total 04 questions need to be solved.
3. Question No: 01 will be compulsory and based on entire syllabus wherein sub-questions of
2 to 5 marks will be asked.
4. Remaining questions will be mixed in nature.( e.g. Suppose Q.2 has part (a) from module 3
then part (b) will be from any module other than module 3 )
5. In question paper weightage of each module will be proportional to number of respective
lecture hrs as mentioned in the syllabus.

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [14]
Oral Examination: - Oral examination will be based on entire syllabus
References:
1. Engineering Mechanics by R. C. Hibbeler.2
2. Engineering Mechanics by Beer &Johnston, Tata McGraw Hill
3. Engineering Mechanics by F. L. Singer, Harper& Raw Publication
4. Engineering Mechanics by Macklin & Nelson, Tata McGraw Hill
5. Engineering Mechanics by Shaum Series,
6. Engineering Mechanics by A K Tayal, Umesh Publication.
7. Engineering Mechanics by Kumar, Tata McGraw Hill
8. Engineering Mechanics (Statics) by Meriam and Kraige, Wiley Bools
9. Engineering Mechanics (Dynamics) by Meriam and Kraige, Wiley Bools

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [15]
Teaching Scheme
Course Credits Assigned
Course Name (Contact Hours)
Code
Theory Pract. Tut. Theory TW/Pract Tut. Total
Basic Electrical 04 02 - 04 01 - 05
FEC105
Engineering

Examination Scheme
Theory
Course Internal Assessment
Course Name End Term
Code Av of Work
Pract Oral Total
Sem
Test1 Test2 Test 1 Exam
&2
Basic Electrical 20 20 20 80 25 -- 25 150
FEC105
Engineering

Objectives
1. To provide knowledge on fundamentals of D.C. circuits and its applications.
2. To impart knowledge on fundamentals of 1-Φ A.C. circuits and its applications.
3. To inculcate knowledge on the basic operation and the performance of 1-Φ transformer.
4. To impart knowledge on fundamentals of 3-Φ A.C. circuits and its applications.
5. To provide knowledge on fundamentals of DC machines.

Outcomes: Learner will be able to…

1. To evaluate D.C. circuits using network theorems.
2. To evaluate 1-Φ AC circuits.
3. To illustrate constructional features and operation of 1-Φ transformer.
4. To evaluate 3-Φ AC circuits.
5. To illustrate working principle of DC machines.
6. To conduct experiments on D.C. circuits and AC circuits.

Module Detailed Contents Hrs.

DC Circuits(Only Independent Sources): Kirchhoff ’s laws, Ideal and practical voltage
and current source, Mesh and Nodal analysis, Super node and Super mesh analysis, Source
01 transformation, Star-delta transformation, Superposition theorem, Thevenin’s theorem, 18
Norton’s theorem, Maximum power transfer theorem, (Source transformation not allowed
for Superposition theorem, Mesh and Nodal analysis).
AC Circuits: Generation of alternating voltage and currents, RMS and Average value, form
factor, crest factor, AC through resistance, inductance and capacitance, R-L, R-C and R-L-
02 12
C series and parallel circuits, phasor diagrams, power and power factor, series and parallel
resonance, Q factor and bandwidth.
Three Phase Circuits: Three phase voltage and current generation, star and delta
03 connections(balanced load only), relationship between phase and line currents and voltages, 06
Phasor diagrams, Basic principle of wattmeter, measurement of power by one and two
wattmeter methods.
Single Phase Transformer: Construction, working principle, emf equation, ideal and
04 practical transformer, transformer on no load and on load, phasor diagrams, equivalent 12
circuit, OC and SC test, regulation and efficiency.
DC Machines: Principle of operation of DC motors and DC generators, construction and
05 classification of DC machines, emf equation. 04

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [16]
Term work:
Term work consists of performing minimum 06 practical mentioned as below.
Final certification and acceptance of the term work ensures satisfactory performance of
laboratory work.
The distribution of marks for term work shall be as follows:
Attendance (Theory and Practical) : 05 marks
Laboratory work (Experiment/journal) : 10 marks
Assignments : 10 marks

List of laboratory experiments (Minimum Six):

1. Mesh and Nodal analysis.
2. Verification of Superposition Theorem.
3. Verification Thevenin’s Theorem.
4. Study of R-L series and R-C series circuit.
5. R-L-C series resonance circuit
6. R-L-C parallel resonance circuit.
7. Relationship between phase and line currents and voltages in three phase system
(star & delta)
8. Power and phase measurement in three phase system by one wattmeter method.
9. Power and phase measurement in three phase system by two wattmeter method.
10. OC and SC test on single phase transformer

Assessment:
Internal Assessment Test:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 35% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of total 06 questions, each carrying 20 marks.
2. Total 04 questions need to be solved.
3. Question No: 01 will be compulsory and based on entire syllabus wherein sub-questions of
2 to 3 marks will be asked.
4. Remaining questions will be mixed in nature.( e.g. Suppose Q.2 has part (a) from module 3
then part (b) will be from any module other than module 3 )
5. In question paper weightage of each module will be proportional to number of respective
lecture hrs as mentioned in the syllabus.

Text Books
1. V. N. Mittal and Arvind Mittal “Basic Electrical Engineering” Tata McGraw Hill, (Revised
2. Edition)
3. Electrical Engineering Fundamentals" by Vincent Del Toro, PHI Second edition, 2011
4. Edward Hughes: Electrical and Electrical Technology, Pearson Education (Tenth edition)
5. D P Kothari and I J Nagrath “Theory and Problems of Basic Electrical Engineering”, PHI 13
thedition 2011.
Reference Books:
1. B.L.Theraja “Electrical Engineering “ Vol-I and II,
2. S.N.Singh, “Basic Electrical Engineering” PHI , 2011Book name and author

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [17]
Teaching Scheme
Course Credits Assigned
Course Name (Contact Hours)
Code
Theory Pract. Tut. Theory TW/Pract Tut. Total
FEC106 Environmental Studies 02 -- -- 02 -- -- 02

Examination Scheme
Theory
Course Internal Assessment
Course Name End Term
Code Av of Pract Oral Total
Sem Work
Test1 Test2 Test 1 Exam
&2
FEC106 Environmental Studies 15 15 15 60 -- -- -- 75

Objectives
1. Creating the awareness about environmental problems among students.
2. Imparting basic knowledge about the environment and its allied problems.
3. Developing an attitude of concern for the environment.
4. Motivating students to participate in environment protection and environment improvement.
5. Acquiring skills to help the concerned individuals in identifying and solving environmental
problems.

Outcomes: Learner will be able to…

1. Illustrate Depleting Nature of Environmental Resources, Global Environmental Crisis,
Ecosystem concept.
2. Adapt to 3R (Reuse, Recovery, Recycle).
3. Study different control measures related to Environmental Pollution.
4. Illustrate and analyse various Case Studies related to Environmental Legislation.
5. Demonstrate the working of Renewable energy sources & Equipments.
6. Illustrate the Techniques of Disaster Management and Green Building.

Module Detailed Contents Hrs.

Overview of Environmental Aspects:
 Definition, Scope and Importance of Environmental Study
 Need for Public awareness of environmental education
 Introduction to depletion of natural resources: Soil, Water, Minerals and Forests.
 Global crisis related to – Population, water, sanitation & Land.
01 Ecosystem: 4
 Study of ecosystems : Forest, desert and aquatic (in brief).
 Energy flow in Ecosystem, overview of Food Chain, Food Web and Ecological
Pyramid.
 Concept of ecological succession and its impact on human beings (in brief).
Case Study on Chipko Movement (Uttarakhand, India), (began in 1973).
Aspects of Sustainable Development:
 Concept and Definition of Sustainable Development.
 Social, Economical and Environmental aspects of sustainable development.
02 2
 Control measures: 3R (Reuse, Recovery, Recycle),
 Resource utilization as per the carrying capacity (in brief).
Case Study on Narmada BachaoAndolan (Gujarat, India, in the mid and late 1980s).

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [18]
Types of Pollution:
 Water pollution: Sources of water pollution and Treatment of Domestic and industrial
waste water (with flow-diagram of the treatment),
 Land Pollution: Solid waste, Solid waste management by land filling, composting and
incineration
 Air pollution: Sources of air pollution,
Consequences of air pollution :-
Greenhouse effect (Explanation with schematic diagram),
Photochemical Smog (Explanation with chemical reaction).
03 Cleaning of gaseous effluents to reduce air contaminants namely dust particle or
8
particulate matters by using:- (i) Electrostatic precipitators (ii) Venturi scrubber
(Schematic diagram and working).
 Noise pollution: Sources, effects, threshold limit for different areas and control methods.
 E-Pollution: Definition, Sources and effects.
 Nuclear pollution: Sources and effects.
Case study on Water Pollution of Ganga River.
Case study on London smog (U. K.)(December, 1952).
Case Study of Fukushima Disaster (March, 2011).
Pollution Control Legislation:
 Functions and powers of Central and State Pollution Control Board.
04  Environmental Clearance, Consent and Authorization Mechanism. 3
Case Study of Dombivali MIDC- Boiler Blast Tragedy (Thane, Maharashtra, India),
(May, 2016).
Renewable Sources of Energy:
 Importance of renewable sources of energy.
 Principle and working with schematic diagram of :-
(i) Solar Energy: (a) Flat plate collector and (b) Photovoltaic cell.
05 4
(ii) Wind Energy: Wind Turbines.
(iii) Hydropower: Hydropower generation from water reservoir of the dam.
(iv) Geothermal Energy: Utilisation of underground sources of steam for power
generation.
Technological Advances to overcome Environmental problems:
 Concept of Green Buildings,
 Various indoor air pollutants and their effects on health.
 Carbon Credit: Introduction and general concept.
06  Disaster Management: Techniques of Disaster Management to cope up with (i) 5
Earthquake and (ii) Flood.
Case Study on Earthquake in Latur (Maharashtra, India), (September,1993).
Case Study on Cloudburst and Landslides at Kedarnath (Uttarakhand, India), (June,
2013).

Assessment:
Internal Assessment Test:
1. Each test will be of 15 marks.
2. At least one question will be based on case study. Candidate is expected to explain the salient features of
the incident and suggest preventive measures.

End Semester Theory Examination:

1. Question paper will comprise of total six question, each carrying 15 marks.
2. Total four questions need to be solved.
3. Question Number One will be compulsory and it will be based on entire syllabus wherein sub-questions
of 2 to 3 marks will be asked.
4. Remaining questions i.e. Q.2 to Q.6 will be mixed in nature and will be divided in three parts (a), (b) &
(c) and they will belong to different modules.
5. In question paper, weight of each module will be proportional to number of respective lecture hours as
mentioned in the syllabus.

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [19]
References:
1. Environmental Studies by Benny Joseph, TataMcGraw Hill.
2. Environmental Studies by R.Rajagopalan, Oxford University Press.
3. Environmental Studies by. AnanditaBasak, Pearson Education.
4. Essentials of Environmental Studies by Kurian Joseph &Nagendran, Pearson Education.
5. Fundamentals of Environmental Studies by Varadbal G. Mhatre, Himalaya Publication House.
6. Perspective of Environmental Studies, by Kaushik and Kaushik,New Age International.
7. Renewable Energy by Godfrey Boyle, Oxford Publications.
8. Textbook of Environmental Studies by Dave and Katewa, Cengage Learning.
9. Textbook of Environmental studies by ErachBharucha, University Press.
10. Environmental pollution control engineering by C.S. Rao, New Age International (P) Limited
Publishers.

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [20]
Teaching Scheme
Course Credits Assigned
Course Name (Contact Hours)
Code
Theory Pract. Tut. Theory TW/Pract Tut. Total
Basic Workshop
FEL101 -- 04 -- -- 02 -- 02
Practice - I

Examination Scheme
Theory
Course Internal Assessment
Course Name TermEnd
Code Av of Pract Oral Total
Sem Work
Test1 Test2 Test 1 Exam
&2
Basic Workshop
FEL101 -- -- -- -- 50 -- -- 50
Practice - I

Detailed Contents Hrs.

Note: The syllabus and the Term- work to be done during semester I and Semester II is given
together. Individual Instructor for the course is to design the jobs for practice and
demonstration and spread the work over entire two semesters. The objective is to impart
training to help the students develop engineering skill sets. This exercise also aims in
inculcating respect for physical work and hard labor in addition to some amount of value
addition by getting exposed to interdisciplinary engineering domains.
The two compulsory trades (Trade 1 – Fitting and Trade 2 – Carpentry) shall be offered in
separate semesters.
Select any four trade topics (two per semester) out of the topic at trade 3 to 11.
Demonstrations and hands on experience to be provided during the periods allotted for the
same. Report on the demonstration including suitable sketches is also to be included in the
term – work
Fitting (compulsory)
 Use and setting of fitting tools for chipping, cutting, filing, marking, center
Trade 1 punching, drilling, tapping. 30
 Term work to include one job involving following operations : filing to size, one
simple male- female joint, drilling and tapping
Carpentry (compulsory)
 Use and setting of hand tools like hacksaws, jack planes, chisels and gauges for
Trade 2 construction of various joints, wood tuning and modern wood turning methods. 30
 Term work to include one carpentry job involving a joint and report on
demonstration of a job involving wood turning
Forging (Smithy)
Trade 3  At least one workshop practice job (Lifting hook and handle) is to be demonstrated. 15
Welding
 Edge preparation for welding jobs. Arc welding for different job like, Lap welding
Trade 4 15
of two plates, butt welding of plates with simple cover, arc welding to join plates at
right angles.
Machine Shop
Trade 5  At least one turning job is to be demonstrated. 15

Electrical board wiring

Trade 6  House wiring, staircase wiring, wiring diagram for fluorescent tube light, Godown 15
wiring and three phase wiring for electrical motors.
PCB Laboratory Exercises
Trade 7 Layout drawing, Positive and negative film making, PCB etching and drilling, Tinning and 15
soldering technique.
Sheet metal working and Brazing
Trade 8  Use of sheet metal, working hand tools, cutting , bending , spot welding 15

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [21]
Plumbing
 Use of plumbing tools, spanners, wrenches, threading dies, demonstration of
Trade 9 15
preparation of a domestic line involving fixing of a water tap and use of coupling,
elbow, tee, and union etc.
Masonry
Trade  Use of masons tools like trowels, hammer, spirit level, square, plumb line and pins
15
10 etc. demonstration of mortar making, single and one and half brick masonry ,
English and Flemish bonds, block masonry, pointing and plastering.
Hardware and Networking:
 Dismantling of a Personal Computer (PC), Identification of Components of a PC such
as power supply, motherboard, processor, hard disk, memory (RAM, ROM), CMOS
battery, CD drive, monitor, keyboard, mouse, printer, scanner, pen drives, disk drives
etc.
 Assembling of PC, Installation of Operating System (Any one) and Device drivers,
Trade
Boot-up sequence. Installation of application software (at least one) 15
11
 Basic troubleshooting and maintenance
 Identification of network components: LAN card, wireless card, switch, hub, router,
different types of network cables (straight cables, crossover cables, rollover cables)
Basic networking and crimping.

NOTE: Hands on experience to be given in a group of not more than four students.

Term work:

Term work shall consist of respective reports and jobs of the trades selected the distribution of
marks for term work shall be as follows.
1 Laboratory work (Job and Journal) : 40 marks
2 Attendance (Practical and Theory) : 10 marks

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [22]
Teaching Scheme
Course Credits Assigned
Course Name (Contact Hours)
Code
Theory Pract. Tut. Theory TW/Pract Tut. Total
FEC201 Applied Mathematics‐II 04 -- 01 04 -- 01 05

Examination Scheme
Theory
Course Internal Assessment
Course Name End Term
Code Av of Pract Oral Total
Sem Work
Test1 Test2 Test 1 Exam
&2
FEC201 Applied Mathematics‐II 20 20 20 80 25 -- -- 125

Objectives
1. To provide students with sound foundation in applied mathematics to solve real life problems
in industry.
2. To provide hands on experience in using Scilab software to handle real life problems.

Outcomes: Learner will be able to…

1. Apply the concepts of First Order and first degree Differential equation to the engineering
problems.
2. Apply the concepts of Higher Order Linear Differential equation to the engineering
problems.
3. Apply concepts of Beta and Gamma function to the engineering Problems.
4. Apply SCILAB programming techniques to solve differential equation to model complex
engineering activities.
5. Apply concepts of Double integral of different coordinate systems to the engineering
problems.
6. Apply concepts of triple integral of different coordinate systems to the engineering problems.

Module Detailed Contents Hrs.

Differential Equations of First Order and First Degree
1.1 Exact differential Equations, Equations reducible to exact form by using integrating
factors. 4
01 1.2 Linear differential equations (Review), equation reducible to linear form, Bernoulli’s
equation. 3
1.3: Simple application of differential equation of first order and first degree to electrical
and Mechanical Engineering problem (no formulation of differential equation) 2
Linear Differential Equations With Constant Coefficients and Variable Coefficients
Of Higher Order
2.1. Linear Differential Equation with constant coefficient‐ complementary function, 6
02 particular integrals of differential equation of the type f(D)y = X where X is 𝑒 𝑎𝑥 , sin(ax+b),
cos (ax+b), 𝑥 𝑛 , 𝑒 𝑎𝑥 V, xV.
2.2. Cauchy’s homogeneous linear differential equation and Legendre’s differential 3
equation, Method of variation of parameters.
Numerical solution of ordinary differential equations of first order and first degree,
Beta and Gamma Function
3.1. (a)Taylor’s series method (b)Euler’s method 4
03
(c) Modified Euler method (d) Runga‐Kutta fourth order formula (SciLab programming is
to be taught during lecture hours)
3.2 .Beta and Gamma functions and its properties. 4
Differentiation under Integral sign, Numerical Integration and Rectification
4.1. Differentiation under integral sign with constant limits of integration. 2
04 4.2. Numerical integration‐ by (a) Trapezoidal (b) Simpson’s 1/3rd (c) Simpson’s 3/8th rule 3
(all with proof). (Scilab programming on (a) (b) (c) (d) is to be taught during lecture hours)
4.3. Rectification of plane curves. 3

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [23]
Double Integration
5.1. Double integration‐definition, Evaluation of Double Integrals. 2
05
5.2. Change the order of integration, Evaluation of double integrals by changing the order 7
of integration and changing to polar form.
Triple Integration and Applications of Multiple Integrals.
6.1. Triple integration definition and evaluation (Cartesian, cylindrical and spherical polar 3
06 coordinates).
6.2. Application of double integrals to compute Area, Mass, Volume. Application of triple 6
integral to compute volume.

Term Work:
General Instructions:
1. Batch wise tutorials are to be conducted. The number of students per batch should be as
per University pattern for practical.
2. Students must be encouraged to write Scilab Programs in tutorial class only. Each Student
to write atleast 4 Scilab tutorials (including print out) and at least 6 class tutorials on entire
syllabus.
3. SciLab Tutorials will be based on (i)Curve Tracing (ii) Taylor’s series method, Euler’s
method Modified Euler method, RungaKutta fourth order formula (iii) Ordinary
Differential Equation and (iv) Trapezoidal Simpson’s 1/3rd and Simpson’s 3/8th rule.

The distribution of Term Work marks will be as follows -

Attendance (Theory and Tutorial): 05 marks
Class Tutorials on entire Syllabus: 10 marks
SciLab Tutorials : 10 marks

Assessment:

Internal Assessment Test:

Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 35% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of total 06 questions, each carrying 20 marks.
2. Total 04 questions need to be solved.
3. Question No: 01 will be compulsory and based on entire syllabus wherein sub-questions of
3 to 4 marks will be asked.
4. Remaining questions will be mixed in nature.( e.g. Suppose Q.2 has part (a) from module 3
then part (b) will be from any module other than module 3 )
5. In question paper weightage of each module will be proportional to number of respective
lecture hrs as mentioned in the syllabus.

References:
1. A text book of Applied Mathematics, P.N.Wartikar and J.N.Wartikar, Vol – I and –II by Pune
VidyarthiGraha.
2. Higher Engineering Mathematics, Dr.B.S.Grewal, Khanna Publication
3. Advanced Engineering Mathematics, Erwin Kreyszig, Wiley EasternLimited, 9thEd.
4. Numerical methods by Dr. P. Kandasamy ,S.Chand Publications

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [24]
Teaching Scheme
Course Credits Assigned
Course Name (Contact Hours)
Code
Theory Pract. Tut. Theory TW/Pract Tut. Total
FEC202 Applied Physics – II 03 01 -- 03 0.5 -- 3.5

Examination Scheme
Theory
Course Internal Assessment
Course Name Term
End
Code Av of Pract Oral Total
Sem Work
Test1 Test2 Test 1 Exam
&2
FEC202 Applied Physics – II 15 15 15 60 25 -- -- 100

Objectives
1. To impart knowledge of basic concepts in applied physics.
2. To provide the knowledge and methodology necessary for solving problems in the field of
engineering.

Outcomes: Learner will be able to…

1. Comprehend principles of interference and diffraction.
2. Illustrate the principle,construction and working of various LASERs and its applications.
3. Identify various applications of optical fibres.
4. Comprehend the concepts of electrodynamics and Maxwell's equations and their use in
telecommunication systems.
5. Apply the concepts of electromagnetism in focusing systems and CRO.
6. Comprehend the significance of nanoscience and nanotechnology,its applications.

Module Detailed Contents Hrs.

INTERFERENCE AND DIFFRACTION OF LIGHT
Interference by division of amplitude and by division of wave front; Interference in thin film
of constant thickness due to reflected and transmitted light; origin of colours in thin film;
Wedge shaped film(angle of wedge and thickness measurement); Newton’s rings
Applications of interference - Determination of thickness of very thin wire or foil;
01 determination of refractive index of liquid; wavelength of incident light; radius of curvature 14
of lens; testing of surface flatness; Anti-reflecting films and Highly reflecting film.
Diffraction of Light –Fraunhoffer diffraction at single slit, Fraunhoffer diffraction at double
slit, Diffraction Grating, Resolving power of a grating, dispersive power of a grating
Application of Diffraction - Determination of wavelength of light with a plane transmission
grating
LASERS
Quantum processes as absorption, spontaneous emission and stimulated emission;
metastable states, population inversion, pumping, resonance cavity, Einsteins’s equations;
02 Helium Neon laser; Nd:YAG laser; Semiconductor laser,
04
Applications of laser- Holography (construction and reconstruction of holograms) and
industrial applications(cutting, welding etc), Applications in medical field
FIBRE OPTICS
Total internal reflection; Numerical Aperture; critical angle; angle of acceptance; Vnumber;
number of modes of propagation; types of optical fiber; Losses in optical fibre(Attenuation
03 and dispersion)
04
Applications of optical fibre - Fibre optic communication system; sensors (Pressure,
temperature, smoke, water level), applications in medical field

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [25]
ELECTRODYNAMICS
Cartesian, Cylindrical and Spherical Coordinate system, Scaler and Vector field, Physical
04 significance of gradient, curl and divergence, Determination of Maxwell’s four equations.
08
Applications-design of antenna, wave guide, satellite communication etc.
CHARGE PARTICLE IN ELECTRIC AND MAGNETIC FIELDS
Fundamentals of Electromagnetism, Motion of electron in electric field (parallel
,perpendicular, with some angle); Motion of electron in magnetic field (Longitudinal and
05 Transverse); Magnetic deflection; Motion of electron in crossed field; Velocity Selector; 05
Velocity Filter, Electron refraction; Bethe’s law; Electrostatic focusing; Magnetostatic
focusing; Cathode ray tube (CRT);Cathod ray Oscilloscope (CRO)
Application of CRO: Voltage (dc,ac), frequency, phase measurement.
NANOSCIENCE AND NANOTECHNOLOGY
Introduction to nano-science and nanotechnology, Surface to volume ratio, Two main
approaches in nanotechnology -Bottom up technique and top down technique; Important
06 tools in nanotechnology such as Scanning Electron Microscope, Transmission Electron 04
Microscope, Atomic Force Microscope.
Nano materials: Methods to synthesize nanomaterials (Ball milling, Sputtering, Vapour
deposition, solgel), properties and applications of nanomaterials.

Suggested Experiments: (Any five)

1. Determination of radius of curvature of a lens using Newton’s ring set up
2. Determination of diameter of wire/hair or thickness of paper using Wedge shape film method.
3. Determination of wavelength using Diffracion grating. (Hg/ Ne source)
4. Determination of number of lines on the grating surface using LASER Sourse.
5. Determination of Numerical Aperture of an optical fibre.
6. Determination of wavelength using Diffracion grating. (Laser source)
7. Use of CRO for measurement of frequency and amplitude.
8. Use of CRO for measurement of phase angle.
9. Study of divergence of laser beam
10. Determination of width of a slit using single slit diffraction experiment (laser source)

The distribution of Term Work marks will be as follows –

4. Attendance (Theory and Practical) : 05 marks
5. Assignments : 10 marks
6. Laboratory work (Experiments and Journal) : 10 marks

Assessment:

Internal Assessment Test:

Assessment consists of two class tests of 15 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 35% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of total 06 questions, each carrying 15 marks.
2. Total 04 questions need to be solved.
3. Question No: 01 will be compulsory and based on entire syllabus wherein sub-questions of 2
to 3marks will be asked.
4. Remaining questions will be mixed in nature.( e.g. Suppose Q.2 has part (a) from module 3
then part (b) will be from any module other than module 3 )
5. In question paper weightage of each module will be proportional to number of respective
lecture hrs as mentioned in the syllabus.

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [26]
References:
1. A text book of Engineering Physics-Avadhanulu&Kshirsagar, S.Chand
2. Fundamentals of Optics by Jenkins and White, McGraw-Hill
3. Optics - Ajay Ghatak, Tata McGraw Hill
4. Concepts of Modern Physics- ArtherBeiser, Tata Mcgraw Hill
5. A textbook of Optics - N. Subramanyam and Brijlal, S.Chand
6. Engineering Physics-D. K. Bhattacharya, Oxford
7. Concepts of Modern Physics- ArtherBeiser, Tata Mcgraw Hill
8. Classical Electodyamics – J. D. Jackson, Wiley
9. Introduction to Electrodynamics- D. J. Griffiths, Pearson publication
10. Intoduction to Nanotechnology- Charles P. Poole, Jr., Frank J. Owens, Wiley India edition
11. Nano: The Essential – T. Pradeep, Mcgraw-Hill Education

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [27]
Teaching Scheme
Course Credits Assigned
Course Name (Contact Hours)
Code
Theory Pract. Tut. Theory TW/Pract Tut. Total
FEC203 Applied Chemistry – II 03 01 -- 03 0.5 -- 3.5

Examination Scheme
Theory
Course Internal Assessment
Course Name End Term
Code Av of Pract Oral Total
Sem Work
Test1 Test2 Test 1 Exam
&2
FEC203 Applied Chemistry – II 15 15 15 60 25 -- -- 100

Objectives
1. To provide necessary background in applied chemistry relevant to chemical industries.
2. To provide exposure in conducting experiments and interpret and report the results in
professional format.

Outcomes: Learner will be able to…

1. Identify types of corrosion and factors affecting it related to problems affecting all industries.
2. Identify different types of corrosion control methods to study corrosion control in various
industries.
3. Apply the knowledge of different types of fuels, including their production and refining
methods and combustion mechanisms.
4. Illustrate composition and properties of different types of alloys and the process of powder
metallurgy
5. Illustrate princpales of green chemistry.
6. Illustrate properties and applications of different types of composite materials.

Module Detailed Contents Hrs.

Corrosion:
Introduction: Types of Corrosion- (I) Dry or Chemical Corrosion-i) Due to oxygen ii) Due
to other gases (II) Wet or Electrochemical corrosion- Mechanism i) Evolution of hydrogen
type ii) Absorption of oxygen. Types of Electrochemical Corrosion- Galvanic cell corrosion,
Concentration cell corrosion (differential aeration), Pitting corrosion, Intergranular
corrosion, Stress corrosion. Factors affecting the rate of corrosion- Nature of metal, position
of metal in galvanic series, potential difference, overvoltage, relative area of anodic and
01 cathodic parts, purity of metal, nature of the corrosion product, temperature, moisture, 11
influence of pH, concentration of the electrolytes. Methods to decrease the rate of corrosion-
Material selection, Proper designing, Use of inhibitors, Cathodic protection- i) Sacrificial
anodic protection ii) Impressed current method, Anodic protection method, Metallic
coatings- hot dipping- galvanizing and tinning, metal cladding, metal spraying,
Electroplating, Cementation. Organic coatings – Paints (only constituents and their
functions).

Alloys
Introduction, purpose of making alloys, Ferrous alloys, plain carbon steel, heat resisting
steels, stainless steels (corrosion resistant steels), effect of the alloying element- Ni, Cr, Co,
02 Mn, Mo,W and V; 07
Non-Ferrous alloys- Composition, properties and uses of- Alloys of Aluminium- i)
Duralumin ii) Magnalium. Alloys of Cu- (I) Brasses-i) Commercial brass ii) German silver,
(II) Bronzes- i) Gun metal ii) High phosphorous bronze. Alloys of Pb- i) Wood’s metal ii)

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [28]
Tinmann’s solder. Powder Metallurgy- Introduction, (1)Methods of powder metal
formation- i) Mechanical pulverization ii) Atomization iii) Chemical reduction iv)
Electrolytic process v) Decomposition (2) Mixing and blending. (3) Sintering (4)
Compacting- i) Cold pressing ii) Powder injection moulding (iii) Hot compaction.
Applications of powder metallurgy.
Shape Memory Alloys- Definition, properties and Uses.
Fuels
Definition, classification of fuels-solid, liquid and gaseous. Calorific value- Definition,
Gross or Higher calorific value & Net or lower calorific value, units of heat (no conversions),
Dulong’s formula & numerical for calculations of Gross and Net calorific values.
Characteristics of a good fuel.
Solid fuels- Analysis of coal- Proximate and Ultimate Analysis with Significance and
numericals.
Liquid fuels- Crude petroleum oil, its composition and classification and mining (in brief).
Refining of crude oil- i) Separation of water ii) Separation of ‘S’ & iii) Fractional Distillation
with diagram and composition and uses table.
03 Cracking- Definition, Types of cracking- 12
I) Thermal cracking – (i) Liquid phase thermal cracking (ii) Vapour phase thermal cracking.
II) Catalytic cracking- (i) Fixed-bed catalytic cracking (ii) Moving-bed catalytic cracking.
Advantages of Catalytic cracking.
Petrol- Refining of petrol, unleaded petrol ( use of MTBE), Catalytic converter, Power
alcohol, Knocking, Octane number, Cetane number, Antiknocking agents.
Combustion- Calculations for requirement of only oxygen and air (by weight and by volume
only) for given solid & gaseous fuels.
Biodiesel- Method to obtain Biodiesel from vegetable oils (Trans-esterification), advantage
and disadvantages of biodiesel.
Fuel cell- Definition, types and applications.
Composite Materials
Introduction, Constitution- i) Matrix phase ii) Dispersed phase. Characteristic properties of
composite materials. Classification- (A) Particle - reinforced composites- i) Large – particle
04 reinforced composites ii) Dispersion – strengthened composites. (B) Fiber – reinforced 04
composites- i) Continuous – aligned ii) Discontinuous – aligned (short)- (a) aligned (b)
randomly oriented (C) Structural Composites- i) Laminates (ii) Sandwich Panels.

Green Chemistry
Introduction, Twelve Principles of Green chemistry, numerical on atom economy,
05 06
Conventional and green synthesis of Adipic acid, Indigo, Ibuprofen and Carbaryl.
Green solvents (water,supercritical CO2) and products from natural materials.

Suggested Experiments: (Any five)

1. Estimation of Zn- Complexometric titration.
2. Estimation of Ni- Complexometric titration.
3. Estimation of Al- Complexometic titration.
4. Flue gas analysis using Orsat’s apparatus.
5. Estimation of Fe from plain carbon steel
6. Estimation of Ni by gravimetric method.
7. Estimation of Sniodometrically.
8. Preparation of Biodiesel from edible oil.
9. Estimation of Cu- Iodometrically.
10. Estimation of percentage moisture in coal.
11. Estimation of percentage ash in coal.
12. To estimate the emf of Cu-Zn system by potentiometry.
13.Demonstration of Electroplating.

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [29]
Term work
Term Work shall consist of minimum five experiments. The distribution of marks for term work
shall be as follows:
1. Attendance (Practical and Theory) : 05 marks
2. Laboratory Work (Experiments and journal) : 10 marks
3. Assignments and Viva on practicals : 10 marks

Assessment:

Internal Assessment Test:

Assessment consists of two class tests of 15 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 35% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of total 06 questions, each carrying 15 marks.
2. Total 04 questions need to be solved.
3. Question No: 01 will be compulsory and based on entire syllabus wherein sub-questions of
3 marks will be asked.
4. Remaining questions will be mixed in nature.( e.g. Suppose Q.2 has part (a) from module 3
then part (b) will be from any module other than module 3 )
5. In question paper weightage of each module will be proportional to number of respective
lecture hrs as mentioned in the syllabus.

References:
1. Engineering Chemistry - Jain &Jain (DhanpatRai)
2. Engineering Chemistry – Dara & Dara (S Chand)
3. Engineering Chemistry - Wiley India (ISBN – 9788126519880)
4. A Text Book of Engineering Chemistry - ShashiChawla (DhanpatRai)
5. A Text Book of Green Chemistry – V.K. Ahluwalia (Springer)

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [30]
Teaching Scheme
Course Credits Assigned
Course Name (Contact Hours)
Code
Theory Pract. Tut. Theory TW/Pract Tut. Total
FEC204 Engineering Drawing 03 04 -- 03 02 -- 05

Examination Scheme
Theory
Course Internal Assessment
Course Name End Term
Code Av of Pract Oral Total
Sem Work
Test1 Test2 Test 1 Exam
&2
FEC204 Engineering Drawing 15 15 15 60 25 50 -- 150

Objectives
1. To impart and inculcate proper understanding of the theory of projection.
2. To impart the knowledge of reading a drawing.
3. To improve the visualization skill.
4. To teach basic utility of computer aided drafting (CAD) tool.

Outcomes: Learner will be able to…

1. Apply the basic principles of projections in 2D drawings.
2. Apply the basic principles of projections in converting 3D view to 2D drawing.
3. Read a given drawing.
4. Visualize an object from the given two views.
5. Use CAD tool to draw different views of a 3D object.
6. Use CAD tool to draw an object in 3D.

Module Detailed Contents Hrs.

Introduction to Engineering Drawing:- Types of Lines, Dimensioning Systems as per
IS conventions.
Engineering Curves:- Basic construction of Cycloid, Involutes and Helix (of cylinder)
01
only. 3
** Introduction to Auto CAD:- Basic Drawing and Editing Commands. Knowledge of
setting up layers, Dimensioning, Hatching, plotting and Printing.
Projection of Points and Lines:- Lines inclined to both the Reference Planes
(Excluding Traces of lines) and simple application based problems on Projection of
6
02 lines.
@Projection of Planes:- Triangular, Square, Rectangular, Pentagonal, Hexagonal and
Circular planes inclined to either HP or VP only. (Exclude composite planes)
Projection of Solids:- (Prism, Pyramid, Cylinder, Tetrahedron, Hexahedron and Cone only)
Solid projection with the axis inclined to HP and VP. (Exclude Spheres, Composite, Hollow
solids and frustum of solids). Use change of position or Auxiliary plane method
Section of Solids:- Section of Prism, Pyramid, Cylinder, Tetrahedron, Hexahedron &
Cone cut by plane perpendicular to at least one reference plane.( Exclude Curved Section
03
Plane). Use change of position or Auxiliary plane method
Development of Lateral Surfaces of Sectioned Solids:- Lateral surface development of 14
Prism, Pyramid, Tetrahedron, Hexahedron, Cylinder, Cone with section plane inclined to
HP or VP only. (Exclude DLS of a solid with a hole in it and Reverse Development).
(Exclude Reverse Development)
Orthographic and Sectional Orthographic Projections:-
• Different views of a simple machine part as per the first angle projection method
04 recommended by I.S.
• Full or Half Sectional views of the Simple Machine parts.
• **Drawing of orthographic projections using Auto CAD. 12

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [31]
Isometric Views:- Isometric View/Drawing of blocks of plain and cylindrical surfaces
using plain/natural scale only. (Exclude Spherical surfaces).
• **Drawing of Isometric views using Auto CAD.
• @Reading of Orthographic Projections. [Only for Practical Exam
(AutoCAD)
05 and Term Work] 10
• **Orthographic Reading using Auto CAD.
**Introduction to 3D in AutoCAD
Working in 3-dimensions, Viewing 3D Objects, Basic wireframe models, Extruding, simple
revolved objects. Boolean operations.

**Should be covered during Auto CAD practical sessions.

@ Should be covered only in Term work. (i.e. Questions will not be asked for the End semester Examination).

TERM WORK:
Component – 1

Drawing Sheet – 1: Projection of Solids (3 Problems)

Drawing Sheet – 2: Section of Solids and Development of lateral surfaces (2 Problems)
Drawing Sheet – 3: Orthographic Projection without section (2 Problems)
Drawing Sheet – 4: Orthographic Projection with section (2 Problems)
Drawing Sheet – 5: Isometric Views (3 Problems)

Component -2

One A-3 size sketch book consisting of:-

1) Two problems each from Engineering Curves, Projection of Lines, Planes and Solids.
One problem from Section of solids without DLS and one problem from section of
solids with DLS of that sectioned Solid.
2) Two problems from Orthographic Projections (with Section), One problem on Reading
of Orthographic projections and Two problems on Isometric views.

Component-3

Printouts (preferably on A3 size sheet) of each from:

1. Orthographic Projections with Section – 3 problems.
2. Isometric Views – 4 problems
3. Reading of Orthographic Projections – 1 problem.

Note:- 2 hrs /week Auto CAD Practical is essential for completing the Auto CAD
Drawings and take required printouts.

AUTO CAD PRACTICAL EXAMINATION: (2hrs – 50 marks):

1) Minimum 1 problem from 1 OR 3 of Component-3 for 30 marks.
(All three views with at least 12 dimensions must be asked in the exam)
AND
2) Minimum 1 problem from 2 of Component-3 for 20 marks.

Note:- Print out of the Answers have to be taken preferably in A3 size sheets and should be Assessed
by External examiner only. Knowledge of concepts and accuracy of drawing should be considered
during evaluation.

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [32]
INTERNAL ASSESSMENT TEST: (1 hr - 15 marks)
Out of the two tests, one test must be conducted by conventional way and another test must be
Practical Exam (using AutoCAD software). Average of the two tests must be considered for Internal
Assessment.

END SEMESTER EXAMINATION: (3 hrs – 60 marks)

1) Question paper will comprise of 6 questions, each carrying 15 marks.
2) Any 4 questions need to be solved. There won’t be any compulsory Question.
3) Marks of each topic should be proportional to number of hours assigned to each Module.

Text Books.
1 N.D. Bhatt, "Engineering Drawing (Plane and solid geometry)", Charotar Publishing House Pvt. Ltd.
2 N.D. Bhatt & V.M. Panchal, "Machine Drawing", Charotar Publishing House Pvt. Ltd.

References.
1 M.B Shah & B.C Rana, "Engineering Drawing", Pearson Publications.
2 P.J. Shah, "Engineering Graphics", S Chand Publications.
3 Dhananjay A Jolhe, "Engineering Drawing" Tata McGraw Hill.
4 Prof. Sham Tickoo (Purdue University) &GauravVerma, "( CAD Soft Technologies) : Auto CAD
2012 (For engineers and Designers)", Dreamtech Press NewDelhi.

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [33]
Teaching Scheme
Course Credits Assigned
Course Name (Contact Hours)
Code
Theory Pract. Tut. Theory TW/Pract Tut. Total
Structured
FEC205 Programming 04 02 -- 04 01 -- 05
Approach
Examination Scheme
Theory
Course Internal Assessment
Course Name End Term
Code Av of Pract Oral Total
Sem Work
Test1 Test2 Test 1 Exam
&2
Structured
FEC205 Programming 20 20 20 80 25 25 -- 150
Approach

Objectives
1. To familirise the logic of structured programming approach.
2. To provide exposure in developing algorithm, flowchart and thereby writing efficient codes
for user defined problem.

Outcomes: Learner will be able to…

1. Illustrate the basic terminology used in computer programming.
2. Illustrate the concept of data types, variables and operators using C.
3. Design and Implement control statements and looping constructs in C.
4. Apply function concept on problem statements.
5. Demonstrate the use of arrays, strings, structures and files handling in C.
6. Demonstrate the dynamics of memory by the use of pointers to construct various data
structures.

Module Topic Detailed Contents Hrs.

1.1 Basics of Computer:
Turing Model, Von Neumann Model, Basics of Positional Number
Introduction to
System, Introduction to Operating System and component of an
Computer,
01 Operating System. 06
Algorithm
1.2 Algorithm & Flowchart :
And Flowchart
Three construct of Algorithm and flowchart: Sequence, Decision
(Selection) and Repetition
2.1 Character Set, Identifiers and keywords, Data types, Constants,
Variables.
2.2 Operators-Arithmetic, Relational and logical, Assignment, Unary,
Fundamentals of
02 Conditional, Bitwise, Comma, other operators. 06
C-Programming
Expression, statements, Library Functions, Preprocessor.
2.3 Data Input and Output – getchar( ), putchar( ), scanf( ), printf( ),
gets( ), puts( ), Structure of C program .
3.1 Branching - If statement, If-else Statement, Multiway decision.
Control 3.2 Looping – while , do-while, for
03 3.3 Nested control structure- Switch statement, Continue statement
12
Structures
Break statement, Goto statement.
4.1Function -Introduction of Function, Function Main, Defining a
Functions and Function, Accessing a Function, Function Prototype, Passing Arguments
04 to a Function, Recursion.
06
Parameter
4.2 Storage Classes –Auto , Extern , Static, Register

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [34]
5.1 Array-Concepts, Declaration, Definition, Accessing array element,
One-dimensional and Multidimensional array.
Arrays , String 5.2 String- Basic of String, Array of String , Functions in String.h
05 Structure and 5.3 Structure- Declaration, Initialization, structure within structure, 14
Union Operation on structures, Array of Structure.
5.4 Union - Definition , Difference between structure and union ,
Operations on a union
6.1 Pointer :Introduction, Definition and uses of Pointers, Address
Operator, Pointer Variables, Dereferencing Pointer, Void Pointer, Pointer
Arithmetic, Pointers to Pointers, Pointers and Array, Passing Arrays to
06 Pointer and Files Function, Pointers and Function, Pointers and two dimensional Array, 08
Array of Pointers, Dynamic Memory Allocation.
6.2 Files: Types of File, File operation- Opening, Closing, Creating,
Reading, Processing File.

Laboratory Assignments:
1. Students are expected to solve and execute at least 20 programming problems based on above
Syllabus.
2. Journal work should comprise of writing the problem definition, solution of problem either as
algorithm and flow chart and source code in C (Advisable hand written) for all the 20 problems.

Assessment:

Internal Assessment Test:

Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 35% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of total 06 questions, each carrying 20 marks.
2. Total 04 questions need to be solved.
3. Question No: 01 will be compulsory and based on entire syllabus wherein sub-questions of
3 to 5 marks will be asked.
4. Remaining questions will be mixed in nature.( e.g. Suppose Q.2 has part (a) from module 3
then part (b) will be from any module other than module 3 )
5. In question paper weightage of each module will be proportional to number of respective
lecture hrs as mentioned in the syllabus.

Text Books:

1 “MASTERING C” by K.R.Venugopal and SudeepR.Prasad , Tata McGraw-Hill Publications.

2 “A Computer Science –Structure Programming Approaches using C ”, by BehrouzForouzan
, Cengage Learning .
3 Schaum’s outlines “Programming with C”, by Byron S. Gottfried, Tata McGraw-Hill
Publications.

Reference Books:

1 “Basics of Computer Science”, by BehrouzForouzan , Cengage Learning .

2 “Programming Techniques through C”, by M. G. Venkateshmurthy, Pearson Publication.
3 “Programming in ANSI C”, by E. Balaguruswamy, Tata McGraw-Hill Education.
4 “Programming in C”, by Pradeep Day and Manas Gosh, Oxford University Press.
5 “Let Us C”, by YashwantKanetkar, BPB Publication.

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [35]
Teaching Scheme
Course Credits Assigned
Course Name (Contact Hours)
Code
Theory Pract. Tut. Theory TW/Pract Tut. Total
FEC206 Communication Skills 02 02 -- 02 01 -- 03

Examination Scheme
Theory
Course Internal Assessment
Course Name End Term
Code Av of Work
Pract Oral Total
Sem
Test1 Test2 Test 1 Exam
&2
FEC206 Communication Skills 10 10 10 40 25 -- -- 75

Objectives
1. To acquaint the students with appropriate language skills with the purpose of improving the
existing ones – LSRW
2. To make the learners understand the importance and effective use of non-verbal
communication
3. To make the learner proficient in public speaking and presentation skills
4. To guide and teach the students to utilize the principles of professional business and technical
writing for effective communication in the global world
5. To make the learner capable of creating official content digitally for further communication in
the corporate environment

Outcomes: Learner will be able to…

1. Understand and evaluate information they listen to and express their ideas with greater
clarity
2. Speak and respond effectively along the various channels of communication in a business
organization
3. Speak convincingly before an audience with the help of an expanded vocabulary and
enhanced digital content
4. Read and summarize effectively
5. Communicate through result oriented writing both within and outside the organization.
6. Write a set of effective and easy to understand technical description, instructions and
convey the same using global information technology

Module Detailed Contents Hrs.

Communication Theory: Concept and Meaning, Communication cycle,
Objectives, Barriers to communication (linguistic and semantic, psychological, physical,
01 mechanical, cultural), Methods of communication (verbal and non-verbal), Networks of 13
communication (formal and informal), Language skills (listening, speaking, reading,
writing), Corporate communication: Digital Content Creation.
Business Correspondence: Principles of Business Correspondence,
Parts of a business letter, Formats (Complete block and Modified block),
02 Types of letters: Enquiry, Reply to enquiry, Claim, Adjustment and
05
Sales letter.
Grammar and Vocabulary: Common errors, Concord (subject- verb agreement), Pairs of
confused words, Lexicon (Enriching vocabulary through one-word substitutes, synonyms,
03 antonyms, etc.) 02

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [36]
04 Summarization and Comprehension: Passages to test the analytical skills and expression 02
Technical writing : Techniques to define an object, writing instructions, language exercises
05 02
based on types of expositions (description of an object, explanation of a process)
Information Communication Technology (ICT) enabled communication media: E-mail,
06 02
Blog and Website.

The distribution of Term Work marks will be as follows -

Attendance : 05 marks
Assignments : 20 marks

List of assignments:
1. Communication theory: 02
2. Business Correspondence: 02
3. Grammar and vocabulary: 01
4. Summarization & Comprehension: 01
5. Technical writing: 01
6. ICT enabled communication media: 01

Assessment:

Internal Assessment Test:

Assessment consists of two class tests of 10 marks each. The first test should be conducted in the form of
a three-minute public speech. The second test should be based on theory and application exercises as mentioned
in the syllabus.

End Semester Theory Examination:

1. Question paper will comprise of total 06 questions, each carrying 10 marks.
2. Total 04 questions need to be solved.
3. Question No: 01 will be compulsory and based on entire syllabus wherein sub-questions of
3 to 5 marks will be asked.
4. Remaining questions will be mixed in nature.( e.g. Suppose Q.2 has part (a) from module 3
then part (b) will be from any module other than module 3 )
5. In question paper weightage of each module will be proportional to number of respective
lecture hrs as mentioned in the syllabus.
6. The first module (Communication Theory) will carry 40 % weightage.

References:
1. Communication in Organizations by Dalmar Fisher, Jaico Publishing House
2. Communication Skills by Meenakshi Raman & Sangeeta Sharma,
3. Oxford University Press.
4. Business Correspondence & Report-writing by R.C. Sharma& Krishna Mohan, Tata McGraw-
Hill Education.
5. Effective Technical Communication by Ashraf Rizvi, Tata McGraw-Hill.
6. Technical Writing & Professional Communication for non-native speakers of English by
Thomas N. Huckin & Leslie A. Olsen, McGraw –Hill.
7. Mastering Communication by Nicky Stanton, Palgrave Master Series
8. www.buisnesscommunicationskills.com
9. www.kcitraing.com
10. www.mindtools.com
11. Journal of Business Communication

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [37]
Teaching Scheme
Course Credits Assigned
Course Name (Contact Hours)
Code
Theory Pract. Tut. Theory TW/Pract Tut. Total
Basic Workshop
FEL201 -- 04 -- -- 02 -- 02
Practice - II

Examination Scheme
Theory
Course Internal Assessment
Course Name Term End
Code Av of Pract Oral Total
Sem Work
Test1 Test2 Test 1 Exam
&2
Basic Workshop
FEL201 -- -- -- -- 50 -- -- 50
Practice - II

Detailed Syllabus is given in Basic Workshop Practice-I

Term work:

Term work shall consist of respective reports and jobs of the trades selected the distribution of marks
for term work shall be as follows:

Laboratory work (Job and Journal) : 40 marks

Attendance (Practical and Theory) : 10 marks

The final certification and acceptance of term – work ensures the satisfactory performance of
laboratory work.

University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV 2016 [38]
AC – 11.05.2017
Item No. 4.193

UNIVERSITY OF MUMBAI

Revised syllabus (Rev- 2016) from Academic Year 2016 -17

Under

FACULTY OF TECHNOLOGY

Computer Engineering
Second Year with Effect from AY 2017-18
Third Year with Effect from AY 2018-19
Final Year with Effect from AY 2019-20

As per Choice Based Credit and Grading System

with effect from the AY 2016–17
Co-ordinator, Faculty of Technology’s Preamble:
To meet the challenge of ensuring excellence in engineering education, the issue of quality needs to be
addressed, debated and taken forward in a systematic manner. Accreditation is the principal means of quality
assurance in higher education. The major emphasis of accreditation process is to measure the outcomes of the
program that is being accredited. In line with this Faculty of Technology of University of Mumbai has taken
a lead in incorporating philosophy of outcome based education in the process of curriculum development.
Faculty of Technology, University of Mumbai, in one of its meeting unanimously resolved that, each Board
of Studies shall prepare some Program Educational Objectives (PEO‟s) and give freedom to affiliated
Institutes to add few (PEO‟s). It is also resolved that course objectives and course outcomes are to be clearly
defined for each course, so that all faculty members in affiliated institutes understand the depth and approach
of course to be taught, which will enhance learner‟s learning process. It was also resolved that, maximum
senior faculty from colleges and experts from industry to be involved while revising the curriculum. I am
happy to state that, each Board of studies has adhered to the resolutions passed by Faculty of Technology,
and developed curriculum accordingly. In addition to outcome based education, semester based credit and
grading system is also introduced to ensure quality of engineering education.
Choice based Credit and Grading system enables a much-required shift in focus from teacher-centric to
learner-centric education since the workload estimated is based on the investment of time in learning and not
in teaching. It also focuses on continuous evaluation which will enhance the quality of education. University
of Mumbai has taken a lead in implementing the system through its affiliated Institutes and Faculty of
Technology has devised a transparent credit assignment policy and adopted ten points scale to grade learner‟s
performance. Credit assignment for courses is based on 15 weeks teaching learning process, however content
of courses is to be taught in 12-13 weeks and remaining 2-3 weeks to be utilized for revision, guest lectures,
coverage of content beyond syllabus etc.
Choice based Credit and grading system is implemented from the academic year 2016-17 through optional
courses at department and institute level. This will be effective for SE, TE and BE from academic year
2017-18, 2018-19 and 2019-20 respectively.

Dr. S. K. Ukarande
Co-ordinator,
Faculty of Technology,
Member - Academic Council
University of Mumbai, Mumbai

University of Mumbai, B. E. (Computer Engineering), Rev 2016 2

Chairman’s Preamble:
Engineering education in India is expanding and is set to increase manifold. The major challenge in the
current scenario is to ensure quality to the stakeholders along with expansion. To meet this challenge, the
issue of quality needs to be addressed, debated and taken forward in a systematic manner. Accreditation is
the principal means of quality assurance in higher education and reflects the fact that in achieving
recognition, the institution or program of study is committed and open to external review to meet certain
minimum specified standards. The major emphasis of this accreditation process is to measure the outcomes
of the program that is being accredited. Program outcomes are essentially a range of skills and knowledge
that a student will have at the time of graduation from the program. In line with this Faculty of Technology
of University of Mumbai has taken a lead in incorporating the philosophy of outcome based education in the
process of curriculum development.
As the Chairman, Board of Studies in Computer Engineering of the University of Mumbai, I am happy to
state here that, the Program Educational Objectives for Undergraduate Program were finalized in a brain
storming session, which was attended by more than 85 members from different affiliated Institutes of the
University. They are either Heads of Departments or their senior representatives from the Department of
Computer Engineering. The Program Educational Objectives finalized for the undergraduate program in
Computer Engineering are listed below;

1. To prepare the Learner with a sound foundation in the mathematical, scientific and
engineering fundamentals.
2. To motivate the Learner in the art of self-learning and to use modern tools for solving real life problems.
3. To equip the Learner with broad education necessary to understand the impact of Computer Science and
Engineering in a global and social context.
4. To encourage, motivate and prepare the Learner‟s for Lifelong­ learning.
5. To inculcate professional and ethical attitude, good leadership qualities and commitment to social
responsibilities in the Learner‟s thought process.

In addition to Program Educational Objectives, for each course of the program, objectives and expected
outcomes from a learner‟s point of view are also included in the curriculum to support the philosophy of
outcome based education. I strongly believe that even a small step taken in the right direction will definitely
help in providing quality education to the major stakeholders.

Dr. Subhash K. Shinde

Chairman, Board of Studies in Computer Engineering,
University of Mumbai, Mumbai.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 3

Program Structure B.E. Computer Engineering, (Rev. 2016) w.e.f. AY 2017-18
S. E. Computer Engineering (Semester-III)
Teaching Scheme
Credits Assigned
Course Course (Contact Hours)
Code N a me TW/
Theory Pract Tut Theory Tut Total
Pract
CSC301 Applied Mathematics -III 4+1@ - - 5 - - 5

CSC302 Digital Logic Design and Analysis 4 - - 4 - - 4

CSC303 Discrete Mathematics 3+1@ - - 4 - - 4

Electronic Circuits and

CSC304 4 - - 4 - - 4
Communication Fundamentals

CSC305 Data Structures 4 - - 4 - - 4

CSL301 Digital System Lab - 2 - - 1 - 1

CSL302 Basic Electronics Lab - 2 - - 1 - 1

CSL303 Data structure Lab - 2 - 1 - 1

CSL304 OOPM(Java) Lab - 2+2* - - 2 - 2

Total 21 10 - 21 5 - 26

@ 1 hour to be taken tutorial as class wise.

*2 hours shown as practical‟s to be taken class wise and other 2 hours to be taken as batch wise
Examination Scheme
Course Course Theory
Internal Assessment End Oral
Code Name Exam
TW Oral &
Sem. Duration Total
Test 1 Test 2 Avg. Exam Pract
( in Hrs)

CSC301 Applied Mathematics -III 20 20 20 80 3 - - - 100

Digital Logic Design and
CSC302 20 20 20 80 3 - - - 100
Analysis
CSC303 Discrete Structures 20 20 20 80 3 - - - 100
Electronic Circuits and
CSC304 Communication 20 20 20 80 3 - - - 100
Fundamentals
CSC305 Data Structures 20 20 20 80 3 -- - - 100

CSL301 Digital System Lab - - - - - 25 -- 25 50

CSL302 Basic Electronics Lab - - - - - 25 25 --- 50
CSL303 Data structure Lab - - - - - 25 - 25 50
CSL304 OOPM(Java) Lab - - - - - 50 -- 50 100
Total 100 100 100 400 - 125 25 100 750

University of Mumbai, B. E. (Computer Engineering), Rev 2016 4

Program Structure B.E. Computer Engineering, (Rev. 2016) w.e.f. AY 2017-18
S. E. Computer Engineering (Semester-IV)
Teaching Scheme
Course Course Credits Assigned
(Contact Hours)
Code Name TW/
Theory Pract Tut Theory Tut Total
Pract
Applied
CSC401 4+1@ - - 5 - - 5
Mathematics- IV
CSC402 Analysis of Algorithms 4 - - 4 - - 4
Computer Organization and
CSC403 4 - - 4 - - 4
Architecture
CSC404 Computer Graphics 4 - - 4 - - 4
CSC405 Operating System 4 - - 4 - - 4
CSL401 Analysis of Algorithms Lab - 2 - - 1 - 1
CSL402 Computer Graphics Lab - 2 - - 1 - 1
CSL403 Processor Architecture Lab - 2 - 1 - 1
CSL404 Operating System Lab - 2 - - 1 - 1

CSL405 Open Source Tech Lab - 2+2* - - 2 - 2

Total 21 12 - 21 6 - 27

@ 1 hour to be taken tutorial as class wise .

*2 hours shown as Practical‟s to be taken class wise and other 2 hours to be taken as batch wise
Examination Scheme
Course Course Theory
Oral
Code Name Internal Assessment End Exam Oral
TW & Total
Sem. Duration Pract
Test 1 Test 2 Avg.
Exam ( in Hrs)
CSC401 Applied Mathematics- IV 20 20 20 80 3 - - - 100
CSC402 Analysis of Algorithms 20 20 20 80 3 - - - 100
Computer Organization and -
CSC403 20 20 20 80 3 - - 100
Architecture
CSC404 Computer Graphics 20 20 20 80 3 - - - 100

CSC405 Operating System 20 20 20 80 3 -- - - 100

Analysis of Algorithms --
CSL401 - - - - - 25 25 50
Lab
CSL402 Computer Graphics Lab - - - - - 25 -- 25 50
CSL403 Processor Architecture Lab - - - - - 25 25 - 50
CSL404 Operating System Lab - - - - - 25 - 25 50

CSL405 Open Source Tech Lab - - - - - 25 --- 25 50

Total 100 100 100 400 - 125 25 100 750

University of Mumbai, B. E. (Computer Engineering), Rev 2016 5

Program Structure B.E. Computer Engineering, (Rev. 2016) w.e.f. AY 2018-19
T. E. Computer Engineering (Semester-V)
Teaching Scheme
Credits Assigned
Course Course (Contact Hours)
Code Name TW/
Theory Pract Tut Theory Tut Total
Pract
CSC501 Microprocessor 4 - - 4 - - 4
Database Management
CSC502 4 - - 4 - - 4
System
CSC503 Computer Network 4 - - 4 - - 4
Theory of Computer
CSC504 3+1@ - - 4 - - 4
Science
CSDLO Department Level Optional
501X
4 - - 4 - - 4
Course -I

CSL501 Microprocessor Lab - 2 - - 1 1

CSL502 Computer Network Lab - 2 - - 1 - 1

Database & Info. System
CSL503 - 2 - - 1 - 1
Lab
CSL504 Web Design Lab - 2+2* - - 2 - 2
CSL505 Business Comm. & Ethics - 2+2* - - 2 - 2
Total 20 14 - 20 7 - 27

@ 1 hour to be taken tutorial as class wise.

*2 hours shown as Practical‟s to be taken class wise and other 2 hours to be taken as batch wise

Examination Scheme
Course Course Theory
Oral
Code Name Internal Assessment End Exam
TW & Total
Sem. Duration
Test 1 Test 2 Avg. ( in Hrs) Pract
Exam
CSC501 Microprocessor 20 20 20 80 3 - - 100
Database Management
CSC502 20 20 20 80 3 - - 100
System
CSC503 Computer Network 20 20 20 80 3 - - 100
Theory of Computer
CSC504 20 20 20 80 3 - - 100
Science
CSDLO Department Level Optional
501X Course -I 20 20 20 80 3 -- - 100
CSL501 Microprocessor Lab - - - - - 25 25 50
CSL502 Computer Network Lab - - - - - 25 25 50
CSL503 Database & Info. System
Lab - - - - - 25 25 50
CSL504 Web Design Lab - - - - - 25 25 50
CSL505 Business Comm. & Ethics - - - - - 50 - 50
Total 100 100 100 400 - 150 100 750
University of Mumbai, B. E. (Computer Engineering), Rev 2016 6
Program Structure B.E. Computer Engineering, (Rev. 2016) w.e.f. AY 2018-19
T. E. Computer Engineering (Semester-VI)
Teaching Scheme
Credits Assigned
Course Course (Contact Hours)
Code Name TW/
Theory Pract Tut Theory Tut Total
Pract
CSC601 Software Engineering 4 - - 4 - - 4
System Programming &
CSC602 4 - - 4 - - 4
Complier Construction
Data Warehousing &
CSC603 4 - - 4 - - 4
Mining
Cryptography & System
CSC604 4 - - 4 - - 4
Security
CSDLO Department Level Optional
4 - - 4 - - 4
601X Course -II
CSL601 Software Engineering Lab - 2 - - 1 - 1

CSL602 System software Lab - 2 - - 1 - 1

Data Warehousing &
CSL603 - 2 - - 1 - 1
Mining Lab
CSL604 System Security Lab - 2 - - 1 - 1

CSP605 Mini-Project - 4 - - 2 - 2
Total 20 12 - 20 6 - 26

Examination Scheme
Course Course Theory Oral
Code Name Internal Assessment End Exam
TW Oral & Total
Sem. Duration
Test 1 Test 2 Avg. Exam ( in Hrs) Pract

CSC601 Software Engineering 20 20 20 80 3 - - - 100

System Programming & -
CSC602 20 20 20 80 3 - - 100
Complier Construction
Data Warehousing & -
CSC603 20 20 20 80 3 - - 100
Mining
Cryptography & System -
CSC604 20 20 20 80 3 - - 100
Security
CSDLO Department Level Optional -
601X Course -II 20 20 20 80 3 - - 100
Software Engineering 25
CSL601 - - - - - 25 -- 50
Lab
CSL602 System Software Lab - - - - - 25 -- 25 50
Data Warehousing & --
CSL603 - - - - - 25 25 50
Mining Lab
CSL604 System Security Lab - - - - - 25 --- 25 50
CSP605 Mini-Project - - - - - 25 --- 25 50
Total 100 100 100 400 - 150 25 100 750

University of Mumbai, B. E. (Computer Engineering), Rev 2016 7

Program Structure B.E. Computer Engineering, (Rev. 2016) w.e.f. AY 2019-20
B. E. Computer Engineering (Semester-VII )
Teaching Scheme
Credits Assigned
Course Course (Contact Hours)
Code Name TW/
Theory Pract Tut Theory Tut Total
Pract
Digital Signal & Image
CSC701 4 - - 4 - - 4
Processing
Mobile Communication &
CSC702 4 - - 4 - - 4
Computing
Artificial Intelligence & Soft
CSC703 4 - - 4 - - 4
Computing
CSDLO Department Level Optional
4 - - 4 - - 4
701X Course -III
Institute Level Optional
ILO701X 3 - - 3 - - 3
Course-I
Digital Signal & Image
CSL701 - 2 - - 1 - 1
Processing Lab
Mobile App. Development.
CSL702 - 2 - - 1 - 1
Tech. Lab
Artificial Intelligence & Soft
CSL703 - 2 - 1 - 1
Computing Lab
CSL704 Computational Lab-I - 2 1 - 1

CSP705 Major Project-I - 6 3 - 3

Total 19 14 - 19 7 - 26

Examination Scheme
Course Course Theory
Oral Oral
Code Name Internal Assessment End Exam TW & Total
Sem. Duration Pract
Test 1 Test 2 Avg. Exam ( in Hrs)
Digital Signal & Image --
CSC701 20 20 20 80 3 - - 100
Processing
Mobile Communication & --
CSC702 20 20 20 80 3 - - 100
Computing
Artificial Intelligence & Soft --
CSC703 20 20 20 80 3 - - 100
Computing
CSDLO Department Level Optional --
701X Course -III 20 20 20 80 3 - - 100
Institute Level Optional --
ILO701X 20 20 20 80 3 -- - 100
Course-I
Digital Signal & Image
CSL701 - - - - - 25 -- 25
Processing Lab --
Mobile App. Development. --
CSL702 - - - - - 25 25 50
Tech. Lab
Artificial Intelligence & Soft 25
CSL703 -- - - - -- 25 -- 50
Computing Lab
CSL704 Computational Lab-I 25 -- 25 50
CSP705 Major Project-I - - - - - 50 - 25 75
Total - 25
100 100 100 400 150 75 750
University of Mumbai, B. E. (Computer Engineering), Rev 2016 8
Program Structure B.E. Computer Engineering, (Rev. 2016) w.e.f. AY 2019-20
B. E. Computer Engineering (Semester-VIII)

Teaching Scheme
Credits Assigned
Course Course (Contact Hours)
Code Name TW/
Theory Pract Tut Theory Tut Total
Pract
Human Machine
CSC801 4 - - 4 - - 4
Interaction
CSC802 Distributed Computing 4 - - 4 - - 4
CSDLO Department Level Optional
4 - - 4 - - 4
801X Course -IV
Institute Level Optional
ILO801X 3 - - 3 - - 3
Course-II
Human Machine
CSL801 - 2 - - 1 1
Interaction Lab
Distributed Computing
CSL802 2 1 1
Lab
CSL803 Cloud Computing Lab - 4 - - 2 2

CSL804 Computational Lab-II - 2 - 1 1

CSP805 Major Project-II - 12 6 - 6

Total 15 22 - 15 11 - 26

Examination Scheme
Course Course Theory
Oral
Code Name Internal Assessment End Exam TW Oral & Total
Sem. Duratio Pract
Test 1 Test 2 Avg. Exam n ( in
Human Machine Hrs)
CSC801 20 20 20 80 3 - - - 100
Interaction

CSC802 Distributed Computing 20 20 20 80 3 - - - 100

CSDLO Department Level Optional
801X Course -IV 20 20 20 80 3 - - - 100
Institute Level Optional
ILO801X 20 20 20 80 3 - - - 100
Course-II

Human Machine
CSC801 25 25 - 50
Interaction Lab
Distributed Computing
CSL802 - - - - - 25 25 50
Lab
Cloud Computing Lab
CSL803 - - - - - 50 -- 25 75

CSL804 Computational Lab-II

- - - - - 50 -- 25 75
CSP805 Major Project-II 50 50 100
Total 100 100 100 400 -- 150 100 750

University of Mumbai, B. E. (Computer Engineering), Rev 2016 9

Sem. Department Level Optional Course Institute Level Optional Course
(DLOC) (ILOC)

CSDLO5011: Multimedia System

V
CSDLO5012: Advance Operating System --------------------
CSDLO5013: Advance Algorithm

CSDLO6021: Machine Learning

CSDLO6022: Advance Database System

VI
CSDLO6023: Enterprise Resource Planning -------------------

CSDLO6024: Advance Computer Network

ILO7011. Product Lifecycle Management

ILO7012. Reliability Engineering
ILO7013. Management Information
CSDLO7031: Advance System Security & System
Digital Forensics ILO7014. Design of Experiments
VII
CSDLO7032: Big Data & Analytics ILO7015. Operation Research
ILO7016. Cyber Security and Laws
CSDLO7033: Robotics
ILO7017. Disaster Management &
Mitigation Measures
ILO7018. Energy Audit and Management
ILO7019. Development Engineering

ILO8021. Project Management

ILO8022. Finance Management
ILO8023. Entrepreneurship Development
DLO8011: High Performance Computing and Management
VIII DLO8012: Natural Language Processing ILO8024. Human Resource Management

DLO8013: Adhoc Wireless Network ILO8025. Professional Ethics and CSR

ILO8026. Research Methodology
ILO8027. IPR and Patenting
ILO8028. Digital Business Management
ILO8029. Environmental Management

University of Mumbai, B. E. (Computer Engineering), Rev 2016 10

Course Code Course Name Credits
CSC301 Applied Mathematics-III 5

Course objectives:
1. To understand the concept of complex variables, C-R equations, harmonic functions and its
conjugate and mapping in complex plane.
2. To learn the complex mapping, standard mappings, cross ratios and fixed point.
3. To learn the Laplace Transform, Inverse Laplace Transform of various functions, its
application and Z-transform.
4. To understand the concept of Fourier Series, its complex form and enhance the problem
solving skill.

Course outcomes: On successful completion of course learner will be able to:

1. Understand complex variable theory, application of harmonic conjugate to get orthogonal
trajectories and analytic function.
2. Plot the image of the curve by a complex transformation from z-plane to w-plane.
3. Expand the periodic function by using Fourier series and complex form of Fourier series.
4. Understand the concept of Laplace transform and inverse Laplace transform of various
functions and its application to solve ordinary differential equations.
5. Apply the concept of Z- transformation and its inverse of the given sequence.
6. Apply the concept of Correlation and Regression to the engineering problems.

Module Unit Topics Hrs.

No. No.
1.0 Laplace Transform 09
1.1 Laplace Transform of Standard Functions:
Introduction, Definition of Laplace transform, Laplace transform of

1, e at sin( at ), cos(at ),sinh( at ), cosh(at ),t n erf (t ) , Heavi-side

unit step, dirac-delta function, LT of periodic function.
1.2 Properties of Laplace Transform:
Linearity, first shifting property, second shifting property,
n
multiplication by t , division by t , Laplace Transform of
derivatives and integrals, change of scale property. (without
proof)
2.0 Inverse Laplace Transform 08
2.1 Inverse Laplace Transform by Partial fraction method, Convolution
theorem
2.2 Application to solve initial and boundary value problem involving

University of Mumbai, B. E. (Computer Engineering), Rev 2016 11

ordinary differential equations with one dependent variable and
constant coefficients.
3.0 Fourier Series 10
3.1 Dirichlet‟s conditions, Fourier series of periodic functions with
period 2 and 2 L , Fourier series for even and odd functions.
3.2 Half range sine and cosine Fourier series, Parsevel‟s
identities (without proof)
3.3 Complex form of Fourier series, Orthogonal and Orthonormal set of
functions.
4.0 Complex Variable & mapping 09
4.1 Functions of a complex variable, Analytic functions, Cauchy-
Riemann equations in Cartesian co-ordinates & Polar co-ordinates.
4.2 Harmonic functions, Analytic method and Milne Thomson methods
to find f(z), Orthogonal trajectories.
4.3 Mapping: Conformal mapping, bilinear transformations, cross
ratio, fixed points, bilinear transformation of straight lines and
circles.
5.0 Z-transform 06
5.1 Z-transform of standard functions such as Z(an), Z(np).
5.2 Properties of Z-transform :Linearity, Change of scale, Shifting
property, Multiplication of K, Initial and final value, Convolution
theorem ( without proof)
5.3 Inverse Z transform: Binomial Expansion and Method of Partial
fraction
6.0 Correlation & regression, Curve Fitting 10
6.1 Scattered diagrams, Karl Pearson‟s coefficient of correlation,
covariance, Spearman‟s Rank correlation(non-repeated and repeated
ranks)
6.2 Regression coefficient & Lines of Regression.
6.3 Fitting of curves: Least square method. Fitting of the straight line
y  a  bx ,parabolic curve y  a  bx  cx 2 ,& exponential curve
y  abx
Total 52

Text Books:
1. Higher Engineering Mathematics by Grewal B. S. 38th edition, Khanna Publication 2005.
2. Advanced Engineering Mathematics by Kreyszig E. 9th edition, John Wiley.
3. A Text Book of Applied Mathematics Vol. I & II by P.N.Wartilar &
4. J.N.Wartikar, Pune, Vidyarthi Griha Prakashan., Pune.
University of Mumbai, B. E. (Computer Engineering), Rev 2016 12
Reference Books:
1. Advanced Engg. Mathematics by C. Ray Wylie & Louis Barrett.TMH International Edition.
2. Mathematical Methods of Science and Engineering by Kanti B. Datta, Cengage Learning.
3. Integral Transforms and their Engineering Applications by Dr. B. B. Singh, Synergy
Knowledgewar.
4. Laplace Transforms by Murry R. Spieget, Schaun‟s out line series-McGraw Hill
Publication.

Assessment:

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be
conducted when approx. 40% syllabus is completed and second class test when additional
40% syllabus is completed. Duration of each test shall be one hour.

End Semester Theory Examination:

1 Question paper will comprise of 6 questions, each carrying 20 marks.
2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 13

Course Code Course Name Credits
CSC302 Digital Logic Design and Analysis 4

Course Objectives:
1. To introduce the fundamental concepts and methods for design of digital circuits and a
pre-requisite for computer organization and architecture, microprocessor systems.
2. To provide the concept of designing Combinational and sequential circuits.
3. To provide basic knowledge of how digital building blocks are described in VHDL.

Course Outcomes: At the end of the course student should be able-

1. To understand different number systems and their conversions.
2. To analyze and minimize Boolean expressions.
3. To design and analyze combinational circuits.
4. To design and analyze sequential circuits
5. To understand the basic concepts of VHDL.
6. To study basics of TTL and CMOS Logic families.

Module Detailed Content Hours

Number Systems and Codes
Introduction to number system and conversions: Binary, Octal, Decimal
and Hexadecimal number Systems, Binary arithmetic: addition,
subtraction (1‟s and 2‟s complement), multiplication and division.
1 Octal and Hexadecimal arithmetic: Addition and Subtraction (7‟s and 8‟s 8
complement method for octal) and (15‟s and 16‟s complement method
for Hexadecimal).
Codes: Gray Code, BCD Code, Excess-3 code, ASCII Code.
Error Detection and Correction: Hamming codes.
Boolean Algebra and Logic Gates:
Theorems and Properties of Boolean Algebra, Boolean functions,
Boolean function reduction using Boolean laws, Canonical forms,
Standard SOP and POS form.
2 8
Basic Digital gates: NOT , AND , OR , NAND , NOR , EXOR , EX-
NOR, positive and negative logic, K-map method 2 variable, 3 variable,
4 variable, Don‟t care condition, Quine-McClusky Method, NAND-
NOR Realization.
Combinational Logic Design:
Introduction, Half and Full Adder, Half subtractor Full Subtractor, Four
Bit Ripple adder, look ahead carry adder, 4 bit adder subtractor, one digit
3 8
BCD Adder, Multiplexer, Multiplexer tree, Demultiplexer,
Demultiplexer tree, Encoders Priority encoder, Decoders, One bit, Two
bit , 4-bit Magnitude Comparator, ALU IC 74181.
University of Mumbai, B. E. (Computer Engineering), Rev 2016 14
Sequential Logic Design:
Introduction: SR latch, Concepts of Flip Flops: SR, D, J-K, T, Truth
Tables and Excitation Tables of all types, Race around condition, Master
Slave J-K Flip Flops, Timing Diagram, Flip-flop conversion, State
machines, state diagrams, State table, concept of Moore and Mealy
4 15
machine.
Counters : Design of Asynchronous and Synchronous Counters,Modulus
of the Counters, UP- DOWN counter, Shift Registers: SISO, SIPO,
PIPO, PISO Bidirectional Shift Register, Universal Shift Register, Ring
and twisted ring/Johnson Counter, sequence generator.
Introduction to VHDL:
Introduction: Fundamental building blocks Library, Entity, Architecture,
5 6
Modeling Styles, Concurrent and sequential statements, simple design
examples for combinational circuits and sequential circuits.
Digital Logic Families:
Introduction: Terminologies like Propagation Delay, Power
6 3
Consumption, Fan in and Fan out , current and voltage parameters, noise
margin, with respect to TTL and CMOS Logic and their comparison

Text Books:
1. R. P. Jain, “Modern Digital Electronics”, Tata McGraw Hill.
2. M. Morris Mano, “Digital Logic and computer Design”, PHI.
3. Norman Balabanian, “Digital Logic Design Principles”, Wiley.
4. J. Bhasker.“ VHDL Primer”, Pearson Education.

Reference Books:
1. Donald p Leach, Albert Paul Malvino,“Digital principles and Applications”,Tata McGraw
2. Yarbrough John M. , “Digital Logic Applications and Design “, Cengage Learning.
3. Douglas L. Perry, “VHDL Programming by Example”, Tata McGraw Hill.

Internal Assessment: Assessment consists of two class tests of 20 marks each. The first class test is
to be conducted when approx. 40% syllabus is completed and second class test when additional
40% syllabus is completed. Duration of each test shall be one hour.

Theory Examination:

1 Question paper will comprise of 6 questions, each carrying 20 marks.

2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 15

Course Code Course Name Credits
CSC303 Discrete Mathematics 4

Course Objectives:
1. Cultivate clear thinking and creative problem solving.
2. Thoroughly train in the construction and understanding of mathematical proofs.
Exercise common mathematical arguments and proof strategies.
3. Thoroughly prepare for the mathematical aspects of other Computer Engineering
courses

Course Outcomes: At the end of the course student will be able to

1. Understand the notion of mathematical thinking, mathematical proofs and to apply
them in problem solving.
2. Ability to reason logically.
3. Ability to understand relations, Diagraph and lattice..
4. Ability to understand use of functions, graphs and their use in programming
applications.
5. Understand use of groups and codes in Encoding-Decoding
6. Apply discrete structures into other computing problems such as formal
specification, verification, artificial intelligence, cryptography, Data Analysis and
Data Mining etc.

Prerequisite: Basic Mathematics

Sr. No. Module Detailed Content Hours

 Sets, Venn diagrams, Operations on Sets
 Laws of set theory, Power set and Products
1 Set Theory 4
 Partitions of sets, The Principle of Inclusion and
Exclusion
 Propositions and logical operations, Truth tables
 Equivalence, Implications
2 Logic  Laws of logic, Normal Forms 8
 Predicates and Quantifiers
 Mathematical Induction
 Relations, Paths and Digraphs
 Properties and types of binary relations
 Operations on relations, Closures, Warshall‟s
Relations
algorithm
3 and 12
 Equivalence and partial ordered relations,
Functions
 Poset, Hasse diagram and Lattice
 Functions: Types of functions - Injective,
Surjective and Bijective

University of Mumbai, B. E. (Computer Engineering), Rev 2016 16

 Composition of functions , Identity and Inverse
function
 Pigeon-hole principle
 Permutations , Combinations
 Elements of Probability, Discrete Probability and
Conditional Probability
4 Counting 6
 Generating Functions and Recurrence Relations
 Recursive Functions
 Introduction to Functional Programming
 Definitions, Paths and circuits: Eulerian and
Hamiltonian
5 Graphs 6
 Types of graphs, Sub Graphs
 Isomorphism of graphs
 Algebraic structures with one binary operation:
Algebraic semigroup, monoid and group, Abelian group
Structures  Isomorphism, Homomorphism and Automorphism
6 8
and Coding  Cyclic groups, Normal subgroups,
Theory  Codes and group codes

Text Books:
1. BernadKolman, Robert Busby, Sharon Cutler Ross, Nadeem-ur-Rehman, “Discrete
Mathematical Structures”, Pearson Education.
2. C.L.Liu, Elements of Discrete Mathematics, second edition 1985, McGraw-Hill BookCompany.
Reprinted 2000.
3. K.H.Rosen, Discrete Mathematics and applications, fifth edition 2003, TataMcGraw Hill
publishing Company.
4. D.E. Rydeheard University of Manchester , R.M. Burstall, University of Edinburgh
“Computational Category Theory”.

Reference Books:
1. Y N Singh, “Discrete Mathematical Structures”, Wiley-India.
2. J .L.Mott, A.Kandel, T.P .Baker, Discrete Mathematics for Computer Scientists and
Mathematicians, second edition 1986, Prentice Hall of India.
3. J. P. Trembley, R. Manohar “Discrete Mathematical Structures with Applications to Computer Science”,
TataMcgraw-Hill.
4. Seymour Lipschutz , Marc Lars Lipson,“ Discrete Mathematics” Schaum‟sOutline, McGraw
Hill Education.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 17

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is
completed. Duration of each test shall be one hour.

Theory Examination:

1. Question paper will comprise of 6 questions, each carrying 20 marks.

2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

** Tutorial lecture can be conducted for each unit and min 10 problems on the covered unit
can be given to the students for practice.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 18

Course Code Course Name Credits

CSC304 Electronic Circuits and Communication Fundamentals 4

Course Objectives:
1. To develop the knowledge of semiconductor devices and circuits, and explain their use in
communication applications.
2. To inculcate circuit analysis capabilities in students.
3. To gain knowledge in electronic devices and circuits that is useful in real life applications.
4. To understand the fundamental concepts of electronic communication and their use in
computer applications.

Course Outcomes: At the end of the course student should be able

1. To understand the use of semiconductor devices in circuits and analyze them.
2. To understand importance of oscillators and power amplifiers in communication system.
3. To understand basic concepts of operational amplifier and their applications.
4. To understand the fundamental concepts of electronic communication
5. To apply knowledge of electronic devices and circuits to communication applications.
6. To study basic concepts of information theory.

Prerequisite: Basic electrical engineering

Module Detailed Content Hours

Electronic Circuits:Bipolar junction transistor.
Input and Output characteristics, Types of Biasing - Fixed bias, self-bias,
1 08
voltage divider bias, DC load line and significance, CE amplifier using re
model, (Analysis based Numericals)
Power Amplifiers:
Introduction, Class A and Class C power amplifier.
2 04
Oscillators: Introduction, Barkhausen criteria, Colpitts oscillator and Crystal
oscillator
Electronic Circuits : Operational Amplifier and its applications
Op-amp – block diagram, parameters and characteristics, applications-
3 Inverting and Non inverting amplifier, Summing Amplifier(Numerical), 10
Difference amplifier, Basic Integrator and Differentiator, Comparator, Zero
Crossing Detector (only theory)

University of Mumbai, B. E. (Computer Engineering), Rev 2016 19

Communication Fundamentals: Analog Communication
Block diagram and elements of analog communication systems, Theory of
amplitude modulation and types of AM (Numerical)
Generation of DSB SC using diode based balanced modulator, Generation of
4 10
SSB using phase shift method, Introduction of FM,and its mathematical
representation, Statement of Carson‟s Rule Comparison of AM, FM, Block
diagram of AM transmitter (HLM and LLM)
Block diagram of AM Superheterodyne receiver.
Pulse Modulation and Multiplexing.
Statement of Sampling Theorem, Generation and detection of PAM, PWM,
5 10
PPM, PCM, DM and ADM.
Principle of TDM using PCM and FDM
Communication Fundamentals: Information theory.
6 Amount of information, average information, information rate, Statement of 06
Shannon's theorem, channel capacity (Numericals)

Text Books:

1. Robert Boylestad, „Electronic Devices and circuit Theory‟, Prentice Hall.

2. D Roy Choudhury, „ Linear integrated Circuits‟ New Age International Ltd
3. G. Kennedy, B. Davis, S R M Prasanna, „Electronic Communication Systems‟, McGraw
Hill, 5th Edition.
4. Wayne Tomasi, „Electronic Communication Systems (fundamentals through advanced)‟,
Pearson Education, 4th Edition.
5. K. Sam Shanmugam,‟ Digital and analog communication systems‟, Wiley.

Reference Books:

1. Donald Neamen, „Electronic Circuit Analysis and Design‟, Tata McGraw Hill,2nd Edition.
2. K. R. Botkar, „Integrated Circuits‟, Khanna Publishers, 9th Edition
3. Simon Haykin, „Digital Communication systems‟, Wiley.
4. David Bell, „Electronic Devices and Circuits‟, Oxford, 5th Edition.
5. Ramakant A. Gayakwad, „Op-amp and linear integrated circuits‟, PHI, 3rd edition.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 20

Internal Assessment

Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is
completed. Duration of each test shall be one hour.

Theory Examination:

2 Question paper will comprise of 6 questions, each carrying 20 marks.

5. The students need to solve total 4 questions.
6. Question No.1 will be compulsory and based on entire syllabus.
7. Remaining question (Q.2 to Q.6) will be selected from all the modules.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 21

Course Code Course Name Credits
CSC305 Data Structures 4

Course Objectives:
1. To teach various storage mechanisms of data.
2. To design and implement various data structures.
3. To introduce various techniques for representation of the data in the real world.
4. To teach different sorting techniques.
5. To teach different searching techniques.

Course Outcomes:
1. Students will be able to implement various linear and nonlinear data structures.
2. Students will be able to handle operations like insertion, deletion, searching and traversing
on various data structures.
3. Students will be able to select appropriate sorting technique for given problem.
4. Students will be able to select appropriate searching technique for given problem.
5. Students will be able to apply the learned concepts in various domains like DBMS
and Compiler Construction.
6. Students will be able to choose appropriate data structure for specified problem domain.

Prerequisite: C Programming

Module Detailed Content Hours

01 Introduction to Data Structures 03
Introduction, Types of Data Structures – Linear and Nonlinear,
Operations on Data Structures, Concept of ADT, Arrays.
02 Stack and Queues 10
Introduction, ADT of Stack, Operations on Stack, Array Implementation
of Stack, Applications of Stack – Well form-ness of Parenthesis, Infix to
Postfix Conversion and Postfix Evaluation, Recursion.
ADT of Queue, Operations on Queue, Array Implementation of Queue,
Circular Queue, Priority Queue, Double Ended Queue, Applications of
Queue.
03 Linked List 10
Introduction, Representation of Linked List, Linked List v/s Array,
Implementation of Linked List, Linked Implementation of Stack and
Queue, Circular Linked List, Doubly Linked List, Application –
Polynomial Representation and Addition.
04 Trees 12
Introduction, Tree Terminologies, Binary Tree, Representation, Types of
Binary Tree, Binary Tree Traversals, Binary Search Tree, Implementation
of Binary Search Tree, Applications – Expression Tree, Huffman
Encoding.
Search Trees – AVL, B Tree, B+ Tree, Splay Tree and Trie.
University of Mumbai, B. E. (Computer Engineering), Rev 2016 22
05 Graphs 06
Introduction, Graph Terminologies, Representation, Graph Traversals –
Depth First Search (DFS) and Breadth First Search (BFS), Application –
Topological Sorting
06 Sorting and Searching 07
Introduction, Bubble Sort, Insertion Sort, Merge Sort, Quick Sort.
Linear Search, Binary Search, Hashing – Concept, Hash Functions,
Collision Handling Techniques.

Text Books:
1. Data Structures using C, Reema Thareja, Oxford
2. Data Structures using C and C++, Rajesh K Shukla, Wiley - India
3. Data Structures Using C, Aaron M Tenenbaum, Yedidyah Langsam, Moshe J Augenstein,
Pearson
4. Data Structures: A Pseudocode Approach with C, Richard F. Gilberg & Behrouz A.,
Forouzan, Second Edition, CENGAGE Learning
5. Introduction to Data Structure and Its Applications, JeanPaul Tremblay, P. G. Sorenson

Reference Books:
1. C & Data Structures, Prof. P.S. Deshpande, Prof. O.G. Kakde, DreamTech press.
2. Data Structure Using C, Balagurusamy.
3. Data Structures Using C, ISRD Group, Second Edition, Tata McGraw-Hill.
4. Data Structures, Adapted by: GAV PAI, Schaum‟s Outlines.

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be
conducted when approx. 40% syllabus is completed and second class test when additional
40% syllabus is completed. Duration of each test shall be one hour.

End Semester Theory Examination:

1 Question paper will comprise of 6 questions, each carrying 20 marks.

2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules

University of Mumbai, B. E. (Computer Engineering), Rev 2016 23

Lab Code Lab Name Credits
CSL301 Digital System Lab 1

Lab Outcome:

1. Understand the basics of various digital components.

2. Understand the principles of design of combinational logic and sequential logic circuits
using basic components.
3. Recognize the importance of digital systems in computer architecture.
4. Design and simulate the basic digital circuit.

Description

Experiments with Logic Building Blocks using SSI/MSI, Experiments on Design and/or use
Minimization tools. Use of VHDL and simulation in Logic Design. Experiment on design using
MSI and/or PLDs tools.

Suggested List of Experiments:

Sr. No. Title of Experiments

1 To study and verify the truth table of various logic gates using ICs and realize
Boolean expressions using gates

2 To realize basic gates using universal gates

4 To realize binary to gray code and gray code to binary converter.

5 To realize parity generator and detector.

6 To realize arithmetic circuits

i) Half adder ii) Full adder iii) Half subtractor iv) Full subtractor

7 To realize 2 bit magnitude comparator.

8 To Study multiplexer IC and realization of full adder using multiplexer IC

9 To Study decoder IC and realization of combinational logic using decoder IC

10 Study of flip-flops using IC‟s

11 To realize asynchronous 3 bit up counter.

12 To realize shift registers using flip flops

13 To realize basic gates using VHDL

University of Mumbai, B. E. (Computer Engineering), Rev 2016 24

14 To realize 4:1 multiplexer using VHDL

15 To realize 4 bit counter using VHDL

Term Work:

Laboratory work will be based on above syllabus with minimum 10 experiments to be incorporated.

Oral & Practical exam will be based on the above and CSC302: Digital Logic Design and
Analysis syllabus.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 25

Lab Code Lab Name Credits
CSL302 Basic Electronics Lab 1

Lab Outcome:

1. Understand the basics of various semiconductor devices, electronic components and

instruments.
2. Understand the working of electronic circuits using components
3. Recognize the importance of electronic circuits in electronic communications.
4. Study the fundamental concepts of various modulation methods.

Description

Experiments with semiconductor devices, ICs, electronic component and various measuring
instruments. Study experiments on various modulation methods.

Suggested List of Experiments:

Sr. No. List Experiments

1 Study of electronic components and measuring instruments.

2 Implementation of single stage BJTamplifier.

3 Implementation of oscillators.

4 Implementation of inverting, non inverting amplifier using IC741.

5 Implementation of adder and subtractor using IC 741.

6 Implementation of differentiator using IC741.

7 Implementation of integrator using IC741.

8 Modulation and Demodulation of AM.

9 Study of super heterodyne receiver

10 Modulation and Demodulation PAM.

11 Modulation and Demodulation PWM.

12 Modulation and Demodulation PPM.

13 Modulation and Demodulation PCM.

14 Study of TDM.
University of Mumbai, B. E. (Computer Engineering), Rev 2016 26
15 Study of FDM.

16 SPICE based simulation.

Term Work:

Laboratory work will be based on above syllabus with minimum 10 experiments to be incorporated.

Oral exam will be based on the above mentioned experiment list and CSC304: Electronic circuits
and communication fundamentals syllabus.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 27

Lab Code Lab Name Credits
CSL303 Data Structures Lab 1

Lab outcomes:

1. Students will be able to implement various linear and nonlinear data structures.
2. Students will be able to handle operations like insertion, deletion, searching and traversing on
various data structures.

Description: Experiments based on creating and manipulating various data structures.

Suggested Experiments:

Students are required to complete at least 12 experiments.

Star (*) marked experiments are compulsory.

*1) Array Implementation of Stack.

*2) Conversion of Infix to Postfix.
3) Evaluation of Postfix Expression.
4) Check continuity of different types of parenthesis using stack.
5) Array Implementation of Queue.
*6) Array Implementation of Circular Queue.
7) Array Implementation of Priority Queue
*8) Implementation of Singly Linked List
9) Linked Implementation of Stack
10) Linked Implementation of Queue.
11) Implementation of Circular Linked List.
12) Implementation of Doubly Linked List.
*13) Implement Binary Search Tree.
14) Implementation of Bubble Sort.
15) Implementation of Insertion Sort.
16) Implementation of Merge Sort.
*17) Implementation of Quick Sort.
*18) Implementation of Binary Search.
19) Implementation of Hashing.
20) Implementation of Depth First Search and Breadth First Search.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 28

Term Work:

1. Term work should consist of at least 10 experiments.

2. Journal must include at least 2 assignments.
3. A case study should be conducted using a Mini Project by taking a good problem definition and
complete the following phases.
a. Decomposing the problem into modules
b. Identifying the best suited data structure for solving the sub problems with justification
c. Define algorithms for various identified functions
d. Implement the modules
4. The final certification and acceptance of term work ensures that satisfactory performance of
laboratory work and minimum passing marks in term work.
5. Term Work:
Total 25 Marks = (Experiments: 10 mark + Mini Project: 05 mark + Assignments: 05 mark)

Practical and oral examination will be based on the above syllabus.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 29

Lab Code Lab Name Credits
CSL304 OOPM (JAVA) Lab 2

Course Objective:
1. To learn the object oriented programming concepts.
2. To study various java programming concept like multithreading, exception handling,
packages etc.
3. To explain components of GUI based programming.

Course Outcomes: At the end of the course Student should be able:

1. To apply fundamental programming constructs.
2. To illustrate the concept of packages, classes and objects.
3. To elaborate the concept of strings, arrays and vectors.
4. To implement the concept of inheritance and interfaces.
5. To implement the notion of exception handling and multithreading.
6. To develop GUI based application.

Prerequisite: Structured Programming Approach

Sr. No. Module Detailed Content Hours

1 Introduction to 1.1 OOP Concepts: Object, Class, Encapsulation, 02
Object Oriented Abstraction, Inheritance, Polymorphism.
Programming 1.2 Features of Java, JVM
1.3 Basic Constructs/Notions: Constants, variables and data
types, Operators and Expressions, Revision of
Branching and looping
2 Classes, Object and 2.1Class, Object, Method. 05
Packages 2.2 Constructor, Static members and methods
2.3 Passing and returning Objects
2.4Method Overloading
2.5 Packages in java, creating user defined packages, access
specifiers.

3 Array, String and 3.1 Arrays, Strings, String Buffer 04

Vector 3.2 Wrapper classes, Vector
4 Inheritance and 4.1Types of Inheritance, super keyword, Method Overriding, 03
Interface abstract class and abstract method, final keyword,
4.2 Implementing interfaces, extending interfaces
5 Exception 5.1 Error vs Exception, try, catch, finally, throw, throws, 04
Handling and creating own exception
Multithreading 5.2 Thread lifecycle, Thread class methods, creating threads,
Synchronization
6 GUI programming 6.1 Applet: Applet life cycle, Creating applets, Graphics class 08
in JAVA methods, Font and Color class, parameter passing.
University of Mumbai, B. E. (Computer Engineering), Rev 2016 30
6.2 Event Handling: Event classes and event listener
6.3 Introduction to AWT: Working with windows, Using
AWT controls- push Buttons, Label, Text Fields, Text
Area, Check Box, and Radio Buttons.
6.4 Programming using JDBC: Introduction to JDBC, JDBC
Drivers & Architecture.

Text books:

1. Herbert Schildt, „JAVA: The Complete Reference‟, Ninth Edition, Oracle Press.
2. Sachin Malhotra and Saurabh Chaudhary, “Programming in Java”, Oxford University Press, 2010

Reference Books:

1. Ivor Horton, „Beginning JAVA‟, Wiley India.

2. DietalandDietal, „Java: How to Program‟, 8/e,PHI
3. „JAVA Programming‟, Black Book, Dreamtech Press.
4. „Learn to Master Java programming‟, Staredusolutions

Digital Material:
1. www.nptelvideos.in
2. www.w3schools.com
3. http://spoken-tutorial.org
4. www.staredusolutions.org

Suggested List of Programming Assignments/Laboratory Work:

Program on various ways to accept data through keyboard and unsigned right shift
1.
operator.
2. Program on branching, looping, labelled break and labelled continue.
Program to create class with members and methods, accept and display details for single
3.
object.
4. Program on constructor and constructor overloading
5. Program on method overloading
6. Program on passing object as argument and returning object
7. Program on creating user defined package
8. Program on 1D array
9. Program on 2D array

University of Mumbai, B. E. (Computer Engineering), Rev 2016 31

10. Program on String
11. Program on StringBuffer
12. Program on Vector
13. Program on single and multilevel inheritance (Use super keyword)
14. Program on abstract class
15. Program on interface demonstrating concept of multiple inheritance
16. Program on dynamic method dispatch using base class and interface reference.
17. Program to demonstrate try, catch, throw, throws and finally.
18. Program to demonstrate user defined exception
19. Program on multithreading
20. Program on concept of synchronization
21. Program on Applet to demonstrate Graphics, Font and Color class.
22. Program on passing parameters to applets
23. Program to create GUI application without event handling using AWT controls
24. Program to create GUI application with event handling using AWT controls
25. Mini Project based on content of the syllabus. (Group of 2-3 students)

Term Work:
Students will submit term work in the form of journal that will include:
1. At least 16-18 programs and mini project
2. Two assignments covering whole syllabus
Term Work: 50 Marks (Total Marks) = 20 marks (Experiments) +
20 marks (Mini Project) +
05 marks (Assignments) +
05 marks (Attendance)

Practical and oral examination will be based on suggested practical list and entire syllabus.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 32

Course Code Course Name Credits
CSC401 Applied Mathematics-IV 5

Course Objectives: The objectives of this course are to teach the students:
1. Matrix theory, and it‟s application to find the matrix function. Present methods of computing
and using Eigen values and Eigen vectors.
2. Set up and directly evaluate contour integrals Cauchy‟s integral theorem and formula in
basic and extended form. Present Taylor and Laurent‟s series to find singularities zero‟s and
poles also presents residues theory
3. Theory of probability, Baye‟s Theorem, Expectation and Moments and it‟s application.
4. Probability distribution such as Binomial, Poisson and Normal distribution with their
properties.
5. Sampling theory and it‟s application for small and large sample and Optimization
techniques.

Course Outcomes:
1. Students in this course will be able to apply the method of solving complex integration,
computing residues & evaluate various contour integrals.
2. Demonstrate ability to manipulate matrices and compute Eigen values and Eigen vectors.
3. Apply the concept of probability distribution to the engineering problems.
4. Apply the concept of sampling theory to the engineering problems.
5. Use matrix algebra with its specific rules to solve the system of linear equation, using
concept of Eigen value and Eigen vector to the engineering problems.
6. Apply the concept of Linear & Non-Linear Programming Problem to the engineering
problems.

Module Unit Topics Hrs.

No. No.
1.0 Complex Integration 10
1.1 Complex Integration – Line Integral, Cauchy‟s Integral theorem
for simply
connected regions, Cauchy‟s Integral formula(without proof)
1.2 Taylor‟s and Laurent‟s series ( without proof)
1.3 Zeros, poles of f(z), Residues, Cauchy‟s Residue theorem.
1.4 Applications of Residue theorem to evaluate Integrals of the type
2 
 f cos , sin   d ,  f  x  dx
0 
2.0 Matrices 10
2.1 Eigen values and Eigen vectors.
2.2 Cayley-Hamilton theorem(without proof)
2.3 Similar matrices, diagonalisable matrix.
2.4 Derogatory and non-derogatory matrices, Functions of square
matrix.
University of Mumbai, B. E. (Computer Engineering), Rev 2016 33
3.0 Probability 10
3.1 Baye‟s Theorem
3.2 Random Variables: Discrete & continuous random variables,
expectation, Variance, Probability Density Function &
Cumulative Density Function.
3.3 Moments & Moment generating function.
3.4 Probability distribution: Binomial distribution, Poisson &
Normal distribution. (For detail study)
4.0 Sampling Theory (Large Sample test) 06
4.1 Sampling Distribution, Test of Hypothesis, Level of significance,
Critical region, One Tailed and Two Tailed test,
4.2 Test of significant for Large Samples:-Means of the samples and
test of significant of means of two large samples.
5.0 Sampling Theory (Small Sample test) 06
5.1 Test of significant for small samples:- Students t- distribution for
dependent and independent samples
5.2 Chi square test:- Test of goodness of fit and independence of
attributes,Contingency table.
6.0 Mathematical Programming 10
6.1 Types of solution, Standard and Canonical form of LPP, Basic
and feasible solutions, simplex method.
6.2 Artificial variables, Big –M method (method of penalty).
6.3 Duality and Dual simplex method.
6.4 Non Linear Programming Problems with equality constrains and
inequality Constrains (two or three variables with one constrains)
(No formulation, No Graphical method).
Total 52

Text Books:

1. Higher Engineering Mathematics by Grewal B. S. 38th edition, Khanna Publication 2005.

2. Operation Research by Hira & Gupta,S Chand.
3. A Text Book of Applied Mathematics Vol. I & II by P.N.Wartilar &
4. J.N.Wartikar, Pune, Vidyarthi Griha Prakashan., Pune.
5. Probability and Statistics for Engineering, Dr. J Ravichandran, Wiley-India.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 34

Reference Books:

1. Probability & Statistics with reliability by Kishor s. Trivedi, Wiley India.

2. Advanced Engg. Mathematics by C. Ray Wylie & Louis Barrett.TMH International Edition.

3. Mathematical Methods of Science and Engineering by Kanti B. Datta, Cengage Learning.

4. Advanced Engineering Mathematics by Kreyszig E. 9th edition, John Wiley.
5. Operations Research by S.D. Sharma Kedar Nath, Ram Nath & Co. Meerat.

6. Engineering optimization (Theory and Practice) by Singiresu S.Rao, New Age International
publication.

Assessment:

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be
conducted when approx. 40% syllabus is completed and second class test when additional
40% syllabus is completed. Duration of each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of 6 questions, each carrying 20 marks.

2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

In question paper, weightage of each module will be proportional to number of respective

lecture hours as mentioned in the syllabus.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 35

Course Code Course Name Credits
CSC402 Analysis of Algorithms 4

Course Objectives:
4. To provide mathematical approach for Analysis of Algorithms
5. To solve problems using various strategies
6. To analyse strategies for solving problems not solvable in polynomial time.

Course Outcomes: At the end of the course student will be able to

1. Analyze the running time and space complexity of algorithms.
2. Describe, apply and analyze the complexity of divide and conquer strategy.
3. Describe, apply and analyze the complexity of greedy strategy.
4. Describe, apply and analyze the complexity of dynamic programming strategy.
5. Explain and apply backtracking, branch and bound and string matching techniques
to deal with some hard problems.
6. Describe the classes P, NP, and NP-Complete and be able to prove that a certain
problem is NP-Complete.

Prerequisites: Students should be familiar with concepts of Data structure and discrete structures.

Module Detailed Content Hours

Introduction to analysis of algorithm
Performance analysis , space and time complexity
Growth of function – Big –Oh ,Omega , Theta notation
Mathematical background for algorithm analysis,
Analysis of selection sort , insertion sort.
Recurrences:
-The substitution method
1 12
-Recursion tree method
-Master method
Divide and Conquer Approach:
General method
Analysis of Merge sort, Analysis of Quick sort, Analysis of Binary search,
Finding minimum and maximum algorithm and analysis, Strassen‟s matrix
multiplication
Dynamic Programming Approach:
General Method
Multistage graphs
single source shortest path
2 all pair shortest path 08
Assembly-line scheduling
0/1 knapsack
Travelling salesman problem
Longest common subsequence
3 Greedy Method Approach: 06

University of Mumbai, B. E. (Computer Engineering), Rev 2016 36

General Method
Single source shortest path
Knapsack problem
Job sequencing with deadlines
Minimum cost spanning trees-Kruskal and prim‟s algorithm
Optimal storage on tapes
Backtracking and Branch-and-bound:
General Method
8 queen problem( N-queen problem)
4 Sum of subsets 08
Graph coloring
15 puzzle problem,
Travelling salesman problem.
String Matching Algorithms:
The naïve string matching Algorithms
5 The Rabin Karp algorithm 06
String matching with finite automata
The knuth-Morris-Pratt algorithm
Non-deterministic polynomial algorithms:
Polynomial time,
Polynomial time verification
6 NP Completeness and reducibility 08
NP Completeness proofs
Vertex Cover Problems
Clique Problems

Text Books:

1. T.H.coreman , C.E. Leiserson,R.L. Rivest, and C. Stein, “Introduction to algorithms”, 2nd

edition , PHI publication 2005.
2. Ellis horowitz , Sartaj Sahni , S. Rajsekaran. “Fundamentals of computer algorithms” University
Press

Reference Books:
1. Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani, “Algorithms”, Tata McGraw- Hill
Edition.
2. S. K. Basu, “Design Methods and Analysis of Algorithm”, PHI.
3. John Kleinberg, Eva Tardos, “Algorithm Design”, Pearson.
4. Michael T. Goodrich, Roberto Tamassia, “Algorithm Design”, Wiley Publication.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 37

Assessment:

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is
completed. Duration of each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of 6 questions, each carrying 20 marks.

2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules..

University of Mumbai, B. E. (Computer Engineering), Rev 2016 38

Course Code Course Name Credit
CSC403 Computer Organization and Architecture 4

Course Objectives:

1. To have a thorough understanding of the basic structure and operation of a digital computer.
2. To discuss in detail the operation of the arithmetic unit including the algorithms & implementation of
fixed-point and floating-point addition, subtraction, multiplication & division.
3. To study the different ways of communicating with I/O devices and standard I/O interfaces.
4. To study the hierarchical memory system including cache memories and virtual memory.

Course Outcomes: At the end of the course student should be able-

1. To describe basic structure of the computer system.

2. To demonstrate the arithmetic algorithms for solving ALU operations.
3. To describe instruction level parallelism and hazards in typical processor pipelines.
4. To describe superscalar architectures, multi-core architecture and their advantages
5. To demonstrate the memory mapping techniques.
6. To Identify various types of buses, interrupts and I/O operations in a computer system

Prerequisite: Digital Logic Design and Application

Sr. No. Module Detailed Content Hours

Overview of Computer Architecture & Organization
 Introduction
 Basic organization of computer
 Block level description of the functional units.
Data Representation and Arithmetic Algorithms:
 Integer Data computation: Addition, Subtraction.
1 Introduction Multiplication: unsigned multiplication, Booth‟s 08
algorithm.
 Division of integers: Restoring and non restoring
division
 Floating point representation. IEEE 754 floating
point number representation.
 Floating point arithmetic: Addition, Subtraction,
Multiplication, Division
 Von Neumann model, Harvard Architecture
 Register Organization, Instruction formats,
addressing modes, instruction cycle. Instruction
Processor interpretation and sequencing.
Organization  ALU and Shifters
2 10
and  Basic pipelined datapath and control, Data
Architecture dependences, data hazards, Branch hazards, delayed
branches, branch prediction
 Performance measures – CPI, speedup, efficiency,
throughput and Amdahl‟s law

University of Mumbai, B. E. (Computer Engineering), Rev 2016 39

 Hardwired control unit design methods: State table,
delay element, sequence counter with examples like
control unit for multiplication and division
Control Unit
3
Design  Microprogrammed control Unit: Microinstruction 08
sequencing and execution. Micro operations,
Wilkie‟s microprogrammed Control Unit, Examples
on microprograms
 Classifications of primary and secondary memories.
Types of RAM (SRAM, DRAM, SDRAM, DDR,
SSD) and ROM, Characteristics of memory,
Memory hierarchy: cost and performance
measurement.
Memory
4  Virtual Memory: Concept, Segmentation and 12
Organization
Paging, Address translation mechanism.
 Interleaved and Associative memory.
 Cache memory Concepts, Locality of reference,
design problems based on mapping techniques.
Cache Coherency, Write Policies
 Common I/O device types and characteristics
I/O  Types of data transfer techniques: Programmed I/O,
Organization Interrupt driven I/O and DMA.
5 06
and  Introduction to buses, Bus arbitration and multiple
Peripherals bus hierarchy
 Interrupt types, Interrupts handling
 Introduction to parallel processing, Flynn‟s
Classification
Advanced
 Concepts of superscalar architecture, out-of-order
6 Processor 08
execution, speculative execution, multithreaded
Principles
processor, VLIW, data flow computing.
 Introduction to Multi-core processor architecture

Text Books:
1. William Stallings, “Computer Organization and Architecture: Designing for Performance”,
Pearson Publication, 10th Edition, 2013
2. John P. Hayes, “Computer Architecture and Organization”, McGraw-Hill, 1988
3. B. Govindarajulu, “Computer Architecture and Organization: Design Principles and
Applications”, Second Edition, McGraw-Hill (India),

Reference Books:
1. Andrew S. Tanenbaum “Structured Computer Organization”, Pearson, Sixth Edition
2. Morris Mano. “Computer System Architecture” Pearson Publication, 3rd Edition, 2007
3. Kai Hwang, Fayé Alayé Briggs. “Computer architecture and parallel processing”, McGraw-
Hill
4. P. Pal Chaudhuri. “Computer Organization and Design” Prentice Hall India, 2004
5. Dr. M. Usha, T.S. Shrikant. “Computer System Architecture and Organization” Wiley India,
2014.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 40

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is
completed. Duration of each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of 6 questions, each carrying 20 marks.
2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 41

Course Code Course Name Credits
CSC404 Computer Graphics 4

Course Objectives
1 To equip students with the fundamental knowledge and basic technical competence in
the field of computer graphics.
2 To emphasize on implementation aspect of Computer Graphics Algorithms.
3 To prepare the student for advance areas like Image Processing or Computer Vision or
Virtual Reality and professional avenues in the field of Computer Graphics.

Course Outcomes : At the end of the course , the students should be able to
1 Understand the basic concepts of Computer Graphics.
2 Demonstrate various algorithms for scan conversion and filling of basic objects and their
comparative analysis.
3 Apply geometric transformations, viewing and clipping on graphical objects.
4 Explore solid model representation techniques and projections.
5 Understand visible surface detection techniques and illumination models.

Prerequisite: Knowledge of C Programming, Basic Data Structures and Mathematics.

Module
Detail Syllabus Hours
No
Introduction and Overview of Graphics System: 03
 Definition and Representative uses of computer graphics, classification of
application areas, Overview of coordinate systems ,definition of scan
1 conversion, rasterization and rendering.
 Raster scan & random scan displays, Flat Panel displays like LCD and LED ,
architecture of raster graphics system with display processor, architecture of
random scan systems.
Output Primitives : 12
 Scan conversions of point,line, circle and ellipse : DDA algorithm and
Bresenham algorithm for line drawing, midpoint algorithm for circle,
midpoint algorithm for ellipse drawing ( Mathematical derivation for above
2 algorithms is expected )
 Aliasing , Antialiasing techniques like Pre and post filtering , super sampling
, and pixel phasing ).
 Filled Area Primitive: Scan line Polygon Fill algorithm, Inside outside tests,
Boundary Fill and Flood fill algorithm.
Two Dimensional Geometric Transformations 06
 Basic transformations : Translation , Scaling , Rotation
3  Matrix representation and Homogeneous Coordinates
 Composite transformation
 Other transformations : Reflection and Shear
 Raster method for transformation.
University of Mumbai, B. E. (Computer Engineering), Rev 2016 42
Two Dimensional Viewing and Clipping 08
 Viewing transformation pipeline and Window to Viewport coordinate
transformation
4
 Clipping operations – Point clipping , Line clipping algorithms : Cohen –
Sutherland , Midpoint subdivision , Liang – Barsky , Polygon Clipping
Algorithms : Sutherland – Hodgeman, Weiler – Atherton.
Three Dimensional Object Representations , Geometric Transformations 12
and 3D Viewing
 Boundary Representation and Space partitioning representation: Polygon
Surfaces , Bezier Curve , Bezier Surface , B-Spline Curve , Sweep
Representation, Constructive Solid Geometry ,Octree, Fractal-Geometry :
5 Fractal Dimension, Koch Curve.
 3D Transformations :Translation, Rotation , Scaling and Reflection.
 Composite transformations :Rotation about an arbitrary axis
 3D transformation pipeline
 Projections – Parallel , Perspective.( Matrix Representation )
 3D clipping.
Visible Surface Detection 04
 Classification of Visible Surface Detection algorithm
 Back Surface detection method
6  Depth Buffer method
 Depth Sorting method
 Scan line method
 Area Subdivision method
Illumination Models and Surface Rendering 03
 Basic Illumination Models : Diffused reflection, Phong Specular reflection
7 Model
 Halftone and Dithering techniques
 Polygon Rendering :Constant shading , Gouraud Shading , Phong Shading.

Text Books:
1. “Computer Graphics” C version by Hearn & Baker, 2nd Edition, Pearson
2. “Computer Graphics Principles and Practice in C , 2nd Edition ,James D. Foley, Andries van
Dam, Steven K Feiner, John F. Hughes, Pearson .
3. “Computer Graphics”, by Rajesh K. Maurya, Wiley India Publication.
4. “Computer Graphics “ , by Samit Bhattacharya , Oxford Publication.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 43

Reference Books:

1. “Procedural Elements for Computer Graphics “ by D. Rogers , Tata McGraw-Hill Publications.

2. “Computer Graphics” , by Zhigang Xiang , Roy Plastock , Schaum‟s Outlines McGraw-Hill
Education
3. “Computer Graphics using OpenGL” , by F.S.Hill , Jr. ,Third edition, Pearson Publications.

Assessment:

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is
completed. Duration of each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of 6 questions, each carrying 20 marks.
2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 44

Course Code Course Name Credits
CSC405 Operating System 4

Course Objectives:
1. To introduce basic concepts and functions of operating systems.
2. To understand the concept of process, thread and resource management.
3. To understand the concepts of process synchronization and deadlock.
4. To understand various Memory, I/O and File management techniques.

Course Outcomes: At the end of the course student should be able to

1. Understand role of Operating System in terms of process, memory, file and I/O
management.
2. Apply and analyse the concept of a process, thread, mutual exclusion and deadlock.
3. Evaluate performance of process scheduling algorithms and IPC.
4. Apply and analyse the concepts of memory management techniques.
5. Evaluate the performance of memory allocation and replacement techniques.
6. Apply and analyze different techniques of file and I/O management.

Prerequisite: Computer Organization & Architecture

Sr No Module Detailed Content Hours

Operating Operating System Objectives and Functions, The

System Evolution of Operating Systems, OS Design
1 Overview Considerations for Multiprocessor and Multicore 8 hrs
architectures, Operating system structures, System
Calls, Linux Kernel and Shell.

Process: Concept of a Process, Process States,

Process Description, Process Control Block,
Operations on Processes.
Process Concept Threads: Definition and Types, Concept of
and Scheduling Multithreading, Multicore processors and threads.
2 8 hrs
Scheduling: Uniprocessor Scheduling - Types of
Scheduling: Preemptive and, Non-preemptive,
Scheduling Algorithms: FCFS, SJF, SRTN, Priority
based, Round Robin, Multilevel Queue scheduling.
Introduction to Thread Scheduling, Multiprocessor
Scheduling and Linux Scheduling.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 45

Concurrency: Principles of Concurrency, Inter-
Process Communication, Process/Thread
Synchronization.

Mutual Exclusion: Requirements, Hardware Support,

Synchronization Operating System Support (Semaphores and Mutex),
and Deadlocks Programming Language Support (Monitors), Classical
3 synchronization problems: Readers/Writers Problem, 12 hrs
Producer and Consumer problem.

Principles of Deadlock: Conditions and Resource

Allocation Graphs, Deadlock Prevention, Deadlock
Avoidance: Banker‟s Algorithm for Single & Multiple
Resources, Deadlock Detection and Recovery. Dining
Philosophers Problem.

Memory Management: Memory Management

Requirements, Memory Partitioning: Fixed
Partitioning, Dynamic Partitioning, Memory
Allocation Strategies: Best-Fit, First Fit, Worst Fit,
Next Fit, Buddy System, Relocation. Paging,
Memory Segmentation.
4 8 hrs
Management
Virtual Memory: Hardware and Control Structures,
Demand Paging, Structure of Page Tables, Copy on
Write, Page Replacement Strategies: FIFO, Optimal,
LRU, LFU, Approximation, Counting Based.
Allocation of frames, Thrashing.

File File Management: Overview, File Organization and

5 6 hrs
Management Access, File Directories, File Sharing, Secondary
Storage Management, Linux Virtual File System.

I/O Management and Disk Scheduling: I/O

Devices, Organization of the I/O Function, Operating
6 Input /Output System Design Issues, I/O Buffering, Disk Scheduling 6 hrs
Management algorithm: FCFS, SSTF, SCAN, CSCAN, LOOK, C-
LOOK. Disk Management, Disk Cache, Linux I/O.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 46

Text Books:

1. William Stallings, Operating System: Internals and Design Principles, Prentice Hall, 8th
Edition, 2014, ISBN-10: 0133805913 • ISBN-13: 9780133805918 .
2. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, Operating System Concepts,
John Wiley & Sons , Inc., 9th Edition, 2016, ISBN 978-81-265-5427-0
3. Andrew Tannenbaum, Operating System Design and Implementation, Pearson, 3rd Edition.
4. D.M Dhamdhere, Operating Systems: A Concept Based Approach, Mc-Graw Hill

Reference Books:

1. Maurice J. Bach, “Design of UNIX Operating System”, PHI

2. Achyut Godbole and Atul Kahate, Operating Systems, Mc Graw Hill Education, 3rd Edition
3. The Linux Kernel Book, Remy Card, Eric Dumas, Frank Mevel, Wiley Publications.

Assessment:
Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is
completed. Duration of each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of 6 questions, each carrying 20 marks.
2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 47

Lab Code Lab Name Credit
CSL401 Analysis of Algorithms Lab 1

Lab outcomes: At the end of the course student will be able to

1. Analyze the complexities of various problems in different domains.
2. Prove the correctness and analyze the running time of the basic algorithms for those classic
problems in various domains.
3. Develop the efficient algorithms for the new problem with suitable designing techniques.
4. Implement the algorithms using different strategies.

Prerequisites: Students should be familiar with concepts of Data structure and Discrete structures.

Description:
Minimum 2 experiments should be implemented using any language on each algorithm design
strategy (Divide and conquer, dynamic programming, Greedy method, backtracking and branch &
bound, string matching).

Suggested Laboratory Experiments:

Sr.
Module Name Suggested Experiment List
No.
Introduction to analysis of algorithm
Selection sort , insertion sort.
1
Divide and Conquer Approach Merge sort, Quick sort, Binary search.
Multistage graphs,
single source shortest path,
Dynamic Programming Approach all pair shortest path,
2
0/1 knapsack,
Travelling salesman problem,
Longest common subsequence.
Single source shortest path,
Knapsack problem,
Greedy Method Approach Job sequencing with deadlines,
3
Minimum cost spanning trees-Kruskal and
prim‟s algorithm,
Optimal storage on tapes.
8 queen problem ( N-queen problem),
Sum of subsets,
Backtracking and Branch-and-bound
4 Graph coloring,
15 puzzle problem,
Travelling salesman problem.
University of Mumbai, B. E. (Computer Engineering), Rev 2016 48
The naïve string matching Algorithms,
String Matching Algorithms The Rabin Karp algorithm,
5
String matching with finite automata,
The knuth-Morris-Pratt algorithm.
This will involve implementation of two
algorithms for problems beyond the scope
6 Any two Experiments of syllabus.
The exact set of algorithms to implement is
to be decided by the course instructor.

Text Books:
1. T.H.Coreman , C.E. Leiserson,R.L. Rivest, and C. Stein, “Introduction to algorithms”, 2nd
edition , PHI publication 2005.
2. Ellis horowitz , sartaj Sahni , s. Rajsekaran. “Fundamentals of computer algorithms” University
Press

Reference Books:
1. Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani, “Algorithms”, Tata McGraw- Hill
Edition.
2. S. K. Basu, “Design Methods and Analysis of Algorithm”, PHI.
3. Dana Vrajittoru and William Knight, “Practical Analysis of Algorithms”, Springer 2014th
Edition.

Term Work:
Laboratory work must contain implementation of minimum 10 experiments. The final certification
and acceptance of term work ensures the satisfactory performance of laboratory work and minimum
passing marks in term work. The 25 marks of the term work should be divided as below:
25 Marks (total marks) = 15 Marks Lab. Experiments + 05 Marks Assignments (based on theory
syllabus) + 05 (Attendance: theory + practical)

Oral & Practical Exam will be based on the experiments implemented in the Laboratory.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 49

Lab Code Lab Title Credit
CSL402 Computer Graphics Lab 1

Lab Objectives
1 To emphasize on implementation aspect of Computer Graphics Algorithm.
2 To prepare students for advanced areas like Animation, image processing ,virtual reality etc

Lab Outcomes : At the end of the course , the students should be able to
1 Explore the working principle, utility of various input/ output devices and graphical tools.
2 Implement various output and filled area primitive algorithms using C/ OpenGL
3 Apply transformation and clipping algorithms on graphical objects.
4 Implementation of curve and fractal generation.
5 Develop a Graphical application based on learned concept.

Content:
Scan conversions: lines, circles, ellipses. Filling algorithms, clipping algorithms. 2D and 3D
transformation. Curves. Visible surface determination. Simple animations Application of these
through exercises in C/C++/ Open GL

List of Desirable Experiments:

1. Study and apply basic opengl functions to draw basic primitives. (*)
2. Implement sierpinsky gasket using openGL.
3. Implement DDA Line Drawing algorithms and Bresenham algorithm(*)
4. Implement midpoint Circle algorithm(*)
5. Implement midpoint Ellipse algorithm
6. Implemen tArea Filling Algorithm: Boundary Fill, Flood Fill ,Scan line Polygon Fill (*)
7. Implement Curve : Bezier for n control points , B Spline (Uniform ) ( atleast one)(*)
8. Implement Fractal (Koch Curve)
9. Character Generation : Bit Map method and Stroke Method
10. Implement 2D Transformations: Translation, Scaling, Rotation, Reflection, Shear.(*)
11. Implement Line Clipping Algorithm: Cohen Sutherland / Liang Barsky.(*)
12. Implement polygon clipping algorithm(atleast one)
13. Program to represent a 3D object using polygon surfaces and then perform 3D transformation.
14. Program to perform projection of a 3D object on Projection Plane : Parallel and
Perspective.(*)

University of Mumbai, B. E. (Computer Engineering), Rev 2016 50

Term Work

1. Term work should consist of at least 12 experiments. (*) Practical to be covered necessarily
2. Journal must include at least 2 assignments.
3. Mini Project to perform using C / OpenGL.
Possible Ideas:
a. Animation using multiple object
b. Graphics editor with following features :
*Draw basic geometrical entities; apply geometrical transformations, Area filling, Clipping
against Clip window, displaying the text, displaying bar / line graphs , pie charts etc.

The final certification and acceptance of term work ensures that satisfactory performance of
laboratory work and minimum passing marks in term work.

Term Work: 25 Marks (Total) = 10 Marks (Experiments)

+ 5 Marks (Mini Project)
+ 5 Marks (Assignments)
+ 5 Marks (Theory + Practical Attendance).

Oral & Practical exam will be based on the above content and CSC404: Computer Graphics.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 51

Lab Code Lab Name Credit

CSL403 Processor Architecture Lab 1

Lab Objectives:
1. To implement the operation of the arithmetic unit including the algorithms & implementation of
fixed-point and floating-point addition, subtraction, multiplication & division.
2. To study the different ways of communicating with I/O devices and standard I/O interfaces.
3. To design memory subsystem including cache memory
4. To have through understanding of various computer buses

Lab Outcomes: At the end of the course student should be

1. Assemble personal computer
2. Design the basic building blocks of a computer: arithmetic-logic unit, registers, central
processing unit, and memory.
3. Implement various algorithms like Booth‟s algorithm for arithmetic operations
4. Describe various I/O buses with merits and demerits.

Prerequisite: Digital Logic Design and Applications

Content:

Sr. No. Module Detailed Content

Overview of Computer  Computer Anatomy- Memory, Ports, Motherboard
1 Architecture & and add-on cards
Organization  Dismantling and assembling PC
 Ripple carry adder, Carry look-ahead adder, registers,
Programs on Data
Multiplication
2 Representation and
Arithmetic  Booths Algorithm, Restoring and Non restoring
Division
Processor Organization  ALU Design, CPU Design
3
and Architecture  Case Study on multi-core Processors
4 Memory Organization  Memory design, Cache Memory design
I/O Organization and  Case study on buses like ISA, PCI, USB etc
5
Interrupts  Interrupt handling using C/Java Programming

Digital Material:

 Manual to use the simulator for computer organization and architecture. Developed by
the Department of CSE, IIT kharagpur (http://cse10-iitkgp.virtual-labs.ac.in/ )

University of Mumbai, B. E. (Computer Engineering), Rev 2016 52

Books:
1. William Stallings, “Computer Organization and Architecture: Designing for Performance”,
Pearson Publication, 10th Edition, 2013
2. B. Govindarajulu, “Computer Architecture and Organization: Design Principles and
Applications”, Second Edition, McGraw-Hill (India),
6. Andrew S. Tanenbaum “Structured Computer Organization”, Pearson, Sixth Edition
7. Morris Mano. “Computer System Architecture” Pearson Publication, 3rd Edition, 2007
8. Kai Hwang, Fayé Alayé Briggs. “Computer architecture and parallel processing”, McGraw-
Hill
9. P. Pal Chaudhuri. “Computer Organization and Design” Prentice Hall India, 2004
10. Dr. M. Usha, T.S. Shrikant. “Computer System Architecture and Organization” Wiley India,
2014.

Term Work
Term work should consist of at least 10-12 experiments and 3-4 assignments based on above
content and CSC403: Computer Organization and Architecture

The final certification and acceptance of term work ensures that satisfactory performance of
laboratory work and minimum passing marks in term work.

Term Work: 25 Marks (Total) = 10 Marks (Experiments)

+ 5 Marks (Mini Project)
+ 5 Marks (Assignments)
+ 5 Marks (Theory + Practical Attendance).

Oral exam will be based on the above content and CSC403: Computer Organization and
Architecture.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 53

Lab Code Lab Name Credit
CSL404 Operating System Lab 1

Lab Outcome:
1. Understand basic operating system commands.
2. Understand and explore various system calls.
3. Write shell scripts and shell commands using kernel APIs.
4. Implement and analyze different process scheduling algorithms
5. Implement and analyze different memory management algorithms.
6. Evaluate process management techniques and deadlock handling using simulator.

Descriptions:

Sr. No Contents

1 Explore the internal commands of linux like ls,chdir,mkdir,chown,chmod,chgrp,ps etc

Write shell scripts to do the following:

 Display top 10 processes in descending order
 Display processes with highest memory usage.
 Display current logged in user and logname.
2
 Display current shell, home directory, operating system type, current path setting, current
working directory.
 Display OS version, release number, kernel version.
 Illustrate the use of sort, grep, awk, etc.
a) Create a child process in Linux using the fork system call. From the child process obtain
the process ID of both child and parent by using getpid and getppid system call.
3 Explore wait and waitpid before termination of process.
b) Explore the following system calls: open, read, write, close, getpid, setpid, getuid, getgid,
getegid, geteuid.

4 Implement basic commands of linux like ls, cp, mv and others using kernel APIs.

Write a program to implement any two CPU scheduling algorithms like FCFS, SJF, Round
5
Robin etc.
Write a program to implement dynamic partitioning placement algorithms i.e Best Fit, First-
6
Fit, Worst-Fit etc

7 Write a program to implement various page replacement policies.

Using the CPU-OS simulator analyze and synthesize the following:

a. Process Scheduling algorithms.
8
b. Thread creation and synchronization.
c. Deadlock prevention and avoidance.
University of Mumbai, B. E. (Computer Engineering), Rev 2016 54
Digital Materials:

1. Download the CPU-OS simulator along with related tutorials from http://www.teach-sim.com
2. http://www.teach-sim.com

Books:

1. Linux Kernel Book, by Remy Card, Eric Dumas, Frank Mevel, Wiley India
2. Unix Concepts and Applications, Sumitabha Das, McGraw Hill.

Term Work:

 Term work should consist of at least 12 experiments and 2-3 assignments on above content.
 The final certification and acceptance of term work ensures that satisfactory performance of
laboratory work and minimum passing marks in term work.

 Term Work: 25 Marks (Total) = 10 Marks (Experiments)

+ 5 Marks (Mini Project)
+ 5 Marks (Assignments)
+ 5 Marks (Theory + Practical Attendance).

Oral & Practical exam will be based on the above content and CSC405: Operating system syllabus.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 55

Lab Code Lab Name Credit
CSL405 Open Source Technology Lab 2

Course Outcomes:

1. To understand basic concepts in python and perl.

2. To explore contents of files, directories and text processing with python
3. To develop program for data structure using built in functions in python.
4. To explore django web framework for developing python based web application.
5. To understand file handling and database handling using perl.
6. To explore basics of two way communication between client and server using python and perl

Prerequisites: Knowledge of some programming language like C, Java

Content:

Sr. No Module Name Detailed Content

1 Python basics Data types in python ,Operators in python, Input and Output, Control
statement, Arrays in python, String and Character in python, Functions,
List and Tuples, Dictionaries Exception, Introduction to OOP, Classes ,
Objects , Interfaces, Inheritance

2 Advanced Python Files in Python, Directories, Building Modules, Packages, Text

Processing, Regular expression in python.

3 Data Structure in Python Link List, Stack, Queues, Dequeues

4 Python Integration Graphical User interface ,Networking in Python , Python database

Primer connectivity, Introduction to Django

5 Basics of Perl Perl Overview, Variables, Control Statements, Subroutines, Objects,

Packages and Modules

6 Perl advanced Working with Files, Data manipulation, Database Systems, Networking

Text Books

1. Core Python Programming, Dr. R. Nageswara Rao, Dreamtech Press

2. Beginning Python: Using Python 2.6 and Python 3.1. James Payne, Wrox publication
3. Perl: The Complete Reference. Second Edition. Martin C. Brown, McGraw-Hill
4. Introduction to computing and problem solving using python , E Balagurusamy,McGraw Hill
Education

University of Mumbai, B. E. (Computer Engineering), Rev 2016 56

Reference Book
1. Perl Black Book, 2nd Edition: Steven Holzner,Dreamtech Press
2. Learn Python the Hard Way: (3rd Edition) (Zed Shaw's Hard Way Series)
3. Python Projects , Laura Cassell,Alan Gauld,wrox publication

Digital Material:
1. "The Python Tutorial", http://docs.python.org/release/3.0.1/tutorial/
2. Beginning Perl, https://www.perl.org/books/beginning-perl/
3. http://spoken-tutorial.org
4. www.staredusolutions.org

Suggested experiments using Python:

1. Exploring basics of python like data types (strings,list,array,dictionaries,set,tuples) and control

2. statements.
3. Creating functions, classes and objects using python. Demonstrate exception handling and
inheritance.
4. Exploring Files and directories
a. Python program to append data to existing file and then display the entire fille
b. Python program to count number of lines, words and characters in a file.
c. Python program to display file available in current directory
5. Creating GUI with python containing widgets such as labels, textbox,radio,checkboxes and
custom dialog boxes.

6. Menu driven program for data structure using built in function for link list, stack and queues.
7. Program to demonstrate CRUD( create, read, update and delete) operations on database (SQLite/
MySQL) using python.
8. Creation of simple socket for basic information exchange between server and client.
9. Creating web application using Django web framework to demonstrate functionality of user login
and registration (also validating user detail using regular expression).

Suggested experiments using Perl:

10. Exploring various data type , loops and conditional statement in perl. And Creating functions,
packages and modules in perl.
11. Program to demonstrate use of objects and classes in perl.
12. Program to demonstrate file handling, data manipulation and use of regular expression for text
processing in perl
13. Program to send email and read content of URL.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 57

Term Work:

Students will submit term work in the form of journal that will include:

1. At least 12-14 programs.

2. One mini-project in a group 2-3 student.
3. Two assignments covering whole syllabus.

Term Work (25) = 15 marks (Experiments & Assignments)

+ 10 marks (Mini Project)
+ 05 marks (Attendance)

Practical and oral examination will be based on suggested practical list and entire syllabus.

University of Mumbai, B. E. (Computer Engineering), Rev 2016 58

AC – 5th May, 2018
Item No. – 4.51

UNIVERSITY OF MUMBAI

Revised syllabus (Rev- 2016) from Academic Year 2016 -17

Under

FACULTY OF TECHNOLOGY

Computer Engineering
Second Year with Effect from AY 2017-18
Third Year with Effect from AY 2018-19
Final Year with Effect from AY 2019-20

As per Choice Based Credit and Grading System

with effect from the AY 2016–17
Co-ordinator, Faculty of Technology’s Preamble:
To meet the challenge of ensuring excellence in engineering education, the issue of quality needs to be
addressed, debated and taken forward in a systematic manner. Accreditation is the principal means of quality
assurance in higher education. The major emphasis of accreditation process is to measure the outcomes of the
program that is being accredited. In line with this Faculty of Technology of University of Mumbai has taken
a lead in incorporating philosophy of outcome based education in the process of curriculum development.
Faculty of Technology, University of Mumbai, in one of its meeting unanimously resolved that, each Board
of Studies shall prepare some Program Educational Objectives (PEO‘s) and give freedom to affiliated
Institutes to add few (PEO‘s). It is also resolved that course objectives and course outcomes are to be clearly
defined for each course, so that all faculty members in affiliated institutes understand the depth and approach
of course to be taught, which will enhance learner‘s learning process. It was also resolved that, maximum
senior faculty from colleges and experts from industry to be involved while revising the curriculum. I am
happy to state that, each Board of studies has adhered to the resolutions passed by Faculty of Technology,
and developed curriculum accordingly. In addition to outcome based education, semester based credit and
grading system is also introduced to ensure quality of engineering education.
Choice based Credit and Grading system enables a much-required shift in focus from teacher-centric to
learner-centric education since the workload estimated is based on the investment of time in learning and not
in teaching. It also focuses on continuous evaluation which will enhance the quality of education. University
of Mumbai has taken a lead in implementing the system through its affiliated Institutes and Faculty of
Technology has devised a transparent credit assignment policy and adopted ten points scale to grade learner‘s
performance. Credit assignment for courses is based on 15 weeks teaching learning process, however content
of courses is to be taught in 12-13 weeks and remaining 2-3 weeks to be utilized for revision, guest lectures,
coverage of content beyond syllabus etc.
Choice based Credit and grading system is implemented from the academic year 2016-17 through optional
courses at department and institute level. This will be effective for SE, TE and BE from academic year
2017-18, 2018-19 and 2019-20 respectively.

Dr. S. K. Ukarande
Co-ordinator,
Faculty of Technology,
Member - Academic Council
University of Mumbai, Mumbai

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 2

Chairman’s Preamble:
Engineering education in India is expanding and is set to increase manifold. The major challenge in the
current scenario is to ensure quality to the stakeholders along with expansion. To meet this challenge, the
issue of quality needs to be addressed, debated and taken forward in a systematic manner. Accreditation is
the principal means of quality assurance in higher education and reflects the fact that in achieving
recognition, the institution or program of study is committed and open to external review to meet certain
minimum specified standards. The major emphasis of this accreditation process is to measure the outcomes
of the program that is being accredited. Program outcomes are essentially a range of skills and knowledge
that a student will have at the time of graduation from the program. In line with this Faculty of Technology
of University of Mumbai has taken a lead in incorporating the philosophy of outcome based education in the
process of curriculum development.
As the Chairman, Board of Studies in Computer Engineering of the University of Mumbai, I am happy to
state here that, the Program Educational Objectives for Undergraduate Program were finalized in a brain
storming session, which was attended by more than 85 members from different affiliated Institutes of the
University. They are either Heads of Departments or their senior representatives from the Department of
Computer Engineering. The Program Educational Objectives finalized for the undergraduate program in
Computer Engineering are listed below;

1. To prepare the Learner with a sound foundation in the mathematical, scientific and
engineering fundamentals.
2. To motivate the Learner in the art of self-learning and to use modern tools for solving real life problems.
3. To equip the Learner with broad education necessary to understand the impact of Computer Science and
Engineering in a global and social context.
4. To encourage, motivate and prepare the Learner‘s for Lifelong- learning.
5. To inculcate professional and ethical attitude, good leadership qualities and commitment to social
responsibilities in the Learner‘s thought process.

In addition to Program Educational Objectives, for each course of the program, objectives and expected
outcomes from a learner‘s point of view are also included in the curriculum to support the philosophy of
outcome based education. I strongly believe that even a small step taken in the right direction will definitely
help in providing quality education to the major stakeholders.

Dr. Subhash K. Shinde

Chairman, Board of Studies in Computer Engineering,
University of Mumbai, Mumbai.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 3

Program Structure B.E. Computer Engineering, (Rev. 2016) w.e.f. AY 2018-19
T. E. Computer Engineering (Semester-V)
Teaching Scheme
Credits Assigned
Course Course (Contact Hours)
Code Name TW/
Theory Pract Tut Theory Tut Total
Pract
CSC501 Microprocessor 4 - - 4 - - 4
Database Management
CSC502 4 - - 4 - - 4
System
CSC503 Computer Network 4 - - 4 - - 4
Theory of Computer
CSC504 3+1@ - - 4 - - 4
Science
CSDLO Department Level Optional
501X
4 - - 4 - - 4
Course -I

CSL501 Microprocessor Lab - 2 - - 1 1

CSL502 Computer Network Lab - 2 - - 1 - 1

Database & Info. System
CSL503 - 2 - - 1 - 1
Lab
CSL504 Web Design Lab - 2+2* - - 2 - 2

CSL505 Business Comm. & Ethics - 2+2* - - 2 - 2

Total 20 14 - 20 7 - 27

@ 1 hour to be taken tutorial as class wise.

*2 hours shown as Practical‘s to be taken class wise and other 2 hours to be taken as batch wise

Examination Scheme
Course Course Theory
Oral
Code Name Internal Assessment End Exam
TW & Total
Sem. Duration
Test 1 Test 2 Avg. ( in Hrs) Pract
Exam
CSC501 Microprocessor 20 20 20 80 3 - - 100
Database Management
CSC502 20 20 20 80 3 - - 100
System
CSC503 Computer Network 20 20 20 80 3 - - 100
Theory of Computer
CSC504 20 20 20 80 3 - - 100
Science
CSDLO Department Level Optional
501X Course -I 20 20 20 80 3 -- - 100
CSL501 Microprocessor Lab - - - - - 25 25 50
CSL502 Computer Network Lab - - - - - 25 25 50
CSL503 Database & Info. System
- - - - - 25 25 50
Lab
CSL504 Web Design Lab - - - - - 25 25 50
CSL505 Business Comm. & Ethics - - - - - 50 - 50
Total 100 100 100 400 - 150 100 750
University of Mumbai, B. E. (Computer Engineering), Rev. 2016 4
Program Structure B.E. Computer Engineering, (Rev. 2016) w.e.f. AY 2018-19
T. E. Computer Engineering (Semester-VI)
Teaching Scheme
Credits Assigned
Course Course (Contact Hours)
Code Name TW/
Theory Pract Tut Theory Tut Total
Pract
CSC601 Software Engineering 4 - - 4 - - 4
System Programming &
CSC602 4 - - 4 - - 4
Complier Construction
Data Warehousing &
CSC603 4 - - 4 - - 4
Mining
Cryptography & System
CSC604 4 - - 4 - - 4
Security
CSDLO Department Level Optional
4 - - 4 - - 4
601X Course -II
CSL601 Software Engineering Lab - 2 - - 1 - 1

CSL602 System software Lab - 2 - - 1 - 1

Data Warehousing &
CSL603 - 2 - - 1 - 1
Mining Lab
CSL604 System Security Lab - 2 - - 1 - 1

CSP605 Mini-Project - 4 - - 2 - 2
Total 20 12 - 20 6 - 26

Examination Scheme
Course Course Theory Oral
Code Name Internal Assessment End Exam
TW Oral & Total
Sem. Duration
Test 1 Test 2 Avg. Exam ( in Hrs) Pract

CSC601 Software Engineering 20 20 20 80 3 - - - 100

System Programming & -
CSC602 20 20 20 80 3 - - 100
Complier Construction
Data Warehousing & -
CSC603 20 20 20 80 3 - - 100
Mining
Cryptography & System -
CSC604 20 20 20 80 3 - - 100
Security
CSDLO Department Level Optional -
601X Course -II 20 20 20 80 3 - - 100
Software Engineering 25
CSL601 - - - - - 25 -- 50
Lab
CSL602 System Software Lab - - - - - 25 -- 25 50
Data Warehousing & --
CSL603 - - - - - 25 25 50
Mining Lab
CSL604 System Security Lab - - - - - 25 --- 25 50
CSP605 Mini-Project - - - - - 25 --- 25 50
Total 100 100 100 400 - 125 25 100 750

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 5

Program Structure B.E. Computer Engineering, (Rev. 2016) w.e.f. AY 2019-20
B. E. Computer Engineering (Semester-VII)
Teaching Scheme
Credits Assigned
Course Course (Contact Hours)
Code Name TW/
Theory Pract Tut Theory Tut Total
Pract
Digital Signal & Image
CSC701 4 - - 4 - - 4
Processing
Mobile Communication &
CSC702 4 - - 4 - - 4
Computing
Artificial Intelligence & Soft
CSC703 4 - - 4 - - 4
Computing
CSDLO Department Level Optional
4 - - 4 - - 4
701X Course -III
Institute Level Optional
ILO701X 3 - - 3 - - 3
Course-I
Digital Signal & Image
CSL701 - 2 - - 1 - 1
Processing Lab
Mobile App. Development.
CSL702 - 2 - - 1 - 1
Tech. Lab
Artificial Intelligence & Soft
CSL703 - 2 - 1 - 1
Computing Lab
CSL704 Computational Lab-I - 2 1 - 1

CSP705 Major Project-I - 6 3 - 3

Total 19 14 - 19 7 - 26

Examination Scheme
Course Course Theory
Oral Oral
Code Name Internal Assessment End Exam TW & Total
Sem. Duration Pract
Test 1 Test 2 Avg. Exam ( in Hrs)
Digital Signal & Image --
CSC701 20 20 20 80 3 - - 100
Processing
Mobile Communication & --
CSC702 20 20 20 80 3 - - 100
Computing
Artificial Intelligence & Soft --
CSC703 20 20 20 80 3 - - 100
Computing
CSDLO Department Level Optional --
701X Course -III 20 20 20 80 3 - - 100
Institute Level Optional --
ILO701X 20 20 20 80 3 -- - 100
Course-I
Digital Signal & Image
CSL701 - - - - - 25 -- 25
Processing Lab --
Mobile App. Development. --
CSL702 - - - - - 25 25 50
Tech. Lab
Artificial Intelligence & Soft 25
CSL703 -- - - - -- 25 -- 50
Computing Lab
CSL704 Computational Lab-I 25 -- 25 50
CSP705 Major Project-I - - - - - 50 - 25 75
Total - 25
100 100 100 400 150 75 750

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 6

Program Structure B.E. Computer Engineering, (Rev. 2016) w.e.f. AY 2019-20
B. E. Computer Engineering (Semester-VIII)

Teaching Scheme
Credits Assigned
Course Course (Contact Hours)
Code Name TW/
Theory Pract Tut Theory Tut Total
Pract
Human Machine
CSC801 4 - - 4 - - 4
Interaction
CSC802 Distributed Computing 4 - - 4 - - 4
CSDLO Department Level Optional
4 - - 4 - - 4
801X Course -IV
Institute Level Optional
ILO801X 3 - - 3 - - 3
Course-II
Human Machine
CSL801 - 2 - - 1 1
Interaction Lab
Distributed Computing
CSL802 2 1 1
Lab
CSL803 Cloud Computing Lab - 4 - - 2 2

CSL804 Computational Lab-II - 2 - 1 1

CSP805 Major Project-II - 12 6 - 6

Total 15 22 - 15 11 - 26

Examination Scheme
Course Course Theory
Oral
Code Name Internal Assessment End Exam TW Oral & Total
Sem. Duratio Pract
Test 1 Test 2 Avg. Exam n ( in
Human Machine Hrs)
CSC801 20 20 20 80 3 - - - 100
Interaction

CSC802 Distributed Computing 20 20 20 80 3 - - - 100

CSDLO Department Level Optional
801X Course -IV 20 20 20 80 3 - - - 100
Institute Level Optional
ILO801X 20 20 20 80 3 - - - 100
Course-II

Human Machine
CSC801 25 25 - 50
Interaction Lab
Distributed Computing
CSL802 - - - - - 25 25 50
Lab
Cloud Computing Lab
CSL803 - - - - - 50 -- 25 75

CSL804 Computational Lab-II

- - - - - 50 -- 25 75
CSP805 Major Project-II 50 -- 50 100
Total 80 80 80 320 -- 200 50 100 750

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 7

Sem. Department Level Optional Course Institute Level Optional Course
(DLOC) (ILOC)

CSDLO5011: Multimedia System

V
CSDLO5012: Advance Operating System --------------------
CSDLO5013: Advance Algorithm

CSDLO6021: Machine Learning

CSDLO6022: Advance Database System

VI
CSDLO6023: Enterprise Resource Planning -------------------

CSDLO6024: Advance Computer Network

ILO7011. Product Lifecycle Management

ILO7012. Reliability Engineering
ILO7013. Management Information
CSDLO7031: Advance System Security & System
Digital Forensics ILO7014. Design of Experiments
VII
CSDLO7032: Big Data & Analytics ILO7015. Operation Research
ILO7016. Cyber Security and Laws
CSDLO7033: Robotics
ILO7017. Disaster Management &
Mitigation Measures
ILO7018. Energy Audit and Management
ILO7019. Development Engineering

ILO8021. Project Management

ILO8022. Finance Management
ILO8023. Entrepreneurship Development
DLO8011: High Performance Computing and Management
VIII DLO8012: Natural Language Processing ILO8024. Human Resource Management

DLO8013: Adhoc Wireless Network ILO8025. Professional Ethics and CSR

ILO8026. Research Methodology
ILO8027. IPR and Patenting
ILO8028. Digital Business Management
ILO8029. Environmental Management

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 8

Course Code Course Name Credits
CSC501 Microprocessor 4

Course objectives:
1. To equip students with the fundamental knowledge and basic technical competence in the field of
Microprocessors.
2. To emphasize on instruction set and logic to build assembly language programs.
3. To prepare students for higher processor architectures and Embedded systems

Course outcomes: On successful completion of course learner will be able to:

1. Describe architecture of x86 processors.
2. Interpret the instructions of 8086 and write assembly and Mixed language programs.
3. Explain the concept of interrupts
4. Identify the specifications of peripheral chip
5. Design 8086 based system using memory and peripheral chips
6. Appraise the architecture of advanced processors

Prerequisite: Digital Electronics and Logic Design

Module Unit Topics Hrs.
No. No.
1.0 The Intel Microprocessors 8086/8088 Architecture 10
1.1  8086/8088 CPU Architecture, Programmer‘s Model
 Functional Pin Diagram
 Memory Segmentation
 Banking in 8086
 Demultiplexing of Address/Data bus
 Study of 8284 Clock Generator
 Study of 8288 Bus Controller
 Functioning of 8086 in Minimum mode and Maximum mode
 Timing diagrams for Read and Write operations in minimum and
maximum mode
2.0 Instruction Set and Programming 12
2.1  Addressing Modes
 Instruction set – Data Transfer Instructions, String Instructions,
Logical Instructions, Arithmetic Instructions, Transfer of Control
Instructions, Processor Control Instructions
 Assembler Directives and Assembly Language Programming,
Macros, Procedures
 Mixed Language Programming with C Language and Assembly
Language.
 Programming based on DOS and BIOS Interrupts (INT 21H, INT
10H)
3.0 8086 Interrupts 6
3.1  Types of interrupts
 Interrupt Service Routine
 Interrupt Vector Table
 Servicing of Interrupts by 8086 microprocessor
 Programmable Interrupt Controller 8259 – Block Diagram,
Interfacing the 8259 in single and cascaded mode, Operating
modes, programs for 8259 using ICWs and OCWs
University of Mumbai, B. E. (Computer Engineering), Rev. 2016 9
4.0 Peripherals and their interfacing with 8086 12
4.1 Memory Interfacing - RAM and ROM
Decoding Techniques – Partial and Absolute
4.2 8255-PPI – Block diagram, Functional PIN Diagram, CWR, operating
modes, interfacing with 8086.
4.3 8253 PIT - Block diagram, Functional PIN Diagram, CWR, operating
modes, interfacing with 8086.
4.4 8257-DMAC – Block diagram, Functional PIN Diagram, Register
organization, DMA operations and transfer modes
5.0 Intel 80386DX Processor 6
5.1  Architecture of 80386 microprocessor
 80386 registers – General purpose Registers, EFLAGS and Control
registers
 Real mode, Protected mode, virtual 8086 mode
 80386 memory management in Protected Mode – Descriptors and
selectors, descriptor tables, the memory paging mechanism
6.0 Pentium Processor 6
6.1 Pentium Architecture
Superscalar Operation, Integer & Floating Point Pipeline Stages, Branch
Prediction Logic, Cache Organisation and MESI Model
Total 52

Assessment:

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

1 Question paper will comprise of 6 questions, each carrying 20 marks.
1. The students need to solve total 4 questions.
2. Question No.1 will be compulsory and based on entire syllabus.
3. Remaining question (Q.2 to Q.6) will be selected from all the modules.

Text Books:
1. 8086/8088 family: Design Programming and Interfacing: John Uffenbeck , PHI.
2. Advanced Microprocessors and Peripherals: K M Bhurchandani, A k Ray McGraw Hill
3. The 80386DX Microprocessor: hardware, Software and Interfacing, Walter A Triebel, Prentice Hall
4. Pentium Processor System Architecture: Tom Shanley & Don Anderson, Addison-Wesley.

Reference Books:

1. Intel Microprocessors: Barry B. Brey, 8th Edition, Pearson Education India

2. Microprocessor and Interfacing: Douglas Hall, Tata McGraw Hill.
3. Advanced MS DOS Programming – Ray Duncan BPB
4. Intel 80386 Datasheets
5. IBM PC Assembly language and Programming: Peter Abel, 5th edition, PHI
6. The Pentium Microprocessor, James Antonakons, Pearson Education

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 10

Course Code Course Name Credits

CSC502 Database Management System 4

Course objectives:
1. Learn and practice data modelling using the entity-relationship and developing database designs.
2. Understand the use of Structured Query Language (SQL) and learn SQL syntax.
3. Apply normalization techniques to normalize the database
4. Understand the needs of database processing and learn techniques for controlling the consequences
of concurrent data access.

Course outcomes: On successful completion of course learner will be able to:

1. Understand the fundamentals of a database systems
2. Design and draw ER and EER diagram for the real life problem.
3. Convert conceptual model to relational model and formulate relational algebra queries.
4. Design and querying database using SQL.
5. Analyze and apply concepts of normalization to relational database design.
6. Understand the concept of transaction, concurrency and recovery.

Prerequisite:
Basic knowledge of Data structure.

Module Unit Topics Hrs.

No. No.
1.0 Introduction Database Concepts: 4
1.1 ● Introduction, Characteristics of databases
● File system v/s Database system
● Users of Database system
1.2 ● Data Independence
● DBMS system architecture
● Database Administrator
2.0 Entity–Relationship Data Model 8
2.1 ● The Entity-Relationship (ER) Model: Entity types : Weak and
strong entity sets, Entity sets, Types of Attributes, Keys,
Relationship constraints : Cardinality and Participation, Extended
Entity-Relationship (EER) Model : Generalization, Specialization
and Aggregation
3.0 Relational Model and relational Algebra 8
3.1 ● Introduction to the Relational Model, relational schema and
concept of keys.
● Mapping the ER and EER Model to the Relational Model
3.2 ● Relational Algebra – unary and set operations, Relational
Algebra Queries.
4.0 Structured Query Language (SQL) 12
4.1 ● Overview of SQL

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 11

● Data Definition Commands, Data Manipulation commands, Data
Control commands, Transaction Control Commands.
4.2 ● Set and string operations, aggregate function - group by, having.
● Views in SQL, joins , Nested and complex queries, Integrity
constraints :- key constraints, Domain Constraints, Referential
integrity , check constraints
4.3 ● Triggers
5.0 Relational–Database Design 8
5.1 ● Pitfalls in Relational-Database designs , Concept of normalization
● Function Dependencies , First Normal Form, 2nd , 3rd , BCNF,
multi valued dependencies , 4NF.
6.0 Transactions Management and Concurrency 12
6.1 ● Transaction concept, Transaction states, ACID properties
● Concurrent Executions, Serializability – Conflict and View,
Concurrency Control: Lock-based, Timestamp-based protocols.
6.2 ● Recovery System: Failure Classification, Log based recovery,
ARIES, Checkpoint, Shadow paging.
● Deadlock handling
Total 52

Assessment:

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

1 Question paper will comprise of 6 questions, each carrying 20 marks.
2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

Text Books:
1. G. K. Gupta ―Database Management Systems‖, McGraw – Hill.
2. Korth, Slberchatz,Sudarshan, ―Database System Concepts‖, 6th Edition, McGraw – Hill
3. Elmasri and Navathe, ―Fundamentals of Database Systems‖, 5th Edition, Pearson education.
4. Peter Rob and Carlos Coronel, ―Database Systems Design, Implementation and Management‖,
Thomson Learning, 5th Edition.

Reference Books:
1. Dr. P.S. Deshpande, SQL and PL/SQL for Oracle 10g, Black Book, Dreamtech Press.
2. Gillenson, Paulraj Ponniah, ―Introduction to Database Management‖, Wiley Publication.
3. Sharaman Shah, ―Oracle for Professional‖, SPD.
4. Raghu Ramkrishnan and Johannes Gehrke, ― Database Management Systems ‖,TMH.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 12

Course Code Course Name Credits

CSC 503 Computer Network 4

Course objective:
1. To introduce concepts and fundamentals of data communication and computer networks.
2. To explore the inter-working of various layers of OSI.
3. To explore the issues and challenges of protocols design while delving into TCP/IP protocol suite.
4. To assess the strengths and weaknesses of various routing algorithms.
5. To understand the transport layer and various application layer protocols.

Course Outcomes:
On successful completion of course learner will be able to:
1. Demonstrate the concepts of data communication at physical layer and compare ISO - OSI model
with TCP/IP model.
2. Demonstrate the knowledge of networking protocols at data link layer.
3. Design the network using IP addressing and subnetting / supernetting schemes.
4. Analyze various routing algorithms and protocols at network layer.
5. Analyze transport layer protocols and congestion control algorithms.
6. Explore protocols at application layer .

Prerequisite: Digital Communication Fundamentals

Module Unit Topics Hrs.

No. No.

1 Introduction to Networking 06

1.1 Introduction to computer network, network application, network

software and hardware components (Interconnection networking devices),
Network topology, protocol hierarchies, design issues for the layers,
connection oriented and connectionless services

1.2 Reference models: Layer details of OSI, TCP/IP models. Communication

between layer.

2 Physical Layer 06

2.1 Introduction to Communication System, digital Communication,

Electromagnetic Spectrum

2.2 Guided Transmission Media: Twisted pair, Coaxial, Fiber optics. Unguided
media (Wireless Transmission): Radio Waves, Microwave, Bluetooth,
Infrared, Circuit and Packet Switching

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 13

3 Data Link Layer 10

3.1 DLL Design Issues (Services, Framing, Error Control, Flow Control), Error
Detection and Correction(Hamming Code, CRC, Checksum) , Elementary
Data Link protocols , Stop and Wait, Sliding Window(Go Back N, Selective
Repeat), HDLC

3.2 Medium Access Control sublayer

Channel Allocation problem, Multiple access Protocol( Aloha, Carrier Sense
Multiple Access (CSMA/CD), Local Area Networks - Ethernet (802.3)

4 Network layer 14

4.1 4.1 Network Layer design issues, Communication Primitives: Unicast,

Multicast, Broadcast. IPv4 Addressing (classfull and classless), Subnetting,
Supernetting design problems ,IPv4 Protocol, Network Address Translation
(NAT)

4.2 Routing algorithms : Shortest Path (Dijkastra‘s), Link state routing, Distance
Vector Routing

4.3 Protocols - ARP,RARP, ICMP, IGMP

4.4 Congestion control algorithms: Open loop congestion control, Closed loop
congestion control, QoS parameters, Token & Leaky bucket algorithms

5 Transport Layer 10

5.1 The Transport Service: Transport service primitives, Berkeley Sockets,

Connection management (Handshake), UDP, TCP, TCP state transition, TCP
timers

5.2 TCP Flow control (sliding Window), TCP Congestion Control: Slow Start

6 Application Layer 06

6.1 DNS: Name Space, Resource Record and Types of Name Server. HTTP,
SMTP, Telnet, FTP, DHCP

Assessment:

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is completed.
Duration of each test shall be one hour.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 14

End Semester Theory Examination:
1. Question paper will comprise of 6 questions, each carrying 20 marks.
2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining questions (Q.2 to Q.6) will be selected from all the modules.

Textbooks:
1. A.S. Tanenbaum, ―Computer Networks‖, Pearson Education, (4e)
2. B.A. Forouzan, ―Data Communications and Networking‖, TMH (5e)
3. James F. Kurose, Keith W. Ross, ―Computer Networking, A Top-Down Approach
Featuring the Internet‖, Addison Wesley, (6e)

References:
1. S.Keshav: An Engineering Approach To Computer Networking, Pearson
2. Natalia Olifer& Victor Olifer,―Computer Networks:Principles, Technologies & Protocols for
Network Design‖, Wiley India, 2011.
3. Larry L.Peterson, Bruce S.Davie, Computer Networks: A Systems Approach, Second Edition
(The Morgan Kaufmann Series in Networking).

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 15

Course Code Course Name Credits

CSC504 Theory of Computer Science 4

Course Objectives:
1. Acquire conceptual understanding of fundamentals of grammars and languages.
2. Build concepts of theoretical design of deterministic and non-deterministic finite automata and push
down automata.
3. Develop understanding of different types of Turing machines and applications.
4. Understand the concept of Undecidability.

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

1. Identify the central concepts in theory of computation and differentiate between deterministic and
nondeterministic automata, also obtain equivalence of NFA and DFA.
2. Infer the equivalence of languages described by finite automata and regular expressions.
3. Devise regular, context free grammars while recognizing the strings and tokens.
4. Design pushdown automata to recognize the language.
5. Develop an understanding of computation through Turing Machine.
6. Acquire fundamental understanding of decidability and undecidability.

Prerequisite: Discrete Mathematics

Module Unit Topics Theory Tutorial

No. No. Hrs. Hrs.
1.0 Basic Concepts and Finite Automata 09 03
1.1  Alphabets, Strings, Languages, Closure properties.
 Finite Automata (FA) and Finite State machine (FSM).
1.2  Deterministic Finite Automata (DFA) and Nondeterministic
Finite Automata (NFA): Definitions, transition diagrams and
Language recognizers
 NFA to DFA Conversion
 Equivalence between NFA with and without ε- transitions
 Minimization of DFA
 FSM with output: Moore and Mealy machines, Equivalence
 Applications and limitations of FA
2.0 Regular Expressions and Languages 06 02
2.1  Regular Expression (RE)
 Equivalence of RE and FA, Arden‘s Theorem
 RE Applications
2.2  Regular Language (RL)
 Closure properties of RLs
 Decision properties of RLs
 Pumping lemma for RLs
3.0 Grammars 08 03
3.1  Grammars and Chomsky hierarchy
3.2  Regular Grammar (RG)

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 16

 Equivalence of Left and Right linear grammar
 Equivalence of RG and FA
3.3 Context Free Grammars (CFG)
 Definition, Sentential forms, Leftmost and Rightmost
derivations, Parse tree, Ambiguity.
 Simplification and Applications.
 Normal Forms: Chomsky Normal Forms (CNF) and
Greibach Normal Forms (GNF).
 CFLs - Pumping lemma, Closure properties
4.0 Pushdown Automata(PDA) 04 01
4.1  Definition, Transitions ,Language of PDA
 Language acceptance by final state and empty stack
 PDA as generator, decider and acceptor of CFG.
 Deterministic PDA , Non-Deterministic PDA
 Application of PDA.
5.0 Turing Machine (TM) 09 03
5.1  Definition, Transitions
 Design of TM as generator, decider and acceptor.
 Variants of TM: Multitrack, Multitape
 Universal TM.
 Equivalence of Single and Multi Tape TMs.
 Applications, Power and Limitations of TMs.
 Context Sensitivity and Linear Bound Automata.
6.0 Undecidability 03 01
6.1  Decidability and Undecidability,
 Recursive and Recursively Enumerable Languages.
 Halting Problem,
 Rice‘s Theorem,
 Post Correspondence Problem,
Total 39 13

Assessment:

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of 6 questions, each carrying 20 marks.
2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 17

Text Books:
1. John E. Hopcroft, Rajeev Motwani, Jeffery D. Ullman, ―Introduction to Automata Theory,
Languages andComputation‖, Pearson Education.
2. Michael Sipser, ―Theory of Computation‖, Cengage learning.
3. Vivek Kulkarni, ―Theory of Computation‖, Oxford University Press, India.

Reference Books:
1. J. C. Martin, ―Introduction to Languages and the Theory of Computation‖, Tata McGraw Hill.
2. Kavi Mahesh, ―Theory of Computation: A Problem Solving Approach‖, Wiley-India.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 18

Course Code Course Name Credits

CSDLO5011 Multimedia System 4

Course objectives:
1. To introduce students about basic fundamentals and key aspects of Multimedia system.
2. To provide knowledge of compression techniques of different multimedia components
3. To help students to understand multimedia communication standards along with technology
environment
4. To provide an opportunity to gain hands-on experience in building multimedia applications.

Course outcomes: Learner will be able to

1. To identify basics of multimedia and multimedia system architecture.
2. To understand different multimedia components.
3. To explain file formats for different multimedia components.
4. To analyze the different compression algorithms.
5. To describe various multimedia communication techniques.
6. To apply different security techniques in multimedia environment.

Prerequisite: Computer Fundaments and Graphics.

Module Unit Topics Hrs.

No. No.

1 Introduction to Multimedia 8

1.1 Overview

1.2 Objects and Elements of Multimedia

1.3 Applications of Multimedia

1.4 Multimedia Systems Architecture – IMA, Workstation, Network

1.5 Types of Medium (Perception, Representation-..)

1.6 Interaction Techniques

1.7 I/O devices - Salient features (Electronic Pen , Scanner, Digital Camera,
Printers, plotters), Storage Media (Jukebox, DVD), Multimedia Databases

2 Text & Digital Image 10

Text

2.1 Visual Representation, Digital Representation.

2.2 File Formats: RTF, TIFF.

2.3 Compression Techniques : Huffman Coding, RLE, CCITT group 3 1D

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 19

Digital Image

2.4 Digital Image Representation (2D format, resolution) Types of Images

(monochrome, gray, color), examples of images (X-Ray, fractal, synthetic,
acoustic).

2.5 File formats: BMP, JPG

2.6 Compression Techniques: fundamentals (coding, interpixel and psychovisual

redundancies),Types – lossless and lossy, Lossless Compression
Algorithms– Shannon-Fano, CCITT group 4 2D, Lossy Compression
Algorithm – JPEG

3 Digital Audio 8

3.1 Basic Sound Concepts: computer representation of sound,

3.2 File Formats – WAV, MPEG Audio

3.3 Compression: PCM, DM, DPCM

4 Digital Video 8

4.1 Digitization of Video, types of video signals ( component, composite and S-

video),

4.2 File Formats: MPEG Video, H.261

4.3 Compression: MPEG

5 Multimedia Network Communication and Representation 10

5.1 Quality of Service

5.2 Multimedia over IP ( RTP, RTSP, RTCP,RSVP)

5.3 Representation- Authoring systems and user interface

6 Multimedia Security 8

6.1 Requirements and properties

6.2 Mechanisms – Digital Signatures, Steganographic methods

6.3 Sample applications – unidirectional distributed systems, information

systems and conference systems

Total 52

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 20

Text Books:
1. Multimedia System Design, Prabhat K. Andleigh& Kiran Thakrar, PHI.
2. Multimedia Communication Systems: Techniques, Standards & Networks, K. R. Rao, Zoran S.
Bojkovic&Dragorad A. Milovanovic, TMH.
3. Multimedia Systems, K. Buford, PHI.
4. Fundamentals of Multimedia, Ze-Nian Li & Mark S. Drew, PHI.

Reference Books:
1. Multimedia Computing Communications & Applications, Ralf Steinmetz & Klara Nahrstedt, Pearson.
2. Digital Image processing, Rafael C. Gonzalez, Richard E. Woods, Pearson.
3. Multimedia Applications, Ralf Steinmetz & Klara Nahrstedt, Springer International Edition

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when approx.
40% syllabus is completed and second class test when additional 40% syllabus is completed. Duration of
each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of 6 questions, each carrying 20 marks.
2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

Suggested List of Experiments:

1. Create a new file format to store a multimedia data.
2. Implement a compression technique and check the efficiency on different inputs.
3. To develop a theme based multimedia presentation
4. To add a digital signature onto a document
5. To perform steganography of text onto an image and check the efficiency with different inputs.

** Perform laboratory work of this course in ‗CSL504: Web Design Lab‘ as experiments or mini project.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 21

Course Code Course Name Credits

CSDLO5012 Advanced Operating Systems 4

Course Objectives:

1. To understand design issues of Advanced Operating systems.

2. To understand the architecture, kernel and file management of Unix operating system.
3. To understand basic concepts and need of Distributed operating systems.
4. To understand concepts and working of different advanced Operating systems like
Multiprocessor OS, Real time OS, Mobile OS.

Course Outcomes: On successful completion of the course student should be able to

1. Demonstrate understanding of design issues of Advanced operating systems and compare

different types of operating systems.
2. Analyse design aspects and data structures used for file subsystem, memory subsystem and
process subsystem of Unix OS.
3. Demonstrate understanding of different architectures used in Multiprocessor OS and analyse the
design and data structures used in Multiprocessor operating systems.
4. Differentiate between threads and processes and compare different processor scheduling
algorithms used in Multiprocessor OS
5. Classify Real Time OS and analyse various real time scheduling algorithms.
6. Explore architectures and design issues of Mobile OS,Virtual OS, Cloud OS.

Prerequisite: Operating Systems

Module Unit Detailed Content Hrs

1 Introduction 04
Functions of operating systems, Design approaches: layered,
kernel based and virtual machine approach, types of advanced
operating systems (NOS, DOS, Multiprocessor OS, Mobile OS,
RTOS, Cloud OS)
2 Unix Kernel and File Management 14
2.1 System Structure, User Perspective, Architecture of Unix Operating
System
2.2 Buffer cache: Header, Buffer Pool, Retrieving, Reading and Writing
Buffer
2.3 File Representation: inodes: Structure of file Directories, Path
conversion to inode, superblock, inode assignment, allocation of
disk blocks
3 Unix Process and Memory management 12
3.1 Detailed design of Process Structure: Kernel Data structures for
process, Structure of Uarea and Process table, Process states and
Transitions
3.2 Context of a Process: Static and Dynamic area of context, Saving
the Context Layout of System Memory, Regions, Mapping regions
University of Mumbai, B. E. (Computer Engineering), Rev. 2016 22
with Process, page table and mapping virtual address to physical
address.
4 Distributed Operating system concepts 06
Goals, Distributed Computing Models, Hardware Concepts,
Software Concepts, Architecture of DOS.
Design Issues: Transparency, Flexibility, Scalability, Reliability,
Performance, fault tolerance
5 Multiprocessor Operating System 08
5.1 Introduction, Basic multiprocessor system architectures, design
issues, Threads, Process synchronization: the test and set
instruction, the swap instruction, implementation of the process
wait
5.2 Processor scheduling: Issues, Co-scheduling, Smart scheduling,
Affinity Based scheduling
6 Real Time Operating Systems and Mobile OS 08
6.1 Characteristics of Real Time operating Systems, Classification
of Real Time Operating Systems, Scheduling in RTOS: Clock
driven: cyclic, Event driven: EDF and rate monotonic scheduling.
6.2 Mobile OS: Architecture, Android OS, iOS, Virtual OS,
Cloud OS and their design issues

Assessment:

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

 Question paper will comprise of 6 questions, each carrying 20 marks.
 The students need to solve total 4 questions.
 Question No.1 will be compulsory and based on entire syllabus.
 Remaining question (Q.2 to Q.6) will be selected from all the modules.

Text Books:
1. The Design of the UNIX Operating System, PHI, by Maurice J. Bach.
2. Distributed Computing 2ndEdition, Mahajan and Seema Shah, OXford.
3. Advanced Concepts in Operating Systems, Mukesh Singhal, Niranjan G Shivaratri.
4. Mobile Computing by Rajkamal, 1stedition, Oxford.
5. Real Time Operating System, Jane W.S. Liu, Pearson.

Reference Books:
1. Andrew S. Tanenbaum and Maarten Van Steen, ―Distributed Systems: Principles and Paradigms,
2nd edition, Pearson Education.
2. ―Real-Time Systems: Theory and Practice‖, Rajib Mall, Pearson Education India, 2006.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 23

Course Code Course Name Credit
CSDLO5013 Advanced Algorithm 4

Course Objectives:
1. To provide mathematical approach for Analysis of Algorithms.
2. To teach advanced data structures.
3. To solve complex problems in real life applications.

Course Outcomes: At the end of the course student will be able to

1. Describe analysis techniques for algorithms.
2. Identify appropriate data structure and design techniques for different problems
3. Identify appropriate algorithm to be applied for the various application like geometric modeling,
robotics, networking, etc.
4. Appreciate the role of probability and randomization in the analysis of algorithm
5. Analyze various algorithms.
6. Differentiate polynomial and non deterministic polynomial algorithms.

Prerequisites: Data structures, Discrete mathematics and Analysis of Algorithm

Sr. Module Detailed Content

No.
Hours

1 Introduction- 08
Fundamental Complexity-complexity of recursive algorithms, finding
of Algorithms complexity by tree method, master method, proving
technique (contradiction, mathematical induction).
Amortized analysis- aggregate analysis, accounting
analysis, potential analysis dynamic tables

2 Probabilistic The hiring problem Indicator random variables 08

Analysis and Randomized algorithms Probabilistic analysis and further
Randomized uses of indicator random variable
Algorithm

3 Advanced Data Introduction to trees and heap 12

Structure Red-Black Trees: properties of red-black trees ,
Operations on Red-black trees
Binomial Heaps: Binomial trees and binomial heaps,
Operation on Binomial heaps
Analysis of all above operations

4 Maximum Flow networks , the ford Fulkerson method ,max bipartite 08

Flow matching , push Relabel Algorithm , The relabel to front
algorithm

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 24

5 Computational Line Segment properties, Determining whether any pair of 08
Geometry segment intersects, finding the convex hull, Finding the
closest pair of points.

6 NP- NP-Completeness: NP-Completeness and reducibility, NP- 08

Completeness Completeness proofs, NP-Complete problems-The vertex-
And cover problem, The travelling salesman problem
Approximation
Algorithms

Text Books:

1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, ―Introduction

to Algorithms‖, PHI, India Second Edition.
2. Horowitz, Sahani and Rajsekaran, ―Fundamentals of Computer Algorithms‖, Galgotia.
3. Harsh Bhasin, ―Algorithms – Design and Analysis‖, Oxford, 2015.

Reference Books:

1. Rajeev Motwani, Prabhakar Raghavan, ― Randomized Algorithm‖, Cambridge University

2. S. K. Basu, ―Design Methods and Analysis of Algorithm‖, PHI
3. Vijay V. Vajirani, ―Approximation Algorithms‖,Springer.

Internal Assessment:

Assessment consists of two tests out of which; one (T1) should be compulsory class test (on at least 02
Modules) and the other (T2) is either a class test or assignments on live problems or course project

Theory Examination:

1. Question paper will comprise of total six questions.

2. All question carry equal marks
3. Questions will be mixed in nature (for example supposed Q.2 has part (a) from module 3 then part
(b) will be from any module other than module 3)
4. Only Four question need to be solved.

In question paper weightage of each module will be proportional to number of respective lecture hours
as mentioned in the syllabus.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 25

Lab Code Lab Name Credits
CSL501 Microprocessor Lab 1

Lab Objective:

1. To emphasize on use of Assembly language program.

2. To prepare students for advanced subjects like embedded system and IOT.

Lab Outcome:

1. Use appropriate instructions to program microprocessor to perform various task

2. Develop the program in assembly/ mixed language for Intel 8086 processor
3. Demonstrate the execution and debugging of assembly/ mixed language program

Description:
A microprocessor is the most important unit within a computer system. It is responsible for processing the
unique set of instructions and processes. It is a controlling unit of a computer, capable of performing
Arithmetic Logical Unit (ALU) operations and communicating with the other devices connected to it.
Typical microprocessor operations include adding, subtracting, comparing two numbers, and fetching
numbers from one area to another. These operations are the result of a set of instructions that are part of the
microprocessor design. When computer is turned on, the microprocessor gets the first instruction from the
basic input/output system that comes with the computer as part of its memory. After that, either the BIOS, or
the operating system that BIOS loads into computer memory, or an application program provides instructions
to perform.

Suggested List of Experiments:

Sr. No. Title of Experiments

1 Use of programming tools (Debug/TASM/MASM/8086kit) to perform basic

arithmetic operations on 8bit/16 bit data

2 Code conversion (Hex to BCD, BCD to Hex, ASCII to BCD, BCD to ASCII)

3 Assembly programming for 16-bit addition, subtraction, multiplication and division

(menu based)

4 Assembly program based on string instructions ( overlapping/ non-overlapping block

transfer/ string search/ string length)

5 Assembly program to display the contents of the flag register.

6 Mixed Language program to shift a number for given number of times

7 Assembly program to find the GCD/ LCM of two numbers

8 Assembly program to sort numbers in ascending/ descending order

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 26

9 Mixed Language program to increment, decrement the size of the cursor and also to
disable it.

10 Assembly program to find minimum/ maximum no. from a given array.

11 Program for device driver (printer/mouse/keyboard)

12 Program based on 32 bit architecture (e.g. Switching from real mode to protected
mode using DPMI driver, 32bit multiplication)

13 Assembly program to find factorial of number using procedure

14 Program and interfacing using 8255/ 8253

15 Program and interfacing of ADC/ DAC/ Stepper motor

Term Work:

Term should consist of at least 10 experiments.

Journal must include –
 At least one experiment with use of macros/ procedures
 At least five experiments with use of DOS, BIOS interrupts
 At least two assignments

At least one experiment on hardware interfacing is desirable

The final certification and acceptance of term work ensures satisfactory performance of laboratory work and
minimum marks in term work.

Term Work: 25 marks (Total) = 15 Marks (Experiments) + 5 Marks (Assignments) + 5 Marks (Theory +
Practical Attendance)

Oral & Practical exam will be based on the CSL501and CSC501 syllabus.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 27

Lab Code Lab Name Credits

CSL 502 Computer Network Lab 1

Lab Objective:
To practically explore OSI layers and understand the usage of simulation tools.

Lab Outcomes:
On successful completion of course learner will be able to
1. Design and setup networking environment in Linux.
2. Use Network tools and simulators such as NS2, Wireshark etc. to explore networking algorithms and
protocols.
3. Implement programs using core programming APIs for understanding networking concepts.

Description
The experiments are expected to be performed in Linux environment.

Suggested List of Experiments

Sr. No Title of Experiments

1. Setup a network and configure IP addressing, subnetting, masking. (Eg. CISCO Packet
Tracer, Student Ed.)

2. Use basic networking commands in Linux (ping, tracert, nslookup, netstat, ARP, RARP, ip,
ifconfig, dig, route )

3. Build a simple network topology and configure it for static routing protocol using packet
tracer.

4. Perform network discovery using discovery tools (eg. mrtg)

5. Use Wireshark to understand the operation of TCP/IP layers :

● Ethernet Layer : Frame header, Frame size etc.
● Data Link Layer : MAC address, ARP (IP and MAC address binding)
● Network Layer : IP Packet (header, fragmentation), ICMP (Query and Echo)
● Transport Layer: TCP Ports, TCP handshake segments etc.
● Application Layer: DHCP, FTP, HTTP header formats

6. CRC/ Hamming code implementation.

7. Stop and wait protocol/ sliding window (selective repeat / Go back N )

8. Use simulator (Eg. NS2) to understand functioning of ALOHA, CSMA/CD.

9. a. Set up multiple IP addresses on a single LAN.

b. Using nestat and route commands of Linux, do the following:

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 28

● View current routing table
● Add and delete routes
● Change default gateway
c. Perform packet filtering by enabling IP forwarding using IPtables in Linux.

10. Implementation of DVR/ LSR in NS2/(any other simulator)

11. Socket programming using TCP or UDP

12. Simulate congestion control ( leaky bucket / token bucket).

13. Perform File Transfer and Access using FTP

14. Perform Remote login using Telnet server

Term Work:
Laboratory work should be based on above syllabus of suggested list having minimum 10
experiments, covering all layers.
Experiments ---------------------------------------------------------------------- (15) Marks
Assignments ----------------------------------------------------------------------- (05) Marks
Attendance (Theory + Practical) ----------------------------------------------- (05) Marks
Total ------------------------------------------------------------------------------- (25) Marks

Oral & Practical exam will be based on the above and CSC 503 : Computer Network.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 29

Lab Code Lab Name Credits

CSL503 Database & Information System Lab 1

Lab Outcome: On successful completion of course learner will be able to:

1. Design and draw ER and EER diagram for the real life problem with software tool.
2. Create and update database and tables with different DDL and DML statements.
3. Apply /Add integrity constraints and able to provide security to data.
4. Implement and execute Complex queries.
5. Apply triggers and procedures for specific module/task
6. Handle concurrent transactions and able to access data through front end (using JDBC ODBC
connectivity.)

Description:
 The below suggested experiments needs to be performed by a group of 3/4 students.
 Select any database management system and conduct all experiments based on the same topic.

Suggested List of Experiments:

Sr. No. Title of Experiments

Identify the case study and detail statement of problem.
1
Design an Entity-Relationship (ER) / Extended Entity-Relationship (EER) Model.
2 Mapping ER/EER to Relational schema model.
Create and populate database using Data Definition Language (DDL) and DML
3
Commands for you‘re the specified System.
4 Apply Integrity Constraints for the specified system.
5 Perform Simple queries, string manipulation operations.
6 Nested queries and Complex queries
7 Perform Join operations
8 Views and Triggers
9 Functions , cursor and procedure.
10 Transaction and Concurrency control
11 Mini project- Creating a Two-tier client-server database applications using JDBC

Assignment: Perform Normalization -1NF, 2NF, 3NF

Term Work:

Laboratory work will be based on DBMS syllabus with minimum 10 experiments to be incorporated.
Experiments should be completed by students on the given time duration
Experiments ---------------------------------------------------------------------- (10) Marks
Mini Project----------------------------------------------------------------------- (10) Marks
Attendance (Theory + Practical) ----------------------------------------------- (05) Marks
Total ------------------------------------------------------------------------------- (25) Marks

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 30

Practical and Oral :

Practical and oral Exam should be conducted for the Lab, on Database Management System subject for given
list of experiments .

Implementation ---------------------- ----------------------------------------------(15) Marks

Oral ----------------------------------------------------------------------------------(10) Marks
Total ---------------------------------------------------------------------------------(25) Marks

**Oral & Practical exam will be based on the above and CSC502: ‗DBMS‘ syllabus

Text Books:
1. G. K. Gupta :‖Database Management Systems‖, McGraw – Hill.
2. Korth, Slberchatz,Sudarshan, :‖Database System Concepts‖, 6th Edition, McGraw – Hill
3. Elmasri and Navathe, ― Fundamentals of Database Systems‖, 5thEdition, PEARSON
4. Peter Rob and Carlos Coronel, ― Database Systems Design, Implementation and Management‖, Thomson
Learning, 5th Edition.

Reference Books :
1. Dr. P.S. Deshpande, SQL and PL/SQL for Oracle 10g,Black Book, Dreamtech Press
2. PaulrajPonniah, ― Introduction to Database Management‖,Wiley publication
3. Raghu Ramkrishnan and Johannes Gehrke, ― Database Management Systems‖,TMH
4. Debabrata Sahoo ―Database Management Systems‖ Tata McGraw Hill, Schaum‘s Outline

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 31

Course Code Course Name Credits

CSL504 Web Design Lab 2

Course objectives:
1. To design and create web pages using HTML5 and CSS3.
2. To Create web pages and provide client side validation.
3. To create dynamic web pages using server side scripting.
4. To use MVC framework for web application development.

Course outcomes: On completion of course learner will be able to:

1. Understand the core concepts and features of Web Technology
2. Design static web pages using HTML5 and CSS3
3. Apply the concept of client side validation and design dynamic web pages using JavaScript and
JQuery.
4. Evaluate client and server side technologies and create Interactive web pages using
PHP , AJAX with database connectivity using MySQL.
5. Understand the basics of XML, DTD and XSL and develop web pages using XML / XSLT.
6. Analyze end user requirements and Create web application using appropriate web technologies
and web development framework

Prerequisite: Data Structures, Basics of Programming Languages

Module Unit Topics Hrs.

No. No.
INTRODUCTION TO WWW
1.1 Internet Standards – Introduction to WWW – WWW Architecture –
1.0 SMTP – POP3 – File Transfer Protocol
1.2 Overview of HTTP, HTTP request – response –– Generation of dynamic 2
web pages- W3C Validator, How web works - Setting up the
environment (LAMP/XAMP/WAMP server)
CLIENT SIDE PROGRAMMING
2.1 Markup Language (HTML): Introduction to HTML and HTML5 -
Formatting and Fonts –Commenting Code – Anchors – Backgrounds –
Images – Hyperlinks
2.2 Lists – Tables – Frames - HTML Forms and controls.
2.0 2.3 Cascading Style Sheet (CSS): The need for CSS, Introduction to CSS 3
6
– Basic syntax and structure ,CSS Properties-Inline Styles – Embedding
Style Sheets
2.4 Linking External Style Sheets – Backgrounds –Box Model( Introduction ,
Border Properties, Padding Properties, Margin Properties), Manipulating
text - Margins and Padding - Positioning using CSS., Creating page
Layout and Site Designs
INTRODUCTION TO JAVASCRIPT
3.1 Introduction - Core features - Data types and Variables - Operators, 6
Expressions, and Statements, Functions - Objects - Array, Date and Math
3.0 related Objects
3.2 Document Object Model - Event Handling Controlling Windows &
University of Mumbai, B. E. (Computer Engineering), Rev. 2016 32
Frames and Documents Form handling and validations.
3.3 Advanced JavaScript - Browser Management and Media Management –
Classes – Constructors – Object-Oriented Techniques in JavaScript
3.4 Object constructor and Prototyping - Sub classes and Super classes –
JSON - jQuery and AJAX., Rich Internet Application with AJAX, JQuery
Framework
SERVER SIDE PROGRAMMING
4.1 Introduction - Programming basics - Print/echo - Variables and constants
– Strings and Arrays
4.2 Operators, Control structures and looping structures – Functions –
4.0 Reading Data in Web Pages
4.3 Embedding PHP within HTML - Establishing connectivity with MySQL 8
database, cookies, sessions and Authentication
4.4 AJAX with PHP - AJAX with Databases
XML
5.1 Dynamic page generation (adding interactivity, styles, using HTML,
DHTML, XHTML, CSS, Java Script), XML –DTD(Document Type
5.0 Definition) - XML Schema
5.2 XML –DTD(Document Type Definition) - XML Schema - Document 4
Object Model - Presenting XML - Using XML
Parsers: DOM and SAX,XSL-eXtensible Style sheet Language
6.0 WEB DEVELOPMENT FRAMEWORK 2
6.1 Introduction to Composer - MVC Architecture
6.2 Web Application Development using web development framework
:-Introduction to Laravel, Development of Web pages using Laravel.,
Example web applications – Interactive websites, web based information
systems , blogs, social networking sites etc.
Total 28

Text Books:

1. Ralph Moseley , M.T. Savliya ,‖ Developing Web Applications‖, Willy India, Second Edition,
ISBN: 978-81-265-3867-6
2. ―Web Technology Black Book‖, Dremtech Press, First Ediction, 978-7722-997
3. Robin Nixon, "Learning PHP, MySQL, JavaScript, CSS & HTML5" Third Edition,
O'REILLY,2014.
(http://www.ebooksbucket.com/uploads/itprogramming/javascript/Learning_PHP_MySQL_Javascri
pt_CSS_HTML5__Robin_Nixon_3e.pdf)
4. Professional Rich Internet Applications: AJAX and Beyond, Dana Moore, Raymond Budd, Edward
Benson, Wiley publications.
https://ebooks-it.org/0470082801-ebook.htm

Reference Books:

1. Harvey & Paul Deitel& Associates, Harvey Deitel and Abbey Deitel, ―Internet and World Wide
Web - How To Program‖, Fifth Edition, Pearson Education, 2011.
2. Achyut S Godbole and AtulKahate, ―Web Technologies‖, Second Edition, Tata McGraw Hill, 2012.
3. Thomas A Powell, Fritz Schneider, ―JavaScript: The Complete Reference‖, Third Edition, Tata
McGraw Hill, 2013.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 33

4. David Flanagan, ―JavaScript: The Definitive Guide, Sixth Edition‖, O'Reilly Media, 2011
5. Steven Holzner, ―The Complete Reference - PHP‖, Tata McGraw Hill, 2008
6. Mike Mcgrath, ―PHP & MySQL in easy Steps‖, Tata McGraw Hill, 2012.

Digital Material:
1. www.nptelvideos.in
2. www.w3schools.com
3. http://spoken-tutorial.org

Term work Assessment:

Term work will consist of lab experiments testing all the technologies included in syllabus and a Mini
project solving an appropriate problem using the above technology.

Lab
Module Detailed Contents
Sessions
1 Installation and Setting of LAMP / WAMP / XAMP 1

2 Create Simple web page using HTML5 1

3 Design and Implement web page using CSS3 and HTML5 1
Form Design and Client Side Validation using :
4 a. Javascript and HTML5 2
b. Javascript and JQuery
5 Develop simple web page using PHP 1

6 Develop interactive web pages using PHP with database connectivity MYSQL 2
7 Develop XML web page using DTD, XSL 1
8 Implement a webpage using Ajax and PHP 1

9 Hosting the website with Domain Registration Process. 1

10 Design a Web application using Laravel Framework 3

* *Setting up /buying the web host management system for hosting of mini project is recommended.

Term Work: The distribution of marks for term work shall be as follows:

 Lab Assignments : 10 Marks

 Mini Project : 10 Marks
 Attendance : 05 Marks

Practical & Oral Examination:

Practical & Oral examination is to be conducted by pair of internal and external examiners based on the
above syllabus.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 34

Course Code Course Name Credits
CSL505 Business Communication & Ethics 02

Course Objectives:
1. To inculcate professional and ethical attitude at the work place
2. To enhance effective communication and interpersonal skills
3. To build multidisciplinary approach towards all life tasks
4. To hone analytical and logical skills for problem-solving.

Course Outcomes: Learner will be able to…

1. Design a technical document using precise language, suitable vocabulary and apt style.
2. Develop the life skills/interpersonal skills to progress professionally by building stronger
relationships.
3. Demonstrate awareness of contemporary issues knowledge of professional and ethical
responsibilities.
4. Apply the traits of a suitable candidate for a job/higher education , upon being trained in
the techniques of holding a group discussion, facing interviews and writing resume/SOP.
5. Deliver formal presentations effectively implementing the verbal and non-verbal skills

Module Detailed Contents Hrs.

01 Report Writing 05
1.1 Objectives of Report Writing
1.2 Language and Style in a report
1.3 Types: Informative and Interpretative (Analytical, Survey and Feasibility) and
Formats of reports(Memo, Letter, Short and Long Report)
02 Technical Writing 03
2.1 Technical Paper Writing(IEEE Format)
2.2 Proposal Writing
03 Introduction to Interpersonal Skills 09
3.1 Emotional Intelligence
3.2 Leadership and Motivation
3.3 Team Building
3.4 Assertiveness
3.5 Conflict Resolution and Negotiation Skills
3.6 Time Management
3.7 Decision Making
04 Meetings and Documentation 02
4.1 Strategies for conducting effective meetings
4.2 Notice, Agenda and Minutes of a meeting
4.3 Business meeting etiquettes
05 Introduction to Corporate Ethics 02
5.1 Professional and work ethics (responsible use of social media Facebook, WA,
Twitter etc.)
5.2 Introduction to Intellectual Property Rights
5.4 Ethical codes of conduct in business and corporate activities (Personal ethics,
conflicting values, choosing a moral response and making ethical decisions)

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 35

06 Employment Skills 07
6.1 Group Discussion
6.2 Resume Writing
6.3 Interview Skills
6.4 Presentation Skills
6.5 Statement of Purpose
28

Assessment:
List of Assignments
1. Report Writing(Theory)
2. Technical Proposal
3. Technical Paper Writing(Paraphrasing a published IEEE Technical Paper)
4. Interpersonal Skills(Group activities and Role plays)
5. Interpersonal Skills(Documentation in the form of soft copy or hard copy)
6. Meetings and Documentation(Notice, Agenda, Minutes of Mock Meetings)
7. Corporate ethics(Case studies, Role plays)
8. Writing Resume and Statement of Purpose

Term Work

Term work shall consist of all assignments from the list. The distribution of marks for term work shall
be as follows:

Book Report 10 marks

Assignments: 10 marks
Project Report Presentation: 15 marks
Group Discussion: 10 marks
Attendance: 05 marks

References:
1. Fred Luthans,― Organizational Behavior‖, Mc GrawHill,
2. Lesiker and Petit,― Report Writing for Business ”,McGrawHill
3. R. Subramaniam,― Professional Ethics‖ Oxford University Press
4. Huckin and Olsen, ―Technical Writing and Professional Communication ‖,McGraw
5. Raman and Sharma,FundamentalsofTechnicalCommunication,OxfordUniversityPress
6. Hill Wallace and Masters,― Personal Development for Life and Work‖, Thomson
Learning.
7. Heta Murphy,― Effective Business Communication ”,McGraw Hill, edition
8. R.C Sharma and Krishna Mohan,― Business Correspondence and Report Writing”,
9. Raman Sharma, ‖Communication Skills”, Oxford University Press
10. B N Ghosh,― Managing Soft Skills for Personality Development ‖,Tata McGraw Hill
11. Dufrene, Sinha,―BCOM‖, Cengage Learning, 2ndedition
12. Bell. Smith,―ManagementCommunication‖WileyIndiaEdition,3rdedition.
13. Dr. K. Alex, ―Soft Skills‖, S Chand and Company
14. Robbins Stephens P., ―Organizational Behavior‖, Pearson Education
15. https://grad.ucla.edu/asis/agep/advsopstem.pdf

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 36

Course Code Course Name Credits
CSC601 Software Engineering 4

Course objectives:
The main objective of the course is to introduce to the students about the product that is to be engineered and
the processes that provides a framework for the engineering methodologies and practices.
1. To provide the knowledge of software engineering discipline.
2. To apply analysis, design and testing principles to software project development.
3. To demonstrate and evaluate real time projects with respect to software engineering principles.

Course outcomes:
On successful completion of course, learners will be able to:
1. Understand and demonstrate basic knowledge in software engineering.
2. Identify requirements, analyze and prepare models.
3. Plan, schedule and track the progress of the projects.
4. Design & develop the software projects.
5. Identify risks, manage the change to assure quality in software projects.
6. Apply testing principles on software project and understand the maintenance concepts.

Prerequisite:
1. Concepts of Object Oriented Programming & Methodology
2. Knowledge of developing applications with front end & back end connectivity.

Course syllabus:
Module Unit Topics Hrs.
No. No.
1.0 Introduction To Software Engineering and Process Models 08
1.1 Nature of Software, Software Engineering, Software Process, Capability
Maturity Model (CMM)
1.2 Generic Process Model, Prescriptive Process Models: The Waterfall
Model, V-model, Incremental Process Models, Evolutionary Process
Models, Concurrent Models, Agile process, Agility Principles, Extreme
Programming (XP), Scrum, Kanban model
2.0 Requirements Analysis and Modelling 08
2.1 Requirement Elicitation, Software requirement specification (SRS),
Developing Use Cases (UML)
2.2 Requirement Model – Scenario-based model, Class-based model,
Behavioural model.

3.0 Project Scheduling and Tracking 08

3.1 Management Spectrum, 3Ps (people, product and process)
3.2 Process and Project metrics

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 37

3.3 Software Project Estimation: LOC, FP, Empirical Estimation Models -
COCOMO II Model, Specialized Estimation Techniques
3.4 Project scheduling: Defining a Task Set for the Software Project,
Timeline charts, Tracking the Schedule, Earned Value Analysis
4.0 Software Design 10
4.1 Design Principles, Design Concepts, Effective Modular Design – Cohesion
and Coupling
4.2 Architectural Design
4.3 Component-level design
4.4 User Interface Design
5.0 Software Risk, Configuration Management & Quality Assurance 08
5.1 Risk Identification, Risk Assessment, Risk Projection, RMMM
5.2 Software Configuration management, SCM repositories, SCM process
5.3 Software Quality Assurance Task and Plan, Metrics, Software Reliability,
Formal Technical Review (FTR), Walkthrough
6.0 Software Testing and Maintenance 10
6.1 Strategic Approach to Software Testing, Unit testing, Integration testing
Verification, Validation Testing, System Testing
6.2 Software Testing Fundamentals, White-Box Testing , Basis Path Testing,
Control Structure Testing, Black-Box Testing,
6.3 Software maintenance and its types, Software Re-engineering, Reverse
Engineering
Total 52

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when approx.
40% syllabus is completed and second class test when additional 40% syllabus is completed. Duration of
each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of 06 questions, each carrying 20 marks.
2. The students need to solve total 04 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining questions (Q.2 to Q.6) will be selected from all the modules.

Text Books:
1. Roger Pressman, ―Software Engineering: A Practitioner‘s Approach",McGraw-Hill Publications 2. Ian
Sommerville, ―Software Engineering‖, Pearson Education (9th edition)
3. Ali Behfrooz and Fredeick J.Hudson, "Software Engineering Fundamentals", Oxford University Press

Reference Books:
1. Ugrasen Suman, ―Software Engineering – Concepts and Practices‖, Cengage Learning
2. Pankaj Jalote, "An integrated approach to Software Engineering", Springer/Narosa
3. Jibitesh Mishra and Ashok Mohanty, ―Software Engineering‖, Pearson
4. Rajib Mall, "Fundamentals of Software Engineering", Prentice Hall India

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 38

Course Code Course Name Credits

CSC602 System Programming And Compiler Construction 4

Course objectives:
1. To understand the role and functioning of various system programs over application program.
2. To understand basic concepts and designing of assembler, Macro processor and role of static and
dynamic loaders and linkers.
3. To understand the need to follow the syntax in writing an application program and to learn the how
the analysis phase of compiler is designed to understand the programmer‘s requirements without
ambiguity.
4. To synthesize the analysis phase outcomes to produce the object code that is efficient in terms of
space and execution time.

Course outcomes: On successful completion of course learner will be able to:

1. Identify the relevance of different system programs.
2. Describe the various data structures and passes of assembler design.
3. Identify the need for different features and designing of macros.
4. Distinguish different loaders and linkers and their contribution in developing efficient user
applications.
5. Construct different parsers for given context free grammars.
6. Justify the need synthesis phase to produce object code optimized in terms of high execution speed
and less memory usage

Prerequisite: Data Structures, Theoretical computer science, Operating system. Computer Organization and
Architecture, Microprocessor

Module
Unit No. Topics Hrs.
No.

Concept of System Software, Goals of system softwares, system

program and system programming,
Introduction to
1 Introduction to various system programs such as Assembler, Macro 2
System Software
processor, Loader, Linker, Compiler, Interpreter, Device Drivers,
Operating system, Editors, Debuggers.

Elements of Assembly Language programming, Assembly scheme,

pass structure of assembler,
2 Assemblers Assembler Design: Two pass assembler Design and single pass 10
Assembler Design for Hypothetical / X86 family processor, data
structures used.

Introduction, Macro definition and call, Features of Macro

Macros and
3 facility: Simple, parameterized, conditional and nested. Design of 8
Macro Processor
single pass macro processor, data structures used.

Loaders and Introduction, functions of loaders, Relocation and Linking concept,

4 Different loading schemes: Relocating loader, Direct Linking 8
Linkers
Loader, Dynamic linking and loading.
University of Mumbai, B. E. (Computer Engineering), Rev. 2016 39
Introduction to compilers, Phases of compilers:

Lexical Analysis- Role of Finite State Automata in Lexical

Analysis, Design of Lexical analyser, data structures used .
Compilers:
5 Syntax Analysis- Role of Context Free Grammar in Syntax 12
Analysis Phase
analysis, Types of Parsers: Top down parser- LL(1), Bottom up
parser- Operator precedence parser, SLR

Semantic Analysis, Syntax directed definitions.

Intermediate Code Generation: Types of Intermediate codes:

Syntax tree, Postfix notation, Three address codes: Triples and
Quadruples.

Compilers: Code Optimization: Need and sources of optimization, Code

6 12
Synthesis phase optimization techniques: Machine Dependent and Machine
Independent.

Code Generation: Issues in the design of code generator, code

generation algorithm. Basic block and flow graph.

Text Books:

1. D. M Dhamdhere: Systems programming, Tata McGraw Hill

2. A. V. Aho, R. Shethi, Monica Lam , J.D. Ulman : Compilers Principles, Techniques and Tools ,
Pearson Education , Second Edition.
3. J. J. Donovan: Systems Programming Tata McGraw Hill Publishing Company

Reference Books:

1. Lex &yacc, 2nd Edition by John R. Levine, Tony Mason & Doug Brown O‘Reilly
2. Compiler construction D,M.Dhamdhere second edition MACMILLAM.
3. Compiler construction : principles and practices , Kenneth C.Louden ,CENGAGE Learning
4. System software : An introduction to system programming , Leland L. Beck, Pearson

Assessment:

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of 6 questions, each carrying 20 marks.

2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 40

Course Code Course Name Credits

CSC603 Data Warehousing and Mining 4

Course objectives:
1. To identify the scope and essentiality of Data Warehousing and Mining.
2. To analyze data, choose relevant models and algorithms for respective applications.
3. To study spatial and web data mining.
4. To develop research interest towards advances in data mining.

Course outcomes: On successful completion of course learner will be able to:

1. Understand Data Warehouse fundamentals, Data Mining Principles
2. Design data warehouse with dimensional modelling and apply OLAP operations.
3. Identify appropriate data mining algorithms to solve real world problems
4. Compare and evaluate different data mining techniques like classification, prediction, clustering
and association rule mining
5. Describe complex data types with respect to spatial and web mining.
6. Benefit the user experiences towards research and innovation.

Prerequisite: Basic database concepts, Concepts of algorithm design and analysis.

Module
Topics Hrs.
No.
Introduction to Data Warehouse and Dimensional modelling: Introduction to
Strategic Information, Need for Strategic Information, Features of Data Warehouse,
Data warehouses versus Data Marts, Top-down versus Bottom-up approach. Data
1.0 warehouse architecture, metadata, E-R modelling versus Dimensional Modelling, 8
Information Package Diagram, STAR schema, STAR schema keys, Snowflake
Schema, Fact Constellation Schema, Factless Fact tables, Update to the dimension
tables, Aggregate fact tables.
ETL Process and OLAP: Major steps in ETL process, Data extraction:
Techniques, Data transformation: Basic tasks, Major transformation types, Data
2.0 Loading: Applying Data, OLTP Vs OLAP, OLAP definition, Dimensional 8
Analysis, Hypercubes, OLAP operations: Drill down, Roll up, Slice, Dice and
Rotation, OLAP models : MOLAP, ROLAP.
Introduction to Data Mining, Data Exploration and Preprocessing: Data
Mining Task Primitives, Architecture, Techniques, KDD process, Issues in Data
Mining, Applications of Data Mining, Data Exploration :Types of Attributes,
Statistical Description of Data, Data Visualization, Data Preprocessing: Cleaning,
3.0 10
Integration, Reduction: Attribute subset selection, Histograms, Clustering and
Sampling, Data Transformation & Data Discretization: Normalization, Binning,
Concept hierarchy generation, Concept Description: Attribute oriented Induction
for Data Characterization.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 41

Classification, Prediction and Clustering: Basic Concepts, Decision Tree using
Information Gain, Induction: Attribute Selection Measures, Tree pruning, Bayesian
Classification: Naive Bayes, Classifier Rule - Based Classification: Using IF-
THEN Rules for classification, Prediction: Simple linear regression, Multiple linear
4.0 12
regression Model Evaluation & Selection: Accuracy and Error measures, Holdout,
Random Sampling, Cross Validation, Bootstrap, Clustering: Distance Measures,
Partitioning Methods (k-Means, k-Medoids), Hierarchical Methods(Agglomerative,
Divisive)
Mining Frequent Patterns and Association Rules: Market Basket Analysis,
Frequent Item sets, Closed Item sets, and Association Rule, Frequent Pattern
Mining, Efficient and Scalable Frequent Item set Mining Methods: Apriori
5.0 8
Algorithm, Association Rule Generation, Improving the Efficiency of Apriori, FP
growth, Mining frequent Itemsets using Vertical Data Format, Introduction to
Mining Multilevel Association Rules and Multidimensional Association Rules
Spatial and Web Mining: Spatial Data, Spatial Vs. Classical Data Mining, Spatial
Data Structures, Mining Spatial Association and Co-location Patterns, Spatial
6.0 6
Clustering Techniques: CLARANS Extension, Web Mining: Web Content Mining,
Web Structure Mining, Web Usage mining, Applications of Web Mining
Total 52

Text Books:
1. PaulrajPonniah, ―Data Warehousing: Fundamentals for IT Professionals‖, Wiley India.
2. Han, Kamber, "Data Mining Concepts and Techniques", Morgan Kaufmann 3rd
edition.
3. ReemaTheraja ―Data warehousing‖, Oxford University Press.
4. M.H. Dunham, "Data Mining Introductory and Advanced Topics", Pearson
Education.

Reference Books:
1. Ian H. Witten, Eibe Frank and Mark A. Hall " Data Mining ", 3rd Edition Morgan kaufmann
publisher.
2. Pang-Ning Tan, Michael Steinbach and Vipin Kumar, Introduction to Data Mining", Person
Publisher.
3. R. Chattamvelli, "Data Mining Methods" 2nd Edition NarosaPublishing House.

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when approx.
40% syllabus is completed and second class test when additional 40% syllabus is completed. Duration of
each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of 6 questions, each carrying 20 marks.
2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 42

Course Code Course Name Credits

CSC604 Cryptography and System Security 4

Course Objectives:
1. To introduce classical encryption techniques and concepts of modular arithmetic and number theory.
2. To explore the working principles and utilities of various cryptographic algorithms including secret
key cryptography, hashes and message digests, and public key algorithms
3. To explore the design issues and working principles of various authentication protocols, PKI
standards and various secure communication standards including Kerberos, IPsec, and SSL/TLS and
email.
4. To develop the ability to use existing cryptographic utilities to build programs for secure
communication.

Course Outcomes: At the end of the course learner will able to

1. Understand system security goals and concepts, classical encryption techniques and acquire
fundamental knowledge on the concepts of modular arithmetic and number theory.
2. Understand, compare and apply different encryption and decryption techniques to solve problems
related to confidentiality and authentication
3. Apply the knowledge of cryptographic checksums and evaluate the performance of different message
digest algorithms for verifying the integrity of varying message sizes.
4. Apply different digital signature algorithms to achieve authentication and design secure applications
5. Understand network security basics, analyze different attacks on networks and evaluate the
performance of firewalls and security protocols like SSL, IPSec, and PGP.
6. Analyze and apply system security concept to recognize malicious code.

Detailed Syllabus:

Module Detailed Content

Unit No Hrs
No
Introduction & Number Theory 10
Security Goals, Services, Mechanisms and attacks, The OSI security
architecture, Network security model, Classical Encryption
techniques, Symmetric cipher model, mono-alphabetic and poly-
1.1
alphabetic substitution techniques: Vigenere cipher, playfair cipher,
1
Hill cipher, transposition techniques: keyed and keyless transposition
ciphers, steganography.

Modular Arithmetic and Number Theory:- Euclid‘s algorithm-–Prime

1.2 numbers-Fermat‘s and Euler‘s theorem- Testing for primality -The
Chinese remainder theorem, Discrete logarithms.

2 Symmetric and Asymmetric key Cryptography and key Management 12

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 43

Block cipher principles, block cipher modes of operation, DES,
2.1 Double DES, Triple DES, Advanced Encryption Standard (AES),
Stream Ciphers: RC5 algorithm.

Public key cryptography: Principles of public key cryptosystems-The

2.2
RSA algorithm, The knapsack algorithm, ElGamal Algorithm.

Key management techniques: using symmetric and asymmetric

2.3 algorithms and trusted third party. Diffie Hellman Key exchange
algorithm.

Hashes, Message Digests and Digital Certificates 06

Cryptographic hash functions, Properties of secure hash function,
3.1
3 MD5, SHA-1, MAC, HMAC, CMAC.

3.2 Digital Certificate: X.509, PKI

Authentication Protocols & Digital signature schemes 08
User Authentication and Entity Authentication, One-way and mutual
4.1 authentication schemes, Needham Schroeder Authentication
4 protocol, Kerberos Authentication protocol.

Digital Signature Schemes – RSA, EIGamal and Schnorr signature

4.2
schemes.

Network Security and Applications 10

Network security basics: TCP/IP vulnerabilities (Layer wise), Packet
5.1 Sniffing, ARP spoofing, port scanning, IP spoofing, TCP syn flood,
DNS Spoofing.

Denial of Service: Classic DOS attacks, Source Address spoofing,

5
5.2 ICMP flood, SYN flood, UDP flood, Distributed Denial of Service,
Defenses against Denial of Service Attacks.

5.3 Internet Security Protocols: SSL, IPSEC, Secure Email: PGP,

Firewalls, IDS and types, Honey pots
System Security 06
Software Vulnerabilities: Buffer Overflow, Format string, cross-site
6 6.1 scripting, SQL injection, Malware: Viruses, Worms, Trojans, Logic
Bomb, Bots, Rootkits.

Text Books:
1. William Stallings, Cryptography and Network Security, Principles and Practice, 6th Edition, Pearson
Education, March 2013
2. Behrouz A. Ferouzan, ―Cryptography & Network Security‖, Tata Mc Graw Hill
3. Bernard Menezes, ―Cryptography & Network Security‖, Cengage Learning.
4. Network Security Bible, Eric Cole, Second Edition, Wiley.
University of Mumbai, B. E. (Computer Engineering), Rev. 2016 44
Reference Books:
1. Applied Cryptography, Protocols Algorithms and Source Code in C, Bruce Schneier, Wiley.
2. Cryptography and Network Security, Atul Kahate, Tata Mc Graw Hill.

Assessment:

Internal Assessment:

Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is completed.
Duration of each test shall be one hour.

Theory Examination:

1. Question paper will comprise of total six questions.

2. All question carry equal marks
3. Questions will be mixed in nature (for example supposed Q.2 has part (a) from module 3 then part
(b) will be from any module other than module 3)
4. Only Four question need to be solved.

In question paper weightage of each module will be proportional to number of respective lecture hours
as mentioned in the syllabus.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 45

Course Code Course Name Credits

CSDLO6021 Machine Learning 04

Course Objectives:
1 To introduce students to the basic concepts and techniques of Machine Learning.

2 To become familiar with regression methods, classification methods, clustering methods.

3 To become familiar with Dimensionality reduction Techniques.

Course Outcomes: Students will be able to-

1. Gain knowledge about basic concepts of Machine Learning

2. Identify machine learning techniques suitable for a given problem
3. Solve the problems using various machine learning techniques
4. Apply Dimensionality reduction techniques.
5. Design application using machine learning techniques

Pre-requisites: Data Structures, Basic Probability and Statistics, Algorithms

Module Unit
Topics Hrs.
No. No.
Introduction to Machine Learning
Machine Learning, Types of Machine Learning, Issues in Machine
1 6
Learning, Application of Machine Learning, Steps in developing a
Machine Learning Application.
Introduction to Neural Network
Introduction – Fundamental concept – Evolution of Neural Networks –
2
Biological Neuron, Artificial Neural Networks, NN architecture, 8
Activation functions, McCulloch-Pitts Model.
Introduction to Optimization Techniques:
6
Derivative based optimization- Steepest Descent, Newton method.
3
Derivative free optimization- Random Search, Down Hill Simplex

Learning with Regression and trees:

Learning with Regression : Linear Regression, Logistic Regression.
4 Learning with Trees: Decision Trees, Constructing Decision Trees using 10
Gini Index, Classification and Regression Trees (CART).

Learning with Classification and clustering:

Classification: Rule based classification, classification by Bayesian Belief

networks, Hidden Markov Models.
5 5.1 Support Vector Machine: Maximum Margin Linear Separators, Quadratic 14
Programming solution to finding maximum margin separators, Kernels for
learning non-linear functions.
5.2 Clustering: Expectation Maximization Algorithm, Supervised learning

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 46

after clustering, Radial Basis functions.

Dimensionality Reduction:
6 Dimensionality Reduction Techniques, Principal Component Analysis, 8
Independent Component Analysis, Single value decomposition
Total 52

Text Books:
1. Peter Harrington ―Machine Learning In Action‖, DreamTech Press
2. Ethem Alpaydın, ―Introduction to Machine Learning‖, MIT Press
3. Tom M.Mitchell ―Machine Learning‖ McGraw Hill
4. Stephen Marsland, ―Machine Learning An Algorithmic Perspective‖ CRC Press
5. J.-S.R.Jang "Neuro-Fuzzy and Soft Computing" PHI 2003.
6. Samir Roy and Chakraborty, ―Introduction to soft computing‖, Pearson Edition.
7. Kevin P. Murphy , Machine Learning ― A Probabilistic Perspective‖

Reference Books:
1. Han Kamber, ―Data Mining Concepts and Techniques‖, Morgann Kaufmann Publishers
2. Margaret.H.Dunham, ―Data Mining Introductory and Advanced Topics‖, Pearson Education

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when approx.
40% syllabus is completed and second class test when additional 40% syllabus is completed. Duration of
each test shall be one hour.

End Semester Theory Examination:

 Question paper will comprise of 6 questions, each carrying 20 marks.
 The students need to solve total 4 questions.
 Question No.1 will be compulsory and based on entire syllabus.
 Remaining question (Q.2 to Q.6) will be selected from all the modules.

Suggested Experiment work :

1. To implement Linear Regression.
2. To implement Logistic Regression.
3. To implement SVM.
4. To implement PCA.
5. To implement Steepest Descent
6. To implement Random search
7. To implement Naïve Baysian algorithm.
8. To implement Single layer Perceptron Learning algorithm
9. To implement Radialbasis functions.
10. Case study based on any ML technique

** Laboratory work based on above syllabus is incorporate as mini project in CSM605: Mini-Project.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 47

Course Code Course Name Credits

Advanced Database Management System 4

CSDLO6022

Course objectives:
1. To provide overview of indexing and hashing techniques
2. To impart knowledge of query processing and optimization
3. To provide an overview of distributed database systems.
4. To introduce the concept of document oriented database.
5. To create awareness about potential security threats to a database and mechanisms to handle
it.
6. Understand the usage of advanced data models for real life application.

Course outcomes: On successful completion of course learner will be able to:

1. Build indexing mechanisms for efficient retrieval of information from databases.
2. Measure query cost and optimize query execution
3. Design distributed database for better resource management
4. Demonstrate the understanding of the concepts of document oriented databases.
5. Apply appropriate security techniques database systems.
6. Implement advanced data models for real life applications.

Prerequisite: Basic knowledge of Database management System.

Module Unit Topics Hrs.

No. No.

1.0 Indexing and Hashing Techniques 8

1.1 Indexing and Hashing:

● Operation on Files
● Hashing Techniques; Static and dynamic
● Types of Single-Level Ordered Indexes; Multilevel
Indexes; Dynamic Multilevel Indexes Using B-Trees
and B+-Trees; Indexes on Multiple Keys,

2.0 Query processing and Optimization 12

Query Processing :
● Overview
● Measures of Query cost
● Selection operation
● Sorting
● Join Operations, and other Operations
Evaluation of Expression
Query Optimization :
● Translations of SQL Queries into relational algebra
● Heuristic approach & cost based optimization

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 48

3.0 Distributed Databases 12

3.1 ● Types of Distributed Database Systems; Distributed

Database Architectures; Data Fragmentation,
Replication and Allocation Techniques for
Distributed Database Design

3.2 ● Distributed Query Processing (Semi join)

● distributed Transaction Management in Distributed
Databases
● distributed Concurrency Control (locking) , Recovery
in Distributed Databases {2PC/3PC) and deadlock
management.

4 Document oriented database

8
● Need of object oriented database.
● Impedance matching problem between OO languages
and Relational database, Case study db4O
● Need of Document Oriented database, difference
between Document Oriented Database and
Traditional database. Types of encoding XML, JSON,
BSON, Representation XML, Json Objects. Case
study on doc oriented based such a Mariadb

5 Advanced data models 6

5.1  Temporal data models :- Aspects of valid time , Bi-

temporal time and bi-temporal time with examples of
each.
 Spatial model :- Types of spatial data models -
Raster, Vector and Image
 Mobile databases

5.2
 Multimedia databases

6 Data Security 6

6.1 ● Introduction to Database Security Issues;

authorization , Discretionary Access Control Based
on Granting and Revoking Privileges
● Mandatory Access Control and Role-Based

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 49

6.2 Access Control for Multilevel Security
● SQL Injection
● Introduction to Statistical Database Security
Introduction to Flow Control

Total 52

Text Books:
1. Elmasri&Navathe― fundamentals of Database Systems‖ IV edition. PEARSON Education.
2. Korth, Silberschatzsudarshan ―Database systems, concepts‖ 5th edition McGraw Hill
3. Raghu Ramkrishnan& Johannes Gehrke ―Database Management System‖ Tata McGraw Hill. III
edition.
4. Ruosell J.T. Dyer, Learning MySQL and Mariadb.

Reference Books:
1. Chhanda Ray , ―Distributed Database System‖, Pearson Education India.
2. Hector Garcia-Molina, Jeffery D. Ullman, Jennifer Widom , ― Database system Implementation‖
3. Thomas M.Connolly Carolyn Begg, Database Systems : A practical Approach to Design ,
Implementation and Management, 4/e.

Suggested mini. Project / Experiment work:

1. Given problem statement 2/3 student to perform-
a. Design EER model and perform sorting, join operations for the specified problem
statement.
b. Perform the various fragmentation (Horizontal, Vertical, Derived) and check its
correctness criteria.
c. Perform two phase commit protocol (2PC)
2. Mini Project / Case study on document oriented database such a Mariadb
3. Mini Project Case study Development of an application based on any one advance data model
(temporal, Spatial Multimedia )

** Perform Laboratory (Experiments) work in the in CSM605:Mini-Project

Assessment:

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

1 Question paper will comprise of 6 questions, each carrying 20 marks.
2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 50

Course Code Course Name Credits
4
CSDLO6023 Enterprise Resource Planning(ERP)

Course Objectives:
1. To understand the technical aspects and life cycle of ERP systems.
2. To understand the steps and activities in ERP.
3. To identify and describe different types of ERP system.
4. To understand tools and methodology used for designing ERP for an Enterprise.

Course Outcomes: After completion of this course, students will be able ..

1. To understand the basic structure of ERP.
2. To identify implementation strategy used for ERP.
3. To apply design principles for various business modules in ERP.
4. To apply different emerging technologies for implementation of ERP.
5. To analyze security issues in ERP.
6. To acquire ERP concepts for real world applications.

Pre-requisites: Web Engineering, Computer Network, Database Systems

Module Unit Topics

Hrs.
No. No.

Introduction to Enterprise Resource Planning (ERP )

1.0 Information System and Its Components, Value Chain Framework,
8
Organizational Functional Units, Evolution of ERP Systems, Role of
ERP in Organization, Three-Tier Architecture of ERP system.

ERP and Implementation

2.0
ERP implementation and strategy, Implementation Life cycle, Pre-
8
implementation task, requirement definition, implementation
Methodology.

ERP Business Modules

3.0 Finance, manufacturing, human resources, quality management,

3.1
material management, marketing, Sales distribution and service. 8
Case study on Supply Chain management (SCM), Customer
3.2
relationship Management (CRM)
Introduction to ERP related Technologies
Business Process Re-engineering (BPR) ,Data warehousing ,Data
4.0 4.1 Mining, On- line Analytical Processing(OLAP), Product Life Cycle 10
Management (PLM)
4.2 Geographical Information Management ,RFID, QR Code ,Bar

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 51

Coding, E-commerce and their application in Enterprise planning
Extended ERP and security issues
5.1 Enterprise application Integration (EAI), open source ERP, cloud ERP
5.0 Managing ERP Securities: Types of ERP security Issues, System 8
5.2 Access security, Data Security and related technology for managing
data security
Cases of ERP for Enterprises.
Cases of ERP like MySAP for Business suite implementation at ITC,
6.0 6.1 ERP for Nestle GLOBE Project, Oracle ERP Implementation at 10
Maruti Suzuki.
6.2 Need of ERP for Small and Medium size enterprises.(Zaveri)
Total 52

Text Books:

1. Alexis Leon, ERP Demystified: II Edition, Tata McGraw Hill.

2. Rajesh Ray, Enterprise Resource Planning, Text and cases, Tata McGraw Hill.
3. Sandeep Desai, Abhishek Srivastava, ERP to E2 ERP: A Case study approach, PHI.
4. Jyotindra Zaveri, Enterprise Resource Planning, Himalaya Publishing House, 2012.

Reference Books:

1. V.K. Garg & N.K. Venkatakrishnan, Enterprise Resource Planning: concepts & practices, by ; PHI.
2. Supply Chain Management Theories & Practices: R. P. Mohanty, S. G. Deshmukh, - Dreamtech
Press.
3. Enterprise wide resource planning: Theory & practice: by Rahul Altekar, PHI
4. Customer Relationship Management, Concepts and cases, Second Edition.

Mini Project / Laboratory Work:

1. Give case study 2/3 student of any organization. Make a report before-after situation at organization
(Domain).
2. Make a list of Resource of the Selected Domain.
3. Categorized the Resource as per the function level process and Identify module of the domain.
4. Explain process of each module of the domain.
5. Perform Business process re-engineering (BPR) on selected Module.
6. Implement new system based on BPR.
7. Perform Impact analysis of the new system as the BPR.
a. Prepare study on JD Edward Tool.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 52

b. Prepare study on Microsoft Dynamics.
8. Download any open source ERP Tool and prepare Installation Guideline and information about the
Tool.
9. Make Data Entry in the Software in all modules & generate report.

** Perform Laboratory (Experiments) work in the in CSM605:Mini-Project.

Assessment:

Internal Assessment:

Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

1 Question paper will comprise of 6 questions, each carrying 20 marks.

 The students need to solve total 4 questions.

 Question No.1 will be compulsory and based on entire syllabus.

 Remaining question (Q.2 to Q.6) will be selected from all the modules.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 53

Course Code Course Name Credits

CSDLO6024 Advanced Computer Network 4

Course Objective:
1. To make learners aware about advances in computer networking technologies.
2. To give overview of advance internet, QoS based and management protocols.
3. To introduce issues related to traffic engineering and capacity planning.

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

1. Demonstrate the understanding of advance data communication technologies.
2. Demonstrate the understanding of WAN Technology typically ATM .
3. Demonstrate the understanding of packet switching protocols such as X.25, X.75.
4. Explore the issues of advance internet routing protocols and also QoS based protocols.
5. Analyze issues of traffic requirements and perform capacity planning.
6. Demonstrate the understanding of protocol used for management of network.

Prerequisite: Computer Networks, ISO OSI Layered Protocols, TCP/IP protocol suite.

Module Unit
Topics Hrs.
No. No.
Data Communications: 06

1.1 Defining Data Communication needs, Transmission Hierarchy

1 Optical Networks: SONET/SDH standard, Architecture, Format, Hardware,

1.2
Configuration, advantages

WAN Technology: 10

2.1 Introducing ATM Technology, Need and Benefit, Concept, Faces of ATM

Why ATM, BISDN Reference Model, ATM Layer, ATM Adaptation Layer,
2.2
2 ATM Signaling

Protocols and Interfaces: 10

3.1 Introduction to TCP/IP: Issues in IPV4, IPV6 protocol

3
Mature Packet Switching Protocols:
3.2 ITU Recommendation X.25, User Connectivity, Theory of Operations,
Network Layer Functions, X.75 Internetworking Protocol, Advantages and
Drawbacks

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 54

Advance Routing Protocols: 14

4.1 Internet Routing Protocols : OSPF, RIP, BGP

Multicast Routing: Reverse Path Broadcasting, Internet Group Management

Protocol, Reverse Path Multicasting, Discrete Vector Multicasting protocol

IP forwarding Architectures
4.2
Overlay Model: Classical IP over ATM and LANE
4
Multiprotocol Label Switching MPLS :
4.3 Fundamentals of Labels, Label Stack, VC Merging, Label Distribution
Protocol, Explicit routing for Traffic Engineering

4.4 Integrated services, RSVP, Differentiated Services

4.5 MultiMedia Over Internet: RTP, Session Control Protocol H.323

Traffic Engineering : 08

Requirement Definition: User requirement Traffic Sizing , Traffic

5.1
Characteristics, Protocols, Time and Delay Considerations
5
Traffic Engineering and Capacity planning:Throughput calculation,
Traffic Engineering basics, Traditional traffic Engineering and Queued data
5.2
and Packet Switched packet modeling, Queuing Disciplines (M/M/1), Design
parameters for Peak: delay or latency, availability and reliability.

Network management 04
6 Network Management : SNMP Concept and format, Management
6.1
Components: SMI, MIB

Text Books:
1. M. A. Gallo and W. M. Hancock, Computer Communications and Networking Technologies,
Cengage Learning, (1e).
2. Leon-Garcia, Communication Networks, Tata McGraw-Hill.
3. Darren L. Spohn, Data Network Design, Tata McGraw-Hill.
4. BehrouzForouzan, TCP/IP Protocol Suite ,McGraw-Hill, (5e).
5. William Stallings, High-Speed Networks and Internets, Pearson Education, (2e).

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 55

Reference Books:

1. Andrew Tanenbaum― Computer Networks‖, Prentice Hall, (5e).

2. Cisco Certified Network Analyst study guide, Wiley Publishing House.(7e).
3. Douglas E. Comer, Internetworking with TCP/IP Volume One, (6e).
4. James F. Kurose, Keith W. Ross, ―Computer Networking, A Top-Down Approach Featuring the
Internet‖,Addison Wesley, (5e).

Assessment:

Internal Assessment:

Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of 6 questions, each carrying 20 marks.

2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 56

Lab Code Lab Name Credits
CSL601 Software Engineering Lab 1

Lab Outcome:
On successful completion of laboratory sessions, learners will be able to
1. Identify requirements and apply process model to selected case study.
2. Analyze and design models for the selected case study using UML modeling.
3. Use various software engineering tools.

Description:
The Software Engineering Lab has been developed by keeping in mind the following objectives:
 Select case studies to solve real life problems by applying software engineering principles.
 To impart state-of-the-art knowledge on Software Engineering and UML.

List of Experiments:

Laboratory work will be based on course syllabus with minimum 10 experiments to be incorporated.
Assign case study to a group of two/three students and each group to perform the following experiments on
their case study.
Sr. No. Title of Experiments

1 Prepare detailed statement of problem for the selected / allotted mini project and identify
suitable process model for the same with justification.

2 Develop Software Requirement Specification (SRS) document in IEEE format for the
project.

3 Use project management tool to prepare schedule for the project.

4 Prepare RMMM plan for the project.

5 Identify scenarios & develop UML Use case and Class Diagram for the project.

6 Draw DFD (upto 2 levels) and prepare Data Dictionary for the project.

7 Develop Activity / State Transition diagram for the project.

8 Develop Sequence and Collaboration diagram for the project.

9 Change specification and make different versions using any SCM Tool.

10 Develop test cases for the project using white box testing.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 57

Digital Material:

Practical can be conducted using any open source software tools like Dia, Star UML, etc.

Term Work:

Term work (25 Marks) shall consist of

 Laboratory work ….. 15 marks

 Two assignments … 05 marks
 Attendance (theory and practical) ….. 05 marks

Oral exam will be based on CSC601 and CSL601 syllabus.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 58

Lab Code Lab Name Credits

CSL602 System Software Lab 1

Outcome: At the end of the course learner will be able to

1. Generate machine code by using various databases generated in pass one of two pass assembler.
2. Construct different databases of single pass macro processor.
3. Identify and validate different tokens for given high level language code.
4. Parse the given input string by constructing Top down /Bottom up parser.
5. Implement synthesis phase of compiler with code optimization techniques.
6. Explore various tools like LEX and YACC.

Description: The current System Software is highly complex with huge built in functionality offered to the
programmer to develop complex applications with ease. This laboratory course aims to make a student
understand-
 The need for modular design
 The need for well-defined data structures and their storage management
 The increase in the complexity of translators as we move from assembly level to high level
programming
 The need to produce an efficient machine code that is optimized for both execution speed and
memory requirement
 The efficient programming constructs that make them a good coder

Suggested List of Experiments:

Sr. No. Title of Experiments

1 Implementations of two pass Assembler.

2 Implementation of single pass Macro Processor.

4 Implementation of Lexical Analyzer.

5 Implementation of Parser (Any one).

6 Implementation of Intermediate code generation phase of compiler.

7 Implementation of code generation phase of compiler.

8 Study and implement experiments on LEX. YACC, Grey Box Probing.

Reference Books:

1. Modern Compiler. Implementation in Java, Second. Edition. Andrew W. Appel Princeton

University. Jens Palsberg Purdue University. CAMBRIDGE.
2. Crafting a compiler with C, Charles N. Fischer, Ron K. Cytron, Richard J. LeBlanc .

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 59

Term Work:

Laboratory work will be based on above syllabus with minimum 10 experiments to be incorporated.

The distribution of marks for term work shall be as follows:

 Laboratory work (experiments/case studies): ……………………………..(15) Marks.
 Assignment: ...………..…………………………………………………... (05) Marks.
 Attendance ………..……………………………………………………… (05) Marks
TOTAL: ………………………………………………………………….. (25) Marks.

Oral & Practical exam will be based on the above and CSC602 syllabus.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 60

Lab Code Lab Name Credits
CSL603 Data Warehousing and Mining Lab 1

Lab Outcome:

1. Design data warehouse and perform various OLAP operations.

2. Implement classification, prediction, clustering and association rule mining algorithms.
3. Demonstrate classifications, prediction, clustering and association rule mining algorithms on a given
set of data sample using data mining tools.
4. Implement spatial and web mining algorithms.

Description:
An operational database undergoes frequent changes on a daily basis on account of the transactions that take
place. A data warehouses provides us generalized and consolidated data in multidimensional view. Data
mining functions such as classification, prediction, clustering, and association rule mining can be integrated
with OLAP operations to enhance the interactive mining of knowledge at multiple level of abstraction. Data
mining supports knowledge discovery by finding hidden patterns and associations, constructing analytical
models, performing classification and prediction, these mining results can be demonstrated using the data
mining tools.

Suggested List of Experiments:

Sr. No. Title of Experiments

1 Build Data Warehouse/Data Mart for a given problem statement

i) Identifying the source tables and populating sample data
ii) Design dimensional data model i.e. Star schema, Snowflake schema and Fact
Constellation schema (if applicable)

2 To perform various OLAP operations such as slice, dice, drilldown, rollup, pivot

3 Implementation of Classification algorithm( Decision Tree/ Bayesian)

4 Implementation of Linear Regression.

5 Implementation of Clustering algorithm( K-means/ Agglomerative).

6 Implementation of Association Rule Mining algorithm(Apriori).

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 61

7 Perform data Pre-processing task and Demonstrate performing Classification,
Clustering, Association algorithm on data sets using data mining tool (WEKA,R
tool, XL Miner, etc.)

8 Implementation of page rank algorithm.

9 Implementation of HITS algorithm.

10 Implementation of Spatial Clustering Algorithm- CLARANS Extensions

Term Work:

Laboratory work will be based on above syllabus with minimum 08 experiments to be incorporated.

Experiments ---------------------------------------------------------------------- (15) Marks

Assignment----------------------------------------------------------------------- (05) Marks
Attendance (Theory + Practical) ----------------------------------------------- (05) Marks
Total ------------------------------------------------------------------------------- (25) Marks

Oral & Practical exam will be based on the above and CSC603:―Data Warehousing and Mining‖ syllabus.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 62

Lab Code Lab Name Credit

CSL604 System Security Lab 01

Lab Outcome:
Learner will able to
1. To be able to apply the knowledge of symmetric cryptography to implement simple ciphers.
2. To be able to analyze and implement public key algorithms like RSA and El Gamal.
3. To analyze and evaluate performance of hashing algorithms.
4. To explore the different network reconnaissance tools to gather information about networks.
5. To explore and use tools like sniffers, port scanners and other related tools for analysing packets in a
network.
6. To be able to set up firewalls and intrusion detection systems using open source technologies and to
explore email security.
7. To be able to explore various attacks like buffer-overflow, and web-application attacks.

Suggested Experiment List: (Any 10)

Sr. No Description
Design and Implementation of a product cipher using Substitution and Transposition
1
ciphers
Implementation and analysis of RSA cryptosystem and Digital signature scheme using
2
RSA/El Gamal.
3 Implementation of Diffie Hellman Key exchange algorithm
For varying message sizes, test integrity of message using MD-5, SHA-1, and analyse
4 the performance of the two protocols. Use crypt APIs

Study the use of network reconnaissance tools like WHOIS, dig, traceroute, nslookup
5
to gather information about networks and domain registrars.
Study of packet sniffer tools : wireshark, :
1. Download and install wireshark and capture icmp, tcp, and http packets in
6
promiscuous mode.
2. Explore how the packets can be traced based on different filters.
Download and install nmap. Use it with different options to scan open ports, perform
7
OS fingerprinting, do a ping scan, tcp port scan, udp port scan, xmas scan etc.
Detect ARP spoofing using nmap and/or open source tool ARPWATCH and
8
wireshark. Use arping tool to generate gratuitous arps and monitor using wireshark
9 Simulate DOS attack using Hping, hping3 and other tools.
10 Simulate buffer overflow attack using Ollydbg, Splint, Cppcheck etc
University of Mumbai, B. E. (Computer Engineering), Rev. 2016 63
a. Set up IPSEC under LINUX.
11
b. Set up Snort and study the logs.
12 Setting up personal Firewall using iptables
13 Explore the GPG tool of linux to implement email security
14 SQL injection attack, Cross-Cite Scripting attack simulation

Reference Books:
1. Build your own Security Lab, Michael Gregg, Wiley India
2. CCNA Security, Study Guide, TIm Boyles, Sybex.
3. Network Security Bible, Eric Cole, Wiley India.
4. Web Application Hacker‘s Handbook, Dafydd Stuttard, Marcus Pinto, Wiley India.

Term Work:
Laboratory work will be based on above syllabus with minimum 10 experiments to be incorporated.

Experiments ---------------------------------------------------------------------- (15) Marks

Assignment----------------------------------------------------------------------- (05) Marks
Attendance (Theory + Practical) ----------------------------------------------- (05) Marks
Total ------------------------------------------------------------------------------- (25) Marks

Oral & practical examination will be based on the above and Cryptography and System Security (CSC604)
syllabus.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 64

Lab Code Lab Name Credit
CSM605 Mini-Project 2

Lab Outcome: After successful completion of this Lab student will be able to
1. Acquire practical knowledge within the chosen area of technology for project development.
2. Identify, analyze, formulate and handle programming projects with a comprehensive and systematic
approach
3. Contribute as an individual or in a team in development of technical projects
4. Develop effective communication skills for presentation of project related activities

Description:
Mini project may be carried out in one or more form of following:
Product preparations, prototype development model, fabrication of set-ups, laboratory experiment
development, process modification/development, simulation, software development, integration of
software and hardware, statistical data analysis, creating awareness in society, etc.

Guidelines:
 A project to be developed based on one or more of the following fields-
Advance Database Management System, Enterprise Resource Planning, Advance Operating System,
Advance Computer Network, etc.
 Mini project may be carried out a group of 2 /3 students. The student is required to submit a report based
on the work. The evaluation of the project shall be on continuous basis.

Term Work (TW):

Distribution of marks for term work shall be as follows:
1. Attendance 05 Marks
2. Mini project work 10 Marks
3. Project Report (Spiral Bound) 10 Marks

The final certification and acceptance of TW ensures the satisfactory performance on the above three aspects.

Oral & Practical Examination should be conducted by internal and external examiners appointed by
University of Mumbai. Students have to give presentation and demonstration on the Mini-Project.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 65

Course Code Course Name Credits
CSC701 Digital Signal & Image Processing 4

Course objectives:
1. To understand the fundamental concepts of digital signal processing and Image processing.
2. To explore DFT for 1-D and 2-D signal and FFT for 1-D signal
3. To apply processing techniques on 1-D and Image signals.
4. To apply digital image processing techniques for edge detection.

Course outcomes: On successful completion of the course learner will be able to:
1. Apply the concept of DT Signal and DT Systems.
2. Classify and analyze discrete time signals and systems
3. Implement Digital Signal Transform techniques DFT and FFT.
4. Use the enhancement techniques for digital Image Processing
5. Differentiate between the advantages and disadvantages of different edge detection techniques
6. Develop small projects of 1-D and 2-D Digital Signal Processing.

Prerequisite: Applied Mathematics

Module Unit Topic details Hrs.

No. No.
1.0 Discrete-Time Signal and Discrete-Time System 14
1.1 Introduction to Digital Signal Processing, Sampling and
Reconstruction, Standard DT Signals, Concept of Digital Frequency,
Representation of DT signal using Standard DT Signals, Signal
Manipulations(shifting, reversal, scaling, addition, multiplication).
1.2 Classification of Discrete-Time Signals, Classification of Discrete-
Systems
1.3 Linear Convolution formulation for 1-D and 2-D signal (without
mathematical proof), Circular Convolution (without mathematical
proof), Linear convolution using Circular Convolution. Auto and
Cross Correlation formula evaluation, LTI system, Concept of
Impulse Response and Step Response, Output of DT system using
Time Domain Linear Convolution.
2.0 Discrete Fourier Transform 08
2.1 Introduction to DTFT, DFT, Relation between DFT and DTFT, IDFT
2.2 Properties of DFT without mathematical proof (Scaling and
Linearity, Periodicity, Time Shift and Frequency Shift, Time
Reversal, Convolution Property and Parsevals‘ Energy Theorem).
DFT computation using DFT properties.
2.3 Transfer function of DT System in frequency domain using DFT.
Linear and Circular Convolution using DFT, Convolution of long
sequences, Introduction to 2-D DFT
3.0 Fast Fourier Transform 06
3.1 Need of FFT, Radix-2 DIT-FFT algorithm,

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 66

Module Unit Topic details Hrs.
No. No.
3.2 DIT-FFT Flow graph for N=4 and 8, Inverse FFT algorithm.
3.3 Spectral Analysis using FFT
4.0 Digital Image Fundamentals 08
4.1 Introduction to Digital Image, Digital Image Processing System,
Sampling and Quantization
4.2 Representation of Digital Image, Connectivity
4.3 Image File Formats: BMP, TIFF and JPEG.
5.0 Image Enhancement in Spatial domain 10
5.1 Gray Level Transformations, Zero Memory Point Operations,
5.2 Histogram Processing, Histogram equalization.
5.3 NeighborhoodProcessing, Spatial Filtering, Smoothing and
Sharpening Filters, Median Filter.
6.0 Image Segmentation 06
6.1 Segmentation based on Discontinuities (point, Line, Edge),
6.2 Image Edge detection using Robert, Sobel, Previtt masks, Image
Edge detection using Laplacian Mask.
Total 52

Text Books:

1. John G. Proakis, Dimitris and G.Manolakis, ‗Digital Signal Processing: Principles, Algorithms, and
Applications‘ 4th Edition 2007, Pearson Education.
2. A. Anand Kumar, ‗Digital Signal Processing‘, PHI Learning Pvt. Ltd. 2013.
3. Rafel C. Gonzalez and Richard E. Woods, ‗Digital Image Processing‘, Pearson Education Asia, 3 rd
Edition, 2009,
4. S. Sridhar, ‗Digital Image Processing‘, Oxford University Press, Second Edition, 2012.

Reference Books:

1. Sanjit Mitra, ‗Digital Signal Processing: A Computer Based Approach‘, TataMcGraw Hill, 3rd Edition.
2. S. Salivahanan, A. Vallavaraj, and C. Gnanapriya, ‗Digital Signal Processing‘ Tata McGraw Hill
Publication 1st Edition (2010).
3. S. Jayaraman, E. Esakkirajan and T. Veerkumar, ‗Digital Image Processing‘ TataMcGraw Hill
Education Private Ltd, 2009.
4. Anil K. Jain, ‗Fundamentals and Digital Image Processing‘, Prentice Hall of India Private Ltd, 3rd
Edition.

Assessment:

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when approx.
40% syllabus is completed and second class test when additional 50% syllabus is completed. Duration of
each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of 6 questions, each carrying 20 marks.
2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.
University of Mumbai, B. E. (Computer Engineering), Rev. 2016 67
Course Code Course Name Credits

CSC702 Mobile Communication & Computing 4

Course objectives:
1. To introduce the basic concepts and principles in mobile computing. This includes major techniques
involved, and networks & systems issues for the design and implementation of mobile computing
systems and applications.
2. To explore both theoretical and practical issues of mobile computing.
3. To provide an opportunity for students to understand the key components and technologies involved
and to gain hands-on experiences in building mobile applications.

Course outcomes: On successful completion of course learner will be able:

1. To identify basic concepts and principles in mobile communication & computing, cellular
architecture.
2. To describe the components and functioning of mobile networking.
3. To classify variety of security techniques in mobile network.
4. To apply the concepts of WLAN for local as well as remote applications.
5. To describe and apply the concepts of mobility management
6. To describe Long Term Evolution (LTE) architecture and its interfaces.

Prerequisite: Computer Networks

Module Unit Topics Hrs

No. No.

1.0 1.1 Introduction to Mobile Computing, Telecommunication 06

Generations, Cellular systems,

1.2 Electromagnetic Spectrum, Antenna ,Signal Propagation,

Signal Characteristics, , Multiplexing, Spread Spectrum:
DSSS & FHSS

2.0 2.1 GSM Mobile services, System Architecture, Radio interface, 10

Protocols , Localization and Calling, Handover, security
(A3,A5 & A8)

2.2 GPRS system and protocol architecture

2.2 UTRAN , UMTS core network ; Improvements on Core

Network,

3.0 3.1 Mobile Networking : Medium Access Protocol, Internet 12

Protocol and Transport layer

3.2 Medium Access Control:

Motivation for specialized MAC, , Introduction to multiple
Access techniques (MACA)

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 68

3.3 Mobile IP: IP Packet Delivery, Agent Advertisement
and Discovery, Registration, Tunneling and
Encapsulation, Reverse Tunneling, Routing (DSDV,DSR)

3.4 Mobile TCP :

Traditional TCP, Classical TCP Improvements like Indirect
TCP, Snooping TCP & Mobile TCP, Fast Retransmit/ Fast
Recovery, Transmission/Timeout Freezing, Selective
Retransmission

4.0 4.1 Wireless Local Area Networks : Introduction, Infrastructure 08

and ad-hoc network

4.2 IEEE 802.11:System architecture , Protocol architecture ,

Physical layer, Medium access control layer, MAC
management, 802.11a, 802.11b

4.3 Wi-Fi security : WEP ,WPA, Wireless LAN Threats ,

Securing Wireless Networks

4.4 HiperLAN 1 & HiperLAN 2

Bluetooth: Introduction, User Scenario, Architecture, protocol

4.5
stack

5.0 5.1 Mobility Management : Introduction, IP Mobility, 06

Optimization, IPv6

5.2 Macro Mobility : MIPv6, FMIPv6,

5.3 Micro Mobility: CellularIP, HAWAII, HMIPv6,

6.0 6.1 Long-Term Evolution (LTE) of 3GPP : LTE System 10

Overview, Evolution from UMTS to LTE

6.2 LTE/SAE Requirements, SAE Architecture

6.3 EPS: Evolved Packet System, E-UTRAN, Voice over LTE

(VoLTE), Introduction to LTE-Advanced,

6.4 System Aspects, LTE Higher Protocol Layers, LTE MAC

layer, LTE PHY Layer,

6.5 Self Organizing Network (SON-LTE),SON for Heterogeneous

Networks (HetNet), Introduction to 5G

Total 52

Assessment:

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is completed.
Duration of each test shall be one hour.
University of Mumbai, B. E. (Computer Engineering), Rev. 2016 69
End Semester Theory Examination:

1. Question paper will comprise of 6 questions, each carrying 20 marks.

2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

Text Books:
1 Jochen Schilller,‖Mobile Communication ―, Addision wisely,Pearson Education
2 ―Wireless Communications & Networks,‖ By William Stallings, Second Edition, Pearson
Education
3 Raj Kamal, Mobile Computing, 2/e , Oxford University Press-New Delhi

Reference Books:

1 LTE Self-Organizing Networks (SON): Network Management Automation for Operational

Efficiency, Seppo Hamalainen, Henning Sanneck , Cinzia Sartori, Wiley publications
2 Christopher Cox, ―An Introduction to LTE: LTE, LTE-Advanced, SAE and 4G Mobile
Communications,‖ Wiley publications
3 Mobility Protocols and Handover Optimization: Design, Evaluation and Application By Ashutosh
Dutta, Henning Schulzrinne, IEEE Press, Wiley Publication
4 Michael Gregg, ―Build your own security lab,‖ Wiley India edition
5 Emerging Wireless Technologies and the Future Mobile Internet, Dipankar Raychaudhuri, Mario
Gerla, Cambridge.
6 Andreas F.Molisch, ―Wireless Communications,‖ Second Edition, Wiley Publications.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 70

Course Code Course Name Credits

CSC703 Artificial Intelligence & Soft Computing 4

Course Objectives (CO):

1 To conceptualize the basic ideas and techniques of AI and SC.
2 To distinguish various search techniques and to make student understand knowledge representation
and planning.
3 To become familiar with basics of Neural Networks and Fuzzy Logic.
4 To familiarize with Hybrid systems and to build expert system.

Course Outcomes: Students should be able to -

1 Identify the various characteristics of Artificial Intelligence and Soft Computing techniques.
2 Choose an appropriate problem solving method for an agent to find a sequence of actions to reach the
goal state.
3 Analyse the strength and weakness of AI approaches to knowledge representation, reasoning and
planning.
4 Construct supervised and unsupervised ANN for real world applications.
5 Design fuzzy controller system.
6 Apply Hybrid approach for expert system design.

Pre-requisites: Basic Mathematics, Algorithms

Module Unit Topics Hrs.

No. No.
1.0 Introduction to Artificial Intelligence(AI) and Soft Computing 4
1.1 Introduction and Definition of Artificial Intelligence.
1.2 Intelligent Agents : Agents and Environments ,Rationality, Nature of
Environment, Structure of Agent, types of Agent
1.3 Soft Computing: Introduction of soft computing, soft computing vs. hard
computing, various types of soft computing techniques.
2.0 Problem Solving 10
2.1 Problem Solving Agent, Formulating Problems, Example Problems
2.2 Uninformed Search Methods: Depth Limited Search, Depth First Iterative
Deepening (DFID), Informed Search Method: A* Search
2.3 Optimization Problems: Hill climbing Search, Simulated annealing, Genetic
algorithm
3.0 Knowledge, Reasoning and Planning 10
3.1 Knowledge based agents
3.2 First order logic: syntax and Semantic, Knowledge Engineering in FOL
Inference in FOL : Unification, Forward Chaining, Backward Chaining and
Resolution
3.3 Planning Agent, Types of Planning: Partial Order, Hierarchical Order,
Conditional Order
4.0 Fuzzy Logic 12

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 71

4.1 Introduction to Fuzzy Set: Fuzzy set theory, Fuzzy set versus crisp set, Crisp
relation & fuzzy relations, membership functions,
4.2 Fuzzy Logic: Fuzzy Logic basics, Fuzzy Rules and Fuzzy Reasoning
4.3 Fuzzy inference systems: Fuzzification of input variables, defuzzification and
fuzzy controllers.
5.0 Artificial Neural Network 12
5.1 Introduction – Fundamental concept– Basic Models of Artificial Neural
Networks – Important Terminologies of ANNs – McCulloch-Pitts Neuron
5.2 Neural Network Architecture: Perceptron, Single layer Feed Forward ANN,
Multilayer Feed Forward ANN, Activation functions, Supervised Learning:
Delta learning rule, Back Propagation algorithm.
5.3 Un-Supervised Learning algorithm: Self Organizing Maps
6. Expert System 4
6.1 Hybrid Approach - Fuzzy Neural Systems
6.2 Expert system : Introduction, Characteristics, Architecture, Stages in the
development of expert system,
Total 52

Text Books:
1. Stuart J. Russell and Peter Norvig, "Artificial Intelligence A Modern Approach ―Second Edition"
Pearson Education.
2. Samir Roy and Chakraborty, ―Introduction to soft computing‖, Pearson Edition.
3. S.N.Sivanandam, S.N.Deepa "Principles of Soft Computing" Second Edition, Wiley Publication.
4. S.Rajasekaran and G.A.VijayalakshmiPai "Neural Networks, Fuzzy Logic and Genetic Algorithms"
PHI Learning.
5. N.P.Padhy, ―Artificial Intelligence and Intelligent Systems‖, Oxford University Press.

Reference Books:
1. Elaine Rich and Kevin Knight ―Artificial Intelligence‖ Third Edition, Tata McGraw-Hill Education
Pvt. Ltd., 2008.
2. Satish Kumar "Neural Networks A Classroom Approach" Tata McGrawHill.
3. Zimmermann H.S "Fuzzy Set Theory and its Applications"Kluwer Academic Publishers.
4. Hagan, Demuth, Beale,"Neural Network Design" CENGAGE Learning, India Edition.
5. J.-S.R.Jang "Neuro-Fuzzy and Soft Computing" PHI 2003.
6. JacekM.Zurada "Introduction to Artificial Neural Sytems" Jaico Publishing House.

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of 6 questions, each carrying 20 marks.
2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 72

Course Code Course Name Credits

CSDLO7031 Advanced System Security and Digital Forensics 4

Course Objectives:
1. To understand cyber attacks and defence strategies.
2. To understand underlying principles of access control mechanisms.
3. To explore software vulnerabilities, attacks and protection mechanisms of wireless networks and
protocols, mobile devices and web applications.
4. To develop and mitigate security management and policies.
5. To understand and explore techniques used in digital forensics.

Course Outcomes: At the end of the course learner will able to

1. Understand cyber attacks and apply access control policies and control mechanisms.
2. Identify malicious code and targeted malicious code.
3. Detect and counter threats to web applications.
4. Understand the vulnerabilities of Wi-Fi networks and explore different measures to secure wireless
protocols, WLAN and VPN networks.
5. Understand the ethical and legal issues associated with cyber crimes and be able to mitigate impact
of crimes with suitable policies.
6. Use different forensic tools to acquire and duplicate data from compromised systems and analyse the
same.

Prerequisite: Cryptography and System Security

Module Unit Hrs

Detailed Content
No. No. .
Introduction & Access Control 08

Cyber-attacks, Vulnerabilities, Defence Strategies and Techniques,

1.1
Authentication Methods and Protocols, Defence in Depth Strategies.
1
Access Control Policies: DAC, MAC, Multi-level Security Models: Biba
1.2 Model, Bell La Padula Model, Single Sign on, Federated Identity
Management.

Program & OS Security 08

Malicious and Non-Malicious programming errors, Targeted Malicious

2.1 codes: Salami Attack, Linearization Attack, Covert Channel, Control
against Program threats.
2
Operating System Security: Memory and Address protection, File
2.2
Protection Mechanism, User Authentication.

2.3 Linux and Windows: Vulnerabilities, File System Security.

Web Application Security 12

3
OWASP, Web Security Considerations, User Authentication and Session

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 73

Management, Cookies, SSL, HTTPS, SSH, Privacy on Web, Web Browser
Attacks, Account Harvesting, Web Bugs, Clickjacking, Cross-Site Request
Forgery, Session Hijacking and Management, Phishing and Pharming
Techniques, Web Service Security, OAuth 2.0

Wireless Security 08

Wi-Fi Security, WEP, WPA, WPA-2, Mobile Device Security- Security

4 Threats, Device Security, GSM and UMTS Security, IEEE 802.11/802.11i
Wireless LAN Security, VPN Security.

Legal and Ethical issues 06

5.1 Cybercrime and its types, Intellectual property, Privacy, Ethical issues.

5
Protecting Programs and Data, Information and the Law, Rights of
5.2 Employees and Employers, Redress for Software Failures, Computer Crime,
Ethical Issues in Computer Security, case studies of ethics.

Digital Forensics 10

Introduction to Digital Forensics, Acquiring Volatile Data from Windows

6 and Unix systems, Forensic Duplication Techniques, Analysis of forensic
images using open source tools like Autopsy and SIFT, Investigating logs
from Unix and windows systems, Investigating Windows Registry.

Text Books:
1. Computer Security Principles and Practice, William Stallings, Sixth Edition, Pearson Education
2. Security in Computing, Charles P. Pfleeger, Fifth Edition, Pearson Education
3. Network Security and Cryptography, Bernard Menezes, Cengage Learning
4. Network Security Bible, Eric Cole, Second Edition, Wiley

Reference Books:
1. Computer Security, Dieter Gollman, Third Edition, Wiley
2. Digital Forensics by Nilakshi Jain & Kalbande, Wiley.
3. Incident Response & Computer Forensics by Kevin Mandia, Chris Prosise, Wiley.
4. Cyber Security. Nina Godbole, Sunit Belapure, Wiley.

Digital references:
1. https://www.owasp.org/index.php/Category:OWASP_Top_Ten_Project

Assessment:

Internal Assessment:

Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is completed.
Duration of each test shall be one hour.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 74

Theory Examination:

1. Question paper will comprise of total six question.

2. All question carry equal marks
3. Questions will be mixed in nature (for example supposed Q.2 has part (a) from module 3 then part (b)
will be from any module other than module 3)
4. Only Four question need to be solved.

=================================================================
Laboratory/ Experimental Work
# The Experiments for this course are required to be performed and to be evaluated
in CSL704: Computational Lab-1.

Lab Outcome:
Learner will able to
1. Analyze static code and program vulnerabilities using open source tools.
2. Explore and analyze network vulnerabilities using open source tools.
3. Explore and analyze different security tools to detect web application and browser vulnerabilities.
4. Explore and analyze different tools to secure wireless networks and routers, and mobile devices and
perform penetration testing, and analyze its impact.
5. Understand and implement AAA using RADIUS and TACACS.
6. Explore various forensics tools in Kali Linux and use them to acquire, duplicate and analyze data and
recover deleted data.
Sr. No Description
1 Static code analysis using open source tools like RATS, Flawfinder etc.
3 Vulnerability scanning using Nessus, Nikto (Kali Linux)
Explore web-application vulnerabilities using open source tools like Wapiti, browser
4
exploitation framework (BeEf), etc.
5 Detect SQL injection vulnerabilities in a website database using SQLMap
6 Performing a penetration testing using Metasploit (Kali Linux)
Exploring Router and VLAN security, setting up access lists using Cisco Packet tracer(student
7
edition)
8 Exploring VPN security using Cisco Packet tracer(student edition)
9 Exploring Authentication and access control using RADIUS, TACACS and TACACS+
10 Install and use a security app on an Android mobile (e.g. Droidcrypt)
Explore forensics tools in Kali Linux for acquiring, analyzing and duplicating data: dd,
11
dcfldd, foremost, scalpel, debugfs, wireshark, tcptrace, tcpflow
12 Analysis of forensic images using open source tools like Autopsy, SIFT, FKT Imager
Use of steganographic tools like OpenStego, to detect data hiding or unauthorized file
13
copying

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 75

Use Password cracking using tools like John the Ripper/Cain and Abel/ Ophcrack to detect
14.
weak passwords.

Reference Books:
1. Build your own Security Lab, Michael Gregg, Wiley India
2. CCNA Security, Study Guide, Tim Boyles, Sybex.
3. Web Application Hacker‘s Handbook, Dafydd Stuttard, Marcus Pinto, Wiley India
4. Network Infrastructure Security, Randy Waver, Dawn Weaver, Cengage Learning.
5. Incident Response & Computer Forensics by Kevin Mandia, Chris Prosise, Wiley.

Digital References:
http://www.opentechinfo.com/learn-use-kali-linux/

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 76

Course Code Course/Subject Name Credits

CSDLO7032 Big Data Analytics 4

Course Objectives:

1. To provide an overview of an exciting growing field of big data analytics.

2. To introduce programming skills to build simple solutions using big data technologies such as
MapReduce and scripting for NoSQL, and the ability to write parallel algorithms for multiprocessor
execution.
3. To teach the fundamental techniques and principles in achieving big data analytics with scalability
and streaming capability.
4. To enable students to have skills that will help them to solve complex real-world problems in for
decision support.
5. To provide an indication of the current research approaches that is likely to provide a basis for
tomorrow's solutions.

Course Outcomes: Learner will be able to…

1. Understand the key issues in big data management and its associated applications for business
decisions and strategy.
1. Develop problem solving and critical thinking skills in fundamental enabling techniques like
Hadoop, Mapreduce and NoSQL in big data analytics.
2. Collect, manage, store, query and analyze various forms of Big Data.
3. Interpret business models and scientific computing paradigms, and apply software tools for big data
analytics.
4. Adapt adequate perspectives of big data analytics in various applications like recommender
systems, social media applications etc.
5. Solve Complex real world problems in various applications like recommender systems, social
media applications, health and medical systems, etc.

Prerequisite:
Some prior knowledge about Java programming, Basics of SQL, Data mining and machine learning methods
would be beneficial.

Module Detailed Contents Hrs.

Introduction to Big Data and Hadoop

1.1 Introduction to Big Data,
1.2 Big Data characteristics, types of Big Data,
01 1.3 Traditional vs. Big Data business approach, 06
1.4 Case Study of Big Data Solutions.
1.5 Concept of Hadoop
1.6 Core Hadoop Components; Hadoop Ecosystem

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 77

Hadoop HDFS and MapReduce
2.1 Distributed File Systems: Physical Organization of Compute
Nodes, Large-Scale File-System Organization.
02 2.2 MapReduce: The Map Tasks, Grouping by Key, The Reduce 10
Tasks, Combiners, Details of MapReduce Execution, Coping
With Node Failures.
2.3 Algorithms Using MapReduce: Matrix-Vector Multiplication by
MapReduce, Relational-Algebra Operations, Computing
Selections by MapReduce, Computing Projections by
MapReduce, Union, Intersection, and Difference by MapReduce
2.4 Hadoop Limitations

NoSQL
3.1 Introduction to NoSQL, NoSQL Business Drivers,
3.2 NoSQL Data Architecture Patterns: Key-value stores, Graph
03 stores, Column family (Bigtable)stores, Document stores, 06
Variations of NoSQL architectural patterns, NoSQL Case Study
3.3 NoSQL solution for big data, Understanding the types of big
data problems; Analyzing big data with a shared-nothing
architecture; Choosing distribution models: master-slave versus
peer-to-peer; NoSQL systems to handle big data problems.

Mining Data Streams:

4.1 The Stream Data Model: A Data-Stream-Management System,
Examples of Stream Sources, Stream Queries, Issues in Stream
04 Processing. 12
4.2 Sampling Data techniques in a Stream
4.3 Filtering Streams: Bloom Filter with Analysis.
4.4 Counting Distinct Elements in a Stream, Count-Distinct
Problem, Flajolet-Martin Algorithm, Combining Estimates,
Space Requirements
4.5 Counting Frequent Items in a Stream, Sampling Methods for
Streams, Frequent Itemsets in Decaying Windows.
4.6 Counting Ones in a Window: The Cost of Exact Counts, The
Datar-Gionis-Indyk-Motwani Algorithm, Query Answering in
the DGIM Algorithm, Decaying Windows.

Finding Similar Items and Clustering

05 5.1 Distance Measures:
Definition of a Distance Measure, Euclidean Distances, Jaccard
Distance, Cosine Distance, Edit Distance, Hamming Distance. 08
5.2 CURE Algorithm, Stream-Computing , A Stream-Clustering
Algorithm, Initializing & Merging Buckets, Answering Queries

Real-Time Big Data Models

6.1 PageRank Overview, Efficient computation of

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 78

PageRank: PageRank Iteration Using MapReduce, Use of
06 Combiners to Consolidate the Result Vector. 10
6.2 A Model for Recommendation Systems, Content-Based
Recommendations, Collaborative Filtering.
6.3 Social Networks as Graphs, Clustering of Social-Network
Graphs, Direct Discovery of Communities in a social graph.

Text Books:
1. CreAnand Rajaraman and Jeff Ullman ―Mining of Massive Datasets‖, Cambridge University Press,
2. Alex Holmes ―Hadoop in Practice‖, Manning Press, Dreamtech Press.
3. Dan Mcary and Ann Kelly ―Making Sense of NoSQL‖ – A guide for managers and the rest of us,
Manning Press.
References books:
1. Bill Franks , ―Taming The Big Data Tidal Wave: Finding Opportunities In Huge Data Streams With
Advanced Analytics‖, Wiley
2. Chuck Lam, ―Hadoop in Action‖, Dreamtech Press
3. Jared Dean, ―Big Data, Data Mining, and Machine Learning: Value Creation for Business Leaders
and Practitioners‖, Wiley India Private Limited, 2014.
4. 4. Jiawei Han and Micheline Kamber, ―Data Mining: Concepts and Techniques‖, Morgan Kaufmann
Publishers, 3rd ed, 2010.
5. Lior Rokach and Oded Maimon, ―Data Mining and Knowledge Discovery Handbook‖, Springer, 2 nd
edition, 2010.
6. Ronen Feldman and James Sanger, ―The Text Mining Handbook: Advanced Approaches in
Analyzing Unstructured Data‖, Cambridge University Press, 2006.
7. Vojislav Kecman, ―Learning and Soft Computing‖, MIT Press, 2010.

Term Work:
Assign a case study for group of 3/4 students and each group to perform the following experiments on their
case-study; Each group should perform the exercises on a large datasetcreated by them.

The distribution of marks for term work shall be as follows:

• Programming Exercises: .................................. ......................... (10) Marks.
• Mini project: ............................................................ (10) Marks.
• Attendance (Theory & Practical) ................................ (05) Marks.
TOTAL: ........................................................... (25) Marks.

Internal Assessment:

Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when approx.
40% syllabus is completed and second class test when additional 40% syllabus is completed. Duration of
each test shall be one hour.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 79

End Semester Theory Examination:

1. Question paper will comprise of 6 questions, each carrying 20 marks.

2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining questions (Q.2 to Q.6) will be selected from all the modules.

Oral examination:
An oral exam will be held based on the above syllabus.

Suggested Practical List:

1. Hadoop HDFS Practical:
-HDFS Basics, Hadoop Ecosystem Tools Overview.
-Installing Hadoop.
-Copying File to Hadoop.
-Copy from Hadoop File system and deleting file.
-Moving and displaying files in HDFS.
-Programming exercises on Hadoop.
2. Use of Sqoop tool to transfer data between Hadoop and relational database servers.
a. Sqoop - Installation.
b. To execute basic commands of Hadoop eco system component Sqoop.
3. To install and configure MongoDB/ Cassandra/ HBase/ Hypertable to execute NoSQL commands.
4. Experiment on Hadoop Map-Reduce / PySpark:
2. -Implementing simple algorithms in Map-Reduce: Matrix multiplication, Aggregates, Joins, Sorting,
Searching, etc.
5. Create HIVE Database and Descriptive analytics-basic statistics, visualization using Hive/PIG/R.
6. Write a program to implement word count program using MapReduce.
7. Implementing DGIM algorithm using any Programming Language/ Implement Bloom Filter using
any programming language.
8. Implementing any one Clustering algorithm (K-Means/CURE) using Map-Reduce.
9. Streaming data analysis – use flume for data capture, HIVE/PYSpark for analysis of twitter data,
chat data, weblog analysis etc.
10. Implement PageRank using Map-Reduce.
11. Implement predictive Analytics techniques (regression / time series, etc.) using R/ Scilab/ Tableau/
Rapid miner.
12. Mini Project: One real life large data application to be implemented (Use standard Datasets
available on the web).

# The Experiments for this course are required to be performed and to be evaluated

in CSL704: Computational Lab-1.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 80

Course Code Course Name Credits

CSDLO7033 Robotics 4

Course objectives:

1 To know basics of a typical robot and its characteristics.

2 To analyse mathematically kinematic modelling of a typical robot manipulator.
3 To identify actuators, sensors and control of a robot for different applications.
4 To apply task planning and vision algorithms.

Course outcomes: On successful completion of course learner will be able to:

1. Describe typical robot and its characteristics.

2. Analyse kinematics parameters of robotic manipulator.
3. Identify actuators, sensors and control of a robot for different applications.
4. Design task plan and motion for a robot.
5. Apply Robotics to solve day to day problems using vision algorithms.
6. Use robot programming languages and acquire skills to program robots.

Prerequisite: Mathematical concepts of Geometry, Matrices Algebra, knowledge of Basic Electronics.

Module Unit
Topics Hrs.
No. No.

Introduction and Fundamentals of Robotics

Types of automation, Introduction, definition of a Robot,

1.1 Classification of Robots, Robotics, History of Robotics,
1.0 Advantages and Disadvantages of Robots, Robot Applications 08

Tasks involved in Robotics, Robot Components, Robot

characteristics and classification, Degrees of Freedom, Robot
1.2
joints, Robot Coordinates, Robot Reference frames,
Programming Modes, Robot Workspace, Work Envelop.

Direct and Inverse Kinematics

Direct (Forward) Kinematics: Homogeneous coordinates, Link

2.1 coordinates, Coordinate frame, coordinate transform, Arm
2.0 equations, An example – Four Axis SCARA. 08

Inverse Kinematics: Inverse kinematics problem, Tool

2.2 Configuration, An example – Four Axis SCARA.

Sensors, Actuators and Drive Systems 08

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 81

3.0 Sensors: Characteristics, Utilization, Types - Position, Velocity,
3.1 Acceleration, Force and Pressure, Torque, Visible Light and
Infrared, Touch and Tactile, Proximity, Range Finders sensors.

Actuators and Drive System: Characteristics, Hydraulic

3.2
Actuators, Pneumatic Devices, Electric Motors

4.0 Robot Task and Motion Planning

4.1 Reactive Paradigms: Overview, Attributes of reactive paradigm

Task level programming, Uncertainty, Configuration Space, Gross 10

4.2 motion planning, Fine-motion planning, Simulation of Planner
motion, Source and goal scene, Task planner Simulation.

Robot Motion Planning: Concept of motion planning, BUG 1,

4.3
BUG 2 and Tangent Bug Algorithms

5.0 Robot Vision

5.1 Image Representation, Template Matching, Polyhedral Objects

10
5.2 Shape Analysis, Iterative Processing

Perspective Transformations, Structured Illumination , Camera

5.3
Calibration

6.0 Expert Systems, Robot Language and Fuzzy Logic 12

Introduction to Expert Systems, Expert system Characteristics,

Robot as a Expert System,
6.1
Robot Languages: Classification of Robot Languages, Computer
Control and Robot Software, VAL System, and Language.

Introduction, Fuzzy set, Fuzzification, Fuzzy Inference Rule Base,

6.2
Defuzzification, Applications of Fuzzy Logic in Robotics.

Total 52

Text Books:
1. Introduction Robotics - Analysis, Control, Applications by Saeed B. Niku, Second
Edition, Wiley India.
2. Fundamentals of Robotics – Analysis and Control by Robert J. Schilling, Pearson
3. Introduction to AI robotics by Robin Murphy, PHI.
University of Mumbai, B. E. (Computer Engineering), Rev. 2016 82
4. Robotics Technology and Flexible Automation by S. R. Deb, TMH.
5. Artificial Intelligence by Rich, Knight and Nair, TMH.
6. Introduction to Fuzzy Sets by M Ganesh PHI

Reference Books:
1. Robotics – Control, Sensing, Vision, and Intelligence by K. S. Fu, R. C. Gonzalez, C. S. G.
Lee, Tata McGraw Hill
2. Principles of Robot Motion – Theory, Algorithms and Implementation by Howie Choset,
Lynch, PHI
3. Introduction to Fuzzy Logic using Matlab,By: S.N.Sivanandam,S.N.Deepa,P Sumathi ,
Springer Publications

Assessment:
Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

1 Question paper will comprise of 6 questions, each carrying 20 marks.
2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

Term Work :

The distribution of marks for term work shall be as follows:

• Programming Exercises: .................................. ......................... (10) Marks.
• Mini project: ............................................................ (10) Marks.
• Attendance (Theory & Practical) ................................ (05) Marks.
TOTAL: ........................................................... (25) Marks.

Suggested List of Experiments:

1 Representation of Various Robots and there all Specification (Study Experiment)

2 Co-ordinate Transform of a Robot

3 Fundamental Rotation

4 Composite Rotation

5 BFS and DFS

6 Homogeneous Rotation

7 Run Length Encoding

8 Shrink and swell Operator

9 BUG1 Algorithm
University of Mumbai, B. E. (Computer Engineering), Rev. 2016 83
10 Bug2 Algorithm

11 Tangent Bug Algorithm

12 Edge detection algorithm

13 Case Study of CNC Machine

14 Designing a Robot Manipulator for Pre defined Task

Students can perform experiments based on Theory Syllabus or any 12 experiments from above list of
experiments or experiments framed by teachers.

# The Experiments for this course are required to be performed and to be evaluated
in CSL704: Computational Lab-1.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 84

Course Code Course Name Credits
ILO 7011 Product Life Cycle Management 03

Objectives:
1. To familiarize the students with the need, benefits and components of PLM
2. To acquaint students with Product Data Management & PLM strategies
3. To give insights into new product development program and guidelines for designing and developing
a product
4. To familiarize the students with Virtual Product Development

Outcomes: Learner will be able to…

1. Gain knowledge about phases of PLM, PLM strategies and methodology for PLM feasibility study
and PDM implementation.
2. Illustrate various approaches and techniques for designing and developing products.
3. Apply product engineering guidelines / thumb rules in designing products for moulding, machining,
sheet metal working etc.
4. Acquire knowledge in applying virtual product development tools for components, machining and
manufacturing plant

Sr. No. Detailed Contents Hrs

Introduction to Product Lifecycle Management (PLM):Product Lifecycle 10

Management (PLM), Need for PLM, Product Lifecycle Phases, Opportunities of
Globalization, Pre-PLM Environment, PLM Paradigm, Importance & Benefits of PLM,
Widespread Impact of PLM, Focus and Application, A PLM Project, Starting the PLM
01
Initiative, PLM Applications
PLM Strategies: Industrial strategies, Strategy elements, its identification, selection
and implementation, Developing PLM Vision and PLM Strategy , Change management
for PLM
Product Design: Product Design and Development Process, Engineering Design, 09
Organization and Decomposition in Product Design, Typologies of Design Process
Models, Reference Model, Product Design in the Context of the Product Development
Process, Relation with the Development Process Planning Phase, Relation with the Post
design Planning Phase, Methodological Evolution in Product Design, Concurrent
02
Engineering, Characteristic Features of Concurrent Engineering, Concurrent
Engineering and Life Cycle Approach, New Product Development (NPD) and
Strategies, Product Configuration and Variant Management, The Design for X System,
Objective Properties and Design for X Tools, Choice of Design for X Tools and Their
Use in the Design Process
Product Data Management (PDM):Product and Product Data, PDM systems and 05
03 importance, Components of PDM, Reason for implementing a PDM system, financial
justification of PDM, barriers to PDM implementation
Virtual Product Development Tools: For components, machines, and manufacturing 05
plants, 3D CAD systems and realistic rendering techniques, Digital mock-up, Model
04
building, Model analysis, Modeling and simulations in Product Design, Examples/Case
studies
Integration of Environmental Aspects in Product Design: Sustainable Development, 05
05

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 85

Design for Environment, Need for Life Cycle Environmental Strategies, Useful Life
Extension Strategies, End-of-Life Strategies, Introduction of Environmental Strategies
into the Design Process, Life Cycle Environmental Strategies and Considerations for
Product Design
Life Cycle Assessment and Life Cycle Cost Analysis: Properties, and Framework of 05
Life Cycle Assessment, Phases of LCA in ISO Standards, Fields of Application and
06 Limitations of Life Cycle Assessment, Cost Analysis and the Life Cycle Approach,
General Framework for LCCA, Evolution of Models for Product Life Cycle Cost
Analysis

Assessment:

Internal Assessment for 20 marks:

Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:

Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions, each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved.

REFERENCES:

1. John Stark, ―Product Lifecycle Management: Paradigm for 21st Century Product Realisation‖,
Springer-Verlag, 2004. ISBN: 1852338105
2. Fabio Giudice, Guido La Rosa, Antonino Risitano, ―Product Design for the environment-A life cycle
approach‖, Taylor & Francis 2006, ISBN: 0849327229
3. Saaksvuori Antti, Immonen Anselmie, ―Product Life Cycle Management‖, Springer, Dreamtech,
ISBN: 3540257314
4. Michael Grieve, ―Product Lifecycle Management: Driving the next generation of lean thinking‖,
Tata McGraw Hill, 2006, ISBN: 0070636265

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 86

Course Code Course Name Credits
ILO 7012 Reliability Engineering 03

Objectives:
1. To familiarize the students with various aspects of probability theory
2. To acquaint the students with reliability and its concepts
3. To introduce the students to methods of estimating the system reliability of simple and complex
systems
4. To understand the various aspects of Maintainability, Availability and FMEA procedure

Outcomes: Learner will be able to…

1. Understand and apply the concept of Probability to engineering problems
2. Apply various reliability concepts to calculate different reliability parameters
3. Estimate the system reliability of simple and complex systems
4. Carry out a Failure Mode Effect and Criticality Analysis

Sr. No Detailed Contents Hrs

Probability theory: Probability: Standard definitions and concepts; Conditional

Probability, Baye‘s Theorem.
Probability Distributions: Central tendency and Dispersion; Binomial, Normal, 08
01
Poisson, Weibull, Exponential, relations between them and their significance.
Measures of Dispersion:Mean, Median, Mode, Range, Mean Deviation, Standard
Deviation, Variance, Skewness and Kurtosis.
Reliability Concepts: Reliability definitions, Importance of Reliability, Quality
Assurance and Reliability, Bath Tub Curve.
Failure Data Analysis: Hazard rate, failure density, Failure Rate, Mean Time To 08
02
Failure (MTTF), MTBF, Reliability Functions.
Reliability Hazard Models: Constant Failure Rate, Linearly increasing, Time
Dependent Failure Rate, Weibull Model. Distribution functions and reliability analysis.
System Reliability: System Configurations: Series, parallel, mixed configuration, k out 05
03
of n structure, Complex systems.
Reliability Improvement: Redundancy Techniques: Element redundancy, Unit
redundancy, Standby redundancies. Markov analysis. 08
04
System Reliability Analysis – Enumeration method, Cut-set method, Success
Path method, Decomposition method.
Maintainability and Availability: System downtime, Design for Maintainability:
Maintenance requirements, Design methods: Fault Isolation and self-diagnostics, Parts
05 standardization and Interchangeability, Modularization and Accessibility, Repair Vs 05
Replacement.
Availability – qualitative aspects.
Failure Mode, Effects and Criticality Analysis: Failure mode effects analysis,
severity/criticality analysis, FMECA examples. Fault tree construction, basic symbols, 05
06
development of functional reliability block diagram, Fau1t tree analysis and Event tree
Analysis

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 87

Assessment:

Internal Assessment for 20 marks:

Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:

Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions, each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved.

REFERENCES:

1. L.S. Srinath, ―Reliability Engineering‖, Affiliated East-Wast Press (P) Ltd., 1985.
2. Charles E. Ebeling, ―Reliability and Maintainability Engineering‖, Tata McGraw Hill.
3. B.S. Dhillion, C. Singh, ―Engineering Reliability‖, John Wiley & Sons, 1980.
4. P.D.T. Conor, ―Practical Reliability Engg.‖, John Wiley & Sons, 1985.
5. K.C. Kapur, L.R. Lamberson, ―Reliability in Engineering Design‖, John Wiley & Sons.
6. Murray R. Spiegel, ―Probability and Statistics‖, Tata McGraw-Hill Publishing Co. Ltd.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 88

Course Code Course Name Credits
ILO 7013 Management Information System 03

Objectives:
1. The course is blend of Management and Technical field.
2. Discuss the roles played by information technology in today‘s business and define various
technology architectures on which information systems are built
3. Define and analyze typical functional information systems and identify how they meet the needs of
the firm to deliver efficiency and competitive advantage
4. Identify the basic steps in systems development

Outcomes: Learner will be able to…

1. Explain how information systems Transform Business
2. Identify the impact information systems have on an organization
3. Describe IT infrastructure and its components and its current trends
4. Understand the principal tools and technologies for accessing information from databases to
improve business performance and decision making
5. Identify the types of systems used for enterprise-wide knowledge management and how they provide
value for businesses

Sr. No. Detailed Contents Hrs

Introduction To Information Systems (IS): Computer Based Information Systems,

01 Impact of IT on organizations, Importance of IS to Society. Organizational Strategy, 4
Competitive Advantages and IS
Data and Knowledge Management: Database Approach, Big Data, Data warehouse and
Data Marts, Knowledge Management
02 7
Business intelligence (BI): Managers and Decision Making, BI for Data analysis and
Presenting Results
03 Ethical issues and Privacy: Information Security. Threat to IS, and Security Controls 7
Social Computing (SC): Web 2.0 and 3.0, SC in business-shopping, Marketing,
04 Operational and Analytic CRM, E-business and E-commerce – B2B B2C. Mobile 7
commerce.
Computer Networks Wired and Wireless technology, Pervasive computing, Cloud
05 6
computing model.
Information System within Organization: Transaction Processing Systems, Functional
Area Information System, ERP and ERP support of Business Process.
06 8
Acquiring Information Systems and Applications: Various System development life
cycle models.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 89

Assessment:

Internal Assessment for 20 marks:

Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:

Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions, each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved.

REFERENCES:

1. Kelly Rainer, Brad Prince, Management Information Systems, Wiley

2. K.C. Laudon and J.P. Laudon, Management Information Systems: Managing the Digital Firm, 10th
Ed., Prentice Hall, 2007.
3. D. Boddy, A. Boonstra, Managing Information Systems: Strategy and Organization, Prentice Hall,
2008

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 90

Course Code Course Name Credits
ILO 7014 Design of Experiments 03

Objectives:
1. To understand the issues and principles of Design of Experiments (DOE)
2. To list the guidelines for designing experiments
3. To become familiar with methodologies that can be used in conjunction with experimental designs
for robustness and optimization

Outcomes: Learner will be able to…

1. Plan data collection, to turn data into information and to make decisions that lead to appropriate
action
2. Apply the methods taught to real life situations
3. Plan, analyze, and interpret the results of experiments

Sr. No Detailed Contents Hrs

Introduction
1.1 Strategy of Experimentation
01 1.2 Typical Applications of Experimental Design 06
1.3 Guidelines for Designing Experiments
1.4 Response Surface Methodology
Fitting Regression Models
2.1 Linear Regression Models
2.2 Estimation of the Parameters in Linear Regression Models
2.3 Hypothesis Testing in Multiple Regression 08
02
2.4 Confidence Intervals in Multiple Regression
2.5 Prediction of new response observation
2.6 Regression model diagnostics
2.7 Testing for lack of fit
Two-Level Factorial Designs
3.1 The 22 Design
3.2 The 23 Design
3.3 The General2k Design 07
03
3.4 A Single Replicate of the 2k Design
3.5 The Addition of Center Points to the 2k Design,
3.6 Blocking in the 2k Factorial Design
3.7 Split-Plot Designs
Two-Level Fractional Factorial Designs
4.1 The One-Half Fraction of the 2k Design
4.2 The One-Quarter Fraction of the 2k Design
04 4.3 The General 2k-p Fractional Factorial Design 07
4.4 Resolution III Designs
4.5 Resolution IV and V Designs
4.6 Fractional Factorial Split-Plot Designs
Response Surface Methods and Designs 07
05
5.1 Introduction to Response Surface Methodology

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 91

5.2 The Method of Steepest Ascent
5.3 Analysis of a Second-Order Response Surface
5.4 Experimental Designs for Fitting Response Surfaces
Taguchi Approach
6.1 Crossed Array Designs and Signal-to-Noise Ratios 04
06
6.2 Analysis Methods
6.3 Robust design examples
Assessment:

Internal Assessment for 20 marks:

Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:

Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions, each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved.

REFERENCES:

1. Raymond H. Mayers, Douglas C. Montgomery, Christine M. Anderson-Cook, Response Surface

Methodology: Process and Product Optimization using Designed Experiment, 3rd edition,John
Wiley & Sons, New York, 2001
2. D.C. Montgomery, Design and Analysis of Experiments, 5th edition, John Wiley & Sons, New York,
2001
3. George E P Box, J Stuart Hunter, William G Hunter, Statics for Experimenters: Design, Innovation
and Discovery, 2nd Ed. Wiley
4. W J Dimond, Peactical Experiment Designs for Engineers and Scintists, John Wiley and Sons Inc.
ISBN: 0-471-39054-2
5. Design and Analysis of Experiments (Springer text in Statistics), Springer by A.M. Dean, and D.
T.Voss

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 92

Course Code Course Name Credits
ILO 7015 Operations Research 03

Objectives:
1. Formulate a real-world problem as a mathematical programming model.
2. Understand the mathematical tools that are needed to solve optimization problems.
3. Use mathematical software to solve the proposed models.

Outcomes: Learner will be able to…

1. Understand the theoretical workings of the simplex method, the relationship between a linear
program and its dual, including strong duality and complementary slackness.
2. Perform sensitivity analysis to determine the direction and magnitude of change of a model‘s optimal
solution as the data change.
3. Solve specialized linear programming problems like the transportation and assignment problems,
solve network models like the shortest path, minimum spanning tree, and maximum flow problems.
4. Understand the applications of integer programming and a queuing model and compute important
performance measures

Sr. No. Detailed Contents Hrs

Introduction to Operations Research: Introduction, , Structure of the Mathematical

Model, Limitations of Operations Research
Linear Programming: Introduction, Linear Programming Problem, Requirements of
LPP, Mathematical Formulation of LPP, Graphical method, Simplex Method Penalty
Cost Method or Big M-method, Two Phase Method, Revised simplex method,
Duality, Primal – Dual construction, Symmetric and Asymmetric Dual, Weak Duality
Theorem, Complimentary Slackness Theorem, Main Duality Theorem, Dual Simplex
Method, Sensitivity Analysis
Transportation Problem: Formulation, solution, unbalanced Transportation problem.
01 14
Finding basic feasible solutions – Northwest corner rule, least cost method and Vogel‘s
approximation method. Optimality test: the stepping stone method and MODI method.
Assignment Problem: Introduction, Mathematical Formulation of the Problem,
Hungarian Method Algorithm, Processing of n Jobs Through Two Machines and m
Machines, Graphical Method of Two Jobs m Machines Problem Routing Problem,
Travelling Salesman Problem
Integer Programming Problem: Introduction, Types of Integer Programming
Problems, Gomory‘s cutting plane Algorithm, Branch and Bound Technique.
Introduction to Decomposition algorithms.
Queuing models: queuing systems and structures, single server and multi-server
02 models, Poisson input, exponential service, constant rate service, finite and infinite 05
population
Simulation: Introduction, Methodology of Simulation, Basic Concepts, Simulation
Procedure, Application of Simulation Monte-Carlo Method: Introduction, Monte-Carlo
03 05
Simulation, Applications of Simulation, Advantages of Simulation, Limitations of
Simulation
University of Mumbai, B. E. (Computer Engineering), Rev. 2016 93
Dynamic programming. Characteristics of dynamic programming. Dynamic
04 programming approach for Priority Management employment smoothening, capital 05
budgeting, Stage Coach/Shortest Path, cargo loading and Reliability problems.
Game Theory. Competitive games, rectangular game, saddle point, minimax
(maximin) method of optimal strategies, value of the game. Solution of games with
05 05
saddle points, dominance principle. Rectangular games without saddle point – mixed
strategy for 2 X 2 games.
Inventory Models: Classical EOQ Models, EOQ Model with Price Breaks, EOQ with
06 05
Shortage, Probabilistic EOQ Model,

Assessment:

Internal Assessment for 20 marks:

Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:

Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions, each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved.

REFERENCES:

1. Taha, H.A. "Operations Research - An Introduction", Prentice Hall, (7th Edition), 2002.
2. Ravindran, A, Phillips, D. T and Solberg, J. J. "Operations Research: Principles and Practice", John
Willey and Sons, 2nd Edition, 2009
3. Hiller, F. S. and Liebermann, G. J. "Introduction to Operations Research", Tata McGraw Hill, 2002.
4. Operations Research, S. D. Sharma, KedarNath Ram Nath-Meerut
5. Operations Research, KantiSwarup, P. K. Gupta and Man Mohan, Sultan Chand & Sons

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 94

Course Code Course Name Credits
ILO 7016 Cyber Security and Laws 03

Objectives:
1. To understand and identify different types cybercrime and cyber law
2. To recognized Indian IT Act 2008 and its latest amendments
3. To learn various types of security standards compliances

Outcomes: Learner will be able to…

1. Understand the concept of cybercrime and its effect on outside world
2. Interpret and apply IT law in various legal issues
3. Distinguish different aspects of cyber law
4. Apply Information Security Standards compliance during software design and development

Sr. No. Detailed Contents Hrs

Introduction to Cybercrime: Cybercrime definition and origins of the world,

01 Cybercrime and information security, Classifications of cybercrime, Cybercrime and the 4
Indian ITA 2000, A global Perspective on cybercrimes.
Cyber offenses & Cybercrime: How criminal plan the attacks, Social Engg, Cyber
stalking, Cyber café and Cybercrimes, Botnets, Attack vector, Cloud computing,
Proliferation of Mobile and Wireless Devices, Trends in Mobility, Credit Card Frauds in
Mobile and Wireless Computing Era, Security Challenges Posed by Mobile Devices,
02 9
Registry Settings for Mobile Devices, Authentication Service Security, Attacks on
Mobile/Cell Phones, Mobile Devices: Security Implications for Organizations,
Organizational Measures for Handling Mobile, Devices-Related Security Issues,
Organizational Security Policies and Measures in Mobile Computing Era, Laptops
Tools and Methods Used in Cyberline
Phishing, Password Cracking, Key loggers and Spywares, Virus and Worms,
03 6
Steganography, DoS and DDoS Attacks, SQL Injection, Buffer Over Flow, Attacks on
Wireless Networks, Phishing, Identity Theft (ID Theft)
The Concept of Cyberspace
E-Commerce , The Contract Aspects in Cyber Law ,The Security Aspect of Cyber Law
,The Intellectual Property Aspect in Cyber Law
04 8
, The Evidence Aspect in Cyber Law , The Criminal Aspect in Cyber Law, Global
Trends in Cyber Law , Legal Framework for Electronic Data Interchange Law Relating
to Electronic Banking , The Need for an Indian Cyber Law
Indian IT Act.
05 Cyber Crime and Criminal Justice: Penalties, Adjudication and Appeals Under the IT 6
Act, 2000, IT Act. 2008 and its Amendments
Information Security Standard compliances
06 6
SOX, GLBA, HIPAA, ISO, FISMA, NERC, PCI.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 95

Assessment:

Internal Assessment for 20 marks:

Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:

Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions, each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved.

REFERENCES:

1. Nina Godbole, Sunit Belapure, Cyber Security, Wiley India, New Delhi
2. The Indian Cyber Law by Suresh T. Vishwanathan; Bharat Law House New Delhi
3. The Information technology Act, 2000; Bare Act- Professional Book Publishers, New Delhi.
4. Cyber Law & Cyber Crimes By Advocate Prashant Mali; Snow White Publications, Mumbai
5. Nina Godbole, Information Systems Security, Wiley India, New Delhi
6. Kennetch J. Knapp, Cyber Security &Global Information Assurance Information Science Publishing.
7. William Stallings, Cryptography and Network Security, Pearson Publication
8. Websites for more information is available on : The Information Technology ACT, 2008- TIFR :
https://www.tifrh.res.in
9. Website for more information , A Compliance Primer for IT professional :
https://www.sans.org/reading-room/whitepapers/compliance/compliance-primer-professionals-33538

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 96

Course Code Course Name Credits
ILO 7017 Disaster Management and Mitigation Measures 03

Objectives:

1. To understand physics and various types of disaster occurring around the world
2. To identify extent and damaging capacity of a disaster
3. To study and understand the means of losses and methods to overcome /minimize it.
4. To understand role of individual and various organization during and after disaster
5. To understand application of GIS in the field of disaster management
6. To understand the emergency government response structures before, during and after disaster

Outcomes: Learner will be able to…

1. Get to know natural as well as manmade disaster and their extent and possible effects on the
economy.
2. Plan of national importance structures based upon the previous history.
3. Get acquainted with government policies, acts and various organizational structure associated
with an emergency.
4. Get to know the simple do‘s and don‘ts in such extreme events and act accordingly.

Sr. No. Detailed Contents Hrs

Introduction
1.1 Definition of Disaster, hazard, global and Indian scenario, general perspective,
01 03
importance of study in human life, Direct and indirect effects of disasters, long
term effects of disasters. Introduction to global warming and climate change.
Natural Disaster and Manmade disasters:
2.1 Natural Disaster: Meaning and nature of natural disaster, Flood, Flash flood,
drought, cloud burst, Earthquake, Landslides, Avalanches, Volcanic eruptions,
Mudflow, Cyclone, Storm, Storm Surge, climate change, global warming, sea
02 09
level rise, ozone depletion
2.2 Manmade Disasters: Chemical, Industrial, Nuclear and Fire Hazards. Role of
growing population and subsequent industrialization, urbanization and changing
lifestyle of human beings in frequent occurrences of manmade disasters.
Disaster Management, Policy and Administration
3.1 Disaster management: meaning, concept, importance, objective of disaster
management policy, disaster risks in India, Paradigm shift in disaster
management.
03 3.2 Policy and administration: 06
Importance and principles of disaster management policies, command and co-
ordination of in disaster management, rescue operations-how to start with and
how to proceed in due course of time, study of flowchart showing the entire
process.
Institutional Framework for Disaster Management in India:
4.1 Importance of public awareness, Preparation and execution of emergency
management program. Scope and responsibilities of National Institute of Disaster
Management (NIDM) and National disaster management authority (NDMA) in
04 India. Methods and measures to avoid disasters, Management of casualties, set up 06
of emergency facilities, importance of effective communication amongst different
agencies in such situations.
4.2 Use of Internet and softwares for effective disaster management. Applications of
GIS, Remote sensing and GPS in this regard.
05 Financing Relief Measures: 09
University of Mumbai, B. E. (Computer Engineering), Rev. 2016 97
5.1 Ways to raise finance for relief expenditure, role of government agencies and
NGO‘s in this process, Legal aspects related to finance raising as well as overall
management of disasters. Various NGO‘s and the works they have carried out in
the past on the occurrence of various disasters, Ways to approach these teams.
5.2 International relief aid agencies and their role in extreme events.
Preventive and Mitigation Measures:
6.1 Pre-disaster, during disaster and post-disaster measures in some events in general
6.2 Structural mapping: Risk mapping, assessment and analysis, sea walls and
embankments, Bio shield, shelters, early warning and communication
06 06
6.3 Non Structural Mitigation: Community based disaster preparedness, risk transfer
and risk financing, capacity development and training, awareness and education,
contingency plans.
6.4 Do‘s and don‘ts in case of disasters and effective implementation of relief aids.

Assessment:

Internal Assessment for 20 marks:

Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:

Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions, each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved.

REFERENCES:

1. ‗Disaster Management‘ by Harsh K.Gupta, Universities Press Publications.

2. ‗Disaster Management: An Appraisal of Institutional Mechanisms in India‘ by O.S.Dagur, published
by Centre for land warfare studies, New Delhi, 2011.
3. ‗Introduction to International Disaster Management‘ by Damon Copolla, Butterworth Heinemann
Elsevier Publications.
4. ‗Disaster Management Handbook‘ by Jack Pinkowski, CRC Press Taylor and Francis group.
5. ‗Disaster management & rehabilitation‘ by Rajdeep Dasgupta, Mittal Publications, New Delhi.
6. ‗Natural Hazards and Disaster Management, Vulnerability and Mitigation – R B Singh, Rawat
Publications
7. Concepts and Techniques of GIS –C.P.Lo Albert, K.W. Yonng – Prentice Hall (India) Publications.

(Learners are expected to refer reports published at national and International level and updated information
available on authentic web sites)

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 98

Course Code Course Name Credits
ILO 7018 Energy Audit and Management 03

Objectives:
1. To understand the importance energy security for sustainable development and the fundamentals of
energy conservation.
2. To introduce performance evaluation criteria of various electrical and thermal installations to
facilitate the energy management
3. To relate the data collected during performance evaluation of systems for identification of energy
saving opportunities.

Outcomes: Learner will be able to…

1. To identify and describe present state of energy security and its importance.
2. To identify and describe the basic principles and methodologies adopted in energy audit of an utility.
3. To describe the energy performance evaluation of some common electrical installations and identify
the energy saving opportunities.
4. To describe the energy performance evaluation of some common thermal installations and identify
the energy saving opportunities
5. To analyze the data collected during performance evaluation and recommend energy saving
measures

Sr. No Detailed Contents Hrs

Energy Scenario:
Present Energy Scenario, Energy Pricing, Energy Sector Reforms, Energy Security,
01 04
Energy Conservation and its Importance, Energy Conservation Act-2001 and its
Features. Basics of Energy and its various forms, Material and Energy balance
Energy Audit Principles:
Definition, Energy audit- need, Types of energy audit, Energy management (audit)
approach-understanding energy costs, Bench marking, Energy performance, Matching
energy use to requirement, Maximizing system efficiencies, Optimizing the input
02 08
energy requirements, Fuel and energy substitution. Elements of monitoring& targeting;
Energy audit Instruments; Data and information-analysis.
Financial analysis techniques: Simple payback period, NPV, Return on investment
(ROI), Internal rate of return (IRR)
Energy Management and Energy Conservation in Electrical System:
Electricity billing, Electrical load management and maximum demand Control; Power
factor improvement, Energy efficient equipments and appliances, star ratings.
03 Energy efficiency measures in lighting system, Lighting control: Occupancy sensors, 10
daylight integration, and use of intelligent controllers.
Energy conservation opportunities in: water pumps, industrial drives, induction motors,
motor retrofitting, soft starters, variable speed drives.
Energy Management and Energy Conservation in Thermal Systems:
Review of different thermal loads; Energy conservation opportunities in: Steam
distribution system, Assessment of steam distribution losses, Steam leakages, Steam
04 10
trapping, Condensate and flash steam recovery system.
General fuel economy measures in Boilers and furnaces, Waste heat recovery, use of
insulation- types and application. HVAC system: Coefficient of performance, Capacity,

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 99

factors affecting Refrigeration and Air Conditioning system performance and savings
opportunities.
Energy Performance Assessment:
On site Performance evaluation techniques, Case studies based on: Motors and variable
05 04
speed drive, pumps, HVAC system calculations; Lighting System: Installed Load
Efficacy Ratio (ILER) method, Financial Analysis.
Energy conservation in Buildings:
06 Energy Conservation Building Codes (ECBC): Green Building, LEED rating, 03
Application of Non-Conventional and Renewable Energy Sources

Assessment:

Internal Assessment for 20 marks:

Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:

Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions, each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved.

REFERENCES:

1. Handbook of Electrical Installation Practice, Geofry Stokes, Blackwell Science

2. Designing with light: Lighting Handbook, By Anil Valia, Lighting System
3. Energy Management Handbook, By W.C. Turner, John Wiley and Sons
4. Handbook on Energy Audits and Management, edited by A. K. Tyagi, Tata Energy Research
Institute (TERI).
5. Energy Management Principles, C.B.Smith, Pergamon Press
6. Energy Conservation Guidebook, Dale R. Patrick, S. Fardo, Ray E. Richardson, Fairmont Press
7. Handbook of Energy Audits, Albert Thumann, W. J. Younger, T. Niehus, CRC Press
8. www.energymanagertraining.com
9. www.bee-india.nic.in

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 100

Course Code Course Name Credits
ILO7019 Development Engineering 03

Objectives:
1. To understand the characteristics of rural Society and the Scope, Nature and Constraints of rural
Development.
2. To study Implications of 73rd CAA on Planning, Development and Governance of Rural Areas
3. An exploration of human values, which go into making a ‗good‘ human being, a ‗good‘ professional,
a ‗good‘ society and a ‗good life‘ in the context of work life and the personal life of modern Indian
professionals
4. To understand the Nature and Type of Human Values relevant to Planning Institutions

Outcomes: Learner will be able to…

1. Apply knowledge for Rural Development.
2. Apply knowledge for Management Issues.
3. Apply knowledge for Initiatives and Strategies
4. Develop acumen for higher education and research.
5. Master the art of working in group of different nature.
6. Develop confidence to take up rural project activities independently

Sr. No. Module Contents Hrs

01 Introduction to Rural Development Meaning, nature and scope of development; 08
Nature of rural society in India; Hierarchy of settlements; Social, economic and
ecological constraints for rural development Roots of Rural Development in
India Rural reconstruction and Sarvodaya programme before independence;
Impact of voluntary effort and Sarvodaya Movement on rural development;
Constitutional direction, directive principles; Panchayati Raj - beginning of
planning and community development; National extension services.
02 Post-Independence rural Development Balwant Rai Mehta Committee - three 04
tier system of rural local Government; Need and scope for people‘s
participation and Panchayati Raj; Ashok Mehta Committee - linkage between
Panchayati Raj, participation and rural development
03 Rural Development Initiatives in Five Year Plans Five Year Plans and Rural 06
Development; Planning process at National, State, Regional and District levels;
Planning, development, implementing and monitoring organizations and
agencies; Urban and rural interface - integrated approach and local plans;
Development initiatives and their convergence; Special component plan and
sub-plan for the weaker section; Micro-eco zones; Data base for local planning;
Need for decentralized planning; Sustainable rural development.
04 Post 73rd Amendment Scenario 73rd Constitution Amendment Act, including - 04
XI schedule, devolution of powers, functions and finance; Panchayati Raj
institutions - organizational linkages; Recent changes in rural local planning;
Gram Sabha - revitalized Panchayati Raj; Institutionalization; resource
mapping, resource mobilization including social mobilization; Information
Technology and rural planning; Need for further amendments.
05 Values and Science and Technology Material development and its values; the 10
challenge of science and technology; Values in planning profession, research
and education.
University of Mumbai, B. E. (Computer Engineering), Rev. 2016 101
Types of Values Psychological values — integrated personality; mental health;
Societal values — the modern search for a good society; justice, democracy,
rule of law, values in the Indian constitution;
Aesthetic values — perception and enjoyment of beauty; Moral and ethical
values; nature of moral judgment; Spiritual values; different concepts; secular
spirituality; Relative and absolute values;
Human values— humanism and human values; human rights; human values as
freedom, creativity, love and wisdom.
06 Ethics Canons of ethics; ethics of virtue; ethics of duty; ethics of responsibility; 04
Work ethics;
Professional ethics; Ethics in planning profession, research and education

Assessment:

Internal Assessment for 20 marks:

Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately
40% but excluding contents covered in Test I)

End Semester Examination:

Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions, each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved

References:
1. ITPI, Village Planning and Rural Development, ITPI, New Delhi
2. Thooyavan, K.R. Human Settlements: A 2005 MA Publication, Chennai
3. GoI, Constitution (73rd GoI, New Delhi Amendment) Act, GoI, New Delhi
4. Planning Commission, Five Year Plans, Planning Commission
5. Planning Commission, Manual of Integrated District Planning, 2006, Planning Commission
New Delhi
6. Planning Guide to Beginners
7. Weaver, R.C., The Urban Complex, Doubleday.
8. Farmer, W.P. et al, Ethics in Planning, American Planning Association, Washington.
9. How, E., Normative Ethics in Planning, Journal of Planning Literature, Vol.5, No.2, pp. 123-150.
10. Watson, V. , Conflicting Rationalities: -- Implications for Planning Theory and Ethics, Planning
Theory andPractice, Vol. 4, No.4, pp.395 – 407

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 102

Lab Code Lab Name Credits
CSL701 Digital Signal and Image Processing Lab 1

Lab Outcome: The learner will be able to

1. Sample and reconstruct the signal.
2. Implement and apply operations like Convolution, Correlation, DFT and FFT on DT signals
3. Implement spatial domain Image enhancement techniques.
4. Implement Edge detection techniques using first order derivative filters.

Description:
Implementation of programs can be in C or C++ or any computational software. A List of ten experiments is
given below, are needed to be performed covering all syllabus modules. Additional experiments within the
scope of the syllabus can be added.

Suggested List of Experiments:

1. Sampling and Reconstruction

2. To perform Discrete Correlation
3. To perform Discrete Convolution
4. To perform Discrete Fourier Transform
5. To perform Fast Fourier Transform
6. Implementation of Image negative, Gray level Slicing and Thresholding
7. Implementation of Contrast Stretching ,Dynamic range compression & Bit plane Slicing
8. Implementation of Histogram Processing
9. Implementation of Image smoothing/ Image sharpening
10. Implementation of Edge detection using Sobel and Previtt masks

Term Work:

 Laboratory work will be based on above syllabus of CSC701 - ‗Digital Signal and Image Processing‘
with minimum 10 experiments to be incorporated.
 The distribution of marks for term work shall be as follows:
Lab Performance 15 Marks
Assignments 05 Marks
Attendance (Theory & practical) 05 Marks

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 103

Lab Code Lab Name Credits
CSL702 Mobile Application Development Lab 1

Lab Outcome:
1. To develop and demonstrate mobile applications using various tools
2. Students will articulate the knowledge of GSM, CDMA & Bluetooth technologies and demonstrate
it.
3. Students will able to carry out simulation of frequency reuse , hidden terminal problem
4. To develop security algorithms for mobile communication network
5. To demonstrate simulation and compare the performance of Wireless LAN
6. To implement and demonstrate mobile node discovery and route maintains.

Description: The softwares like Android Studio, J2ME, NS2, NS3 and any other software which is suitable
are recommended for performing the practicals.

Suggested List of Experiments:

Sr. No. Title of Experiments

01 To understand the cellular frequency reuse concept to find the co-channel cells for a
particular cell. Design a game based application on the above concept.

02 To understand the cellular frequency reuse concept to find the cell clusters within certain
geographic area.
Design a game based application on the above concept.

03 Implementation a Bluetooth network with application as transfer of a file from one device
to another.

04 To implement a basic function of Code Division Multiple Access (CDMA) to test the
orthogonality and autocorrelation of a code to be used for CDMA operation. Write an
application based on the above concept.

05 To implement Mobile node discovery

06 Implementation of GSM security algorithms (A3/A5/A8)

07 Illustration of Hidden Terminal Problem (NS-2)

Consider two Wifi base stations (STA) and an access point (AP) located along the x-axis. All
the nodes are fixed. The AP is situated at the middle of the two STA, the distance of
separation being 150 m. [variable]. Node #0 and node #1 are the hidden terminals. Both are
transmitting some data to the AP (almost at same rate) at the same time. The loss across the
wireless link between each STA and the AP is fixed at 50 dB irrespective of the distance of
separation.

To study how RTS/CTS helps in wireless networks,

1. No RTS/CTS is being sent.
2. Nodes do exchange RTS/CTS packets.
Compare the no. of packet retransmissions required in both the cases (as obtained in
the output) and compare the results.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 104

08 To setup & configuration of Wireless Access Point (AP) using NS3. Analyze the Wi-Fi
communication range in the presence of the access point (AP) and the base station (BS).
Consider BS and AP are static. Find out the maximum distance to which two way
communications is possible. Try multiple iterations by adjusting its distance in the code and
test it.

09 Develop an application that writes data to the SD card.

10 Develop an application that uses GUI components.

11 Write an application that draws basic graphical primitives on the screen.

12 Develop an application that makes use of database.

13 Develop a native application that uses GPS location information.

14 Implement an application that creates an alert upon receiving a message.

15 Implementation of income tax/loan EMI calculator and deploy the same on real devices.

Digital Material (if Any):

1. http://www.isi.edu/nsnam/ns/ : NS-2 software download

2. https://nsnam.isi.edu/nsnam/index.php/NS_manual
3. https://www.nsnam.org/ : Ns-3 Software Download
4. http://vlssit.iitkgp.ernet.in/ant/ant/

Text Books:

1. Jochen Schilller,‖Mobile Communication ―, Addision wisely,Pearson Education

2. ―Wireless Communications & Networks,‖ By William Stallings, Second Edition, Pearson Education
3. Ekram Hossain and Teerawat Issariyakul, ―Introduction to Network Simulator NS-2,‖ Springer ,
Second Edition.
4. Michael Burton, ―Android Appliocation Development for Dummies, ― A wiley brand
5. Marko Gargenta & Masumi Nakamura, ― Learning Android,‖ O‘reilly publications
6. James Keogh, ―The complete reference J2ME, ― Mcgraw-Hill.

Term Work:
Laboratory work will be based on above syllabus with minimum 10 experiments to be incorporated.
Laboratory work (experiments): ………………… (15) Marks.
Assignments: …………………………............... (05) Marks.
Attendance (Theory + Practical)…………………… (05) Marks
TOTAL: …………………………………………… (25) Marks.

Oral & Practical exam will be based on the above and CSC702: Mobile Communication & Computing
syllabus.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 105

Lab Code Lab Name Credits
CSL703 Artificial Intelligence & Soft Computing Lab 1

Lab Outcomes: Learner will be able to

1 To realize the basic techniques to build intelligent systems

2 To create knowledge base and apply appropriate search techniques used in problem solving.

3 Apply the supervised/unsupervised learning algorithm.

4 Designfuzzy controller system.

Description: The current applications from almost all domains, like games, robots, expert system,
optimization or even the search engines are becoming smarter. We have moved to the era of knowledge
processing from data and information processing. Therefore learning these technologies practically is very
essential for a student to gain the proficiency. They will also learn and be able to appreciate the use of fusion
of basic techniques.

LAB Topic / Activity Explanation of Activity

Lab 1  Identify the problem Select a problem statement relevant to

AI
 PEAS Description

 Problem formulation

Lab 2 Introduce AI programming Language Introduce PROLOG programming.

Lab 3  Start Implementation Use AI programming languages

 Knowledge Representation and Create Or

Knowledge Base
C/JAVA

Lab 4 Implement search algorithms to reach goal Identify and analyse Algorithm to
state solve the problem

Lab 5 To implement Mc-Culloch Pitts Model for a Apply to solve AND / OR/ XOR, etc.
problem
Lab 6 To implement Fuzzy Controller system Design an automobile or washing
machine controller, etc. and implement

Lab 7 To implement Basic Supervised / Design a NN using a learning method to

Unsupervised Neural Network learning rules generate knowledge for classification.
for a problem.
Lab 8 Case study on Hybrid Systems Study the designing of Neuro Fuzzy
systems

Lab 9 Case study of an Application Printed Character Recognition, Face

Recognition, etc.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 106

Term Work:

1. Labs 1-4 are to design and implement an intelligent system using AI techniques.

2. Labs 5-7 are to design and implement an Intelligent System using SC techniques.

3. Perform any one from Lab 8 and lab 9.

The distribution of marks for term work shall be as follows:

Lab Performance (Experiments /case studies): 15

Assignment 05

Attendance (Theory & Practical) 05

Oral examination will be based on the above and CSC703: ‗AI and SC‘ Syllabus.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 107

Lab Code Lab Name Credits
CSL703 Computational Lab-I 1

Lab Outcome: After successful completion of this course student will be able to:
1. Acquire practical knowledge within the chosen area of technology for project development.
2. Identify, discuss and justify the technical aspects of the chosen project with a comprehensive and
systematic approach.

Description:
Design and implementation of any case study/ applications /experiments / mini project based on
departmental level optional courses using modern tools.

Term work:

The distribution of marks for term work shall be as follows:

Lab/ Experimental Work : 15

Report/ Documentation : 05
Attendance (Theory & Practical) : 05

Practical & Oral examination is to be conducted based on respective departmental level optional courses by
pair of internal and external examiners appointed by the University of Mumbai.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 108

Course Code Title Credit
CSP705 Major Project- I 3

Objective: The Project work enables students to develop further skills and knowledge gained during the
programme by applying them to the analysis of a specific problem or issue, via a substantial piece of work
carried out over an extended period. For students to demonstrate proficiency in the design of a research
project, application of appropriate research methods, collection and analysis of data and presentation of
results.

Guidelines:
1. Project Topic:
 To proceed with the project work it is very important to select a right topic. Project can be
undertaken on any subject addressing IT programme. Research and development projects on
problems of practical and theoretical interest should be encouraged.
 Project work must be carried out by the group of at least two students and maximum three and must
be original.
 Students can certainly take ideas from anywhere, but be sure that they should evolve them in the
unique way to suit their project requirements.
 The project work can be undertaken in a research institute or organization/company/any business
establishment.
 Student must consult internal guide along with external guide (if any) in selection of topic.
 Head of department and senior staff in the department will take decision regarding selection of
projects.
 Student has to submit weekly progress report to the internal guide and where as internal guide has to
keep track on the progress of the project and also has to maintain attendance report. This progress
report can be used for awarding term work marks.
 In case of industry projects, visit by internal guide will be preferred.

2. Project Report Format:

At the end of semester a project report should preferably contain at least following details:-

 Abstract
 Introduction
 Literature Survey
o Survey Existing system
o Limitation Existing system or research gap
o Problem Statement and Objective
o Scope
 Proposed System
o Analysis/Framework/ Algorithm
o Details of Hardware & Software
o Design details
o Methodology (your approach to solve the problem)
University of Mumbai, B. E. (Computer Engineering), Rev. 2016 109
 Implementation Plan for next semester
 Conclusion
 References

3. Term Work:
Distribution of marks for term work shall be as follows:
a. Weekly Attendance on Project Day
b. Project work contribute
c. Project Report (Spiral Bound)
d. Term End Presentation (Internal)

The final certification and acceptance of TW ensures the satisfactory performance on the above aspects.

4. Oral & Practical :

Oral &Practical examination of Project-I should be conducted by Internal and External examiners
approved by University of Mumbai. Students have to give presentation and demonstration on the Project-
I.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 110

Course Code Course Name Credits
CSC801
Human Machine Interaction 4

.Course Objectives: At the end of the course, students will be able to –

1. Learn the foundation of human machine interaction.
2. Understand the importance of human psychology in designing good interfaces.
3. Be aware of mobile interaction design and its usage in day – to – day activities.
4. Understand various design technologies to meet user requirements.
5. Encourage to indulge into research in Machine Interaction Design.

Course Outcomes: At the end of the course, the students will be able to -
1. Identify User Interface (UI) design principles.
2. Analysis of effective user friendly interfaces.
3. Apply Interactive Design process in real world applications.
4. Evaluate UI design and justify.
5. Create application for social and technical task.

Pre-requisites: Web Technologies; Software Engineering; Experience in designing interfaces for

applications and web sites. Basic knowledge of designing tools and languages like HTML, Java, etc

Module
Topics Hrs.
No.
FOUNDATIONS OF HMI:
The Human: History of User Interface Designing, I/O channels, Hardware, Software
and Operating environments, The Psychopathology of everyday Things, Psychology of
1.0 8
everyday actions, Reasoning and problem solving . The computer: Devices, Memory,
processing and networks. Interaction: Models, frameworks, Ergonomics, styles,
elements, interactivity, Paradigms.
DESIGN & SOFTWARE PROCESS:
Mistakes performed while designing a computer system, Human interaction with
computers, importance of human characteristics human consideration, Human
interaction speeds .Interactive Design basics, process, scenarios, navigation, Iteration
2.0 10
and prototyping. HMI in software process: software life cycle, usability engineering,
Prototyping in practice, design rationale. Design rules: principles, standards, guidelines,
rules. Recognize the goals, Goal directed design process. Evaluation Techniques:
Universal Design.
GRAPHICAL USER INTERFACE:
The graphical User Interface: Popularity of graphics, the concept of direct manipulation,
3.0 graphical systems, Characteristics. Web user Interface: Interface popularity, 8
characteristics. The merging of graphical Business systems and the Web. Principles of
user interface design.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 111

SCREEN DESIGNING:
Design goals , Screen planning and purpose, organizing screen elements, ordering of
screen data and content , screen navigation and flow, Visually pleasing composition,
4.0 10
amount of information, focus and emphasis, presentation information simply and
meaningfully, information retrieval on web, statistical graphics, Technological
consideration in interface design.
INTERFACE DESIGN FOR MOBILE DEVICES:
Mobile Ecosystem: Platforms, Application frameworks: Types of Mobile Applications:
5.0 8
Widgets, Applications, Games, Mobile Information Architecture, Mobile 2.0, Mobile
Design: Elements of Mobile Design, Tools.
INTERACTION STYLES AND COMMUNICATION:
Windows:Characteristics, Components, Presentation styles, Types of Windows,
6.0 8
Management, operations. Text messages: Words, Sentences, messages and text words,
Text for web pages. Icons, Multimedia and colors
Total 52

Text Books:
1. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale, ―Human Computer Interaction‖, 3rdEdition,
Pearson Education, 2004.
2. Wilbert O. Galitz, ―The Essential Guide to User Interface Design‖, Wiley publication.
3. Alan Cooper, Robert Reimann, David Cronin, ―About Face3: Essentials of Interaction design‖,
Wiley publication.
4. Jeff Johnson, ―Designing with the mind in mind‖, Morgan Kaufmann Publication.
5. Donald A. Normann, ― Design of everyday things‖,Basic Books; Reprint edition 2002.
6. Brian Fling, ―Mobile Design and Development‖, First Edition , O‘Reilly Media Inc., 2009.

Reference Books:
1. Rogers Sharp Preece,‖Interaction Design:Beyond Human Computer Interaction‖,,Wiley.
2. Guy A. Boy ―The Handbook of Human Machine Interaction‖, Ashgate publishing Ltd.
3. Kalbande, Kanade, Iyer, ―Galitz‘s Human Machine Interaction‖, Wiley Publications.

Assessment:
Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of 6 questions, each carrying 20 marks.
2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 112

Course Code Course Name Credits
CSC802 Distributed Computing 04

Course objectives:
1. To provide students with contemporary knowledge in distributed systems
2. To equip students with skills to analyze and design distributed applications.
3. To provide master skills to measure the performance of distributed synchronization algorithms

Course outcomes: On successful completion of course learner will be able to:

1. Demonstrate knowledge of the basic elements and concepts related to distributed system
technologies;
2. Illustrate the middleware technologies that support distributed applications such as RPC, RMI and
Object based middleware.
3. Analyze the various techniques used for clock synchronization and mutual exclusion
4. Demonstrate the concepts of Resource and Process management and synchronization algorithms
5. Demonstrate the concepts of Consistency and Replication Management
6. Apply the knowledge of Distributed File System to analyze various file systems like NFS, AFS and
the experience in building large-scale distributed applications.
Prerequisite: Java Programming, Operating Systems, Computer Networks
Module Unit Topics Hrs.
No. No.
1.0 Introduction to Distributed Systems 06
1.1 Characterization of Distributed Systems: Issues, Goals, and Types of
distributed systems, Distributed System Models, Hardware concepts,
Software Concept.
1.2 Middleware: Models of Middleware, Services offered by middleware,
Client Server model.
2.0 Communication 10
2.1 Layered Protocols, Interprocess communication (IPC): MPI, Remote
Procedure Call (RPC), Remote Object Invocation, Remote Method
Invocation (RMI)
2.2 Message Oriented Communication, Stream Oriented Communication,
Group Communication
3.0 Synchronization 10
3.1 Clock Synchronization, Logical Clocks, Election Algorithms, Mutual
Exclusion, Distributed Mutual Exclusion-Classification of mutual
Exclusion Algorithm, Requirements of Mutual Exclusion Algorithms,
Performance measure.
3.2 Non Token based Algorithms: Lamport Algorithm, Ricart–Agrawala‘s
Algorithm, Maekawa‘s Algorithm
3.3 Token Based Algorithms: Suzuki-Kasami‘s Broardcast Algorithms,
Singhal‘s Heurastic Algorithm, Raymond‘s Tree based Algorithm,
Comparative Performance Analysis.
4.0 Resource and Process Management 06
4.1 Desirable Features of global Scheduling algorithm, Task assignment
approach, Load balancing approach, load sharing approach
4.2 Introduction to process management, process migration, Threads,
University of Mumbai, B. E. (Computer Engineering), Rev. 2016 113
Virtualization, Clients, Servers, Code Migration
5.0 Consistency, Replication and Fault Tolerance 08
5.1 Introduction to replication and consistency, Data-Centric and Client-
Centric Consistency Models, Replica Management
5.2 Fault Tolerance: Introduction, Process resilience, Reliable client-server and
group communication, Recovery
6.0 Distributed File Systems and Name Services 12
6.1 Introduction and features of DFS, File models, File Accessing models,
File-Caching Schemes, File Replication, Case Study: Distributed File
Systems (DSF), Network File System (NFS), Andrew File System (AFS)
6.2 Introduction to Name services and Domain Name System, Directory
Services, Case Study: The Global Name Service, The X.500 Directory
Service
6.3 Designing Distributed Systems: Google Case Study

Total 52

Assessment:

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

a. Question paper will comprise of 6 questions, each carrying 20 marks.
b. The students need to solve total 4 questions.
c. Question No.1 will be compulsory and based on entire syllabus.
d. Remaining question (Q.2 to Q.6) will be selected from all the modules.

Text Books:
1. Andrew S. Tanenbaum and Maarten Van Steen, ―Distributed Systems: Principles and Paradigms, 2nd
edition, Pearson Education.
2. George Coulouris, Jean Dollimore, Tim Kindberg, , "Distributed Systems: Concepts and Design",
4th Edition, Pearson Education, 2005.

Reference Books:
1. A. S. Tanenbaum and M. V. Steen, "Distributed Systems: Principles and Paradigms", Second
Edition, Prentice Hall, 2006.
2. M. L. Liu, ―Distributed Computing Principles and Applications‖, Pearson Addison Wesley, 2004.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 114

Course Code Course Name Credit

DLO8011 High Performance Computing 04

Course Objectives:
1. To learn concepts of parallel processing as it pertains to high-performance computing.
2. To design, develop and analyze parallel programs on high performance computing resources using
parallel programming paradigms.

Course Outcomes: Learner will be able to-

1. Memorize parallel processing approaches
2. Describe different parallel processing platforms involved in achieving High Performance Computing.
3. Discuss different design issues in parallel programming
4. Develop efficient and high performance parallel programming
5. Learn parallel programming using message passing paradigm using open source APIs.

Prerequisite: Computer Organization

Sr.No. Module Detailed Content Hours
Introduction to Parallel Computing: Motivating
Parallelism, Scope of Parallel Computing, Levels of
parallelism (instruction, transaction, task, thread, memory,
function)
Classification Models: Architectural Schemes (Flynn‘s,
1 Introduction Shore‘s, Feng‘s, Handler‘s) and Memory access (Shared 6
Memory, Distributed Memory, Hybrid Distributed Shared
Memory)
Parallel Architectures: Pipeline Architecture, Array
Processor, Multiprocessor Architecture, Systolic
Architecture, Data Flow Architecture
Introduction, Pipeline Performance, Arithmetic Pipelines,
Pipeline
2 Pipeline instruction processing, Pipeline stage design, 8
Processing
Hazards, Dynamic instruction scheduling
Parallel Programming Platforms: Implicit Parallelism:
Parallel Trends in Microprocessor & Architectures, Limitations of
3 Programming Memory System Performance, Dichotomy of Parallel 10
Platforms Computing Platforms, Physical Organization of Parallel
Platforms, Communication Costs in Parallel Machines
Principles of Parallel Algorithm Design: Preliminaries,
Parallel Decomposition Techniques, Characteristics of Tasks and
Algorithm Interactions, Mapping Techniques for Load Balancing, 12
4
Design Methods for Containing Interaction Overheads, Parallel
Algorithm Models

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 115

Performance Measures : Speedup, execution time,
Performance efficiency, cost, scalability, Effect of granularity on
5 6
Measures performance, Scalability of Parallel Systems, Amdahl‘s
Law, Gustavson‘s Law, Performance Bottlenecks

Programming Using the Message-Passing Paradigm:

Principles of Message Passing Programming, The Building
Blocks: Send and Receive Operations
6 HPC
10
Programming MPI: the Message Passing Interface, Topology and
Embedding, Overlapping Communication with
Computation, Collective Communication and Computation
Operations, Introduction to OpenMP

Text Books:

1. AnanthGrama, Anshul Gupta, George Karypis, Vipin Kumar , ―Introduction to Parallel Computing‖,
Pearson Education, Second Edition, 2007.
2. M. R. Bhujade, ―Parallel Computing‖, 2nd edition, New Age International Publishers, 2009.
3. Kai Hwang, Naresh Jotwani, ―Advanced Computer Architecture: Parallelism, Scalability,
Programmability‖, McGraw Hill, Second Edition, 2010.
4. Georg Hager, Gerhard Wellein, ―Introduction to High Performance Computing for Scientists and
Engineers", Chapman & Hall / CRC Computational Science series, 2011.

Reference Books:
1. Michael J. Quinn, ―Parallel Programming in C with MPI and OpenMP‖, McGraw-Hill International
Editions, Computer Science Series, 2008.
2. Kai Hwang, Zhiwei Xu, ―Scalable Parallel Computing: Technology, Architecture, Programming‖,
McGraw Hill, 1998.
3. Laurence T. Yang, MinyiGuo, ―High- Performance Computing: Paradigm and Infrastructure‖ Wiley,
2006.

Internal Assessment: Assessment consists of two tests out of which; one should be compulsory class test
(on minimum 02 Modules) and the other is either a class test or assignment on live problems or course
project.

Theory Examination:

1. Question paper will comprise of total six questions.

2. All question carry equal marks.
3. Questions will be mixed in nature (for example supposed Q.2 has part (a) from module 3 then part
(b) will be from any module other than module 3).
4. Only Four question need to be solved.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 116

In question paper weightage of each module will be proportional to number of respective lecture hours
as mention in the syllabus.

Laboratory Work:

Description: The Laboratory Work (Experiments) for this course is required to be performed and to be
evaluated in CSL803: Computational Lab-II

Suggested Experiment List:

Sr.
Detailed Content
No.

1 Execution of Simple Hello world program on MPI platform

2 a. Program to send data and receive data to/from processors using MPI
b. Program illustrating Broadcast of data using MPI
3 Implement a parallel program to demonstrate the cube of N number within a set range.

4 Write a parallel program for area of a circle/triangle

5 Implement a program to demonstrate balancing of workload on MPI platform

Using directives of MPI/OpenMP implement parallel programming for calculator application

6
(add, sub, multiplication and division)

Mini Project

Evaluate performance enhancement of HPC for any of the following:

7
One-Dimensional Matrix-Vector Multiplication/ Single-Source Shortest-Path/ Sample
Sort/Two-Dimensional Matrix-Vector Multiplication

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 117

Course Code Course Name Credits

DLO8012 Natural Language Processing 4

Course objectives:
1. To understand natural language processing and to learn how to apply basic algorithms in this field.
2. To get acquainted with the basic concepts and algorithmic description of the main language levels:
morphology, syntax, semantics, and pragmatics.
3. To design and implement applications based on natural language processing
4. To implement various language Models.
5. To design systems that uses NLP techniques

Course outcomes: On successful completion of course learner should:

1. Have a broad understanding of the field of natural language processing.
2. Have a sense of the capabilities and limitations of current natural language technologies,
3. Be able to model linguistic phenomena with formal grammars.
4. Be able to Design, implement and test algorithms for NLP problems
5. Understand the mathematical and linguistic foundations underlying approaches to the various areas in
NLP
6. Be able to apply NLP techniques to design real world NLP applications such as machine translation, text
categorization, text summarization, information extraction...etc.

Prerequisite: Data structure & Algorithms, Theory of computer science, Probability Theory.

Module Unit No. Topics Hrs.

No.

Introduction History of NLP, Generic NLP system, levels of NLP , Knowledge in

1 language processing , Ambiguity in Natural language , stages in NLP, 4
challenges of NLP ,Applications of NLP

Morphology analysis –survey of English Morphology, Inflectional

Word Level morphology & Derivational morphology, Lemmatization, Regular
2 Analysis expression, finite automata, finite state transducers (FST) 10
,Morphological parsing with FST , Lexicon free FST Porter stemmer.
N –Grams- N-gram language model, N-gram for spelling correction.

Part-Of-Speech tagging( POS)- Tag set for English ( Penn Treebank ) ,

Syntax Rule based POS tagging, Stochastic POS tagging, Issues –Multiple
3 analysis tags & words, Unknown words. Introduction to CFG, Sequence 10
labeling: Hidden Markov Model (HMM), Maximum Entropy, and
Conditional Random Field (CRF).

Lexical Semantics, Attachment for fragment of English- sentences,

noun phrases, Verb phrases, prepositional phrases, Relations among
Semantic
4 lexemes & their senses –Homonymy, Polysemy, Synonymy, 10
Analysis
Hyponymy, WordNet, Robust Word Sense Disambiguation (WSD)
,Dictionary based approach

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 118

Pragmatics Discourse –reference resolution, reference phenomenon , syntactic &
5 semantic constraints on co reference 8

Applications ( Machine translation, Information retrieval, Question answers system,

preferably for categorization, summarization, sentiment analysis, Named Entity
6 Indian Recognition. 10
regional
languages)

Text Books:

1. Daniel Jurafsky, James H. Martin ―Speech and Language Processing‖ Second Edition, Prentice Hall,
2008.
2. Christopher D.Manning and Hinrich Schutze, ― Foundations of Statistical Natural
Language Processing ―, MIT Press, 1999.

Reference Books:

1. Siddiqui and Tiwary U.S., Natural Language Processing and Information Retrieval, Oxford
University Press (2008).
2. Daniel M Bikel and Imed Zitouni ― Multilingual natural language processing applications‖ Pearson,
2013
3. Alexander Clark (Editor), Chris Fox (Editor), Shalom Lappin (Editor) ― The Handbook of
Computational Linguistics and Natural Language Processing ― ISBN: 978-1-118-
4. Steven Bird, Ewan Klein, Natural Language Processing with Python, O‘Reilly
5. Brian Neil Levine, An Introduction to R Programming
6. Niel J le Roux, Sugnet Lubbe, A step by step tutorial : An introduction into R application and
programming

Assessment:

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

1 Question paper will comprise of 6 questions, each carrying 20 marks.
2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 119

Laboratory Work/Case study/Experiments:

Description: The Laboratory Work (Experiments) for this course is required to be performed and to be
evaluated in CSL803: Computational Lab-II

The objective of Natural Language Processing lab is to introduce the students with the basics of NLP which
will empower them for developing advanced NLP tools and solving practical problems in this field.

Reference for Experiments: http://cse24-iiith.virtual-labs.ac.in/#

Reference for NPTEL: http://www.cse.iitb.ac.in/~cs626-449

Sample Experiments: possible tools / language: R tool/ Python programming Language

Note: Although it is not mandatory, the experiments can be conducted with reference to any Indian regional
language.

1. Preprocessing of text (Tokenization, Filtration, Script Validation, Stop Word Removal, Stemming)
2. Morphological Analysis
3. N-gram model
4. POS tagging
5. Chunking
6. Named Entity Recognition
7. Case Study/ Mini Project based on Application mentioned in Module 6.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 120

Course Code Course Name Credits

DLO8013 Adhoc Wireless Networks 4

Course objectives:
1. To Identify the major issues associated with ad-hoc networks
2. To identify the requirements for protocols for wireless ad-hoc networks as compared to the protocols
existing for wired network.
3. To explore current ad-hoc technologies by researching key areas such as algorithms, protocols,
hardware, and applications.
4. To Provide hands-on experience through real-world programming projects
5. To provide advanced in–depth networking materials to graduate students in networking research.

Course outcomes: On successful completion of course learner will be able to:

1. Identify the characteristics and features of Adhoc Networks.
2. Understand the concepts & be able to design MAC protocols for Ad Hoc networks
3. Implement protocols / Carry out simulation of routing protocols of Adhoc Networks
4. Interpret the flow control in transport layer of Ad Hoc Networks
5. Analyze security principles for routing of Ad Hoc Networks
6. Utilize the concepts of Adhoc Networks in VANETs

Prerequisite: Computer Network, Wireless Networking

Module Unit Topics Hrs.

No. No.
1.0 Introduction 04
1.1 Introduction to wireless Networks. Characteristics of Wireless
channel,
1.2 Issues in Ad hoc wireless networks, Adhoc Mobility Models:-
Indoor and outdoor models,
1.3 Introduction to Adhoc networks – definition, characteristics
features, applications.
2.0 MAC protocols for Wireless Ad-Hoc Networks 12
2.1 Introduction
2.2 Issues in designing MAC for Wireless Ad-Hoc Networks
2.3 Design Goals and classification of MAC for Wireless Ad-Hoc
Networks
2.4 Contention based MAC protocols for Wireless Ad-Hoc
Networks, with reservation mechanisms, scheduling
Mechanisms
2.5 MAC protocols using directional antennas, Other MAC
Protocols
2.6 IEEE standards MAC Protocols: 802.15.1(WPAN based on
Bluetooth), 802.15.4 (WSN/Zigbee), 802.15.6 (WBAN).
3.0 Routing Protocols for Wireless Ad-Hoc Networks 10
3.1 Introduction, Issues in designing a routing protocol for Wireless
Ad-Hoc Networks
3.2 Classification of routing protocols, Table driven routing
protocols like DSDV, WRP,
University of Mumbai, B. E. (Computer Engineering), Rev. 2016 121
On- demand routing protocols like ABR, DSR, TORA, AODV,
etc.
3.3 Hybrid Routing Protocols : ZRP, Routing Protocols with
efficient flooding mechanism, Hierarchical Routing Protocols,
Power aware routing protocols
4.0 Transport Layer 10
4.1 Transport layer protocols for Ad hoc wireless Networks:
Introduction,
4.2 Issues in designing a transport layer protocol for Ad hoc
wireless Networks,
4.3 Design goals of a transport layer protocol for Ad hoc wireless
Networks,
4.4 Classification of transport layer solutions: Split Approach ,
End-to-End approach :TCP-F,TCP-ELFN, Ad-Hoc TCP, TCP
Buffering capability and Sequencing information
4.5 End-to-End Quality of Service
5.0 Security 08
5.1 Security attacks in wireless Ad hoc wireless Networks,
Network security requirements,
5.2 Issues & challenges in security provisioning,
5.3 Link Layer security attacks: 802.11 MAC , WPA and variations
5.4 Network Security Attacks: Routing Protocol Attacks: attacks
using falsifying route errors and broadcasting falsifying routes,
spoofing attacks, Rushing attacks, Secure routing in Ad hoc
wireless Networks
6.0 Vehicular Ad-Hoc Network (VANET) 08
6.1 Introduction: Challenges and Requirements, , Layered
architecture for VANETs, DSRC /WAVE standard (IEEE
802.11p )
6.2 IEEE 802.11p protocol Stack (PHY & MAC) ,
A Survey on Proposed MAC Approaches for VANETs like
TDMA, SDMA and CDMA based approaches, DSRC MAC &
LLC
6.3 Georouting: CBF, Flooding with broadcast suppression
6.4 Delay Tolerant Network, Introduction to Opportunistic
Networking in Delay Tolerant Vehicular Ad Hoc Networks
Total 52

Assessment:

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when approx.
40% syllabus is completed and second class test when additional 40% syllabus is completed. Duration of
each test shall be one hour.

End Semester Theory Examination:

1. Question paper will comprise of 6 questions, each carrying 20 marks.
2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 122

Text Books:
1. Siva Ram Murthy and B.S. Manoj , ―Ad hoc Wireless Networks Architectures and protocols‖, 2nd
edition, Pearson Education, 2007 (T1)
2. C. K. Toh, ―Adhoc Mobile Wireless Networks‖, Pearson Education, 2002 (T2)
3. Charles E. Perkins, ―Adhoc Networking‖, Addison – Wesley, 2000 (T3)
4. Dipankar Raychaudhuri, Mario Gerla, ―Emerging Wireless Technologies and the Future Mobile Internet,
D, Cambridge. (T4)

Reference Books:
1. Subir Kumar Sarkar, ―Ad-Hoc Mobile Wireless Networks: principles, protocols and applications‖ CRC
Press (R1)
2. Prasant Mohapatra and Sriramamurthy, ―Ad Hoc Networks: Technologies and Protocols‖, Springer
International Edition, 2009, (R2)
3. Stefano Basangi, Marco Conti, Silvia Giordano, Ivan Stojmenovic, ―Mobile Ad-Hoc Networking, ―
John-Wiley and Sons Publications, 2004,(R3)
4. Hannes Hartenstein, Kenneth Laberteaux, ―VANET Applications and Interworking Technologies,‖
Wiley Publications (R4)
5. Christoph Sommer , Falko Dressler, ―Vehicular Networking,‖ Cambridge University Press, 2014 (R5)

Laboratory Work

Lab Outcome:
1. Explore the knowledge of NS2 and NS3 by installing it and make it ready
2. Shall synthesize a simulation and evaluate the performance of WLAN 802.11 and Bluetooth
3. Students will able to analyze and implement MAC & Network layer protocols using open source
and synthesis as well as evaluate its performance
4. Implement Transport layer protocols / Carry out simulation of routing protocols of Adhoc Networks
5. Describe and interpret the use security routines and evaluate its performance
6. Explore and understand the capability of SUMO and MOVE as well as Nessi by installing it and
analyze it by applying on various scenarios

Description: It is recommended that Network simulation Softwares like NS-2, NS-3, SUMO (Simulation
software for Urban MObility) with MOVE. Software like Nessi is also recommended for the event based
security attacks simulation and measure.

The Laboratory Work (Experiments) for this course is required to be performed and to be evaluated in
CSL803: Computational Lab-II

Suggested List of Experiments:

Sr. No. Title of Experiments

1 Installation of NS2 & NS3 in Fedora 19 (32 bit) OS Linux.

2 Simulating IEEE 802.11 wireless LAN in Ad-Hoc Mode using NS2

3 Implementation a Bluetooth network in NS3 with application as transfer of a file from one
device to another

4 To implement and compare MAC layer protocols, MACAW, MACA-BI and MACA with
piggybacked Reservation using NS-3

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 123

5 Develop sample wireless network in which
a. implement AODV and AOMDV protocol
b. Calculate the time to receive reply from the receiver using NS2.
c. Generate graphs which show the transmission time for packet.
Implement wireless network. Capture data frame and identify fields using NS2.

6 Communicate between two different networks (NS-3) which has following specifications:
a. One network has Class A network with ―TORA protocol‖
b. Second has Class B network ―AODV protocol‖

7 To calculate and compare average throughput for various TCP variants like TCP-F (Feedback)
and Ad-Hoc TCP using NS-3

8 Explore and use security tools like WEP & WPA and evaluate its performance on mobile
terminals

9 Simulation of Urban Mobility (SUMO) along with MOVE is software that helps in simulating
the VANETs. Install it on Fedora 19 (32 bit) OS Linux

10 Create a simulation for road traffic with 6 junctions. There are various vehicles going on and
your own car also. Select a shortest route for your car. Demonstrate with simulation software
SUMO and MOVE.

11 A car acts as a malicious node and can be analyzed for the packet loss before and after malicious
activity. Using SUMO and MOVE.

12 Create an Ad-hoc Network using nessi Simulation software and include events incorporate
dropped packets, infected flows, compromised machines, unavailable services etc, and check its
performance

Digital Material (if Any):

1. http://www.isi.edu/nsnam/ns/ : NS-2 software download (D1)

2. https://nsnam.isi.edu/nsnam/index.php/NS_manual (D2)
3. https://www.nsnam.org/ : Ns-3 Software Download (D3)
4. http://www.nsnam.com/2013/11/vanet-simulator-in-fedora-19-32-bit.html (D4)
5. http://www.sumo.dlr.de/userdoc/Tutorials/Quick_Start.html (D5)
6. http://veins.car2x.org/ (D6)
7. http://www.nessi2.de/ (D7)

Text Books:
1. Ekram Hossain and Teerawat Issariyakul, ―Introduction to Network Simulator NS-2,‖ Springer ,
Second Edition. (T1)
2. Jack L. Burbank, ―Introduction to Network Simulator 3,‖ Wiley Publications(T2)
3. Siva Ram Murthy and B.S. Manoj , ―Ad hoc Wireless Networks Architectures and protocols‖, 2nd
edition, Pearson Education, 2007 (T3)
4. Michael Gregg, ―Build your own security lab,‖ Wiley India edition (T4)

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 124

Course Code Course Name Credits
ILO 8021 Project Management 03

Objectives:
1. To familiarize the students with the use of a structured methodology/approach for each and every
unique project undertaken, including utilizing project management concepts, tools and techniques.
2. To appraise the students with the project management life cycle and make them knowledgeable
about the various phases from project initiation through closure.

Outcomes: Learner will be able to…

1. Apply selection criteria and select an appropriate project from different options.
2. Write work break down structure for a project and develop a schedule based on it.
3. Identify opportunities and threats to the project and decide an approach to deal with them
strategically.
4. Use Earned value technique and determine & predict status of the project.
5. Capture lessons learned during project phases and document them for future reference

Module Detailed Contents Hrs

Project Management Foundation:

Definition of a project, Project Vs Operations, Necessity of project management, Triple
constraints, Project life cycles (typical & atypical) Project phases and stage gate
01 5
process. Role of project manager, Negotiations and resolving conflicts, Project
management in various organization structures, PM knowledge areas as per Project
Management Institute (PMI)
Initiating Projects:
How to get a project started, Selecting project strategically, Project selection models
02 (Numeric /Scoring Models and Non-numeric models), Project portfolio process, Project 6
sponsor and creating charter; Project proposal. Effective project team, Stages of team
development & growth (forming, storming, norming &performing), team dynamics.
Project Planning and Scheduling:
Work Breakdown structure (WBS) and linear responsibility chart, Interface
03 Co-ordination and concurrent engineering, Project cost estimation and budgeting, Top 8
down and bottoms up budgeting, Networking and Scheduling techniques. PERT, CPM,
GANTT chart, Introduction to Project Management Information System (PMIS).
Planning Projects:
Crashing project time, Resource loading and levelling, Goldratt's critical chain, Project
Stakeholders and Communication plan
04 6
Risk Management in projects: Risk management planning, Risk identification and risk
register, Qualitative and quantitative risk assessment, Probability and impact matrix.
Risk response strategies for positive and negative risks
5.1 Executing Projects:
Planning monitoring and controlling cycle, Information needs and reporting, engaging
with all stakeholders of the projects, Team management, communication and project
05 meetings 8
5.2 Monitoring and Controlling Projects:
Earned Value Management techniques for measuring value of work completed; Using
milestones for measurement; change requests and scope creep, Project audit

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 125

5.3 Project Contracting
Project procurement management, contracting and outsourcing,
6.1 Project Leadership and Ethics:
Introduction to project leadership, ethics in projects, Multicultural and virtual projects
6.2 Closing the Project:
Customer acceptance; Reasons of project termination, Various types of project
06 6
terminations (Extinction, Addition, Integration, Starvation), Process of project
termination, completing a final report; doing a lessons learned analysis; acknowledging
successes and failures; Project management templates and other resources; Managing
without authority; Areas of further study.

Assessment:

Internal Assessment for 20 marks:

Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:

Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions, each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved

REFERENCES:

1. Project Management: A managerial approach, Jack Meredith & Samuel Mantel, 7th Edition, Wiley
India
2. A Guide to the Project Management Body of Knowledge (PMBOK® Guide), 5th Ed, Project
Management Institute PA, USA
3. Project Management,Gido Clements, Cengage Learning
4. Project Management,Gopalan, Wiley India
5. Project Management,Dennis Lock, 9th Edition, Gower Publishing England

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 126

Course Code Course Name Credits
ILO 8022 Finance Management 03

Objectives:
1. Overview of Indian financial system, instruments and market
2. Basic concepts of value of money, returns and risks, corporate finance, working capital and its
management
3. Knowledge about sources of finance, capital structure, dividend policy

Outcomes: Learner will be able to…

1. Understand Indian finance system and corporate finance
2. Take investment, finance as well as dividend decisions

Module Detailed Contents Hrs

Overview of Indian Financial System: Characteristics, Components and Functions of

Financial System.
Financial Instruments: Meaning, Characteristics and Classification of Basic Financial
Instruments — Equity Shares, Preference Shares, Bonds-Debentures, Certificates of
01 Deposit, and Treasury Bills. 06
Financial Markets: Meaning, Characteristics and Classification of Financial Markets
— Capital Market, Money Market and Foreign Currency Market
Financial Institutions: Meaning, Characteristics and Classification of Financial
Institutions — Commercial Banks, Investment-Merchant Banks and Stock Exchanges
Concepts of Returns and Risks: Measurement of Historical Returns and Expected
Returns of a Single Security and a Two-security Portfolio; Measurement of Historical
Risk and Expected Risk of a Single Security and a Two-security Portfolio. 06
02
Time Value of Money: Future Value of a Lump Sum, Ordinary Annuity, and Annuity
Due; Present Value of a Lump Sum, Ordinary Annuity, and Annuity Due; Continuous
Compounding and Continuous Discounting.
Overview of Corporate Finance: Objectives of Corporate Finance; Functions of
Corporate Finance—Investment Decision, Financing Decision, and Dividend Decision.
Financial Ratio Analysis: Overview of Financial Statements—Balance Sheet, Profit 09
03
and Loss Account, and Cash Flow Statement; Purpose of Financial Ratio Analysis;
Liquidity Ratios; Efficiency or Activity Ratios; Profitability Ratios; Capital Structure
Ratios; Stock Market Ratios; Limitations of Ratio Analysis.
Capital Budgeting: Meaning and Importance of Capital Budgeting; Inputs for Capital
Budgeting Decisions; Investment Appraisal Criterion—Accounting Rate of Return,
Payback Period, Discounted Payback Period, Net Present Value(NPV), Profitability
Index, Internal Rate of Return (IRR), and Modified Internal Rate of Return (MIRR) 10
04
Working Capital Management: Concepts of Meaning Working Capital; Importance of
Working Capital Management; Factors Affecting an Entity‘s Working Capital Needs;
Estimation of Working Capital Requirements; Management of Inventories;
Management of Receivables; and Management of Cash and Marketable Securities.
05 Sources of Finance: Long Term Sources—Equity, Debt, and Hybrids; Mezzanine 05

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 127

Finance; Sources of Short Term Finance—Trade Credit, Bank Finance, Commercial
Paper; Project Finance.
Capital Structure: Factors Affecting an Entity‘s Capital Structure; Overview of
Capital Structure Theories and Approaches— Net Income Approach, Net Operating
Income Approach; Traditional Approach, and Modigliani-Miller Approach. Relation
between Capital Structure and Corporate Value; Concept of Optimal Capital Structure
Dividend Policy: Meaning and Importance of Dividend Policy; Factors Affecting an
06 Entity‘s Dividend Decision; Overview of Dividend Policy Theories and Approaches— 03
Gordon‘s Approach, Walter‘s Approach, and Modigliani-Miller Approach

Assessment:

Internal Assessment for 20 marks:

Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:

Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions, each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved.

REFERENCES:

1. Fundamentals of Financial Management, 13th Edition (2015) by Eugene F. Brigham and Joel F.
Houston; Publisher: Cengage Publications, New Delhi.
2. Analysis for Financial Management, 10th Edition (2013) by Robert C. Higgins; Publishers: McGraw
Hill Education, New Delhi.
3. Indian Financial System, 9th Edition (2015) by M. Y. Khan; Publisher: McGraw Hill Education, New
Delhi.
4. Financial Management, 11th Edition (2015) by I. M. Pandey; Publisher: S. Chand (G/L) & Company
Limited, New Delhi.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 128

Course Code Course Name Credits
ILO8023 Entrepreneurship Development and Management 03

Objectives:
1. To acquaint with entrepreneurship and management of business
2. Understand Indian environment for entrepreneurship
3. Idea of EDP, MSME

Outcomes: Learner will be able to…

1. Understand the concept of business plan and ownerships
2. Interpret key regulations and legal aspects of entrepreneurship in India
3. Understand government policies for entrepreneurs

Module Detailed Contents Hrs

Overview Of Entrepreneurship: Definitions, Roles and Functions/Values of

Entrepreneurship, History of Entrepreneurship Development, Role of Entrepreneurship
in the National Economy, Functions of an Entrepreneur, Entrepreneurship and Forms of 04
01
Business Ownership
Role of Money and Capital Markets in Entrepreneurial Development: Contribution of
Government Agencies in Sourcing information for Entrepreneurship
Business Plans And Importance Of Capital To Entrepreneurship: Preliminary and
Marketing Plans, Management and Personnel, Start-up Costs and Financing as well as
Projected Financial Statements, Legal Section, Insurance, Suppliers and Risks,
02 Assumptions and Conclusion, Capital and its Importance to the Entrepreneur 09
Entrepreneurship And Business Development: Starting a New Business, Buying an
Existing Business, New Product Development, Business Growth and the Entrepreneur
Law and its Relevance to Business Operations
Women‘s Entrepreneurship Development, Social entrepreneurship-role and need, EDP
03 cell, role of sustainability and sustainable development for SMEs, case studies, 05
exercises
Indian Environment for Entrepreneurship: key regulations and legal aspects ,
MSMED Act 2006 and its implications, schemes and policies of the Ministry of MSME,
role and responsibilities of various government organisations, departments, banks etc., 08
04
Role of State governments in terms of infrastructure developments and support etc.,
Public private partnerships, National Skill development Mission, Credit Guarantee
Fund, PMEGP, discussions, group exercises etc
Effective Management of Business: Issues and problems faced by micro and small
enterprises and effective management of M and S enterprises (risk management, credit 08
05
availability, technology innovation, supply chain management, linkage with large
industries), exercises, e-Marketing
Achieving Success In The Small Business: Stages of the small business life cycle, four
06 types of firm-level growth strategies, Options – harvesting or closing small business 05
Critical Success factors of small business

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 129

Assessment:

Internal Assessment for 20 marks:

Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:

Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions, each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved.

REFERENCES:

1. Poornima Charantimath, Entrepreneurship development- Small Business Enterprise, Pearson

2. Education Robert D Hisrich, Michael P Peters, Dean A Shapherd, Entrepreneurship, latest edition,
The McGrawHill Company
3. Dr TN Chhabra, Entrepreneurship Development, Sun India Publications, New Delhi
4. Dr CN Prasad, Small and Medium Enterprises in Global Perspective, New century Publications,
New Delhi
5. Vasant Desai, Entrepreneurial development and management, Himalaya Publishing House
6. Maddhurima Lall, Shikah Sahai, Entrepreneurship, Excel Books
7. Rashmi Bansal, STAY hungry STAY foolish, CIIE, IIM Ahmedabad
8. Law and Practice relating to Micro, Small and Medium enterprises, Taxmann Publication Ltd.
9. Kurakto, Entrepreneurship- Principles and Practices, Thomson Publication
10. Laghu Udyog Samachar
11. www.msme.gov.in
12. www.dcmesme.gov.in
13. www.msmetraining.gov.in

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 130

Course Code Course Name Credits
ILO8024 Human Resource Management 03

Objectives:
1. To introduce the students with basic concepts, techniques and practices of the human resource
management
2. To provide opportunity of learning Human resource management (HRM) processes, related with the
functions, and challenges in the emerging perspective of today‘s organizations
3. To familiarize the students about the latest developments, trends & different aspects of HRM
4. To acquaint the student with the importance of inter-personal & inter-group behavioural skills in an
organizational setting required for future stable engineers, leaders and managers

Outcomes: Learner will be able to…

1. Understand the concepts, aspects, techniques and practices of the human resource management.
2. Understand the Human resource management (HRM) processes, functions, changes and challenges
in today‘s emerging organizational perspective.
3. Gain knowledge about the latest developments and trends in HRM.
4. Apply the knowledge of behavioural skills learnt and integrate it with in inter personal and
intergroup environment emerging as future stable engineers and managers.

Module Detailed Contents Hrs

Introduction to HR
 Human Resource Management- Concept, Scope and Importance, Interdisciplinary
Approach Relationship with other Sciences, Competencies of HR Manager, HRM
01 functions 5
 Human resource development (HRD): changing role of HRM – Human resource
Planning, Technological change, Restructuring and rightsizing, Empowerment, TQM,
Managing ethical issues
Organizational Behaviour (OB)
 Introduction to OB Origin, Nature and Scope of Organizational Behaviour, Relevance
to Organizational Effectiveness and Contemporary issues
 Personality: Meaning and Determinants of Personality, Personality development,
Personality Types, Assessment of Personality Traits for Increasing Self Awareness
 Perception: Attitude and Value, Effect of perception on Individual Decision-making,
02 Attitude and Behaviour 7
 Motivation: Theories of Motivation and their Applications for Behavioural Change
(Maslow, Herzberg, McGregor);
 Group Behaviour and Group Dynamics: Work groups formal and informal groups and
stages of group development, Team Effectiveness: High performing teams, Team
Roles, cross functional and self-directed team.
 Case study
Organizational Structure &Design
 Structure, size, technology, Environment of organization; Organizational Roles &
conflicts: Concept of roles; role dynamics; role conflicts and stress.
03  Leadership: Concepts and skills of leadership, Leadership and managerial roles, 6
Leadership styles and contemporary issues in leadership.
 Power and Politics: Sources and uses of power; Politics at workplace, Tactics and
strategies.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 131

Human resource Planning
 Recruitment and Selection process, Job-enrichment, Empowerment - Job-Satisfaction,
employee morale
04 5
 Performance Appraisal Systems: Traditional & modern methods, Performance
Counselling, Career Planning
 Training & Development: Identification of Training Needs, Training Methods
Emerging Trends in HR
 Organizational development; Business Process Re-engineering (BPR), BPR as a tool
for organizational development , managing processes & transformation in HR.
Organizational Change, Culture, Environment
05 6
 Cross Cultural Leadership and Decision Making: Cross Cultural Communication and
diversity at work, Causes of diversity, managing diversity with special reference to
handicapped, women and ageing people, intra company cultural difference in
employee motivation
HR & MIS: Need, purpose, objective and role of information system in HR, Applications
in HRD in various industries (e.g. manufacturing R&D, Public Transport, Hospitals,
Hotels and service industries
Strategic HRM: Role of Strategic HRM in the modern business world, Concept of
06 Strategy, Strategic Management Process, Approaches to Strategic Decision Making; 10
Strategic Intent – Corporate Mission, Vision, Objectives and Goals
Labor Laws & Industrial Relations: Evolution of IR, IR issues in organizations,
Overview of Labor Laws in India; Industrial Disputes Act, Trade Unions Act, Shops and
Establishments Act

Internal Assessment for 20 marks:

Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:

Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions, each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved.

REFERENCES:
1. Stephen Robbins, Organizational Behavior, 16th Ed, 2013
2. V S P Rao, Human Resource Management, 3rd Ed, 2010, Excel publishing
3. Aswathapa, Human resource management: Text & cases, 6th edition, 2011
4. C. B. Mamoria and S V Gankar, Dynamics of Industrial Relations in India, 15th Ed, 2015, Himalaya
Publishing, 15thedition, 2015
5. P. Subba Rao, Essentials of Human Resource management and Industrial relations, 5 th Ed, 2013,
Himalaya Publishing
6. Laurie Mullins, Management & Organizational Behavior, Latest Ed, 2016, Pearson Publications

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 132

Course Code Course Name Credits
ILO8025 Professional Ethics and Corporate Social Responsibility (CSR) 03

Objectives:
1. To understand professional ethics in business
2. To recognized corporate social responsibility

Outcomes: Learner will be able to…

1. Understand rights and duties of business
2. Distinguish different aspects of corporate social responsibility
3. Demonstrate professional ethics
4. Understand legal aspects of corporate social responsibility

Module Detailed Contents Hrs

Professional Ethics and Business: The Nature of Business Ethics; Ethical Issues in
01 Business; Moral Responsibility and Blame; Utilitarianism: Weighing Social Costs and 04
Benefits; Rights and Duties of Business
Professional Ethics in the Marketplace: Perfect Competition; Monopoly Competition;
Oligopolistic Competition; Oligopolies and Public Policy 08
02
Professional Ethics and the Environment: Dimensions of Pollution and Resource
Depletion; Ethics of Pollution Control; Ethics of Conserving Depletable Resources
Professional Ethics of Consumer Protection: Markets and Consumer Protection;
Contract View of Business Firm‘s Duties to Consumers; Due Care Theory; Advertising
03 Ethics; Consumer Privacy 06
Professional Ethics of Job Discrimination: Nature of Job Discrimination; Extent of
Discrimination; Reservation of Jobs.
Introduction to Corporate Social Responsibility: Potential Business Benefits—Triple
bottom line, Human resources, Risk management, Supplier relations; Criticisms and 05
04
concerns—Nature of business; Motives; Misdirection.
Trajectory of Corporate Social Responsibility in India
Corporate Social Responsibility: Articulation of Gandhian Trusteeship
05 Corporate Social Responsibility and Small and Medium Enterprises (SMEs) in India, 08
Corporate Social Responsibility and Public-Private Partnership (PPP) in India
Corporate Social Responsibility in Globalizing India: Corporate Social
Responsibility Voluntary Guidelines, 2009 issued by the Ministry of Corporate Affairs, 08
06
Government of India, Legal Aspects of Corporate Social Responsibility—Companies
Act, 2013.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 133

Assessment:

Internal Assessment for 20 marks:

Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:

Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions, each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved.

REFERENCES:

1. Business Ethics: Texts and Cases from the Indian Perspective (2013) by Ananda Das Gupta;
Publisher: Springer.
2. Corporate Social Responsibility: Readings and Cases in a Global Context (2007) by Andrew Crane,
Dirk Matten, Laura Spence; Publisher: Routledge.
3. Business Ethics: Concepts and Cases, 7th Edition (2011) by Manuel G. Velasquez; Publisher:
Pearson, New Delhi.
4. Corporate Social Responsibility in India (2015) by Bidyut Chakrabarty, Routledge, New Delhi.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 134

Course Code Course Name Credits
ILO8026 Research Methodology 03

Objectives:
1. To understand Research and Research Process
2. To acquaint students with identifying problems for research and develop research strategies
3. To familiarize students with the techniques of data collection, analysis of data and interpretation

Outcomes: Learner will be able to…

1. Prepare a preliminary research design for projects in their subject matter areas
2. Accurately collect, analyze and report data
3. Present complex data or situations clearly
4. Review and analyze research findings

Module Detailed Contents Hrs

Introduction and Basic Research Concepts

1.1 Research – Definition; Concept of Construct, Postulate, Proposition, Thesis,
Hypothesis, Law, Principle.Research methods vs Methodology
01 1.2 Need of Research in Business and Social Sciences 09
1.3 Objectives of Research
1.4 Issues and Problems in Research
1.5 Characteristics of Research:Systematic, Valid, Verifiable, Empirical and Critical
Types of Research
2.1. Basic Research
2.2. Applied Research
02 2.3. Descriptive Research 07
2.4. Analytical Research
2.5. Empirical Research
2.6 Qualitative and Quantitative Approaches
Research Design and Sample Design
3.1 Research Design – Meaning, Types and Significance
03 07
3.2 Sample Design – Meaning and Significance Essentials of a good sampling Stages in
Sample Design Sampling methods/techniques Sampling Errors
Research Methodology
4.1 Meaning of Research Methodology
4.2. Stages in Scientific Research Process:
a. Identification and Selection of Research Problem
b. Formulation of Research Problem
c. Review of Literature
04 d. Formulation of Hypothesis 08
e. Formulation of research Design
f. Sample Design
g. Data Collection
h. Data Analysis
i. Hypothesis testing and Interpretation of Data
j. Preparation of Research Report

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 135

Formulating Research Problem
05 5.1 Considerations: Relevance, Interest, Data Availability, Choice of data, Analysis of 04
data, Generalization and Interpretation of analysis
Outcome of Research
6.1 Preparation of the report on conclusion reached
06 04
6.2 Validity Testing & Ethical Issues
6.3 Suggestions and Recommendation

Assessment:

Internal Assessment for 20 marks:

Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:

Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions, each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved.

REFERENCES:

1. Dawson, Catherine, 2002, Practical Research Methods, New Delhi, UBS Publishers Distributors.
2. Kothari, C.R.,1985, Research Methodology-Methods and Techniques, New Delhi, Wiley Eastern
Limited.
3. Kumar, Ranjit, 2005, Research Methodology-A Step-by-Step Guide for Beginners, (2nded),
Singapore, Pearson Education

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 136

Course Code Course Name Credits
ILO8027 IPR and Patenting 03

Objectives:
1. To understand intellectual property rights protection system
2. To promote the knowledge of Intellectual Property Laws of India as well as International treaty
procedures
3. To get acquaintance with Patent search and patent filing procedure and applications

Outcomes: Learner will be able to…

1. understand Intellectual Property assets
2. assist individuals and organizations in capacity building
3. work for development, promotion, protection, compliance, and enforcement of Intellectual Property
and Patenting

Module Detailed Contents Hr

Introduction to Intellectual Property Rights (IPR): Meaning of IPR, Different

category of IPR instruments - Patents, Trademarks,Copyrights, Industrial Designs, Plant
01 variety protection, Geographical indications,Transfer of technology etc. 05
Importance of IPR in Modern Global Economic Environment: Theories of IPR,
Philosophical aspects of IPR laws, Need for IPR, IPR as an instrument of development
Enforcement of Intellectual Property Rights: Introduction, Magnitude of problem,
Factors that create and sustain counterfeiting/piracy, International agreements,
International organizations (e.g. WIPO, WTO) active in IPR enforcement
02 07
Indian Scenario of IPR:Introduction, History of IPR in India, Overview of IP laws in
India, Indian IPR, Administrative Machinery, Major international treaties signed by
India, Procedure for submitting patent and Enforcement of IPR at national level etc.
Emerging Issues in IPR:Challenges for IP in digital economy, e-commerce, human
03 05
genome, biodiversity and traditional knowledge etc.
Basics of Patents: Definition of Patents, Conditions of patentability, Patentable and
non-patentable inventions, Types of patent applications (e.g. Patent of addition etc),
04 Process Patent and Product Patent, Precautions while patenting, Patent specification 07
Patent claims, Disclosures and non-disclosures, Patent rights and infringement, Method
of getting a patent
Patent Rules: Indian patent act, European scenario, US scenario, Australia scenario,
05 Japan scenario, Chinese scenario, Multilateral treaties where India is a member (TRIPS 08
agreement, Paris convention etc.)
Procedure for Filing a Patent (National and International): Legislation and Salient
Features, Patent Search, Drafting and Filing Patent Applications, Processing of patent,
06 Patent Litigation, Patent Publication, Time frame and cost, Patent Licensing, Patent 07
Infringement
Patent databases: Important websites, Searching international databases

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 137

Assessment:

Internal Assessment for 20 marks:

Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:

Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions, each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved.

REFERENCE BOOKS:

1. Rajkumar S. Adukia, 2007, A Handbook on Laws Relating to Intellectual Property Rights in India,
The Institute of Chartered Accountants of India
2. Keayla B K, Patent system and related issues at a glance, Published by National Working Group on
Patent Laws
3. T Sengupta, 2011, Intellectual Property Law in India, Kluwer Law International
4. Tzen Wong and Graham Dutfield, 2010, Intellectual Property and Human Development: Current
Trends and Future Scenario, Cambridge University Press
5. Cornish, William Rodolph & Llewelyn, David. 2010, Intellectual Property: Patents, Copyrights,
Trade Marks and Allied Right, 7th Edition, Sweet & Maxwell
6. Lous Harns, 2012, The enforcement of Intellactual Property Rights: A Case Book, 3rd Edition, WIPO
7. Prabhuddha Ganguli, 2012, Intellectual Property Rights, 1st Edition, TMH
8. R Radha Krishnan & S Balasubramanian, 2012, Intellectual Property Rights, 1st Edition, Excel
Books
9. M Ashok Kumar and mohd Iqbal Ali, 2-11, Intellectual Property Rights, 2nd Edition, Serial
Publications
10. Kompal Bansal and Praishit Bansal, 2012, Fundamentals of IPR for Engineers, 1st Edition, BS
Publications
11. Entrepreneurship Development and IPR Unit, BITS Pilani, 2007, A Manual on Intellectual Property
Rights,
12. Mathew Y Maa, 2009, Fundamentals of Patenting and Licensing for Scientists and Engineers, World
Scientific Publishing Company
13. N S Rathore, S M Mathur, Priti Mathur, Anshul Rathi, IPR: Drafting,Interpretation of Patent
Specifications and Claims, New India Publishing Agency
14. Vivien Irish, 2005, Intellectual Property Rights for Engineers,IET
15. Howard B Rockman, 2004, Intellectual Property Law for Engineers and scientists, Wiley-IEEE
Press.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 138

Course Code Course Name Credits
ILO 8028 Digital Business Management 03

Objectives:
1. To familiarize with digital business concept
2. To acquaint with E-commerce
3. To give insights into E-business and its strategies

Outcomes: The learner will be able to …..

1. Identify drivers of digital business
2. Illustrate various approaches and techniques for E-business and management
3. Prepare E-business plan

Module Detailed content Hours

Introduction to Digital Business-
Introduction, Background and current status, E-market places, structures,
mechanisms, economics and impacts
1 Difference between physical economy and digital economy, 09
Drivers of digital business- Big Data & Analytics, Mobile, Cloud Computing,
Social media, BYOD, and Internet of Things(digitally intelligent machines/services)
Opportunities and Challenges in Digital Business,
Overview of E-Commerce
E-Commerce- Meaning, Retailing in e-commerce-products and services, consumer
behavior, market research and advertisement
B2B-E-commerce-selling and buying in private e-markets, public B2B exchanges
and support services, e-supply chains, Collaborative Commerce, Intra business EC
and Corporate portals
2 06
Other E-C models and applications, innovative EC System-From E-government and
learning to C2C, mobile commerce and pervasive computing
EC Strategy and Implementation-EC strategy and global EC, Economics and
Justification of EC, Using Affiliate marketing to promote your e-commerce
business, Launching a successful online business and EC project, Legal, Ethics and
Societal impacts of EC
Digital Business Support services: ERP as e –business backbone, knowledge Tope
Apps, Information and referral system
3 Application Development: Building Digital business Applications and 06
Infrastructure
Managing E-Business-Managing Knowledge, Management skills for e-business,
Managing Risks in e –business
Security Threats to e-business -Security Overview, Electronic Commerce Threats,
4 Encryption, Cryptography, Public Key and Private Key Cryptography, Digital 06
Signatures, Digital Certificates, Security Protocols over Public Networks: HTTP,
SSL, Firewall as Security Control, Public Key Infrastructure (PKI) for Security,
Prominent Cryptographic Applications
E-Business Strategy-E-business Strategic formulation- Analysis of Company‘s
Internal and external environment, Selection of strategy,
5 04
E-business strategy into Action, challenges and E-Transition
(Process of Digital Transformation)
6 Materializing e-business: From Idea to Realization-Business plan preparation
08
Case Studies and presentations

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 139

Assessment:

Internal Assessment for 20 marks:

Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:

Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions, each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved.

References:

1. A textbook on E-commerce, Er Arunrajan Mishra, Dr W K Sarwade,Neha Publishers & Distributors,

2011
2. E-commerce from vision to fulfilment, Elias M. Awad, PHI-Restricted, 2002
3. Digital Business and E-Commerce Management, 6th Ed, Dave Chaffey, Pearson, August 2014
4. Introduction to E-business-Management and Strategy, Colin Combe, ELSVIER, 2006
5. Digital Business Concepts and Strategy, Eloise Coupey, 2nd Edition, Pearson
6. Trend and Challenges in Digital Business Innovation, VinocenzoMorabito, Springer
7. Digital Business Discourse Erika Darics, April 2015, Palgrave Macmillan
8. E-Governance-Challenges and Opportunities in : Proceedings in 2nd International Conference theory
and practice of Electronic Governance
9. Perspectives the Digital Enterprise –A framework for Transformation, TCS consulting journal Vol.5
10. Measuring Digital Economy-A new perspective- DoI:10.1787/9789264221796-enOECD Publishing

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 140

Course Code Course Name Credits
ILO8029 Environmental Management 03

Objectives:
1. Understand and identify environmental issues relevant to India and global concerns
2. Learn concepts of ecology
3. Familiarise environment related legislations

Outcomes: Learner will be able to…

1. Understand the concept of environmental management
2. Understand ecosystem and interdependence, food chain etc.
3. Understand and interpret environment related legislations

Module Detailed Contents Hrs

Introduction and Definition of Environment: Significance of Environment

01 Management for contemporary managers, Career opportunities, Environmental 10
issues relevant to India, Sustainable Development, the Energy scenario
Global Environmental concerns : Global Warming, Acid Rain, Ozone Depletion,
02 Hazardous Wastes, Endangered life-species, Loss of Biodiversity, Industrial/Man- 06
made disasters, Atomic/Biomedical hazards, etc.
Concepts of Ecology: Ecosystems and interdependence between living organisms, 05
03
habitats, limiting factors, carrying capacity, food chain, etc.
Scope of Environment Management, Role and functions of Government as a
04 planning and regulating agency 10
Environment Quality Management and Corporate Environmental Responsibility
05 Total Quality Environmental Management, ISO-14000, EMS certification. 05
General overview of major legislations like Environment Protection Act, Air (P &
06 CP) Act, Water (P & CP) Act, Wildlife Protection Act, Forest Act, Factories Act, 03
etc.

Assessment:

Internal Assessment for 20 marks:

Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 141

End Semester Examination:
Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions, each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved.

REFERENCES:

1. Environmental Management: Principles and Practice, C J Barrow, Routledge Publishers London,

1999
2. A Handbook of Environmental Management Edited by Jon C. Lovett and David G. Ockwell, Edward
Elgar Publishing
3. Environmental Management V Ramachandra and Vijay Kulkarni, TERI Press
4. Indian Standard Environmental Management Systems — Requirements With Guidance For Use,
Bureau Of Indian Standards, February 2005
5. Environmental Management: An Indian Perspective, S N Chary and Vinod Vyasulu, Maclillan India,
2000
6. Introduction to Environmental Management, Mary K Theodore and Louise Theodore, CRC Press
Environment and Ecology, Majid Hussain, 3rd Ed. Access Publishing.2015

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 142

Lab Code Lab Name Credits

CSL801 Human Machine Interactions Lab 1

Lab Outcome:
1: To design user centric interfaces.
2: To design innovative and user friendly interfaces.
3: To apply HMI in their day-to-day activities.
4: To criticize existing interface designs, and improve them.
5: To Design application for social Task.
6: To Design application for Technical Tasks

Description:

Human Machine Interaction provides the study of user interface and benefit of good design. The design
process gives an idea about how people interact with computer and the problems that they fall, so
understanding the human characteristics is important as this lays the base for a good interface. It enables the
students to apply his/her design skills to develop an appropriate Mobile App or Website. Students also learn
the different types of icon, color and its representation with social and ethical concerns. Students can also
learn the different software tools used to assemble and build user interface along with the different types of
interaction devices and finally try to measure the usability of the application by learning HMI principles.

Suggested List of Experiments:

Sr. No. Title of Experiments

1 Problem representation for Designing User Interface

2 Design a Mobile app/ Website that can teach mathematics to children of 4-5 years age
in schools in Rural /Urban Sector

3 Design a Mobile App/Website that can help people to sell their handmade products in
metro cities

4 ATM machine/KIOSK screen design for rural people.

5 Design a Mobile App/Website to get an experience for passengers whose flight /train
is delayed.

6 Design an UI application for Institute event management.

7 Design of User interface for the system using various interaction styles.

8 Statistical Graphics and its use in visualization

9 Design appropriate icons pertaining to a given domain .(Eg. Greeting cards)

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 143

10 Design a personal website for an Artisan

11 Design a interface for Home appliances

12 Design an interactive data access using Graphics (QR, BAR Code, Image etc) and
generating a print form

13 Redesign of a user interface

(Suggest and implement changes in Existing User Interface

14 Design a navigator for a student new in your Institute.

15 Design a navigator for a person new in tourist city/ village

16 Design UI for Motor paralysis for disabled people.

17 KIOSK design for hospital/school/educational campus/National Institute.

18 To calculate screen complexity of existing Graphical User Interface and redesign the
interface to minimize the screen complexity.

Guidelines:
1. Students are expected to use advanced tools and Technologies towards execution of lab work.
2. Students can work individually or only 2-3 Students can form a team if they wish to work in Group.
3. Case Study and assignments may be linked with CSC801 Syllabus.

Term Work:

Laboratory work will be based on above syllabus with minimum 10(Ten) experiments in line with the above
Lab outcomes to be incorporated with 13(Thirteen) lab session of 2 (two) hours each. The problem statement
can be decided by the instructor in line with the above list of experiments

The distribution of 25 marks for term work shall be as follows:

Lab Performance 15

Mini Project 05

Attendance (Theory & Practical) 05

Oral exam will be based on the above and CSC801:‗HMI Theory‘ Syllabus.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 144

Lab Code Lab Name Credits
CSL802 Distributed Computing Lab 01

Lab Outcome:
1. Develop, test and debug RPC/RMI based client-server programs.
2. Implement the main underlying components of distributed systems (such as IPC, name resolution,
file systems etc.)
3. Implement various techniques of synchronization.
4. Design and implement application programs on distributed systems.

Suggested List of Experiments:

Sr. No. Title of Experiments

1 Client/server using RPC/RMI.
2 Implementation of multi tread application
3 Inter-process communication
4 Group Communication
5 Load Balancing Algorithm.
6 Name Resolution protocol.
7 Election Algorithm.
8 Clock Synchronization algorithms.
9 Mutual Exclusion Algorithm.
10 Deadlock management in Distributed systems
11 Distributed File System
12 CORBA

Term Work:
Laboratory work will be based on above syllabus with minimum 10 experiments to be incorporated.

Laboratory work (experiments): ………………… (15) Marks.

Assignments: …………………………............... (05) Marks.
Attendance (Theory + Practical)…………………… (05) Marks
TOTAL: …………………………………………… (25) Marks.

Oral exam will be based on the above and CSC802 syllabus.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 145

Lab Code Course Name Credits
CSL803 Cloud Computing Lab 2

Lab Objectives: The course will help the learners to get familiar with

1. Key concepts of virtualization.

2. Various deployment models such as private, public, hybrid and community.
3. Various service models such as IaaS and PaaS.
4. Security and Privacy issues in cloud.

Lab Outcomes: On completion of the course learners will be able to

1. Adapt different types of virtualization and increase resource utilization.

2. Build a private cloud using open source technologies.
3. Analyze security issues on cloud.
4. Develop real world web applications and deploy on commercial cloud.
5. Demonstrate various service models.

Module Detailed Contents Hours

01 Title: Study of NIST model of cloud computing. 2
Objective: Understand deployment models, service models, advantages of
cloud computing.
02 Title: Virtualization.
Objective: Understand different types of virtualizations, Host and bare 2
metal hypervisors and implement horizontal scalability.
Technology: XEN/ Vmwares EXSi
03 Title: Infrastructure as a Service. 2
Objective: Implement IaaS using your resources.
Technology: Open Stack / Eucalyptus
04 Title: Identity Management in Cloud 2
Concept: Simulate identity management in your private cloud.
Technology: Open Stack
05 Title: Storage as a Service 2
Objective: Explore Storage as a Service for remote file access using web
interface.
Technology: ownCloud
06 Title: Cloud Security 2
Objective: Understand security of web server and data directory.
Technology: ownCloud
07 Title: Platform as a Service 2
Objective: Deploy web applications on commercial cloud.
Technology: Google appEngine/ Windows Azure
08 Title: Amazon Web Service 2
Objective: To create and access VM instances and demonstrate various

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 146

components such as EC2, S3, Simple DB, DynamoDB.
Technology: AWS
09 Title: Software as a Service 2
Objective: Understand on demand application delivery and Virtual desktop
infrastructure.
Technology: Ulteo
10 Title: Case Study on Fog Computing 2
Objective: To have a basic understanding of implementation/applications of
fog computing.
11 Title: Mini Project 6
Objective: Using the concepts studied throughout the semester students
shall be able to
1. Create their private cloud for the institute using the available
resources.
2. Apply security concepts to secure a private cloud.
3. Implement efficient load balancing.
4. Compare various virtualization technologies with given resource.
5. Create cloud applications such as messenger, photo editing website,
your own social media etc.
Note: Evaluators must check if students have used appropriate cloud
computing tools for their projects.

Digital Material
www.openstack.org

Text Books:
1. Enterprise Cloud Computing by Gautam Shroff, Cambridge,2010
2. Cloud Security by Ronald Krutz and Russell Dean Vines, Wiley - India, 2010 ,
3. Getting Started with OwnCloud by Aditya Patawar , Packt Publishing Ltd, 2013

Term Work:

 Term work should consist of at least 6 experiments and a mini project.

 Journal must include at least 2 assignments.
 The final certification and acceptance of term work indicates that performance in laboratory work is
satisfactory and minimum passing marks may be given in term work.
 The distribution of marks for term work shall be as follows:
 Laboratory work (experiments): ………………….. (15) Marks.
 Mini project.................... ………………………… (15) Marks.
 Mini Project Presentation & Report....................... (10) Marks
Assignments............................................................ (05) Marks
 Attendance ……………………………………….....(05) Marks
 TOTAL: ……………………………………………(50) Marks.

Practical and Oral examination will be based on Laboratory work, mini project and above syllabus.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 147

Lab Code Course Name Credits
CSL804 Computational Lab II 1

Lab Outcome: After successful completion of this course student will be able to:
1. Acquire practical knowledge within the chosen area of technology for project development.
2. Identify, discuss and justify the technical aspects of the chosen project with a comprehensive and
systematic approach.

Description:
Design and implementation of any case study/ applications /experiments / mini project based on
departmental level optional courses using modern tools.

Term work:

The distribution of marks for term work shall be as follows:

Lab Experimental Work & mini project : 25

Report/ Documentation/Presentation : 20
Attendance (Theory & Practical) : 05

Practical & Oral examination is to be conducted based on departmental level optional courses by pair of
internal and external examiners appointed by the University of Mumbai.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 148

Course Code Title Credit
CSP805 Major Project- II 6

Objective: The primary objective is to meet the milestone s formed in the overall project plan decided in
Project - I. The idea presented in Project -I should be implemented in Project -II with results, conclusion and
future work. The project will culminate in the production of a thesis by each individual student.

Guidelines:
Project Report Format:
At the end of semester a student need to prepare a project report should be prepared as per the guidelines
issued by the University of Mumbai. Along with project report a CD containing: project documentation,
Implementation code, required utilities, Software‘s and user Manuals need to be attached.

Term Work:
Student has to submit weekly progress report to the internal guide and where as internal guide has to
keep track on the progress of the project and also has to maintain attendance report. This progress report
can be used for awarding term work marks. In case of industry projects, visit by internal guide will be
preferred to get the status of project.

Distribution of marks for term work shall be as follows:

a) Weekly Attendance on Project Day
b) Project work contributions as per objective
c) Project Report (Hard Bound)
d) Term End Presentation (Internal)
The final certification and acceptance of TW ensures the satisfactory performance on the above aspects.

Oral & Practical :

Oral & Practical examination of Project- II should be conducted by Internal and External examiners
approved by University of Mumbai. Students have to give presentation and demonstration on the Project-
II.

University of Mumbai, B. E. (Computer Engineering), Rev. 2016 149