Curriculum 22042024130436

AC: Item No. 4.
40
Date: 26TH July, 2019
UNIVERSITY OF MUMBAI
Bachelor of Engineering
First Year Engineering (Semester I & II), Revised course
(REV- 2019‘C’ Scheme) from Academic Year 2019 – 20
(Common for All Branches of Engineering)

Under
FACULTY OF SCIENCE &TECHNOLOGY
(As per AICTE guidelines with effect from the academic year
2019–2020)
University of Mumbai, First Year Engineering, (Common for all Branches of Engineering) REV2019 ‘C’ Scheme 0/61
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 Science and Technology (in particular Engineering)of University of
Mumbai has taken a lead in incorporating philosophy of outcome based education in the process of curriculum
development.
Faculty 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. 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.
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.
There was a concern that in the present system, the first year syllabus is heavily loaded and it is of utmost
importance that the students entering into the first year of an engineering course should feel at ease by lowering the
burden of syllabus and credits. This is necessary for a student to get accustomed to the new environment of a college
and to create a bonding between the teacher and a student. In this regard, AICTE has provided a model of Induction
Program, which has been accommodated with certain modification and also overall credits proposed by AICTE in
their model curriculum.
The present curriculum will be implemented for First Year of Engineering from the academic year 2019-20.
Subsequently this system will be carried forward for Second Year Engineering in the academic year 2020-21, for
Third Year and Final Year Engineering in the academic years 2021-22, 2022-23, respectively.
Dr. Suresh K. Ukarande

Dean (I/C)
Faculty of Science and Technology
Member, Senate Academic Council
Board of Dean’s, BOEE, RRC
University of Mumbai, Mumbai
Structure for
Student Induction Program

New students enter an institution with diverse thoughts, backgrounds and preparations. It is important to help them
adjust to the new environment and inculcate in them the ethos of the institution with a sense of larger purpose.
The Induction Program is designed to make the newly joined students feel comfortable, sensitize them towards
exploring their academic interests and activities, reducing competition and making them work for excellence,
promote bonding within them, build relations between teachers and students, give a broader view of life, and
building of character.
Its purpose is to make the students feel comfortable in their new environment, open them up, set a healthy daily
routine, create bonding in the batch as well as between faculty and students, develop awareness, sensitivity and
understanding of the self, people around them, society at large, and nature.
Transition from school to university/college life is one of the most challenging events in student’s life. Therefore,
it should be taken seriously, and as something more than the mere orientation program.
The time during the Induction Program is also used to rectify some critical lacunas, for example, English
background, for those students who have deficiency in it.
New students be informed that the Induction is mandatory non-credit course for which a certificate will be issued
by the institution.
At the start of the induction, the incumbents learn about the institutional policies, processes, practices, culture and
values, and their mentor groups are formed. The different activities are:
1. Orientation: In the first session of Induction program learners and parents to be oriented about institute
policies, processes, practices, culture and values. In addition to this, learners will be educated for 1st year
academic program information in terms of academic calendar, Assessment plan, grading information,
university ordinances, rules and regulations related to academics.
2. Mentoring: Mentoring and connecting the students with faculty members is the most important part of
student induction. Mentoring process shall be carried out in small groups, group of 10 students to be formed
and allocate one senior student from 3rd year of same program in which new students have taken admission,
students mentor will continue for two years, till student mentors graduate from the institute. For two (2)
such groups one faculty mentor to be allocated from the same department/program, who will remain the
mentor till those students graduates from the institute. In the second session of Induction program, groups
for mentoring to be formed and student mentors and faculty mentors to be introduced to newly inducted
students. Introduction of mentoring system to be given to new students. Minimum one meeting to be
conducted every month during semesters with students group by faculty mentors. For record keeping
appropriate formats to be developed and information to be updated regularly by faculty mentors.
3. Universal Human Values: Universal Human Values gets the student to explore oneself and experience
the joy of learning, prepares one to stand up to peer pressure and take decisions with courage, be aware of
relationships and be sensitive to others, understand the role of money in life and experience the feeling of
prosperity. Need for character building has been underlined by many thinkers, universal human values
provide the base. Methodology of teaching this content is extremely important. It must not be through do’s
and dont’s, but by getting the students to explore and think by engaging them in a dialogue. It is best taught
through group discussions and real life activities rather than lecturing. The role of group discussions,
however, with clarity of thought of the teachers cannot be over emphasized. It is essential for giving
exposure, guiding thoughts, and realizing values.
4. Proficiency Modules: The induction program period can be used to overcome some critical lacunas that
students might have, for example, English, Mathematics, computer familiarity etc. These should run like
crash courses, so that when normal courses start after the induction program, the student has overcome the
lacunas substantially.
A diagnostic test should be conducted on Day 2 itself. Before the test, the students should be informed that
the test would not affect their grades, branch change, or any aspect of their admission, placement, study,
etc. Purpose of the test is to provide help to those students who need help in English, Mathematics,
Computer proficiency etc. Students having more than 80% marks in their qualifying examination in
respective subjects need not take the diagnostic test. For those below this cut-off, writing the test is
mandatory. Students with weak performance in the test, must attend a non-credit course in Basic English,
Basic Mathematics, and Basic Computer Operation etc. Their attending the course is mandatory. There
would be no separate fee payable for the course. The classes of Basic courses must start from Day 4 at the
latest. Students those who are excluded from basic courses, for them some activity in the domain of creative
arts, cultural and literature to be organised.
5. Physical Activity: Fitness session, yoga classes, lecture(s) on facing world with sportsman spirit, making
young students aware that there is nothing like being failure in the world. The world gives opportunities to
all.
The incoming students must be divided into batches of 50 students maximum, and a qualified coach in
physical education/ faculty member should be attached to each batch. The list of available games, sport, or
physical activities should be announced in orientation program on Day 1. They should be asked to fill their
choice with three preferences, and the game or sport be allotted to them as per their preference. The physical
activity should start from Day 3 onwards, wherein the student learns and plays his assigned game during
the induction program. It is also important that along with his assigned game the student also practises
yoga.
6. Creative Arts, Cultural and Literary Activity: Qualified instructors for arts may be hired on contract
basis and be paid honorarium as per norms of the institute. Daily 90 to 120 minute sessions may be
arranged. The list of available art forms, such as vocal music, instrumental music, folk music, painting,
sketching, dance, group dance, clay modelling, pottery, dramatics, etc. should be announced. They should
be asked to fill their choice with three preferences, and the art form be allotted to them as per their
preference. There should be sufficient number of teachers for each art form. The ratio may be kept as 1
teacher for every 25 students.
A faculty member interested in literary activity should be assigned for organizing the activity. A list of
books which are interesting and educational should be prepared beforehand. Books in Indian languages
must be included and even given priority. Students are losing connection with languages in general and
their own language, in particular. Students should be assigned a book or other smaller reading material.
They should be asked to read and write a critical summary. They should present their summary in front of
their group. A literary group may consist of around 30-40 students. Similarly, debating and public speaking
activity could also be undertaken. If the college can arrange for a drama workshop where a group of students
learn and enact a play it would be very good. Not all the incoming students would do this, but those who
wish may be provided the opportunity. Help may be taken from senior students engaged in such extra-
curricular activities in the college.
7. Familiarisation with Institute and Department: The students admitted in a branch would visit their
allotted department or branch. The Head of the department and other associated faculty should address the
new student’s right on Day 2 or so. Arrangements should be made about the meeting/gathering. The parents
of the students should also be welcomed if they accompany their ward. It would be helpful if an alumnus
of the Dept. relates his professional experience related to the field of the study to the incoming students.
8. Lectures /Workshops by Eminent People: Eminent people from all walks of life may be invited to deliver
lectures, namely, from industry, academia, social science (authors, historians), social work, civil society,
alumni etc. be identified and invited to come and address the new students. Motivational lectures about
life, meditation, etc. by Ramakrishna Mission, Art of Living, S-VYASA university, VivekanandKendras,
etc. may be organized. Workshops which rejuvenate or bring relief to students would also be welcome,
such as, Art of Living workshops.
9. Extra-Curricular Activity: Every college has extra-curricular activities. Most of them are student driven.
They are organized by student councils and clubs. The extra-curricular activities going on in the college
should be presented to the new students under the guidance of faculty advisors for such activity. The new
students should be informed about how they can join the activities. Related facilities should be described
to them. Presentation on the activities by the student council should be made.
10. Feedback and Report on the Program: A formal feedback at the end of the program should be collected
from students by their filling a form in writing or online. Besides the above, each group (of 20 students)
should write a report on the Induction Program towards the end of the semester. They would also have to
make a presentation of their report. They should be encouraged to use slides while making a presentation.
Presentation of the report should be made in the language they are comfortable with, without any insistence
that it should be in English. It is more important that they feel comfortable and confident. Each group may
make the presentation through 4-5 of its group members or more. In case, the number of new students in a
college is large, the presentation should be made by each group in front of 4 other groups besides their
own, thus there would be about 100 students (in 5 groups) in the audience in a session. Several such sessions
could run in parallel or serially. In each session, their faculty mentors and student guides, if any, should
also be in the audience. These sessions would tell you how well the program ran, and what the students are
feeling at the end of the program. This would also serve as a grand closure to the program.
A certificate shall be awarded to all the students, upon successful completion of the induction program
based on their report and presentation.
Tentative schedule of 1st Week Induction Program:
Session 1 Orientation program

Day 1
Session 2 Mentoring (group formation and introduction)
Session 3 Diagnostic test (basic English, maths and computer operation)
Day 2 Familiarisation of Department and Institute (Visits to department, laboratory,
Session 4
Library, Examination cell, office etc)
Session 5 Physical Activity ( Yoga, sports etc)
Day 3
Session 6 Universal human values session
Proficiency Modules (Short courses on basic maths, English and computer
Session 7
Day 4 operation etc. for identified students)
Session 8 Physical Activity ( Yoga, sports etc)
Proficiency Modules (Short courses on basic maths, English and computer
Session 9
Day 5 operation etc. for identified students)
Session 10 Creative Arts, Cultural and Literary Activity
A session may be conducted for around 2-3 hours each.
Minimum 12 sessions to be conducted from the following 20 sessions, from 2 nd week to last week of academics,
throughout the semester.
Session 11 Physical Activity ( Yoga, sports etc)- 1

Session 12 Extra-Curricular Activity- 1
Session 13 Physical Activity ( Yoga, sports etc)-2
Session 14 Extra-Curricular Activity- 2
Session 16 Lectures /Workshops by Eminent People- 1
Session 19 Creative Arts, Cultural and Literary Activity- 1
Universal Human Values- 1(Group Discussion among students as per
Session 22
mentoring group on various aspects of life, values, ethics etc.)
Universal Human Values- 2 (Group Discussion among students as per
Session 24
Universal Human Values- 3 (Group Discussion among students as per
Session 26
Session 29 Feedback and Report on the Program- 1
Session 30 Feedback and Report on the Program- 2
For mentoring activity following 4 page format (may be printed as booklet) be adopted by institute
for keeping record in detail of students during 4 year tenure by faculty mentor.
NAME OF INSTITUTE
LOGO OF INSTITUTE Student Mentoring Form
Student's Personal Details
Name : Roll No:
Date of Birth: Male/Female:
Current Address:
Permanent Address:
Mobile No: Email Id:
Father's Name:
Mobile No.: Email ID.:
Mother's Name
Name of The Student Mentor:
Name of The Faculty Mentor:
Designation: Department.:
Student's Attendance Record
Semester Month / Year : Month / Year : Month / Year :
Percentage Signature Percentage Signature Percentage Signature
I
II
III
IV
V
VI
VII
VIII
Student's Academic Performance

Semester Subject IA 2 Prelim End semester Signature
Exam (SGPI)
Performance C N/C C N/C C N/C C N/C
I
Remark
II
Remark
III
Remark
IV
Remark
V
Remark
VI
Remark
VII
Remark
VIII
Remark
Note.:
1. C - Cleared, write percentage or SGPI in Remarks.
2. N/C - write subjects not cleared in Remarks.
3. If students cleared subjects in next academic year kindly circle “N/C” and click On “C”
Student's Co-curricular Activities
Semester Professional Society Internship Papers Published
II
III
IV
VI
VII
VIII
Student Mentor’s Feedback Semester wise

Semester I Semester II Semester III Semester IV
Student's Extra-Curricular Activities
Semester Sports NSS / Social cell Competition / Participation /
Prize / Awards
II
III
IV
VI
VII
VIII
Placement: - Yes / No If yes get following Details:

Company :-
Package :-
Higher Studies.
Exams GRE TOFEL CAT GATE
SCORE
If Admitted:-
University :-
Country :-
Program Structure for First Year Engineering
Semester I & II
(With Effect from 2019-2020)
Semester I
Teaching Scheme
Course Credits Assigned
Course Name (Contact Hours)
Code
Theory Pract. Tut. Theory Pract. Tut. Total
FEC101 Engineering Mathematics-I 3 -- 1* 3 -- 1 4
FEC102 Engineering Physics-I 2 -- 2 -- 2
FEC103 Engineering Chemistry-I 2 -- -- 2 -- -- 2
FEC104 Engineering Mechanics 3 -- -- 3 -- -- 3
FEC105 Basic Electrical Engineering 3 -- -- 3 -- -- 3
FEL101 Engineering Physics-I -- 1 -- -- 0.5 -- 0.5
FEL102 Engineering Chemistry-I -- 1 -- -- 0.5 -- 0.5
FEL103 Engineering Mechanics -- 2 -- -- 1 -- 1
FEL104 Basic Electrical Engineering -- 2 -- -- 1 -- 1
FEL105 Basic Workshop practice-I -- 2 -- -- 1 -- 1
Total 13 08 01 13 04 01 18
Examination Scheme
Theory
Course
Course Name Internal Assessment
Code End Exam. Term Pract.
Total
Sem. Duration Work /oral
Test1 Test 2 Avg. Exam. (in Hrs)
FEC101 Engineering Mathematics-I 20 20 20 80 3 25 -- 125

FEC102 Engineering Physics-I 15 15 15 60 2 -- -- 75
FEC103 Engineering Chemistry-I 15 15 15 60 2 -- -- 75
FEC104 Engineering Mechanics 20 20 20 80 3 -- -- 100
FEC105 Basic Electrical Engineering 20 20 20 80 3 -- -- 100
FEL101 Engineering Physics-I -- -- -- -- -- 25 -- 25
FEL102 Engineering Chemistry-I -- -- -- -- -- 25 -- 25
FEL103 Engineering Mechanics -- -- -- -- -- 25 25 50
FEL104 Basic Electrical Engineering -- -- -- -- -- 25 25 50
FEL105 Basic Workshop practice-I -- -- -- -- -- 50 -- 50
Total -- -- 90 360 -- 175 50 675
* Shall be conducted batch-wise
Semester II
Teaching Scheme
Code
FEC201 Engineering Mathematics-II 3 -- 1* 3 -- 1 4
FEC202 Engineering Physics-II 2 -- -- 2 -- -- 2
FEC203 Engineering Chemistry-II 2 -- -- 2 -- -- 2
FEC204 Engineering Graphics 2 -- -- 2 -- -- 2
FEC205 C programming 2 -- -- 2 -- -- 2
Professional Communication
FEC206 2 -- -- 2 -- -- 2
and Ethics- I
FEL201 Engineering Physics-II -- 1 -- -- 0.5 -- 0.5
FEL202 Engineering Chemistry-II -- 1 -- -- 0.5 -- 0.5
FEL203 Engineering Graphics -- 4 -- -- 2 -- 2
FEL204 C programming -- 2 -- -- 1 -- 1
FEL205 -- 2 -- -- 1 -- 1
and Ethics- I
FEL206 Basic Workshop practice-II -- 2 -- -- 1 -- 1
Total 13 12 01 13 06 01 20
Examination Scheme
Theory
Course
Code End Exam. Term Pract.
Total
FEC201 Engineering Mathematics-II 20 20 20 80 3 25 -- 125

FEC202 Engineering Physics-II 15 15 15 60 2 -- -- 75
FEC203 Engineering Chemistry-II 15 15 15 60 2 -- -- 75
FEC204 Engineering Graphics 15 15 15 60 3 -- -- 75
FEC205 C programming 15 15 15 60 2 -- -- 75
FEC206 10 10 10 40 2 -- -- 50
and Ethics- I
FEL201 Engineering Physics-II -- -- -- -- -- 25 -- 25
FEL202 Engineering Chemistry-II -- -- -- -- -- 25 -- 25
FEL203 Engineering Graphics -- -- -- -- -- 25 50 75
FEL204 C programming -- -- -- -- -- 25 25 50
FEL205 -- -- -- -- -- 25 -- 25
and Ethics- I
FEL206 Basic Workshop practice-II -- -- -- -- -- 50 -- 50
Total -- -- 90 360 -- 200 75 725
* Shall be conducted batch-wise
Teaching Scheme
Code
Theory Pract. Tut. Theory Tut. Pract. Total
Engineering
FEC201 3 -- 1* 3 1 -- 4
Mathematics-I
Examination Scheme
Theory
Course
Course Name Internal Assessment Term Pract.
Code End Exam. Total
Engineering
FEC201 20 20 20 80 3 25 -- 125
Mathematics-I
Course Objectives: The course is aimed

1. to develop the basic Mathematical skills of engineering students that are imperative for effective
understanding of engineering subjects. The topics introduced will serve as basic tools for
specialized studies in many fields of engineering and technology.
2. to provide hands on experience using SCILAB software to handle real life problems.
Course Outcomes: Students will be able to
1. Apply the basic concepts of Complex Numbers and will be able to use it for engineering problems.
2. Apply hyperbolic functions and logarithms in the subjects like electrical circuits, Electromagnetic wave
theory.
3. Apply the basic concepts of partial differentiation of function of several variables and will be able to use
in subjects like Electromagnetic Theory, Heat and Mass Transfer etc.
4. Apply the concept of Maxima, Minima and Successive differentiation and will be able to use it for
optimization and tuning the systems.
5. Apply the concept of Matrices and will be able to use it for solving the KVL and KCL in electrical
networks.
6. Apply the concept of Numerical Methods for solving the engineering problems with the help of SCILAB
software.
Module Detailed Contents Hrs.

Complex Numbers
Pre-requisite:Review of Complex Numbers‐Algebra of Complex Number, Cartesian, polar
and exponential form of complex number.
1.1. Statement of D’Moivre’s Theorem.
01 2
1.2. Expansion of sinnθ, cosnθ in terms of sines and cosines of multiplesof θ and
Expansion of sinnθ, cosnθ in powers of sinθ, cosθ 2
1.3. Powers and Roots of complex number. 2
Hyperbolic function and Logarithm of Complex Numbers

2.1. Circular functions of complex number and Hyperbolic functions. Inverse Circular 4
and Inverse Hyperbolic functions. Separation of real and imaginary parts of all types
02 of Functions.
2.2 Logarithmic functions, Separation of real and Imaginary parts of Logarithmic 2
Functions.
# Self learning topics:Applications of complex number in Electrical circuits.
Partial Differentiation
3.1 Partial Differentiation: Function of several variables, Partial derivatives of first and
higher order. Differentiation of composite function. 3
3.2.Euler’s Theorem on Homogeneous functions with two independent variables (with
03 proof). Deductions from Euler’s Theorem.
3
# Self learning topics:Total differentials,implicit functions, Euler’s Theorem on
Homogeneous functions with three independent variables.
Applications of Partial Differentiation and Successive differentiation.
4.1 Maxima and Minima of a function of two independent variables, Lagrange’s method
of undetermined multipliers with one constraint. 3
04 4.2 Successive differentiation: nth derivative of standard functions. Leibnitz’s Theorem
(without proof) and problems 3
# Self learning topics: Jacobian’s of two and three independent variables (simple
problems)
Matrices
Pre-requisite: Inverse of a matrix, addition, multiplication and transpose of a matrix
5.1.Types of Matrices (symmetric, skew‐ symmetric, Hermitian, Skew Hermitian,
Unitary, Orthogonal Matrices and properties of Matrices). Rank of a Matrix using 4
05
Echelon forms, reduction to normal form and PAQ form.
5.2.System of homogeneous and non –homogeneous equations, their consistency and
solutions. 2
# Self learning topics:Application of inverse of a matrix to coding theory.
Numerical Solutions of Transcendental Equations and System
of Linear Equations and Expansion of Function.
6.1 Solution of Transcendental Equations: Solution by Newton Raphson method
and Regula –Falsi method. 2
6.2 Solution of system of linear algebraic equations, by (1) Gauss Jacobi Iteration
Method, (2) Gauss Seidal Iteration Method. 2
06
6.3 Taylor’s Theorem (Statement only) and Taylor’s series, Maclaurin’s series
(Statement only). Expansion of𝑒 𝑥 sin(x), cos(x), tan(x), sinh(x), cosh(x), tanh(x), 2
log(1+x),sin−1 (𝑥),cos−1(𝑥),tan−1 (𝑥).
# Self learning topics:Indeterminate forms, L‐ Hospital Rule, Gauss Elimination

Method, Gauss Jordan Method.
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 4sub-questions
of 5 marks each 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 hoursas
mentioned in the syllabus.
References:
1. Higher Engineering Mathematics, Dr.B.S.Grewal, Khanna Publication
2. Advanced Engineering Mathematics, Erwin Kreyszig, Wiley EasternLimited, 9thEd.
3. Engineering Mathematics by Srimanta Pal and Subodh,C.Bhunia, Oxford University Press
4. Matrices, Shanti Narayan, .S. Chand publication.
5. Applied Numerical Methods with MATLABfor Engineers and Scientists by Steven Chapra,
McGraw Hill
6. Elementary Linear Algebra with Application by Howard Anton and Christ Rorres. 6th edition.
John Wiley & Sons,INC.
Teaching Scheme
Code
Engineering
FEC102 2 - - 2 - - 2
Physics-I
Examination Scheme
Theory
Course
Code End Exam. Term Pract. Tot
Sem. Duration Work /oral al
Engineering
FEC102 15 15 15 60 2 -- -- 75
Physics-I
Rationale:
Most of the engineering branches are being off-spring of basic sciences where physics is playing a pivotal
role in concept and understanding of foundation of core engineering branches. This syllabus is developed
by keeping in mind, needs of all branches that we offer in University of Mumbai.
The topic distribution is being done in systematic manner and whenever required, prerequisite to the topic
are mentioned for frictionless teaching–learning process. In the distribution of topics, core physics and its
applied form are given priority. At the same time few modules are introduced over emerging trends in the
field of technology.
For the purpose of emphasis on applied part, list of suggestive experiments is added. As per new
guidelines of AICTE, a scope is kept in the syllabus for simulation technique and use of information
technology to supplement laboratory practices. Further, it is ensured that these modules will cover
prerequisites needed for engineering courses to be introduced in higher semesters as core subjects or as
interdisciplinary subjects in respective branches.
Objectives
1. To understand basic physics concepts and founding principles of technology.
2. To develop scientific temperament for scientific observations, recording, and inference drawing
essential for technology studies.
Outcomes: Learners will be able to…

1. Illustrate the fundamentals of quantum mechanics and its application.
2. Explain peculiar properties of crystal structure and apply them in crystallography using X-ray
diffraction techniques.
3. Comprehend the concepts of semiconductor physics and applications of semiconductors in
electronic devices.
4. Employ the concept of interference in thin films in measurements.
5. Discuss the properties of Superconductors and Supercapacitors to apply them in novel
applications.
6. Compare the properties of engineering materials for their current and futuristic frontier
applications.
QUANTUM PHYSICS
01 (Prerequisites : Dual nature of radiation, Photoelectric effect Matter waves-wave 07
nature of particles, de-Broglie relation, Davisson-Germer experiment)
De Broglie hypothesis of matter waves; properties of matter waves; wave packet,
phase velocity and group velocity; Wave function; Physical interpretation of wave
function; Heisenberg uncertainty principle; non existence of electron in nucleus;
Schrodinger’s time dependent wave equation; time independent wave equation;
Particle trapped in one dimensional infinite potential well, Quantum Computing.
CRYSTALLOGRAPHY
(Prerequisites : Crystal Physics (Unit cell, Space lattice, Crystal structure,
Simple Cubic, Body Centered Cubic, Face Centered Cubic, Diamond Structure,
02 Production of X-rays) 03
Miller indices; interplanar spacing; X-ray diffraction and Bragg’s law;
Determination of Crystal structure using Bragg’s diffractometer;
SEMICONDUCTOR PHYSICS
(Prerequisites: Intrinsic and extrinsic semiconductors, Energy bands in
conductors, semiconductors and insulators, Semiconductor diode, I-V
characteristics in forward and reverse bias)
03 Direct & indirect band gap semiconductor; Fermi level; Fermi dirac distribution; 06
Fermi energy level in intrinsic & extrinsic semiconductors; effect of impurity
concentration and temperature on fermi level; mobility, current density; Hall
Effect; Fermi Level diagram for p-n junction (unbiased, forward bias, reverse
bias);
Applications of semiconductors: LED, Zener diode, Photovoltaic cell.
INTERFERENCE IN THIN FILM
(Prerequisites : Wave front and Huygen's principle, reflection and refraction,
Interference by division of wave front, Youngs double slit experiment)
Interference by division of amplitude, Interference in thin film of constant
04 thickness due to reflected and transmitted light; origin of colours in thin film; 06
Wedge shaped film; Newton’s rings.
Applications of interference - Determination of thickness of very thin wire or foil;
determination ofrefractive index of liquid; wavelength of incident light; radius of
curvature of lens; testing of surfaceflatness; Anti-reflecting films and Highly
reflecting film.
SUPERCONDUCTORS AND SUPERCAPACITORS
(Prerequisites : Electric current, flow of electric charges in a metallic conductor,
drift velocity, mobility and their relation with electric current, Ohm's law,
electrical resistance, V-I characteristics (linear and non-linear), electrical
resistivity and conductivity temperature dependence of resistance)
05 02
Superconductors: Critical temperature, critical magnetic field, Meissner’s effect,
Type I and Type II and high Tc superconductors;
Supercapacitors: Principle, construction, materials and applications, comparison
with capacitor and batteries : Energy density, Power density,
ENGINEERING MATERIALS AND APPLICATIONS

(Prerequisites: Paramagnetic materials, diamagnetic materials, ferromagnetic
materials, crystal physics, Conductors and insulators, free charges and bound
charges inside a conductor. Dielectrics and electric polarisation, capacitors and
06 02
capacitance)
Liquid crystals: Nematic, Smectic and cholesteric phases, Liquid crystal display.
Multiferroics : Type I & Type II multiferroics and applications,
Magnetoresistive Oxides: Magnetoresistance, GMR and CMR materials,
introduction to spintronics.
Assessment
Internal Assessment Test
End Semester Examination

In question paper weightage of each module will be proportional to number of respective lecture
hours as mention in the syllabus.
1. Question paper will comprise of 6 questions, each carrying 15 marks.
2. Question number 1 will be compulsory and based on maximum contents of the syllabus
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 other than module 3)
4. Total four questions need to be solved.
References
1. A text book of Engineering Physics-Avadhanulu&Kshirsagar, S. Chand
2. A textbook of Optics - N. Subramanyam and Brijlal, S.Chand
3. Fundamentals of optics by Jenkins and White, McGrawHill
4. Solid State Electronic Devices- B. G. Streetman, Prentice Hall Publisher
5. Modern Engineering Physics – Vasudeva, S.Chand
6. Concepts of Modern Physics- ArtherBeiser, Tata McGraw Hill
7. A Text Book of Engineering Physics, S. O. Pillai, New Age International Publishers.
8. Introduction to Solid State Physics- C. Kittle, John Wiley& Sons publisher
9. Ultracapacitors: The future of energy storage- R.P Deshpande, McGraw Hill
10. Advanced functional materials – AshutoshTiwari, LokmanUzun, Scrivener Publishing LLC.
Teaching Scheme
Code
Engineering
FEC103 02 - - 02 - - 2
Chemistry-I
Examination Scheme
Theory
Course
Engineering
FEC103 15 15 15 60 2 -- -- 75
Chemistry-I
Objectives
1. The concepts developed in this course will aid in quantification as well as understand the
applications of several concepts in Chemistry that have been introduced at the 10 + 2 levels in
schools.

1. Explain the concept of microscopic chemistry in terms of atomic and molecular orbital theory and
relate it to diatomic molecules.
2. Describe the concept of aromaticity and interpret it with relation to specific aromatic systems.
3. Illustrate the knowledge of various types of intermolecular forces and relate it to real gases.
4. Interpret various phase transformations using thermodynamics.
5. Illustrate the knowledge of polymers, fabrication methods, conducting polymers in various
industrial fields.
6. Analyze the quality of water and suggest suitable methods of treatment.
Atomic and Molecular Structure

Atomic orbitals (s,p,d,f) orbital shapes, Electronic Configuration, Molecular
01 orbital theory (MOT), bonding and anti-bonding orbitals, Molecular orbital 04
diagrams of Homonuclear and Heteronuclear diatomic molecules-Be2, O2, CO, NO
their bond order and magnetic properties,
Aromatic systems &their molecular structure

02 02
Define Aromaticity, Huckel’s rule, Structure and bonding of benzene and pyrrole.
Intermolecular Forces & Critical Phenomena
Ionic, dipolar and Vander Waal’s interactions, Equations of state of real gases and 03
03
critical phenomena
Phase Rule-Gibb’s Phase Rule

Statement of Gibbs’ Phase Rule, Terms involved with examples, One Component
04 System (Water), Reduced Phase Rule, Two Component System (Pb- Ag), 05
Advantages and Limitations of Phase Rule.
Numerical problems on Phase Rule.
Polymers
Introduction: Definition- Polymer, polymerization, Properties of Polymers-
Molecular weight (Number average and Weight average), Numerical problems on
05
molecular weight, effect of heat on polymers (glass transition temperature), 05
Viscoelasticity,Conducting Polymers, Classification-Thermoplastic and
Thermosetting polymers; Compounding of plastic, Fabrication of plastic by
Compression, Injection, Transfer and Extrusion moulding, Preparation, properties
and uses of PMMA and Kevlar.
Water
Introduction - Impurities in water, hardness of water- units (no conversions), types
and numerical problems, determination of hardness of water by EDTA method and
06 numerical problems.Softening of water by Ion Exchange process and numerical 05
problems, BOD, COD- definition, significance and Numerical problems. Water
purification-membrane technology- Electrodialysis, Reverse osmosis, and Ultra
filtration.
Assessment

In question paper weightage of each module will be proportional to number of respective lecture
hours as mentioned in the syllabus.
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 other than module 3)
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. Engineering Chemistry – Payal Joshi &Shashank Deep (Oxford University Press)
6. Concise Inorganic Chemistry – J D LEE
7. Essentials of Physical Chemistry—B S BahlArunBahl G D Tuli.
Teaching Scheme
Code
Engineering
FEC104 3 -- -- 3 -- -- 3
Mechanics
Examination Scheme
Theory
Course
Engineering
FEC104 20 20 20 80 3 -- -- 100
Mechanics
Objectives
1. To familiarize the concept of equilibrium and friction
2. To study and analyze motion of moving particles/bodies.

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 analyze the motion by
plotting the relation
5. Illustrate different types of motions and establish Kinematic relations for a rigid body
6. Analyze particles in motion using force and acceleration, work-energy and impulse-
momentum principles
Self-Study/pre-requisites Topics:
Resolution of a forces. Use of trigonometry functions. Parallelogram law of forces. Law of triangle.
Polygon law of forces, Lami’s theorem. Concepts of Vector Algebra.
Uniformly accelerated motion along straight line, motion under gravity, projectile motion, Time of
flight, Horizontal range, Maximum height of a projectile.
Law of conservation of Energy, Law of conservation of Momentum, Collision of Elastic Bodies.

