regarding scheme revised syll BE in Information Tech_1 Syllabus Mumbai University

Page 1

Page 2

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, (Publi cation 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 Learni ng (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, Dep artment 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.

Page 3

Page 4

AC: 23/7/2020

Item No. : 126

























































UNIVERSITY OF MUMBAI



Bachelor of Engineering
in
Information Technology 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 Academ ic Year 2019 – 20
Under
FACULTY OF SCIENCE & TECHNOLOGY

(As per AICTE guidelines with effect from the academic year
2019 –2020 )

Page 5

Date: 23/7/2020


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



Sr. No. Heading Particulars
1 Title of the Course Second Year B.E. Information Technology Engineering
2 Eligibility for Admission
After Passing First Year Engineering as per the
Ordinance 0.6242
3 Passing Marks 40%
4 Ordinances /
Regulations ( if any) Ordinance 0.6242
5 No. of Years / Semesters 8 semesters
6 Level P.G. / U.G. / Diploma / Certificate
(Strike out w hich is not applicable)
7 Pattern Yearly / Semester
(Strike out which is not applicable )
8 Status New / Revised
(Strike out which is not applicable )
9 To be implemented from
Academic Year With effect from Academic Year: 2020 -2021








AC: 23/7/2020 _
Item No. 126

UNIVERSITY OF MUMBAI




Syllabus for Approval

Page 6

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 ha s 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 w orkload 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, howeve r content o f
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 k nowledge
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 e ngineering 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.






Dr. S. K. Uka rande Dr. Anuradha Muzumdar
Associate Dean Dean
Faculty of Scien ce and Technology Faculty of Science and Technology
University of Mumbai University of Mumbai

Page 7

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 ar e 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 y ear 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 complet ion they are required to submit certification for the same. This
will definitely help learners to facilitate their enhanced learning based on their interest.





Dr. S. K. Ukarande Dr Anuradha Muzumdar
Associate Dean Dean
Faculty of Science a nd Technology Faculty of Science and Technology
University of Mumbai University of Mumbai

Page 8

Preface By BoS

It is our honor and a privilege to present the Rev-2019 ‘C’ scheme syllabus of Bachelor of
Engineering in Informa tion Technology (effective from year 2019 -20) with inclusion of cutting edge
technology. Information Technology is comparatively a young branch among other engineering
disciplines in the University of Mumbai. It is evident from the placement statistics of various
colleges affiliated to the University of Mumbai that IT branch has taken the lead in the placement.

The branch also provides multi -faceted scope like better placement and promotion of
entrepreneurship culture among students, and increased Industr y Institute Interactions. Industries
views are considered as stakeholders will design of the syllabus of Information Technology. As per
Industries views only 16 % graduates are directly employable. One of the reasons is a syllabus which
is not in line with the latest technologies. Our team of faculties has tried to include all the latest
technologies in the syllabus. Also first time we are giving skill -based labs and Mini -project to
students from third semester onwards which will help students to work on la test IT technologies.
Also the first time we are giving the choice of elective from fifth semester such that students will be
master in one of the IT domain. The syllabus is peer reviewed by experts from reputed industries and
as per their suggestions it c overs future trends in IT technology and research opportunities available
due to these trends.

We would like to thank senior faculties of IT department of all colleges affiliated to University of
Mumbai for significant contribution in framing the syllabus . Also on behalf of all faculties we thank
all the industry experts for their valuable feedback and suggestions. We sincerely hope that the
revised syllabus will help all graduate engineers to face the future challenges in the field of
information and tech nology


Program Specific Outcome for graduate Program in Information Technology

1. Apply Core Information Technology knowledge to develop stable and secure IT system.
2. Design, IT infrastructures for an enterprise using concepts of best practices in inf ormation
Technology and security domain .
3. Ability to work in multidisciplinary projects and make it IT enabled.
4. Ability to adapt latest trends and technologies like Analytics, Blockchain, Cloud, Data science.




Board of Studies in Information Te chnology Engineering - Team
Dr. Deven Shah ( Chairman)
Dr. Lata Ragha (Member)
Dr. Vaishali D. Khairnar (Member)
Dr. Sharvari Govilkar (Member)
Dr. Sunil B. Wankhade (Member)
Dr. Anil Kale (Member)
Dr. Vaibhav Narwade (Member)
Dr. GV Choudhary (Member)
Ad-hoc Board Information Technology
University of Mumbai

Page 9

Program Structure for Second Year
Engineering Semester III & IV
UNIVERSITY OF MUMBAI
(With Effect from 2020 -2021)

Semester III

Course
Code
Course Name Teaching Scheme
(Contact Hours)
Credits Assi gned
Theory Pract. Tut. Theory Pract. Tut. Total
ITC301 Engineering Mathematics -III 3 -- 1 3 -- 1 4
ITC302 Data Structure and Analysis 3 -- 3 -- 3
ITC303 Database Management System 3 -- -- 3 -- -- 3
ITC304 Principle of Communication 3 -- -- 3 -- -- 3
ITC305 Paradigms and Computer
Programming Fundamentals 3 -- -- 3 -- -- 3
ITL301 Data Structure Lab -- 2 -- -- 1 -- 1
ITL302 SQL Lab -- 2 -- -- 1 -- 1
ITL303 Computer programming
Paradigms Lab -- 2 -- -- 1 -- 1
ITL304 Java Lab (SBL) -- 4 -- -- 2 -- 2
ITM301 Mini Project – 1 A Front end
/backend Application using JAVA -- 4$ -- -- 2 -- 2
Total 15 14 1 15 07 1 23



Course
Code


Course Name Examination Scheme
Theory Term
Work Pract/
oral Total

Internal Assessment End
Sem.
Exam Exam.
Duratio n
(in Hrs)
Test
1 Test2 Avg.
ITC301 Engineering Mathematics -III 20 20 20 80 3 25 -- 125
ITC302 Data Structure and Analysis 20 20 20 80 3 -- -- 100
ITC303 Database Management System 20 20 20 80 3 -- -- 100
ITC304 Principle of Communication 20 20 20 80 3 -- -- 100
ITC305 Paradigms and Computer
Programming Fundamentals 20 20 20 80 3 -- -- 100
ITL301 Data Structure Lab -- -- -- -- -- 25 25 50
ITL302 SQL Lab -- -- -- -- -- 25 25 50
ITL303 Computer programming
Paradigms Lab -- -- -- -- -- 25 25 50
ITL304 Java Lab (SBL) -- -- -- -- -- 25 25 50
ITM301 Mini Project – 1 A Front end
/backend Application using JAVA -- -- -- -- -- 25 25 50
Total -- -- 100 400 -- 150 125 775
$ indicates work load of Learner (Not Faculty), for Mini Project.

Page 10

Program S tructure for Second Year Engineering
Semester III & IV
UNIVERSITY OF MUMBAI
(With Effect from 2020 -2021)

Semester IV

Course
Code
Course Name Teaching Scheme
(Contact Hours)
Credits Assigned
Theory Pract. Tut. Theory Pract. Tut. Total
ITC401 Enginee ring Mathematics -IV 3 -- 1 3 -- 1 4
ITC402 Computer Network and Network
Design 3 -- -- 3 -- -- 3
ITC403 Operating System 3 -- -- 3 -- -- 3
ITC404 Automata Theory 3 -- -- 3 -- -- 3
ITC405 Computer Organization and
Architecture 3 -- -- 3 -- -- 3
ITL401 Network Lab -- 2 -- -- 1 -- 1
ITL402 Unix Lab -- 2 -- -- 1 -- 1
ITL403 Microprocessor Lab -- 2 -- -- 1 -- 1
ITL404 Python Lab (SBL) -- 4 -- -- 2 -- 2
ITM401 Mini Project – 1 B Python based
automation projects -- 4$ -- -- 2 -- 2
Total 15 14 1 15 7 1 23



Course
Code


Course Name Examination Scheme
Theory Term
Work Pract/
oral Total

Internal Assessment End
Sem.
Exam. Exam.
Duration
(in Hrs)
Test
1 Test 2 Avg.
ITC401 Engineering Mathematics -IV 20 20 20 80 3 25 -- 125
ITC402 Compute r Network and Network
Design 20 20 20 80 3 -- -- 100
ITC403 Operating System 20 20 20 80 3 -- -- 100
ITC404 Automata Theory 20 20 20 80 3 -- -- 100
ITC405 Computer Organization and
Architecture 20 20 20 80 3 -- -- 100
ITL401 Network Lab -- -- -- -- -- 25 25 50
ITL402 Unix Lab -- -- -- -- -- 25 25 50
ITL403 Microprocessor Lab -- -- -- -- -- 25 25 50
ITL404 Python Lab (SBL) -- -- -- -- -- 25 25 50
ITM401 Mini Projec t – 1 B Python based
automation projects -- -- -- -- -- 25 25 50
Total -- -- 100 400 -- 150 75 775
$ indicates work load of Learner (Not Faculty), for Mini Project .

Page 11

Program Structure for Third Year Engineering
Semester V & VI
UNIVERSITY OF MUMBAI
(With Effect from 2021 -2022)

Semester V

Course
Code
Course Name Teaching
Scheme
(Conta ct
Hours)
Credits Assigned
Theory Pract. Theory Pract. Total
ITC501 Internet Programming 3 -- 3 -- 3
ITC502 Computer Network Security 3 -- 3 3
ITC503 Entrepreneurship and E - business 3 -- 3 -- 3
ITC504 Software Engineering 3 -- 3 -- 3
ITDO501 X Department Optional Course –
1 3 -- 3 -- 3
ITL501 IP Lab -
- 2 -- 1 1
ITL502 Security Lab -
- 2 -- 1 1
ITL503 DevOPs Lab -
- 2 -- 1 1
ITL504 Advance DevOPs Lab - 2 -- 1 1

ITL505 Business
Communication and Ethics
-
-
2*+2
--
2
2
ITM501 Mini Proje ct – 2 A Web Based
Business M odel -
- 4$ -- 2 2
Total 15 16 15 08 23



Course
Code


Course Name Examination Scheme
Theor
y Term
Work Prac
/oral Total

Internal Assessment End
Sem
Exam Exam.
Duration
(in Hrs)
Test1 Test2 Avg
ITC501 Internet Programming 20 20 20 80 3 -- -- 100
ITC502 Computer Network Security 20 20 20 80 3 -- -- 100
ITC503 Entrepreneurship and E - business 20 20 20 80 3 -- -- 100
ITC504 Software Engineering 20 20 20 80 3 -- -- 100
ITDO501 X Department Optional Course –
1 20 20 20 80 3 -- -- 100
ITL501 IP Lab -- -- -- -- -- 25 25 50
ITL502 Security Lab -- -- -- -- -- 25 25 50
ITL503 DevOPs Lab -- -- -- -- -- 25 25 50
ITL504 Advance DevOPs Lab -- -- -- -- -- 25 25 50

ITL505 Business
Communication and Ethics
--
--
--
--
--
50
--
50

Page 12

ITM501 Mini Project – 2 A Web Based
Business Model -- -- -- -- -- 25 25 50
Total -- -- 100 400 -- 175 125 800

* Theory class to be conducted for full class
$ indicates work load of Learner (Not Faculty), for Mini Project



ITDO 501X Department Optional Course – 1


ITDO5011 Microcontroller Embedded Programming
ITDO5012 Advance Data Management Technologies
ITDO5013 Computer Graphics & Multimedia System
ITDO5014 Advanced Data structure and Analysis

Page 13

Program Structure for Thi rd Year Engineering
Semester V & VI
UNIVERSITY OF MUMBAI
(With Effect from 2021 -2022)

Semester VI

Course
Code
Course Name Teaching Scheme
(Contact Hours)
Credits Assigned
Theory Pract.
Tut. Theory Pract. Total
ITC601 Data Mining &
Business Intellig ence 3 -- 3 -- 3
ITC602 Web X.0 3 -- 3 3
ITC603 Wireless Technology 3 -- 3 -- 3
ITC604 AI and DS – 1 3 -- 3 -- 3
ITDO601
X Department Optional
Course – 2 3 -- 3 -- 3
ITL601 BI Lab -- 2 -- 1 1
ITL602 Web Lab -- 2 -- 1 1
ITL603 Sensor Lab -- 2 -- 1 1
ITL604 MAD & PWA Lab -- 2 -- 1 1
ITL605 DS using Python Skill based
Lab -- 2 -- 1 1
ITM601 Mini Project – 2 B Based on
ML -- 4$ -- 2 2
Total 15 14 15 07 22



Course
Code


Course Name Examination Scheme
Theory Term
Work Prac
/oral Total

Inter nal Assessment End
Sem
Exam Exam.
Duration
(in Hrs)
Test1 Test2 Avg
ITC601 Data Mining &
Business Intelligence 20 20 20 80 3 -- -- 100
ITC602 Web X.0 20 20 20 80 3 -- -- 100
ITC603 Wireless Technology 20 20 20 80 3 -- -- 100
ITC604 AI and DS – 1 20 20 20 80 3 -- -- 100
ITDO601
X Department Optional
Course – 2 20 20 20 80 3 -- -- 100
ITL601 BI Lab -- -- -- -- -- 25 25 50
ITL602 Web Lab -- -- -- -- -- 25 25 50
ITL603 Sensor Lab -- -- -- -- -- 25 25 50
ITL604 MAD & PWA Lab -- -- -- -- -- 25 25 50
ITL605 DS using Python Lab
(SBL) -- -- -- -- -- 25 25 50

Page 14

ITM601 Mini Project – 2 B Based on
ML -- -- -- -- -- 25 25 50
Total -- -- 100 400 -- 150 150 800
$ indicates work load of Learner (Not Faculty), for Mini Project



ITDO601X Department Opti onal Course – 2
ITDO6011 Software Architecture
ITDO6012 Image Processing
ITDO6013 Green IT
ITDO6014 Ethical Hacking and Forensic

Page 15

Program Structure for Fourth Year Engineering
Semester VII & VIII
UNIVERSITY OFMUMBAI
(With Effect from2022 -2023)
Semeste r VII

Course
Code
Course Name Teaching Scheme
(Contact Hours)
Credits Assigned
Theory Pract.
Tut. Theory Pract. Total
ITC701 AI and DS –II 3 -- 3 -- 3
ITC702 Internet of Everything 3 -- 3 3
ITDO701
X Department Optional
Course – 3 3 -- 3 -- 3
ITDO702
X Department
Optional Course –4 3 -- 3 -- 3
ITIO701 X Institute Optional
Course – 1 3 -- 3 -- 3
ITL701 Data Science Lab -- 2 -- 1 1
ITL702 IOE Lab -- 2 -- 1 1
ITL703 Secure Application
Development -- 2 -- 1 1
ITL704 Recent Open Source
Project Lab -- 2 -- 1 1
ITP701 Major Project I -- 6# -- 3 3
Total 15 14 15 7 22



Course
Code


Course Name Examination Scheme
Theory Term
Work Prac/o
ral Total

Internal Assessment End
Sem
Exam Exam.
Duration
(in Hrs)
Test1 Test2 Avg
ITC701 AI and DS –II 20 20 20 80 3 -- -- 100
ITC702 Internet of Everything 20 20 20 80 3 -- -- 100
ITDO701
X Department
Optional Course –3 20 20 20 80 3 -- -- 100
ITDO702
X Department
Optional Course –4 20 20 20 80 3 -- -- 100
ITIO701X Institute Optional
Course – 1 20 20 20 80 3 -- -- 100
ITL701 Data Science Lab -- -- -- -- -- 25 25 50
ITL702 IOE Lab -- -- -- -- -- 25 25 50
ITL703 Secure Application
Development -- -- -- -- -- 25 25 50
ITL704 Recent Open Source
Project Lab -- -- -- -- -- 25 25 50
ITP701 Major Project I -- -- -- -- -- 25 25 50
Total -- -- 100 400 -- 125 125 750

Page 16

# indicates work load of Learner (Not Faculty), for Major Project

ITDO701X Department Optional Course –3
ITDO701 1 Storage Area Network
ITDO701 2 High Performance computing
ITDO701 3 Infrastructure Security
ITDO701 4 Software Testing and QA


ITDO702X Department Optional Course –4
ITDO702 1 MANET
ITDO702 2 AR – VR
ITDO702 3 Quantum Computing
ITDO702 4 Information Retrieval System



ITIO701X Institute Optional Course – 1 ( Common for all branches will be notified )

Page 17

Program Structure for Fourth Year Engineering
Semester VII & VIII
UNIVERSITY OFMUMBAI
(With Effect from2022 -2023)

Semester VIII


Course
Code
Course Name Teaching Scheme
(Contact Hours)
Credits Assigned
Theory Pract.
Tut. Theory Pract. Total
ITC801 Blockchain and DLT 3 -- 3 -- 3
ITDO801
X Department Optional Course – 5 3 -- 3 -- 3
ITDO802
X Department Optional Course – 6 3 -- 3 -- 3
ITIO801 X Institute Optional Course – 2
3 -- 3 -- 3
ITL801 Block chain Lab -- 2 -- 1 1
ITL802 Cloud computing -- 2 -- 1 1
ITP801 Major Project II -- 12# -- 6 6
Total 12 16 12 8 20



Course
Code



Course Name Examination Scheme
Theory Term
Work Prac
/oral Total

Internal Assessment End
Sem
Exam Exam.
Duratio
n
(in Hrs)
Test1 Test2 Avg
ITC801 Bloc kchain and DLT 20 20 20 80 3 -- -- 100
ITDO801
X Department Optional Course – 5 20 20 20 80 3 -- -- 100
ITDO802
X Department Optional Course – 6 20 20 20 80 3 -- -- 100
ITIO801X Institute Optional Course – 2
20 20 20 80 3 -- -- 100
ITL801 Blockchain Lab -- -- -- -- -- 25 25 50
ITL802 Cloud computing -- -- -- -- -- 25 25 50
ITP801 Major Project II -- -- -- -- -- 100 50 150
Total -- -- 80 320 -- 150 100 650
# indicates work load of Learner (Not Faculty), for Major Project

Students group and load of fa culty per week.
Mini Project 1 and 2 :
Students can form groups with minimum 2 (Two) and not more than 4 (Four)
Faculty Load : 1 hour per week per four groups

Page 18

Major Project 1 and 2 :
Students can form groups with minimum 2 (Two) and not more than 4 (Fou r)
Faculty Load : In Semester VII – ½ hour per week per project group
In Semester VIII – 1 hour per week per project group



ITDO801X Department Optional Course – 5
ITDO8 011 Big Data Analytics
ITDO8 012 Reinforcement learning
ITDO8 013 Simulation and Mod eling
ITDO8 014 Knowledge management


ITDO802X Department Optional Course –6
ITDO8 021 User Interface Design
ITDO8 022 Robotics
ITDO8 023 ERP
ITDO8 024 Cloud computing and Services


ITIO801X Institute Optional Course – 2 ( Common for all branches will be notified )

Page 19

AC: 23/7/2020

Item No. : 126

UNIVERSITY OF MUMBAI



Bachelor of Engineering
in
Information Technology 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 )

Page 20

Date :23/7/2020


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


Sr. No. Heading Particulars
1 Title of the Course Second Year B.E. Information Technology
Engineering
2 Eligibility for Admission
After Passing First Year Engineering as per the
Ordinance 0.6242
3 Passing Marks 40%
4 Ordinances /
Regulations ( if any) Ordinance 0.6242
5 No. of Years / Semesters 8 semesters
6 Level P.G. / U.G. / Diploma / Certificate
(Strike out which is not applicable)
7 Pattern Yearly / Semester
(Strike out which is not applicable )
8 Status New / Revised
(Strike out which is not applicable )
9 To be implemented from
Academic Year With effect from Academic Year: 2020 -2021


















































































AC: 23/7/2020 _



Item No.
126


UNIVERSITY OF MUMBAI





Syllabus for Approval

Page 21

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 t he 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 focu ses 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 t erms 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 ski lls, 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 w ill be carried forward for Third Year and Final Year Engineering in the academic years
2021 -22, 2022 -23, respectively.






Dr. S. K. Uka rande Dr. Anuradha Muzumdar
Associate Dean Dean
Faculty of Scien ce and Technology Faculty of Science and Technology
University of Mumbai University of Mumbai

Page 22

Incorporation a nd 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 al l 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 certifi cation for the same.
This will definitely help learners to facilitate their enhanced learning based on their interest.





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

Page 23

Preface By BoS

It is our honor and a privilege to present the Rev-2019 ‘C’ scheme syllabus of Bachelor of
Engineering in Information Technology (effective from year 2019 -20) with inclusion of cutting
edge technology. Information Technology is comparatively a young branch among other
engineering disciplines in the University of Mumbai. It is evident from the placement statistics of
various colleges affiliated to the University of Mumbai that IT branch has taken the lead in the
placement.

The branch also provides multi -faceted scope like better placement and promotion of
entrepreneurship culture among students, and increased Industry Institute Interactions. Industries
views are considered as stakeholders will design of the syllabus of Information Technology. As per
Industries views only 16 % graduates are directly employable. One of the reasons is a syllabus
which is not in line with the latest technologies. Our team of faculties has tried to include all the
latest technologies in the syllabus. Also first time we are giving skill -based labs and Mini -project
to students from third semester onwards which will help students to work on latest IT technologies.
Also the first time we are giving the choice of elective from fifth semester such that students will
be master in one of the IT domain. The syllabus is peer reviewed by experts from reputed industries
and as per their suggestions it covers future trends in IT technology and research opportunities
available due to these trends.

We would like to thank senior faculties of IT department of all colleges affiliated to University of
Mumbai for significant contribution in framing the syllabus. Also on behalf of all fa culties we thank
all the industry experts for their valuable feedback and suggestions. We sincerely hope that the
revised syllabus will help all graduate engineers to face the future challenges in the field of
information and technology


Program Specific Outcome for graduate Program in Information Technology

1. Apply Core Information Technology knowledge to develop stable and secure IT system.
2. Design, IT infrastructures for an enterprise using concepts of best practices in information
Technology an d security domain .
3. Ability to work in multidisciplinary projects and make it IT enabled.
4. Ability to adapt latest trends and technologies like Analytics, Blockchain, Cloud, Data science.




Board of Studies in Information Technology Engineering - Team
Dr. Deven Shah ( Chairman)
Dr. Lata Ragha (Member)
Dr. Vaishali D. Khairnar (Member)
Dr. Sharvari Govilkar (Member)
Dr. Sunil B. Wankhade (Member)
Dr. Anil Kale (Member)
Dr. Vaibhav Narwade (Member)
Dr. GV Choudhary (Member)
Ad-hoc Board Information Technology
University of Mumbai

Page 24

Program Structure for Second Year
Engineering Semester III & IV
UNIVERSITY OF MUMBAI
(With Effect from 2020 -2021)

Semester III

Course
Code
Course Name Teaching Scheme
(Contact Hours)
Credits Assigned
Theory Pract. Tut. Theory Pract. Tut. Total
ITC301 Engineering Mathematics -III 3 -- 1 3 -- 1 4
ITC302 Data Structure and Analysis 3 -- 3 -- 3
ITC303 Database Management System 3 -- -- 3 -- -- 3
ITC304 Principle of Communication 3 -- -- 3 -- -- 3
ITC305 Paradigms and Computer
Programming Fundamentals 3 -- -- 3 -- -- 3
ITL301 Data Structure Lab -- 2 -- -- 1 -- 1
ITL302 SQL Lab -- 2 -- -- 1 -- 1
ITL303 Computer programming
Paradigms Lab -- 2 -- -- 1 -- 1
ITL304 Java Lab (SBL) -- 4 -- -- 2 -- 2
ITM301 Mini Project – 1 A for Front end
/backend Application using JAVA -- 4$ -- -- 2 -- 2
Total 15 14 1 15 07 1 23



Course
Code


Course Name Examination Scheme
Theory Term
Work Pract/
oral Total

Internal Assessment End
Sem.
Exam Exam.
Duration
(in Hrs)
Test
1 Test2 Avg.
ITC301 Engineering Mathematics -III 20 20 20 80 3 25 -- 125
ITC302 Data Structure and Analysis 20 20 20 80 3 -- -- 100
ITC303 Database Management System 20 20 20 80 3 -- -- 100
ITC304 Principle of Communication 20 20 20 80 3 -- -- 100
ITC305 Paradigms and Computer
Programming Fundamentals 20 20 20 80 3 -- -- 100
ITL301 Data Structure Lab -- -- -- -- -- 25 25 50
ITL302 SQL Lab -- -- -- -- -- 25 25 50
ITL303 Computer programming
Paradigms Lab -- -- -- -- -- 25 25 50
ITL304 Java Lab (SBL) -- -- -- -- -- 25 25 50
ITM301 Mini Project – 1 A for Front end
/backend Application using JAVA -- -- -- -- -- 25 25 50
Total -- -- 100 400 -- 150 125 775
$ indicates work load of Learner (Not Faculty), for Mini -Project . Students can form groups with minimum
2 (Two) and not more than 4 (Four) Faculty Load : 1 hour per week per four groups .

Page 25

Program Structure for Second Year
Engineering Semester III & IV
UNIVERSITY OF MUMBAI
(With Effect from 2020 -2021)

Semester IV

Course
Code
Course Name Teaching Scheme
(Contact Hours)
Credits Assigned
Theory Pract. Tut. Theory Pract. Tut. Total
ITC401 Engineering Mathematics -IV 3 -- 1 3 -- 1 4
ITC402 Computer Network and Network
Design 3 -- -- 3 -- -- 3
ITC403 Operating System 3 -- -- 3 -- -- 3
ITC404 Automata Theory 3 -- -- 3 -- -- 3
ITC405 Computer Organization and
Architecture 3 -- -- 3 -- -- 3
ITL401 Network Lab -- 2 -- -- 1 -- 1
ITL402 Unix Lab -- 2 -- -- 1 -- 1
ITL403 Microprocessor Lab -- 2 -- -- 1 -- 1
ITL404 Python Lab ( SBL) -- 4 -- -- 2 -- 2
ITM401 Mini Project – 1 B for Pytho n based
automation projects -- 4$ -- -- 2 -- 2
Total 15 14 1 15 7 1 23



Course
Code


Course Name Examination Scheme
Theory Term
Work Pract/
oral Total

Internal Assessment End
Sem.
Exam. Exam.
Duration
(in Hrs)
Test
1 Test 2 Avg.
ITC401 Engineering Mathematics -IV 20 20 20 80 3 25 -- 125
ITC402 Computer Network and Network
Design 20 20 20 80 3 -- -- 100
ITC403 Operating System 20 20 20 80 3 -- -- 100
ITC404 Automata Theory 20 20 20 80 3 -- -- 100
ITC405 Computer Organization and
Architecture 20 20 20 80 3 -- -- 100
ITL401 Network Lab -- -- -- -- -- 25 25 50
ITL402 Unix Lab -- -- -- -- -- 25 25 50
ITL403 Microprocessor Lab -- -- -- -- -- 25 25 50
ITL404 Python Lab (SBL) -- -- -- -- -- 25 25 50
ITM401 Mini Project – 1 B for Python based
automation projects -- -- -- -- -- 25 25 50
Total -- -- 100 400 -- 150 75 775
$ indicates work load of Learner (Not Faculty), for Mini Project . Students can form groups with minimum
2 (Two) and not more than 4 (Four) Faculty Load : 1 hour per week per four groups

Page 26

Course Teaching Scheme
Credits Assigned
Course Name (Contact Hours)
Code

Theory
Prac t.
Tut.
Theory
TW/Pract
Tut.
Total

ITC301 Engineering
Mathematics -III 03 - 01 03 - 01 04


Course
Code Course Name Examination
Scheme
Theory
Term
Work Pract Oral Total
Internal Assessment
End
Sem
Exam


Test1
Test2
Avg of
Test 1
& 2





ITC301 Engineering
Mathematics -III 20 20 20 80 25 - - 125


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

Course Objectives:


Sr. No. Course Objectives
The course aims:
1 To familiarize with the Laplace Transform, Inverse Laplace Transform of various
functions, and its applications.
2 To acquaint with the concept of Fourier series, its complex form and enhance the
problem solving skills.
3 To familiarize the concept of complex variables, C -R equations with applications.
4 The fundamental knowledge of Trees, Graphs etc.
5 To study the basic techniques of statistics like correlation, regression and curve fitting
for data analysis, Machine learning and AI.
6 To understand some advanced topics of probability, random variables with their
distributions and expectations.

Course Outcomes:

Sr.
No. Course Outcomes Cognitive levels
of attainment as
per Bloom’s
Taxonomy
On successful completion, of course, learner/student will be able to:
1 Apply the concept of Laplace transform to solve the real integrals in
engineering problems. L1, L2
2 Apply the concept of inverse Laplace transform of various functions in
engineering problems. L1, L2

Page 27

3 Expand the periodic function by using Fourier series for real life problems and
complex engineering problem s. L1, L2, L3
4 Find orthogonal trajectories and analytic function by using basic concepts of
complex variable theory. L1, L2, L3
5 Apply the concept of Correlation and Regression to the engineering
problems in data science, machine learning and AI. L2, L3
6 Illustrate understanding of the concepts of probability and expectation for
getting the spread of the data and distribution of probabilities . L1, L2


Module Detailed Contents Hours CO
Mapping
01 Module: Laplace Transform
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,
Seco nd Shifting Theorem, change of scale Property, multiplication by t,
Division by t, Laplace Transform of derivatives and integrals (Properties
without proof).
1.4 Evaluation of real integrals by using Laplace Transformation.

Self-learning Topics: Heaviside’s Unit Step function, Laplace Transform.
of Periodic functions, Dirac Delta Function. 7 CO1
02 Module: Inverse Laplace Transform
2.1 Inverse Laplace Transform, Linearity property, use of standard
formulae to find inverse Laplace Transfor m, finding 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)