1.1 System of Coplanar Forces:
Classification of force systems, Principle of transmissibility, composition and
resolution of forces.
1.2 Resultant: 06
Resultant of coplanar and Non Coplanar (Space Force) force system (Concurrent
01
forces, parallel forces and non-concurrent Non-parallel system of forces).
Moment of force about a point, Couples, Varignon’s Theorem. Force couple
system. Distributed Forces in plane.
Centroid: First moment of Area, Centroid of composite plane Laminas 03
2.1 Equilibrium of System of Coplanar Forces:
Conditions of equilibrium for concurrent forces, parallel forces and non- 04
concurrent non- parallel general forces and Couples. Equilibrium of rigid bodies-
free body diagrams.
2.2 Equilibrium of Beams:
02 Types of beams, simple and compound beams, type of supports and reaction: 03
Determination of reactions at supports for various types of loads on beams.
(Excluding problems on internal hinges)
Friction:
Revision of Static Friction, Dynamic/ Kinetic Friction, Coefficient of Friction,
Angle of Friction, Laws of friction. Concept of Cone of friction. 04
03
Equilibrium of bodies on inclined plane. Application to problems involving
wedges and ladders.
Kinematics of Particle:
Motion of particle with variable acceleration. General curvilinear motion.
04 Tangential& Normal component of acceleration, Motion curves (a-t, v-t, s-t 04
curves). Application of concepts of projectile motion and related numerical.
Kinematics of Rigid Body:
Translation, Rotation and General Plane motion of Rigid body. The concept of 03
05 Instantaneous center of rotation (ICR) for the velocity. Location of ICR for 2 link
mechanism. Velocity analysis of rigid body using ICR.
6.1 Kinetics of a Particle:
04
Force and Acceleration: -Introduction to basic concepts, D’Alemberts Principle,
concept of Inertia force, Equations of dynamic equilibrium, Newton’s second law
of motion. (Analysis limited to simple systems only.)
6.2 Kinetics of a Particle: Work and Energy:
Work Energy principle for a particle in motion. Application of Work – Energy 04
06 principle to a system consists of connected masses and Springs.
6.3 Kinetics of a Particle: Impulse and Momentum:
Principle of linear impulse and momentum.
Impact and collision: Law of conservation of momentum, Coefficient of 03
Restitution. Direct Central Impact and Oblique Central Impact. Loss of Kinetic
Energy in collision of inelastic bodies.
Assessment:
approx. 40% syllabus is completed and second class test when additional 35% syllabus is
completed. Duration of each test shall be one hour.

2. 10 percentage of marks will be asked from the self-study topics.
4. Question No: 01 will be compulsory and based on entire syllabus wherein sub-questions
of 2 to 5 marks will be asked.
5. 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 )
6. In question paper weightage of each module will be proportional to number of respective
lecture hrs as mentioned in the syllabus.
References:
1. Engineering Mechanics by R. C.Hibbeler.
2. Engineering Mechanics by Beer &Johnston, Tata McGrawHill
3. Engineering Mechanics by F. L. Singer, Harper& RawPublication
4. Engineering Mechanics by Macklin & Nelson, Tata McGrawHill
5. Engineering Mechanics by ShaumSeries
6. Engineering Mechanics by A K Tayal, UmeshPublication.
7. Engineering Mechanics by Kumar, Tata McGrawHill
8. Engineering Mechanics (Statics) by Meriam and Kraige, WileyBools
9. Engineering Mechanics (Dynamics) by Meriam and Kraige, WileyBools
Teaching Scheme
Code
Basic Electrical
FEC105 3 -- -- 3 -- -- 3
Engineering
Examination Scheme
Theory
Course
Basic Electrical
FEC105 20 20 20 80 3 -- -- 100
Engineering
Objectives
1. To provide knowledge on fundamentals of D.C. circuits and single phase and three phase AC
circuits and its applications.
2. To inculcate knowledge on the basic operation and performance of 1-Φ transformer.
3. To provide knowledge on fundamentals of DC and AC machines.
Outcomes: Learner will be able to…
1. Apply various network theorems to determine the circuit response / behavior.
2. Evaluate and analyze 1-Φ circuits.
3. Evaluate and analyze 3-Φ AC circuits.
4. Understand the constructional features and operation of 1-Φ transformer.
5. Illustrate the working principle of 3-Φ machine.
6. Illustrate the working principle of 1-Φ machines.

Resistance, inductance, capacitance, series and parallel connections of resistance,
concepts of voltage, current, power and energy and its units. Working of wattmeter,
Prereq
Magnetic circuits, MMF, Magnetic field strength, reluctance, series and parallel --
uisite
magnetic circuits, BH Curve, Time domain analysis of first order RL and RC
circuits
DC Circuits: (Only independent source) Kirchhoff’s Laws, Ideal and practical
Voltage and current Sources, Source Transformation, Mesh and Nodal Analysis,
12
01 Star-Delta / Delta-Star Transformations, Superposition, Thevenin’s Theorem,
Norton’s Theorem and Maximum Power Transfer Theorem.
AC Circuits :Generation of alternating voltage, basic definitions, average and r.m.s

values, phasor and phase difference, sums on phasors, Single-phase ac series and
parallel circuits consisting of R, L, C, RL, RC, RLC combinations, definitions - 10
02
real, reactive and apparent power, admittance (Y), Series and parallel resonance,
Q factor
Generation of Three-Phase Voltages, voltage & current relationships in Star and

03 Delta Connections, power measurement in three phase balanced circuit(Only two 04
wattmeter method).
Transformers: Working principle of single-phase transformer, EMF equation of a
transformer, Transformer losses, Actual (practical) and ideal transformer, Phasor
04 06
diagram (considering winding resistance and magnetic leakage), Equivalent circuit,
Open-circuit test (no-load test), short circuit (SC) test, efficiency.
Electrical Machines (Numerical not expected): Rotating magnetic field produced

05 by three phase ac, principle of operation of Three-phase induction motor, 02
constructional details and classification of Induction machines.
Principle of operation of Single-Phase induction motors, stepper motor (Single
06 02
stack variable reluctance and permanent magnet) (Numerical not expected)
Principle of operation of DC generators and DC motors, constructional details and
Self-
classification of DC machines, e.m.f equation of generator/motor, applications.
study --
(Theory question can be asked in University exam, no numericals. The percentage
Topic
of marks allotted should be maximum of 10% (max. 08marks))
Assessment:
approx. 40% syllabus is completed and second class test when additional 35% syllabus is

1. Question paper will comprise of total 06 questions, each carrying 20marks.
2. Total 04 questions need to besolved.
3. Question No: 01 will be compulsory and based on entire syllabus wherein sub-
questions of 2 to 5 marks will beasked.
4. Remaining questions will be mixed in nature.( e.g. Suppose Q.2 has part (a) from
module3 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 thesyllabus.
Text Books:
1. V. N. Mittal and Arvind Mittal “Basic Electrical Engineering” Tata McGraw Hill, (Revised
Edition)
2. Vincent Del Toro “Electrical Engineering Fundamentals”, PHI Second edition, 2011
3. Edward Hughes “Hughes Electrical and Electronic Technology”, Pearson Education (Tenth
edition)
4. D P Kothari and I J Nagrath “Theory and Problems of Basic Electrical Engineering”, PHI 13th
edition 2011.
5. M. Naidu,S. Kamakshaiah “Introduction to Electrical Engineering” McGraw-Hill Education,
2004
6. B.R Patil “Basic Electrical Engineering” Oxford Higher Education
References:
1. B.L.Theraja “Electrical Engineering “ Vol-I and II.
2. S.N.Singh, “Basic Electrical Engineering” PHI , 2011Book
Teaching Scheme
Code
Engineering
FEL101 - 01 - - - 0.5 0.5
Physics-I
Examination Scheme
Theory
Course
Engineering
FEL101 -- -- -- -- -- 25 -- 25
Physics-I
Objectives
1. To improve the knowledge about the theory learned in the class.
2. To improve ability to analyze experimental result and write laboratory report.

1. Perform the experiments based on interference in thin films and analyze the results.
2. Verify the theory learned in the module crystallography.
3. Perform the experiments on various semiconductor devices and analyze their
characteristics.
4. Perform simulation study on engineering materials.
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. Study of Miller Indices.
4. Study of Hall Effect.
5. Determination of energy band gap of semiconductor.
6. Study of Zener diode as voltage regulator.
7. Study of I/V characteristics of LED
8. Determination of ‘h’ using Photo cell.
9. Study of I / V characteristics of semiconductor diode
10. Charging and discharging characteristics of supercapacitor.
11. Simulation study of orientational ordering in Nematic like 2D liquid crystal.
12. Simulation experiments based on engineering materials using open source simulation
softwares like Avogadro, Chimera, JMOL etc.
The distribution of marks for term work shall be as follows:

 Laboratory work (Experiments and Journal) : 10 marks
 Project Groupwise (Topic Presentation) : 10 marks
 Attendance (Theory and Tutorial) : 05 marks
The final certification and acceptance of TW ensures the satisfactory performance of laboratory
work and minimum passing in the TW.
Teaching Scheme
Code
Engineering
FEL102 - 01 - - - 0.5 0.5
Chemistry-I
Examination Scheme
Theory
Course
Engineering
FEL102 -- -- -- -- -- 25 -- 25
Chemistry-I

1. Determine Chloride content and hardness of water sample
2. Determine free acid ph of different solutions
3. Determine metal ion concentration
4. Synthesize polymers, biodegradable plastics.
5. Determine Viscosity of oil
Suggested Experiments:
1. To determine Chloride content of water by Mohr’s Method.
2. To determine total, temporary and permanent hardness of water sample by EDTA
method.
3. To determine free acid pH of different solutions using pH meter
4. To determine metal ion concentration using colorimeter.
5. Removal of hardness using ion exchange column.
6. Molecular weight determination of polymers by Oswald Viscometer.
7. Synthesis of UF, PF, Nylon 66.
8. Determination of COD
9. Synthesis of biodegradable polymer using corn starch or potato starch
10. Determination of Viscosity of oil by Redwood Viscometer
Term work:
Term Work shall consist of minimum five experiments.

 Assignments and Viva on practicals : 10 marks
work and minimum
Teaching Scheme
Code
Engineering
FEL103 -- 2 -- -- -- 1 1
Mechanics
Examination Scheme
Theory
Course
Engineering
FEL103 -- -- -- -- -- 25 25 50
Mechanics
Objectives
1. To acquaint the concept of equilibrium in two and three dimensional system.
2. To study and analyse motion of moving particles/bodies.

1. Verify equations of equilibrium of coplanar force system
2. Verify law of moments.
3. Determine the centroid of plane lamina.
4. Evaluate co-efficient of friction between the different surfaces in contact.
5. Demonstrate the types of collision/impact and determine corresponding coefficient of
restitution.
6. Differentiate the kinematics and kinetics of a particle.
List of Experiments:
Minimum six experiments from the following list of which minimum one should from
dynamics.
1. Verification of Polygon law of coplanar forces

2. Verification of Principle of Moments (Bell crank lever.)
3. Determination of support reactions of a Simply Supported Beam.
4. Determination of coefficient of friction) using inclined plane
5. Verification of the equations of equilibrium for Non-concurrent non-parallel (General)
force system.
6. Collision of elastic bodies (Law of conservation of momentum).
7. Kinematics of particles. (Uniform motion of a particle, Projectile motion, motion under
gravity)
8. Kinetics of particles. (collision of bodies)
Minimum
Sr
No. Assignments to be completed during Practical Session. Number of
Numerical
1 Resultant of Coplanar force system 4
2 Resultant of Non-Coplanar force system 3
3 Centroid of Composite plane Laminas 4
4 Equilibrium of System of Coplanar Forces 4
5 Beam Reaction 4
Equilibrium of bodies on inclined plane and problems involving wedges and
6 4
ladders.
Kinematics of particles (Variable acceleration + Motion Curves +Projectile
7 motion) 4
Kinetics of particles (D’Alemberts Principle, Work Energy Principle, Impulse

8 5
momentum Principle, Impact and Collisions.)
Assessment:
Term Work: It comprises Laboratory Experiments and Assignments.
 Practical Work and Journal : 10 marks.
 Assignments : 10 marks.
 Attendance : 05 Marks
End Semester Examination:

Pair of Internal and External Examiner should conduct Oral examination based on entire
syllabus.
Teaching Scheme
Code
Basic Electrical
FEL104 -- 2 -- -- -- 1 1
Engineering
Examination Scheme
Theory
Course
Basic Electrical
FEL104 -- -- -- -- -- 25 25 50
Engineering
Objectives
1. To impart the basic concept of network analysis and its application.
2. To provide the basic concept of ac circuits analysis and its application.
3. To illustrate the operation of machines and transformer.

1. Interpret and analyse the behaviour of DC circuits using network theorems.
2. Perform and infer experiment on single phase AC circuits.
3. Demonstrate experiment on three phase AC circuits.
4. Illustrate the performance of single phase transformer and machines.
Suggested List of laboratory experiments (Minimum Eight):

Also minimum two experiments from each course outcome shall be covered
1. Basic safety precautions. Introduction and use of measuring instruments – voltmeter,

ammeter, multi-meter, oscilloscope. Real-life resistors, capacitors and inductors.
2. To measure output voltage across load resistor/current through load resistor and verify the
result using Mesh and Nodal analysis.
3. Verification of Superposition Theorem.
4. Verification Thevenin’s Theorem.
5. Verification Norton’s Theorem.
6. Verification Maximum Power Transfer Theorem.
7. To find the resistance and inductance of a coil connected in series with a pure resistance
using three voltmeter method.
8. To find the resistance and inductance of a coil connected in parallel with a pure resistance
using three ammeter method.
9. To find resonance conditions in a R-L-C series resonance circuit
10. To find resonance conditions in a R-L-C parallel resonance circuit.
11. To measure relationship between phase and line, currents and voltages in three phase
system (star & delta)
12. To measure Power and phase in three phase system by two wattmeter method.
13. To find the equivalent circuit parameters by conducting OC and SC test on single phase
transformer
14. To demonstrate cut-out sections of DC machine.
15. To demonstrate cut-out sections of single phase transformer.
Term Work:It comprises both part a and b
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.
 Laboratory work (Experiment/journal) : 10 marks.
 Assignments : 10marks.
 Attendance (Theory and Practical) : 05Marks

Pair of Internal and External Examiner should conduct Oral examination based on entire
syllabus.
Teaching Scheme
Code
Basic Workshop
FEL105 -- 2 -- -- -- 1 1
Practice-I
Examination Scheme
Theory
Course
Basic Workshop
FEL105 -- -- -- -- -- 50 -- 50
Practice-I
Objectives
1. To impart training to help the students develop engineering skill sets.
2. To inculcate respect for physical work and hard labor.
3. To get exposure to interdisciplinary engineering domain.

1. Develop the necessary skill required to handle/use different fitting tools.
2. Develop skill required for hardware maintenance.
3. Able to install an operating system and system drives.
4. Able to identify the network components and perform basic networking and crimping.
5. Able to prepare the edges of jobs and do simple arc welding.
6. Develop the necessary skill required to handle/use different plumping tools.
7. Demonstrate the turning operation with the help of a simple job.
Detailed Content Hrs.
Note:
Trade 1 and 2 are compulsory. Select any ONE trade topics out of the topic at trade 3 to 5.
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
CO-1 is related to Trade-1
CO-2 to CO-4 is related to Trade-2
CO evaluation is to be done according to the opted Trades in addition to Compulsory Trades.
Fitting (Compulsory):
 Use and setting of fitting tools for chipping, cutting, filing, marking,
Trade-1 center punching, drilling, tapping. 10
 Term work to include one job involving following operations : filing to
size, one simple male- female joint, drilling and tapping
Hardware and Networking: (Compulsory)
 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. 
Trade-2 Assembling of PC, Installation of Operating System (Any one) and 08
Device drivers, Boot-up sequence. Installation of application software (at
least one)  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
Welding:
Trade-3  Edge preparation for welding jobs. Arc welding for different job like, 06
Lap welding of two plates, butt welding of plates with simple cover, arc
welding to join plates at right angles.
Plumbing:
Trade 4  Use of plumbing tools, spanners, wrenches, threading dies, 06
demonstration of preparation of a domestic line involving fixing of a
water tap and use of coupling, elbow, tee, and union etc.
Machine Shop:
Trade-5  At least one turning job is to be demonstrated and simple job to be made 06
for Term Work in a group of 4 students.
Teaching Scheme
Code
Engineering
FEC201 3 -- 1* 3 1 -- 4
Mathematics-II
Examination Scheme
Theory
Course
Engineering
FEC201 20 20 20 80 3 25 -- 125
Mathematics-II
Course Objectives
1. The course is aimed to develop the basic Mathematical skills of engineering students
that are imperative for effective understanding of engineering subjects. The topics
introduced will serve as basic tools for specialized studies in many fields of
engineering and technology.
2. To provide hands on experience in using SCILAB software to handle real life
problems.
Course Outcomes: Students will be able to…

1. Apply the concepts of First Order and first degree Differential equation to the
problems in the field of engineering.
2. Apply the concepts of Higher Order Linear Differential equation to the engineering
problems.
3. Apply concepts of Beta and Gamma function to solve improper integrals.
4. Apply concepts of Double integral of different coordinate systems to the engineering
problems like area and mass.
5. Apply concepts of triple integral of different coordinate systems to the engineering
problems and problems based on volume of solids.
6. Solve differential equations and integrations numerically using SCILAB software to
experimental aspect of applied mathematics.

Differential Equations of First Order and First Degree
2.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. 2
# Self learning topics:Simple application of differential equation of first order and first
degree to electricaland Mechanical Engineering problem
Linear Differential Equations With Constant Coefficients and Variable Coefficients
Of Higher Order
2.1. Linear Differential Equation with constant coefficient‐ complementary function,
4
02 particular integrals of differential equation of the type f(D)y = X where X is 𝑒 𝑎𝑥 ,
sin(𝑎𝑥 + 𝑏) , cos (𝑎𝑥 + 𝑏), 𝑥 𝑛 , 𝑒 𝑎𝑥 𝑉, 𝑥 𝑉.
2
2.2. Method of variation of parameters.
# Self learning topics: Cauchy’s homogeneous linear differential equation and Legendre’s
differential equation, Applications of Higher order differential equation.
Beta and Gamma Function, Differentiation under Integral sign and Rectification
Pre-requisite:Tracing of curves
3.1 Beta and Gamma functions and its properties. 2
03 3.2 Differentiation under integral sign with constant limits of integration. 2
3.3 Rectification of plane curves.(Cartesian and polar) 2
# Self learning topics:Rectification of curve in parametric co-ordinates.
Multiple Integration-1
4.1. Double integration‐definition, Evaluation of Double Integrals.(Cartesian & Polar) 2
4.2. Evaluation of double integrals by changing the order of integration. 2
04 2
4.3. Evaluation of integrals over the given region.(Cartesian & Polar)
# Self learning topics:Application of double integrals to compute Area, Mass.

Multiple Integration-2
5.1. Evaluation of double integrals by changing to polar coordinates. 2
5.2. Application of double integrals to compute Area 2
05 5.3.Triple integration definition and evaluation (Cartesian, cylindrical and spherical polar
coordinates). 2
# Self learning topics: Application of triple integral to compute volume.
Numerical solution of ordinary differential equations of first order and first degree,
and , Numerical Integration
6.1. Numerical solution of ordinary differential equation using (a) Euler’s method
06 (b) Modified Euler method, (c) Runge‐Kutta fourth order method 3
6.2. Numerical integration‐ by (a) Trapezoidal (b) Simpson’s 1/3rd (c) Simpson’s 3/8th rule
(all with proof). 3
# Self learning topics:Numerical solution of ordinary differential equation using Taylor
series method.
Term Work:
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) Euler Method, (ii) Modified Euler Method, (iii)
Runge-Kutta Method of fourth order , (iv) Trapezoidal Rule , (v) Simpson’s 1/3rd Rule
(vi) Simpson’s 3/8th rule
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:

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.

3. Question No: 01 will be compulsory and based on entire syllabus wherein 4 sub-
questions of 5 marks each 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
References:
1. Higher Engineering Mathematics, Dr.B.S.Grewal, Khanna Publication
2. Advanced Engineering Mathematics, Erwin Kreyszig, Wiley EasternLimited, 9thEd.
3. Engineering Mathematics by Srimanta Pal and SubodhBhunia, Oxford University
Press
4. Applied Numerical Methods with MATLABfor Engineers and Scientists by Steven
Chapra, McGraw Hill
5. Elementary Linear Algebra with Application by Howard Anton and Christ Rorres. 6th edition.
6. John Wiley & Sons,INC.
Teaching Scheme
Code
Engineering
FEC202 2 -- -- 2 -- -- 2
Physics-II
Examination Scheme
Theory
Course
Engineering
FEC202 15 15 15 60 2 -- -- 75
Physics-II
Rationale:
Most of the engineering branches are being off-spring of basic sciences where physics is playing
a pivotal role in concept and understanding of foundation of core engineering branches. This
syllabus is developed by keeping in mind, needs of all branches that we offer in University of
Mumbai.
The topic distribution is being done in systematic manner and whenever required, prerequisite to
the topic are mentioned for frictionless teaching–learning process. In the distribution of topics,
core physics and its applied form are given priority. At the same time few modules are introduced
over emerging trends in the field of technology.
For the purpose of emphasis on applied part, list of suggestive experiments is added. As per new
guidelines of AICTE, a scope is kept in the syllabus for simulation technique and use of
information technology to supplement laboratory practices. Further, it is ensured that these
modules will cover prerequisites needed for engineering courses to be introduced in higher
semesters as core subjects or as interdisciplinary subjects in respective branches.
Objectives
1. To give exposure to the topics of fundamental physics in the area of electrodynamics and
relativity.
2. To give exposure to fundamentals of physics related with current technology in the field
of Nanotechnology and Physics of Sensor Technology.

1. Describe the diffraction through slits and its applications.
2. Apply the foundation of laser and fiber optics in development of modern communication
technology.
3. Relate the basics of electrodynamics which is prerequisite for satellite communications,
antenna theory etc.
4. Explain the fundamentals of relativity.
5. Assimilate the wide scope of nanotechnology in modern developments and its role in
emerging innovating applications.
6. Interpret and explore basic sensing techniques for physical measurements in modern
instrumentations.

DIFFRACTION
(Prerequisites : Wave front and Huygen's principle, reflection and refraction,
01 04
diffraction, Fresnel diffraction and Fraunhoffer diffraction)
Diffraction: Fraunhoffer diffraction at single slit, Diffraction Grating, Resolving
power of a grating; Applications of diffraction grating; Determination of
wavelength of light using plane transmission grating
LASER AND FIBRE OPTICS
(Prerequisites: Absorption, recombination, energy bands of p-n junction,
refractive index of a material, Snell’s law)
Laser: spontaneous emission and stimulated emission; metastable state,
population inversion, types of pumping, resonant cavity, Einsteins’s equations;
02 Helium Neon laser; Nd:YAG laser; Semiconductor laser, 06
Applications of laser- Holography
Fibre optics: Numerical Aperture for step index fibre; critical angle; angle of
acceptance; V number; number of modes of propagation; types of optical
fibres; Fibre optic communication system;
ELECTRODYNAMICS
(Prerequisites : Electric Charges, Coulomb's law-force between two point
charges, Electric field, electric field due to a point charge, electric field lines,
electric dipole, electric field due to a dipole, Gauss's law, Faraday’s law)
03 05
Scalar and Vector field, Physical significance of gradient, curl and divergence in
Cartesian co-ordinate system, Gauss’s law for electrostatics, Gauss’s law for
magnetostatics, Faraday’s Law and Ampere’s circuital law; Maxwell’s equations
(Free space and time varying fields).
RELATIVITY
(Prerequisites: Cartesian co-ordinate system)
04 Special theory of Relativity: Inertial and Non-inertial Frames of reference, 02
Galilean transformations, Lorentz transformations (space – time coordinates),
Time Dilation, Length Contraction and Mass-Energy relation.
NANOTECHNOLOGY
(Prerequisites : Scattering of electrons, Tunneling effect, Electrostatic focusing,
magneto static focusing)
Nanomaterials : Properties (Optical, electrical, magnetic, structural, mechanical)
and applications, Surface to volume ratio; Two main approaches in
05 nanotechnology -Bottom up technique and Top down technique; 04
Tools for characterization of Nanoparticles: Scanning Electron Microscope
(SEM), Transmission Electron Microscope (TEM), Atomic Force Microscope
(AFM).
Methods to synthesize Nanomaterials: Ball milling, Sputtering, Vapour
deposition, Solgel
PHYSICS OF SENSORS
(Prerequisites : Transducer concept, meaning of calibration, piezoelectric effect)
Resistive sensors:
a) Temperature measurement: PT100 construction, calibration,
b) Humidity measurement using resistive sensors,
Pressure sensor: Concept of pressure sensing by capacitive, flex and inductive
method, Analog pressure sensor: construction working and calibration and
06 05
applications.
Piezoelectric transducers: Concept of piezoelectricity, use of piezoelectric
transducer as ultrasonic generator and application of ultrasonic transducer for
distance measurement, liquid and air velocity measurement.
Optical sensor: Photodiode, construction and use of photodiode as ambient light
measurement and flux measurement.
Pyroelectric sensors: Construction and working principle, application of
pyroelectric sensor as bolometer.
Assessment
when approx. 40% syllabus is completed and second class test when additional 35% syllabus is

In question paper weightage of each module will be proportional to number of respective
lecture hours as mention in the syllabus.
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 other than module 3)
References
1. A text book of Engineering Physics-Avadhanulu&Kshirsagar, S.Chand
2. Optics - Ajay Ghatak, Tata McGraw Hill
3. A textbook of Optics - N. Subramanyam and Brijlal, S.Chand
4. Concepts of Modern Physics- ArtherBeiser, Tata Mcgraw Hill
5. Introduction to Electrodynamics- D. J. Griffiths, Pearson publication
6. Introduction to Special Relativity- Robert Resnick, John Wiley and sons
7. Advances In Nano Materials And Applications: History of Nanotechnology From Pre-
Historic to Modern Times, Madhuri Sharon, Wiley, USA
8. Nano: The essentials, understanding Nanoscience and Nanotechnology, T. Pradeep, Tata
McGraw Hill, 2007.
9. Electronic Instrumentation –H.S. Kalsi, Tata McGraw-Hill Education
10. Handbook of Modern Sensors Physics design and application- Jacob Fraden, Springer, AIP
press.
11. Instrumentation & Measurement Techniques by Albert D. Helfrick& William D. Cooper
(PHI) Edition
Teaching Scheme
Code
Engineering
FEC203 2 - - 2 - - 2
Chemistry-II
Examination Scheme
Theory
Course
Engineering
FEC203 15 15 15 60 2 -- -- 75
Chemistry-II
Objectives
The concepts developed in this course will aid in quantification as well as understand the
applications of several concepts in Chemistry that have been introduced at the 10 + 2
levels in schools.

1. Distinguish the ranges of the electromagnetic spectrum used for exciting different
molecular energy levels in various spectroscopic techniques.
2. Illustrate the concept of emission spectroscopy and describe the phenomena of
fluorescence and phosphorescence in relation to it.
3. Explain the concept of electrode potential and nernst theory and relate it to electrochemical
cells.
4. Identify different types of corrosion and suggest control measures in industries.
5. Illustrate the principles of green chemistry and study environmental impact.
6. Explain the knowledge of determining the quality of fuel and quantify the oxygen required
for combustion of fuel.
Principles of Spectroscopy:
Introduction: Principle of spectroscopy, Definition,Origin of spectrum,
01 Classification of spectroscopy – atomic and molecular, selection rules. 02
Table of relation between electromagnetic spectrum, types of spectroscopy and
energy changes.
Applications of Spectroscopy
Emission spectroscopy- Principle, Instrumentation and applications ( Flame
02 Photometry) 04
Introduction to florescence and phosphorescence, Jablonski diagram, application
of fluorescence in medicine only.
Concept of Electrochemistry
Introduction, concept of electrode potential, Nernst equation, types of
03 02
electrochemical cells, concept of standard electrode with examples,
electrochemical series, simplenumericals.
Corrosion:
Definition, Mechanism 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 Corrosion- Galvanic cell corrosion, Concentration cell corrosion
(differential aeration principle), Pitting corrosion, Intergranular corrosion, Stress
04 06
corrosion.
Factors affecting the rate of corrosion- (i)Nature of metal, (ii)Nature of corroding
environment.
Methods of corrosion control- (I)Material selection and proper designing,(II)
Cathodic protection- i) Sacrificial anodic protection ii) Impressed current
method,(III) Metallic coatings- only Cathodic coating (tinning) and anodic
coatings (Galvanising)
Green Chemistry and Synthesis of drugs

Introduction – Definition, significance
Twelve Principles of Green chemistry, numerical on atom economy,
05 04
Conventional and green synthesis of Adipic acid, Indigo, Carbaryl, Ibuprofen,
Benzimidazole, Benzyl alcohol, % atom economy and their numericals.
Green fuel- Biodiesel.
Fuels and Combustion
Definition, classification, characteristics of a good fuel, units of heat (no
conversions).
Calorific value- Definition, Gross or Higher calorific value & Net or lower
calorific value, Dulong’s formula & numerical for calculations of Gross and Net
calorific values.
06 06
Solid fuels- Analysis of coal- Proximate and Ultimate Analysis- numerical
problems and significance.
Liquid fuels- Petrol- Knocking, Octane number, Cetane number, Antiknocking
agents, unleaded petrol, oxygenates (MTBE), catalytic converter.
Combustion- Calculations for requirement of only oxygen and air (by weight and
by volume only) for given solid & gaseous fuels.
Assessment

In question paper weightage of each module will be proportional to number of respective
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 other than module 3)
Recommended Books :
1. Engineering Chemistry - Jain & Jain, DhanpatRai
2. Engineering Chemistry – Dara & Dara, S Chand
3. Green Chemistry: A textbook – V.K.Ahluwalia, Alpha Science International
4. Fundamentals of Molecular Spectroscopy ( 4th Edition) - C.N.Banwell, Elaine M.
McCash,
Tata McGraw Hill.
5. Elementary Organic Spectroscopy- Y.R.Sharma, S.Chand and Co.
6. A Text Book of Engineering Chemistry - ShashiChawla, DhanpatRai
7. Engineering Chemistry – Payal Joshi &Shashank Deep (Oxford University Press)
Teaching Scheme
Code
Engineering
FEC204 2 -- -- 2 -- -- 2
Graphics
Examination Scheme
Theory
Course
Engineering
FEC204 15 15 15 60 3 -- -- 75
Graphics
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.
1. Apply the basic principles of projections in Projection of Lines and Planes
2. Apply the basic principles of projections in Projection of Solids.
3. Apply the basic principles of sectional views in Section of solids.
4. Apply the basic principles of projections in converting 3D view to 2D drawing.
5. Read a given drawing.
6. Visualize an object from the given two views.

Introduction to Engineering Graphics
Principles of Engineering Graphics and their significance, usage of Drawing
instruments, Types of Lines, Dimensioning Systems as per IS conventions.
01 Introduction to plain and diagonal scales.
2
Engineering Curves
Basic construction of Cycloid, Involutes and Helix (of cylinder) only.
Projection of Points and Lines

Lines inclined to both the Reference Planes (Excluding Traces of lines) and
simple application based problems on Projection of lines.
02 5
@ Projection of Planes
Triangular, Square, Rectangular, Pentagonal, Hexagonal andCircular planes
inclined to either HP or VP only. (Exclude composite planes).
Projection of Solids
(Prism, Pyramid, Cylinder, Cone only) Solid projection with the axis inclined to
03 HP and VP. (Exclude Spheres, Composite, Hollow solids and frustum of solids). 5
Use change of position or Auxiliary plane method
Section of Solids
Section of Prism, Pyramid, Cylinder, & Cone cut by plane perpendicular to at
04 least one reference plane (Exclude Curved Section Plane). Use change of 5
position or Auxiliary plane method.
#Orthographic and Sectional Orthographic Projections: - Fundamentals of
orthographic projections. Different views of a simple machine part as per the first
05 3
angle projection methodrecommended by I.S. Full or Half Sectional views of the
Simple Machine parts.
#@ Missing Views:The identification of missing views from the given views.

06 Create the third view from the two available views so that all the details of the 1
object are obtained.
#Isometric Views:- Principles of Isometric projection – Isometric Scale,

07 Isometric Views, Conversion of Orthographic Views to Isometric 3
Views(Excluding Sphere ).
@ only in Term Work ( i.e; Questions will not be asked for any examination.)
# more problems should be discussed during practical hours to strengthen the concepts.
Assessment:
Assessment consists of two class tests of 15 marks each.
Among the two tests One is Conventional (manual drawing) and Second using CAD
software.

2. Any 4 questions need to be solved. There won’t be any compulsory Question
4. Remaining questions will be mixed in nature.( e.g. Suppose Q.2 has part (a)
from module3 then part (b) will be from any module other than module 3)
respective lecture hrs as mentioned in thesyllabus.
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.
Reference Books
3. Narayana, K.L. & P Kannaiah (2008), Text book on Engineering Drawing, Scitech
Publisher.
4. Prof. Sham Tickoo (Purdue University) &GauravVerma, "( CAD Soft Technologies) :
Auto CAD 2012 (For engineers and Designers)", Dreamtech Press NewDelhi.
5. Dhananjay A Jolhe, "Engineering Drawing" Tata McGraw Hill.
Teaching Scheme
Code
FEC205 C Programming 2 -- -- 2 -- -- 2
Examination Scheme
Theory
Course
FEC205 C Programming 15 15 15 60 2 -- -- 75
Objectives
To provide exposure to problem-solving by developing an algorithm, flowchart and
implement the logic using C programming language.

1. Formulate simple algorithms for arithmetic, logical problems and translate them to
programs in C language
2. Implement, test and execute programs comprising of control structures.
3. Decompose a problem into functions and synthesize a complete program.
4. Demonstrate the use of arrays, strings and structures in C language.
5. Understand the concept of pointers

Introduction
● Introduction to components of a Computer System
● Introduction to Algorithm and Flowchart
Fundamentals of C Programming
1 ● Keywords, Identifiers, Constants and Variables 5
● Data types in C
● Operators in C
● Basic Input and Output Operations
● Expressions and Precedence of Operators
● In-built Functions
Control Structures
● Introduction to Control Structures
Branching and looping structures
2 ● If statement, If-else statement, Nested if-else, else-if Ladder 7
● Switch statement
● For loop, While loop, Do while loop
● break and continue
Functions
● Introduction to functions
● Function prototype, Function definition, Accessing a function and
3 4
parameter passing.
● Recursion.
Arrays and Strings
● Introduction to Arrays
4 ● Declaration and initialization of one dimensional and two-dimensional 4
arrays.
● Definition and initialization of String
● String functions
Structure and Union
● Concept of Structure and Union
● Declaration and Initialization of structure and union
5 4
● Nested structures
● Array of Structures
● Passing structure to functions
Pointers
● Fundamentals of pointers
6 ● Declaration, initialization and dereferencing of pointers 4
● Operations on Pointers
● Concept of dynamic memory allocation
Assessment:
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.

3. Question No: 01 will be compulsory and based on entire syllabus wherein
sub-questions of 2 to 5 marks will beasked.
4. Remaining questions will be mixed in nature.( e.g. Suppose Q.2 has part
(a) from module3 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 thesyllabus.
Text Books:
1. E. Balaguruswamy, Programming in ANSI C, McGraw-Hill
2. Kernighan , Ritchie, “The C programming Language”, Prentice Hall of India
3. Sumitabha Das, Computer Fundamentals and C Programming, McGraw-Hill
4. Pradeep Day and ManasGosh ,“Programming in C”, Oxford University Press.
References:
1. Byron Gottfried, “Programing with C”, McGraw Hill ( Schaum‟s outline series)
2. Venugopal K.R, Prasad Sudeep, “Mastering C”, McGraw-Hill
3. KanetkarYashwant,” “Let Us C”, BPB Publication.
Teaching Scheme
Code
Professional
FEC206 Communication 2 -- -- 2 -- -- 2
and Ethics- I
Examination Scheme
Theory
Course
Professional
FEC206 Communication 10 10 10 40 2 -- -- 50
and Ethics- I
Objectives
1. To demonstrate the fundamental concepts of interpersonal and professional
communication.
2. To encourage active listening with focus on content, purpose, ideas and tone.
3. To facilitate fluent speaking skills in social, academic and professional situations.
4. To train in reading strategies for comprehending academic and business correspondence.
5. To promote effective writing skills in business, technology and academic arenas.
6. To inculcate confident personality traits along with grooming and social etiquettes.
Outcomes: Learners will be able to understand how to…

1. Eliminate barriers and use verbal/non-verbal cues at social and workplace situations.
2. Employ listening strategies to comprehend wide-ranging vocabulary, grammatical
structures, tone and pronunciation.
3. Prepare effectively for speaking at social, academic and business situations.
4. Use reading strategies for faster comprehension, summarization and evaluation of texts.
5. Acquire effective writing skills for drafting academic, business and technical documents.
6. Successfully interact in all kinds of settings, displaying refined grooming and social skills.

FUNDAMENTALS OF COMMUNICATION
1.1. Introduction to Theory of Communication
● Definition
● Objectives
● Postulates/Hallmarks
● The Process of Communication
● Organizational Communication
○ Formal (Upward, Downward and Horizontal)
○ Informal (Grapevine)
1 12
1.2. Methods of Communication
● Verbal (Written & Spoken)
● Non-verbal
○ Non-verbal cues perceived through the five senses: (Visual,
Auditory, Tactile, Olfactory and Gustatory cues)
○ Non-verbal cues transmitted through the use of: (The Body, Voice,
Space, Time and Silence)
1.3. Barriers to Communication
● Mechanical/External
● Physical/Internal
● Semantic & Linguistic
● Psychological
● Socio-Cultural
1.4. Communication at the Workplace
● Corporate Communication - Case Studies
● Listening Tasks with Recordings and Activity Sheets
● Short Speeches as Monologues
○ Informative Speeches that Center on People, Events, Processes,
Places, or Things
○ Persuasive Speeches to Persuade, Motivate or Take Action
○ Special Occasion Speeches for Ceremonial, Commemorative, or
Epideictic purposes
● Pair-work Conversational Activities (Dialogues)
● Short Group Presentations on Business Plans
VERBAL APTITUDE FOR EMPLOYMENT
2.1. Vocabulary Building
● Root words (Etymology)
● Meaning of Words in Context
● Synonyms & Antonyms
● Collocations
● Word Form Charts
● Prefixes & Suffixes
● Standard Abbreviations
2 2.2. Grammar 02
● Identifying Common Errors
○ Subject - Verb Agreement
○ Misplaced Modifiers
○ Articles
○ Prepositions
● Tautologies
● Pleonasms (Redundancies)
● Idioms
● Cliches
DEVELOPING READING AND WRITING SKILLS
3.1. Reading Comprehension
● Long Passages
● Short Passages
● MCQs on Inferential Questions with 4 Options
3.2. Summarization of reading passages, reports, chapters, books
● Graphic Organizers for Summaries
○ Radial Diagrams like Mind Maps
○ Flow Charts
○ Tree Diagrams
3 02
○ Cyclic Diagrams
○ Linear Diagrams like Timelines
○ Pyramids
○ Venn Diagrams
● Point-form Summaries
● One-sentence Summaries of Central Idea
3.3. Paraphrasing
● Understanding Copyrights
● Running a Plagiarism Check on Paraphrased Passages
● Generating Plagiarism Reports
● Basic APA and MLA Referencing Style and Format
BUSINESS CORRESPONDENCE
4.1. Seven Cs of Business Correspondence
● Completeness
● Conciseness
● Consideration
● Concreteness
● Clarity
● Courtesy
● Correctness
4.2. Parts of a Formal Letter and Formats
● Parts/Elements of a Formal Letter
○ Letterheads and/or Sender’s Address
○ Dateline
○ Inside Address
○ Reference Line (Optional)
4 ○ Attention Line (Optional) 06
○ Salutation
○ Subject Line
○ Body
○ Complimentary Close
○ Signature Block
○ Enclosures/Attachments
● Complete/Full Block Format
4.3. Emails
● Format of Emails
● Features of Effective Emails
● Language and style of Emails
4.4. Types of Letters in Both Formal Letter Format and Emails
● Claim & Adjustment Letters
● Request/Permission Letters
● Sales Letters
BASIC TECHNICAL WRITING
5.1. Introduction
● What is Technical Writing?
● Importance and Principles of Technical Writing
● Difference between Technical Writing & Literary Writing
● Framing Definitions
● Difference between Technical Description & Instructions
5.2. Description of a Technical Object
● Definition
● Diagram
5 ● Discussion of Parts/Characteristics 02
Working
5.3. Writing User Instructions
● User Instructions
● Special Notices (Note, Warning, Caution and Danger)
● Styles of Presentation
○ Impersonal
○ Indirect
○ Direct
● Imperative
5.4. Description of a Technical / Scientific Process
● Definition
● Diagram
● Tools/ Apparatus/Software/ Hardware Used
● Working
● Result
PERSONALITY DEVELOPMENT AND SOCIAL ETIQUETTES
6.1. Personality Development
● Introducing Self and/or a Classmate
● Formal Dress Code
6.2. Social Etiquettes
● Formal Dining Etiquettes
6 02
● Cubicle Etiquettes
● Responsibility in Using Social Media
● Showing Empathy and Respect
● Learning Accountability and Accepting Criticism
● Demonstrating Flexibility and Cooperation
● Selecting Effective Communication Channels
Assessment:
Assessment consists of two class tests of 10 marks each.
TEST I -Public speech on general topics (Maximum 5 mins. per student)
TEST II - Written test covering modules 1 - 6

The second test should be based on theory and application exercises as mentioned in the
syllabus. (Note: Summarization should be a compulsory question in Test II and not in the
End Semester Theory Examination.)

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 module3 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 hours as mentioned in the syllabus
6. The first module (Fundamentals of Communication) will carry 40 %
weightage.
Text Books.
1. Sanjay Kumar & Pushp Lata (2018). Communication Skills with CD. New Delhi:
Oxford University Press.
2. Hemphill, P.D., McCormick, D. W., & Hemphill, R. D. (2001). Business
Communication with writing improvement exercises. Upper Saddle River, NJ:
Prentice Hall.
3. Locker, Kitty O. Kaczmarek, Stephen Kyo. (2019). Business Communication:
Building Critical Skills. Place of publication not identified: Mcgraw-hill.
4. Murphy, H. (1999). Effective Business Communication. Place of publication not
identified: Mcgraw-Hill.
5. Raman, M., & Sharma, S. (2016). Technical Communication: Principles and practice.
New Delhi: Oxford University Press.
6. Kaul, A. (2015). Effective Business Communication. Place of publication not
identified: Prentice-Hall of India.
7. Rizvi, A. M. (2010). Effective Technical Communication: A guide for Scientists and
Engineers. New Delhi: Tata McGraw Hill.
8. Lewis, N. (2014). Word power made easy. Random House USA.
Teaching Scheme
Code
Engineering
FEL201 - 01 - - - 0.5 0.5
Physics-II
Examination Scheme
Theory
Course
Engineering
FEL201 -- -- -- -- -- 25 -- 25
Physics-II
Objectives
1. To improve the knowledge about the theory learned in the class.
2. To improve ability to analyze experimental result and write laboratory report.

1. Perform the experiments based on diffraction through slitsusing Laser source and
analyze the results.
2. Perform the experiments using optical fibre to measure numerical aperture of a given
fibre.
3. Perform the experiments on various sensors and analyze the result.
Suggested Experiments:(Any five)
1. Determination of wavelength using Diffraction grating. (Hg/Na source)

2. Determination of number of lines on the grating surface using LASER Source.
3. Determination of Numerical Aperture of an optical fibre.
4. Determination of wavelength using Diffraction grating.(Laser source)
5. Study of divergence of laser beam
6. Determination of width of a slit using single slit diffraction experiment(laser source)
7. Study of I-V characteristics of Photo diode.
8. Study of ultrasonic distance meter/ interferometer.
9. Study of PT100 calibration and use and thermometer
10. Study of J /K type thermocouple, calibration and use and thermometer
11. Simulation experiments based on nanotechnology using open source simulation
softwares like Avogadro, Chimera, JMOL etc.
Term work:

 Project Groupwise (Execution & Submission) : 10 marks
Teaching Scheme
Code
Engineering
FEL202 - 01 - - - 0.5 0.5
Chemistry-II
Examination Scheme
Theory
Course
Engineering
FEL202 -- -- -- -- -- 25 -- 25
Chemistry-II

1. Determine moisture and ash content of coal
2. Analyze flue gas
3. Determine saponification and acid value of oil
4. Determine flash point of a lubricating oil
5. Synthesize a drug and a biofuel.
6. Determine na/k and emf of cu-zn system
Suggested Experiments
1. Determination of Moisture content of coal.
2. Determination of Ash content of coal.
3. Flue gas analysis using Orsat’s apparatus.
4. Saponification value of oil
5. Acid value of oil
6. Determination of Na/K by Flame photometry.
7. Preparation of Biodiesel from edible oil.
8. To estimate the emf of Cu-Zn system by Potentiometry.
9. Synthesis of Aspirin.
10. Determination of Flash point of a lubricant using Abel’s apparatus
Term work:

 Assignments and Viva on practicals : 10 marks
 Attendance (Theory and Practical) : 05 marks
Teaching Scheme
Code
Engineering
FEL203 - 04 - - - 2 2
Graphics
Examination Scheme
Theory
Course
Engineering
FEL203 -- -- -- -- -- 25 50 75
Graphics
Objectives
1. To inculcate the skill of drawing with the basic concepts.
2. To Use AutoCAD for daily working process.
3. To teach basic utility of Computer Aided drafting (CAD) tool

1. Apply the basic principles of projections in 2D drawings using a CAD software.
2. Create, Annotate, Edit and Plot drawings using basic AutoCAD commands and features.
3. Apply the concepts of layers to create drawing.
4. Apply basic AutoCAD skills to draw different views of a 3D object.
5. Apply basic AutoCAD skills to draw the isometric view from the given two views.
Component-1 (Use half Imperial Drawing Sheet)
Hrs
Activities to be completed in the Drawing Laboratory.
 One Practice sheet on projection of solids(minimum 2 problems ) 4
# Term Sheet 1: Projection of Solids (3 Problems). 4
 One Practice sheet on Section of Solids. (minimum 2 problems ) 6

# Term Sheet 2: Section of solids. (3 problems).
 One practice sheet on Orthographic projection. (minimum 1 problem)

# Term Sheet 3: Orthographic Projection (With section 1 problem, without section 1 6
problem).
 One practice sheet on Isometric drawing. (minimum 2 problems ) 4

# Term Sheet 4: Isometric Projection. ( 3 problems).
# Term sheets to be done in laboratory only and to be submitted as part of term work.
Note: Practice sheets to be done before starting the Term Sheets.
Component-2
Self-study problems/ Assignment: (In A3 size Sketch book, to be submitted as part of Term
Work)
1. Engineering Curves. (2 problems)

2. Projection of Lines (2 problems)
3. Projection of planes (2 problems)
4. Projection of solids. (2 problems)
5. Section of solids (2 problems)
6. Orthographic Projection. (With section 1 problem, without section 1 problem).
7. Missing views. (1 problem)
8. Isometric Drawing. (2 problems)
Computer Graphics: Engineering Graphics Software - Orthographic Projections, Isometric

Projections, Co-ordinate Systems, Multi-view Projection.
To be Taught in laboratory. Hrs
Overview of Computer Graphics Covering:
Listing the computer technologies that impact on graphical communication,
demonstrating knowledge of the theory of CAD software such as: The Menu
System, Toolbars (Standard, Object Properties, Draw, Modify and Dimension),
3
Drawing Area (Background, Crosshairs, Coordinate System), Dialog boxes and
windows, Shortcut menus (Button Bars), The Command Line (where applicable),
The Status Bar, Different methods of zoom as used in CAD, Select and erase
objects.
Part-A Customization & CAD Drawing:
Consisting of set up of the drawing page and the printer including scale settings, 3
Setting up of units and drawing limits, ISO and ANSI standards for coordinate
dimensioning.
Annotations, layering & other Functions Covering:
Applying dimensions to objects, applying annotations to drawings, Setting up and
use of layers, layers to create drawings, Create, edit and use customized layers,
Changing line lengths through modifying existing lines (extend/lengthen), Printing 4
documents to paper using the print command, orthographic projection techniques,
Drawing sectional views of objects (simple machine parts).
* Activities to be completed in the CAD Laboratory. ( All printouts to be the

part of Term Work. Preferably, Use A3 size sheets for print out.)
Component-3
1. Orthographic Projections (without section)- 1 problem 4
Part-B
2. Orthographic Projection (with section)- 1 problem 4
3. Orthographic Reading – 1 problem 2
4. Isometric Drawing – 3 problem. 4
Note: * Give practice sheet problems before going for Term Sheet problems.
Students are supposed to bring complete solution of problems before coming to CAD
practical.
Term Work:
Component-1 : 7Marks
Component-2 : 6 Marks
Component-3 : 7 Marks
Attendance : 5 Marks
Total Marks : 25 Marks
Note: Satisfactory submission of all 3 components is mandatory to full fill the Term.
Topic for the End Semester Practical Examination (Auto CAD) (2 hours/ 50 Marks.)
1. Isometric drawing. ( 1 problem) (20 Marks)
2. Orthographic Projection (With Section) (1 problem). (30 Marks)
Note:
1. Printout of the answers have to be taken preferably in A3 size sheets and should be
Assessed by External Examiner only.
2. Knowledge of Auto CAD software, concepts of Engineering Graphics related to
specified problem and accuracy of drawing should be considered during evaluation.
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.
Reference Books
1. Narayana, K.L. & P Kannaiah (2008), Text book on Engineering Drawing, Scitech
Publisher.
2. Prof. Sham Tickoo (Purdue University) &GauravVerma, "( CAD Soft Technologies) :
Auto CAD 2012 (For engineers and Designers)", Dreamtech Press NewDelhi.
3. Dhananjay A Jolhe, "Engineering Drawing" Tata McGraw Hill.
Teaching Scheme
Code
FEL204 C programming -- 2 -- -- -- 1 1
Examination Scheme
Theory
Course
Test1 Test 2 Avg Exam. (in Hrs)
FEL204 C programming -- -- -- -- -- 25 25 50

1. Translate given algorithms to a program.
2. Correct syntax and logical errors.
3. Write iterative as well as recursive programs.
4. Represent data in arrays, strings and structures and manipulate them through a
program.
5. Declare pointers and demonstrate call by reference concept.
Lab Description:
Weekly 2 hours of laboratory Programming Assignments on the following topics:
1. Basic data types and I/O operations

2. Branching Statements
3. Loop Statements
4. Arrays
5. Strings
6. Functions
7. Recursion
8. Structure and Union
9. Pointers
Term Work:
Experiments (20 Programs) and Assignments (2 Assignments) should be completed by
students on the given time duration
Experiments: 15 Marks
Assignment: 05 Marks
Attendance: 05 Marks
Total: 25 Marks
Practical and Oral :

Practical and oral Exam should be conducted for the Lab, on Computer Programming in C
subject for given list of experiments.
Implementation: 15 Marks
Oral: 10 Marks
Total: 25 Marks
Teaching Scheme
Code
Professional
FEL205 Communication -- 2 -- -- -- 1 1
and Ethics- I
Examination Scheme
Theory
Course
Professional
FEL205 Communication -- -- -- -- -- 25 -- 25
and Ethics- I
Objectives
To provide practice in ...
1. Active listening with focus on content, purpose, main idea, tone and pronunciation.
2. Fluent speaking and presentation skills in social, academic and professional situations.
3. Faster reading skills for effective comprehension in a variety of texts.
4. Drafting effective written discourse in academics, business and technology.
5. Grooming and projecting impressive persona in all interactions.

1. Listen and comprehend all types of spoken discourse successfully.
2. Speak fluently and make effective professional presentations.
3. Read large quantities of text in a short time to comprehend, summarise and evaluate
content.
4. Draft precise business letters, academic essays and technical guidelines.
5. Dress finely and conduct themselves with panache in social, academic and professional
situations.
List of
Assignments Details of Assignments Details of Activities Hrs.
& Activities
Listening practice tasks of 3 types
(through audio recordings of (1) 02
1. Written record of listening activities
Monologues (2) Dialogues (3)
Formal/Expert Talk or Lecture)
Transcription of the public speech 02
2. Practice public speech
along with a plagiarism report
Transcription of the public speech Public speech (Internal Assessment - 02
3.
along with a plagiarism report I)
Written assignment on barriers and 02
4. Role plays / case studies
non-verbal communication
Summarization through graphic 02
5.
organisers (1. Text to graphic NA
organizer 2. Graphic organizer to
text)
Advanced level reading
comprehension with MCQs (similar 02
6. Written record of reading activities
in level and format to CAT, GRE
and GMAT verbal sections)
Aptitude test on vocabulary and
Aptitude test on vocabulary and grammar (similar in level and format 02
7.
grammar to CAT, GRE and GMAT verbal
sections)
2 types of letters in complete block 02
8. NA
format
Written assignment on technical
writing (Exercises based on framing
9. Definitions, Describing Technical 02
Objects, Framing User Instructions NA
and Describing Technical Processes)
Documentation on case studies / role Case studies / role plays 02
10.
plays on Module 6
Assessment:

 Assignments : 20 marks
 Attendance (Theory and Practical) : 05 marks
Teaching Scheme
Code
Basic Workshop
FEL206 -- 2 -- -- -- 1 1
Practice-II
Examination Scheme
Theory
Course
Basic Workshop
FEL206 -- -- -- -- -- 50 -- 50
Practice-II
Objectives
1. To impart training to help the students develop engineering skill sets.
2. To inculcate respect for physical work and hard labor.
3. To get exposure to interdisciplinary engineering domain.

1. Develop the necessary skill required to handle/use different carpentry tools.
2. Identify and understand the safe practices to adopt in electrical environment.
3. Demonstrate the wiring practices for the connection of simple electrical load/ equipment.
4. Design, fabricate and assemble pcb.
5. Develop the necessary skill required to handle/use different masons tools.
6. Develop the necessary skill required to use different sheet metal and brazing tools.
7. Able to demonstrate the operation, forging with the help of a simple job.
Detailed Content Hrs.
Note:
Trade 1 and 2 are compulsory. Select any ONE trade topics out of the topic trade 3 to 5.
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