Self-learning Topics: Applications to solve initial and boundary value
problems involving ordinary differential equations 6 CO1,
CO2
03 Module: Fourier Series:
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,

Fourier series of even and odd functions

3.4 Half range Sine and Cosine Series.


Self-learning Topics: Complex form of Fourier Series, orthogonal and
orthonormal set of functions, Fourier Transform. 7 CO3

Page 28

04 Module: Complex Variables:

4.1 Function f(z)of complex variable, limit, continuity and differentiability
of f(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 to determine analytic function f(z)when real
part (u) o r Imaginary part (v) or its combination (u+v or u -v) is given.

4.4 Harmonic function, Harmonic conjugate and orthogonal trajectories

Self-learning Topics: Conformal mapping, linear, bilinear mapping, cross
ratio, fixed points and standard transformations 7 CO4
05 Module: Statistical Techniques
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.

Self-learning Topics: Covariance, fitting of exponential curve. 6 CO5
06 Module: Probability
6.1 Definition and basics of probability, conditional probability,

6.2 Total Probability Theorem and Baye’s theorem

6.3 Discrete and continuous random variable with probability distribution
and probability density function.

6.4 Expectation of random variables with mean, variance and standard
deviation, moment generating function up to four moments.

Self-learning Topics: Skewness and Kurtosis of distribution (data) 6 CO6

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. Theo ry and Problems of Fourier Analysis with applications to BVP, Murray Spiegel,
Schaum’s Outline Series.



Online References:

Sr. No. Website Name
1. https://www.nptel.ac.in

Page 29

Term Work:

General Instructions:
1. Students must be encouraged to write at least 6 class tutorials on entire syllabus.
2. 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 should be considered as mini project in
Engineering Mathematics. This project should be graded for 10 marks depe nding on the performance
of the students.

The distribution of Term Work marks will be as follows –

1. Attendance (Theory and Tutorial) 05 marks
2. Class Tutorials on entire syllabus 10 marks
3. Mini project 10 marks

Assessment :

Internal Assessment Test:
Assessment consists of two class tests of 20 marks each. The first class test (Internal Assessment I) is to be
conducted when approx. 40% syllabus is completed and second class test (Internal Assessment II) 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 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 hours as
mentioned in the syllabus.

Page 30

Course Code
Course
Name Teaching Scheme
(Contact Hours) Credits Assigned
Theory Practical Tutorial Theory Practical
/Oral Tutorial Total
ITC302 Data
Structure
and
Analysis 03 -- -- 03 -- -- 03


Course
Code
Course
Name Examination Scheme
Theory Marks
Term Work Pract . /Oral Total Internal assessment End
Sem.
Exam Test1 Test 2 Avg.
ITC302 Data
Structure and
Analysis 20 20 20 80 -- -- 100

Course Objectives:


Sr. No. Course Objectives
The course aims :
1 The fundamental knowledge of data structures.
2 The programming knowledge which can be applied to sophisticated data structures.
3 The fundamental knowledge of stack s queue, linked list etc.
4 The fundamental knowledge of Trees, Graphs etc.
5 The fundamental knowledge of different sorting, searching, hashing and recursion
techniques
6 The real time applications for stack s, queue, linke d list, trees, graphs etc.

Course Outcomes:

Sr.
No. Course Outcomes Cognitive levels
of attainment as
per Bloom’s
Taxonomy
On successful completion, of course, learner/student will be able to:
1 Classify and Apply the concepts of stacks, queues and linked list in real life
problem solving. L1, L2, L3
2 Classify , apply and analyze the concepts trees in real life problem solving. L2, L3 ,L4
3 Illustrate and justify the concepts of graphs in real life problem solving. L3, L5
4 List and examine the concepts of sorting, searching techniques in real life
problem solving. L2, L3, L4
5 Use and identify the concepts of recursion, hashing in real life problem
solving. L3, L4
6 Examine and justify different methods of stacks, queues, linked list, trees
and graphs to various applications. L3, L4, L5

Page 31

Prerequisite: C Programming


DETAILED SYLLABUS:

Sr.
No. Module Detailed Content Hours CO
Mapping
0 Prerequisite Defining, Declaring and Initialization of structure variables.
Accessing members of a structure, Array of structures, Nested
structures, Pointers to structures. Passing structure, structure
members, structure arrays and pointer to structure as function
parameters. Self -referential structures. 02 ---
I Introduction
to Stacks,
Queues and
Linked Lists Introduction to Data Structures: Linear and Non Linear Data
Structures, Static and Dynamic Data Structures.
Concept of Stack and Queue. Array Implementation of Stack
and Queue, Circular Queue, Double Ended Queue, Priority
Queue.

Concept of Linked Lists. Singly linked lists, doubly linked
lists and circular linked lists.

Insertion, deletion, update and copying operations with Singly
linked lists, doubly linked lists and circular linked lists.
Reversing a singly linked list.

Self-learning Topics: Linked List Implementation of Stack,
Linked List implementation of Queue, Circular Queue,
Double Ended Queue, Priority Queue. 08 CO1
II Trees Introduction to Trees: Terminology, Types of Binary trees.

Non recursive Preorder, in -order and post -order traversal.
Creation of binary trees from the traversal of binary trees.

Binary search tree: Traversal, searching, insertion and deletion
in binary search tree.

Threaded Binary Tree: Finding in -order succe ssor and
predecessor of a node in threaded tree. Insertion and deletion
in threaded binary tree.

AVL Tree: Searching and traversing in AVL trees. Tree
Rotations: Right Rotation, Left Rotation. Insertion and
Deletion in an AVL Tree.
B-tree: Searching, I nsertion, Deletion from leaf node and non -
leaf node.
B+ Tree, Digital Search Tree, Game Tree & Decision Tree

Self-learning Topics: Implementation of AVL and B+ Tree 07 CO1,

CO 2
III Graphs
Introduction to Graphs: Undirected Graph, Directed Graph,
graph terminology, Connectivity in Undirected and Directed
Graphs. Spanning tree.

Representation of graph: adjacency matrix, adjacency list,
Transitive closure of a directed graph and path matrix. 05 CO1, CO3

Page 32

Traversals: Breadth First Search, Depth First Search.

Self-learning Topics: Implementation of BFS, DFS
IV Recursion
and Storage
Management Recursion: Writing a recursive function, Flow of control in
recursive functions, Winding and unwinding phase, Recursive
data structures, Implementation of recursion. Tail recursion.
Indirect and Direct Recursion.

Storage Management: Sequential Fit Methods: First Fit, Best
Fit and Worst Fit methods. Fragmentation, Freeing Memory,
Boundary Tag Me thod. Buddy Systems: Binary Buddy
System, Fibonacci Buddy System. Compaction, Garbage
Collection.

Self-learning Topics: Implementation of recursion function. 06 CO5
V Searching
and Sorting Searching: Sequential Search, Binary Search. Hashing: Hash
Functions: Truncation, Mid -square Method, Folding Method,
Division Method. Collision Resolution: Open Addressing:
Linear Probing, Quadratic Probing, Double Hashing, Separate
Chaining Bucket Hashing. Analysis of all searching
techniques

Sorting: Insertion sort, Selection sort, Merge sort, Quick sort
and Radix sort. Analysis of all sorting techniques

Self-learning Topics: Implementation of different sorting
techniques and searching. 05 CO 4,

CO5
VI Applications
of Data
Structures Applications of Linked Lists: Addition of 2 Polynomials and
Multiplication of 2 polynomials.

Applications of Stacks: Reversal of a String, Checking
validity of an expression containing nested parenthesis,
Function calls, Polish Notation: Introduction to infix, prefix
and postfix expressions and their evaluation and conversions.

Application of Queues: Scheduling, Round Robin Scheduling

Applications of Trees: Huffman Tree and Heap Sort.

Applications of Graphs: Dijkstra’s Algorithm, Minimum
Spanning Tre e: Prim’s Algorithm, Kruskal’s Algorithm.

Self-learning Topics: Implementation of applications for
Stack, Queues, Linked List, Trees and Graph. 06 CO6

Text Books:

1. S. K Srivastava, Deepali Srivastava; Data Structures through C in Depth; BPB
Publications; 2011.
2. Yedidya Langsam, Moshej Augenstein, Aaron M. Tenenbaum; Data Structure Using C
& C++; Prentice Hall of India; 1996.
3. Reema Thareja; Data Structures using C; Oxford.

Page 33

References:

1. Ellis Horowitz, Sartaj Sahni ; Fundamentals of Data Structures; Galgotia Publications; 2010.
2. Jean Paul Tremblay, Paul G. Sorenson; An introduction to data structures with
applications; Tata McGrawHill; 1984.
3. Rajesh K. Shukla; Data Structures using C and C++; Wiley India; 200 9.

Online References:

Sr. No. Website Name
2. https://www.nptel.ac.in
3. https://opendatastructures.org/
3. https://www.coursera.org/

Assessment:
Internal Assessment (IA) for 20 marks:
 IA will consist of Two Compulsory Internal Assessment Tests. Approximately 40% to 50%
of syllabus content must be covered in First IA Test and remaining 40% to 50% of syllabus
content must be covered in Second IA Test
 Question paper format
 Question Paper will comprise of a total of six questions each carrying 20 marksQ.1 will
be compulsory and should cover maximum contents of the syllabus
 Remaining questions will be mixed in nature (part (a) and part (b) of each question must
be from different modules. For example, if Q.2 has part (a) from Module 3 then part (b)
must be from any other Module randomly selected from all the modules)
 A total of four questions need to be answered

Page 34

Course Code
Course
Name Teaching Scheme
(Contact Hours) Credits Assigned
Theory Practical Tutorial Theory Practical
/Oral Tutorial Total
ITC303 Database
Management
System 03 -- -- 03 -- -- 03


Course
Code
Course
Name Examination Scheme
Theory Marks
Term Work Pract. /Oral Total Internal assessment End
Sem.
Exam Test1 Test 2 Avg.
ITC303 Database
Management
System 20 20 20 80 -- -- 100
Course Objectives:


Sr. No. Course Objectives
The course aims:
1 To learn the basics and understand the need of database management system.
2 To construct conceptual data model for real world applications
3 To Build Relational Model from ER/EER.
4 To introduce the concept of SQL to store and retrieve data efficiently.
5 To demonstrate notions of normalization for database design.
6 To understand the concepts of transaction processing - concurrency control & recovery
procedures.

Course Outcomes:

Sr.
No. Course Outcomes Cognitive levels
of attainment as
per Bloom’s
Taxonomy
On successful completion, of course, learner/student will be able to:
1 Identify the need of Database Management System. L1, L2
2 Design conceptual model for real life applications. L6
3 Create Relational Model for real life applications L6
4 Formulate query using SQL commands. L3
5 Apply the concept of normalization to relational database design. L3
6 Demonstrate the concept of transaction, concurrency and recovery. L2

Page 35

Prerequisite: C Programming

DETAILED SYLLABUS:
Sr.
No. Module Detailed Content Hours CO
Mapping
0 Prerequisite Comment Basic knowledge of operating systems
and file systems, Any programming 02 --
I Database System
Concepts and
Architecture Introduction, Characteristics of Databases, File
system v/s Database system, Data abstraction and
Data Independence, DBMS system architecture,
Database Administrator (DBA), Role of DBA
Self-learning Topics: Identify the types of
Databases. 05 CO1
II The Entity -
Relationship
Model Conceptual Modeling of a database, The Entity -
Relationship (ER) Model, Entity Type, Entity Sets,
Attributes and Keys, Relationship Types,
Relationship Sets, Weak entity Types
Generalization, Specialization and Aggregation,
Extended Entity -Relationship (EER) Model.
Self-learning Topics: Design an ER model for any
real time case study. 05 CO2
III Relational Model
& Relational
Algebra Introduction to Relational Model,
Relational Model Constraints and
Relational Database Schemas, Concept of Keys:
Primary Kay, Secondary key, Foreign Key,
Mapping the ER and EER Model to the Relational
Model, Introduction to Relational Algebra,
Relational Algebra expressio ns for Unary
Relational Operations,
 Set Theory operations,
 Binary Relational operation
Relational Algebra Queries
Self-learning Topics: Map the ER model designed
in module II to relational schema. . 05 CO3
IV Structured Query
Language (SQL)
& Indexing Overview of SQL, Data Definition
Commands, Set operations, aggregate function,
null values, Data Manipulation commands, Data
Control commands, Complex Retrieval Queries
using Group By, Recursive Queries, nested Queries
;

Integrity constraints in SQL. Data base
Programming with JDBC, Security and
authorization: Grant & Revoke in SQL Functions
and Procedures in SQL and cursors.

Indexing:Basic Concepts,
Ordered Indices, Index Definition in SQL
Self-learning Topics: Physical design of database
for the relational model designed in module III and
fire various queries. 08 CO4

Page 36

V Relational
Database Design Design guidelines for relational Schema,
Functional Dependencies, Database tables and
normalization, The need for normalization, The
normalization process, Improving the design,
Definition of Normal Forms - 1NF, 2NF, 3NF &
The Boyce -Codd Normal Form (BCNF).
Self-learning Topics: Consider any real time
application and normalization upto 3NF/BCNF 07 CO5
VI Transactions
Management and
Concurrency and
Recovery
Transaction:
Transaction concept, State Diagram, ACID
Properties, Transaction Control Commands,
Concurrent Executions, Serializability – Conflict
and View,
Concurrency Control:
Lock -based -protocols, Deadlock handling
Timestamp -based protocols,
Recovery System:
Recovery Concepts, Log based recovery.
Self-learning Topics: Study the various deadlock
situation which may occur for a database designed
in module V. 07 CO6
Text Books:

1. Korth, Slberchatz, Sudarshan, Database System Concepts, 6th Edition, McGraw Hill
2. Elmasri and Navathe, Fundamentals of Database Systems, 6th Edition, 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, 9th Edition.
2. SQL & PL / SQL for Oracle 11g Black Book, Dreamtech Press
3. G. K. Gupta : “Database Management Systems”, McGraw – Hill

Online References:
Sr. No. Website Name
1. https://www.nptel.ac.in
2. https://www.oreilly.com
3. https://www.coursera.org/

Assessment:
Internal Assessment (IA) for 20 marks:
 IA will consist of Two Compulsory Internal Assessment Tests. Approximately 40% to 50%
of syllabus content must be covered in First IA Test and remaining 40% to 50% of syllabus
content must be covered in Second IA Tes t
 Question paper format
 Question Paper will comprise of a total of six questions each carrying 20 marks Q.1 will
be compulsory and should cover maximum contents of the syllabus
 Remaining questions will be mixed in nature (part (a) and part (b) of each question must
be from different modules. For example, if Q.2 has part (a) from Module 3 then part (b)
must be from any other Module randomly selected from all the modules)
 A total of four questions need to be answered

Page 37

Cour se Code
Course Name Teaching Scheme
(Contact Hours) Credits Assigned
Theory Practical Tutorial Theory Practical
/Oral Tutorial Total
ITC304 Principle of
Communication 03 -- -- 03 -- -- 03


Course
Code
Course Name Examination Scheme
Theory Marks
Term Work Pract. /Oral Total Internal assessment End
Sem.
Exam Test1 Test 2 Avg.
ITC304 Principle of
Communication 20 20 20 80 -- -- 100

Course Objectives:


Sr. No. Course Objectives
The course aims:
1 Study the basic of Analog and Digital Communication Systems .
2 Describe the concept of Noise and Fourier Transform for analyzing communication systems.
3 Acquire the knowledge of different modulation techniques such as AM, FM and study the
block diagram of transmitter and receiver.
4 Study the Sampling theorem and Pulse Analog and digital modulation techniques
5 Learn the concept of multiplexing and digital band pass modulation techniques
6 Gain the core idea of electromagnetic radiation and propagation of waves.

Course Outcomes:

Sr.
No. Course Outcomes Cognitive levels
of attainment as
per Bloom’s
Taxonomy
On successful completion, of course, learner/student will be able to:
1 Describe analog and digital communication systems L1,L2
2 Differentiate types of noise, analyses the Fourier transform of time and
frequency domain. L1, L2, L3, L4
3 Design transmitter and receiver of AM, DSB, SSB and FM. L1,L2,L3 ,L4
4 Describe Sampling theorem and pulse modulation systems. L1,L2,L3
5 Explain multiplexing and digita l band pass modulation techniques. L1, L2
6 Describe electromagnetic radiation and propagation of waves. L1,L2

Prerequisite: Basic of electrical engineering

Page 38

DETAILED SYLLABUS:

Sr.
No. Module Detailed Content Hours CO
Mapping
0 Prerequisite Terminologies in communication systems, analog and
digital electronics 02
I Introduction Basics of analog communication and digital
communication systems (Block diagram),
Electromagnetic Spectrum and application, Types of
Communication channels.
Self-learning Topics: Applications areas of analog
and digital communication. 03 CO1
II Noise and Fourier
Representation of
Signal and
System Basics of signal representation and analyses,
Introduction to Fourier Transform, its properties
(time and frequency shifting, Fourier transform of
unit step, delta and gate function. Types of Noise,
Noise parameters –Signal to noise ratio, Noise factor,
Noise figure, Friss formula and Equivalent noise
temperature .
Self-learning Topics: Practice Numerical on above
topic. 06 CO2
III Amplitude and
Angle modulation
Techniques. Need for modulation,
Amplitude Modulation Techniques: DSBFC
AM,DSBSC -AM, SSB SC AM- block diagram
spectrum, waveforms, bandwidth,
Power calculations.
Generation of AM using Diode, generation of DSB
using Balanced modulator, Generation of SSB using
Phase Shift Method.
AM Transmitter (Block Diagram)
AM Receivers – Block diagram of TRF receivers and
Super heterodyne receiver and its characteristics -
Sensitivity, Selectivity, Fidelity, Image frequency and
its rejection
and double spotting
Angle Modulation
FM: Principle of FM - waveforms, spectrum,
bandwidth. Pre - emphasis and de -emphasis in FM,
FM generation: Direct method –Varactor diode
Modulator, Indirect method (Armstrong method)
block diagram and waveforms.
FM demodulator: Foster Seeley discriminator, Ratio
detector.
Self-learning Topics: Use of AM and FM in Modern
Communication Technology . Challenges faced by
radio business . 12 CO1,
CO2,
CO3
IV Pulse Analog
Modulation and
Digital
Modulation Sampling theorem for low pass and band pass signals
with proof,
Anti- aliasing filter, PAM, PWM and PPM generation
and
Degeneration.
Quantization process, Pulse code modulation, Delta
modulation,
Adaptive delta modulation.
Introduction to Line Codes and ISI. 08 CO1,
CO2,
CO4

Page 39

Self-learning Topics: Implementation of Pulse code
modulation and demodulation.
V Multiplexing and
Digital Band Pass
Modulation
Techniques Principle of Time Division Multiplexing, Frequency
Division Multiplexing , Orthogonal Frequency
Division Multiplexing and its applications .ASK,
FSK, PSK QPSK Generation and detection.
Self-learning Topics: Implement TDM, FDM,
OFDM. 04 CO1,
CO2,
CO5
VI Radiation and
Propagation of
Waves Electromagnetic radiation, fundamentals, types of
propagation, ground wave, sky wave, space wave
tropospheric scatter propagation
Self-learning Topics: List the real time examples for
different types of propagation waves. 04 CO6

Text Books:

[1]. George Kennedy, Bernard Davis, SRM Prasanna, Electronic Communication Systems, Tata McGraw
Hill, 5th Ed
[2]. Simon Haykin, Michael Moher, Introduction to Analog & Digital Communications, Wiley India P vt.
Ltd., 2nd Ed.
[3].Wireless Communication and Networking, Vijay Garg

References:
[1]. Wayne Tomasi, Electronic Communications Systems, Pearson Publication, 5th Ed.
[2]. B P Lathi, Zhi Ding, Modern Digital and Analog Communication Systems, Oxford University
[3]. Herbert Taub, Donald L Schilling, Goutam Saha, Principles of Communication Systems, Tata
McGraw Hill, 3rdEd.
[4]. K Sam Shanmugam, Digital and Analog Communication Systems, Wiley India Pvt. Ltd, 1st Ed.

Online References:

Sr. No. Website Name
1. https://www.nptel.ac.in
2. https://www.classcentral.com
3. http://www.vlab.co.in/

Assessment:
Internal Assessment (IA) for 20 marks:
 IA will consist of Two Compulsory Internal Assessment Tests. Approximately 40% to 50%
of syllabus content must be covered in First IA Test and remaining 40% to 50% of syllabus
content must be covered in Second IA Tes t
 Question paper format
 Question Paper will comprise of a total of six questions each carrying 20 marks Q.1 will
be compulsory and should cover maximum contents of the syllabus
 Remaining questions will be mixed in nature (part (a) and part (b) of each ques tion must
be from different modules. For example, if Q.2 has part (a) from Module 3 then part (b)
must be from any other Module randomly selected from all the modules)
 A total of four questions need to be answered

Page 40

Course Code
Course
Name Teaching Scheme
(Contact Hours) Credits Assigned
Theory Practical Tutorial Theory Practical
/Oral Tutorial Total
ITC305 Paradigms
and
Computer
Programming
Fundamentals 03 -- -- 03 -- -- 03


Course
Code
Course
Name Examination Scheme
Theory Marks
Term Work Pract. /Oral Total Internal assessment End
Sem.
Exam Test1 Test 2 Avg.
ITC305 Paradigms and
Computer
Programming
Fundamentals 20 20 20 80 -- -- 100

Course Objectives:


Sr. No. Course Objectives
The course aims:
1 To introduce various programming paradigms and the basic constructs that underline any
programming language.
2 To understand data abstraction and object orientation
3 To introduce the basic concepts of declarative programming paradigms through functional and
logic programming.
4 To design solutions using declarative programming paradigms through functional and logic
programming.
5 To introduce the concepts of concurrent program execution.
6 To understand use of scripting language for different problem domains

Course Outcomes:

Sr.
No. Course Outcomes Cognitive levels
of attainment as
per Bloom’s
Taxonomy
On successful completion, of course, learner/student will be able to:
1 Understand and Compare different programming paradigms. L1, L2
2 Understand the Object Oriented Constructs and use them in program design. L1, L2
3 Understand the concepts of declarative programming paradigms through
functional and logic programming. L1, L2
4 Design and Develop programs based on declarative programming paradigm
using functional and/or logic programming. L5, L6
5 Understand the role of concurrency in parallel and distributed programming. L1, L2
6 Understand different application domains for use of scripting languages. L1. L2

Page 41

Prerequisite: Students must have learned C Programming (FEC205 and FEL204),

DETAILED SYLLABUS:

Sr.
No. Module Detailed Content Hours CO
Mapping
0 Prerequisite Compilation and interpretation Focus on overview of
compilation steps. 02 CO1
I Introduction to
Programming
Paradigms and
Core Language
Design Issues Introduction to different programming paradigms.
Names, Scopes, and Bindings, Scope Rules, Storage
Management.
Type Systems, Type Checking, Equality Testing and
Assignment.
Subroutine and Control Abstr action: Stack Layout,
Calling sequence, parameter passing
Generic subroutines and modules. Exception handling,
Coroutines and Events.

Self-Learning Topic: Implementation of basic
concepts using programming language.
10

CO1
II Imperative
Paradigm: Data
Abstraction in
Object Orientation Grouping of data and Operations - Encapsulation,
Overloading, Polymorphism, Inheritance, Initialization
and Finalization, Dynamic Binding.

Self-Learning Topic: Implementation of OOP
concepts using preferrably C++ and Java language. 05 CO2
III Declarative
Programming
Paradigm:
Functional
Programming Introduction to Lambda Calculus, Functional
Programming Concepts, Evaluation order, Higher order
functions, I/O -Streams and Monads.

Self-Learning Topic: Implementation of programs
using functional programming Language Haskel can
refer to hacker rank website for problem statements. 07
CO3,
CO4
IV Declarative
Programming
Paradigm: Logic
Programming Logic Programming with PROLOG - Resolution and
Unification, Lists, Arithmetic execution order,
imperative control flow, database manipulation,
PROLOG facilities and deficiencies.

Self-Learning Topic: Identification of different
application domains for use of Prolog and Logic
programming 06 CO3,
CO4
V Alternative
Paradigms:
Concurrency Concurrent Programming Fundamentals, Implementing
synchronisation, Message Passing - Background and
Motivation, Multithreaded programs, Communication
and Synchronization, Language and Libraries, Thread
creation Syntax.

Self-Learning Topic: Study Implementation of
concurrency concepts for real time application. 04
CO5
VI Alternative
Paradigms:
Scripting
Languages Common characteristics, Different Problem domains
for using scripting,Use of scripting in Web
development –server and clients side scripting,
Innovative features of scripting languages - Names and
Scopes, string and pattern manipulation, data types,
object orientation. 05 CO6

Page 42

Self-Learning Topic: Review small client server
application code in any scripting language to realise
applicability of features learned in Module.
Text Books:
1. Scott M L, Programming Language Pragmatics, 3rd Edn., Morgan Kaufmann Publishers, 2009
2. Graham Hutton, Programming in Haskell, 2nd Edition, Cambridge University Press, 2016
3. Programming Languages: Concepts and Constructs; 2nd Edition, Ravi Sethi, Pearson Education
Asia, 1996.
References:
1. Harold Abelson and Gerald Jay Sussman with Julie Sussman foreword by Alan J. Perlis, Structure
and Interpretation of Computer Programs (2nd Edition) (February 2, 2016)
2. Programming Languages: Design and Implementation (4th Edition), by Terrence W. Pratt, Marvin
V. Zelkowitz, Pearson, 2000
3. Rajkumar Buyya, Object -oriented Programming with Java: Essentials and Applications, Tata
McGraw Hill Education Private Limited
4. Max Bramer, Logic Programming with Prolog, Springer ISBN -13: 978 -1852 -33938 -8
Online References:
Sr No Website Name Link
1 Principles of programming Languages
(Videos) https://nptel.ac.in/courses/106/102/106102067/
2 Edx course Paradigms of Computer
Programming – Fundamentals https://www.classcentral.com/course/edx -
paradigms -of-computer -programming -
fundamentals -2298
3 Udemy Couses https://www.udemy.com

Assessment :
Internal Assessment (IA) for 20 marks:
 IA will consist of Two Compulsory Internal Assessment Tests. Approximately 40% to 50% of
syllabus content must be covered in First IA Test and remaining 40% to 50% of syllabus content
must be covered in Second IA Test
► Question paper format
 Question Paper will comprise of a total of six questions each carrying 20 marks Q.1 will be
compulsory and should cover maximum contents of the syllabus.
 Remaining questions will be mixed in nature (part (a) and part (b) of each question must be from
different modules. For example, if Q.2 has part (a) from Module 3 then part (b) must be from any
other Module randomly selected from all the modules)
 A total of four questions need to be answered

Page 43

Lab Code
Lab Name Teaching Scheme
(Contact Hours) Credits Assigned
Theory Practical Tutorial Theory Practical Tutorial Total
ITL301 Data
Structure Lab -- 02 -- -- 01 -- 01


Lab Code
Lab Name Examination Scheme
Theory Marks
Term Work Pract. /Oral Total Internal assessment End
Sem.
Exam Test1 Test 2 Avg.
ITL301 Data Structure
Lab -- -- -- -- 25 25 50

Lab Objectives:


Sr. No. Lab Objectives
The Lab experiments aims:
1 To use data structures as the introductory foundation for computer automation to engineering
problems.
2 To use the basic principles of programming as applied to complex data structures.
3 To learn the principles of stack, queue, linked lists and its variou s operations.
4 To learn fundamentals of binary search tree, implementation and use of advanced tree like
AVL, B trees and graphs.
5 To learn about searching, hashing and sorting.
6 To learn the applications of linked lists, stacks, queues, trees and graphs.

Lab Outcomes:

Sr.
No. Lab Outcomes Cognitive levels
of attainment as
per Bloom’s
Taxonomy
On successful completion, of course, learner/student will be able to:
1 Understand and use the basic concepts and principles of various linked lists,
stacks and queues. L1, L2, L3
2 Understand the concepts and apply the methods in basic trees. L1, L2
3 Use and identify the methods in advanced trees. L3, L4
4 Understand the concepts and apply the methods in graphs. L2, L3
5 Understand the concepts and apply the techniques of searching, hashing and
sorting L2, L3
6 Illustrate and examine the methods of linked lists, stacks, queues, trees and
graphs to various real time problems L3, L4

Page 44

Prerequisite: C Programming

Hardware & Software Requirements:

Hardware Requirement:

PC i3 processor and above Software requirement:

Turbo/Borland C complier


DETAILED SYLLABUS:

Sr.
No. Module Detailed Content Hours LO
Mapping
0 Prerequisite Introduction of C programming language . 02 ----
I Stacks, Queues
and Linked Lists  Array Implementation of Stack and Queue.
 Insertion, deletion operations with Singly linked
lists
 Insertion, deletion operations Doubly linked lists
 Insertion, deletion operations Circular linked
lists.
 Reversing a singly linked list .
 * Linked List implementation of Stack and
Queue 04 LO 1
II Trees  * Implementation of operations (insertion,
deletion, counting of nodes, counting of leaf
nodes etc.) in a binary search tree.
 Implementation of insertion, deletion and
traversal for fully in-threaded binary search tree. 04 LO 2
III Advanced Trees  * Implementation of AVL tree.
 Implementation of operations in a B tree. 04 LO 3
IV Graphs
 Implementation of adjacency matrix creation.
 Implementation of addition and deletion of
edges in a directed graph using adjacency
matrix.
 Implementation of insertion and deletion of
vertices and edges in a directed graph using
adjacency list.
 04 LO 4
V Searching and
Sorting
 Implementation of Heap Sort
 Implementation of Binary Search.
 Implementation of Selection sort, Bubble sort,
Insertion sort, Quick sort 04 LO 5

Page 45

VI Applications of
Data Structures  * Implementation of infix to postfix
conversion and evaluation of postfix
expression
 * Implementation of Josephus Problem using
circular linked list
 * Implementation of traversal of a directed
graph through BFS and DFS.
 Implementation of finding shortest distances
using Dijkstra’s algorithm
 *Implementation of hashing functions
with different collision resolution
techniques 04 LO 6


Text Books:
1. S. K Srivastava, Deepali Srivastava; Data Structures through C in Depth; BPB Publications;
2011.
2. Yedidya Langsam, Moshej Augenstein, Aaron M. Tenenbaum; Data Structure Using C & C++;
Prentice Hall of India; 1996.
3. Reema Thareja; Data Str uctures using C; Oxford.

References:
1. Ellis Horowitz, Sartaj Sahni; Fundamentals of Data Structures; Galgotia Publications; 2010.
2. Jean Paul Tremblay, Paul G. Sorenson; An introduction to data structures with applications;
Tata McGrawHill; 1984.
3. Rajesh K. Shukla; Data Structures using C and C++; Wiley India; 2009.

Term Work: Term Work shall consist of at least 10 to 12 practical’s based on the above list. Also Term work
Journal must include at least 2 assignments.

Term Work Marks: 25 Marks (Total marks) = 15 Marks (Experiment) + 5 Marks (Assignments) + 5 Marks
(Attendance)

Practical & Oral Exam: An Oral & Practical exam will be held based on the above syllabus.

Page 46

Lab Code
Lab Name Teaching Scheme
(Contact Hours) Credits Assigned
Theory Practical Tutorial Theory Practical Tutorial Total
ITL302 SQL Lab -- 02 -- -- 01 -- 01


Lab Code
Lab Name Examination Scheme
Theory Marks
Term Work Pract. /Oral Total Internal assessment End
Sem.
Exam Test1 Test 2 Avg.
ITL302 SQL Lab
-- -- -- -- 25 25 50

Lab Objectives:

Sr. No. Lab Objectives
The Lab experiments aims:
1 To identify and define problem statements for real life applications
2 To construct conceptual data model for real life applications
3 To Build Relational Model from ER/EER and demonstrate usage of relational algebra.
4 To Apply SQL to store and retrieve data efficiently
5 To implement database connectivity using JDBC
6 To understand the concepts of transaction processing - concurrency control & recovery
procedures.

Lab Outcomes:

Sr.
No. Lab Outcomes Cognitive levels
of attainment as
per Bloom’s
Taxonomy
On successful completion, of course, learner/student will be able to:
1 Define problem statement and Construct the conceptual model for real life
application. L1, L3, L4, L6
2 Create and populate a RDBMS using SQL. L3, L4
3 Formulate and write SQL queries for efficient information retrieval L3, L4
4 Apply view, triggers and procedures to demonstrate specific event handling. L1, L3, L4
5 Demonstrate database connectivity using JDBC. L3
6 Demonstrate the concept of concurrent transactions . L3, L4

Prerequisite: C Programming

Page 47

Hardware & Software Requirements:

Hardware Requirement:

PC i3 processor and above Software requirement:

Any SQL Compiler, Java Programming Language

DETAILED SYLLABUS:

Sr.
No. Detailed Content
Hours LO Mapping
1. I Identify real world problem and develop the problem statement. Design an
Entity -Relationship (ER) / Extended Entity -Relationship (EER) Model. 02 LO1
2. I
I Mapping ER/EER to Relational schema model. 02 LO1
3. I
I
I Create a database using DDL and apply integrity constraints.
02 LO2, L O3
4. I
V Perform data manipulations operations on populated database. 02 LO3
5. V Perform Authorization using Grant and Revoke. 02 LO2, LO3
6. V
I Implement Basic and complex SQL queries. 02 LO3, L O4
7. V
I
I Implementation of Views and Triggers.
02 LO4
8. V
I
I
I Demonstrate database connectivity using JDBC.
02 LO5
9. I
X Execute TCL commands. 02 LO4
10. X Implement functions and procedures in SQL 02 LO3, L O4
11. X
I Implementation of Cursor. 02 LO3, L O4
12. X
I
I Implementation and demonstration of Transaction and Concurrency control
techniques using locks. 02 LO6

Text Books:

1. Korth, Slberchatz, Sudarshan, Database System Concepts, 6th Edition, McGraw Hill
2. Elmasri and Navathe, Fundamentals of Database Systems, 6th Edition, 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, 9th Edition.
2. SQL & PL / SQL for Oracle 11g Black Book, Dreamtech Press
3. G. K. Gupta : “Database Management Systems”, McGraw – Hill

Page 48

Term Work:
Term Work shall consist of at least 10 Practical’s based on the above list, but not limited to. Also, Term
work Journal must include at least 2 assignments:
The first assignment may be based on: Relational Algebra and Second may be based on
Transactions

Term Work Marks: 25 Marks (Total marks) = 15 Marks (Experiment) + 5 Marks (Assignments) + 5
Marks (Attendance)

Practical & Oral Exam: An Oral & Practical exam will be held based on the above syllabus.

Page 49

Lab Code
Lab Name Teaching Scheme
(Contact Hours) Credits Assigned
Theory Practical Tutorial Theory Practical Tutorial Total
ITL303 Computer
programming
Paradigms
Lab -- 02 -- -- 01 -- 01


Lab Code
Lab Name Examination Scheme
Theory Marks
Term Work Pract. /Oral Total Internal assessment End
Sem.
Exam Test1 Test 2 Avg.
ITL303 Computer
programming
Paradigms
Lab -- -- -- -- 25 25 50

Lab Objectives:

Sr. No. Lab Objectives
The Lab experiments aims:
1 Understand data abstraction and object orientation
2 Design and implement declarative programs in functional and logic programming languages
3 Introduce the concepts of concurrent program execution
4 Understand run time program management
5 Understand how to implement a programming solution using different programming
paradigms.
6 Learn to compare implementation in different programming paradigms.

Lab Outcomes:

Sr.
No. Lab Outcomes Cognitive levels
of attainment as
per Bloom’s
Taxonomy
On successful completion, of course, learner/student will be able to:

1 Implement Object Oriented concepts in C++. L1, L2, L3
2 Design and Develop solution based on declarative programming paradigm
using functional and logic programming. L6
3 Understand the multi threaded programs in Java and C++ L1, L2
4 Understand the need and use of exception handling and garbage collection
in C++ and JAVA L2, L3
5 Implement a solution to the same problem using multiple paradigms. L6
6 Compare the implementations in multiple paradigms at coding and L4

Page 50

execution level.

Prerequisite: Students must have learned C Programming (FEC205 and FEL204)

Hardware & Software Requirements:

Hardware Requirement:

PC i3 processor and above Software requirement:

C++ compiler, Java Languge support, SWI
Prolog, GHC Compiler .

DETAILED SYLLABUS:

Sr.
No. Module Detailed Content Hours LO
Mapping
0 Prerequisite Demonstrate Compilation and interpretation stages to
students for C, C++, JAVA along with how to debug
the code. 02 --
I Imperative
Paradigm: Data
Abstraction in
Object Orientation At least two Programming Implementations
Preferably in C++ to demonstrate concepts like -
Encapsulation, Inheritance, Initialization and
Finalization, Dynamic Binding. 05 LO1
II Declarative
Programming
Paradigm:
Functional
Programming  Tutorial Introduction to Haskell programming
environment
 Tutorial exercise on operators, types etc. in
Haskell
 At least 5 Haskell Programs to demonstrate
Functional Programming Concepts.
 Sample Programs but not limited to:
◦ Implement safetail function that behaves in
the same way as tail, except that safetail
maps the empty list to the empty list,
whereas tail gives an error in this case.
Define safetail using: (a) a conditional
expression; (b) guarded equations; (c)
pattern matching. Hint: th e library function
null :: [a] -> Bool can be used to test if a list
is empty.
◦ Simple List Comprehension
◦ Higher -Order Functions
◦ Write recursive function to multiply two
natural numbers that uses pre defined add
funion.
◦ Implement the game of nim in Haske ll to
apply list processing.
◦ Haskell code to represent infinite list e.g.
fibobacci series
◦ Implement simple Calculator
Students should clearly understand the syntax and the
execution of the Functional Implementation using
Haskell. 06 LO2

Page 51

III Declarative
Programming
Paradigm: Logic
Programming  Tutorial Installation and working of SWI
Prolog Environment
 Implement at least 5 Prolog programs to
understand declarative programming concepts.
Students should clearly understand the syntax and the
execution of the Prolog code Implementation.
05 LO2
IV Alternative
Paradigms:
Concurrency At least two Programs preferably in c++ and java to
demonstrate Thread management and synchronization 02 LO4
V Run Time Program
Management A Program to understand Exception handling and
Garbage collection, preferably in C++ and JAVA
Students should understand the syntactic differences
in the solutions in both Object Oriented Languages. 02 LO4
VI Programming
Assignment For
comparative study
of Different
Paradigms At Least two implementations each implemented on
multiple paradigms like procedural, object oriented,
functional, logic.
The implementations should be done in a group of
two/three students with appropriate difficulty level.
Student should prepare small report and present the
solution code and demonstrate execution for
alternative solutions they build. 04 LO5,
LO6

Text Books:

1. Scott M L, Programming Language Pragmatics, 3rd Edn., Morgan Kaufmann Publishers, 2009
2. Harold Abelson and Gerald Jay Sussman with Julie Sussman foreword by Alan J. Perlis, Structure
and Interpretation of Computer Programs (2nd Edition)
3. Graham Hutton, Programming in Haskell, 2nd Edition, Cambridge University Press, 2016
4.
References:

1. Sethi R, Programming Languages Concepts and Constructs , 2nd Ed, Pearson Education
2. Yogesh Sajanikar, Haskell Cookbook, Packt Publishing, 2017

Online References:

Sr
No Website Description Link
1 University Stuttgart Germany Lab Course on
Programming Paradigms http://software -
lab.org/teaching/winter2019/pp/
2 Course at MIT Structure and Interpretation of
Computer Programs [2019] https://web.mit.edu/u /6.037
3 Edx Course Paradigms of Computer
Programming – Fundamentals, https://www.edx.org/course/paradigms -
of-computer -programming -
fundamentals
4 Tutorials point link for Haskel https://www.tutorialspoint.com/haskell


Term Work: Term Work shall consist of at least 15 Practicals based on the above modules, but not limited
to. Also, Term work Journal must include at least 3 tutorial reports and 01 report of programming assignment

Page 52

as mentioned in module VI.

Term Work Marks: 25 Marks (Total marks) = 15 Marks (Experiments/Tutorials) + 5 Marks (Assignment
write up) + 5 Marks (Attendance)

Practical & Oral Exam: An Oral & 1 Hr Practical exam will be held based on the above syllabus

Page 53

Lab Code
Lab Name Teaching Scheme
(Contact Hours) Credits Assigned
Theory Practical Tutorial Theory Practical Tutorial Total
ITL304 Java Lab
(SBL) -- 04 -- -- 02 -- 02


Lab Code
Lab Name Examination Scheme
Theory Marks
Term Work Pract. /Oral Total Internal assessment End
Sem.
Exam Test1 Test 2 Avg.
ITL304 Java Lab
(SBL) -- -- -- -- 25 25 50

Lab Objectives:

Sr. No. Lab Objectives
The Lab experiments aims:
1 To understand the concepts of object -oriented paradigm in the Java programming language.
2 To understand the importance of Classes & objects along with constructors, Arrays ,Strings and vectors
3 To learn the principles of inheritance, interface and packages and demonstrate the concept of
reusability for faster development.
4 To recognize usage of Exception Ha ndling, Multithreading, Input Output streams in various
applications
5 To learn designing, implementing, testing, and debugging graphical user interfaces in Java using
Swings and AWT components that can react to different user events.
6 To develop graphical user interfaces using JavaFX controls.

Lab Outcomes:

Sr.
No. Lab Outcomes Cognitive levels
of attainment as
per Bloom’s
Taxonomy
On successful completion, of course, learner/student will be able to:
1 Explain the fundamental concepts of Java Programing. L1, L2
2 Use the concepts of classes, objects, members of a class and the relationships among
them needed for a finding the solution to specific problem. L3
3 Demonstrate how to extend java classes and achieve reusability using Inheritance,
Interface and Packages. L3
4 Construct robust and faster programmed solutions to problems using concept of
Multithreading, exceptions and file handling L3
5 Design and develop Graphical User Interface using Abstract Window Toolkit and
Swings along with response to the events. L6
6 Develop Graphical User Interface by exploring JavaFX framework based on MVC
architecture. L6

Page 54

Prerequisite: Basics of Computer Programming

Hardware & Software Requirements:

Hard ware Requirements Software Requirements Other Requirements
PC With Following
Configuration
1. Intel PIV Processor
2. 2 GB RAM
3. 500 GB Harddisk
4. Network interface card 1. Windows or Linux Desktop OS
2. JDK 1.8 or higher
3. Notepad ++
4.JAVA IDEs like Netbeans or
Eclipse
1. Internet Connection for installing
additional packages if required

DETAILED SYLLABUS:

Sr.
No. Module Detailed Content Hours LO
Mapping
0 Prerequisite Basics of Computer Programming. 02 -
I Java Fundamentals Overview of procedure and object oriented
Programming , Java Designing Goals and Features of
Java Language.
Introduction to the principles of object -oriented
programming : Classes, Objects, Abstraction,
Encapsulation, Inheritance, Polymorphism.
Keywords, Data types, Variables, Operators,
Expressions, Types of variables and methods.
Control Statements : If Statement, If -else, Nested if,
switch Statement, break, continue.
Iteration Statements: for loop, while loop, and do -
while loop
(Perform any 2 programs that covers Classes, Methods,
Control structures and Looping statements)
1) Implement a java program to calculate gross salary &
net salary taking the following data.
Input: empno, empname, basic
Process:
DA=70% of basic
HRA=30% of basic
CCA=Rs24 0/-
PF=10% of basic
PT= Rs100/ -

2) Five Bikers Compete in a race such that they drive at
a constant speed which may or may not be the same as
the other. To qualify the race, the speed of a racer must
be more than the average speed of all 5 racers. Write a
Java program to take as input the speed of each racer
and print back the speed of qualifying racers.
3) Write a Java program that prints all real solutions to
the quadratic equation ax2+bx+c = 0. Read in a, b, c and
use the quadratic formula. If the discr iminate b2-4ac is
negative, display a message stating that there are no real
solutions?
4) Write a Menu driven program in java to implement
simple banking application. Application should read 07 LO1