CO-2 to CO-4 is related to Trade-2
CO evaluation is to be done according to the opted Trades in addition to Compulsory Trades.
Carpentry(Compulsory)
6. Use and setting of hand tools like hacksaws, jack planes, chisels and
gauges for construction of various joints, wood tuning and modern 10
Trade-1
wood turning methods.
7. Term work to include one carpentry job involving a joint and report on
demonstration of a job involving wood turning
Basic Electrical work shop:(Compulsory):
8. Single phase and three phase wiring. Familiarization. of protection
switchgears and their ratings (fuse, MCB, ELCB). Wiring standards,
Trade-2 Electrical safety in the work place safe work practices. Protective 08
equipment, measures and tools.
9. Layout drawing, layout transfer to PCB, etching and drilling and
soldering technique
Masonry:
10. Use of masons tools like trowels, hammer, spirit level, square,
Trade-3 plumb line and pins etc. demonstration of mortar making, single and 06
one and half brick masonry , English and Flemish bonds, block
masonry, pointing and plastering.
Sheet metal working and Brazing:
Trade 4 11. Use of sheet metal, working hand tools, cutting , bending , spot 06
welding
Forging (Smithy):
Trade-5 12. At least one forging job to be demonstrated and a simple job to be 06
made for Term Work in a group of 4 students.
Copy to :-
1. The Deputy Registrar, Academic Authorities Meetings and Services
(AAMS),
2. The Deputy Registrar, College Affiliations & Development
Department (CAD),
3. The Deputy Registrar, (Admissions, Enrolment, Eligibility and
Migration Department (AEM),
4. The Deputy Registrar, Research Administration & Promotion Cell
(RAPC),
5. The Deputy Registrar, Executive Authorities Section (EA),
6. The Deputy Registrar, PRO, Fort, (Publication Section),
7. The Deputy Registrar, (Special Cell),
8. The Deputy Registrar, Fort/ Vidyanagari Administration Department
(FAD) (VAD), Record Section,
9. The Director, Institute of Distance and Open Learning (IDOL Admin),
Vidyanagari,
They are requested to treat this as action taken report on the concerned
resolution adopted by the Academic Council referred to in the above circular
and that on separate Action Taken Report will be sent in this connection.
1. P.A to Hon’ble Vice-Chancellor,

2. P.A Pro-Vice-Chancellor,
3. P.A to Registrar,
4. All Deans of all Faculties,
5. P.A to Finance & Account Officers, (F.& A.O),
6. P.A to Director, Board of Examinations and Evaluation,
7. P.A to Director, Innovation, Incubation and Linkages,
8. P.A to Director, Board of Lifelong Learning and Extension (BLLE),
9. The Director, Dept. of Information and Communication Technology
(DICT) (CCF & UCC), Vidyanagari,
10. The Director of Board of Student Development,
11. The Director, Department of Students Walfare (DSD),
12. All Deputy Registrar, Examination House,
13. The Deputy Registrars, Finance & Accounts Section,
14. The Assistant Registrar, Administrative sub-Campus Thane,
15. The Assistant Registrar, School of Engg. & Applied Sciences, Kalyan,
16. The Assistant Registrar, Ratnagiri sub-centre, Ratnagiri,
17. The Assistant Registrar, Constituent Colleges Unit,
18. BUCTU,
19. The Receptionist,
20. The Telephone Operator,
21. The Secretary MUASA
for information.
AC: 23/7/2020
Item No. 127
in
Computer Engineering
Second Year with Effect from AY 2020-21
Third Year with Effect from AY 2021-22
Final Year with Effect from AY 2022-23
(REV- 2019 ‘C’ Scheme) from Academic Year 2019 – 20

Under
FACULTY OF SCIENCE & TECHNOLOGY

(As per AICTE guidelines with effect from the academic year 2019–2020)
AC: 23/7/2020
Item No. 127
Syllabus for Approval
Date
Sr. No.
Heading Particulars
1 Title of the Course Second Year B.E. Computer Engineering
After Passing First Year Engineering as per the

2 Eligibility for Admission Ordinance 0.6242
3 Passing Marks 40%
Ordinances /
4 Ordinance 0.6242
Regulations ( if any)
5 No. of Years / Semesters 8 semesters
P.G. / U.G./ Diploma / Certificate

6 Level
(Strike out which is not applicable)
Yearly / Semester
7 Pattern
(Strike out which is not applicable )
New / Revised
8 Status
(Strike out which is not applicable )
To be implemented from
9 With effect from Academic Year: 2020-2021
Academic Year
Dr. S. K. Ukarande Dr Anuradha Muzumdar

Associate Dean Dean
Faculty of Science and Technology Faculty of Science and Technology
University of Mumbai University of Mumbai
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 Science
and Technology (in particular Engineering)of University of Mumbai has taken a lead in
incorporating philosophy of outcome based education in the process of curriculum development.
Faculty 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. 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. Credit assignment for
courses is based on 15 weeks teaching learning process, however content of courses is to be taught in
13 weeks and remaining 2 weeks to be utilized for revision, guest lectures, coverage of content
beyond syllabus etc.
There was a concern that the earlier revised curriculum more focused on providing information and
knowledge across various domains of the said program, which led to heavily loading of students in
terms of direct contact hours. In this regard, faculty of science and technology resolved that to
minimize the burden of contact hours, total credits of entire program will be of 170, wherein focus is
not only on providing knowledge but also on building skills, attitude and self learning. Therefore in
the present curriculum skill based laboratories and mini projects are made mandatory across all
disciplines of engineering in second and third year of programs, which will definitely facilitate self
learning of students. The overall credits and approach of curriculum proposed in the present revision
is in line with AICTE model curriculum.
The present curriculum will be implemented for Second Year of Engineering from the academic year
2020-21. Subsequently this will be carried forward for Third Year and Final Year Engineering in the
academic years 2021-22, 2022-23, respectively.

Associate Dean Dean
Incorporation and Implementation of Online Contents from
NPTEL/ Swayam Platform
The curriculum revision is mainly focused on knowledge component, skill based activities and
project based activities. Self learning opportunities are provided to learners. In the revision
process this time in particular Revised syllabus of ‘C ‘ scheme wherever possible additional
resource links of platforms such as NPTEL, Swayam are appropriately provided. In an earlier
revision of curriculum in the year 2012 and 2016 in Revised scheme ‘A' and ‘B' respectively,
efforts were made to use online contents more appropriately as additional learning materials to
enhance learning of students.
In the current revision based on the recommendation of AICTE model curriculum overall credits
are reduced to 171, to provide opportunity of self learning to learner. Learners are now getting
sufficient time for self learning either through online courses or additional projects for enhancing
their knowledge and skill sets.
The Principals/ HoD’s/ Faculties of all the institute are required to motivate and encourage
learners to use additional online resources available on platforms such as NPTEL/ Swayam.
Learners can be advised to take up online courses, on successful completion they are required to
submit certification for the same. This will definitely help learners to facilitate their enhanced
learning based on their interest.

Associate Dean Dean
Preface by Board of Studies in Computer Engineering
Dear Students and Teachers, we, the members of Board of Studies Computer Engineering, are
very happy to present Second Year Computer Engineering syllabus effective from the Academic
Year 2020-21 (REV-2019’C’ Scheme). We are sure you will find this syllabus interesting and
challenging.
Computer Engineering is one of the most sought-after courses amongst engineering students
hence there is a continuous requirement of revision of syllabus. The syllabus focuses on
providing a sound theoretical background as well as good practical exposure to students in the
relevant areas. It is intended to provide a modern, industry-oriented education in Computer
Engineering. It aims at producing trained professionals who can successfully acquainted with the
demands of the industry worldwide. They obtain skills and experience in up-to-date the
knowledge to analysis, design, implementation, validation, and documentation of computer
software and systems.
The revised syllabus falls in line with the objectives of affiliating University, AICTE, UGC, and
various accreditation agencies by keeping an eye on the technological developments,
innovations, and industry requirements.
The salient features of the revised syllabus are:
1. Reduction in credits to 170 is implemented to ensure that students have more time for
extracurricular activities, innovations, and research.
2. Introduction of Skill Based Lab and Mini Project to showcase their talent by doing
innovative projects that strengthen their profile and increases the chance of employability.
3. Students are encouraged to take up part of course through MOOCs platform SWAYAM
We would like to place on record our gratefulness to the faculty, students, industry experts and
stakeholders for having helped us in the formulation of this syllabus.
Board of Studies in Computer Engineering

Prof. Sunil Bhirud : Chairman
Prof. Madhumita Chatterjee : Member
Prof. Sunita Patil : Member
Prof. Leena Raga : Member
Prof. Subhash Shinde : Member
Prof. Meera Narvekar : Member
Prof. Suprtim Biswas : Member
Prof. Sudhir Sawarkar : Member
Prof. Dayanand Ingle : Member
Prof. Satish Ket : Member
Program Structure for Second Year Computer Engineering
UNIVERSITY OF MUMBAI (With Effect from 2020-2021)

Semester III
Teaching Scheme
Code
Engineering Mathematics-
CSC301 3 -- 1* 3 -- 1 4
III
Discrete Structures and
CSC302 3 -- -- 3 -- -- 3
Graph Theory
CSC303 Data Structure 3 -- -- 3 -- -- 3
Digital Logic & Computer
CSC304 3 -- -- 3 -- -- 3
Architecture
CSC305 Computer Graphics 3 -- -- 3 -- -- 3
CSL301 Data Structure Lab -- 2 -- -- 1 -- 1
CSL302 -- 2 -- -- 1 -- 1
Architecture Lab
CSL303 Computer Graphics Lab -- 2 -- -- 1 -- 1
Skill base Lab course:
CSL304 Object Oriented -- 2+2* -- -- 2 -- 2
Programming with Java
CSM301 Mini Project – 1 A -- 4$ -- -- 2 -- 2
Total
15 14 1 15 07 1 23
Examination Scheme
Term Pract
Theory Total
Work & oral
Course End Exam.
Course Name Internal Assessment Sem. Duration
Code
Exam (in Hrs)
Test
Test2 Avg
1
CSC301 20 20 20 80 3 25 -- 125
III
Discrete Structures and
CSC302 20 20 20 80 3 -- -- 100
Graph Theory
CSC303 Data Structure 20 20 20 80 3 -- -- 100
CSC304 20 20 20 80 3 -- -- 100
Architecture
CSC305 Computer Graphics 20 20 20 80 3 -- -- 100
CSL301 Data Structure Lab -- -- -- -- -- 25 25 50
CSL302 -- -- -- -- -- 25 -- 25
Architecture Lab
CSL303 Computer Graphics Lab -- -- -- -- -- 25 25 50
Skill base Lab course:
CSL304 Object Oriented -- -- -- -- -- 50 25 75
CSM301 Mini Project – 1 A -- -- -- -- -- 25 25 50
Total -- -- 100 400 -- 175 100 775
*Should be conducted batch wise and
$ indicates workload of Learner (Not Faculty), Students can form groups with minimum 2 (Two)
and not more than 4 (Four), Faculty Load: 1 hour per week per four groups
Program Structure for Second Year Computer Engineering
Semester IV
Teaching Scheme
Code
CSC401 3 -- 1* 3 -- 1 4
IV
CSC402 Analysis of Algorithm 3 -- -- 3 -- -- 3
Database Management
CSC403 3 -- -- 3 -- -- 3
System
CSC404 Operating System 3 -- -- 3 -- -- 3
CSC405 Microprocessor 3 -- -- 3 -- -- 3
CSL401 Analysis of Algorithm Lab -- 2 -- -- 1 -- 1
Database Management
CSL402 -- 2 -- -- 1 -- 1
System Lab
CSL403 Operating System Lab -- 2 -- -- 1 -- 1
CSL404 Microprocessor Lab -- 2 -- -- 1 -- 1
Skill Base Lab Course:
CSL405 -- 2*+2 -- -- 2 -- 2
Python Programming
CSM401 Mini Project 1-B -- 4$ -- -- 2 -- 2
Total
15 16 1 15 7 1 24
Examination Scheme
Term Pract
Theory Total
Work & oral
Course End Exam.
Course Name Internal Assessment Sem. Duration
Code
Exam. (in Hrs)
Test
Test 2 Avg.
1
CSC401 20 20 20 80 3 25 -- 125
IV
CSC402 Analysis of Algorithm 20 20 20 80 3 -- -- 100
Database Management
CSC403 20 20 20 80 3 -- -- 100
System
CSC404 Operating System 20 20 20 80 3 -- -- 100
CSC405 Microprocessor 20 20 20 80 3 -- -- 100
CSL401 Analysis of Algorithm Lab -- -- -- -- -- 25 25 50
Database Management
CSL402 -- -- -- -- -- 25 25 50
System Lab
CSL403 Operating System Lab -- -- -- -- -- 25 25 50
CSL404 Microprocessor Lab -- -- -- -- -- 25 -- 25
Skill Base Lab Course:
CSL405 -- -- -- -- -- 25 -- 25
Python Programming
CSM401 Mini Project 1-B -- -- -- -- -- 25 25 50
Total -- -- 100 400 -- 175 100 775
*Should be conducted batchwise and
$ indicates workload of Learner (Not Faculty), Students can form groups with minimum 2 (Two)
and not more than 4 (Four), Faculty Load: 1 hour per week per four groups.
Course Code Course Name Credits
CSC301 Engineering Mathematics-III 4
Pre-requisite: Engineering Mathematics-I, Engineering Mathematics-II
Course Objectives: The course aims:

1 To learn the Laplace Transform, Inverse Laplace Transform of various functions, its
applications.
2 To understand the concept of Fourier Series, its complex form and enhance the problem-
solving skills.
3 To understand the concept of complex variables, C-R equations with applications.
4 To understand the basic techniques of statistics like correlation, regression, and curve
fitting for data analysis, Machine learning, and AI.
5 To understand some advanced topics of probability, random variables with their
distributions and expectations.
Course Outcomes: On successful completion, of course, learner/student will be able to:

1 Understand the concept of Laplace transform and its application to solve the real integrals
in engineering problems.
2 Understand the concept of inverse Laplace transform of various functions and its
applications in engineering problems.
3 Expand the periodic function by using the Fourier series for real-life problems and
complex engineering problems.
4 Understand complex variable theory, application of harmonic conjugate to get orthogonal
trajectories and analytic functions.
5 Apply the concept of Correlation and Regression to the engineering problems in data
science, machine learning, and AI.
6 Understand the concepts of probability and expectation for getting the spread of the data
and distribution of probabilities.
Module Detailed Contents Hours

1 Laplace Transform 7
1.1 Definition of Laplace transform, Condition of Existence of Laplace
transform.
1.2 Laplace Transform (L) of standard functions like
𝑒 𝑎𝑡 , 𝑠𝑖𝑛(𝑎𝑡), 𝑐𝑜𝑠(𝑎𝑡), 𝑠𝑖𝑛ℎ(𝑎𝑡), 𝑐𝑜𝑠ℎ(𝑎𝑡)and𝑡 𝑛 , 𝑛 ≥ 0.
1.3 Properties of Laplace Transform: Linearity, First Shifting Theorem,
Second Shifting Theorem, Change of Scale, Multiplication by t,
Division by t, Laplace Transform of derivatives and integrals
(Properties without proof).
1.4 Evaluation of real improper integrals by using Laplace Transformation.
1.5 Self-learning Topics: Laplace Transform: Periodic functions,
Heaviside’s Unit Step function, Dirac Delta Function, Special functions
(Error and Bessel)
2 Inverse Laplace Transform 7
2.1 Definition of Inverse Laplace Transform, Linearity property, Inverse
Laplace Transform of standard functions, Inverse Laplace transform
using derivatives.
2.2 Partial fractions method to find Inverse Laplace transform.
2.3 Inverse Laplace transform using Convolution theorem (without proof)
2.4 Self-learning Topics: Applications to solve initial and boundary value
problems involving ordinary differential equations.
3 Fourier Series: 7
3.1 Dirichlet’s conditions, Definition of Fourier series and Parseval’s
Identity (without proof).
3.2 Fourier series of periodic function with period 2π and 2l.
3.3 Fourier series of even and odd functions.
3.4 Half range Sine and Cosine Series.
3.5 Self-learning Topics: Orthogonal and orthonormal set of functions,
Complex form of Fourier Series, Fourier Transforms.
4 Complex Variables: 7
4.1 Function f(z)of complex variable, Limit, Continuity and
Differentiability off(z), Analytic function: Necessary and sufficient
conditions for f(z) to be analytic (without proof).
4.2 Cauchy-Riemann equations in Cartesian coordinates (without proof).
4.3 Milne-Thomson method: Determine analytic function f(z)when real
part
(u), imaginary part (v) or its combination (u+v / u-v) is given.
4.4 Harmonic function, Harmonic conjugate and Orthogonal trajectories.
4.5 Self-learning Topics: Conformal mapping, Linear and Bilinear
mappings, cross ratio, fixed points and standard transformations.
5 Statistical Techniques 6
5.1 Karl Pearson’s coefficient of correlation (r)
5.2 Spearman’s Rank correlation coefficient (R) (with repeated and non-
repeated ranks)
5.3 Lines of regression
5.4 Fitting of first- and second-degree curves.
5.5 Self-learning Topics: Covariance, fitting of exponential curve.
6 Probability 6
6.1 Definition and basics of probability, conditional probability.
6.2 Total Probability theorem and Bayes’ theorem.
6.3 Discrete and continuous random variable with probability distribution
and probability density function.
6.4 Expectation, Variance, Moment generating function, Raw and central
moments up to 4th order.
6.5 Self-learning Topics: Skewness and Kurtosis of distribution (data).
References:
1 Higher Engineering Mathematics, Dr. B. S. Grewal, Khanna Publication.
2 Advanced Engineering Mathematics, Erwin Kreyszig, Wiley Eastern Limited.
3 Advanced Engineering Mathematics, R. K. Jain and S. R. K. Iyengar, Narosa Publication.
4 Complex Variables and Applications, Brown and Churchill, McGraw-Hill Education.
5 Probability, Statistics and Random Processes, T. Veerarajan, McGraw-Hill Education.
6 Theory and Problems of Fourier Analysis with applications to BVP, Murray Spiegel,
Schaum’s Outline Series.
Term Work:
1 Batch wise tutorials have to be conducted. The number of students per batch will be as per
University pattern for practical.
2 Students must be encouraged to write at least 6 class tutorials on the entire syllabus.
3 A group of 4-6 students should be assigned a self-learning topic. Students should prepare a
presentation/problem solving of 10-15 minutes. This will be considered as a mini project in
Engineering Mathematics. This project will be graded out of 10 marks depending on the
performance of the students.
The distribution of Term Work marks will be as follows:
1 Attendance (Theory and Tutorial) 05 marks
2 Class Tutorials on entire syllabus 10 marks
3 Mini project 10 marks
Assessment:

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

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

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 To apply graph theory in solving practical problems.
4 Thoroughly prepare for the mathematical aspects of other Computer Engineering courses

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, functions, Diagraph and Lattice.
4 Ability to understand and apply concepts of graph theory in solving real world problems.
5 Understand use of groups and codes in Encoding-Decoding
6 Analyze a complex computing problem and apply principles of discrete mathematics to
identify solutions

1 Logic 6
1.1 Propositional Logic, Predicate Logic, Laws of Logic, Quantifiers,
Normal Forms, Inference Theory of Predicate Calculus,
Mathematical Induction.
2 Relations and Functions 6
2.1 Basic concepts of Set Theory
2.2 Relations: Definition, Types of Relations, Representation of
Relations, Closures of Relations, Warshall’s algorithm, Equivalence
relations and Equivalence Classes
2.3 Functions: Definition, Types of functions, Composition of
functions, Identity and Inverse function
3 Posets and Lattice 5
3.1 Partial Order Relations, Poset, Hasse Diagram, Chain and Anti
chains, Lattice, Types of Lattice, Sub lattice
4 Counting 6
4.1 Basic Counting Principle-Sum Rule, Product Rule, Inclusion-
Exclusion Principle, Pigeonhole Principle
4.2 Recurrence relations, Solving recurrence relations
5 Algebraic Structures 8
5.1 Algebraic structures with one binary operation: Semi group,
Monoid, Groups, Subgroups, Abelian Group, Cyclic group,
Isomorphism
5.2 Algebraic structures with two binary operations: Ring
5.3 Coding Theory: Coding, binary information and error detection,
decoding and error correction
6 Graph Theory 8
Types of graphs, Graph Representation, Sub graphs, Operations on
Graphs, Walk, Path, Circuit, Connected Graphs, Disconnected
Graph, Components, Homomorphism and Isomorphism of Graphs,
Euler and Hamiltonian Graphs, Planar Graph, Cut Set, Cut Vertex,
Applications.
Textbooks:
1 Bernad Kolman, 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 Book
Company. Reprinted 2000.
3 K. H. Rosen, “Discrete Mathematics and applications”, fifth edition 2003, Tata McGraw Hill
Publishing Company
References:
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”, Tata McGraw Hill Publishing Company
4 Seymour Lipschutz, Marc Lars Lipson, “Discrete Mathematics” Schaum‟s Outline, McGraw
Hill Education.
5 Narsing Deo, “Graph Theory with applications to engineering and computer science”, PHI
Publications.
6 P. K. Bisht, H. S. Dhami, “Discrete Mathematics”, Oxford press.
Assessment:


compulsory.
Useful Links
1 https://www.edx.org/learn/discrete-mathematics
2 https://www.coursera.org/specializations/discrete-mathematics
3 https://nptel.ac.in/courses/106/106/106106094/
4 https://swayam.gov.in/nd1_noc19_cs67/preview
Course Code Course Name Credit
CSC303 Data Structure 03
Pre-requisite: C Programming

1 To understand the need and significance of Data structures as a computer Professional.
2 To teach concept and implementation of linear and Nonlinear data structures.
3 To analyze various data structures and select the appropriate one to solve a specific real-
world problem.
4 To introduce various techniques for representation of the data in the real world.
5 To teach various searching techniques.
Course Outcomes:
1 Students will be able to implement Linear and Non-Linear data structures.
2 Students will be able to handle various operations like searching, insertion, deletion and
traversals on various data structures.
3 Students will be able to explain various data structures, related terminologies and its types.
4 Students will be able to choose appropriate data structure and apply it to solve problems in
various domains.
5 Students will be able to analyze and Implement appropriate searching techniques for a given
problem.
6 Students will be able to demonstrate the ability to analyze, design, apply and use data
structures to solve engineering problems and evaluate their solutions.
Module Detailed Content Hours

1 Introduction to Data Structures 2
1.1 Introduction to Data Structures, Concept of ADT, Types of Data Structures-
Linear and Nonlinear, Operations on Data Structures.
2 Stack and Queues 8
2.1 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.
2.2 Introduction, ADT of Queue, Operations on Queue, Array Implementation of
Queue, Types of Queue-Circular Queue, Priority Queue, Introduction of Double
Ended Queue, Applications of Queue.
3 Linked List 10
3.1 Introduction, Representation of Linked List, Linked List v/s Array, Types of
Linked List - Singly Linked List, Circular Linked List, Doubly Linked List,
Operations on Singly Linked List and Doubly Linked List, Stack and Queue
using Singly Linked List, Singly Linked List Application-Polynomial
Representation and Addition.
4 Trees 11
4.1 Introduction, Tree Terminologies, Binary Tree, Binary Tree Representation,
Types of Binary Tree, Binary Tree Traversals, Binary Search Tree, Operations
on Binary Search Tree, Applications of Binary Tree-Expression Tree, Huffman
Encoding, Search Trees-AVL, rotations in AVL Tree, operations on AVL Tree,
Introduction of B Tree, B+ Tree.
5 Graphs 4
5.1 Introduction, Graph Terminologies, Representation of Graph, Graph Traversals-
Depth First Search (DFS) and Breadth First Search (BFS), Graph Application-
Topological Sorting.
6 Searching Techniques 4
6.1 Linear Search, Binary Search, Hashing-Concept, Hash Functions, Collision
resolution Techniques
Textbooks:
1 Aaron M Tenenbaum, Yedidyah Langsam, Moshe J Augenstein, “Data Structures Using C”,
Pearson Publication.
2 Reema Thareja, “Data Structures using C”, Oxford Press.
3 Richard F. Gilberg and Behrouz A. Forouzan, “Data Structures: A Pseudocode Approach
with C”, 2ndEdition, CENGAGE Learning.
4 Jean Paul Tremblay, P. G. Sorenson, “Introduction to Data Structure and Its Applications”,
McGraw-Hill Higher Education
5 Data Structures Using C, ISRD Group, 2ndEdition, Tata McGraw-Hill.
References:
1 Prof. P. S. Deshpande, Prof. O. G. Kakde, “C and Data Structures”, DreamTech press.
2 E. Balagurusamy, “Data Structure Using C”, Tata McGraw-Hill Education India.
3 Rajesh K Shukla, “Data Structures using C and C++”, Wiley-India
4 GAV PAI, “Data Structures”, Schaum’s Outlines.
5 Robert Kruse, C. L. Tondo, Bruce Leung, “Data Structures and Program Design in C”,
Pearson 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 additional40% syllabus is

1 Question paper will consist of 6 questions, each carrying 20 marks.
2 The students need to solve a total of 4 questions.
3 Question No.1 will be compulsory and based on the entire syllabus.
4 Remaining question (Q.2 to Q.6) will be selected from all the modules.
Useful Links
2 https://www.coursera.org/specializations/data-structures-algorithms
3 https://www.edx.org/course/data-structures-fundamentals
CSC304 Digital Logic & Computer Organization and Architecture 3
Pre-requisite: Knowledge on number systems

Course Objective:
1 To have the rough understanding of the basic structure and operation of basic digital circuits
and digital computer.
2 To discuss in detail arithmetic operations in digital system.
3 To discuss generation of control signals and different ways of communication with I/O
devices.
4 To study the hierarchical memory and principles of advanced computing.
Course Outcome:
1 To learn different number systems and basic structure of computer system.
2 To demonstrate the arithmetic algorithms.
3 To understand the basic concepts of digital components and processor organization.
4 To understand the generation of control signals of computer.
5 To demonstrate the memory organization.
6 To describe the concepts of parallel processing and different Buses.

1 Computer Fundamentals 5
1.1 Introduction to Number System and Codes
1.2 Number Systems: Binary, Octal, Decimal, Hexadecimal,
1.3 Codes: Grey, BCD, Excess-3, ASCII, Boolean Algebra.
1.4 Logic Gates: AND, OR, NOT, NAND, NOR, EX-OR
1.5 Overview of computer organization and architecture.
1.6 Basic Organization of Computer and Block Level functional Units, Von-
Neumann Model.
2 Data Representation and Arithmetic algorithms 8
2.1 Binary Arithmetic: Addition, Subtraction, Multiplication, Division using Sign
Magnitude, 1’s and 2’s compliment, BCD and Hex Arithmetic Operation.
2.2 Booths Multiplication Algorithm, Restoring and Non-restoring Division
Algorithm.
2.3 IEEE-754 Floating point Representation.
3 Processor Organization and Architecture 6
3.1 Introduction: Half adder, Full adder, MUX, DMUX, Encoder, Decoder(IC
level).
3.2 Introduction to Flip Flop: SR, JK, D, T (Truth table).
3.3 Register Organization, Instruction Formats, Addressing modes, Instruction
Cycle, Interpretation and sequencing.
4 Control Unit Design 6
4.1 Hardwired Control Unit: State Table Method, Delay Element Methods.
4.2 Microprogrammed Control Unit: Micro Instruction-Format, Sequencing and
execution, Micro operations, Examples of microprograms.
5 Memory Organization 6
5.1 Introduction and characteristics of memory, Types of RAM and ROM, Memory
Hierarchy, 2-level Memory Characteristic,
5.2 Cache Memory: Concept, locality of reference, Design problems based on
mapping techniques, Cache coherence and write policies.
Interleaved and Associative Memory.
6 Principles of Advanced Processor and Buses 8
6.1 Basic Pipelined Data path and control, data dependencies, data hazards, branch
hazards, delayed branch, and branch prediction, Performance measures-CPI,
Speedup, Efficiency, throughput, Amdhal’s law.
6.2 Flynn’s Classification, Introduction to multicore architecture.
6.3 Introduction to buses: ISA, PCI, USB. Bus Contention and Arbitration.
Textbooks:
1 R. P. Jain, “Modern Digital Electronic”, McGraw-Hill Publication, 4thEdition.
2 William Stalling, “Computer Organization and Architecture: Designing and Performance”,
Pearson Publication 10TH Edition.
3 John P Hayes, “Computer Architecture and Organization”, McGraw-Hill Publication, 3RD
Edition.
4 Dr. M. Usha and T. S. Shrikanth, “Computer system Architecture and Organization”, Wiley
publication.
References:
1 Andrew S. Tanenbaum, “Structured Computer Organization”, Pearson Publication.
2 B. Govindarajalu, “Computer Architecture and Organization”, McGraw-Hill Publication.
3 Malvino, “Digital computer Electronics”, McGraw-Hill Publication, 3rdEdition.
4 Smruti Ranjan Sarangi, “Computer Organization and Architecture”, McGraw-Hill
Publication.
Assessment:

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.
Useful Links
1 https://www.classcentral.com/course/swayam-computer-organization-and-architecture-a-pedagogical-
aspect-9824
3 https://www.coursera.org/learn/comparch
4 https://www.edx.org/learn/computer-architecture
CSC305 Computer Graphics 3
Prerequisite: Knowledge of C Programming and Basic Mathematics.

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 and professional avenues in the field of Computer
Graphics
Course Outcomes: At the end of the course, the students should be able to
1 Describe the basic concepts of Computer Graphics.
2 Demonstrate various algorithms for basic graphics primitives.
3 Apply 2-D geometric transformations on graphical objects.
4 Use various Clipping algorithms on graphical objects
5 Explore 3-D geometric transformations, curve representation techniques and projections
methods.
6 Explain visible surface detection techniques and Animation.

1 Introduction and Overview of Graphics System: 02
1.1 Definition and Representative uses of computer graphics, Overview of
coordinate system, Definition of scan conversion, rasterization and
rendering.
1.2 Raster scan & random scan displays, Architecture of raster graphics
system with display processor, Architecture of random scan systems.
2 Output Primitives: 10
2.1 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 algorithms is expected)
2.2 Aliasing, Antialiasing techniques like Pre and post filtering, super
sampling, and pixel phasing).
2.3 Filled Area Primitive: Scan line Polygon Fill algorithm, inside outside
tests, Boundary Fill and Flood fill algorithm.
3 Two Dimensional Geometric Transformations 6
3.1 Basic transformations: Translation, Scaling, Rotation
3.2 Matrix representation and Homogeneous Coordinates
3.3 Composite transformation
3.4 Other transformations: Reflection and Shear
4 Two-Dimensional Viewing and Clipping 7
4.1 Viewing transformation pipeline and Window to Viewport coordinate
transformation
4.2 Clipping operations: Point clipping, Line clipping algorithms: Cohen-
Sutherland, Liang: Barsky, Polygon Clipping Algorithms: Sutherland-
Hodgeman, Weiler-Atherton.
Three Dimensional Geometric Transformations, Curves and
5 8
Fractal Generation
5.1 3D Transformations: Translation, Rotation, Scaling and Reflection
5.2 Composite transformations: Rotation about an arbitrary axis
5.3 Projections – Parallel, Perspective. (Matrix Representation)
5.4 Bezier Curve, B-Spline Curve, Fractal-Geometry: Fractal Dimension,
Koch Curve.
6 Visible Surface Detection and Animation 6
6.1 Visible Surface Detection: Classification of Visible Surface Detection
algorithm, Back Surface detection method, Depth Buffer method, Area
Subdivision method
6.2 Animation: Introduction to Animation, Traditional Animation
Techniques, Principles of Animation, Key framing: Character and
Facial Animation, Deformation, Motion capture
Textbooks:
1 Hearn & Baker, “Computer Graphics C version”, 2nd Edition, Pearson Publication
2 James D. Foley, Andries van Dam, Steven K Feiner, John F. Hughes, “Computer Graphics
Principles and Practice in C”, 2ndEdition, Pearson Publication
3 Samit Bhattacharya, “Computer Graphics”, Oxford Publication
References:
1 D. Rogers, “Procedural Elements for Computer Graphics”, Tata McGraw-Hill Publications.
2 Zhigang Xiang, Roy Plastock, “Computer Graphics”, Schaum‟s Outlines McGraw-Hill
Education
3 Rajesh K. Maurya, “Computer Graphics”, Wiley India Publication.
4 F. S. Hill, “Computer Graphics using OpenGL”, Third edition, Pearson Publications.
Assessment:

4 Remaining question (Q.2 to Q.6) will be selected from all the modules
Useful Links
1 https://www.classcentral.com/course/interactivegraphics-2067
2 https://swayam.gov.in/nd2_ntr20_ed15/preview
4 https://www.edx.org/course/computer-graphics-2
Lab Code Lab Name Credit
CSL301 Data Structures Lab 1
Prerequisite: C Programming Language.

Lab Objectives:
1 To implement basic data structures such as arrays, linked lists, stacks and queues
2 Solve problem involving graphs, and trees
3 To develop application using data structure algorithms
4 Compute the complexity of various algorithms.
Lab Outcomes:
1 Students will be able to implement linear data structures & be able to handle operations like
insertion, deletion, searching and traversing on them.
2 Students will be able to implement nonlinear data structures & be able to handle operations
like insertion, deletion, searching and traversing on them
3 Students will be able to choose appropriate data structure and apply it in various problems
4 Students will be able to select appropriate searching techniques for given problems.
Suggested Experiments: Students are required to complete at least 10 experiments.

Star (*) marked experiments are compulsory.
Sr. No. Name of the Experiment
1* Implement Stack ADT using array.
2* Convert an Infix expression to Postfix expression using stack ADT.
3* Evaluate Postfix Expression using Stack ADT.
4 Applications of Stack ADT.
5* Implement Linear Queue ADT using array.
6* Implement Circular Queue ADT using array.
7 Implement Priority Queue ADT using array.
8* Implement Singly Linked List ADT.
9* Implement Circular Linked List ADT.
10 Implement Doubly Linked List ADT.
11* Implement Stack / Linear Queue ADT using Linked List.
12* Implement Binary Search Tree ADT using Linked List.
13* Implement Graph Traversal techniques:) Depth First Search b) Breadth First Search
14 Applications of Binary Search Technique.
Useful Links:
1 www.leetcode.com
2 www.hackerrank.com
3 www.cs.usfca.edu/~galles/visualization/Algorithms.html
4 www.codechef.com
Term Work:
1 Term work should consist of 10 experiments.
2 Journal must include at least 2 assignments.
3 The final certification and acceptance of term work ensures that satisfactory performance of
laboratory work and minimum passing marks in term work.
4 Total 25 Marks (Experiments: 15-marks, Attendance Theory & Practical: 05-marks,
Assignments: 05-marks)
Oral & Practical exam
Based on the entire syllabus of CSL301and CSC303
CSL302 Digital Logic & Computer Organization and Architecture Lab 1

Lab Objectives:
1 To implement operations of the arithmetic unit using algorithms.
2 Design and simulate different digital circuits.
3 To design memory subsystem including cache memory.
4 To demonstrate CPU and ALU design.
Lab Outcomes:
1 To understand the basics of digital components
2 Design the basic building blocks of a computer: ALU, registers, CPU and memory
3 To recognize the importance of digital systems in computer architecture
4 To implement various algorithms for arithmetic operations.
List of Experiments:
1 To verify the truth table of various logic gates using ICs.
2 To realize the gates using universal gates
3 Code conversion.
4 To realize half adder and full adder.
5 To implement logic operation using MUX IC.
6 To implement logic operation decoder IC.
7 Study of flip flop IC.
8 To implement ripple carry adder.
9 To implement carry look ahead adder.
10 To implement Booth’s algorithm.
11 To implement restoring division algorithm.
12 To implement non restoring division algorithm.
13 To implement ALU design.
14 To implement CPU design.
15 To implement memory design.
16 To implement cache memory design.
Note:
1 Any Four experiments from Exp. No. 1 to Exp. No. 7 using hardware.
2 Any Six experiments from Exp. No. 8 to Exp. No. 16 using Virtual Lab, expect Exp. No
10,11 and 12.
3 Exp. No. 10 to Exp. No. 12 using Programming language.
Digital Material:
1 Manual to use Virtual Lab simulator for Computer Organization and Architecture developed by the
Department of CSE, IIT Kharagpur.
2 Link http://cse10-iitkgp.virtual-labs.ac.in/
Term Work:
2 Journal must include at least 2 assignments on content of theory and practical of “Digital
Logic &Computer Organization and Architecture”
4 Total 25 Marks (Experiments: 15-marks, Attendance Theory& Practical: 05-marks,
Course Code Lab Name Credits
CSL303 Computer Graphics Lab 1
Lab Objectives:
1 Understand the need of developing graphics application
2 Learn algorithmic development of graphics primitives like line, circle, polygon etc.
3 Learn the representation and transformation of graphical images and pictures
Lab Outcomes: At the end of the course, the students should be able to
1 Implement various output and filled area primitive algorithms
2 Apply transformation, projection and clipping algorithms on graphical objects.
3 Perform curve and fractal generation methods.
4 Develop a Graphical application/Animation 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++
List of Suggested Experiments:

1 Implement DDA Line Drawing algorithm (dotted/dashed/thick)
2 Implement Bresenham’s Line algorithm(dotted/dashed/thick)
3 Implement midpoint Circle algorithm.
4 Implement midpoint Ellipse algorithm.
5 Implement Area Filling Algorithm: Boundary Fill, Flood Fill.
6 Implement Scan line Polygon Filling algorithm.
7 Implement Curve: Bezier for n control points, B Spline (Uniform)(at least one)
8 Implement Fractal generation method (anyone)
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 (at least one)
13 Program to perform 3D transformation.
14 Perform projection of a 3D object on Projection Plane: Parallel and Perspective.
15 Perform Animation (such as Rising Sun, Moving Vehicle, Smileys, Screen saver etc.)
Term Work:
2 Journal must include at least 2 assignments
3 Mini Project to perform using C /C++/Java/OpenGL/Blender/ any other tool (2/3 students per
group). Possible Ideas: Animation using multiple objects, Game development, Graphics
editor: Like Paint brush, Text editor etc.
Assignments: 05-marks, Mini Project: 5-marks)

Based on the above contents and entire syllabus of CSC305
Lab Code Lab Name Credits
CSL304 Skill based Lab Course: Object Oriented Programming with Java 2
Prerequisite: Structured Programming Approach
Lab Objectives:
1 To learn the basic concepts of object-oriented programming
2 To study JAVA programming language
3 To study various concepts of JAVA programming like multithreading, exception Handling,
packages, etc.
4 To explain components of GUI based programming.
Lab Outcomes: At the end of the course, the students should be able to
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 concept of exception handling and multithreading.
6 To develop GUI based application.

1 Introduction to Object Oriented Programming 2
1.1 OOP concepts: Objects, class, Encapsulation, Abstraction, Inheritance,
Polymorphism, message passing.
1.2 Java Virtual Machine
1.3 Basic programming constructs: variables, data types, operators,
unsigned right shift operator, expressions, branching and looping.
2 Class, Object, Packages and Input/output 6
2.1 Class, object, data members, member functions
Constructors, types, static members and functions
Method overloading
Packages in java, types, user defined packages
Input and output functions in Java,
Buffered reader class, scanner class
3 Array, String and Vector 3
3.1 Array, Strings, String Buffer, Vectors
4 Inheritance 4
4.1 Types of inheritance, Method overriding, super, abstract class and
abstract method, final, Multiple inheritance using interface, extends
keyword
5 Exception handling and Multithreading 5
5.1 Exception handling using try, catch, finally, throw and throws, Multiple
try and catch blocks, user defined exception
Thread lifecycle, thread class methods, creating threads using extends
and implements keyword.
6 GUI programming in JAVA 6
6.1 Applet and applet life cycle, creating applets, graphics class functions,
parameter passing to applet, Font and color class.
Event handling using event class
AWT: working with windows, using AWT controls for GUI design
Swing class in JAVA
Introduction to JDBC, JDBC-ODBC connectivity, JDBC architecture.
Textbooks:
1 Herbert Schildt, ‘JAVA: The Complete Reference’, Ninth Edition, Oracle Press.
2 E. Balagurusamy, ‘Programming with Java’, McGraw Hill Education.
References:
1 Ivor Horton, “Beginning JAVA‟, Wiley India.
2 Dietal and Dietal, “Java: How to Program‟, 8th Edition, PHI .
3 “JAVA Programming‟, Black Book, Dreamtech Press.
4 “Learn to Master Java programming‟, Staredu solutions
Digital material:
1 www.nptelvideos.in
2 www.w3schools.com
3 www.tutorialspoint.com
4 https://starcertification.org/Certifications/Certificate/securejava
Suggested List of Programming Assignments/laboratory Work:

1 Programs on Basic programming constructs like branching and looping
2 Program on accepting input through keyboard.
3 Programs on class and objects
4 Program on method and constructor overloading.
5 Program on Packages
6 Program on 2D array, strings functions
7 Program on String Buffer and Vectors
8 Program on types of inheritance
9 Program on Multiple Inheritance
10 Program on abstract class and abstract methods.
11 Program using super and final keyword
12 Program on Exception handling
13 Program on user defined exception
14 Program on Multithreading
15 Program on Graphics class
16 Program on applet class
17 Program to create GUI application
18 Mini Project based on the content of the syllabus (Group of 2-3 students)
Term Work:
5 Total 50-Marks (Experiments: 15-marks, Attendance: 05-marks, Assignments: 05-marks,
Mini Project: 20-marks, MCQ as a part of lab assignments: 5-marks)

Based on the entire syllabus of CSL 304: Skill based Lab Course: Object Oriented
Course code Course Name Credits
CSM301 Mini Project A 02
Objectives
1 To acquaint with the process of identifying the needs and converting it into the problem.
2 To familiarize the process of solving the problem in a group.
3 To acquaint with the process of applying basic engineering fundamentals to attempt
solutions to the problems.
4 To inculcate the process of self-learning and research.
Outcome: Learner will be able to…

1 Identify problems based on societal /research needs.
2 Apply Knowledge and skill to solve societal problems in a group.
3 Develop interpersonal skills to work as member of a group or leader.
4 Draw the proper inferences from available results through theoretical/
experimental/simulations.
5 Analyze the impact of solutions in societal and environmental context for sustainable
development.
6 Use standard norms of engineering practices
7 Excel in written and oral communication.
8 Demonstrate capabilities of self-learning in a group, which leads to lifelong learning.
9 Demonstrate project management principles during project work.
Guidelines for Mini Project

1 Students shall form a group of 3 to 4 students, while forming a group shall not be allowed
less than three or more than four students, as it is a group activity.
2 Students should do survey and identify needs, which shall be converted into problem
statement for mini project in consultation with faculty supervisor/head of
department/internal committee of faculties.
3 Students shall submit implementation plan in the form of Gantt/PERT/CPM chart, which
will cover weekly activity of mini project.
4 A logbook to be prepared by each group, wherein group can record weekly work progress,
guide/supervisor can verify and record notes/comments.
5 Faculty supervisor may give inputs to students during mini project activity; however, focus
shall be on self-learning.
6 Students in a group shall understand problem effectively, propose multiple solution and
select best possible solution in consultation with guide/ supervisor.
7 Students shall convert the best solution into working model using various components of
their domain areas and demonstrate.
8 The solution to be validated with proper justification and report to be compiled in standard
format of University of Mumbai.
9 With the focus on the self-learning, innovation, addressing societal problems and
entrepreneurship quality development within the students through the Mini Projects, it is
preferable that a single project of appropriate level and quality to be carried out in two
semesters by all the groups of the students. i.e. Mini Project 1 in semester III and IV.
Similarly, Mini Project 2 in semesters V and VI.
10 However, based on the individual students or group capability, with the mentor’s
recommendations, if the proposed Mini Project adhering to the qualitative aspects
mentioned above gets completed in odd semester, then that group can be allowed to work
on the extension of the Mini Project with suitable improvements/modifications or a
completely new project idea in even semester. This policy can be adopted on case by case
basis.
Term Work
The review/ progress monitoring committee shall be constituted by head of departments of each
institute. The progress of mini project to be evaluated on continuous basis, minimum two
reviews in each semester.
In continuous assessment focus shall also be on each individual student, assessment based on
individual’s contribution in group activity, their understanding and response to questions.
Distribution of Term work marks for both semesters shall be as below: Marks
1 Marks awarded by guide/supervisor based on logbook 10
2 Marks awarded by review committee 10
3 Quality of Project report 05
Review / progress monitoring committee may consider following points for

assessment based on either one year or half year project as mentioned in
general guidelines
One-year project:
1 In first semester entire theoretical solution shall be ready, including components/system
selection and cost analysis. Two reviews will be conducted based on presentation given by
students group.
• First shall be for finalization of problem
• Second shall be on finalization of proposed solution of problem.
2 In second semester expected work shall be procurement of component’s/systems, building
of working prototype, testing and validation of results based on work completed in an
earlier semester.
• First review is based on readiness of building working prototype to be conducted.
• Second review shall be based on poster presentation cum demonstration of working
model in last month of the said semester.
Half-year project:
1 In this case in one semester students’ group shall complete project in all aspects including,
• Identification of need/problem
• Proposed final solution
• Procurement of components/systems
• Building prototype and testing
2 Two reviews will be conducted for continuous assessment,
• First shall be for finalization of problem and proposed solution
• Second shall be for implementation and testing of solution.
Assessment criteria of Mini Project.
Mini Project shall be assessed based on following criteria;