Page 55

the customer name, account number, initial balance,
rate of inte rest, contact number and address field etc.
Application should have following methods.
1. createAccount()
2. deposit()
3. withdraw()
4. computeInterest()
5. displayBalance()
5)Write a menu driven Java program which will read
a number and should implement the following
methods
1. factorial()
2. testArmstrong()
3. testPalindrome()
4. testPrime()
5. fibonacciSeries()
6) Create a Java based application to perform various
ways of Method overloading.
II Classes, objects,
Arrays and Strings Classes & Objects : Reference Variables, Passing
parameters to Methods and Returning parameters from
the methods, Static members, Non -Static members
Nested and Inner Classes. Static Initialization
Block(SIB), Instance Initialization Block(IIB)
Constructors : Parameterized Co nstructors, chaining
of constructor, finalize() Method, Method overloading,
Constructors Overloading.
Recursion, Command -Line Arguments. Wrapper
classes, InputBufferReader, OutputBufferReader,
String Buffer classes, String functions.
Arrays & Vectors : One and Two Dimensional arrays,
Irregular arrays, dynamic arrays, Array List and Array
of Object.
(Perform any 3 programs that covers Classes & objects,
Constructors, Command Line Arguments,
Arrays/Vectors,String function and recursions ).

Experiments:
1) Write a program that would print the information
(name, year of joining, salary, address) of three
employees by creating a class named 'Employee'.
The output should be as follows:


2) Write a program to print the area of a rectangle by
creating a cla ss named 'Area' having two methods. First
method named as 'setDim' takes length and breadth of
rectangle as parameters and the second method named
as 'getArea' returns the area of the rectangle. Length and
breadth of rectangle are entered through keyboard.
3) Write a Java program to illustrate Constructor
Chaining. 07 LO1
LO2

Page 56

4) Create a class 'Student' with three data members
which are name, age and address. The constructor of the
class assigns default values name as "unknown", age as
'0' and address as "not availabl e". It has two members
with the same name 'setInfo'. First method has two
parameters for name and age and assigns the same
whereas the second method takes has three parameters
which are assigned to name, age and address
respectively. Print the name, age an d address of 10
students. Hint - Use array of objects.
5) Write a java programs to add n strings in a vector
array. Input new string and check whether it is present
in the vector. If it is present delete it otherwise add it to
the vector.
6) Print the sum , difference and product of two complex
numbers by creating a class named 'Complex' with
separate methods for each operation whose real and
imaginary parts are entered by user.
7)Write menu driven program to implement recursive
Functions for following task s.
a) To find GCD and LCM
b) To print n Fibonacci numbers
c) To find reverse of number
d) To solve 1 +2+3+4+........+(n - l )+n

8) Print Reverse Array list in java by writing our own
function.
III Inheritance,
Packages and
Interfaces. Inheritance : Inheritance Basics, Types of Inheritance
in Java, member access, using Super - to call superclass
Constructor, to access member of super class(variables
and methods), creating multilevel hierarchy,
Constructors in inheritance, method overriding ,
Abstract classes and methods, using final, Dynamic
Method Dispatch
Packages : Defining packages, creating packages and
Importing and accessing packages
Interfaces : Defining, implementing and extending
interfaces, variables in interfaces, Default Method in
Interface ,Static Method in interface, Abstract Classes
vs Interfaces.
(Perform any 3 programs covering Inheritance,
Interfaces and Packages).