1 Quality of survey/ need identification
2 Clarity of Problem definition based on need.
3 Innovativeness in solutions
4 Feasibility of proposed problem solutions and selection of best solution
5 Cost effectiveness
6 Societal impact
7 Innovativeness
8 Cost effectiveness and Societal impact
9 Full functioning of working model as per stated requirements
10 Effective use of skill sets
11 Effective use of standard engineering norms
12 Contribution of an individual’s as member or leader
13 Clarity in written and oral communication
In one year, project, first semester evaluation may be based on first six criteria’s and
remaining may be used for second semester evaluation of performance of students in mini
project.
In case of half year project all criteria’s in generic may be considered for evaluation of
performance of students in mini project.
Guidelines for Assessment of Mini Project Practical/Oral Examination:

1 Report should be prepared as per the guidelines issued by the University of Mumbai.
2 Mini Project shall be assessed through a presentation and demonstration of working model
by the student project group to a panel of Internal and External Examiners preferably from
industry or research organizations having experience of more than five years approved by
head of Institution.
3 Students shall be motivated to publish a paper based on the work in Conferences/students
competitions.
Mini Project shall be assessed based on following points;

1 Quality of problem and Clarity
CSC401 Engineering Mathematics-IV 4
Pre-requisite: Engineering Mathematics-I, Engineering Mathematics-II, Engineering

Mathematics-III, Binomial Distribution.
Course Objectives: The course aims to learn:

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

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

1 Linear Algebra (Theory of Matrices) 7
1.1 Characteristic Equation, Eigenvalues and Eigenvectors, and properties
(without proof)
1.2 Cayley-Hamilton Theorem (without proof), verification and reduction
of higher degree polynomials
1.3 Similarity of matrices, diagonalizable and non-diagonalizable matrices
1.4 Self-learning Topics: Derogatory and non-derogatory matrices,
Functions of Square Matrix, Linear Transformations, Quadratic forms.
2 Complex Integration 7
2.1 Line Integral, Cauchy’s Integral theorem for simple connected and
multiply connected regions (without proof), Cauchy’s Integral formula
(without proof).
2.2 Taylor’s and Laurent’s series (without proof).
2.3 Definition of Singularity, Zeroes, poles off(z), Residues, Cauchy’s
Residue Theorem (without proof)
2.4 Self-learning Topics: Application of Residue Theorem to evaluate real
integrations.
3 Z Transform 5
3.1 Definition and Region of Convergence, Transform of Standard
Functions:
{𝑘 𝑛 𝑎𝑘 }, {𝑎|𝑘| }, { 𝑘+𝑛𝑛𝐶. 𝑎𝑘 }, {𝑐 𝑘 sin(𝛼𝑘 + 𝛽)}, {𝑐 𝑘 sinh 𝛼𝑘}, {𝑐 𝑘 cosh 𝛼𝑘}.
3.2 Properties of Z Transform: Change of Scale, Shifting Property,
Multiplication, and Division by k, Convolution theorem.
3.3 Inverse Z transform: Partial Fraction Method, Convolution Method.
3.4 Self-learning Topics: Initial value theorem, Final value theorem,
Inverse of Z Transform by Binomial Expansion
4 Probability Distribution and Sampling Theory 7
4.1 Probability Distribution: Poisson and Normal distribution
4.2 Sampling distribution, Test of Hypothesis, Level of Significance,
Critical region, One-tailed, and two-tailed test, Degree of freedom.
4.3 Students’ t-distribution (Small sample). Test the significance of mean
and Difference between the means of two samples. Chi-Square Test:
Test of goodness of fit and independence of attributes, Contingency
table.
4.4 Self-learning Topics: Test significance for Large samples, Estimate
parameters of a population, Yate’s Correction.
5 Linear Programming Problems 6
5.1 Types of solutions, Standard and Canonical of LPP, Basic and Feasible
solutions, slack variables, surplus variables, Simplex method.
5.2 Artificial variables, Big-M method (Method of penalty)
5.3 Duality, Dual of LPP and Dual Simplex Method
5.4 Self-learning Topics: Sensitivity Analysis, Two-Phase Simplex
Method, Revised Simplex Method.
6 Nonlinear Programming Problems 7
6.1 NLPP with one equality constraint (two or three variables) using the
method of Lagrange’s multipliers
6.2 NLPP with two equality constraints
6.3 NLPP with inequality constraint: Kuhn-Tucker conditions
6.4 Self-learning Topics: Problems with two inequality constraints,
Unconstrained optimization: One-dimensional search method (Golden
Search method, Newton’s method). Gradient Search method
References:
1 Erwin Kreyszig, “Advanced Engineering Mathematics”, John Wiley & Sons.
2 R. K. Jain and S. R. K. Iyengar, “Advanced Engineering Mathematics”, Narosa.
3 Brown and Churchill, “Complex Variables and Applications”, McGraw-Hill Education.
4 T. Veerarajan, “Probability, Statistics and Random Processes”, McGraw-Hill Education.
5 Hamdy A Taha, “Operations Research: An Introduction”, Pearson.
6 S.S. Rao, “Engineering Optimization: Theory and Practice”, Wiley-Blackwell.
7 Hira and Gupta, “Operations Research”, S. Chand Publication.
Term Work:
1 Batch wise tutorial shave to be conducted. The number of students per batch will be as per
University pattern for practical.
2 Students must be encouraged to write at least 6 class tutorials on the entire syllabus.
3 A group of 4-6 students should be assigned a self-learning topic. Students should prepare a
presentation/problem solving of 10-15 minutes. This will be considered as a mini project in
Engineering Mathematics. This project will be graded out of 10 marks depending on the
performance of the students.
The distribution of Term Work marks will be as follows:
1 Attendance (Theory and Tutorial) 05 marks
2 Class Tutorials on entire syllabus 10 marks
3 Mini project 10 marks
Assessment:

compulsory.
CSC402 Analysis of Algorithms 3
Prerequisite: Data structure concepts, Discrete structures

Course Objectives:
1 To provide mathematical approaches for Analysis of Algorithms
2 To understand and solve problems using various algorithmic approaches
3 To analyze algorithms using various methods
Course Outcomes: At the end of the course learner 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.
6 Explain and apply string matching techniques.

1 Introduction 8
1.1 Performance analysis, space, and time complexity Growth of function,
Big-Oh, Omega Theta notation Mathematical background for algorithm
analysis.
Complexity class: Definition of P, NP, NP-Hard, NP-Complete
Analysis of selection sort, insertion sort.
1.2 Recurrences: The substitution method, Recursion tree method, Master
method
2 Divide and Conquer Approach 6
2.1 General method, Merge sort, Quick sort, Finding minimum and
maximum algorithms and their Analysis, Analysis of Binary search.
3 Greedy Method Approach 6
3.1 General Method, Single source shortest path: Dijkstra Algorithm
Fractional Knapsack problem, Job sequencing with deadlines,
Minimum cost spanning trees: Kruskal and Prim’s algorithms
4 Dynamic Programming Approach 9
4.1 General Method, Multistage graphs, Single source shortest path:
Bellman Ford Algorithm
All pair shortest path: Floyd Warshall Algorithm, Assembly-line
scheduling Problem0/1 knapsack Problem, Travelling Salesperson
problem, Longest common subsequence
5 Backtracking and Branch and bound 6
5.1 General Method, Backtracking: N-queen problem, Sum of subsets,
Graph coloring
5.2 Branch and Bound: Travelling Salesperson Problem, 15 Puzzle problem
6 String Matching Algorithms 4
6.1 The Naïve string-matching algorithm, The Rabin Karp algorithm, The
Knuth-Morris-Pratt algorithm
Textbooks:
1 T. H. Cormen, 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.
References:
1 Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani, “Algorithms”, Tata McGraw-
Hill Edition.
2 S. K. Basu, “Design Methods and Analysis of Algorithm”, PHI
Assessment:

1 Question paper will comprise of total six questions.
2 All question carries 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.
5 In question paper weightage of each module will be proportional to number of respective
Useful Links
3 https://www.coursera.org/specializations/algorithms
4 https://www.mooc-list.com/tags/algorithms
Course Code: Course Title Credit
CSC403 Database Management System 3
Prerequisite: Data Structures

Course Objectives:
1 Develop entity relationship data model and its mapping to relational model
2 Learn relational algebra and Formulate SQL queries
3 Apply normalization techniques to normalize the database
4 Understand concept of transaction, concurrency control and recovery techniques.
Course Outcomes:
1 Recognize the need of database management system
2 Design ER and EER diagram for real life applications
3 Construct relational model and write relational algebra queries.
4 Formulate SQL queries
5 Apply the concept of normalization to relational database design.
6 Describe the concept of transaction, concurrency and recovery.
Module Content Hrs

1 Introduction Database Concepts 3
1.1 Introduction, Characteristics of databases, File system v/s Database system,
Data abstraction and data Independence, DBMS system architecture,
Database Administrator
2 Entity–Relationship Data Model 6
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 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, Relational
Algebra-operators, Relational Algebra Queries.
4 Structured Query Language (SQL) 6
4.1 Overview of SQL, Data Definition Commands, Integrity constraints: key
constraints, Domain Constraints, Referential integrity , check constraints,
Data Manipulation commands, Data Control commands, Set and string
operations, aggregate function-group by, having, Views in SQL, joins,
Nested and complex queries, Triggers
5 Relational-Database Design 6
5.1 Pitfalls in Relational-Database designs, Concept of normalization, Function
Dependencies, First Normal Form, 2NF, 3NF, BCNF.
6 Transactions Management and Concurrency and Recovery 10
6.1 Transaction concept, Transaction states, ACID properties, Transaction
Control Commands, Concurrent Executions, Serializability-Conflict and
View, Concurrency Control: Lock-based, Timestamp-based protocols,
Recovery System: Log based recovery, Deadlock handling
Textbooks:
1 Korth, Slberchatz, Sudarshan, Database System Concepts, 6thEdition, McGraw Hill
2 Elmasri and Navathe, Fundamentals of Database Systems, 5thEdition, Pearson Education
3 Raghu Ramkrishnan and Johannes Gehrke, Database Management Systems, TMH
References:
1 Peter Rob and Carlos Coronel, Database Systems Design, Implementation and
Management‖, Thomson Learning, 5thEdition.
2 Dr. P.S. Deshpande, SQL and PL/SQL for Oracle 10g, Black Book, Dreamtech Press.
3 G. K. Gupta, Database Management Systems, McGraw Hill, 2012
Assessment:

Useful Links
3 https://www.classcentral.com/course/swayam-database-management-system-9914
4 https://www.mooc-list.com/tags/dbms
CSC404 Operating System 03
Prerequisites: Data structures and Computer architecture
Course Objectives:
1 1. To introduce basic concepts and functions of operating systems.
2 2. To understand the concept of process, thread and resource management.
3 3. To understand the concepts of process synchronization and deadlock.
4 4. To understand various Memory, I/O and File management techniques.
Course Outcome:
1 Understand the objectives, functions and structure of OS
2 Analyze the concept of process management and evaluate performance of processscheduling
algorithms.
3 Understand and apply the concepts of synchronization and deadlocks
4 Evaluate performance of Memory allocation and replacement policies
5 Understand the concepts of file management.
Apply concepts of I/O management and analyze techniques of disk scheduling.

1 Operating system Overview 4
1.1 Introduction, Objectives, Functions and Evolution of Operating
System
1.2 Operating system structures: Layered, Monolithic and Microkernel
1.3 Linux Kernel, Shell and System Calls
2 Process and Process Scheduling 9
2.1 Concept of a Process, Process States, Process Description, Process
Control Block.
2.2 Uniprocessor Scheduling-Types: Preemptive and Non-preemptive
scheduling algorithms (FCFS, SJF, SRTN, Priority, RR)
2.3 Threads: Definition and Types, Concept of Multithreading
3 Process Synchronization and Deadlocks 9
3.1 Concurrency: Principles of Concurrency, Inter-Process
Communication, Process Synchronization.
3.2 Mutual Exclusion: Requirements, Hardware Support (TSL),
Operating System Support (Semaphores), Producer and Consumer
problem.
3.3 Principles of Deadlock: Conditions and Resource, Allocation Graphs,
Deadlock Prevention, Deadlock Avoidance: Banker‟s Algorithm,
Deadlock Detection and Recovery, Dining Philosophers Problem.
4 Memory Management 9
4.1 Memory Management Requirements, Memory Partitioning: Fixed,
Partitioning, Dynamic Partitioning, Memory Allocation Strategies:
Best-Fit, First Fit, Worst Fit, Paging and Segmentation, TLB
4.2 Virtual Memory: Demand Paging, Page Replacement Strategies:
FIFO, Optimal, LRU, Thrashing
5 File Management 4
5.1 Overview, File Organization and Access, File Directories, File
Sharing
6 I/O management 4
6.1 I/O devices, Organization of the I/O Function, Disk Organization, I/O
Management and Disk Scheduling: FCFS, SSTF, SCAN, CSCAN,
LOOK, C-LOOK.
Textbooks:
1 William Stallings, Operating System: Internals and Design Principles, Prentice Hall,
8thEdition, 2014, ISBN-10: 0133805913 • ISBN-13: 9780133805918.
2 Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, Operating System Concepts,
John Wiley &Sons, Inc., 9thEdition, 2016, ISBN 978-81-265-5427-0
References:
1 Achyut Godbole and Atul Kahate, Operating Systems, McGraw Hill Education, 3rdEdition
2 Andrew Tannenbaum, Operating System Design and Implementation, Pearson, 3rdEdition.
3 Maurice J. Bach, “Design of UNIX Operating System”, PHI
4 Sumitabha Das, “UNIX: Concepts and Applications”, McGraw Hill, 4thEdition
Assessment:

4 Remaining question (Q.2 to Q.6) will be selected from all the modules
Useful Links
3 https://www.classcentral.com/course/swayam-introduction-to-operating-systems-6559
CSC405 Microprocessor 3
Prerequisites: Digital Logic and Computer Architecture
Course objectives:
1 To equip students with the fundamental knowledge and basic technical competence in
thefield 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 core concepts of 8086 microprocessor.
2 Interpret the instructions of 8086 and write assembly and Mixed language programs.
3 Identify the specifications of peripheral chip.
4 Design 8086 based system using memory and peripheral chips.
5 Appraise the architecture of advanced processors
6 Understand hyperthreading technology

1 The Intel Microprocessors 8086 Architecture 8
1.1 8086CPU Architecture,
1.2 Programmer’s Model
1.3 Functional Pin Diagram
1.4 Memory Segmentation
1.5 Banking in 8086
1.6 Demultiplexing of Address/Data bus
1.7 Functioning of 8086 in Minimum mode and Maximum mode
1.8 Timing diagrams for Read and Write operations in minimum and
maximum mode
1.9 Interrupt structure and its servicing
2 Instruction Set and Programming 6
2.1 Addressing Modes
2.2 Instruction set-Data Transfer Instructions, String Instructions, Logical
Instructions, Arithmetic Instructions, Transfer of Control Instructions,
Processor Control Instructions
2.3 Assembler Directives and Assembly Language Programming, Macros,
Procedures
3 Memory and Peripherals interfacing 8
3.1 Memory Interfacing - RAM and ROM Decoding Techniques – Partial
and Absolute
3.2 8255-PPI-Block diagram, CWR, operating modes, interfacing with
8086.
3.3 8257-DMAC-Block diagram, DMA operations and transfer modes.
3.4 Programmable Interrupt Controller 8259-Block Diagram, Interfacing
the 8259 in single and cascaded mode.
4 Intel 80386DX Processor 7
4.1 Architecture of 80386 microprocessor
4.2 80386 registers–General purpose Registers, EFLAGS and Control
registers
4.3 Real mode, Protected mode, virtual 8086 mode
4.4 80386 memory management in Protected Mode – Descriptors and
selectors, descriptor tables, the memory paging mechanism
5 Pentium Processor 6
5.1 Pentium Architecture
5.2 Superscalar Operation,
5.3 Integer &Floating-Point Pipeline Stages,
5.4 Branch Prediction Logic,
5.5 Cache Organization and
5.6 MESI protocol
6 Pentium 4 4
6.1 Comparative study of 8086, 80386, Pentium I, Pentium II and Pentium
III
6.2 Pentium 4: Net burst micro architecture.
6.3 Instruction translation look aside buffer and branch prediction
6.4 Hyper threading technology and its use in Pentium 4
Textbooks:
1 John Uffenbeck, “8086/8088 family: Design Programming and Interfacing”, PHI.
2 Yu-Cheng Liu, Glenn A. Gibson, “Microcomputer System: The 8086/8088 Family,
Architecture, Programming and Design”, Prentice Hall
3 Walter A. Triebel, “The 80386DX Microprocessor: hardware, Software and Interfacing”,
Prentice Hall
4 Tom Shanley and Don Anderson, “Pentium Processor System Architecture”, Addison-
Wesley.
5 K. M. Bhurchandani and A. K. Ray, “Advanced Microprocessors and Peripherals”,
McGraw Hill
References:
1 Barry B. Brey, “Intel Microprocessors”, 8thEdition, Pearson Education India
2 Douglas Hall, “Microprocessor and Interfacing”, Tata McGraw Hill.
3 Intel Manual
4 Peter Abel, “IBM PC Assembly language and Programming”, 5th Edition, PHI
5 James Antonakons, “The Pentium Microprocessor”, Pearson Education
Assessment:


Useful Links
1 https://swayam.gov.in/nd1_noc20_ee11/preview
3 https://www.classcentral.com/course/swayam-microprocessors-and-microcontrollers-9894
4 https://www.mooc-list.com/tags/microprocessors
Course Name Lab Name Credit
CSL401 Analysis of Algorithms Lab 1
Prerequisite: Basic knowledge of programming and data structure
Lab Objectives:
1 To introduce the methods of designing and analyzing algorithms
2 Design and implement efficient algorithms for a specified application
3 Strengthen the ability to identify and apply the suitable algorithm for the given real-world
problem.
4 Analyze worst-case running time of algorithms and understand fundamental algorithmic
problems.
Lab Outcomes: At the end of the course, the students will be able to
1 Implement the algorithms using different approaches.
2 Analyze the complexities of various algorithms.
3 Compare the complexity of the algorithms for specific problem.
Description
Implementation can be in any language.
Suggested Practical List:
Sr No Suggested Experiment List
1 Introduction
1.1 Selection sort, Insertion sort
2 Divide and Conquer Approach
2.1 Finding Minimum and Maximum, Merge sort, Quick sort, Binary search
3 Greedy Method Approach
3.1 Single source shortest path- Dijkstra
Fractional Knapsack problem
Job sequencing with deadlines
Minimum cost spanning trees-Kruskal and Prim’s algorithm
4 Dynamic Programming Approach
4.1 Single source shortest path- Bellman Ford
All pair shortest path- Floyd Warshall
0/1 knapsack
Travelling salesperson problem
Longest common subsequence
5 Backtracking and Branch and bound
5.1 N-queen problem
Sum of subsets
Graph coloring
6 String Matching Algorithms
6.1 The Naïve string-matching Algorithms
The Rabin Karp algorithm
The Knuth-Morris-Pratt algorithm
Term Work:
2 Journal must include at least 2 assignments on content of theory and practical of “Analysis of
Algorithms”

Based on the entire syllabus of CSC402: Analysis of Algorithms
CSL402 Database Management system Lab 1
Prerequisite: Discrete Structures
Lab Objectives:
1 To explore design and develop of relational model
2 To present SQL and procedural interfaces to SQL comprehensively
3 To introduce the concepts of transactions and transaction processing
1 Design ER /EER diagram and convert to relational model for the realworld application.
2 Apply DDL, DML, DCL and TCL commands
3 Write simple and complex queries
4 UsePL / SQL Constructs.
5 Demonstrate the concept of concurrent transactions execution and frontend-backend
connectivity
Suggested List of Experiments

Sr. Title of Experiment
No.
1 Identify the case study and detail statement of problem. Design an Entity-Relationship
(ER) / Extended Entity-Relationship (EER) Model.
2 Mapping ER/EER to Relational schema model.
3 Create a database using Data Definition Language (DDL) and apply integrity constraints
for the specified System
4 Apply DML Commands for the specified system
5 Perform Simple queries, string manipulation operations and aggregate functions.
6 Implement various Join operations.
7 Perform Nested and Complex queries
8 Perform DCL and TCL commands
9 Implement procedure and functions
10 Implementation of Views and Triggers.
11 Demonstrate Database connectivity
12 Implementation and demonstration of Transaction and Concurrency control techniques
using locks.
Term Work:
2 Journal must include at least 2 assignments on content of theory and practical of “Database
Management System”

CSL403 Operating System Lab 01
Based on the entire syllabus of CSC403: Database Management System
Prerequisite: Knowledge on Operating system principles
Lab Objectives:
1 To gain practical experience with designing and implementing concepts of operating
systems such as system calls, CPU scheduling, process management, memory management,
file systems and deadlock handling using C language in Linux environment.
2 To familiarize students with the architecture of Linux OS.
3 To provide necessary skills for developing and debugging programs in Linux environment.
4 To learn programmatically to implement simple operation system mechanisms
1 Demonstrate basic Operating system Commands, Shell scripts, System Calls and API wrt
Linux
2 Implement various process scheduling algorithms and evaluate their performance.
3 Implement and analyze concepts of synchronization and deadlocks.
4 Implement various Memory Management techniques and evaluate their performance.
5 Implement and analyze concepts of virtual memory.
6 Demonstrate and analyze concepts of file management and I/O management techniques.

Sr. Content
No.
1 Explore Linux Commands
1.1 Explore usage of basic Linux Commands and system calls for file, directory
and process management.
For eg: (mkdir, chdir, cat, ls, chown, chmod, chgrp, ps etc.
system calls: open, read, write, close, getpid, setpid, getuid, getgid, getegid,
geteuid. sort, grep, awk, etc.)
2 Linux shell script
2.1 Write shell scripts to do the following:
a. Display OS version, release number, kernel version
b. Display top 10 processes in descending order
c. Display processes with highest memory usage.
d. Display current logged in user and log name.
Display current shell, home directory, operating system type, current path setting,
current working directory.
3 Linux- API
3.1 Implement any one basic commands of linux like ls, cp, mv and others using
kernel APIs.
4 Linux- Process
4.1 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.
b. Explore wait and waitpid before termination of process.
5 Process Management: Scheduling
5.1 a. Write a program to demonstrate the concept of non-preemptive scheduling
algorithms.
b. Write a program to demonstrate the concept of preemptive scheduling
algorithms
6 Process Management: Synchronization
6.1 a. Write a C program to implement solution of Producer consumer problem
through Semaphore
7 Process Management: Deadlock
7.1 a. Write a program to demonstrate the concept of deadlock avoidance through
Banker’s Algorithm
b. Write a program demonstrate the concept of Dining Philospher’s Problem
8 Memory Management
8.1 a. Write a program to demonstrate the concept of MVT and MFT memory
management techniques
b. Write a program to demonstrate the concept of dynamic partitioning placement
algorithms i.e. Best Fit, First Fit, Worst-Fit etc.
9 Memory Management: Virtual Memory
9.1 a. Write a program to demonstrate the concept of demand paging for simulation
of Virtual Memory implementation
b. Write a program in C demonstrate the concept of page replacement policies for
handling page faults eg: FIFO, LRU etc.
10 File Management & I/O Management
10.1 a. Write a C program to simulate File allocation strategies typically sequential,
indexed and linked files
b. Write a C program to simulate file organization of multi-level directory
structure.
c. Write a program in C to do disk scheduling - FCFS, SCAN, C-SCAN
Term Work:
1 Term work should consist of 10 experiments covering all modules.
2 Journal must include at least 2 assignments on content of theory and practical of “Database
Management System”

Based on the entire syllabus of CSC405: Operating System.
CSL404 Microprocessor Lab 1
Prerequisite: Basic knowledge digital integrated circuits
Lab Objectives:
1 To emphasize on use of Assembly language program.
2 To prepare students for advanced subjects like embedded system and IOT.
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
Suggested List of Experiments:

Sr. Title of Experiments
No.
1 Use of programming tools (Debug/TASM/MASM/8086kit) to perform basic arithmetic
operations on 8-bit/16-bit data
2 Code conversion (Hex to BCD and BCD to Hex)/ (ASCII to BCD and 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 Any Mixed Language programs.
7 Assembly program to find the GCD/ LCM of two numbers
8 Assembly program to sort numbers in ascending/ descending order
9 Any program using INT 10H
10 Assembly program to find minimum/ maximum number from a given array.
11 Assembly Program to display a message in different color with blinking
12 Assembly program using procedure.
13 Assembly program using macro.
14 Program and interfacing using 8255.
15 Program and interfacing of ADC/ DAC/ Stepper motor.
Term Work:
1 Term work should consist of 10 experiments, out of theses at least one experiment on
hardware interfacing.
2 Journal must include at least 2 assignments on content of theory and practical of
“Microprocessor”

Based on the entire syllabus of CSL501and CSC501syllabus.
CSL405 Skill Base Lab Course: Python Programming 2
Prerequisite: Knowledge of some programming language like C, Java
Lab Objectives:
1 Basics of Python programming
2 Decision Making, Data structure and Functions in Python
3 Object Oriented Programming using Python
4 Web framework for developing
1 To understand basic concepts in python.
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 Multithreading concepts using python.

1 Python basics 5
1.1 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 4
2.1 Files in Python, Directories, Building Modules, Packages, Text
Processing, Regular expression in python.
3 Data Structure in Python 3
3.1 Link List, Stack, Queues, Dequeues
4 Python Integration Primer 4
4.1 Graphical User interface, Networking in Python, Python database
connectivity, Introduction to Django
5 Multithreading 4
5.1 Thread and Process, Starting a thread, Threading module, Synchronizing
threads, Multithreaded Priority Queue
6 NumPy and Pandas 6
6.1 Creating NumPy arrays, Indexing and slicing in NumPy, creating
multidimensional arrays, NumPy Data types, Array Attribute, Indexing
and Slicing, Creating array views copies, Manipulating array shapes I/O
6.2 Basics of Pandas, Using multilevel series, Series and Data Frames,
Grouping, aggregating, Merge Data Frames
Textbooks:
1 Dr. R. Nageswara Rao, “Core Python Programming”, Dreamtech Press
2 Beginning Python: Using Python 2.6 and Python 3.1. James Payne, Wrox Publication
3 Anurag Gupta, G. P. Biswas, “Python Programming”, McGraw-Hill
4 E. Balagurusamy, “Introduction to computing and problem-solving using python”,
McGraw Hill Education
References:
1 Learn Python the Hard Way, 3rd Edition, Zed Shaw's Hard Way Series
2 Laura Cassell, Alan Gauld, “Python Projects”, 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 https://starcertification.org/Certifications/Certificate/python
Suggested experiments using Python:

Sr. Title of Experiments
No.
1 Exploring basics of python like data types (strings, list, array, dictionaries, set, tuples)
and control statements.
2 Creating functions, classes and objects using python. Demonstrate exception handling
and inheritance.
3 Exploring Files and directories
a. Python program to append data to existing file and then display the entire file
b. Python program to count number of lines, words and characters in a file.
c. Python program to display file available in current directory
4 Creating GUI with python containing widgets such as labels, textbox, radio, checkboxes
and custom dialog boxes.
5 Menu driven program for data structure using built in function for link list, stack and
queue.
6 Program to demonstrate CRUD (create, read, update and delete) operations on
database (SQLite/ MySQL) using python.
7 Creation of simple socket for basic information exchange between server and client.
8 Creating web application using Django web framework to demonstrate functionality of
user login and registration (also validating user detail using regular expression).
9 Programs on Threading using python.
10 Exploring basics of NumPy Methods.
11 Program to demonstrate use of NumPy: Array objects.
12 Program to demonstrate Data Series and Data Frames using Pandas.
13 Program to send email and read content of URL.
Term Work:
5 Total 25 Marks (Journal: 10-marks, Attendance: 05-marks, and Mini Project: 10-marks)
CSM401 Mini Project B 02
Objectives
1 To acquaint with the process of identifying the needs and converting it into the problem.
2 To familiarize the process of solving the problem in a group.
3 To acquaint with the process of applying basic engineering fundamentals to attempt
solutions to the problems.
4 To inculcate the process of self-learning and research.

1 Identify problems based on societal /research needs.
2 Apply Knowledge and skill to solve societal problems in a group.
3 Develop interpersonal skills to work as member of a group or leader.
4 Draw the proper inferences from available results through theoretical/
experimental/simulations.
5 Analyze the impact of solutions in societal and environmental context for sustainable
development.
6 Use standard norms of engineering practices
7 Excel in written and oral communication.
8 Demonstrate capabilities of self-learning in a group, which leads to lifelong learning.
9 Demonstrate project management principles during project work.

statement for mini project in consultation with faculty supervisor/head of
department/internal committee of faculties.
3 Students shall submit implementation plan in the form of Gantt/PERT/CPM chart, which
will cover weekly activity of mini project.
4 A logbook to be prepared by each group, wherein group can record weekly work progress,
guide/supervisor can verify and record notes/comments.
5 Faculty supervisor may give inputs to students during mini project activity; however, focus
6 Students in a group shall understand problem effectively, propose multiple solution and
select best possible solution in consultation with guide/ supervisor.
7 Students shall convert the best solution into working model using various components of
their domain areas and demonstrate.
format of University of Mumbai.
9 With the focus on the self-learning, innovation, addressing societal problems and
entrepreneurship quality development within the students through the Mini Projects, it is
preferable that a single project of appropriate level and quality to be carried out in two
semesters by all the groups of the students. i.e. Mini Project 1 in semester III and IV.
Similarly, Mini Project 2 in semesters V and VI.
mentioned above gets completed in odd semester, then that group can be allowed to work
completely new project idea in even semester. This policy can be adopted on case by case
basis.
Term Work
The review/ progress monitoring committee shall be constituted by head of departments of each
institute. The progress of mini project to be evaluated on continuous basis, minimum two
reviews in each semester.
Distribution of Term work marks for both semesters shall be as below: Marks
Review / progress monitoring committee may consider following points for

assessment based on either one year or half year project as mentioned in
general guidelines
One-year project:
1 In first semester entire theoretical solution shall be ready, including components/system
selection and cost analysis. Two reviews will be conducted based on presentation given by
students group.
• First shall be for finalization of problem
• Second shall be on finalization of proposed solution of problem.
2 In second semester expected work shall be procurement of component’s/systems, building
of working prototype, testing and validation of results based on work completed in an
earlier semester.
• First review is based on readiness of building working prototype to be conducted.
• Second review shall be based on poster presentation cum demonstration of working
model in last month of the said semester.
Half-year project:
• Identification of need/problem
• Proposed final solution
• Procurement of components/systems
• Building prototype and testing
• First shall be for finalization of problem and proposed solution
• Second shall be for implementation and testing of solution.
Assessment criteria of Mini Project.
Mini Project shall be assessed based on following criteria;

1 Quality of survey/ need identification
2 Clarity of Problem definition based on need.
4 Feasibility of proposed problem solutions and selection of best solution
5 Cost effectiveness
6 Societal impact
7 Innovativeness
In one year, project, first semester evaluation may be based on first six criteria’s and
project.
In case of half year project all criteria’s in generic may be considered for evaluation of
performance of students in mini project.

head of Institution.
3 Students shall be motivated to publish a paper based on the work in Conferences/students
competitions.
Mini Project shall be assessed based on following points;

1 Quality of problem and Clarity
AC: 29/06/2021
Item No: 6.15
in
(REV- 2019 ‘C’ Scheme) from Academic Year 2019 – 20

Under
FACULTY OF SCIENCE & TECHNOLOGY
(As per AICTE guidelines with effect from the academic year 2019–2020)
AC: 29/06/2021
Item No: 6.15
Sr. No. Heading Particulars

Third Year Engineering
1 Title of the Course ( Computer Engineering)
After Passing Second Year Engineering as per

2 Eligibility for Admission the Ordinance 0.6243
3 Passing Marks 40%

Ordinances /
4 Regulations ( if any) Ordinance 0.6243
5 No. of Years / Semesters 8 semesters
P.G. / U.G./ Diploma / Certificate

6 Level (Strike out which is not applicable)
Yearly / Semester
7 Pattern (Strike out which is not applicable )
New / Revised
8 Status (Strike out which is not applicable )
To be implemented from
9 Academic Year With effect from Academic Year: 2021-2022

Associate Dean Dean
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 Science and
Technology (in particular Engineering) of University of Mumbai has taken a lead in incorporating
philosophy of outcome based education in the process of curriculum development.
Faculty 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. 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. Credit assignment for courses is
based on 15 weeks teaching learning process, however content of courses is to be taught in 13 weeks
and remaining 2 weeks to be utilized for revision, guest lectures, coverage of content beyond syllabus
etc.
There was a concern that the earlier revised curriculum more focused on providing information and
knowledge across various domains of the said program, which led to heavily loading of students in
terms of direct contact hours. In this regard, faculty of science and technology resolved that to
minimize the burden of contact hours, total credits of entire program will be of 170, wherein focus is
not only on providing knowledge but also on building skills, attitude and self learning. Therefore in
the present curriculum skill based laboratories and mini projects are made mandatory across all
disciplines of engineering in second and third year of programs, which will definitely facilitate self
learning of students. The overall credits and approach of curriculum proposed in the present revision
is in line with AICTE model curriculum.
The present curriculum will be implemented for Second Year of Engineering from the academic year
2021-22. Subsequently this will be carried forward for Third Year and Final Year Engineering in the
academic years 2022-23, 2023-24, respectively.

Associate Dean Dean
ncorporation and Implementation of Online Contents from
NPTEL/ Swayam Platform
The curriculum revision is mainly focused on knowledge component, skill based activities and
project based activities. Self learning opportunities are provided to learners. In the revision process
this time in particular Revised syllabus of ‘C’ scheme wherever possible additional resource links
of platforms such as NPTEL, Swayam are appropriately provided. In an earlier revision of
curriculum in the year 2012 and 2016 in Revised scheme ‘A' and ‘B' respectively, efforts were
made to use online contents more appropriately as additional learning materials to enhance
learning of students.
In the current revision based on the recommendation of AICTE model curriculum overall credits
are reduced to 171, to provide opportunity of self learning to learner. Learners are now getting
sufficient time for self learning either through online courses or additional projects for enhancing
their knowledge and skill sets.
The Principals/ HoD’s/ Faculties of all the institute are required to motivate and encourage learners
to use additional online resources available on platforms such as NPTEL/ Swayam. Learners can
be advised to take up online courses, on successful completion they are required to submit
certification for the same. This will definitely help learners to facilitate their enhanced learning
based on their interest.

Associate Dean Dean
Preface by Board of Studies in
Dear Students and Teachers, we, the members of Board of Studies Computer
Engineering, are very happy to present Third Year Computer Engineering syllabus
effective from the Academic Year 2021-22 (REV-2019’C’ Scheme). We are sure you
will find this syllabus interesting, challenging, fulfill certain needs and expectations.
Computer Engineering is one of the most sought-after courses amongst engineering

students. The syllabus needs revision in terms of preparing the student for the
professional scenario relevant and suitable to cater the needs of industry in present day
context. The syllabus focuses on providing a sound theoretical background as well as
good practical exposure to students in the relevant areas. It is intended to provide a
modern, industry-oriented education in Computer Engineering. It aims at producing
trained professionals who can successfully acquainted with the demands of the industry
worldwide. They obtain skills and experience in up-to-date the knowledge to analysis,
design, implementation, validation, and documentation of computer software and
systems.
The revised syllabus is finalized through a brain storming session attended by Heads of
Departments or senior faculty from the Department of Computer Engineering of the
affiliated Institutes of the Mumbai University. The syllabus falls in line with the
objectives of affiliating University, AICTE, UGC, and various accreditation agencies by
keeping an eye on the technological developments, innovations, and industry
requirements.
The salient features of the revised syllabus are:

1. Reduction in credits to 170 is implemented to ensure that students have more
time for extracurricular activities, innovations, and research.
2. The department Optional Courses will provide the relevant specialization
within the branch to a student.
3. Introduction of Skill Based Lab and Mini Project to showcase their talent by
doing innovative projects that strengthen their profile and increases the
chance of employability.
4. Students are encouraged to take up part of course through MOOCs platform
SWAYAM
We would like to place on record our gratefulness to the faculty, students, industry
experts and stakeholders for having helped us in the formulation of this syllabus.
Board of Studies in Computer Engineering

Prof. Sunil Bhirud : Chairman
Prof. Sunita Patil : Member
Prof. Leena Raga : Member
Prof. Subhash Shinde : Member
Prof. Meera Narvekar : Member
Prof. Suprtim Biswas : Member
Prof. Sudhir Sawarkar : Member
Prof. Dayanand Ingle : Member
Prof. Satish Ket : Member
Program Structure for Third Year Computer Engineering
Semester V
Teaching Scheme
Code
Theory Pract. Theory Pract. Total
Theoretical Computer
CSC501 3 -- 3 -- 3
Science
CSC502 Software Engineering 3 -- 3 3
CSC503 Computer Network 3 -- 3 -- 3
Data Warehousing &
CSC504 3 -- 3 -- 3
Mining
Department Level
CSDLO501x 3 -- 3 -- 3
Optional Course- 1
Software Engineering
CSL501 -- 2 -- 1 1
Lab
CSL502 Computer Network Lab -- 2 -- 1 1
Data Warehousing &
CSL503 -- 2 -- 1 1
Mining Lab
Business Comm. &
CSL504 -- 2*+2 -- 2 2
Ethics II
CSM501 Mini Project: 2 A -- 4$ -- 2 2
Total 15 14 15 07 22
Examination Scheme
Term Pract
Theory Total
Work &oral
Course End Exam.
Course Name Internal
Code Sem Duration
Assessment
Exam (in Hrs)
Test Test
Avg
1 2
Theoretical Computer
CSC501 20 20 20 80 3 25 -- 125
Science
CSC502 Software Engineering 20 20 20 80 3 -- -- 100
CSC503 Computer Network 20 20 20 80 3 -- -- 100
Data Warehousing &
CSC504 20 20 20 80 3 -- -- 100
Mining
Department Level
CSDLO501x 20 20 20 80 3 -- -- 100
Optional Course -1
CSL501 Software Engineering Lab -- -- -- -- -- 25 25 50
CSL502 Computer Network Lab -- -- -- -- -- 25 25 50
Data Warehousing &
CSL503 -- -- -- -- -- 25 25 50
Mining Lab
Business Comm. & Ethics
CSL504 -- -- -- -- -- 50 -- 50
II
CSM501 Mini Project : 2A -- -- -- -- -- 25 25 50
Total -- -- 100 400 -- 175 100 775
* Theory class to be conducted for full class and $ indicates workload of Learner (Not Faculty), students
can form groups with minimum 2(Two) and not more than 4(Four). Faculty Load: 1hour per week per
four groups.
Program Structure for Third Year Computer Engineering
Semester VI
Teaching Scheme
Credits Assigned
Course (Contact Hours)
Course Name
Code Pract.
Theory Theory Pract. Total
Tut.
System Programming &
CSC601 3 -- 3 -- 3
Compiler Construction
Cryptography & System
CSC602 3 -- 3 3
Security
CSC603 Mobile Computing 3 -- 3 -- 3
CSC604 Artificial Intelligence 3 -- 3 -- 3
Department Level Optional
CSDLO601x 3 -- 3 -- 3
Course -2
CSL601 -- 2 -- 1 1
Compiler Construction Lab
CSL602 -- 2 -- 1 1
Security Lab
CSL603 Mobile Computing Lab -- 2 -- 1 1
CSL604 Artificial Intelligence Lab -- 2 -- 1 1
Skill base Lab Course:
CSL605 -- 4 -- 2 2
Cloud Computing
CSM601 Mini Project Lab: 2B -- 4$ -- 2 2
Total 15 16 15 08 23
Examination Scheme
Term Pract.
Theory Total
Work &oral
End
Course Exam.
Course Name Sem
Code Internal Assessment Duration
Exa
(in Hrs)
m
Test Test
Avg
1 2
CSC601 20 20 20 80 3 -- -- 100
Compiler Construction
CSC602 20 20 20 80 3 -- -- 100
Security
CSC603 Mobile Computing 20 20 20 80 3 -- -- 100
CSC604 Artificial Intelligence 20 20 20 80 3 -- -- 100
Department Level Optional
CSDLO601x 20 20 20 80 3 -- -- 100
Course -2
CSL601 -- -- -- -- -- 25 25 50
Compiler Construction Lab
CSL602 -- -- -- -- -- 25 -- 25
Security Lab
CSL603 Mobile Computing Lab -- -- -- -- -- 25 - 25
CSL604 Artificial Intelligence Lab 25 25 50
Skill base Lab Course:
CSL605 -- -- -- -- -- 50 25 75
Cloud Computing
CSM601 Mini Project :2B -- -- -- -- -- 25 25 50
Total -- -- 100 400 -- 175 100 775
Program Structure for Computer Engineering
Department Optional Courses

Department Level
Semester Code & Course
Optional Courses
CSDLO5011: Probabilistic Graphical

Models
Department Level
Optional Course -1 V CSDLO5012: Internet Programming
CSDLO5013: Advance Database

Management System
CSDLO6011: Internet of Things
Department Level CSDLO6012: Digital Signal & Image

Optional Course -2 VI
Processing
CSDLO6013: Quantitative Analysis

CSC501 Theoretical Computer Science 3
Prerequisite: Discrete Structures

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: At the end of the course, the students will be able to
1. Understand concepts of Theoretical Computer Science, difference and equivalence
of DFA and NFA , languages described by finite automata and regular expressions.
2. Design Context free grammer, pushdown automata to recognize the language.
3. Develop an understanding of computation through Turing Machine.
4. Acquire fundamental understanding of decidability and undecidability.
Module Unit Topics Theory

No. No. Hrs.
1.0 Basic Concepts and Finite Automata 09
1.1 Importance of TCS, 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, Equivalence between NFA with and
without ε- transitions, NFA to DFA Conversion, Minimization
of DFA, FSM with output: Moore and Mealy machines,
Applications and limitations of FA.
2.0 Regular Expressions and Languages 07
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
3.1 Grammars and Chomsky hierarchy
3.2 Regular Grammar (RG), 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), Context Free
language (CFL) - Pumping lemma, Closure properties.
4.0 Pushdown Automata(PDA) 04

4.1 Definition, Language of PDA,PDA as generator, decider and
acceptor of CFG, Deterministic PDA , Non-Deterministic
PDA, Application of PDA.
5.0 Turing Machine (TM) 09
5.1 Definition, Design of TM as generator, decider and acceptor,
Variants of TM: Multitrack, Multitape, Universal TM,
Applications, Power and Limitations of TMs.
6.0 Undecidability 02
6.1 Decidability and Undecidability, Recursive and Recursively
Enumerable Languages, Halting Problem, Rice‘s Theorem,
Post Correspondence Problem.
Total 39
Text Books:
1. John E. Hopcroft, Rajeev Motwani, Jeffery D. Ullman, “Introduction to Automata
Theory, Languages and Computation”, 3rd Edition, Pearson Education, 2008.
2. Michael Sipser, “Theory of Computation”, 3rd Edition, Cengage learning. 2013.

3. Vivek Kulkarni, “Theory of Computation”, Illustrated Edition, Oxford University
Press, (12 April 2013) India.
Reference Books:
1. J. C. Martin, “Introduction to Languages and the Theory of Computation”, 4th Edition,
Tata McGraw Hill Publication, 2013.
2. Kavi Mahesh, “Theory of Computation: A Problem Solving Approach”, Kindle

Edition, Wiley-India, 2011.
Assessment:
1. Assessment consists of two class tests of 20 marks each.
2. The first class test is to be conducted when approx. 40% syllabus is completed and
second class test when additional 40% syllabus is completed.
3. Duration of each test shall be one hour.
Term work:
1. Term Work should consist of at least 06 assignments (at least one assignment on
each module).
2. Assignment (best 5 assignments) 20 marks
Attendance 5 marks
3. It is recommended to use JFLAP software (www.jflap.org) for better teaching and
learning processes.

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 cover all the modules of syllabus.
Useful Links:
1. www.jflap.org
2. https://nptel.ac.in/courses/106/104/106104028/
3. https://nptel.ac.in/courses/106/104/106104148/
CSC502 Software Engineering 3
Prerequisite: Object Oriented Programming with Java , Python Programming

Course Objectives:
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 world software projects.
Course Outcomes: On successful completion of course, learners will be able to:
1 Identify requirements & assess the process models.
2 Plan, schedule and track the progress of the projects.
3 Design the software projects.
4 Do testing of software project.
5 Identify risks, manage the change to assure quality in software projects.
Module Content Hrs

1 Introduction To Software Engineering and Process Models 7
1.1 Software Engineering-process framework, the Capability Maturity Model
(CMM), Advanced Trends in Software Engineering
1.2 Prescriptive Process Models: The Waterfall, Incremental
Process Models, Evolutionary Process Models: RAD & Spiral
1.3 Agile process model: Extreme Programming (XP), Scrum, Kanban
2 Software Requirements Analysis and Modeling 4
2.1 Requirement Engineering, Requirement Modeling, Data flow diagram,
Scenario based model
2.2 Software Requirement Specification document format(IEEE)
3 Software Estimation Metrics 7
3.1 Software Metrics, Software Project Estimation (LOC, FP, COCOMO II )
3.2 Project Scheduling & Tracking
4 Software Design 7
4.1 Design Principles & Concepts
4.2 Effective Modular Design, Cohesion and Coupling, Architectural design
5 Software Testing 7
5.1 Unit testing, Integration testing,Validation testing, System testing
5.2 Testing Techniques, white-box testing: Basis path, Control structure testing
black-box testing: Graph based, Equivalence, Boundary Value
5.3 Types of Software Maintenance, Re-Engineering, Reverse Engineering
6 Software Configuration Management, Quality Assurance and 7
Maintenance
6.1 Risk Analysis & Management: Risk Mitigation, Monitoring and
Management Plan (RMMM).
6.2 Quality Concepts and Software Quality assurance Metrics, Formal Technical
Reviews, Software Reliability
6.3 The Software Configuration Management (SCM) ,Version Control and
Change Control
39
Textbooks:
1 Roger Pressman, “Software Engineering: A Practitioner‘s Approach”, 9th edition ,
McGraw-Hill Publications, 2019
2 Ian Sommerville, “Software Engineering”, 9th edition, Pearson Education, 2011
3 Ali Behfrooz and Fredeick J. Hudson, "Software Engineering Fundamentals", Oxford
University Press, 1997
4 Grady Booch, James Rambaugh, Ivar Jacobson, “The unified modeling language user
guide”, 2nd edition, Pearson Education, 2005
References:
1 Pankaj Jalote, "An integrated approach to Software Engineering", 3rd edition, Springer,
2005
2 Rajib Mall, "Fundamentals of Software Engineering", 5th edition, Prentice Hall India, 2014
3 Jibitesh Mishra and Ashok Mohanty, “Software Engineering”, Pearson , 2011
4 Ugrasen Suman, “Software Engineering – Concepts and Practices”, Cengage Learning,
2013
5 Waman S Jawadekar, “Software Engineering principles and practice”, McGraw Hill
Education, 2004
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 the second-class test when an additional 40% syllabus is
1 Question paper will comprise a total of six questions.
3 Only Four questions need to be solved.
lecture hours as mentioned in the syllabus.
Useful Links
2 https://onlinecourses.nptel.ac.in/noc19_cs69/preview
3 https://www.mooc-list.com/course/software-engineering-introduction-edx
CSC503 Computer Network 3
Prerequisite: None
Course Objectives:
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 various transport layer and 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 Explore different design issues at data link layer.
3 Design the network using IP addressing and sub netting / supernetting schemes.
4 Analyze transport layer protocols and congestion control algorithms.
5 Explore protocols at application layer
Module Content Hrs

1 Introduction to Networking 4
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 layers.
2 Physical Layer 3
2.1 Introduction to Communication Electromagnetic Spectrum
2.2 Guided Transmission Media: Twisted pair, Coaxial, Fiber optics.
3 Data Link Layer 8
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)
Medium Access Control sublayer
3.2 Channel Allocation problem, Multiple access Protocol( Aloha, Carrier
Sense Multiple Access (CSMA/CD)
4 Network layer 12
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), IPv6
Routing algorithms : Shortest Path (Dijkastra‘s), Link state routing,
4.2 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 6
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 6
6.1 DNS: Name Space, Resource Record and Types of Name Server. HTTP,
SMTP, Telnet, FTP, DHCP
Textbooks:
1 A.S. Tanenbaum, Computer Networks,4th edition Pearson Education
2 B.A. Forouzan, Data Communications and Networking, 5th edition, TMH
3 James F. Kurose, Keith W. Ross, Computer Networking, A Top-Down Approach
Featuring the Internet,6th edition, Addison Wesley
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
Assessment:
Useful Links
1 https://www.netacad.com/courses/networking/networking-essentials
2 https://www.coursera.org/learn/computer-networking
3 https://nptel.ac.in/courses/106/105/106105081
4 https://www.edx.org/course/introduction-to-networking
CSC504 Data Warehousing and Mining 3
Prerequisite: Database Concepts

Course Objectives:
1. To identify the significance of Data Warehousing and Mining.
2. To analyze data, choose relevant models and algorithms for respective applications.
3. To study web data mining.
4. To develop research interest towards advances in data mining.
Course Outcomes: At the end of the course, the student will be able to
1. Understand data warehouse fundamentals and design data warehouse with dimensional
modelling and apply OLAP operations.
2. Understand data mining principles and perform Data preprocessing and Visualization.
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 information and social networks with respect to web mining.
Module Content Hrs

1 Data Warehousing Fundamentals 8
Introduction to Data Warehouse, Data warehouse architecture, Data warehouse
versus Data Marts, E-R Modeling versus Dimensional Modeling, Information
Package Diagram, Data Warehouse Schemas; Star Schema, Snowflake Schema,
Factless Fact Table, Fact Constellation Schema. Update to the dimension tables.
Major steps in ETL process, OLTP versus OLAP, OLAP operations: Slice, Dice,
Rollup, Drilldown and Pivot.
2 Introduction to Data Mining, Data Exploration and Data Pre-processing 8
Data Mining Task Primitives, Architecture, KDD process, Issues in Data Mining,
Applications of Data Mining, Data Exploration: Types of Attributes, Statistical
Description of Data, Data Visualization, Data Preprocessing: Descriptive data
summarization, Cleaning, Integration & transformation, Data reduction, Data
Discretization and Concept hierarchy generation.
3 Classification 6
Basic Concepts, Decision Tree Induction, Naïve Bayesian Classification,
Accuracy and Error measures, Evaluating the Accuracy of a Classifier: Holdout
& Random Subsampling, Cross Validation, Bootstrap.
4 Clustering 6
Types of data in Cluster analysis, Partitioning Methods (k-Means, k-Medoids),
Hierarchical Methods (Agglomerative, Divisive).
5 Mining frequent patterns and associations 6
Market Basket Analysis, Frequent Item sets, Closed Item sets, and Association
Rule, Frequent Pattern Mining, Apriori Algorithm, Association Rule Generation,
Improving the Efficiency of Apriori, Mining Frequent Itemsets without candidate
generation, Introduction to Mining Multilevel Association Rules and Mining
Multidimensional Association Rules.
6 Web Mining 5
Introduction, Web Content Mining: Crawlers, Harvest System, Virtual Web View,
Personalization, Web Structure Mining: Page Rank, Clever, Web Usage Mining.
Textbooks:
1 Paulraj Ponniah, “ Data Warehousing: Fundamentals for IT Professionals”, Wiley India.
2 Han, Kamber, “Data Mining Concepts and Techniques”, Morgan Kaufmann 2nd edition.
3 M.H. Dunham, “Data Mining Introductory and Advanced Topics”, Pearson Education.
References:
1 Reema Theraja, “Data warehousing”, Oxford University Press 2009.
2 Pang-Ning Tan, Michael Steinbach and Vipin Kumar, “Introduction to Data Mining”,
Pearson Publisher 2nd edition.
3 Ian H. Witten, Eibe Frank and Mark A. Hall, “Data Mining”, Morgan Kaufmann 3rd edition.
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
3 Questions will be mixed in nature (for example, If Q.2 part (a) from module 3 then part (b)
can be from any module other than module 3)
5 In question paper weightage of each module will be proportional to the number of respective
Useful Links
1 https://onlinecourses.nptel.ac.in/noc20_cs12/preview
2 https://www.coursera.org/specializations/data-mining
CSDLO5011 Probabilistic Graphical Models 3
Prerequisite: Engineering Mathematics, Discrete Structure

Course Objectives:
1 To give comprehensive introduction of probabilistic graphical models
2 To make inferences, learning, actions and decisions while applying these models
3 To introduce real-world trade-offs when using probabilistic graphical models in practice
4 To develop the knowledge and skills necessary to apply these models to solve real world
problems.
1 Understand basic concepts of probabilistic graphical modelling.
2 Model and extract inference from various graphical models like Bayesian Networks, Markov
Models
3 Perform learning and take actions and decisions using probabilistic graphical models
4 Represent real world problems using graphical models; design inference algorithms; and learn
the structure of the graphical model from data.
5 Design real life applications using probabilistic graphical models.
Module Content Hrs
1. Introduction to Probabilistic Graphical Modeling 5

1.1 Introduction to Probability Theory:
Probability Theory, Basic Concepts in Probability, Random
Variables and Joint Distribution, Independence and Conditional
Independence, Continuous Spaces, Expectation and Variances
1.2 Introduction to Graphs: Nodes and Edges, Subgraphs, Paths and
Trails, Cycles and Loops
1.3 Introduction to Probabilistic Graph Models: Bayesian Network,
Markov Model, Hidden Markov Model
1.4 Applications of PGM
2. Bayesian Network Model and Inference 10
2.1 Directed Graph Model: Bayesian Network-Exploiting Independence

Properties, Naive Bayes Model, Bayesian Network Model,
Reasoning Patterns, Basic Independencies in Bayesian Networks,
Bayesian Network Semantics, Graphs and Distributions. Modelling:
Picking variables, Picking Structure, Picking Probabilities, D-
separation
2.2 Local Probabilistic Models: Tabular CPDs, Deterministic CPDs,

Context Specific CPDs, Generalized Linear Models.
2.3 Exact inference variable elimination: Analysis of Complexity,
Variable Elimination, Conditioning, Inference with Structured CPDs.
3. Markov Network Model and Inference 8

3.1 Undirected Graph Model : Markov Model-Markov Network,
Parameterization of Markov Network, Gibb's distribution, Reduced
Markov Network, Markov Network Independencies, From
Distributions to Graphs, Fine Grained Parameterization, Over
Parameterization
3.2 Exact inference variable elimination: Graph Theoretic Analysis for
Variable Elimination, Conditioning
4. Hidden Markov Model and Inference 6
4.1 Template Based Graph Model : HMM- Temporal Models, Template
Variables and Template Factors, Directed Probabilistic Models,
Undirected Representation, Structural Uncertainty.
5. Learning and Taking Actions and Decisions 6
5.1 Learning Graphical Models: Goals of Learning, Density Estimation,
Specific Prediction Tasks, Knowledge Discovery. Learning as
Optimization: Empirical Risk, over fitting, Generalization,
Evaluating Generalization Performance, Selecting a Learning
Procedure, Goodness of fit, Learning Tasks. Parameter Estimation:
Maximum Likelihood Estimation, MLE for Bayesian Networks
5.2 Causality: Conditioning and Intervention, Correlation and Causation,
Causal Models, Structural Causal Identifiability, Mechanisms and
Response Variables, Learning Causal Models. Utilities and
Decisions: Maximizing Expected Utility, Utility Curves, Utility
Elicitation. Structured Decision Problems: Decision Tree
6. Applications 4
6.1 Application of Bayesian Networks: Classification, Forecasting,
Decision Making
6.2 Application of Markov Models: Cost Effectiveness Analysis,
Relational Markov Model and its Applications, Application in
Portfolio Optimization
6.3 Application of HMM: Speech Recognition, Part of Speech Tagging,
Bioinformatics.
Textbooks:
1. Daphne Koller and Nir Friedman, "Probabilistic Graphical Models: Principles

and Techniques”, Cambridge, MA: The MIT Press, 2009 (ISBN 978-0-262-0139-
2).
2. David Barber, "Bayesian Reasoning and Machine Learning", Cambridge

University Press, 1st edition, 2011.
References:
1. Finn Jensen and Thomas Nielsen, "Bayesian Networks and Decision Graphs
(Information Science and Statistics )", 2nd Edition, Springer, 2007.
2. Kevin P. Murphy, "Machine Learning: A Probabilistic Perspective", MIT Press,

2012.
3. Martin Wainwright and Michael Jordan, M., "Graphical Models, Exponential

Families, and Variational Inference", 2008.
Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be m
onducted when approx. 40% syllabus is completed and second class test when additional
40% syllabus is completed. Duration of each test shall be one hour.
1. Question paper will comprise of total six questions.
2. All question carries 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.

respective lecture hours as mention in the syllabus.
Useful Links
1. https://www.coursera.org/specializations/probabilistic-graphical-models
2. https://www.mooc-list.com/tags/probabilistic-graphical-models
3. https://scholarship.claremont.edu/cgi/viewcontent.cgi?referer=https://www.google.c
om/&httpsredir=1&article=2690&context=cmc_theses
4. https://www.upgrad.com/blog/bayesian-networks/
5. https://www.utas.edu.au/__data/assets/pdf_file/0009/588474/TR_14_BNs_a_resour
ce_guide.pdf
6. https://math.libretexts.org/Bookshelves/Applied_Mathematics/Book%3A_Applied_
Finite_Mathematics_(Sekhon_and_Bloom)/10%3A_Markov_Chains/10.02%3A_A
pplications_of_Markov_Chains/10.2.01%3A_Applications_of_Markov_Chains_(E
xercises)
7. https://link.springer.com/chapter/10.1007/978-3-319-43742-2_24
8. https://homes.cs.washington.edu/~pedrod/papers/kdd02a.pdf
9. https://core.ac.uk/download/pdf/191938826.pdf
10. https://cs.brown.edu/research/pubs/theses/ugrad/2005/dbooksta.pdf
11. https://web.ece.ucsb.edu/Faculty/Rabiner/ece259/Reprints/tutorial%20on%20hmm
%20and%20applications.pdf
12. https://mi.eng.cam.ac.uk/~mjfg/mjfg_NOW.pdf
13. http://bioinfo.au.tsinghua.edu.cn/member/jgu/pgm/materials/Chapter3-
LocalProbabilisticModels.pdf
Sr. No Experiment
1. Experiment on Probability Theory
2. Experiment on Graph Theory
3. Experiment on Bayesian Network Modelling
4. Experiment on Markov Chain Modeling
5. Experiment on HMM
6. Experiment on Maximum Likelihood Estimation
7. Decision Making using Decision Trees
8. Learning with Optimization
** Suggestion: Laboratory work based on above syllabus can be incorporated along with
mini project in CSM501: Mini-Project.
CSDLO5012 Internet Programming 3
Prerequisite: Data Structures

Course Objectives:
1 To get familiar with the basics of Internet Programming.
2 To acquire knowledge and skills for creation of web site considering both client and server-
side programming
3 To gain ability to develop responsive web applications
4 To explore different web extensions and web services standards
5 To learn characteristics of RIA
6 To learn React js
Course Outcomes:
1 Implement interactive web page(s) using HTML and CSS.
2 Design a responsive web site using JavaScript
3 Demonstrate database connectivity using JDBC
4 Demonstrate Rich Internet Application using Ajax
5 Demonstrate and differentiate various Web Extensions.
6 Demonstrate web application using Reactive Js
Module Content Hrs

1 Introduction to Web Technology 10
1.1 Web Essentials: Clients, Servers and Communication, The Internet,
Basic Internet protocols, World wide web, HTTP Request Message,
HTTP Response Message, Web Clients, Web Servers
HTML5 – fundamental syntax and semantics, Tables, Lists, Image,
HTML5 control elements, Semantic elements, Drag and Drop, Audio –
Video controls
CSS3 – Inline, embedded and external style sheets – Rule cascading,
Inheritance, Backgrounds, Border Images, Colors, Shadows, Text,
Transformations, Transitions, Animation, Basics of Bootstrap.
2 Front End Development 7
2.1 Java Script: An introduction to JavaScript–JavaScript DOM Model-
Date and Objects-Regular Expressions- Exception Handling-
Validation-Built-in objects-Event Handling, DHTML with JavaScript-
JSON introduction – Syntax – Function Files – Http Request –SQL.
3. Back End Development 7
3.1 Servlets: Java Servlet Architecture, Servlet Life Cycle, Form GET and
POST actions, Session Handling, Understanding Cookies, Installing
and Configuring Apache Tomcat Web Server,
Database Connectivity: JDBC perspectives, JDBC program example
JSP: Understanding Java Server Pages, JSP Standard Tag Library
(JSTL), Creating HTML forms by embedding JSP code.
4 Rich Internet Application (RIA) 4
4.1 Characteristics of RIA,
Introduction to AJAX: AJAX design basics, AJAX vs Traditional
Approach, Rich User Interface using Ajax, jQuery framework with
AJAX.
5 Web Extension: PHP and XML 6
5.1 XML –DTD (Document Type Definition), XML Schema, Document
Object Model, Presenting XML, Using XML Parsers: DOM and SAX,
XSL-eXtensible Stylesheet Language
5.2 Introduction to PHP- Data types, control structures, built in functions,
building web applications using PHP- tracking users, PHP and
MySQLdatabase connectivity with example.
6 React js 5
6.1 Introduction, React features, App “Hello World” Application,
Introduction to JSX, Simple Application using JSX.
39
Textbooks:
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 Edition, 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_MySQ
L_Javascript_CSS_HTML5__Robin_Nixon_3e.pdf)
4 Dana Moore, Raymond Budd, Edward Benson,Professional Rich Internet Applications:
AJAX and Beyond Wiley publications. https://ebooks-it.org/0470082801-ebook.htm
5. Alex Banks and Eve Porcello, Learning React Functional Web Development with React
and Redux,OREILLY, First Edition
References:
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
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.
Assessment:
Assessment consists of two class tests of 20 marks each. The firstclass test is to be conducted
when approx. 40% syllabus is completed and the secondclass test when an additional 40%
syllabus is completed. Duration of each test shall be one hour.
Useful Links
1 https://books.goalkicker.com/ReactJSBook/
2 https://www.guru99.com/reactjs-tutorial.html
3 www.nptelvideos.in
4 www.w3schools.com
5 https://spoken-tutorial.org/
6 www.coursera.org
The following list can be used as a guideline for mini project:
1 Create Simple web page using HTML5
2 Design and Implement web page using CSS3 and HTML5
3 Form Design and Client-Side Validation using: a. Javascript and HTML5, b. Javascript
and Jquery
4 Develop interactive web pages using HTML 5 with JDBC database connectivity
5 Develop simple web page using PHP
6 Develop interactive web pages using PHP with database connectivity MYSQL
7 Develop XML web page using DTD, XSL
8 Implement a web page using Ajax and PHP
9 Case study based on Reactive js
10 Installation of the React DOM library.
* Suggestion: Laboratory work based on above syllabus can be incorporated as mini
project in CSM501: Mini-Project.
CSDLO5013 Advance Database Management System 3
Prerequisite: Database Management System

Course Objectives:
1 To provide insights into distributed database designing
2 To specify the various approaches used for using XML and JSON technologies.
3 To apply the concepts behind the various types of NoSQL databases and utilize it for Mongodb
4 To learn about the trends in advance databases
Course Outcomes: After the successful completion of this course learner will be able to:
1 Design distributed database using the various techniques for query processing
2 Measure query cost and perform distributed transaction management
3 Organize the data using XML and JSON database for better interoperability
4 Compare different types of NoSQL databases
5 Formulate NoSQL queries using Mongodb
6 Describe various trends in advance databases through temporal, graph based and spatial
based databases
Module Content Hrs

1 Distributed Databases 3
1.1 Introduction, Distributed DBMS Architecture, Data Fragmentation,
Replication and Allocation Techniques for Distributed Database Design.
2 Distributed Database Handling 8

2.1 Distributed Transaction Management – Definition, properties, types,
architecture
Distributed Query Processing - Characterization of Query Processors,
Layers/ phases of query processing.
2.2 Distributed Concurrency Control- Taxonomy, Locking based, Basic TO
algorithm,
Recovery in Distributed Databases: Failures in distributed database, 2PC
and 3PC protocol.
3 Data interoperability – XML and JSON 6

3.1 XML Databases: Document Type Definition, XML Schema, Querying and
Transformation: XPath and XQuery.
3.2 Basic JSON syntax, (Java Script Object Notation),JSON data types,
Stringifying and parsing the JSON for sending & receiving, JSON Object
retrieval using key-value pair and JQuery, XML Vs JSON
4 NoSQL Distribution Model 10

4.1 NoSQL database concepts: NoSQL data modeling, Benefits of NoSQL,
comparison between SQL and NoSQL database system.
4.2 Replication and sharding, Distribution Models Consistency in distributed
data, CAP theorem, Notion of ACID Vs BASE, handling Transactions,
consistency and eventual consistency
4.3 Types of NoSQL databases: Key-value data store, Document database and
Column Family Data store, Comparison of NoSQL databases w.r.t CAP
theorem and ACID properties.
5 NoSQL using MongoDB 6

5.1 NoSQL using MongoDB: Introduction to MongoDB Shell, Running the
MongoDB shell, MongoDB client, Basic operations with MongoDB shell,
Basic Data Types, Arrays, Embedded Documents
5.2 Querying MongoDB using find() functions, advanced queries using logical
operators and sorting, simple aggregate functions, saving and updating
document.
MongoDB Distributed environment: Concepts of replication and horizonal
scaling through sharding in MongoDB
6 Trends in advance databases 6

6.1 Temporal database: Concepts, time representation, time dimension,
incorporating time in relational databases.
6.2 Graph Database: Introduction, Features, Transactions, consistency,
Availability, Querying, Case Study Neo4J
6.3 Spatial database: Introduction, data types, models, operators and queries
39
Textbooks:
1 Korth, Siberchatz,Sudarshan, “Database System Concepts”, 6thEdition, McGraw Hill
2 Elmasri and Navathe, “Fundamentals of Database Systems”, 5thEdition, Pearson Education
3 Ozsu, M. Tamer, Valduriez, Patrick, “Principles of distributed database systems”,3rd Edition,
Pearson Education, Inc.
4 PramodSadalge, Martin Fowler, NoSQL Distilled: A Brief Guide to the Emerging World of
Polyglot Persistence, Addison Wesely/ Pearson
5 Jeff Friesen , Java XML and JSON,Second Edition, 2019, après Inc.
References:
1 Peter Rob and Carlos Coronel,Database Systems Design, Implementation and Management,
Thomson Learning, 5thEdition.
2 Dr. P.S. Deshpande, SQL and PL/SQL for Oracle 10g, Black Book, Dreamtech Press.
3 Adam Fowler, NoSQL for dummies, John Wiley & Sons, Inc.
4 Shashank Tiwari, Professional NOSQL, John Willy & Sons. Inc
5 Raghu Ramkrishnan and Johannes Gehrke, Database Management Systems, TMH
6 MongoDB Manual : https://docs.mongodb.com/manual
Assessment:
NOTE: Suggested that in Mini Projects (CSM501) can be included NoSQL databases for
implementation as a backend.
Useful Links
1 https://cassandra.apache.org
2 https://www.mongodb.com
3 https://riak.com
4 https://neo4j.com
5 https://martinfowler.com/articles/nosql-intro-original.pdf
CSL501 Software Engineering Lab 1
Prerequisite: Object Oriented Programming with Java , Python Programming

Lab Objectives:
1 To solve real life problems by applying software engineering principles
2 To impart state-of-the-art knowledge on Software Engineering
Lab Outcomes: On successful completion of laboratory experiments, learners will be able to :
1 Identify requirements and apply software process model to selected case study.
2 Develop architectural models for the selected case study.
3 Use computer-aided software engineering (CASE) tools.
Suggested List of Experiments - Assign the case study/project as detail statement of problem
to a group of two/three students. Laboratory work will be based on course syllabus with
minimum 10 experiments. Open source computer-aided software engineering (CASE) tools can
be used for performing the experiment.
Sr. No. Title of Experiment
1 Application of at least two traditional process models.
2 Application of the Agile process models.
3 Preparation of software requirement specification (SRS) document in IEEE format.
4 Structured data flow analysis.
5 Use of metrics to estimate the cost.
6 Scheduling & tracking of the project.
7 Write test cases for black box testing.
8 Write test cases for white box testing.
9 Preparation of Risk Mitigation, Monitoring and Management Plan (RMMM).
10 Version controlling of the project.
Term Work:
2 Journal must include at least 2 assignments on content of theory and practical of “Software
Engineering”
Based on the entire syllabus of CSC502 and CSL501 syllabus
CSL502 Computer Network Lab 1
Prerequisite: None
Lab Objectives:
1 To practically explore OSI layers and understand the usage of simulation tools.
2 To analyze, specify and design the topological and routing strategies for an IP based
networking infrastructure.
3 To identify the various issues of a packet transfer from source to destination, and how they
are resolved by the various existing protocols
Lab Outcomes: On successful completion of lab, 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.

1. Study of RJ45 and CAT6 Cabling and connection using crimping tool.
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. Setup a network and configure IP addressing, subnetting, masking.
4. Perform network discovery using discovery tools (eg. Nmap, mrtg)
5. Use Wire shark 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. Use simulator (Eg. NS2) to understand functioning of ALOHA, CSMA/CD.
7. Study and Installation of Network Simulator (NS3)
8. a. Set up multiple IP addresses on a single LAN.
b. Using nestat and route commands of Linux, do the following:
● View current routing table
● Add and delete routes
● Change default gateway
c. Perform packet filtering by enabling IP forwarding using IPtables in Linux.
9 Design VPN and Configure RIP/OSPF using Packet tracer.
10. Socket programming using TCP or UDP
11. Perform File Transfer and Access using FTP
12. Perform Remote login using Telnet server
Term Work:
2 Journal must include at least 2 assignments on content of theory and practical of “Computer
Network”
Based on the entire syllabus of CSC503: Computer Network
Useful Links
1 https://www.netacad.com/courses/packet-tracer/introduction-packet-tracer
2 https://www.coursera.org/projects/data-forwarding-computer-networks
3 https://www.edx.org/course/ilabx-the-internet-masterclass
CSL503 Data Warehousing and Mining Lab 1
Prerequisite: Database Concepts

Lab Objectives:
1. Learn how to build a data warehouse and query it.
2. Learn about the data sets and data preprocessing.
3. Demonstrate the working of algorithms for data mining tasks such Classification,
clustering, Association rule mining & Web mining
4. Apply the data mining techniques with varied input values for different parameters.
5. Explore open source software (like WEKA) to perform data mining tasks.
Lab Outcomes: At the end of the course, the student will be able to
1. Design data warehouse and perform various OLAP operations.
2. Implement data mining algorithms like classification.
3. Implement clustering algorithms on a given set of data sample.
4. Implement Association rule mining & web mining algorithm.

No.
1 One case study on building Data warehouse/Data Mart
 Write Detailed Problem statement and design dimensional modelling (creation of star
and snowflake schema)
2 Implementation of all dimension table and fact table based on experiment 1 case study
3 Implementation of OLAP operations: Slice, Dice, Rollup, Drilldown and Pivot based on
experiment 1 case study
4 Implementation of Bayesian algorithm
5 Implementation of Data Discretization (any one) & Visualization (any one)
6 Perform data Pre-processing task and demonstrate Classification, Clustering, Association
algorithm on data sets using data mining tool (WEKA/R tool)
7 Implementation of Clustering algorithm (K-means/K-medoids)
8 Implementation of any one Hierarchical Clustering method
9 Implementation of Association Rule Mining algorithm (Apriori)
10 Implementation of Page rank/HITS algorithm
Term Work:
2 Journal must include at least 1 assignment on content of theory and practical of “Data
Warehousing and Mining”
3 The final certification and acceptance of term work ensures that satisfactory performance
of laboratory work and minimum passing marks in term work.
4 Total 25 Marks (Experiments: 15-marks, Attendance (Theory & Practical): 05-marks,
Based on the entire syllabus of CSC504 : Data Warehousing and Mining
CSL504 Business Communication & Ethics II 02
Course Rationale: This curriculum is designed to build up a professional and ethical approach,
effective oral and written communication with enhanced soft skills. Through practical sessions, it
augments student's interactive competence and confidence to respond appropriately and creatively to
the implied challenges of the global Industrial and Corporate requirements. It further inculcates the
social responsibility of engineers as technical citizens.
Course Objectives
1 To discern and develop an effective style of writing important technical/business documents.
2 To investigate possible resources and plan a successful job campaign.
3 To understand the dynamics of professional communication in the form of group discussions,
meetings, etc. required for career enhancement.
4 To develop creative and impactful presentation skills.
5 To analyze personal traits, interests, values, aptitudes and skills.
6 To understand the importance of integrity and develop a personal code of ethics.
1 Plan and prepare effective business/ technical documents which will in turn provide solid
foundation for their future managerial roles.
2 Strategize their personal and professional skills to build a professional image and meet
the demands of the industry.
3 Emerge successful in group discussions, meetings and result-oriented agreeable solutions in
group communication situations.
4 Deliver persuasive and professional presentations.
5 Develop creative thinking and interpersonal skills required for effective professional
communication.
6 Apply codes of ethical conduct, personal integrity and norms of organizational behaviour.
Module Contents Hours

ADVANCED TECHNICAL WRITING: PROJECT/PROBLEM
1 06
BASED LEARNING (PBL)
Purpose and Classification of Reports:
Classification on the basis of: Subject Matter (Technology, Accounting,
Finance, Marketing, etc.), Time Interval (Periodic, One-time, Special),
Function (Informational, Analytical, etc.), Physical Factors (Memorandum,
Letter, Short & Long)
Parts of a Long Formal Report: Prefatory Parts (Front Matter), Report
Proper (Main Body), Appended Parts (Back Matter)
Language and Style of Reports: Tense, Person & Voice of Reports,
Numbering Style of Chapters, Sections, Figures, Tables and Equations,
Referencing Styles in APA & MLA Format, Proofreading through Plagiarism
Checkers
Definition, Purpose & Types of Proposals: Solicited (in conformance with
RFP) & Unsolicited Proposals, Types (Short and Long proposals)
Parts of a Proposal: Elements, Scope and Limitations, Conclusion
Technical Paper Writing: Parts of a Technical Paper (Abstract, Introduction,
Research Methods, Findings and Analysis, Discussion, Limitations, Future
Scope and References), Language and Formatting, Referencing in IEEE
Format
2 EMPLOYMENT SKILLS 06
Cover Letter & Resume: Parts and Content of a Cover Letter, Difference
between Bio-data, Resume & CV, Essential Parts of a Resume, Types of
Resume (Chronological, Functional & Combination)
Statement of Purpose: Importance of SOP, Tips for Writing an Effective SOP
Verbal Aptitude Test: Modelled on CAT, GRE, GMAT exams
Group Discussions: Purpose of a GD, Parameters of Evaluating a GD,
Types of GDs (Normal, Case-based & Role Plays), GD Etiquettes
Personal Interviews: Planning and Preparation, Types of Questions,
Types of Interviews (Structured, Stress, Behavioural, Problem Solving &
Case-based), Modes of Interviews: Face-to-face (One-to one and Panel)
Telephonic, Virtual
3 BUSINESS MEETINGS 02
Conducting Business Meetings: Types of Meetings, Roles and
Responsibilities of Chairperson, Secretary and Members, Meeting
Etiquette
Documentation: Notice, Agenda, Minutes
4 TECHNICAL/ BUSINESS PRESENTATIONS 02
Effective Presentation Strategies: Defining Purpose, Analyzing
Audience, Location and Event, Gathering, Selecting &Arranging
Material, structuring a Presentation, Making Effective Slides, Types of
Presentations Aids, Closing a Presentation, Platform skills
Group Presentations: Sharing Responsibility in a Team, Building the
contents and visuals together, Transition Phases
5 INTERPERSONAL SKILLS 08
Interpersonal Skills: Emotional Intelligence, Leadership & Motivation,
Conflict Management & Negotiation, Time Management, Assertiveness,
Decision Making
Start-up Skills: Financial Literacy, Risk Assessment, Data Analysis
(e.g. Consumer Behaviour, Market Trends, etc.)
6 CORPORATE ETHICS 02
Intellectual Property Rights: Copyrights, Trademarks, Patents,
Industrial Designs, Geographical Indications, Integrated Circuits, Trade
Secrets (Undisclosed Information)
Case Studies: Cases related to Business/ Corporate Ethics
List of assignments: (In the form of Short Notes, Questionnaire/ MCQ Test, Role Play,
Case Study, Quiz, etc.)
No.
1 Cover Letter and Resume
2 Short Proposal
3 Meeting Documentation
4 Writing a Technical Paper/ Analyzing a Published Technical Paper
5 Writing a SOP
6 IPR
7 Interpersonal Skills
Note:
1 The Main Body of the project/book report should contain minimum 25 pages (excluding Front
and Back matter).
2 The group size for the final report presentation should not be less than 5 students or exceed 7
students.
3 There will be an end–semester presentation based on the book report.
Assessment:
Term Work:
1 Term work shall consist of minimum 8 experiments.
2 The distribution of marks for term work shall be as follows:
Assignment : 10 Marks
Attendance : 5 Marks
Presentation slides : 5 Marks
Book Report (hard copy) : 5 Marks
3 The final certification and acceptance of term work ensures the satisfactory performance of
laboratory work and minimum passing in the term work.
Internal oral: Oral Examination will be based on a GD & the Project/Book Report presentation.
Group Discussion : 10 marks
Project Presentation : 10 Marks
Group Dynamics : 5 Marks
Books Recommended: Textbooks and Reference books
1 Arms, V. M. (2005). Humanities for the engineering curriculum: With selected
chapters from Olsen/Huckin: Technical writing and professional communication,
second edition. Boston, MA: McGraw-Hill.
2 Bovée, C. L., &Thill, J. V. (2021). Business communication today. Upper Saddle
River, NJ: Pearson.
3 Butterfield, J. (2017). Verbal communication: Soft skills for a digital workplace.
Boston, MA: Cengage Learning.
4 Masters, L. A., Wallace, H. R., & Harwood, L. (2011). Personal development for life
and work. Mason: South-Western Cengage Learning.
5 Robbins, S. P., Judge, T. A., & Campbell, T. T. (2017). Organizational behaviour.
Harlow, England: Pearson.
6 Meenakshi Raman, Sangeeta Sharma (2004) Technical Communication, Principles and
Practice. Oxford University Press
7 Archana Ram (2018) Place Mentor, Tests of Aptitude for Placement Readiness.
Oxford University Press
8 Sanjay Kumar &PushpLata (2018). Communication Skills a workbook, New Delhi:
Oxford University Press.
CSM501 Mini Project 2A 02
Objectives
1 To understand and identify the problem
2 To apply basic engineering fundamentals and attempt to find solutions to the problems.
3 Identify, analyze, formulate and handle programming projects with a comprehensive and
systematic approach
4 To develop communication skills and improve teamwork amongst group members and
inculcate the process of self-learning and research.
1 Identify societal/research/innovation/entrepreneurship problems through appropriate
literature surveys
2 Identify Methodology for solving above problem and apply engineering knowledge and
skills to solve it
3 Validate, Verify the results using test cases/benchmark data/theoretical/
inferences/experiments/simulations
4 Analyze and evaluate the impact of solution/product/research/innovation
/entrepreneurship towards societal/environmental/sustainable development
5 Use standard norms of engineering practices and project management principles during
project work
6 Communicate through technical report writing and oral presentation.
● The work may result in research/white paper/ article/blog writing and publication
● The work may result in business plan for entrepreneurship product created
● The work may result in patent filing.
7 Gain technical competency towards participation in Competitions, Hackathons, etc.
8 Demonstrate capabilities of self-learning, leading to lifelong learning.
9 Develop interpersonal skills to work as a member of a group or as leader
1 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 (frontend-backend) and hardware, statistical data
analysis, creating awareness in society/environment etc.
2 Students shall form a group of 3 to 4 students, while forming a group shall not be
allowed less than three or more than four students, as it is a group activity.
statement for mini project in consultation with faculty supervisor or
head of department/internal committee of faculties.
4 Students shall submit an implementation plan in the form of Gantt/PERT/CPM chart,
which will cover weekly activity of mini projects.
5 A logbook may be prepared by each group, wherein the group can record weekly work
progress, guide/supervisor can verify and record notes/comments.
6 Faculty supervisors may give inputs to students during mini project activity; however,
focus shall be on self-learning.
7 Students under the guidance of faculty supervisor shall convert the best solution into a
working model using various components of their domain areas and demonstrate.
8 The solution to be validated with proper justification and report to be compiled in
standard format of University of Mumbai. Software requirement specification (SRS)
documents, research papers, competition certificates may be submitted as part of
annexure to the report.
9 With the focus on self-learning, innovation, addressing societal/research/innovation
problems and entrepreneurship quality development within the students through the Mini
Projects, it is preferable that a single project of appropriate level and quality be carried
out in two semesters by all the groups of the students. i.e. Mini Project 2 in semesters V
and VI.
mentioned above, gets completed in odd semester, then that group can be allowed to work
completely new project idea in even semester. This policy can be adopted on a case by
case basis.
Term Work
The review/ progress monitoring committee shall be constituted by the heads of departments of
each institute. The progress of the mini project to be evaluated on a continuous basis, based on
the SRS document submitted. minimum two reviews in each semester.
Distribution of Term work marks for both semesters shall be as below: Marks 25
Review / progress monitoring committee may consider following points for assessment
based on either one year or half year project as mentioned in general guidelines
One-year project:
1 In one-year project (sem V and VI), first semester the entire theoretical solution shall be
made ready, including components/system selection and cost analysis. Two reviews will
be conducted based on a presentation given by a student group.
First shall be for finalization of problem
Second shall be on finalization of proposed solution of problem.
2 In the second semester expected work shall be procurement of component’s/systems,
building of working prototype, testing and validation of results based on work completed
in an earlier semester.
First review is based on readiness of building working prototype to be conducted.
Second review shall be based on poster presentation cum demonstration of working
model in the last month of the said semester.
Half-year project:
Identification of need/problem
Proposed final solution
Procurement of components/systems
Building prototype and testing
First shall be for finalization of problem and proposed solution
Second shall be for implementation and testing of solution.
Mini Project shall be assessed based on following points
1 Clarity of problem and quality of literature Survey for problem identification
2 Requirement Gathering via SRS/ Feasibility Study
3 Completeness of methodology implemented
4 Design, Analysis and Further Plan
5 Novelty, Originality or Innovativeness of project
6 Societal / Research impact
7 Effective use of skill set : Standard engineering practices and Project management
standard
10 Verification and validation of the solution/ Test Cases
12 Technical writing /competition/hackathon outcome being met
In one year project (sem V and VI), first semester evaluation may be based on first 10 criteria and
projects.
In case of half year projects (completing in V sem) all criteria in generic may be considered for
evaluation of performance of students in mini projects.
the head of Institution.
3 Students shall be motivated to publish a paper/participate in competition based on the work

in Conferences/students competitions.
CSC601 System Programming and Compiler Construction 3
Prerequisite: Theoretical computer science, Operating system. Computer Organization and

Architecture .
Course Objectives:
1 To understand the role and functionality of various system programs over application
programs.
2 To understand basic concepts, structure and design of assemblers, macro processors, linkers
and loaders.
3 To understand the basic principles of compiler design, its various constituent parts,
algorithms and data structures required to be used in the compiler.
4 To understand the need to follow the syntax in writing an application program and to learn
how the analysis phase of compiler is designed to understand the programmer ‘s
requirements without ambiguity
5 To synthesize the analysis phase outcomes to produce the object code that is efficient in
terms of space and execution time
1 Identify the relevance of different system programs.
2 Explain various data structures used for assembler and microprocessor design.
3 Distinguish between different loaders and linkers and their contribution in developing
efficient user applications.
4 Understand fundamentals of compiler design and identify the relationships among different
phases of the compiler.
Module Content Hrs

1 Introduction to System Software 2
1.1 Concept of System Software, Goals of system software, system program
and system programming, Introduction to various system programs such
as Assembler, Macro processor, Loader, Linker, Compiler, Interpreter,
Device Drivers, Operating system, Editors, Debuggers.
2 Assemblers 7
2.1 Elements of Assembly Language programming, Assembly scheme, pass
structure of assembler, Assembler Design: Two pass assembler Design
and single pass Assembler Design for X86 processor, data structures used.
3 Macros and Macro Processor 6
3.1 Introduction, Macro definition and call, Features of Macro facility:
Simple, parameterized, conditional and nested. Design of Two pass macro
processor, data structures used.
4 Loaders and Linkers 6
4.1 Introduction, functions of loaders, Relocation and Linking concept,
Different loading schemes: Relocating loader, Direct Linking Loader,
Dynamic linking and loading.
5 Compilers: Analysis Phase 10
5.1 Introduction to compilers, Phases of compilers:
Lexical Analysis- Role of Finite State Automata in Lexical Analysis,
Design of Lexical analyzer, data structures used.
Syntax Analysis- Role of Context Free Grammar in Syntax analysis,
Types of Parsers: Top down parser- LL(1), Bottom up parser- SR Parser,
Operator precedence parser, SLR.
Semantic Analysis, Syntax directed definitions.
6 Compilers: Synthesis phase 8
6.1 Intermediate Code Generation: Types of Intermediate codes: Syntax
tree, Postfix notation, three address codes: Triples and Quadruples,
indirect triple. Code Optimization: Need and sources of optimization,
Code optimization techniques: Machine Dependent and Machine
Independent. Code Generation: Issues in the design of code generator,
code generation algorithm. Basic block and flow graph.
Textbooks:
1 D. M Dhamdhere: Systems programming and Operating Systems, Tata McGraw Hill,
Revised Second Edition
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, Edition 1991
References:
1 John R. Levine, Tony Mason & Doug Brown, Lex & YACC, O ‘Reilly publication, second
Edition
2 D, M .Dhamdhere ,Compiler construction 2e, Macmillan publication, second edition .
3 Kenneth C. Louden ,Compiler construction: principles and practices, Cengage Learning
4 Leland L. Beck, System software: An introduction to system programming, Pearson
publication, Third Edition
Useful Links for E-resources:
1 http://www.nptelvideos.in/2012/11/compiler-design.html
2 https://www.coursera.org/lecture/nand2tetris2/unit-4-1-syntax-analysis-5pC2Z
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 the second-class test when an additional 40%
CSC602 Cryptography & System Security 3
Prerequisite: Computer Networks

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.
4 To develop the ability to use existing cryptographic utilities to build programs for secure
communication
Course Outcomes:
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 different message digest and digital signature algorithms to verify integrity and
achieve authentication and design secure applications
4 Understand network security basics, analyse different attacks on networks and evaluate the
performance of firewalls and security protocols like SSL, IPSec, and PGP
5 Analyse and apply system security concept to recognize malicious code
Module Content Hrs

1 Introduction - Number Theory and Basic Cryptography 8
1.1 Security Goals, Attacks, Services and Mechanisms, Techniques. Modular
Arithmetic: Euclidean Algorithm, Fermat‘s and Euler‘s theorem
1.2 Classical Encryption techniques, Symmetric cipher model, mono-
alphabetic and polyalphabetic substitution techniques: Vigenere cipher,
playfair cipher, Hill cipher, transposition techniques: keyed and keyless
transposition ciphers
2 Symmetric and Asymmetric key Cryptography and key Management 11
2.1 Block cipher principles, block cipher modes of operation, DES,
Double DES, Triple DES, Advanced Encryption Standard (AES), Stream
Ciphers: RC4 algorithm.
2.2 Public key cryptography: Principles of public key cryptosystems- The
RSA Cryptosystem, The knapsack cryptosystem
2.3 Symmetric Key Distribution: KDC, Needham-schroeder protocol.
Kerberos: Kerberos Authentication protocol, Symmetric key agreement:
Diffie Hellman, Public key Distribution: Digital Certificate: X.509, PKI
3 Cryptographic Hash Functions 3
3.1 Cryptographic hash functions, Properties of secure hash function, MD5,
SHA-1, MAC, HMAC, CMAC.
4 Authentication Protocols & Digital Signature Schemes 5
4.1 User Authentication, Entity Authentication: Password Base, Challenge
Response Based
4.2 Digital Signature, Attacks on Digital Signature, Digital Signature Scheme:
RSA
5 Network Security and Applications 9
5.1 Network security basics: TCP/IP vulnerabilities (Layer wise), Network
Attacks: Packet Sniffing, ARP spoofing, port scanning, IP spoofing
5.2 Denial of Service: DOS attacks, ICMP flood, SYN flood, UDP flood,
Distributed Denial of Service
5.3 Internet Security Protocols: PGP, SSL, IPSEC. Network security: IDS,
Firewalls
6 System Security 3
6.1 Buffer Overflow, malicious Programs: Worms and Viruses, SQL injection
Textbooks:
1 William Stallings, “Cryptography and Network Security, Principles and Practice”, 6th
Edition, Pearson Education, March 2013
2 Behrouz A. Ferouzan, “Cryptography & Network Security”, Tata McGraw Hill
3 Behrouz A. Forouzan & Debdeep Mukhopadhyay, “Cryptography and Network
Security” 3rd Edition, McGraw Hill
Referecebooks:
1 Bruce Schneier, “Applied Cryptography, Protocols Algorithms and Source Code in C”,
Second Edition, Wiley.
2 Atul Kahate, “Cryptography and Network Security”, Tata McGraw-Hill Education, 2003.
3 Eric Cole, “Network Security Bible”, Second Edition, Wiley, 2011.
Assessment:
Useful Links
1 https://github.com/cmin764/cmiN/blob/master/FII/L3/SI/book/W.Stallings%20-
%20Cryptography%20and%20Network%20Security%206th%20ed.pdf
2 https://docs.google.com/file/d/0B5F6yMKYDUbrYXE4X1ZCUHpLNnc/view
CSC603 Mobile Computing 3

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.
1 To identify basic concepts and principles in 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 Long Term Evolution (LTE) architecture and its interfaces.
Module Content Hrs

1 Introduction to Mobile Computing 4
1.1 Introduction to Mobile Computing, Telecommunication Generations,
Cellular systems,
1.2 Electromagnetic Spectrum, Antenna, Signal Propagation, Signal
Characteristics, Multiplexing, Spread Spectrum: DSSS & FHSS, Co-
channel interference
2 GSM Mobile services 8
2.1 GSM Mobile services, System Architecture, Radio interface, Protocols,
Localization and Calling, Handover, security (A3, A5 & A8)
2.2 GPRS system and protocol architecture
2.3 UTRAN, UMTS core network; Improvements on Core Network,
3 Mobile Networking 8
3.1 Medium Access Protocol, Internet Protocol and Transport layer
3.2 Mobile IP: IP Packet Delivery, Agent Advertisement and Discovery,
Registration, Tunneling and Encapsulation, Reverse Tunneling.
3.3 Mobile TCP: Traditional TCP, Classical TCP Improvements like Indirect
TCP, Snooping TCP & Mobile TCP, Fast Retransmit/ Fast Recovery,
Transmission/Timeout Freezing, Selective Retransmission
4 Wireless Local Area Networks 6
4.1 Wireless Local Area Networks: Introduction, Infrastructure 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
standard
4.3 Wi-Fi security : WEP ,WPA, Wireless LAN Threats , Securing Wireless
Networks
4.4 Bluetooth: Introduction, User Scenario, Architecture, protocol stack
5 Mobility Management 6
5.1 Mobility Management : Introduction, IP Mobility, Optimization, IPv6
5.2 Macro Mobility : MIPv6, FMIPv6
5.3 Micro Mobility: CellularIP, HAWAII, HMIPv6
6 Long-Term Evolution (LTE) of 3GPP 7
6.1 Long-Term Evolution (LTE) of 3GPP : LTE System 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 Self Organizing Network (SON-LTE), SON for Heterogeneous Networks
(HetNet), Comparison between Different Generations (2G, 3G, 4G and 5G),
Introduction to 5G
Textbooks:
1 Jochen Schilller, “Mobile Communication”, Addision wisely, Pearson Education
2 William Stallings “Wireless Communications & Networks”, Second Edition, Pearson
Education
3 Christopher Cox, “An Introduction to LTE: LTE, LTE-Advanced, SAE and 4G
Mobile Communications”, Wiley publications
4 Raj Kamal, “Mobile Computing”, 2/e, Oxford University Press-New
References:
1 Seppo Hamalainen, Henning Sanneck , Cinzia Sartori, “LTE Self-Organizing
Networks (SON): Network Management Automation for Operational Efficiency”,
Wiley publications
2 Ashutosh Dutta, Henning Schulzrinne “Mobility Protocols and Handover
Optimization: Design, Evaluation and Application”, IEEE Press, Wiley Publication
3 Michael Gregg, “Build your own security lab”, Wiley India edition
4 Dipankar Raychaudhuri, Mario Gerla, “Emerging Wireless Technologies and the
Future Mobile Internet”, Cambridge
5 Andreas F. Molisch, “Wireless Communications”, Second Edition, Wiley Publication
Assessment:
Useful Links
1 https://www.coursera.org/learn/smart-device-mobile-emerging-technologies
CSC604 Artificial Intelligence 3
Prerequisite: Discrete Mathematics, Data Structures

Course Objectives:
1 To conceptualize the basic ideas and techniques underlying the design of intelligent
systems.
2 To make students understand and Explore the mechanism of mind that enables intelligent
thought and action.
3 To make students understand advanced representation formalism and search techniques.
4 To make students understand how to deal with uncertain and incomplete information.
Course Outcomes: At the end of the course, the students will be able to
1 Ability to develop a basic understanding of AI building blocks presented in intelligent

agents.
2 Ability to choose an appropriate problem solving method and knowledge representation
technique.
3 Ability to analyze the strength and weaknesses of AI approaches to knowledge– intensive
problem solving.
4 Ability to design models for reasoning with uncertainty as well as the use of unreliable
information.
5 Ability to design and develop AI applications in real world scenarios.
Module Content Hrs

1 Introduction to Artificial Intelligence 4
1.1 Introduction, History of Artificial Intelligence, Intelligent Systems:
Categorization of Intelligent System, Components of AI Program,
Foundations of AI, Sub-areas of AI, Applications of AI, Current trends
in AI.
2 Intelligent Agents 4
2.1 Agents and Environments, The concept of rationality, The nature of
environment, The structure of Agents, Types of Agents, Learning
Agent.
2.2 Solving problem by Searching: Problem Solving Agent, Formulating
Problems, Example Problems.
3 Problem solving 10
3.1 Uninformed Search Methods: Breadth First Search (BFS), Depth First
Search (DFS), Depth Limited Search, Depth First Iterative Deepening
(DFID), Informed Search Methods: Greedy best first Search, A*
Search, Memory bounded heuristic Search.
3.2 Local Search Algorithms and Optimization Problems: Hill climbing
search Simulated annealing, Genetic algorithms.
3.3 Adversarial Search: Game Playing, Min-Max Search, Alpha Beta
Pruning
4 Knowledge and Reasoning 12
4.1 Knowledge based Agents, Brief Overview of propositional logic, First
Order Logic: Syntax and Semantic, Inference in FOL, Forward
chaining, backward Chaining.
4.2 Knowledge Engineering in First-Order Logic, Unification, Resolution
4.3 Uncertain Knowledge and Reasoning: Uncertainty, Representing
knowledge in an uncertain domain, The semantics of belief network,
Simple Inference in belief network
5 Planning and Learning 5
5.1 The planning problem, Planning with state space search, Partial order
planning, Hierarchical planning, Conditional Planning.
5.2 Learning: Forms of Learning, Theory of Learning, PAC learning.

Introduction to statistical learning (Introduction only)
Introduction to reinforcement learning: Learning from Rewards,
Passive Reinforcement Learning, Active reinforcement Learning
6 AI Applications 4
A. Introduction to NLP- Language models, Grammars, Parsing
B. Robotics - Robots, Robot hardware, Problems Robotics can
solve
C. AI applications in Healthcare, Retail, Banking
Textbooks:
1 Stuart J. Russell and Peter Norvig, "Artificial Intelligence: A Modern Approach”, Fourth
Edition" Pearson Education, 2020.
2 Saroj Kaushik, “Artificial Intelligence”, Cengage Learning, First edition, 2011
3 George F Luger, “Artificial Intelligence” Low Price Edition, Fourth edition, Pearson
Education.,2005
References:
1 Nils J. Nilsson, Principles of Artificial Intelligence, Narosa Publication.
2 Deepak Khemani, A First Course in Artificial Intelligence, McGraw Hill Publication
3 Patrick H. Winston, Artificial Intelligence, 3rd edition, Pearson Education.
4 Elaine Rich and Kevin Knight, "Artificial Intelligence”, Third Edition, McGraw Hill
Education,2017.
Assessment:
when approx. 40% syllabus is completed and the second class test when an additional 40%
Useful Links
2 https://thestempedia.com/blog/simple-ai-and-machine-learning-projects-for-students-
and-beginners/
CSDLO6011 Internet of Things 3
Prerequisite: C Programming, Digital Logic and Computer Architecture, Microprocessor,

Computer Networks.
Course Objectives:
1 To equip students with the fundamental knowledge and basic technical competence in the
field of Internet of Things (IoT).
2 To emphasize on core IoT functional Stack to build assembly language programs. To learn
the Core IoT Functional Stack.
3 To understand the different common application protocols for IoT and apply IoT knowledge
to key industries that IoT is revolutionizing.
4 To examines various IoT hardware items and software platforms used in projects for each
platform that can be undertaken by a beginner, hobbyist, student, academician, or researcher
to develop useful projects or products.
Course Outcomes: On the completion of the course, learners will be able to:
1 Understand the concepts of IoT and the Things in IoT.
2 Emphasize core IoT functional Stack and understand application protocols for IoT.
3 Apply IoT knowledge to key industries that IoT is revolutionizing.
4 Examines various IoT hardware items and software platforms used in projects.
Module Content Hrs

1 Introduction to Internet of Things (IoT) 7
1.1 What is IoT? - IoT and Digitization
1.2 IoT Impact – Connected Roadways, Connected Factory, Smart Connected
Buildings, Smart Creatures
1.3 Convergence of IT and OT, IoT Challenges
1.4 The oneM2M IoT Standardized Architecture
1.5 The IoT World Forum (IoTWF) Standardized Architecture
1.6 IoT Data Management and Compute Stack – Design considerations and Data
related problems, Fog Computing, Edge Computing, The Hierarchy of Edge, Fog
and Cloud
2 Things in IoT 7
2.1 Sensors/Transducers – Definition, Principles, Classifications, Types,
Characteristics and Specifications
2.2 Actuators -– Definition, Principles, Classifications, Types, Characteristics and
Specifications
2.3 Smart Object – Definition, Characteristics and Trends
2.4 Sensor Networks – Architecture of Wireless Sensor Network, Network Topologies
2.5 Enabling IoT Technologies - Radio Frequency Identification Technology, Micro-
Electro-Mechanical Systems (MEMS), NFC (Near Field Communication),
Bluetooth Low Energy (BLE), LTE-A (LTE Advanced), IEEE 802.15.4–
Standardization and Alliances, ZigBee.
3 The Core IoT Functional Stack 6
3.1 Layer 1 – Things: Sensors and Actuators Layer
3.2 Layer 2 – Communications Network Layer, Access Network Sublayer, Gateways
and Backhaul Sublayer, Network Transport Sublayer, IoT Network Management
Sublayer
3.3 Layer 3 – Applications and Analytics Layer, Analytics Vs. Control Applications,
Data Vs. Network Analytics, Data Analytics Vs. Business Benefits, Smart Services
4 Application Protocols for IoT 7
4.1 The Transport Layer
4.2 IoT Application Transport Methods
4.3 Application Layer Protocol Not Present
4.4 SCADA - Background on SCADA, Adapting SCADA for IP, Tunneling Legacy
SCADA over IP Networks, SCADA Protocol Translation, SCADA Transport over
LLNs with MAP-T,
4.5 Generic Web-Based Protocols
4.6 IoT Application Layer Protocols – CoAP and MQTT
5 Domain Specific IoTs 6
5.1 Home Automation – Smart Lighting, Smart Appliances, Intrusion Detection,
Smoke/Gas Detectors
5.2 Cities – Smart Parking, Smart Lighting, Smart Roads, Structural Health
Monitoring, Surveillance
5.3 Environment – Weather Monitoring, Air Pollution Monitoring, Noise Pollution
Monitoring, Forest Fire Detection, River Floods Detection
5.4 Energy – Smart Grids, Renewable Energy Systems, Prognostics
5.5 Retail – Inventory Management, Smart Payments, Smart Vending Machines
5.6 Logistics – Route Generation & Scheduling, Fleet Tracking, Shipment Monitoring
5.7 Agriculture – Smart Irrigation, Green House Control
5.8 Industry – Machine Diagnostics & Prognosis, Indoor Air Quality Monitoring
5.9 Health & Lifestyle – Health & Fitness Monitoring, Wearable Electronics
6 Create your own IoT 6
6.1 IoT Hardware - Arduino, Raspberry Pi, ESP32, Cloudbit/Littlebits, Particle
Photon, Beaglebone Black.
6.2 IoT Software - languages for programming IoT hardware, for middleware
applications and API development, for making front ends, REST and JSON-LD
6.3 A comparison of IoT boards and platforms in terms of computing
6.4 A comparison of IoT boards and platforms in terms of development environments
and communication standards
6.5 A comparison of boards and platforms in terms of connectivity
6.6 A comparison of IoT software platforms
Textbooks:
1 David Hanes, Gonzalo Salgueiro, Patrick Grossetete, Rob Barton, Jerome Henry, “IoT
Fundamentals – Networking Technologies, Protocols, and Use Cases for the Internet
of Things”, 1st Edition, Published by Pearson Education, Inc, publishing as Cisco Press,
2017.
2 Hakima Chaouchi, “The Internet of Things - Connecting Objects to the Web”, 1st
Edition, Wiley, 2010.
3 Perry Lea, “Internet of things For Architects”, 1st Edition, Packt Publication, 2018
4 Arshdeep Bahga, Vijay Madisetti, “Internet of Things – Hands-On Approach”, 2nd
Edition, Universities Press, 2016.
References:
1 Adrian McEwen & Hakim Cassimally, “Designing the Internet of Things”, 1st Edition,
Wiley, 2014.
2 Donald Norris, “Raspberry Pi – Projects for the Evil Genius”, 2nd Edition, McGraw Hill,
2014.
3 Anand Tamboli ,“Build Your Own IoT Platform”, 1st Edition, Apress, 2019.
Assessment:
when approx. 40% syllabus is completed and second-class test when additional 40% syllabus is
Useful Links
4 https://www.coursera.org/specializations/IoT
CSDLO6012 Digital Signal & Image Processing 3
Prerequisite: Applied Engineering Mathematics

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 course, learners will be able to:
1 Understand 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 Apply image segmentation techniques
Module Unit Topic details Hrs.

No. No.
1.0 Discrete-Time Signal and Discrete-Time System 10
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 signal (without
mathematical proof), Circular Convolution (without
mathematical proof), Linear convolution using Circular
Convolution. Auto and Cross Correlation formula evaluation,
Concept of LTI system, Output of DT system using Time Domain
Linear Convolution.
2.0 Discrete Fourier Transform 05
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 Parseval’s Energy
Theorem). DFT computation using DFT properties.
2.3 Convolution of long sequences, Introduction to 2-D DFT
3.0 Fast Fourier Transform 04
3.1 Need of FFT, Radix-2 DIT-FFT algorithm,
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 05
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 09
5.1 Gray Level Transformations, Zero Memory Point Operations,
5.2 Histogram Processing, Histogram equalization.
5.3 Neighborhood processing, Image averaging, Image Subtraction,
Smoothing Filters - Low pass averaging, Sharpening Filters-High
Pass Filter, High Boost Filter, Median Filter for reduction of noise
6.0 Image Segmentation 06
6.1 Fundamentals, Segmentation based on Discontinuities
and Similarities
6.2 Point, line and Edge Detection, Image edge detection using Robert,
Prewitt and Sobel masks, Image edge Detection using Laplacian mask
6.3 Region based segmentation: Region Growing, Region Splitting
and Merging
Total 39
Textbooks:
1 John G. Proakis, Dimitris and G .Manolakis, “Digital Signal Processing: Principles,
Algorithms, and Applications”, 4th Edition, Pearson Education, 2007
2 A. Anand Kumar, “Digital Signal Processing”, 2nd Edition, PHI Learning Pvt. Ltd.
2014.
3 Rafel C. Gonzalez and Richard E. Woods, “Digital Image Processing”, Pearson
Education Asia, 4th Edition, 2018.
4 S. Sridhar, “Digital Image Processing”, 2nd Edition, Oxford University Press, 2012.
References:
1 Sanjit Mitra, “Digital Signal Processing: A Computer Based Approach”, 4th Edition,
Tata McGraw Hill, 2013
2 S. Salivahanan, A. Vallavaraj, and C. Gnanapriya, “Digital Signal Processing”, 2nd
Edition, Tata McGraw Hill Publication, 2011.
3 S. Jayaraman, E. Esakkirajan and T. Veerkumar, “Digital Image Processing”, 3rd
Edition, Tata McGraw Hill Education Private Ltd, 2009.
4 Anil K. Jain, “Fundamentals of Digital Image Processing”, 4th Edition, Prentice Hall
of India Private Ltd,.1989
Assessment:
when approx. 40% syllabus is completed and second class test when additional 50% syllabus
is completed. Duration of each test shall be one hour.
Useful Links
1 https://nptel.ac.in/courses/
2 https://swayam.gov.in
CSDLO6013 Quantitative Analysis 3
Prerequisite: Applied Mathematics