Experiments

1) Create a Teacher class and derive Professor/
Associate_Professor/Assistant_Professor class from
Teacher class. Define appropriate constructor for all the
classes. Also define a method to display information of
Teacher. Make necessary assumptions as required.

2) Create a class Book and define a display method to
display book information. Inherit Reference_Book and
Magazine classes from Book class and override display
method of Book class in Reference_Book and Magazine
classes. Make necessary assumptions required. 10 LO1
LO3

Page 57

3) A university has two types of students — graduate
students and research students. The University
maintains the record of name, age and programme of
every student. For graduate students, additional
information like percentage of marks and stream, like
science, commerce, etc. is recorded; whereas for
research students, additionally, spec ialization and years
of working experience, if any, is recorded. Each class
has a constructor. The constructor of subclasses makes
a call to constructor of the superclass. Assume that every
constructor has the same number of parameters as the
number of ins tance variables. In addition, every
subclass has a method that may update the instance
variable values of that subclass. All the classes have a
function display_student_info( ), the subclasses must
override this method of the base class. Every student is
either a graduate student or a research student.
Perform the following tasks for the description given
above using Java :
(i) Create the three classes with proper instance
variables and methods, with suitable inheritance.
(ii) Create at least one paramet erised constructor for
each class.
(iii) Implement the display_student_info( ) method in
each class.

4) An employee works in a particular department of an
organization. Every employee has an employee number,
name and draws a particular salary. Every dep artment
has a name and a head of department. The head of
department is an employee. Every year a new head of
department takes over. Also, every year an employee is
given an annual salary enhancement. Identify and
design the classes for the above descriptio n with suitable
instance variables and methods. The classes should be
such that they implement information hiding. You must
give logic in support of your design. Also create two
objects of each class.

5) Consider a hierarchy, where a sportsperson can eith er
be an athlete or a hockey player. Every sportsperson has
a unique name. An athlete is characterized by the event
in which he/she participates; whereas a hockey player is
characterised by the number of goals scored by him/her.
Perform the following task s using Java :
(i)Create the class hierarchy with suitable instance
variables and methods.
(ii) Create a suitable constructor for each class.
(iii) Create a method named display_all_info with
suitable parameters. This method should display all the
infor mation about the object of a class.
(iv) Write the main method that demonstrates
polymorphism.

6) Create an interface vehicle and classes like bicycle,

Page 58

car, bike etc, having common functionalities and put all
the common functionalities in the interface . Classes like
Bicycle, Bike, car etc implement all these functionalities
in their own class in their own way

7) Create a class "Amount In Words" within a user
defined package to convert the amount into words.
(Consider amount not to be more than 100000) .
IV Exception
Handling,
Multithreading,
Input Output
streams Exception Handling: Exception -Handling
Fundamentals, Exception Types, Exception class
Hierarchy, Using try and catch, Multiple catch Clauses,
Nested try Statements, throw, throws, finally , Java’s
Built -in Exceptions, Creating Your Own Exception
Subclasses
Multithreaded Prog ramming: The Java Thread
Model and Thread Life Cycle, Thread Priorities,
Creating a Thread, Implementing Runnable, Extending
Thread, Creating Multiple Threads, Synchronization:
Using Synchronized Methods, The synchronized
Statement
I/O Streams: Stream s, Byte Streams and Character,
The Predefined Streams, Reading Console Input,
Reading Characters, Reading Strings, Writing Console
Output, Reading and Writing Files.
(Perform any 3 programs that cover Exception
Handling, Multithreading and I/O Streams).

Experiments:

1) Write java program where user will enter loginid and
password as input. The password should be 8 digit
containing one digit and one special symbol. If user
enter valid password satisfying above criteria then show
“Login Successful Message” . If user enter invalid
Password then create InvalidPasswordException stating
Please enter valid password of length 8 containing one
digit and one Special Symbol.

2) Java Program to Create Account with 1000 Rs
Minimum Balance, Deposit Amount, Withdraw
Amount and Also Throws LessBalanceException. It has
a Class Called LessBalanceException Which returns the
Statement that Says WithDraw Amount(_Rs) is Not
Valid. It has a Class Which Creates 2 Accounts, Both
Account Deposite Money and One Account Tries to
WithDraw more Money Which Generates a
LessBalanceException Take Appropriate Action for the
Same.

3) Create two threads such that one thread will print
even number and another will print odd number in an
ordered fashion.

4) Assume that two brothers, Joe and John, share a
common bank account. They both can, independently,
read the balance, make a deposit, and withdraw some 10 LO1
LO3
LO4

Page 59

money. Implement java application demonstrate how
the transaction in a bank can be carried out concurrently.

5) You have been given the list of the names of the files
in a directory. You have to select Java files from them.
A file is a Java file if it’s name ends with “.java”. For
e.g. File - “Names.java” is a Java file,
“FileNames.java.pdf” is not.
Input: test.java, ABC.doc, Demo.pdf, add .java,
factorial.java, sum.txt
Output: tset.java, add.java, factorial.java
V GUI
programming - I
(AWT, Event
Handling, Swing) Designing Graphical User Interfaces in Java :
Components and Containers, Basics of Components,
Using Containers, Layout Managers, AWT
Components, Adding a Menu to Window, Extending
GUI Features

Event -Driven Programming in Java : Event -Handling
Process, Event -Handling Mechanism, Delegation
Modelof Event Handling, Event Classes, Event Sources,
Event Listeners, Adapter Classes as Helper Classes in
Event Handling.

Introducing Swing: AWT vs Swings, Components and
Containers, Swing Packages, A Simple Swing
Application, Painting in Swing, Designing Swing GUI
Application using Buttons, JLabels, Checkboxes, Radio
Buttons, JSc rollPane, JList, JComboBox, Trees,
TablesScroll pane Menus and Toolbar

(Perform any 3 programs that contain AWT, Event
handling and Swing to build GUI application).

1)Write a Java program to implement Swing
components namely Buttons, ,JLabels, Checkboxes ,
Radio Buttons, JScrollPane, JList, JComboBox, Trees,
Tables Scroll pane Menus and Toolbars to design
interactive GUI.

2) Write a program to create a window with four text
fields for the name, street, city and pincode with
suitable labels. Also windows contains a button
MyInfo. When the user types the name, his street, city
and pincode and then clicks the button, the types details
must appear in Arial Font with Size 32, Italics.

3) Write a Java program to create a sim ple calculator
using java AWT elements.
.Use a grid layout to arrange buttons for the digits and
basic operation +, -, /, *. Add a text felid to display the
results.
4) Write a Java Program to create a Student Profile
form using AWT controls.
5) Write a Ja va Program to simulate traffic signal light
using AWT and Swing Components. 12 LO1
LO4
LO5

Page 60

6) Write a Java Program to create a color palette.
Declare a grid of Buttons to set the color names.
Change the background color by clicking on the color
button.
7) Build a GUI pr ogram that allows the user to add
objects to a collection and perform search and sort on
that collection.(Hint. Use Swing components like
JButton, JList, JFrame, JPanel and JOptionPane.)


VI GUI
Programming -II
(JavaFX) JavaFX Basic Concepts, JavaFX application skeleton,
Compiling and running JavaFX program,Simple
JavaFX control:Label,Using Buttons and events,
Drawing directly on Canvas.
(Perform any one program that contains the concept of
JavaFX).
1)Write a Java program to design a Login Form using
JavaFX Controls.
2)Write Java program to draw various shapes on
Canvas using JavaFX. 04 LO1
LO5
LO6


Text Books:
1. Herbert Schildt, “Java -The Complete Reference”, Tenth Edition, Oracle Press, Tata McGraw Hill
Education.
2. E. Balguruswamy, “Programming with Java A primer”, Fifth edition, Tata McGraw Hill Publication
3. Anita Seth, B.L.Juneja, “ Java One Step Ahead”, oxford university press.

References:
1. D.T. Editorial Services, “Java 8 Programming Black Book”, Dreamtech Press.
2. Learn to Master Java by Star EDU Solutions
3. Yashvant Kanetkar, “Let Us Java” ,4th Edition ,BPB Publications.

Term Work:
The Term work shall consist of at least 15 practic al based on the above list. The term work Journal must
include at least 2 Programming assignments. The Programming assignments should be based on real world
applications which cover concepts from more than one modules of syllabus .

Term Work Marks: 25 Marks (Total marks) = 15 Marks (Experiment) + 5 Marks
(Assignments/tutorial/write up) + 5 Marks (Attendance)

Practical & Oral Exam: An Oral & Practical exam will be held based on the above syllabus.

Page 61

Course Code
Course
Name Teaching Scheme
(Contact Hours) Credits Assigned
Theory Practical Tutorial Theory Practical Tutorial Total
ITM301 Mini Project
– 1 A for
Front end
/backend
Application
using JAVA -- 04 -- -- 02 -- 02


Course
Code
Course
Name Examination Scheme
Theory Marks
Term Work Pract. /Oral Total Internal assessment End
Sem.
Exam Test1 Test 2 Avg.
ITM301 Mini Project –
1 A for Front
end /backend
Application
using JAVA -- -- -- -- 25 25 50

Course 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 fundamental s to attempt solutions to the
problems.
4. To inculcate the process o f self -learning and research.
Course 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 lea der.
4. Draw the proper inferences from available results through theoretical / experimental/simulations .
5. Analyse 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 life long learning.
9. Demonstrate project management principles during project work.

Guidelines for Mini Project
 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.
 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.
 Students hall submit implementation plan in the form of Gantt/PERT/CPM chart, which will cover
weekly activity of mini project.
 A log book to be prepared by each group, wherein group can record weekly work progress,
guide/supervisor can verify and record notes/comments.
 Faculty supervisor may give inputs to students during mini project activity; however, focus shall be
on self -learning.

Page 62

 Students in a group shall understand problem effectively, propose multiple solution and select best
possible solution in consultation with guide/ supervisor.
 Students sh all convert the best solution into working model using various components of their
domain areas and demonstrate.
 The solution to be validated with proper justification and report to be compiled in standard format of
University of Mumbai .
 With the focus on the self -learning, innovation, addressing societal problems and entrepreneur ship
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.
 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 sem ester, 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.
Guidelines for Assessment of Mini Project :
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;
o Marks awarded by guide/sup ervisor based on log book : 10
o Marks awarded by review committee : 10
o 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 genera l guidelines.
One-year project:
 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 finalisation of problem
 Second shall be on finalisation of proposed solution of problem.
 In second semester expected work shall be procurement of component’s/systems, building of
working prototype, testing and validation of results based on work complete d 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:
 In this case in one semester students’ group shall complete project in all aspects including,
o Identification of need/problem
o Proposed final solution
o Procurement of components/systems
o Building prototype and testing
 Two reviews will be conducted for continuous assessment,
 First shall be for finalisation of problem and proposed solution
 Second shall be for implementation and testing of solution.

Page 63

Assessment criteria of Mini Project.

Mini Project shall be assessed based on following criteria;
1. Quality o f 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 So cietal 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 evalua tion of
performance of students in mini project.
Guidelines for Assessment of Mini Project Practical/Oral Examination:
 Report should be prepared as per the guidelines issued by the University of Mumbai.
 Mini Project sh all 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 organisations having experience of more than five years approved by head of Institution.
 Student s 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
2. Innovativeness in solutions
3. Cost effectiveness and Societal impact
4. Full functioning of working model as per stated requirements
5. Effective use of skill sets
6. Effective use of standard engineering norms
7. Contribution of an individual’s as member or leader
8. Clarity in written and oral communication

Page 64

Program Structure for Second Year
Engineering Semester III & IV
UNIVERSITY OF MUMBAI
(With Effect from 2020 -2021)

Semester IV

Course
Code
Course Name Teaching Scheme
(Contact Hours)
Credits Assigned
Theory Pract. Tut. Theory Pract. Tut. Total
ITC401 Engineering Mathematics -IV 3 -- 1 3 -- 1 4
ITC402 Computer Network and Network
Design 3 -- -- 3 -- -- 3
ITC403 Operating System 3 -- -- 3 -- -- 3
ITC404 Automata Theory 3 -- -- 3 -- -- 3
ITC405 Computer Organization and
Architecture 3 -- -- 3 -- -- 3
ITL401 Network Lab -- 2 -- -- 1 -- 1
ITL402 Unix Lab -- 2 -- -- 1 -- 1
ITL403 Microprocessor Lab -- 2 -- -- 1 -- 1
ITL404 Python Lab (SBL) -- 4 -- -- 2 -- 2
ITM401 Mini Project – 1 B for Python based
automation projects -- 4$ -- -- 2 -- 2
Total 15 14 1 15 7 1 23



Course
Code


Course Name Examination Scheme
Theory Term
Work Pract/
oral Total

Internal Assessment End
Sem.
Exam. Exam.
Duration
(in Hrs)
Test
1 Test 2 Avg.
ITC401 Engineering Mathematics -IV 20 20 20 80 3 25 -- 125
ITC402 Computer Network and Network
Design 20 20 20 80 3 -- -- 100
ITC403 Operating System 20 20 20 80 3 -- -- 100
ITC404 Automata Theory 20 20 20 80 3 -- -- 100
ITC405 Computer Organization and
Architecture 20 20 20 80 3 -- -- 100
ITL401 Network Lab -- -- -- -- -- 25 25 50
ITL402 Unix Lab -- -- -- -- -- 25 25 50
ITL403 Microprocessor Lab -- -- -- -- -- 25 25 50
ITL404 Python Lab (SBL) -- -- -- -- -- 25 25 50
ITM401 Mini Project – 1 B for Python based
automation projects -- -- -- -- -- 25 25 50
Total -- -- 100 400 -- 150 75 775
$ indicates work load of Learner (Not Faculty), for Mini Project . Students can form groups with minimum
2 (Two) and not more than 4 (Four) Faculty Load : 1 hour per week per four groups

Page 65

Course Teaching Scheme
Credits Assigned
Course Name (Contact Hours)
Code

Theory Prac
t.
Tut.
Theory
TW/Pract
Tut.
Total

ITC401 Engineering
Mathematics -IV 03 - 01 03 - 01 04


Course
Code Course Name Examination
Scheme
Theory
Term
Work Pract Oral Total
Internal Assessment
End
Sem
Exam


Test1
Test2
Avg of
Test 1
& 2





ITC401 Engineering
Mathematics -IV 20 20 20 80 25 - - 125


Pre-requisite: Engineering Mathematics -I, Engineering Mathematics -II, Engineering Mathematics -III,
Binomial Distribution.

Course Objectives:

Sr. No. Course Objectives
The course aims:
1 To study Matrix algebra and its application in engineering problems.
2 To learn Line and Contour integrals and expansion of complex valued function in a power
series.
3 To study Z -Transforms and Inverse Z -Transforms with its properties.
4 To acquaint with the concepts of probability distributions and sampling theory for small
samples.
5 To study and apply Linear and Non -linear programming Techniques to solve the optimization
problems

Course Outcomes:

Sr.
No. Course Outcomes Cognitive levels
of attainment as
per Bloom’s
Taxonomy
On successful completion, of course, learner/student will be able to:
1 Apply the concepts of eigen values and eigen vectors to solve engineering
problems. L1, L2, L3
2 Illustrate the use of concepts of Complex Integration for evaluating integrals,
computing residues & evaluate various contour integrals. L3
3 Apply the concept of Z - transformation and its inverse in engineering
problems. L1,L2,L3

Page 66

4 Apply the concept of probability distribution to engineering pr oblems &
testing hypothesis of small samples using sampling theory. L3
5 Apply the concept of Linear Programming to solve the optimization problems
L1, L2, L3
6 Use the Non -Linear Programming techniques to solve the optimization
problems. L3

Module Detailed Contents Hours CO
Mapping
01 Module: Linear Algebra (Theory of Matrices)
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

Self-learning Topics: Derogatory and non -derogatory matrices, Functions of
Square Matrix, Linear Transformations, Quadratic forms. 7





CO1
02 Module: Complex Integration
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 Singulari ty, Zeroes, poles of f(z), Residues, Cauchy’s
Residue Theorem (without proof)
Self-learning Topics: Application of Residue Theorem to evaluate real
integrations. 7



CO2
03 Module: Z Transform
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.