Course Objectives:
1 Introduction to the basic concepts in Statistics
2 Understand concept of data collection & sampling methods.
3 Introduction to Regression, Multiple Linear Regression
4 Draw interference using Statistical inference methods
5 Tests of hypotheses
Course Outcomes:
1 Recognize the need of Statistics and Quantitative Analysis
2 Apply the data collection and the sampling methods.
3 Analyze using concepts of Regression, Multiple Linear Regression
4 Formulate Statistical inference drawing methods.
5 Apply Testing of hypotheses
Module Content Hrs

1 Introduction to Statistics 6
Functions – Importance – Uses and Limitations of Statistics. Statistical data–
Classification, Tabulation, Diagrammatic & Graphic representation of data
2 Data Collection & Sampling Methods 6
Primary & Secondary data, Sources of data, Methods of collecting data.
Sampling – Census & Sample methods –Methods of sampling, Probability
Sampling and Non-Probability Sampling.
3 Introduction to Regression 8
Mathematical and Statistical Equation – Meaning of Intercept and Slope –
Error term – Measure for Model Fit –R2 – MAE – MAPE.
4 Introduction to Multiple Linear Regression 8
Multiple Linear Regression Model, Partial Regression Coefficients, Testing
Significance overall significance of Overall fit of the model, Testing for
Individual Regression Coefficients
5 Statistical inference 6
Random sample -Parametric point estimation unbiasedness and consistence
- method of moments and method of maximum likelihood.
6 Tests of hypotheses 5
Null and Alternative hypotheses. Types of errors. Neyman-Pearson lemma-
MP and UMP tests.
Textbooks:
1 Agarwal, B.L. (2006):-Basic Statistics. Wiley Eastern Ltd., New Delhi
2 Gupta, S. P. (2011):-Statistical Methods. Sultanchand&Sons, New Delhi
3 Sivathanupillai, M &Rajagopal, K. R. (1979):-Statistics for Economics Students.
4 Hogg ,R.V. and Craig, A.T.(2006), An introduction to mathematical statistics, Amerind
publications.
References:
1 Arora, P.N., SumeetArora, S. Arora (2007):- Comprehensive Statistical Methods. Sultan
Chand, New Delhi
2 Montgomery,D.C. ,Peck E.A, & Vining G.G.(2003). Introduction to Linear Regression
Analysis. John Wiley and Sons,Inc.NY
3 Mood AM, Graybill FA, and Boes, D.C.(1985), Introduction to the theory of statistics,
McGrawhill Book Company, New Delhi.
4 Kapur, J.N. and Saxena,H.C.(1970), Mathematical statistics, Sultan Chand & company, New
Delhi..
Assessment:
CSL601 System Programming and Compiler Construction Lab 1
Prerequisite: Theoretical computer science, Operating system. Computer Organization and

Architecture
1 Generate machine code by implementing two pass assemblers.
2 Implement Two pass macro processor.
3 Parse the given input string by constructing Top down/Bottom-up parser.
4 Identify and Validate tokens for given high level language and Implement synthesis phase of
compiler.
5 Explore LEX & YACC tools.

1 Implementations of two pass Assembler.
2 Implementation of Two pass Macro Processor.
3 Implementation of Lexical Analyzer.
4 Implementation of Parser (Any one).
5 Implementation of Intermediate code generation phase of compiler.
6 Implementation of code generation phase of compiler.
7 Study and implement experiments on LEX, YACC.
Reference Books:
1 Andrew W. Appel Princeton University. Jens Palsberg Modern Compiler.
Implementation in Java, Second Edition. Purdue University. CAMBRIDGE
University press @2002.
2 Charles N. Fischer, Richard J. LeBlanc Crafting a compiler with C , pearson
Education 2007
Term Work:
1 Term work should consist of experiments based on suggested experiment list.
2 Journal must include at least 2 assignments on content of theory and practical of “System
Programming and Compiler Construction”
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 CSC601 syllabus.
CSL602 Cryptography & System Security Lab 1
Prerequisite: Computer Network

Lab Objectives:
1 To apply various encryption techniques
2 To study and implement various security mechanism
3 To explore the network security concept and tools
1 apply the knowledge of symmetric and asymmetric cryptography to implement simple
ciphers.
2 explore the different network reconnaissance tools to gather information about networks.
3 explore and use tools like sniffers, port scanners and other related tools for analysing
packets in a Network.
4 set up firewalls and intrusion detection systems using open-source technologies and to
explore email security.
5 explore various attacks like buffer-overflow and web application attack.

Sr. No Title of Experiment
1 Design and Implementation of a product cipher using Substitution and Transposition
ciphers.
2 Implementation and analysis of RSA crypto system.
3 Implementation of Diffie Hellman Key exchange algorithm
4 For varying message sizes, test integrity of message using MD-5, SHA-1, and
analyse the performance of the two protocols. Use crypt APIs.
5 Study the use of network reconnaissance tools like WHOIS, dig, traceroute, ns
lookup to gather information about networks and domain registrars.
6 Study of packet sniffer tools: wireshark,:
1. Download and install wireshark and capture icmp, tcp, and http packets in
promiscuous mode.
2. Explore how the packets can be traced based on different filters.
7 Download and install nmap. Use it with different options to scan open ports, perform
OS fingerprinting, do a ping scan, tcp port scan, udp port scan, xmas scan etc.
8 Detect ARP spoofing using nmap and/or open-source tool ARPWATCH and
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, Cpp check etc
11 a. Set up IPSEC under LINUX.
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
15 Case Study /Seminar: Topic beyond syllabus related to topics covered.
Term Work:
2 Journal must include at least 2 assignments on content of theory and practical of
“Cryptography and System Security “
Lab Performance 15 Marks
Assignments 05 Marks
Attendance (Theory & practical) 05 Marks
CSL603 Mobile Computing Lab 1

Lab Objectives:
1 To learn the mobile computing tools and software for implementation.
2 To understand the security algorithms in mobile networks
3 To learn security concepts
1 develop and demonstrate mobile applications using various tools
2 articulate the knowledge of GSM, CDMA & Bluetooth technologies and demonstrate it.
3 Students will able to carry out simulation of frequency reuse, hidden/exposed terminal
problem
4 implement security algorithms for mobile communication network
5 demonstrate simulation and compare the performance of Wireless LAN

The softwares like Android Studio, J2ME, NS2, NS3 and any other software which is suitable
are recommended for performing the practical.
1 Implementation a Bluetooth network with application as transfer of a file from one
device to another.
2 To implement a basic function of Code Division Multiple Access (CDMA).
3 Implementation of GSM security algorithms (A3/A5/A8)
4 Illustration of Hidden Terminal/Exposed terminal Problem. Consider two Wi-fi
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.
5 To setup & configuration of Wireless Access Point (AP). 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.
6 Study of security tools (like Kismet,Netstumbler)

7 Develop an application that uses GUI components.
8 Write an application that draws basic graphical primitives on the screen.
9 Develop an application that makes use of database.
10 Develop a native application that uses GPS location information.
11 Implement an application that creates an alert upon receiving a message.
12 Implementation of income tax/loan EMI calculator and deploy the same on real
devices (Implementation of any real time application)
Term Work:
2 Journal must include at least 2 assignments on content of theory and practical of “ Mobile
Computing”
Useful Links
2 https://www.coursera.org/learn/smart-device-mobile-emerging-technologies
CSL604 Artificial Intelligence Lab 1
Prerequisite: Discrete Mathematics, Data Structure

Lab Objectives:
1 To realize the basic techniques to build intelligent systems
2 To apply appropriate search techniques used in problem solving
3 To create knowledge base for uncertain data
1 Identify languages and technologies for Artificial Intelligence
2 Understand and implement uninformed and informed searching techniques for real world
problems.
3 Create a knowledge base using any AI language.
4 Design and implement expert systems for real world problems.
Suggested List of Experiments (programming in python)

1 One case study on AI applications published in IEEE/ACM/Springer or any prominent
journal.
2 Assignments on State space formulation and PEAS representation for various AI
applications
3 Program on uninformed search methods.
4 Program on informed search methods.
5 Program on Game playing algorithms.
6 Program for first order Logic
7 Planning Programming
8 Implementation for Bayes Belief Network
Note: Any other practical covering the syllabus topics and subtopics can be conducted.
The programming assignment for First order logics could be in the form of a mini project
Term Work:
1 Term work should consist of a minimum of 8 experiments.
2 Journal must include at least 2 assignments on content of theory and practical of “Artificial
Intelligence”
Oral & Practical exam: Based on the entire syllabus of CSC604: Artificial Intelligence
CSL605 Cloud Computing 2

Lab Objectives: The course has following objectives
1 To make students familiar with key concepts of virtualization.
2 To make students familiar with various deployment models of cloud such as private, public,
hybrid and community so that they star using and adopting appropriate type of cloud for their
application.
3 To make students familiar with various service models such as IaaS, SaaS, PaaS, Security as
a Service (SECaaS) and Database as a Service.
4 To make students familiar with security and privacy issues in cloud computing and how to
address them.
1 Implement different types of virtualization techniques.
2 Analyze various cloud computing service models and implement them to solve the given
problems.
3 Design and develop real world web applications and deploy them on commercial cloud(s).
4 Explain major security issues in the cloud and mechanisms to address them.
5 Explore various commercially available cloud services and recommend the appropriate one for
the given application.
6 Implement the concept of containerization
Module Detailed Contents Hours LO
01 Title: Introduction and overview of cloud computing. 2 2

Objective: To understand the origin of cloud computing, cloud
cube model, NIST model, characteristics of cloud, different
deployment models, service models, advantages and
disadvantages.
02 Title: To study and implement Hosted Virtualization using 2 1

VirtualBox& KVM.
Objective: To know the concept of Virtualization along with
their types, structures and mechanisms. This experiment should
have demonstration of creating and running Virtual machines
inside hosted hypervisors like VirtualBox and KVM with their
comparison based on various virtualization parameters.
Title: To study andImplement Bare-metal Virtualization using

03 Xen, HyperV or VMware Esxi. 4 1
Objective: To understand the functionality of Bare-metal
hypervisors and their relevance in cloud computing platforms.
This experiment should have demonstration of install, configure
and manage Bare Metal hypervisor along with instructions to
create and run virtual machines inside it. It should also
emphasize on accessing VMs in different environments along
with additional services provided by them like Load balancing,
Auto-Scaling, Security etc.
04 Title: To study andImplement Infrastructure as a Service using 4 2
AWS/Microsoft Azure.
Objective: To demonstrate the steps to create and run virtual
machines inside Public cloud platform. This experiment should
emphasize on creating and running Linux/Windows Virtual
machine inside Amazon EC2 or Microsoft Azure Compute and
accessing them using RDP or VNC tools.
05 Title: To study andImplement Platform as a Service using 4 2

AWS Elastic Beanstalk/ Microsoft Azure App Service.
Objective: To demonstrate the steps to deploy Web applications
or Web services written in different languages on AWS Elastic
Beanstalk/ Microsoft Azure App Service.
06 Title: To study andImplementStorage as a Service using Own 4 2

Cloud/ AWS S3, Glaciers/ Azure Storage.
Objective: To understand the concept of Cloud storage and to
demonstrate the different types of storages like object storage,
block level storages etc. supported by Cloud Platforms like Own
Cloud/ AWS S3, Glaciers/ Azure Storage.
07 Title: To study andImplementDatabase as a Service on 2 2

SQL/NOSQL databases like AWS RDS, AZURE SQL/
MongoDB Lab/ Firebase.
Objective: To know the concept of Database as a Service
running on cloud and to demonstrate the CRUD operations on
different SQL and NOSQL databases running on cloud like
AWS RDS, AZURE SQL/ Mongo Lab/ Firebase.
08 Title: To study andImplementSecurity as a Service on 3 4

AWS/Azure
Objective: To understand the Security practices available in
public cloud platforms and to demonstrate various Threat
detection, Data protection and Infrastructure protection services
in AWS and Azure.
09 Title: To study and implement Identity and Access 2 2

Management (IAM) practices on AWS/Azure cloud.
Objective: To understand the working of Identity and Access
Management IAM in cloud computing and to demonstrate the
case study based on Identity and Access Management (IAM) on
AWS/Azure cloud platform.
10 Title: To study and Implement Containerization using Docker 4 6

Objective: To know the basic differences between Virtual
machine and Container. It involves demonstration of creating,
finding, building, installing, and running Linux/Windows
application containers inside local machine or cloud platform.
11 Title: To study and implement container orchestration using 4 6
Kubernetes
Objective: To understand the steps to deploy Kubernetes
Cluster on local systems, deploy applications on Kubernetes,
creating a Service in Kubernetes, develop Kubernetes
configuration files in YAML and creating a deployment in
Kubernetes using YAML,
12 Mini-project: Design a Web Application hosted on public 4 3, 5

cloud platform
[It should cover the concept of IaaS, PaaS, DBaaS, Storage as a
Service, Security as a Service etc.]
Sr. No. Suggested Assignment List (Any two) LO
1 Assignment based on selection of suitable cloud platform solution 5

based on requirement analysis considering given problem
statement
2 Assignment on recent trends in cloud computing and related 5
technologies
3 Assignment on comparative study of different computing 5
technologies [Parallel, Distributed, Cluster, Grid, Quantum)
4 Comparative study of different hosted and bare metal Hypervisors 1

with suitable parameters along with their use in public/private
cloud platform
5 Assignment on explore and compare the similar type of services 5

provided by AWS and Azure [Any ten services]
Digital Material:
Sr. Topic Link

No.
1 Introduction and overview of cloud https://www.nist.gov/system/files/documents
computing /itl/cloud/NIST_SP-500-291_Version-
2_2013_June18_FINAL.pdf
2 Hosted Virtualization using KVM https://phoenixnap.com/kb/ubuntu-install-
kvm\
3 Baremetal Virtualization using Xen https://docs.citrix.com/en-us/xenserver/7-

1/install.html
4 IaaS, PaaS, STaaS, DbaaS, IAM and 1) AWS

Security as a Service on AWS and https://docs.aws.amazon.com/
Azure 2) MS Azure
https://docs.microsoft.com/en-us/azure
5 Docker https://docs.docker.com/get-started/
6 Kubernetes https://kubernetes.io/docs/home/
Textbooks:
1 Bernard Golden, “Amazon Web Services for Dummies”, John Wiley & Sons, Inc.
2 Michael Collier, Robin Shahan, “Fundamentals of Azure, Microsoft Azure Essentials”,
Microsoft Press.
3 RajkumarBuyya, Christian Vecchiola, S ThamaraiSelvi, “Mastering Cloud Computing”,
Tata McGraw-Hill Education.
4 Barrie Sosinsky, “Cloud Computing Bible”, Wiley publishing.
5 John Paul Mueller, “AWS for Admins for Developers”, John Wiley & Sons, Inc.
6 Ken Cochrane, Jeeva S. Chelladhurai, NeependraKhare , “Docker Cookbook - Second
Edition”, Packt publication
7 Jonathan Baier, “Getting Started with Kubernetes-Second Edition”, Packt Publication.
Term Work:
1 Term work should consist of 10 experiments and a mini project.
2 Journal must include at least 2 assignments.
4 Total 50 Marks (Experiments: 15-marks, Mini project (Implementation) 15 marks,
Mini Project Presentation & Report [for deployment, utilization, monitoring and
billing] 10 Marks, Attendance 05-marks, Assignments: 05-marks)
Oral examination will be based on Laboratory work, mini project and above syllabus.
CSM601 Mini Project 2B 02
Objectives
1 To understand and identify the problem
2 To apply basic engineering fundamentals and attempt to find solutions to the problems.
3 Identify, analyze, formulate and handle programming projects with a comprehensive and
systematic approach
4 To develop communication skills and improve teamwork amongst group members and
inculcate the process of self-learning and research.
1 Identify societal/research/innovation/entrepreneurship problems through appropriate
literature surveys
2 Identify Methodology for solving above problem and apply engineering knowledge and
skills to solve it
3 Validate, Verify the results using test cases/benchmark data/theoretical/
inferences/experiments/simulations
4 Analyze and evaluate the impact of solution/product/research/innovation /entrepreneurship
towards societal/environmental/sustainable development
5 Use standard norms of engineering practices and project management principles during
project work
6 Communicate through technical report writing and oral presentation.
● The work may result in research/white paper/ article/blog writing and publication
● The work may result in business plan for entrepreneurship product created
● The work may result in patent filing.
7 Gain technical competency towards participation in Competitions, Hackathons, etc.
8 Demonstrate capabilities of self-learning, leading to lifelong learning.
9 Develop interpersonal skills to work as a member of a group or as leader
1 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 (frontend-backend) and hardware, statistical data
analysis, creating awareness in society/environment etc.
statement for mini project in consultation with faculty supervisor/head
of department/internal committee of faculties.
4 Students shall submit an implementation plan in the form of Gantt/PERT/CPM chart, which
will cover weekly activity of mini projects.
5 A logbook may be prepared by each group, wherein the group can record weekly work
progress, guide/supervisor can verify and record notes/comments.
6 Faculty supervisors may give inputs to students during mini project activity; however, focus
7 Students under the guidance of faculty supervisor shall convert the best solution into a
working model using various components of their domain areas and demonstrate.
format of University of Mumbai. Software requirement specification (SRS) documents,
research papers, competition certificates may be submitted as part of annexure to the report.
9 With the focus on self-learning, innovation, addressing societal/research/innovation
problems and entrepreneurship quality development within the students through the Mini
Projects, it is preferable that a single project of appropriate level and quality be carried out
in two semesters by all the groups of the students. i.e. Mini Project 2 in semesters V and
VI.
mentioned above, gets completed in odd semester, then that group can be allowed to work
completely new project idea in even semester. This policy can be adopted on a case by
case basis.
Term Work
The review/ progress monitoring committee shall be constituted by the heads of departments of
each institute. The progress of the mini project to be evaluated on a continuous basis, based on
the SRS document submitted. minimum two reviews in each semester.
Distribution of Term work marks for both semesters shall be as below: Marks 25
Review / progress monitoring committee may consider following points for assessment based
on either one year or half year project as mentioned in general guidelines
One-year project:
1 In the first semester the entire theoretical solution shall be made ready, including
components/system selection and cost analysis. Two reviews will be conducted based on
a presentation given by a student group.
First shall be for finalization of problem
Second shall be on finalization of proposed solution of problem.
2 In the second semester expected work shall be procurement of component’s/systems,
building of working prototype, testing and validation of results based on work completed
in an earlier semester.
First review is based on readiness of building working prototype to be conducted.
Second review shall be based on poster presentation cum demonstration of working
model in the last month of the said semester.
Half-year project:
Identification of need/problem
Proposed final solution
Procurement of components/systems
Building prototype and testing

First shall be for finalization of problem and proposed solution
Second shall be for implementation and testing of solution.
Mini Project shall be assessed based on following points
1 Clarity of problem and quality of literature Survey for problem identification
2 Requirement gathering via SRS/ Feasibility Study
3 Completeness of methodology implemented

4 Design, Analysis and Further Plan
5 Novelty, Originality or Innovativeness of project
6 Societal / Research impact
7 Effective use of skill set : Standard engineering practices and Project management
standard
10 Verification and validation of the solution/ Test Cases
12 Technical writing /competition/hackathon outcome being met
In one year project (sem V and VI), first semester evaluation may be based on first 10 criteria
and remaining may be used for second semester evaluation of performance of students in mini
projects.
In case of half year projects (completing in VI sem) all criteria’s in generic may be considered
for evaluation of performance of students in mini projects.
the head of Institution.
3 Students shall be motivated to publish a paper/participate in competition based on the

work in Conferences/students competitions.
AC –
Item No.
Revised syllabus (Rev- 2016) from Academic Year 2016 -17

Under
FACULTY OF TECHNOLOGY
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.

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
CSL701 - 2 - - 1 - 1
Processing Lab
Mobile App. Development.
CSL702 - 2 - - 1 - 1
Tech. Lab
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
CSL701 - - - - - 25 -- 25
Processing Lab --
Mobile App. Development. --
CSL702 - - - - - 25 25 50
Tech. Lab
CSL703 -- - - - -- 25 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

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
4 - - 4 - - 4
801X Course -IV
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

801X Course -IV 20 20 20 80 3 - - - 100
ILO801X 20 20 20 80 3 - - - 100
Course-II
Human Machine
CSC801 25 25 - 50
Interaction Lab
Distributed Computing
CSL802 25 25
Lab - - - - - 50
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

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

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

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,

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:
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.

4. Remaining question (Q.2 to Q.6) will be selected from all the modules.
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.
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)

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:

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.

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

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.


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
2 against Program threats.
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

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:

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)
=================================================================
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

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/

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.
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

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

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.

• Programming Exercises: .................................. ......................... (10) Marks.
• Mini project: ............................................................ (10) Marks.
• Attendance (Theory & Practical) ................................ (05) Marks.
TOTAL: ........................................................... (25) Marks.


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).

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

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.
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:

Term Work :

• Programming Exercises: .................................. ......................... (10) Marks.
• Mini project: ............................................................ (10) Marks.
• Attendance (Theory & Practical) ................................ (05) Marks.
TOTAL: ........................................................... (25) Marks.

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
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.

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

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

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)

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

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

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

Assessment:


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.

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

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
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.

Assessment:


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

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

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
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

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:


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

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.

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
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
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:


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

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

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
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.

Assessment:


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

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

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.
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
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:


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)

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.

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
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,

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:


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

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

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.
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:

(approximately
40% but excluding contents covered in Test I)

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

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.
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

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.
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.

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.

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.

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.
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.

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:
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.

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)
 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.

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.

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:


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

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
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,
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:

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.

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

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).

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

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

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:


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.

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.

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

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,
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:


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
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

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)

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.

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

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:


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

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

1. Understand Indian finance system and corporate finance
2. Take investment, finance as well as dividend decisions
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

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:


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.

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

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
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

Assessment:


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

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

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.

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.

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


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, 15 th 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

ILO8025 Professional Ethics and Corporate Social Responsibility (CSR) 03
Objectives:
1. To understand professional ethics in business
2. To recognized corporate social responsibility

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
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.

Assessment:


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.

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

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
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

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:


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

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

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

Assessment:


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.

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

Assessment:


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

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

1. Understand the concept of environmental management
2. Understand ecosystem and interdependence, food chain etc.
3. Understand and interpret environment related legislations
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:


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

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.
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)

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.

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.

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.

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.

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

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.

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:
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.

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.

Curriculum 22042024130436

Uploaded by

Copyright:

Available Formats

Curriculum 22042024130436

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Curriculum 22042024130436

Uploaded by

Copyright:

Available Formats

AC: Item No. 4.

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

(REV- 2019‘C’ Scheme) from Academic Year 2019 – 20

(Common for All Branches of Engineering)

FACULTY OF SCIENCE &TECHNOLOGY

Dr. Suresh K. Ukarande

Student Induction Program

Tentative schedule of 1st Week Induction Program:

Session 1 Orientation program

A session may be conducted for around 2-3 hours each.

Session 11 Physical Activity ( Yoga, sports etc)- 1

LOGO OF INSTITUTE Student Mentoring Form

Student's Personal Details

Name : Roll No:

Date of Birth: Male/Female:

Mobile No: Email Id:

Mobile No.: Email ID.:

Mobile No.: Email ID.:

Name of The Student Mentor:

Mobile No.: Email ID.:

Name of The Faculty Mentor:

Student's Academic Performance

Student Mentor’s Feedback Semester wise

Placement: - Yes / No If yes get following Details:

Exams GRE TOFEL CAT GATE

FEC101 Engineering Mathematics-I 20 20 20 80 3 25 -- 125

FEC201 Engineering Mathematics-II 20 20 20 80 3 25 -- 125

Course Objectives: The course is aimed

Course Outcomes: Students will be able to

Module Detailed Contents Hrs.

Hyperbolic function and Logarithm of Complex Numbers

# Self learning topics:Indeterminate forms, L‐ Hospital Rule, Gauss Elimination

1. Attendance (Theory and Tutorial) 05 marks

Internal Assessment Test:

End Semester Theory Examination:

Outcomes: Learners will be able to…

ENGINEERING MATERIALS AND APPLICATIONS

End Semester Examination

Outcomes: Learners will be able to…

Module Detailed Contents Hrs.

Atomic and Molecular Structure

Aromatic systems &their molecular structure

Phase Rule-Gibb’s Phase Rule

End Semester Examination

Outcomes: Learners will be able to…

Module Detailed Contents Hrs.

End Semester Theory Examination:

Module Detailed Contents Hrs.

AC Circuits :Generation of alternating voltage, basic definitions, average and r.m.s

Generation of Three-Phase Voltages, voltage & current relationships in Star and

Electrical Machines (Numerical not expected): Rotating magnetic field produced

End Semester Theory Examination:

Outcomes: Learners will be able to…

Suggested Experiments: (Any five)

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

Outcomes: Learners will be able to…

Term Work shall consist of minimum five experiments.

Outcomes: Learners will be able to…

1. Verification of Polygon law of coplanar forces

Kinetics of particles (D’Alemberts Principle, Work Energy Principle, Impulse