Self-learning Topics: Initial value theorem, Final value theorem, Inverse of
Z Transform by Binomial Expansion 5





CO3
04 Module: Probability Distribution and Sampling Theory
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.

Self-learning Topic s: Test significance for Large samples, Estimate
parameters of a population., Yate’s Correction. 7





CO4
05 Module: Linear Programming Problems 6

Page 67

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

Self-learning Topics: Sensitivity Analysis, Two-Phase Simplex Method,
Revised Simplex Method
CO5
06 Module: Nonlinear Programming Problems
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

Self-learning Topics: Problems with two inequality constraints,
Unconstrained optimization: One dimensional search method (Golden
Search method, Newton’s method). Gradient Search method 7



CO6

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

Onli ne References:

Sr. No. Website Name
1. https://www.nptel.ac.in

Term Work:

General Instructions:
1. Students must be encouraged to write at least 6 class tutorials on entire syllabus.
2. 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 should be considered as mini project in
Engineering Mathematics. This project should be graded for 10 marks depe nding on the
performance of the students.

The distribution of Term Work marks will be as follows –

1. Attendance (Theory and Tutorial) 05 marks
2. Class Tutorials on entire syllabus 10 marks
3. Mini project 10 marks

Assessment :

Internal Assessment Test:

Page 68

Assessment consists of two class tests of 20 marks each. The first class test (Internal Assessment I) is to
be conducted when approx. 40% syllabus is completed and second class test (Internal Assessment II)
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 enti re 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 hours as mentioned
in the syllabus.

Page 69

Course Code
Course
Name Teaching Scheme
(Contact Hours) Credits Assigned
Theory Practical Tutorial Theory Practical
/Oral Tutorial Total
ITC402 Computer
Network and
Network
Design 03 -- -- 03 -- -- 03


Course
Code
Course
Name Examination Scheme
Theory Marks
Term Work Pract. /Oral Total Internal assessment End
Sem.
Exam Test1 Test 2 Avg.
ITC402 Computer
Network and
Network
Design 20 20 20 80 -- -- 100

Course Objectives:


Sr. No. Course Objectives
The course aims:
1 Understand the division of network functionalities into layers.
2 Understand the types of transmission media along with data link layer concepts, design issues
and protocols
3 Analyze the strength and weaknesses of routing protocols and gain knowledge about IP
addressing
4 Understand the data transportation, issues and related protocols for end to end delivery of
data.
5 Understand the data presentation techniques used in presentation layer & client/server model
in applic ation layer protocols.
6 Design a network for an organization using networking concepts

Course Outcomes:

Sr.
No. Course Outcomes Cognitive levels
of attainment as
per Bloom’s
Taxonomy
On successful completion, of course, learner/student will be able to:
1 Describe the functionalities of each layer of the models and compare the
Models. L1
2 Categorize the types of transmission media and explain data link layer
concepts, design issues and protocols. L2, L3, L4
3 Analyze the routing protocols and assign IP address to networks. L4
4 Explain the data transportation and session management issues and related
protocols used for end to end delivery of data. L1, L2
5 List the data presentation techniques and illustrate the client/server model in
application layer protocols. L1, L3
6 Use of networking concepts of IP address, Routing, and application services
to design a network for an organization L3

Page 70

Prerequisite: PCOM

DETAILED SYLLABUS:

Sr.
No. Module Detailed Content Hours CO
Mapping

0
Prerequisite Terminologies of communication
02 -
I
Introduction to
Computer
Networks Uses Of Computer Networks, Network Hardware,
Network Software, Protocol Layering, Reference Models:
OSI, TCP/IP, Comparison of OSI & TCP/IP, Network
Devices .
Self-learning Topics: Identify the different devices used
in Network connection. College campus

03

CO1

II Physical Layer &
Data Link Layer Physical layer: Guided Media, Unguided Media, Wireless
Transmission: Electromagnetic Spectrum. Switching:
Circuit -Switched Networks, Packet Switching, Structure
Of A Switch
DLL Design Issues (Services, Framing, Error Control,
Flow Control), Error Detection and Correction(Hamming
Code,Parity, CRC, Checksum) , Elementary Data Link
protocols : Stop and Wait, Sliding Window(Go Back N,
Selective Repeat), Piggybacking, HDLC
Medium Access Protocols: Random Access, Controlled
Access, Channelization.
Ethernet Protocol: Standard Ethernet, Fast Ethernet (100
Mbps), Gigabit Ethernet, 10 -Gigabit Ethernet.

Self-learning Topics: Differentiate link layer in IOT
network and Normal Network.

08

CO2

III Network Layer Network Layer Services, Packet Switching, Network Layer
Performance, IPv4 Addressing (classful and classless),
Subnetting, Supernetting ,IPv4 Protocol, DHCP, Network
Address Translation (NAT).
Routing algorithms : Distance Vector Routing, Link state
routing,Path Vector Routing.
Protocols –RIP,OSPF,BGP.
Next Generation IP: IPv6 Addressing,IPv6 Protocol,
Transition fromIPV4 to IPV6
Self-learning Topics: Study difference between IPV4
and IPV6. Network Class A, B, C, D, E and subnet mask.



08



CO3

Page 71

IV Transport Layer
& Session Layer Transport Layer: Transport Layer Services,
Connectionless & Connection -oriented Protocols,
Transport Layer protocols: User Datagram Protocol: UDP
Services, UDP Applications, Transmission Control
Protocol: TCP Services, TCP Features, Segment, A TCP
Connection, Windows in TCP, Flow Contro l, Error
Control, TCP Congestion Control, TCP Timers.
Session Layer: Session layer design issues, Session
Layer protocol - Remote Procedure Call (RPC),
Self-learning Topics: List real time example of UDP
and TCP.


07


CO4

V Presentation
Layer &
Application
Layer Presentation layer :Compression: Comparison between
Lossy Compression and Lossless Compression, Huffman
Coding, Speech Compression, LZW, RLE, Image
Compression – GIF,JPEG.
Application layer: Standard Client -Server Protocols:
World Wide We b, HTTP, FTP, Electronic Mail, Domain
Name System (DNS), SNMP
Self-learning Topics: Difference between HTTP
and FTP Protocol.

05

CO5

VI Network Design
Concepts Introduction to VLAN ,VPN
A case study to design a network for an organization
meeting the following guidelines:
Networking Devices,
IP addressing: Subnetting, Supernetting, Routing Protocols
to be used, Services to be used: TELNET, SSH, FTP
server, Web server, File server, DHCP server and DNS
server.
Self-learning Topics: Study the Networ k Design of your
college campus.
06
CO6

Text Books:

1. Andrew S Tanenbaum, Computer Networks -, 4th Edition, Pearson Education.
2. Behrouz A. Forouzan, Data Communications and Networking ,4th Edition,Mc Graw Hill education.
References:
1. S. Keshav, An Engineering Approach to Computer Networks, 2nd Edition, Pearson Education.
2.B. A. Forouzan, “TCP/IP Protocol Suite”, Tata McGraw Hill edition, Third Edition.
3. Ranjan Bose, Information Theory, Coding and Cryptography, Ranjan Bose, Tata McGrawHill , Second Edition.
4. Khalid Sayood, Introduction to Data Compression, Third Edition, Morgan Kaufman.

Page 72

Online References:

Sr. No. Website Name
1. https://www.nptel.ac.in
2. https://swayam.gov.in
3. https://www.coursera.org/

Assessment:
Internal Assessment (IA) for 20 marks:
 IA will consist of Two Compulsory Internal Assessment Tests. Approximately 40% to 50%
of syllabus content must be covered in First IA Test and remaining 40% to 50% of syllabus
content must be covered in Second IA Test
 Question paper format
 Question Paper will comprise of a total of six questions each carrying 20 marks Q.1 will
be compulsory and should cover maximum contents of the syllabus
 Remaining questions will be mixed in nature (part (a) and part (b) of each question must
be from different modules. For example, if Q.2 has part (a) from Module 3 then part (b)
must be from any other Module randomly selected from all the modules)
 A total o f four questions need to be answered

Page 73

Course Code
Course
Name Teaching Scheme
(Contact Hours) Credits Assigned
Theory Practical Tutorial Theory Practical
/Oral Tutorial Total
ITC4 03 Operating
System 03 -- -- 03 -- -- 03


Course
Code
Course
Name Examination Scheme
Theory Marks
Term Work Pract. /Oral Total Internal assessment End
Sem.
Exam Test1 Test 2 Avg.
ITC4 03 Operating
System 20 20 20 80 -- -- 100

Course Objectives:


Sr. No. Course Objectives
The course aims:
1 To understand the major components of Operating System & its functions .
2 To introduce the concept of a process and its management like transition, scheduling, etc.
3 To understand basic concepts related to Inter -process Communication (IPC) like mutual
exclusion, deadlock, etc. and role of an Operating System in IPC.
4 To understand the concepts and implementation of memory management policies and virtual
memory.
5 To understand functions of Operating System for storage management and device management.
6 To study the need and fundamentalsof special -purpose operating system with the advent of new
emerging technologies .

Course Outcomes:

Sr.
No. Course Outcomes Cognitive levels
of attainment as
per Bloom’s
Taxonomy
On successful completion, of course, learner/student will be able to:
1 Understand the basic concepts related to Operating System. L1, L2
2 Describe the process management policies and illustrate scheduling of
processes by CPU . L1
3 Explain and apply synchronization primitives and evaluate deadlock
conditionsas handled by Operating System . L2
4 Describe and analyze the memory allocation and management functions of
Operating System . L1
5 Analyze and evaluate the services provided by Operating System for storage
management. L4, L5
6 Compare the functions of various special -purpose Operating Systems . L2

Prerequisite: Programming Language C

DETAILED SYLLABUS:

Page 74

Sr.
No. Module Detailed Content Hours CO
Mapping
0 Prerequisite Programming Language C; Basic of Hardware
i.e. ALU, RAM, ROM, HDD, etc.; Computer -
System Organization. 02 -
I Fundamentals of
Operating System Introduction to Operating Systems; Operating
System Structure and Operations; Functions of
Operating Systems; Operating System
Services and Interface; System Calls and its
Types; System Programs; Operating System
Structure; System Boot.

Self-learning Topics: Study of any three
different OS. System calls with examples for
different OS . 03 CO1
II Process
Management Basic Concepts of Process; Operation on
Process; Process State Model and Transition;
Process Control Block; Context Switching;
Introduction to Threads; Types of Threads,
Thread Models; Basic Concepts of
Scheduling; Types of Schedulers; Scheduling
Criteria; Scheduling Algorithms.

Self-learning Topics: Performance
comparison of Scheduling Algorithms,
Selection of Scheduling Algorithms for
different situations, Real -time Scheduling 06 CO2
III ProcessCoordinati
on Basic Concepts of Inter -process
Communication and Synchronization; Race
Condition; Critical Region and Problem;
Peterson’s Solution; Synchronization
Hardware and Semaphores; Classic Problems
of Synchronization; Message Passing;
Introduction to Deadlocks; S ystem Model,
Deadlock Characterization; Deadlock
Detection and Recovery; Deadlock
Prevention; Deadlock Avoidance.
Self-learning Topics: Study a real time case
study for Deadlock detection and recovery. 09




CO3
IV Memory
Management Basic Concepts of Memory Management;
Swapping; Contiguous Memory Allocation;
Paging; Structure of Page Table;
Segmentation; Basic Concepts of Virtual
Memory; Demand Paging, Copy -on Write;
Page Replacement Algorithms; Thrashing.

Self-learning Topics: Memory Management
for any one Operating System, Implementation
of Page Replacement Algorithms . 09 CO4

Page 75

V Storage
Management Basic Concepts of File System; File Access
Methods; Directory Structure; File -System
Implementation; Allocation Methods; Free
Space Management; Overview of Mass -
Storage Structure; Disk Structure; Disk
Scheduling; RAID Structure; Introduction to
I/O Systems.

Self-learning Topics: File System for Linux
and Windows, Features of I/O facility for
different OS. 06 CO5
VI Special -purpose
Operating Systems Open -source and Proprietary Operating
System; Fundamentals of Distributed
Operating System; Network Operating
System; Embedded Operating Systems;Cloud
and IoT Operating Systems ; Real-Time
Operating System;Mobile Operating System;
Multimedia Operating System ;Comparison
between Functions of various Special -purpose
Operating Systems.

Self-learning Topics: Case Study on any one
Special -purpose Operating Systems . 04 CO6
Text Books:
1. A. Silberschatz, P. Galvin, G. Gagne, Operating System Concepts, 10th ed., Wiley, 2018.
2. W. Stallings, Operating Systems: Internal and Design Principles, 9th ed., Pearson, 2018.
3. A. Tanenbaum, Modern Operating Systems, Pearson, 4th ed., 2015.
Reference Books:
1. N. Chauhan, Principles of Operating Systems, 1st ed., Oxford Univer sity Press, 2014.
2. A. Tanenbaum and A. Woodhull, Operating System Design and Implementation, 3rd ed., Pearson .
3. R. Arpaci -Dusseau and A. Arpaci -Dusseau, Operating Systems: Three Easy Pieces, CreateSpace
Independent Publishing Platform, 1st ed., 2018.

Online References:

Sr. No. Website Name
1. https://www.nptel.ac.in
2. https://swayam.gov.in
3. https://www.coursera.org/

Page 76

Assessment:
Internal Assessment (IA) for 20 marks:
 IA will consist of Two Compulsory Internal Assessment Tests. Approximately 40% to 50%
of syllabus content must be covered in First IA Test and remaining 40% to 50% of syllabus
content must be covered in Second IA Test
 Question paper format
 Question Paper will comprise of a total of six questions each carrying 20 marks Q.1 will
be compulsory and should cover maximum contents of the syllabus
 Remaining questions will be mixed in nature (part (a) and part (b) of each question must
be from different modules. Fo r example, if Q.2 has part (a) from Module 3 then part (b)
must be from any other Module randomly selected from all the modules)
 A total of four questions need to be answered

Page 77

Course Code
Course
Name Teaching Scheme
(Contact Hours) Credits Assigned
Theory Practical Tutorial Theory Practical
/Oral Tutorial Total
ITC4 04 Automata
Theory 03 -- -- 03 -- -- 03


Course
Code
Course
Name Examination Scheme
Theory Marks
Term Work Pract. /Oral Total Internal assessment End
Sem.
Exam Test1 Test 2 Avg.
ITC4 04 Automata
Theory 20 20 20 80 -- -- 100

Course Objectives:


Sr. No. Course Objectives
The course aims:
1 To learn fundamentals of Regular and Context Free Grammars and Languages.
2 To understand the relation between Regular Language and Finite Automata and machines.
3 To learn how to design Automata’s as Acceptors, Verifiers and Translators.
4 To understand the relation between Regular Languages, Contexts free Languages, PDA and
TM.
5 To learn how to design PDA as acceptor and TM as Calculators.
6 To learn applications of Automata Theory.

Course Outcomes:

Sr.
No. Course Outcomes Cognitive levels
of attainment as
per Bloom’s
Taxonomy
On successful completion, of course, learner/student will be able to:
1 Explain, analyze and design Regular languages, Expression and Grammars. L2, L4, L6
2 Design different types of Finite Automata and Machines as Acceptor,
Verifier and Translator. L6
3 Analyze and design Context Free languages and Grammars. L4, L6
4 Design different types of Push down Automata as Simple Parser. L6
5 Design different types of Turing Machines as Acceptor, Verifier, Translator
and Basic computing machine. L6
6 Develop understanding of applications of various Automata. L6

Prerequisite: Basic Mathematical Fundamentals: Sets, Logic, Relations, Functions.

DETAILED SYLLABUS:



Sr.
No. Module Detailed Content Hours CO
Mapping

Page 78

0 Prerequisite Basic Mathematical Fundamentals: Sets, Logic,
Relations, Functions. 02 -
I Introduction and
Regular
Languages Languages: Alphabets and Strings.
Regular Languages: Regular
Expressions, Regular Languages,
Regular Grammars, RL and LL
grammars, Closure properties
Self-learning Topics: Practice exercise on Regular
Expressions. Identify the tools also. 05 CO1
II Finite Automata

Finite Automata: FA as language
acceptor or verifier, NFA ( with and
without ε) , DFA, RE to NFA, NFA to DFA,
Reduced DFA , NFA -DFA
equivalence, FA to RE.
Finite State Machines with output : Moore and
Mealy machines. Moore and Mealy M/C
conversion. Limitations of FA.
Self-learning Topics: Practice exercise on FA and
NFA 09 CO2
III Context Free
Grammars
Context Free Languages: CFG,
Leftmost and Rightmost derivations, Ambiguity,
Simplification and Normalization (CNF & GNF)
and Chomsky Hierarchy ( Types 0 to 3)
Self-learning Topics: Practice numerical or
exercise on CFG 08 CO3
IV Push Down
Automata Push Down Automata: Deterministic (single stack)
PDA, Equivalence between PDA and CFG. Power
and Limitations of PDA.
Self-learning Topics: List the examples of PDA. 05 CO4
V Turing
Machine Turing Machine: Deterministic TM, Variants of
TM, Halting problem, Power of TM.
Self-learning Topics: Practice numerical of TM. 07 CO5
VI Applications of
Automata
Applications of FA, CFG, PDA & TM. Introduction
to Compiler & I ts phases.

Self-learning Topics: Case study on any one
compiler. 03 CO2,CO
3,
CO4,CO
5, CO6

Text books

1. J.C.Martin, “Introduction to languages and the Theory of Computation”, TMH.
2. Kavi Mahesh, “Theory of Computation A Problem Solving Approach”, Wiley India
3. A. V. Aho, R. Shethi, Monica Lam , J.D. Ulman , “Compilers Principles, Techniques and Tools
“,Pearson Educati on.

References

1. John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, “Introduction to Automata Theory,
Languages and Computation”, Pearson Education.
2. Daniel I.A. Cohen, “Introduction to Computer Theory”, John Wiley & Sons.
3. Vivek Kulkarni,” Theory of Computation”, Oxford University.
4. N.Chandrashekhar, K.L.P. Mishra, “Theory of Computer Science, Automata Languages &
Computations”, PHI publications.
5.J. J. Donovan, “ Systems Programming”, TMH.

Online References:

Page 79

Sr. No. Website Name
1. https://www.nptel.ac.in
2. https://online.stanford.edu
3. https://www.coursera.org/

Assessment:
Internal Assessment (IA) for 20 marks:
 IA will consist of Two Compulsory Internal Assessment Tests. Approximately 40% to 50%
of syllabus content must be covered in First IA Test and remaining 40% to 50% of syllabus
content must be covered in Second IA Test
 Question paper format
 Question Paper will comprise of a total of six que stions each carrying 20 marks Q.1 will
be compulsory and should cover maximum contents of the syllabus
 Remaining questions will be mixed in nature (part (a) and part (b) of each question must
be from different modules. For example, if Q.2 has part (a) from Module 3 then part (b)
must be from any other Module randomly selected from all the modules)
 A total of four questions need to be answered
.

Page 80

Course Code
Course
Name Teaching Scheme
(Contact Hours) Credits Assigned
Theory Practical Tutorial Theory Practical
/Oral Tutorial Total
ITC4 05 Computer
Organization
and
Architecture 03 -- -- 03 -- -- 03


Course
Code
Course
Name Examination Scheme
Theory Marks
Term Work Pract. /Oral Total Internal assessment End
Sem.
Exam Test1 Test 2 Avg.
ITC4 05 Computer
Organization
and
Architecture 20 20 20 80 -- -- 100

Course Objectives:


Sr. No. Course Objectives
The course aims:
1 Learn the fundamentals of Digital Logic Design.
2 Conceptualize the basics of organizational and features of a digital computer.
3 Study microprocessor architecture and assembly language programming.
4 Study processor organization and parameters influencing performance of a processor.
5 Analyse various algorithms used for arithme tic operations.
6 Study the function of each element of memory hierarchy and various data transfer techniques used in
digital computer.

Course Outcomes:

Sr.
No. Course Outcomes Cognitive levels
of attainment as
per Bloom’s
Taxonomy
On successful completion, of course, learner/student will be able to:
1 Demonstrate the fundamentals of Digital Logic Design L1, L2
2 Describe basic organization of computer, the architecture of 8086 microprocessor
and implement assembly language programming for 8086 microprocessors. L1
3 Demonstrate control unit operations and conceptualize instruction level parallelism. L1, L2
4 List and Identify integers and real numbers and perform computer arithmetic
operations on integers. L1,L4
5 Categorize memory organization and explain the function of each element of a
memory hierarchy. L4
6 Examine different methods for computer I/O mechanism. L3

Page 81

Prerequisite: Basics of Electrical Engineering, Fundamentals of Computer .

DETAILED SYLLABUS:

Sr.
No. Module Detailed Content Hours CO
Mapping
0 Prerequisite Basics of Electrical Engineering, Fundamentals of
Computer 02
I Fundamentals of
Logic Design Number systems: Introduction to Number systems,
Binary Number systems, Signed Binary Numbers,
Binary, Octal, Decimal and Hexadecimal number and
their conversions, 1’s and 2’s complement
Combinational Circuits:
NOT,AND,OR,NAND,NOR,EX -OR,EX -NOR Gates.
Half & Full Adder and subtractor, Reduction of
Boolean functions using K -map method (2,3,4
Variable), introduction to Multiplexers and
Demultiplexers, Encoders & Decoders.
Sequential Circuits: Introduction to Flip Flops: SR, JK,
D, T, master slave flip flop, Truth Table .

Self-learning Topics: Number System, Quine -
McCluskey,Flip -Flop conversion, Counter Design . 07 CO1
II Overview of
Computer
Architecture &
Organization Introduction of Computer Organization and
Architecture. Basic organization of computer and block
level description of the functional units. Evolution of
Computers, Von Neumann model. Performance
meas ure of Computer Architecture, Amdahl’s Law
Architecture of 8086 Family, Instruction Set,
Addressing Modes, Assembler Directives, Mixed -
Language Programming, Stack, Procedure, Macro .

Self-learning Topics: Interfacing of I/O devices
with 8086(8255 ,ADC,DAC). 08 CO2
III Processor
Organization and
Architecture CPU Architecture, Instruction formats, basic
instruction cycle with Interrupt processing. Instruction
interpretation and sequencing. Control Unit: Soft wired
(Microprogrammed ) and hardwired control unit design
methods. Microinstruction sequencing and execution.
Micro operations, concepts of nano programming.
Introduction to parallel processing concepts, Flynn’s
classifications, instruction pipelining, pipeline hazards.

Self-learning Topics : Study the examples on
instruction pipelining for practice. 07 CO3
IV Data
Representation and
Arithmetic
Algorithms Booth’s algorithm. Division of integers: Restoring and
non-restoring division, signed division, basics of
floating -point representation IEEE 754 floating point
(Single & double precision) number representation.

Self-learning Topics: Implement Booth’s Alg orithm
and Division methods . 04 CO4
V Memory
Organization Introduction to Memory and Memory parameters.
Classifications of primary and secondary memories.
Types of RAM and ROM, Allocation policies, Memory
hierarchy and characteristics. Cache memory: Concept,
architecture (L1, L2, L3), mapping techniques. Cache
Coherency, Interleaved and Associative memory
07 CO5

Page 82

Self-learning Topics: Case study on Memory
Organization, Numerical on finding EAT, Address
mapping .
VI I/O Organization Input/output systems, I/O module -need & functions
and Types of data transfer techniques: Programmed
I/O, Interrupt driven I/O and DMA
Self-learning Topics: Comparison of all I/O
methods. 04 CO6

Text Books:
1. R. P. Jain,”Modern Digital Electronics”, TMH
2. M. Morris Mano,”Digital Logic and Computer Design”, PHI
3. Carl Hamacher, Zvonko Vranesic and Safwat Zaky, Computer Organization, Fifth Edition, Tata
McGraw -Hill.
4. William Stallings, Computer Organization and Architecture: Designing for Performance, Eighth
Edition,, Pearson
5. John Uffenbeck, 8086/8088 family: Design Programming and Interfacing, (Pearson Education
References:
1. A. Anand Kumar, ”Fundamentals of Digital C ircuits”,. PHI
2. Donald P Leach, Albert Paul Malvino, “Digital Principals & Applications”, TMH.
3. B. Govindarajulu,, Computer Architecture and Organization: Design Principles and Applications,
Computer Architecture and Organization: Design Principles and Appli cations, Tata McGraw -Hill
4. Dr. M. Usha, T. S. Srikanth, Computer System Architecture and Organization, First Edition,
Wiley -India.
5. John P. Hayes, Computer Architecture and Organization, Third Edition., McGraw -Hill
6. K Bhurchandi, Advanced Microprocessors & Peripherals, Tata McGraw -Hill Education

Online References:

Sr. No. Website Name
1. https://www.nptel.ac.in
2. https://www.geeksforgeeks.org
3. https://www.coursera.org/

Assessment:
Internal Assessment (IA) for 20 marks:
 IA will consist of Two Compulsory Internal Assessment Tests. Approximately 40% to 50%
of syllabus content must be covered in First IA Test and remaining 40% to 50% of syllabus
content must be covered in Second IA Test
 Question paper format
 Question Paper will comprise of a total of six questions each carrying 20 marks Q.1 will
be compulsory and should cover maximum contents of the syllabus
 Remaining questions will be mixed in nature (part (a) and part (b) of each q uestion must
be from different modules. For example, if Q.2 has part (a) from Module 3 then part (b)
must be from any other Module randomly selected from all the modules)
 A total of four questions need to be answered

Page 83

Lab Code
Lab Name Teaching Scheme
(Contact Hours) Credits Assigned
Theory Practical Tutorial Theory Practical Tutorial Total
ITL401 Network Lab -- 02 -- -- 01 -- 01


Lab Code
Lab Name Examination Scheme
Theory Marks
Term Work Pract. /Oral Total Internal assessment End
Sem.
Exam Test1 Test 2 Avg.
ITL401 Network Lab
-- -- -- -- 25 25 50

Lab Objectives:

Sr. No. Lab Objectives
The Lab experiments aims:
1 To get familiar with the basic network administration commands
2 To install and configure network simulator and learn basics of TCL scripting.
3 To understand the network simulator environment and visualize a network topology and
observe its performance
4 To implement client -server socket programs.
5 To observe and study the traffic flow and the contents of protocol frames.
6 To design and configure a network for an organization



Lab Outcomes:

Sr.
No. Lab Outcomes Cognitive levels
of attainment as
per Bloom’s
Taxonomy
On successful completion, of course, learner/student will be able to:
1 Execute and evaluate network administration commands and demonstrate their
use in different network scenarios L3, L5
2 Demonstrate the installation and configuration of network simulator. L1, L2
3 Demonstrate and measure different network scenarios and their performance
behavior. L1, L2
4 Implement the socket programming for client server architecture. L3
5 Analyze the traffic flow of different protocols L4
6 Design a network for an organization using a network design tool L6

Prerequisite: C /Java

Page 84

Hardware & Software Requirements:

Hardware Requirement:

PC i3 processor and above Software requirement:

NS2.34, Protocol Analyzer ( eg. Wireshark),
C/Java/python


DETAILED SYLLABUS:

Sr.
No. Module Detailed Content Hours LO
Mapping
0 Prerequisite Program ming Language (C/J ava),
Basic commands of windows and
Unix/Linux operating system . editor
commands (eg nano/vi editor etc) 02 -
I Fundamentals of
Computer
Network Understanding Basic networking Commands: ifconfig ,ip,
traceroute , tracepath , ping, netstat, ss, dig, nslookup , route ,
host, arp, hostname , curl or wget , mtr, whois , tcpdump
 Execute and analyze basic networking commands. 02 LO1
II Basics of Network
simulation Installation and configuration of
NS2.
Introduction to Tcl Hello Programming
 Installation and configuring of NS -2 simulator
and introduction to Tcl using Hello program 02 LO2
III Simulation of
Network Topology
with different
Protocols Implementation of Specific
Network topology with respect to
1. Number of nodes and physical layer
configuration
2. Graphical simulation ofnetwork with
RoutingProtocols( Distance Vector/ Link State
Routing ) and trafficconsideration (TCP,
UDP)using NAM.
3. Analysis of networkperformance for quality
ofservice parameters such aspacket -delivery -
ratio, delayand throughput
4. Comparative analysis of routing protocols with
respect to QOS parametersusing Xgraph/gnuplot
fordifferent load conditions.
 Write TCL scripts to create topologies. Create and
run traffics and analyze the result using NS2
 Write TCL scripts for topology with Graphical
simulation of traffic consideration (TCP, UDP)
using NAM and plot the graph
 Implement distance vector and link state routing
protocols in NS2. 06 LO3
LO5
IV Socket
Programming Socket Programming with C/Java/python
1. TCP Client, TCP Server
2. UDP Client, UDP Server
 To study and Implement Socket Programming
using TCP . 04 LO4

Page 85

 To study and Implem ent Socket Programming
using UDP
V Protocol
Analyzer 1. Study of various Network Protocol Analyzer
Tools likeWireshark, tcpdump, Windump,
Microsoft Message Analyzer , Ettercap,
Nirsoft SmartSniff etc.
2. Install one of the Network protocol analyzer
tools and analyze the traffic
 Study various network protocol analyzer tools
and analyze the network traffics using one of
the network protocol analyzer tools.
04 LO5
VI Network Design Network Design for an organization using the
following concepts :
1. Addressing (IP Address Assignment),
2. Naming (DNS)
3. Routing

 Perform remote login using Telnet Server
 Design a network for an organization using the
concepts of Addressing (IP Address
Assignment), Naming (DNS) and Routing.
Also mention the internetworking devices used
06 LO6

Text Books:

1. Computer Network Simulation in NS2 Basic Concepts and Protocol Implementation. -Prof Neeraj Bhargava,Pramod
Singh Rathore,Dr.Ritu Bhargava,Dr.Abhishek Kumar, First Edition.BPB Publication.
2. Packet analysis with Wire shark, Anish Nath, PACKT publishing
3. TCP/IP Protocol Suite 4th Editio n by Behrouz A. Forouzan

References:

1. NS2.34 Manual
2. Practical Packet Analysis: Using Wireshark to Solve Real -World Network Problems by Chris Sanders


Term Work: Term Work shall consist of at least 10 to 12 practical’s based on the above list. Also Term work
Journal must include at least 2 assignments.

Term Work Marks: 25 Marks (Total marks) = 15 Marks (Experiment) + 5 Marks (Assignments) + 5 Marks
(Attendance)

Practical & Oral Exam: An Oral & Practical exam will be held based on the above syllabus.

Page 86

Lab Code
Lab Name Teaching Scheme
(Contact Hours) Credits Assigned
Theory Practical Tutorial Theory Practical Tutorial Total
ITL402 Unix Lab -- 02 -- -- 01 -- 01


Lab Code
Lab Name Examination Scheme
Theory Marks
Term Work Pract. /Oral Total Internal assessment End
Sem.
Exam Test1 Test 2 Avg.
ITL402 Unix Lab
-- -- -- -- 25 25 50

Lab Objectives:


Sr. No. Lab Objectives
The Lab experiments aims:
1 To understand architecture and installation of Unix Operating System
2 To learn Unix general purpose commands and programming in Unix editor environment
3 To understand file system management and user management commands in Unix.
4 To understand process management and memory management commands in Unix
5 To learn basic shell script ing.
6 To learn script ing using awk and perl languages.

Lab Outcomes:

Sr.
No. Lab Outcomes Cognitive levels
of attainment as
per Bloom’s
Taxonomy
On successful completion, of course, learner/student will be able to:
1 Understand the architecture and functioning of Unix L1, L2
2 Identify the Unix general purpose commands L4
3 Apply Unix commands for system administrative tasks such as file system
management and user management. L3
4 Execute Unix commands for system administrative tasks such as process
management and memory management L4
5 Implement basic shell scripts for dif ferent applications. L3
6 Implement advanced scripts using awk & perl languages and grep, sed, etc.
commandsfor perform ing various tasks. L3

Prerequisite: Programming Language C

Page 87

Hardware & Software Requirements:

Hardware Requirement:

PC i3 processor and above Software requirement:

Unix, Editor, Bash shell, Bourne shell and C shell


DETAILED SYLLABUS:

Sr.
No. Module Detailed Content Hours LO
Mapping
0 Prerequisite Basic Programming Skills , Concepts of Operating
System 02 -
I Introduction to
Unix Case Study: Brief History of UNIX, Unix Architecture;
Installation of Unix Operating System 03 LO1
II Basic Commands a) Execution of Unix General Purpose Utility
Commands like echo, clear, exit, date, time, uptime,
cal, cat, tty , man, which, history, id, pwd, whoami,
ping, ifconfig, pr, lp, lpr, lpstat, lpq, lprm, cancel,
mail, etc.
b) Working with Editor Vi/other editor. 03 LO2
III Commands for
File System
Management and
User Management a) Study of Unix file system (tree structure), file and
directory permissions, single and multiuser
environment.
b) Execution of File System Management Commands
like ls, cd, pwd, cat, mkdir, rmdir, rm, cp, mv, chmod,
wc, piping and redirection, grep, tr, echo, sort, head,
tail, diff, comm, less, more, f ile, type, wc, split, cmp,
tar, find, vim, gzip, bzip2, unzip, locate, etc.
c) Execution of User Management Commands like who,
whoami, su, sudo, login, logout, exit, passwd,
useradd/adduser, usermod, userdel, groupadd,
groupmod, groupdel, gpasswd, chown, chage, chgrp,
chfn, etc. 04 LO3
IV Commands for
Process
Management and
Memory
Management a) Execution of Process Management Commands like
ps, pstree, nice, kill, pkill, killall, xkill, fg, bg, pgrep,
renice, etc.
b) Execution of Memory Management Commands like
free, /proc/meminfo, top, htop, df, du, vmstat,
demidecode, sar, pagesize, etc. 04 LO4
V Basic Scripts a) Study of Shell, Types of Shell, Variables
andO perators
b) Execute the following Scripts (at least 6):
(i) Write a shell script to perform arithmetic
operations.
(ii) Write a shell script to calculate simple interest.
(iii) Write a shell script to determine largest among
three integer numbers.
(iv) Write a shell script to determine a given year is
leap year or not.
(v) Write a shell script to print multiplication table of
given number using while statement. 04 L02,
L03,
L05

Page 88

(vi) Write a shell script to search whether element is
present is in the list or not.
(vii) Write a shell script to compare two strings.
(viii) Write a shell script to read and check if the
directory / file exists or not, if not make t he
directory / file.
(ix) Write a shell script to implement menu -driven
calculator using case statement.
(x) Write a shell script to print following pattern :
*
* *
* * *
* * * *
(xi) Write a shell script to perform operations on
directory like: display name of current directory;
display list of directory contents; create another
directory, write contents on that and copy it to a
suitable location in your home directory; etc.
VI Advanced Scripts a) Execute the following scripts using grep / sed
commands :
(i) Write a script using grep command to find the
number of words character, words and lines in a
file.
(ii) Write ascript using egrep command to display list
of specific type of files in the directory.
(iii) Write a script using sed command to replace all
occurrences of particular word in given a file.
(iv) Write a script using sedcommand to print
duplicated lines in input.
b) Execute the following scripts u sing awk / perl
languages:
(i) Write an awk script to print all even numbers in a
given range.
(ii) Write an awk script to develop a Fibonacci series
(take user input for number of terms).
(iii) Write a perl script to sort elements of an array.
(iv) Write a perl script to check a number is prime or
not. 06 LO2,
L03,
L06
Text Books:
1. S. Das, Unix Concepts and Applications, 4th ed., McGraw Hill, 2017.
2. R. Michael, Mastering Unix Shell Scripting, 2nd ed., Wiley, 2008.
3. D. Ambawade , D. Shah, Linux Labs and Open Source Technologies, Dreamtech Press, 2014.

References:
1. Y. Kanetkar, Unix Shell Programming, BPB Publications, 2003.
2. B. Forouzan and R. Gilberg, Unix and Shell Programming, Cengage Learning, 2003.

Page 89

Term Work: Term Work shall consist of at least 10 to 12 practical’s based on the above list. Also Term work
Journal must include at least 2 assignments.

Term Work Marks: 25 Marks (Total marks) = 15 Marks (Experiment) + 5 Marks (Assignments) + 5 Marks
(Attendance)

Practical & Oral Exam: An Oral & Practical exam will be held based on the above syllabus.

Page 90

Lab Code
Lab Name Teaching Scheme
(Contact Hours) Credits Assigned
Theory Practical Tutorial Theory Practical Tutorial Total
ITL403 Microprocessor
Lab -- 02 -- -- 01 -- 01


Lab
Code
Lab Name Examination Scheme
Theory Marks
Term Work Pract. /Oral Total Internal assessment End
Sem.
Exam Test1 Test 2 Avg.
ITL403 Microprocessor
Lab -- -- -- -- 25 25 50

Lab Objectives:

Sr. No. Lab Objectives
The Lab experiments aims:
1 Learn assembling and disassembling of PC
2 Design, simulate and implement different digital circuits
3 Get hands on experience with Assembly Language Programming.
4 Study interfacing of peripheral devices with 8086 microprocessor.
5 Realize techniques for faster execution of instructions and improve speed of operation and
performance of microprocessors.
6 Write and debug programs in TASM/MASM/hardware kits

Lab Outcomes:

Sr.
No. Lab Outcomes Cognitive levels
of attainment as
per Bloom’s
Taxonomy
On successful completion, of course, learner/student will be able to:
1 Demonstrate various components and peripheral of computer system L2
2 Analyze and design combinational circuits L4, L6
3 Build a program on a microprocessor using arithmetic & logical instruction
set of 8086. L3
4 Develop the assembly level programming using 8086 loop instruction set L6
5 Write programs based on string and procedure for 8086 microprocessor. L1
6 Design interfacing of peripheral devices with 8086 microprocessor. L6

Prerequisite: Logic Design, Programming Languages(C, C++)

Page 91

Hardware & Software Requirements:

NOTE : Programs can be executed on assembler or hardware boards .

Hardware Requirement:

 Motherboard, RAM, Processor, Connectors,
Cables, SMPS, HDD, Monitor, Graphics card
(optional), and Cabinet.
 8086 microprocessor experiment kits with
specified interfacing study boards Software requirement:

 Microsoft Macro Assembler
(TASM)/Turbo Assembler (TASM)
 Virtual simulator lab.
 Proteus design suite



DETAILED SYLLABUS:

Sr.
No. Module Detailed Content Hours LO
Mapping
I PC Assembly Study of PC Motherboard Technology (South
Bridge and North Bridge), Internal
Components and Connections use d in
computer system . 02 LO1
II Implementation of
combinational
circuits 1. Verify the truth table of various logic gates
(basic and universal gates)
2. Realize Half adder and Full adder
3. Implementation of MUX and DeMUX 06 LO2
III Arithmetic and
logical operations
in 8086 Assembly
language
programming 1. Program for 16 bit BCD addition
2. Program to evaluate given logical
expression.
3. Convert two digit Packed BCD to
Unpacked BCD.
(any two) 05 LO3

IV Loop operations in
8086 Assembly
language
programming 1. Program to move set of numbers from one
memory block to another.
2. Program to count number of 1’s and 0’s in
a given 8 bit number
3. Program to find even and odd numbers
from a given list
4. Program to search for a given number
(any three) 06 LO4


V String &Procedure
in 8086 Assembly
language
programming 1. Check whether a given string is a
palindrome or not.
2. Compute the factorial of a positive integer
‘n’ using procedure.
OR
Generate the first ‘n’ Fibonacci numbers. 04 LO5

VI Interfacing with
8086
microprocessor 1. Interfacing Seven Segment Display
2. Interfacing keyboard matrix
3. Interfacing DAC
(any one) 03 LO6


Text Books:

Page 92

1. Scott Mueller, ”Upgrading and repairing PCs”, Pearson,
2. R. P. Jain, “Modern Digital Electronics”, Tata McGraw Hill.
3. John Uffenbeck, “8086/8088 family: Design Programming and Interfacing:”Pearson Education

Reference Books:

1. M. Morris Mano, “Digital Logic and computer Design”, PHI
2. K Bhurchandi, “Advanced Microprocessors & Peripherals”, Tata McGraw -Hill Education


Term Wor k: Term Work shall consist of at least 10 to 12 practical’s based on the above list. Also Term work
Journal must include at least 2 assignments.

Term Work Marks: 25 Marks (Total marks) = 15 Marks (Experiment) + 5 Marks (Assignments) + 5 Marks
(Attendance)

Practical & Oral Exam: An Oral & Practical exam will be held based on the above syllabus.

Page 93

Lab Code
Lab Name Teaching Scheme
(Contact Hours) Credits Assigned
Theory Practical Tutorial Theory Practical Tutorial Total
ITL404 Python Lab
(SBL) -- 04 -- -- 02 -- 02


Lab Code
Lab Name Examination Scheme
Theory Marks
Term Work Pract. /Oral Total Internal assessment End
Sem.
Exam Test1 Test 2 Avg.
ITL404 Python Lab
(SBL) -- -- -- -- 25 25 50

Lab Objectives:

Sr. No. Lab Objectives
The Lab experiments aims:
1 Basics of python including data types, operator, conditional statements, looping statements, input and
output functions in Python
2 List, tuple, set, dictionary, string, array and functions
3 Object Oriented Programming concepts in python
4 Concepts of modules, packages, multithreading and exception handling
5 File handling, GUI & database programming
6 Data visualization using Matplotlib, Data analysis using Pandas and Web programming using Flask

Lab Outcomes:

Sr.
No. Lab Outcomes Cognitive levels
of attainment as
per Bloom’s
Taxonomy
On successful completion, of course, learner/student will be able to:
1 Understand the structure, syntax, and semantics of the Python language. L1, L2
2 Interpret advanced data types and functions in python L1, L2
3 illustrate the concepts of object -oriented programming as used in Python L2
4 Create Python applications using modules, packages, multithreading and exception
handling. L6
5 Gain proficiency in writing File Handling programs ,also create GUI applications
and evaluate database operations in python. L1, L2
6 Design and Develop cost-effective robust applications using the latest Python trends
and technologies L6

Prerequisite: Structured Programming Approach & Java Programming Lab

Page 94

Hardware & Software Requirements:

Hardware Requirements Software Requirements Other Requirements
PC With following
Configuration
1. Intel Dual core
Processor or higher
2. Minimum 2 GB RAM
3. Minimum 40 GB Hard
disk
4. Network interface card 1. Windows or Linux Desktop OS
2. Python 3.6 or higher
3. Notepad ++
4.Python IDEs like IDLE,
Pycharm, Pydev, Netbeans or
Eclipse
5. Mysql 1. Internet Connection for
installing additional packages
if required

DETAILED SYLLABUS:

Sr.
No. Module Detailed Content Hours LO
Mapping
0 Prerequisite Python IDE installation and environment setup. 02
I Basics of Python Introduction, Features, Python building blocks –
Identifiers, Keywords, Indention, Variables and
Comments,
Basic data types (Numeric, Boolean, Compound)
Operators: Arithmetic, comparison, relational,
assignment, logical, bitwise, member ship, identity
operators, operator precedence
Control flow statements: Conditional statements
(if, if…else, nested if)
Looping in Python (while loop, for loop, nested
loops)
Loop manipulation using continue, pass, break.
Input/output Functions, Decorators, Iterators and
Generators. 08 LO 1

II Advanced data
types & Functions Lists: a) Defining lists, accessing values in list,
deleting values in list, updating lists b) Basic list
operations c) Built -in list functions
Tuples: a) Accessing values in Tuples, deleting
values in Tuples, and updating Tuples b) Basic
Tuple operations c) Built -in Tuple functions
Dictionaries: a) Accessing values in Dictionary,
deleting values in Dictionary, and updating
Dictionary b) Basic Dictionary operations c)
Built -in Dictiona ry functions
Sets: a) Accessing values in Set, deleting values in
Set, updating Sets b) Basic Set operations, c)
Built -in Set functions
Strings: a) String initialization, Indexing, Slicing,
Concatenation, Membership & Immutability b)
Built -in String functi ons
Arrays: a) Working with Single dimensional
Arrays: Creating, importing, Indexing, Slicing,
copying and processing array arrays. b) Working
with Multi -dimensional Arrays using Numpy:
Mathematical operations, Matrix operations,
aggregate and other Built -in functions 09 LO 1
LO 2

Page 95

Functions: a) Built -in functions in python b)
Defining function, calling function, returning
values, passing parameters c) Nested and
Recursive functions d) Anonymous Functions
(Lambda, Map, Reduce, Filter)
III Object Oriente d
Programming Overview of Object -oriented programming,
Creating Classes and Objects, Self -Variable,
Constructors, Inner class, Static method,
Namespaces.
Inheritance: Types of Inheritance (Single,
Multiple, Multi -level, Hierarchical), Super()
method, Constructors in inheritance, operator
overloading, Method overloading, Method
overriding, Abstract class, Abstract method,
Interfaces in Python. 08 LO 1
LO 3

IV Exploring concept
of modules,
packages,
multithreading and
exception handling Modules: Writin g modules, importing objects
from modules, Python built -in modules (e.g.
Numeric and Mathematical module, Functional
Programming module, Regular Expression
module), Namespace and Scoping.
Packages: creating user defined packages and
importing packages.
Multi-threading: process vs thread, use of threads,
types of threads, creating threads in python, thread
synchronization, deadlock of threads.
Exception handling: Compile time errors,
Runtime errors, exceptions, types of exception, try
statement, except block , raise statement, Assert
statement, User -Defined Exceptions. 06 LO 1
LO 4

V File handling, GUI
& database
programming


File Handling: Opening file in different modes,
closing a file, writing to a file, accessing file
contents using standard library functions, reading
from a file – read (), readline (), readlines (),
Renaming and Deleting a file, File Exceptions,
Pickle in Python.
Graphical user interface (GUI): different GUI
tools in python (Tkinter, PyQt, Kivy etc. ),
Working with containers, Canvas, Frame,
Widgets (Button, Label, Text, Scrollbar, Check
button, Radio button, Entry, Spinbox, Message
etc.) Connecting GUI with databases to perform
CRUD operations. (on supported databases like
SQLite, MySQL, Oracle, PostgreSQL etc.). 09




LO 1
LO 5

VI Data visualization,
analysis and web
programming
using python Visualization using Matplotlib: Matplotlib with
Numpy, working with plots (line plot, bar graph,
histogram, scatter plot, area plot, pie chart etc.),
working with multiple figures.
Data manipulation and analysis using Pandas:
Introduction to Pandas, importing data into
Python, series, data frames, indexing data frame s,
basic operations with data frame, filtering,
combining and merging data frames, Removing
Duplicates.
SciPy: Linear algebra functions using Numpy and
Scipy.
Web programming: Introduction to Flask,
Creating a Basic Flask Application, Build a
Simple REST A PI using Flask 10 LO 1
LO 6

Page 96

List of Experiments/Mini -Project.

1) Write python programs to understand
a) Basic data types, Operators, expressions and Input Output Statements
b) Control flow statements: Conditional statements (if, if…else, nested if)
c) Looping in Python (while loop, for loop, nested loops)
d) Decorators, Iterators and Generators.
2) Write python programs to understand
a) Different List and Tuple operations using Built -in functions
b) Built -in Set and String functions
c) Basic Array operations on 1 -D and Multidimensional arrays using Numpy
d) Implementing User defined and Anonymous Functions
3) Write python programs to understand
a) Classes, Objects, Constructors, Inner class and Static method
b) Different types of Inheritance
c) Polymorphism using Operator overloading, Method overloading, Method overriding,
Abstract class, Abstract method and Interfaces in Python.
4) Write python programs to understand
a) Creating User -defined modules/packages and import them in a program
b) Creating user defined multithreaded application with thread synchronization and
deadlocks
c) Creating a menu driven application which should cover all the built -in exceptions in
python
5) Write python programs to understand
a) Different File Handling operations in Python
b) Designing Graphical user interface (GUI) using built -in tools in python (Tkinter, PyQt,
Kivy etc. ).
c) GUI database connectivity to perform CRUD operations in python (Use any one
database like SQLite, MySQL, Oracle, PostgreSQL etc.)
6) Write python pr ograms to implement
a) Different types of plots using Numpy and Matplotlob
b) Basic operations using pandas like series, data frames, indexing, filtering, combining
and merging data frames.
c) Different Linear algebra functions using Scipy.
d) A Basic Flask Application to build a Simple REST API.

❖ Mini Project
Mini -project have to be developed in a group of three students which should cover all above topics.
Suggested Mini -Project Topics:

1. Railway reservation
system 27 IT Team
Workspace 52. Business Direc tory 78. Practice Test
Management.
2. Inventory Management
system. 29 Job Requisition and
Interview Management 53. Education
Directory 79. Asset Management
System
3 Classroom Management 28 Knowledge Base 54. Dental Clinic
Management 80. Travel Agency
System.
4 Clinical Trial Initiation
and Management 29 Lending Library 55. Fund Raising
Management 81. Placement
Management System.

Page 97

5 Competitive Analysis
Web Site 30 Physical Asset
Tracking and
Management 56. Clinic/ Health
Managem ent 82. Polls Management
6 Discussion Forum
website 31 Project Tracking
Workspace 57. Cable Management
System 83. Customer
Management
7 Disputed Invoice
Management 32. Shopping Cart . 58. Survey Creation
and Analytics 84. Project
Management System.
8 Employee Training
Scheduling and Materials 33 Knowledge Base 59. Museum
Management System 85. Network Marketing
System
9 Equity Research
Management 34 Lending Library 60. Multi -Level
Marketing System 86. Yoga Health Care
Management
10 Integrated Marketing
Campaign Tracking 35 Physical Asset
Tracking and
Management 61. Learning
Management System 87. Personal Finance
Management System
11 Manufacturing Process
Managements 36 Project Tracking
Workspace 62. Knowledge
Management System 88. Real Estate
Management System
12 Product and Marketing
Requirements Planning 37 Room and
Equipment
Reservations 63. Missing Person
Site 89. Stock Mutual
Funds Management
13 Request for Proposal
Software 38 Sales Lead Pipeline 64. Disaster
Management Site 90. Careers and
Employment
Management System
14 Sports League
Management 39. Yellow Pages &
Business Directory 65. Job Management
Site 91. Music Albums
Management System
15 Absence Request and
Vacation Schedule
Management 40. Time & Billing 66. Financial Portfolio
Management 92. Classified Ads
Managements
16 Budgeting and Tracking
Multiple Projects 41. Class Room
Management 67. Market Research
Management 93. Property
Management System
17 Bug Database
Management 42. Expense Report
Database 68. Order Management
System 94. Sales & Retail
Management
18 Call Center
Management Software 43. Sales Contact
Management Database 69. Point of Sale 95. Dating Site
19 Change Request
Management 44. Inventory
Management Database 70. Advertisement
/Banner Management
and Analytics 96. Hotel Management
System
20 Compliance Process
Support Site 45. Issue Database 71. Export
Management System 97. Search Engine
21 Co ntacts Management
Software 46. Event Management
Database 72. Invoice
Management 98. Online News Paper
Site
22 Document Library and
Review 47. Service Call
Management Database 73. Recruitment
Management System 99. Image Gallery
23 Event Planning and
Management 48. Accounting Ledger
Database 74. Articles / Blog /
Wiki Web site 100. Staffing and
Human Capital
Management
24 Expense Reimbursement
and Approval 49. Asset Tracking
Database 75. Online Planner 101. Development of a
feature -rich, practical
Online Survey Tool
(OST)
25 Help Desk and Ticket
Management 50. Cycle Factory
Works Management 76. Mock Tests and
Examination
Management 102 Development of a
Web/Email based
Search Engine
26 Inventory Tracking
51. Sales Corporation
Management 77. Examination
System
103. Development of a
web-based
Recruitment Process
System for the HR
group for a company

Page 98

Text Books:

1. Dr. R. Nageswara Rao,” Core Python Programming” , Dreamtech Press, Wiley Publication
2. M. T. Sa valiya , R. K. Maurya, “Programming through Python”, StarEdu Solutions.
3. E Balagurusamy, “Introduction to computing and problem -solving using python”, McGraw Hill
Publication.

References:

1. Zed A. Shaw, “Learn Python 3 the Hard Way”, Zed Shaw's Hard Way Series.
2. Martin C. Brown,” Python: The Complete Reference”, McGraw -Hill Publication.
3. Paul Barry,” Head First Python”, 2nd Edition, O'Reilly Media, Inc.

Online resources:
1) https://docs .scipy.org/doc/numpy/user/quickstart.html
2) https://matplotlib.org/tutorials/
3) https://pandas.pydata.org/docs/getting_started/
4) https://www.geeksforgeeks.org/python -build -a-rest-api-using -flask/

Term Work:
The Term work shall consist of at least 15 practical based on the above list. The term work Journal must
include at least 2 Programming assignments. The Programming assignments should be based on real world
applications which cover concepts from more than one modules of syllabus .

Term Work Marks: 25 Marks (Total marks) = 15 Marks (Experiment) + 5 Marks
(Assignments/tutorial/write up) + 5 Marks (Attendance)

Practical & Oral Exam: An Oral & Practical exam will be held based on the above syllabus.

Page 99

Course Code
Course
Name Teaching Scheme
(Contact Hours) Credits Assigned
Theory Practical Tutorial Theory Practical Tutorial Total
ITM4 01 Mini Project
– 1 B for
Python based
automation
projects -- 04 -- -- 02 -- 02


Course
Code
Course
Name Examination Scheme
Theory Marks
Term Work Pract. /Oral Total Internal assessment End
Sem.
Exam Test1 Test 2 Avg.
ITM4 01 Mini Project –
1 B for Python
based
automation
projects -- -- -- -- 25 25 50

Course 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 fundamental sto attempt solutions to the
problems.
4. To inculcate the process of self -learning and research.
Course 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 throug h theoretical / experimental/simulations .
5. Analyse 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 se lf-learning in a group, which leads to life long learning.
9. Demonstrate project management principles during project work.

Guidelines for Mini Project
 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.
 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.
 Students hall submit implementation plan in the form of Gantt/PERT/CPM chart, which will cover
weekly activity of mini project.
 A log book to be prepared by each group, wherein group can record weekly work progress,
guide/supervisor can verify and record notes/comments.
 Faculty supervisor may give inputs to students during mini project activity;however, focus shall be
on self -learning.
 Students in a group shall understand problem effectively, propose multiple solution and select best
possible solution in consultation with guide/ supervisor.

Page 100

 Students sh all convert the best solution into working model using various components of t heir
domain areas and demonstrate.
 The solution to be validated with proper justification and report to be compiled in standard format of
University of Mumbai .
 With the focus on the self -learning, innovation, addressing societal problems and entrepreneurs hip
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.
 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 seme ster, 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.
Guidelines for Assessment of Mini Project :
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 f ocus 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;
o Marks awarded by guide/supe rvisor based on log book : 10
o Marks awarded by review committee : 10
o 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:
 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 finalisation of problem
 Second shall be on finalisation of proposed solution of problem.
 In second semester expected work shall be procurement of component’s/systems, building of
working prototype, testing and validation of results based on work complete d 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:
 In this case in one semester students’ group shall complete project in all aspects including,
o Identification of need/problem
o Proposed final solution
o Procurement of components/systems
o Building prototype and testing
 Two reviews will be conducted for continuous assessment,
 First shall be for finalisation of problem and proposed solution
 Second shall be for implementation and testing of solution.

Page 101

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 effectivene ss 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:
 Report should be prepared as per the guidelines issued by the University of Mumbai.
 Mini Project sh all 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 organisations having experience of more than five years approved by head of Institution.
 Students sh all 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
2. Innovativeness in solutions
3. Cost effectiveness and Societal impact
4. Full functioning of working model as per stated requirements
5. Effective use of skill sets
6. Effective use of standard engineering norms
7. Contribution of an individual’s as member or leader
8. Clarity in written and oral communication