TE BE Comp Engg CBCGS Rev 2016 Syllabus Mumbai University


TE BE Comp Engg CBCGS Rev 2016 Syllabus Mumbai University by munotes

Page 1

Page 2



AC –
Item No.




UNIVERSITY OF MUMBAI










Revised syllabus (Rev - 2016) from Academic Year 2016 -17
Under
FACULTY OF TECHNOLOGY
Computer Engineering
Second Year with Effect from AY 2017 -18
Third Year with Effect from AY 2018 -19
Final Year with Effect from AY 2019 -20


As per Choice Based Credit and Grading System
with effect from the AY 2016–17

Page 3

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


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

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

Page 4

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

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

1. To prepare the Learner with a sound foundation in the mathematical, scientific and
engineering fundamentals .
2. To motivate the Learner in the art of self -learning and to use modern tools for solving real life problems.
3. To equip the Learner with broad education necessary to understand the impact of Computer Science and
Engineering in a global and social context.
4. To encourage, motivate and prepare the Learner‘s for Lifelong- learning .
5. To inculcate professional and ethical attitude, good leadership qualities and commitment to social
responsibilities in the Learner‘s thought process.
In addition to Program Educational Objectives, for each course of the program, objectives and expected
outcomes from a learner‘s point of view are also included in the curriculum to support the philosophy of
outcome based education. I strongly believe that even a small step taken in the right direction will definitely
help in providing quality education to the major stakeholders .

Dr. Subhash K. Shinde
Chairman , Board of Studies in Computer Engineering,
University of Mumbai , Mumbai.

Page 5

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 4
Program Structure B.E. Computer Engineering, (Rev. 2016) w.e.f. AY 2018 -19
T. E. Computer Engineering ( Semester -V)
Course
Code Course
Na me Teaching Scheme
(Contact Hours) Credits Assigned
Theory Pract Tut Theory TW/
Pract Tut Total
CSC501 Microprocessor 4 - - 4 - - 4
CSC502 Database Management
System 4 - - 4 - - 4
CSC503 Computer Network 4 - - 4 - - 4
CSC504 Theory of Computer
Science 3+1@ - - 4 - - 4
CSDLO
501X Department Level Optional
Course -I 4 - - 4 - - 4
CSL501 Microprocessor Lab - 2 - - 1 1
CSL502 Computer Network Lab - 2 - - 1 - 1
CSL503 Database & Info. System
Lab - 2 - - 1 - 1
CSL504 Web Design Lab
- 2+2* - - 2 - 2
CSL505 Business Comm . & Ethics - 2+2* - - 2 - 2
Total 20 14 - 20 7 - 27

@ 1 hour to be taken tutorial as class wise.
*2 hours shown as Practical‘s to be taken class wise and other 2 hours to be taken as batch wise

Course
Code Course
Name Examination Scheme
Theory
TW Oral
&
Pract Total Internal Assessment End
Sem.
Exam Exam
Duration
( in Hrs) Test 1 Test 2 Avg.
CSC501 Microprocessor 20 20 20 80 3 - - 100
CSC502 Database Management
System 20 20 20 80 3 - - 100
CSC503 Computer Network 20 20 20 80 3 - - 100
CSC504 Theory of Computer
Science 20 20 20 80 3 - - 100
CSDLO
501X Department Level Optional
Course -I 20 20 20 80 3 -- - 100
CSL501 Microprocessor Lab - - - - - 25 25 50
CSL502 Computer Network Lab - - - - - 25 25 50
CSL503 Database & Info. System
Lab - - - - - 25 25 50
CSL504 Web Design Lab - - - - - 25 25 50
CSL505 Business Comm. & Ethics - - - - - 50 - 50
Total 100 100 100 400 - 150 100 750

Page 6

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

Program Structure B.E. Computer Engineering, (Rev. 2016) w.e.f. AY 2018 -19
T. E. Computer Engineering ( Semester -VI)
Course
Code Course
Na me Teaching Scheme
(Contact Hours) Credits Assigned
Theory Pract Tut Theory TW/
Pract Tut Total
CSC601 Software Engineering 4 - - 4 - - 4
CSC602 System Programming &
Complier Construction 4 - - 4 - - 4
CSC603 Data Warehousing &
Mining 4 - - 4 - - 4
CSC604 Cryptography & System
Security 4 - - 4 - - 4
CSDLO
601X Department Level Optional
Course -II 4 - - 4 - - 4
CSL601 Software Engineering Lab - 2 - - 1 - 1
CSL602 System software Lab - 2 - - 1 - 1
CSL603 Data Warehousing &
Mining Lab - 2 - - 1 - 1
CSL604 System Security Lab - 2 - - 1 - 1
CSP605 Mini -Project - 4 - - 2 - 2
Total 20 12 - 20 6 - 26

Course
Code Course
Name Examination Scheme
Theory
TW Oral
&
Pract Total Internal Assessment End
Sem.
Exam Exam
Duration
( in Hrs) Oral
Test 1 Test 2 Avg.
CSC601 Software Engineering 20 20 20 80 3 - - - 100
CSC602 System Programming &
Complier Construction 20 20 20 80 3 - - - 100
CSC603 Data Warehousing &
Mining 20 20 20 80 3 - - - 100
CSC604 Cryptography & System
Security 20 20 20 80 3 - - - 100
CSDLO
601X Department Level Optional
Course -II 20 20 20 80 3 - - - 100
CSL601 Softwar e Engineering
Lab - - - - - 25 25 -- 50
CSL602 System S oftware Lab - - - - - 25 -- 25 50
CSL603 Data Warehousing &
Mining Lab - - - - - 25 -- 25 50
CSL604 System Security Lab - - - - - 25 --- 25 50
CSP605 Mini -Project - - - - - 25 --- 25 50
Total 100 100 100 400 - 125 25 100 750

Page 7

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

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

Page 8

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


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

Course
Code Course
Na me Teaching Scheme
(Contact Hours) Credits Assigned
Theory Pract Tut Theory TW/
Pract Tut Total
CSC801 Human Machine
Interaction 4 - - 4 - - 4
CSC802 Distributed Computing 4 - - 4 - - 4
CSDLO
801X Department Level Optional
Course -IV 4 - - 4 - - 4
ILO801X Institute Level Optional
Course -II 3 - - 3 - - 3
CSL801 Human Machine
Interaction Lab - 2 - - 1 1
CSL802 Distributed Computing
Lab 2 1 1
CSL80 3 Cloud Computing Lab - 4 - - 2 2
CSL804 Computational Lab -II - 2 - 1 1
CSP805 Major Project -II - 12 6 - 6
Total 15 22 - 15 11 - 26

Course
Code Course
Name Examination Scheme
Theory
TW Oral
&
Pract Total Internal Assessment End
Sem.
Exam Exam
Duratio
n ( in
Hrs) Oral
Test 1 Test 2 Avg.
CSC801 Human Machine
Interaction 20 20 20 80 3 - - - 100
CSC802 Distributed Computing 20 20 20 80 3 - - - 100
CSDLO
801X Department Level Optional
Course -IV 20 20 20 80 3 - - - 100
ILO801X Institute Level Optional
Course -II 20 20 20 80 3 - - - 100
CSC80 1 Human Machine
Interaction Lab 25
25

- 50
CSL80 2 Distributed Computing
Lab - - - - - 25 25 50
CSL80 3 Cloud Computing Lab
- - - - - 50 -- 25 75
CSL80 4 Computational Lab -II - - - - - 50 -- 25 75
CSP805 Major Project -II 50 -- 50 100
Total 80 80 80 320 -- 200 50 100 750

Page 9

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

Sem. Department Level Optional Course
(DLOC ) Institute Level Optional Course
(ILOC)
V
CSDLO5011: Multimedia System
CSDLO5012: Advance Operating System
CSDLO5013: Advance Algorithm
--------------------
VI CSDLO6021: Machine Learning
CSDLO6022: Advance Database System
CSDLO6023: Enterprise Resource Planning
CSDLO6024: Advance Computer Network
-------------------
VII CSDLO7031: Advance System Security &
Digital Forensics
CSDLO7032: Big Data & Analytics
CSDLO7033: Robotics
ILO7011. Product Lifecycle Management
ILO7012. Reliability Engineering
ILO7013. Management Information
System
ILO7014. Design of Experiments
ILO7015. Operation Research
ILO7016. Cyber Security and Laws
ILO7017. Disaster Management &
Mitigation Measures
ILO7018. Energy Audit and Management
ILO7019. Development Engineering
VIII DLO8011: High Performance Computing
DLO8012: Natural Language Processing
DLO8013: Adhoc Wireless Network
ILO8021. Project Management
ILO8022. Finance Management
ILO8023. Entrepreneurship Development
and Management
ILO8024. Human Resource Management
ILO8025. Professional Ethics and CSR
ILO8026. Research Methodology
ILO8027. IPR and Patenting
ILO8028. Digital Business Management
ILO8029. Environmental Management

Page 10

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 9
Course Cod e Course Name Credits
CSC501 Microprocessor 4

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

Course outcomes: On successful completion of course learner will be able to:
1. Describe architecture of x86 processors.
2. Interpret the instructions of 8086 and write assembly and Mixed language programs.
3. Explain the concept of interrupts
4. Identify the specifications of peripheral chip
5. Design 8086 based system using memory and peripheral chips
6. Appraise the architecture of advanced processors

Prerequisite: Digital Elect ronics and Logic Design

Module
No. Unit
No. Topics Hrs.
1.0 The Intel Microprocessors 8086/8088 Architecture 10
1.1  8086/8088 CPU Architecture, Programmer‘s Model
 Functional Pin Diagram
 Memory Segmentation
 Banking in 8086
 Demultiplexing of Address/Data bus
 Study of 8284 Clock Generator
 Study of 8288 Bus Controller
 Functioning of 8086 in Minimum mode and Maximum mode
 Timing diagrams for Read and Write operations in minimum and
maximum mode
2.0 Instruction Set and Programming 12
2.1  Addressing Modes
 Instruction set – Data Transfer Instructions, String Instructions,
Logical Instructions, Arithmetic Instructions, Transfer of Control
Instructions, Processor Control Instructions
 Assembler Directives and Assembly Language Programming,
Macr os, Procedures
 Mixed Language Programming with C Language and Assembly
Language.
 Programming based on DOS and BIOS Interrupts (INT 21H, INT
10H)
3.0 8086 Interrupts 6
3.1  Types of interrupts
 Interrupt Service Routine
 Interrupt Vector Table
 Servicing of Interrupts by 8086 microprocessor
 Programmable Interrupt Controller 8259 – Block Diagram,
Interfacing the 8259 in single and cascaded mode, Operating
modes, programs for 8259 using ICWs and OCWs

Page 11

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 10
4.0 Peripherals and their interfacing with 8086 12
4.1 Memory Interfacing - RAM and ROM
Decoding Techniques – Partial and Absolute
4.2 8255 -PPI – Block diagram, Functional PIN Diagram, CWR, operating
modes, interfacing with 8086.
4.3 8253 PIT - Block diagram, Functional PIN Diagram, CWR, operating
modes, interfacing with 8086.
4.4 8257 -DMAC – Block diagram, Functional PIN Diagram, Register
organization, DMA operations and transfer modes
5.0 Intel 80386DX Processor 6
5.1  Architecture of 80386 microprocessor
 80386 registers – General purpose Registers, EFLAGS and Control
registers
 Real mode, Protected mode, virtual 8086 mode
 80386 memory management in Protected Mode – Descriptors and
selectors, descriptor tables, the memory paging mechanism
6.0 Pentium Processor 6
6.1 Pentium Architecture
Superscalar Operation, Integer & Floating Point Pipeline Stages, Branch
Prediction Logic, Cache Organisation and MESI Model
Total 52

Assessment:

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

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


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

Reference Books:

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

Page 12

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 11
Course Code Course Name Credits
CSC502 Database Management System 4

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

Course outcomes: On successful completion of course learner will be able to:
1. Understand the fundamentals of a database systems
2. Design and draw ER and EER diagram for the real life problem.
3. Convert conceptual model to relational model and formulate relational algebra queries.
4. Design and querying database using SQL.
5. Analyze and app ly concepts of normalization to relational database design.
6. Understand the concept of transaction, concurrency and recovery.

Prerequisite:
Basic knowledge of Data structure.

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

Page 13

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

Assessment:

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

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

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

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

Page 14

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 13
Course Code Course Name Credits
CSC 503 Computer Network 4

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

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

Prerequisite: Digital Communication Fundamentals

Module
No. Unit
No. Topics Hrs.
1 Introduction to Networking 06
1.1 Introduction to computer network, network application, network
software and hardware components (Interconnection networking devices),
Network topology, protocol hierarchies, design issues for the layers,
connection oriented and connectionless services
1.2 Reference models: Layer details of OSI, TCP/IP models. Communication
between layer.
2 Physical Layer 06
2.1 Introduction to Communication System, digital Communication,
Electromagnetic Spectrum
2.2 Guided Transmission Media: Twisted pair, Coaxial, Fiber optics. Unguided
media (Wireless Transmission): Radio Waves, Microwave, Bluetooth,
Infrared, Circuit and Packet Switching

Page 15

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 14
3 Data Link Layer 10
3.1 DLL Design Issues (Services, Framing, Error Control, Flow Control), Error
Detection and Correction(Hamming Code, CRC, Checksum) , Elementary
Data Link protocols , Stop and Wait, Sliding Window(Go Back N, Selective
Repeat), HDLC
3.2 Medium Access Control sublayer
Channel Allocation problem, Multiple access Protocol( Aloha, Carrier Sense
Multiple Access (CSMA/CD), Local Area Networks - Ethernet (802.3)
4 Network layer 14
4.1 4.1 Network Layer design issues, Communication Primitives: Unicast,
Multicast, Broadcast. IPv4 Addressing (classfull and classless), Subnetting,
Supernetting design problems ,IPv4 Protocol, Network Address Translation
(NAT)
4.2 Routing algorithms : Shortest Path (Dijkastra‘s), Link state routing, Distance
Vector Routing
4.3 Protocols - ARP,RARP, ICMP, IGMP
4.4 Congestion control algorithms: Open loop congestion control, Closed loop
congestion control, QoS parameters, Token & Leaky bucket algorithms
5 Transport Layer 10
5.1 The Transport Service : Transport service primitives, Berkeley Sockets,
Connection management (Handshake), UDP, TCP, TCP state transition, TCP
timers
5.2 TCP Flow control (sliding Window), TCP Congestion Control: Slow Start
6 Application Layer 06
6.1 DNS: Name Space, Resource Record and Types of Name Server. HTTP,
SMTP, Telnet, FTP, DHCP

Assessment:

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

Page 16

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



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

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

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
























Page 17

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

Course Code Course Name Credits
CSC504 Theory of Computer Science 4

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

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

Prerequisite: Discrete Mathematics

Module
No. Unit
No. Topics Theory
Hrs. Tutorial
Hrs.
1.0 Basic Concepts and Finite Automata 09 03
1.1  Alphabets, Strings, Languages, Closure properties.
 Finite Automata (FA) and Finite State machine (FSM).
1.2  Deterministic Finite Automata (DFA) and Nondeterministic
Finite Automata (NFA): Definitions, transition diagrams and
Language recognizers
 NFA to DFA Conversion
 Equivalence between NFA with and without ε - transitions
 Minimization of DFA
 FSM with output: Moore and Mealy machines, Equivalence
 Applications and limitations of FA
2.0 Regular Expressions and Languages 06

02
2.1  Regular Expression (RE)
 Equivalence of RE and FA, Arden‘s Theorem
 RE Applications
2.2  Regular Language (RL)
 Closure properties of RLs
 Decision properties of RLs
 Pumping lemma for RLs
3.0 Grammars 08 03
3.1  Grammars and Chomsky hierarchy
3.2  Regular Grammar (RG)

Page 18

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


Assessment:

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

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

Page 19

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

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
































Page 20

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 19
Course Code Course Name Credits
CSDLO5011 Multimedia System 4

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

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

Prerequisite: Computer Fundaments and Graphics.

Module
No. Unit
No. Topics Hrs.
1 Introduction to Multimedia 8
1.1 Overview
1.2 Objects and Elements of Multimedia
1.3 Applications of Multimedia
1.4 Multimedia Systems Architecture – IMA, Workstation, Network
1.5 Types of Medium (Perception, Representation -..)
1.6 Interaction Techniques
1.7 I/O devices - Salient features (Electronic Pen , Scanner, Digital Camera,
Printers, plotters), Storage Media (Jukebox, DVD), Multimedia Databases
2 Text & Digital Image 10
Text
2.1 Visual Representation, Digital Representation.
2.2 File Formats: RTF, TIFF.
2.3 Compression Techniques : Huffman Coding, RLE, CCITT group 3 1D

Page 21

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 20
Digital Image
2.4 Digital Image Representation (2D format, resolution) Types of Images
(monochrome, gray, color), examples of images (X -Ray, fractal, synthetic,
acoustic).
2.5 File formats: BMP, JPG
2.6 Compression Techniques: fundamentals (coding, interpixel and psychovisual
redundancies),Types – lossless and lossy, Lossless Compression
Algorithms – Shannon -Fano, CCITT group 4 2D , Lossy Compression
Algorithm – JPEG
3 Digital Audio 8
3.1 Basic Sound Concepts: computer representation of sound,
3.2 File Formats – WAV, MPEG Audio
3.3 Compression: PCM, DM, DPCM
4 Digital Video 8
4.1 Digitization of Video, types of video signals ( component, composite and S -
video),
4.2 File Formats: MPEG Video, H.261
4.3 Compression: MPEG
5 Multimedia Network Communication and Representation 10
5.1 Quality of Service
5.2 Multimedia over IP ( RTP, RTSP, RTCP,RSVP)
5.3 Representation - Authoring systems and user interface
6 Multimedia Security 8
6.1 Requirements and properties
6.2 Mechanisms – Digital Signatures, Steganographic methods
6.3 Sample applications – unidirectional distributed systems, information
systems and conference systems
Total 52




Page 22

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

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

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

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

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

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

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




















Page 23

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

Course Code Course Name Credits

CSDLO5012 Advanced Operating Systems 4


Course Objectives:
1. To understand design issues of Advanced Operating systems.
2. To understand the architecture, kernel and file management of Unix operating system.
3. To understand basic concepts and need of Distributed operating systems.
4. To understand concepts and working of different advanced Operating systems like
Multiprocessor OS, Real time OS, Mobi le OS.

Course Outcomes: On successful completion of the course student should be able to
1. Demonstrate understanding of design issues of Advanced operating systems and compare
different types of operating systems.
2. Analyse design aspects and data structures used for file subsystem, memory subsystem and
process subsystem of Unix OS.
3. Demonstrate understanding of different architectures used in Multiprocessor OS and analyse the
design and data structures used in Multiprocessor operating systems.
4. Differentiate b etween threads and processes and compare different processor scheduling
algorithms used in Multiprocessor OS
5. Classify Real Time OS and analyse various real time scheduling algorithms.
6. Explore architectures and design issues of Mobile OS,Virtual OS, Cloud OS.

Prerequisite: Operating Systems
Module Unit Detailed Content Hrs
1 Introduction 04
Functions of operating systems, Design approaches: layered,
kernel based and virtual machine approach, types of advanced
operating systems (NOS, DOS, Multiprocessor OS, Mobile OS,
RTOS, Cloud OS)
2 Unix Kernel and File Management 14
2.1 System Structure, User Perspective, Architecture of Unix Operating
System
2.2 Buffer cache: Header, Buffer Pool, Retrieving, Reading and Writing
Buffer
2.3 File Representation: inodes: Structure of file Directories, Path
conversion to inode, superblock, inode assignment, allocation of
disk blocks
3 Unix Process and Memory management 12
3.1 Detailed design of Process Structure: Kernel Data structures for
process, Structure of Uarea and Process table, Process states and
Transitions
3.2 Context of a Process: Static and Dynamic area of context, Saving
the Context Layout of System Memory, Regions, Mapping regions

Page 24

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 23
with Process, page table and mapping v irtual address to physical
address.
4 Distributed Operating system concepts 06
Goals, Distributed Computing Models, Hardware Concepts,
Software Concepts, Architecture of DOS.
Design Issues: Transparency, Flexibility, Scalability, Reliability,
Performance, fault tolerance
5 Multiprocessor Operating System 08
5.1 Introduction, Basic multiprocessor system architectures, design
issues, Threads, Process synchronization: the test and set
instruction, the swap instruction, implementation of the process
wait
5.2 Processor scheduling: Issues, Co -scheduling, Smart scheduling,
Affinity Based scheduling
6 Real Time Operating Systems and Mobile OS 08
6.1 Characteristics of Real Time operating Systems, Classification
of Real Time Operating Systems, Scheduling in RTOS: Clock
driven: cyclic, Event driven: EDF and rate monotonic scheduling.
6.2 Mobile OS: Architecture, Android OS, iOS, Virtual OS,
Cloud OS and their design issues

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

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

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

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




Page 25

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 24
Course Code Course Name Credit
CSDLO5013 Advanced Algorithm 4

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

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

Prerequisites: Data structures, Discrete mathematics and Analysis of Algorithm



Hours Detailed Content Module Sr.
No.
08 Introduction -
Complexity -complexity of recursive algorithms, finding
complexity by tree method, master method, proving
technique (contradiction, mathematical induction).
Amortized analysis - aggregate analysis, accounting
analysis, potential analysis dynamic tables
Fundamental
of Algorithms 1
08 The hiring problem Indicator random variables
Randomized algorithms Probabilistic analysis and further
uses of indicator random variable Probabilistic
Analysis and
Randomized
Algorithm 2
12 Introduction to trees and heap
Red-Black Trees: properties of red -black trees ,
Operations on Red -black trees
Binomial Heaps: Binomial trees and binomial heaps,
Operation on Binomial heaps
Analysis of all above operations Advanced Data
Structure 3
08 Flow networks , the ford Fulkerson method ,max bipartite
matching , push Relabel Algorithm , The relabel to front
algorithm Maximum
Flow 4

Page 26

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 25
08 Line Segment properties, Determining whether any pair of
segment intersects, finding the convex hull, Finding the
closest pair of points.
Computational
Geometry 5
08 NP-Completeness: NP -Completeness and reducibility, NP -
Completeness proofs, NP -Complete problems -The vertex -
cover problem, The travelling salesman problem NP-
Completeness
And
Approximation
Algorithms 6

Text Books:
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, ―Introduction
to Algorithms‖, PHI, India Second Edition.
2. Horowitz, Sahani and Rajsekaran, ―Fundamentals of Computer Algorithms‖, Galgotia.
3. Harsh Bhasin, ―Algorithms – Design and Analysis‖, Oxford, 2015.

Reference Books:
1. Rajeev Motwani, Prabhakar Raghavan, ― Randomized Algorithm‖, Cambridge University
2. S. K. Basu, ―Design Methods and Analysis of Algorithm‖, PHI
3. Vijay V. Vajirani, ―Approximation Algorithms‖,Springer.

Internal Assessment:
Assessment consists of two tests out of which; one (T1) should be compulsory class test (on at least 02
Modules) and the other (T2) is either a class test or assignments on live problems or course project
Theory Examination:
1. Question paper will comprise of total six questions.
2. All question carry equal marks
3. Questions will be mixed in nature (for example supposed Q.2 has part (a) from module 3 then part
(b) will be from any module other than module 3)
4. Only Four q uestion need to be solved.

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







Page 27

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



Lab Code Lab Name Credits
CSL501 Microprocessor Lab 1

Lab Objective:
1. To emphasize on use of Assembly language program.
2. To prepare students for advanced subjects like embedded system and IOT.
Lab Outcome:
1. Use appropriate instructions to program microprocessor to perform various task
2. Develop the program in assembly/ mixed language for Intel 8086 processor
3. Demonstrate the execution and debugging of assembly/ mixed language program

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

Suggested List of Experiments:
Sr. No. Title of Experiments
1 Use of programming tools (Debug/TASM/MASM/8086kit) to perform basic
arithmetic operations on 8bit/16 bit data
2 Code conversion (Hex to BCD, BCD to Hex, ASCII to BCD, BCD to ASCII)
3 Assembly programming for 16 -bit addition, subtraction, multiplication and division
(menu based)
4 Assembly program based on string instructions ( overlapping/ non-overlapping block
transfer/ string search/ string length)
5 Assembly program to display the contents of the flag register.
6 Mixed Language program to shift a number for given number of times
7 Assembly program to find the GCD/ LCM of two numbers
8 Assembly program to sort numbers in ascending/ descending order

Page 28

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 27
9 Mixed Language program to increment, decrement the size of the cursor and also to
disable it.
10 Assembly program to find minimum/ maximum no. from a given array.
11 Program for device driver (printer/mouse/keyboard)
12 Program based on 32 bit architecture (e.g. Switching from real mode to protected
mode using DPMI driver, 32bit multiplication)
13 Assembly program to find factorial of number using procedure
14 Program and interfacing using 8255/ 8253
15 Program and interfacing of ADC/ DAC/ Stepper motor

Term Work:
Term should consist of at least 10 experiments.
Journal must include –
 At least one experiment with use of macros/ procedures
 At least five experiments with use of DOS, BIOS interrupts
 At least two assignments

At least one experiment on hardware interfacing is desirable
The final certification and acceptance of term work ensures satisfactory performance of laboratory work and
minimum marks in term work.
Term Work : 25 ma rks (Total) = 15 Marks (Experiments) + 5 Marks (Assignments) + 5 Marks (Theory +
Practical Attendance)
Oral & Practical exam will be based on the CSL501and CSC501 syllabus.


















Page 29

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


Lab Code Lab Name Credits
CSL 502 Computer Network Lab 1

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

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

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

Suggested List o f Experiments

Sr. No Title of Experiments
1. Setup a network and configure IP addressing, subnetting, masking. (Eg. CISCO Packet
Tracer, Student Ed.)
2. Use basic networking commands in Linux (ping, tracert, nslookup, netstat, ARP, RARP, ip,
ifconfig, dig, route )
3. Build a simple network topology and configure it for static routing protocol using packet
tracer.
4. Perform network discovery using discovery tools (eg. mrtg)
5. Use Wireshark to understand the operation of TCP/IP layers :
● Ethernet Layer : Frame header, Frame size etc.
● Data Link Layer : MAC address, ARP (IP and MAC address binding)
● Network Layer : IP Packet (header, fragmentation), ICMP (Query and Echo)
● Transport Layer: TCP Ports, TCP handshake segments etc.
● Application Layer: DHCP, FTP, HTTP header formats
6. CRC/ Hamming code implementation.
7. Stop and wait protocol/ sliding window (selective repeat / Go back N )
8. Use simulator (Eg. NS2) to understand functioning of ALOHA, CSMA/CD.
9. a. Set up multiple IP addresses on a single LAN.
b. Using nestat and route commands of Linux, do the following:

Page 30

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 29
● View current routing table
● Add and delete routes
● Change default gateway
c. Perform packet filtering by enabling IP forwarding using IPtables in Linux.
10. Implementation of DVR/ LSR in NS2/(any other simulator)
11. Socket programming using TCP or UDP
12. Simulate congestion control ( leaky bucket / token bucket).
13. Perform File Transfer and Access using FTP
14. Perform Remote login using Telnet server

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


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



















Page 31

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 30
Lab Code Lab Name Credits
CSL503 Database & Information System Lab 1

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

Description:
 The below suggested experiments needs to be performed by a group of 3/4 students.
 Select any database management system and conduct all experim ents based on the same topic.
Suggested List of Experiments:
Sr. No. Title of Experiments
1 Identify the case study and detail statement of problem.
Design an Entity -Relationship (ER) / Extended Entity -Relationship (EER) Model .
2 Mapping ER/EER to Relational schema model.
3 Create and populate database using Data Definition Language (DDL) and DML
Commands for you‘re the specified System .
4 Apply Integrity Constraints for the specified system.
5 Perform Simple queries, string manipulation operations.
6 Nested queries and Complex queries
7 Perform Join operations
8 Views and Triggers
9 Functions , cursor and procedure.
10 Transaction and Concurrency control
11 Mini project - Creating a Two -tier client -server database applications using JDBC

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

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



Page 32

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 31
Practical and Oral :

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

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

**Oral & Practical exam will be based on the above and CSC502: ‗DBMS‘ syllabus
Text Books:
1. G. K. Gupta :‖Database Management Systems‖, McGraw – Hill.
2. Korth, Slberchatz,Sudarshan, :‖Database System Concepts‖, 6th Edition, McGraw – Hill
3. Elmasri and Navathe, ― Fundamentals of Database Systems‖, 5thEdition, PEARSON
4. Peter Rob and Carlos Coronel, ― Database Systems Design, Implementation and Management‖, Thoms on
Learning, 5th Edition.

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





















Page 33

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 32
Course Code Course Name Credits
CSL504 Web Design Lab 2

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

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

Prerequisite: Data Structures, Basics of Programming Languages

Module
No. Unit
No. Topics Hrs.


1.0 INTRODUCTION TO WWW


2 1.1 Internet Standards – Introduction to WWW – WWW Architecture –
SMTP – POP3 – File Transfer Protocol
1.2 Overview of HTTP, HTTP request – response –– Generation of dynamic
web pages - W3C Validator, How web works - Setting up the
environment (LAMP/XAMP/WAMP server)





2.0 CLIENT SIDE PROGRAMMING





6
2.1 Markup Language (HTML): Introduction to HTML and HTML5 -
Formatting and Fonts –Commenting Code – Anchors – Backgrounds –
Images – Hyperlinks
2.2 Lists – Tables – Frames - HTML Forms and controls.
2.3 Cascading Style Sheet (CSS): The need for CSS, Introduction to CSS 3
– Basic syntax and structure ,CSS Properties -Inline Styles – Embedding
Style Sheets
2.4 Linking External Style Sheets – Backgrounds –Box Model( Introduction ,
Border Properties, Padding Properties, Margin Properties), Manipulating
text - Margins and Padding - Positioning using CSS., Creating page
Layout and Site Designs



3.0 INTRODUCTION TO JAVASCRIPT
6 3.1 Introduction - Core features - Data types and Variables - Operators,
Expressions, and Statements, Functions - Objects - Array, Date and Math
related Objects
3.2 Document Object Model - Event Handling Controlling Windows &

Page 34

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 33
Frames and Documents Form handling and validations.
3.3 Advanced JavaScript - Browser Management and Media Management –
Classes – Constructors – Object -Oriented Techniques in JavaScript
3.4 Object constructor and Prototyping - Sub classes and Super classes –
JSON - jQuery and AJAX., Rich Internet Application with A JAX, JQuery
Framework




4.0 SERVER SIDE PROGRAMMING




8 4.1 Introduction - Programming basics - Print/echo - Variables and constants
– Strings and Arrays
4.2 Operators, Control structures and looping structures – Functions –
Reading Data in Web Pages
4.3 Embedding PHP within HTML - Establishing connectivity with MySQL
database, cookies, sessions and Authentication
4.4 AJAX with PHP - AJAX with Databases



5.0 XML



4 5.1 Dynamic page generation (adding interactivity, styles, using HTML,
DHTML, XHTML, CSS, Java Script), XML –DTD(Document Type
Definition) - XML Schema
5.2 XML –DTD(Document Type Definition) - XML Schema - Document
Object Model - Presenting XML - Using XML
Parsers: DOM and SAX, XSL -eXtensible Style sheet Language
6.0 WEB DEVELOPMENT FRAMEWORK 2
6.1 Introduction to Composer - MVC Architecture
6.2 Web Application Development using web development framework
:-Introduction to Laravel, Development of Web pages using Laravel.,
Example web applications – Interactive websites, web based information
systems , blogs, social networking sites etc.
Total 28


Text Books:

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

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

Page 35

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 34
4. David Flanagan, ―JavaScript: The Definitive Guide, Sixth Edition‖, O'Reilly Media, 2011
5. Steven Holzner, ―The Complete Reference - PHP‖, Tata McGraw Hill, 2008
6. Mike Mcgrath, ―PHP & MySQL in easy Steps‖, Tata McGraw Hill, 2012.

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

Term work Assessment:
Term work will consist of lab experiments testing all the technologies included in syllabus and a Mini
projec t solving an appropriate problem using the above technology.
Module Detailed Contents Lab
Sessions
1 Installation and Setting of LAMP / WAMP / XAMP 1
2 Create Simple web page using HTML5 1
3 Design and Implement web page using CSS3 and HTML5 1
4 Form Design and Client Side Validation using :
a. Javascript and HTML5
b. Javascript and JQuery 2
5 Develop simple web page using PHP 1
6 Develop interactive web pages using PHP with database connectivity MYSQL 2
7 Develop XML web page using DTD, XSL 1
8 Implement a webpage using Ajax and PHP 1
9 Hosting the website with Domain Registration Process. 1
10 Design a Web application using Laravel Framework 3

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

Term Work: The distribution of marks for term work shall be as follows:
 Lab Assignments : 10 Marks
 Mini Project : 10 Marks
 Attendance : 05 Marks
Practical & Oral Examination:
Practical & Oral examination is to be conducted by pair of inte rnal and external examiners based on the
above syllabus.

Page 36

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 35
Course Code Course Name Credits
CSL505 Business Communication & Ethics 02

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

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

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

Page 37

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 36
06 Employment Skills 07
6.1 Group Discussion
6.2 Resume Writing
6.3 Interview Skills
6.4 Presentation Skills
6.5 Statement of Purpose
28

Assessment:
List of Assignments
1. Report Writing (Theory)
2. Technical Proposal
3. Technical Paper Writing (Paraphrasing a published IEEE Technical Paper)
4. Interpersonal Skills (Group activities and Role plays)
5. Interpersonal Skills (Documentation in the form of soft copy or hard copy)
6. Meetings and Documentation(Notice, Agenda, Minutes of Mock Meetings)
7. Corporate ethics (Case studies, Role plays)
8. Writing Resume and Statement of Purpose
Term Work
Term work shall consist of all assignments from the list. The distribution of marks for term work shall
be as follows:

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

Page 38

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

Course Code Course Name Credits
CSC601 Software Engineering 4


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

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

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

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

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

Page 39

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


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

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

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

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

Page 40

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


Credits Course Name Course Code
4 System Programming And Compiler Construction CSC602

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

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

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

Hrs. Topics Unit No. Module
No.
2 Concept of System Software, Goals of system softwares, system
program and system programming,
Introduction to various system programs such as Assembler, Macro
processor, Loader, Linker, Compiler, Interpreter, Device Drivers,
Operating system, Editors, Debuggers. Introduction to
System Software 1
10 Elements of Assembly Language programming, Assembly scheme,
pass structure of assembler,
Assembler Design: Two pass assembler Design and single pass
Assembler Design for Hypothetical / X86 family processor, data
structures used. Assemblers 2
8 Introduction, Macro definition and call, Features of Macro
facility: Simple, parameterized, conditional and nested. Design of
single pass macro processor, data structures used. Macros and
Macro Processor 3
8 Introduction, functions of loaders, Relocation and Linking concept,
Different loading schemes: Relocating loader, Direct Linking
Loader, Dynamic linking and loading. Loaders and
Linkers 4

Page 41

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 40
12 Introduction to compilers, Phases of compilers:
Lexical Analysis - Role of Finite State Automata in Lexical
Analysis, Design of Lexical analyser, data structures used .
Syntax Analysis - Role of Context Free Grammar in Syntax
analy sis, Types of Parsers: Top down parser - LL(1), Bottom up
parser - Operator precedence parser, SLR
Semantic Analysis, Syntax directed definitions. Compilers:
Analysis Phase 5
12 Intermediate Code Generation: Types of Intermediate codes:
Syntax tree, Postfix notation, Three address codes: Triples and
Quadruples.
Code Optimization: Need and sources of optimization, Code
optimization techniques: Machine Dependent and Machine
Independent.
Code Generation: Issues in the design of code generator, code
gener ation algorithm. Basic block and flow graph. Compilers:
Synthesis phase 6

Text Books:

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

Reference Books:

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

Assessment:

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

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



Page 42

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

Course Code Course Name Credits
CSC603 Data Warehousing and Mining 4

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

Course outcomes: On successful completion of course learner will be able to:
1. Understand Data Warehouse fundamentals, Data Mining Principles
2. Design data warehouse with dimensional modelling and apply OLAP operations.
3. Identify appropriate data mining algorithms to solve real world problems
4. Compare and evaluate different data mining techniques like classification, prediction, clustering
and asso ciation rule mining
5. Describe complex data types with respect to spatial and web mining.
6. Benefit the user experiences towards research and innovation.

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

Page 43

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

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

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

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

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

Page 44

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

Credits Course Name Course Code
4 Cryptography and System Security CSC604

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

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

Detailed Syllabus:
Hrs Detailed Content Unit No Module
No
10 Introduction & Number Theory
1 Security Goals, Services, Mechanisms and attacks, The OSI security
architecture, Network security model, Classical Encryption
techniques, Symmetric cipher model, mono -alphabetic and poly-
alphabetic substitution techniques: Vigenere cipher, playfair cipher,
Hill cipher, transposition techniques: keyed and keyless transposition
ciphers, steganography. 1.1
Modular Arithmetic and Number Theory: - Euclid‘s algorithm -–Prime
numbers -Fermat‘s and Euler‘s theorem - Testing for primality -The
Chinese remainder theorem, Discrete logarithms. 1.2
12 Symmetric and Asymmetric key Cryptography and key Management 2

Page 45

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 44
Block cipher principles, block cipher modes of operation, DES,
Double DES, Triple DES, Advanced Encryption Standard (AES),
Stream Ciphers: RC5 algorithm. 2.1
Public key cryptography: Principles of public key cryptosystems -The
RSA algorithm, The knapsack algorithm, ElGamal Algorithm. 2.2
Key management techniques : using symmetric and asymmetric
algorithms and trusted third party. Diffie Hellman Key exchange
algorithm. 2.3
06 Hashes, Message Digests and Digital Certificates

3 Cryptographic hash functions, Properties of secure hash function,
MD5, SHA -1, MAC, HMAC, CMAC. 3.1
Digital Certificate: X.509, PKI 3.2
08 Authentication Protocols & Digital signature schemes

4 User Authentication and Entity Authentication, One -way and mutual
authentication schemes, Needham Schroeder Authentication
protocol, Kerberos Authentication protocol. 4.1
Digital Signature Schemes – RSA, EIGamal and Schnorr signature
schemes. 4.2
10 Network Security and Applications

5 Network security basics: TCP/IP vulnerabilities (Layer wise), Packet
Sniffing, ARP spoofing, port scanning, IP spoofing, TCP syn flood,
DNS Spoofing. 5.1
Denial of Service: Classic DOS attacks, Source Address spoofing,
ICMP flood, SYN flood, UDP flood, Distributed Denial of Service,
Defenses against Denial of Service Attacks. 5.2
Internet Security Protocols: SSL, IPSEC, Secure Email: PGP,
Firewalls, IDS and types, Honey pots 5.3
06 System Security

6
Software Vulnerabilities: Buffer Overflow, Format string, cross -site
scripting, SQL injection, Malware: Viruses, Worms, Trojans, Logic
Bomb, Bots, Rootkits. 6.1

Text Books:
1. William Stallings, Cryptography and Network Security, Principles and Practice, 6th Edition, Pearson
Education, March 2013
2. Behrouz A. Ferouzan, ―Cryptography & Network Security‖, Tata Mc Graw Hill
3. Bernard Menezes, ―Cryptography & Network Security‖, Cengage Learning.
4. Network Security Bible, Eric Cole, Second Edition, Wile y.

Page 46

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


Reference Books:
1. Applied Cryptography, Protocols Algorithms and Source Code in C, Bruce Schneier, Wiley.
2. Cryptography and Network Security, Atul Kahate, Tata Mc Graw Hill.

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

Theory Examination:
1. Question paper will comprise of total six q uestions.
2. All question carry equal marks
3. Questions will be mixed in nature (for example supposed Q.2 has part (a) from module 3 then part
(b) will be from any module other than module 3)
4. Only Four question need to be solved.

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


















Page 47

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

Course Code Course Name Credits
CSDLO6021 Machine Learning 04

Course Objectives:
1 To introduce students to the basic concepts and techniques of Machine Learning.
2 To become familiar with regression methods, classification methods, clustering methods.
3 To become familiar with Dimensionality reduction Techniques.

Course Outcomes: Students will be able to -

1. Gain knowledge about basic concepts of Machine Learning
2. Identify machine learning techniques suitable for a given problem
3. Solve the problems using various machine learning techniques
4. Apply Dimensionality reduction techniques.
5. Design application using machine learning techniques

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

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


4 Learning with Regression and trees:
Learning with Regression : Linear Regression, Logistic Regression.
Learning with Trees : Decision Trees, Constructing Decision Trees using
Gini Index, Classification and Regression Trees (CART). 10
5 Learning with Classification and clustering:
14 5.1 Classification: Rule based classification, classification by Bayesian Belief
networks, Hidden Markov Models.
Support Vector Machine : Maximum Margin Linear Separators, Quadratic
Programming solution to finding maximum margin separators, Kernels for
learning non -linear functions.
5.2 Clustering: Expectation Maximization Algorithm, Supervised learning

Page 48

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 47
after clustering, Radial Basis functions.
6 Dimensionality Reduction:
Dimensionality Reduction Techniques, Principal Component Analysis,
Independent Component Analysis, Single value decomposition 8
Total 52

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

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

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

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

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

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

Page 49

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 48
Course Code Course Name Credits
CSDLO6022 Advanced Database Management System 4

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

Course outcomes: On su ccessful completion of course learner will be able to:
1. Build indexing mechanisms for efficient retrieval of information from databases.
2. Measure query cost and optimize query execution
3. Design distributed database for better resource management
4. Demonstrate the understanding of the concepts of document oriented databases.
5. Apply appropriate security techniques database systems.
6. Implement advanced data models for real life applications.

Prerequisite: Basic knowledge of Database management System.
Module
No. Unit
No. Topics Hrs.
1.0 Indexing and Hashing Techniques 8
1.1 Indexing and Hashing:
● Operation on Files
● Hashing Techniques; Static and dynamic
● Types of Single -Level Ordered Indexes; Multilevel
Indexes; Dynamic Multilevel Indexes Using B -Trees
and B+ -Trees; Indexes on Multiple Keys,
2.0 Query processing and Optimization 12
Query Processing :
● Overview
● Measures of Query cost
● Selection operation
● Sorting
● Join Operations, and other Operations
Evaluation of Expression
Query Optimization :
● Translations of SQL Queries into relational algebra
● Heuristic approach & cost based optimization

Page 50

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 49
3.0 Distributed Databases 12
3.1 ● Types of Distributed Database Systems; Distributed
Database Architectures; Data Fragmentation,
Replication and Allocation Techniques for
Distributed Database Design
3.2 ● Distributed Query Processing (Semi join)
● distributed Transaction Management in Distributed
Databases
● distributed Concurrency Control (locking) , Recovery
in Distributed Databases {2PC/3PC) and deadlock
management.
4 Document oriented database

● Need of object oriented database.
● Impedance matching problem between OO languages
and Relational database, Case study db4O
● Need of Document Oriented database, difference
between Document Oriented Database and
Traditional database. Types of encoding XML, JSON,
BSON, Representation XML, Jso n Objects. Case
study on doc oriented based such a Mariadb 8
5 Advanced data models 6
5.1  Temporal data models : - Aspects of valid time , Bi -
temporal time and bi -temporal time with examples of
each.
 Spatial model : - Types of spatial data models -
Raster, Vector and Image
 Mobile databases
5.2  Multimedia databases
6 Data Security 6
6.1 ● Introduction to Database Security Issues;
authorization , Discretionary Access Control Based
on Granting and Revoking Privileges
● Mandatory Access Control and Role -Based

Page 51

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 50
6.2 Access Control for Multilevel Security
● SQL Injection
● Introduction to Statistical Database Security
Introduction to Flow Control
Total 52

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

Reference Books:
1. Chhanda Ray , ―Distributed Database System‖, Pearson Education India.
2. Hector Garcia -Molina, Jeffery D. Ullman, Jennifer Widom , ― Database system Implementation‖
3. Thomas M.Connolly Carolyn Begg, Database Systems : A practical Approach to Design ,
Implementation and Management, 4/e.

Suggested mini. Project / Experiment work:
1. Given problem statement 2/3 student to perform -
a. Design EER model and perform sorting, join operations for the specified problem
statement.
b. Perform the various fragmentation (Horizontal, Vertical, Derived) and check its
correctness criteria.
c. Perform two phase commit protocol (2PC)
2. Mini Project / Case study on document oriented database such a Mariadb
3. Mini Project Case study Development of an application based on any one advance data model
(temporal, Spatial Multimedia )

** Perform Laboratory (Experiments) work in the in CSM605:Mini -Project

Assessment:

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

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




Page 52

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

Course Code Course Name Credits
CSDLO6023 Enterprise Resource Planning(ERP) 4


Course Objectives:
1. To understand the technical aspects and life cycle of ERP systems.
2. To understand the steps and activities in ERP.
3. To identify and describe different types of ERP system.
4. To understand tools and methodology used for designing ERP for an Enterprise.

Course Outcomes: After completion of this course, students will be able ..
1. To understand the basic structure of ERP.
2. To identify implementation strategy used for ERP.
3. To apply design principles for various business modules in ERP.
4. To apply different emerging technologies for implementation of ERP.
5. To analyze security issues in ERP.
6. To acquire ERP concepts for real world applications.

Pre-requisites: Web Engineering, Computer Network, Database Systems

Module
No. Unit
No. Topics
Hrs.
1.0
Introduction to Enterprise Resource Planning (ERP )
Information System and Its Components, Value Chain Framework,
Organizational Functional Units, Evolution of ERP Systems, Role of
ERP in Organization, Three -Tier Architecture of ERP system. 8
2.0

ERP and Implementation
ERP implementation and strategy, Implementation Life cycle, Pre -
implementation task, requirement definition, implementation
Methodology. 8
3.0

ERP Business Modules
8 3.1 Finance, manufacturing, human resources, quality management,
material management, marketing, Sales distribution and service.
3.2 Case study on Supply Chain management (SCM), Customer
relationship Management (CRM)
4.0 Introduction to ERP related Technologies
10 4.1 Business Process Re -engineering (BPR) ,Data warehousing ,Data
Mining, On - line Analytical Processing(OLAP), Product Life Cycle
Management (PLM)
4.2 Geographical Information Management ,RFID, QR Code ,Bar

Page 53

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 52
Coding, E -commerce and their application in Enterprise planning
5.0 Extended ERP and security issues
8 5.1 Enterprise application Integration (EAI), open source ERP, cloud ERP
5.2 Managing ERP Securities: Types of ERP security Issues, System
Access security, Data Security and related technology for managing
data security
6.0 Cases of ERP for Enterprises.
10 6.1 Cases of ERP like MySAP for Business suite implementation at ITC,
ERP for Nestle GLOBE Project, Oracle ERP Implementation at
Maruti Suzuki.
6.2 Need of ERP for Small and Medium size enterprises.(Zaveri)
Total 52


Text Books:

1. Alexis Leon, ERP Demystified: II Edition, Tata McGraw Hill.
2. Rajesh Ray, Enterprise Resource Planning, Text and cases, Tata McGraw Hill.
3. Sandeep Desai, Abhishek Srivastava, ERP to E2 ERP: A Case study approach, PHI.
4. Jyotindra Zaveri, Enterprise Resource Planning, Himalaya Publishing House, 2012.

Reference Books:

1. V.K. Garg & N.K. Venkatakrishnan, Enterprise Resource Planning: concepts & practices, by ; PHI.
2. Supply Chain Management Theories & Practices: R. P. Mohanty, S. G. Deshmukh, - Dreamtech
Press.
3. Enterprise wide resource planning: Theory & practice: by Rahul Altekar, PHI
4. Customer Relationship Management, Concepts and cases, Second Edition.

Mini Project / Laboratory Work:

1. Give case study 2/3 student of any organization. Make a report befor e-after situation at organization
(Domain).
2. Make a list of Resource of the Selected Domain.
3. Categorized the Resource as per the function level process and Identify module of the domain.
4. Explain process of each module of the domain.
5. Perform Business process re-engineering (BPR) on selected Module.
6. Implement new system based on BPR.
7. Perform Impact analysis of the new system as the BPR.
a. Prepare study on JD Edward Tool.

Page 54

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 53
b. Prepare study on Microsoft Dynamics.
8. Download any open source ERP Tool and prepare Installat ion Guideline and information about the
Tool.
9. Make Data Entry in the Software in all modules & generate report.

** Perform Laboratory (Experiments) work in the in CSM605:Mini -Project.

Assessment:

Internal Assessment:

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

End Semester Theory Examination :

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

 The students need to solve total 4 questions.

 Question No.1 will be compulsory and based on entire syllabus.

 Remaining question (Q.2 to Q.6) will be selected from all the modules.





















Page 55

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

Course Code Course Name Credits
CSDLO6024 Advance d Computer Network 4

Course Objective:
1. To make learners aware about advances in computer networking technologies.
2. To give overview of advance internet, QoS based and management protocols.
3. To introduce issues related to traffic engineering and capacity planning.

Course Outcomes: On successful completion of course learner will be able to
1. Demonstrate the understanding of advance data communication technologies.
2. Demonstrate the understanding of WAN Technology typically ATM .
3. Demonstrate the understanding of packet switching protocols such as X.25, X.75.
4. Explore the issues of advance internet routing protocols and also QoS based protocols.
5. Analyze issues of traffic requirements and perform capa city planning.
6. Demonstrate the understanding of protocol used for management of network.

Prerequisite: Computer Networks, ISO OSI Layered Protocols, TCP/IP protocol suite.
Module
No. Unit
No. Topics Hrs.



1 Data Communications: 06
1.1 Defining Data Communication needs, Transmission Hierarchy

1.2 Optical Networks : SONET/SDH standard, Architecture, Format, Hardware,
Configuration, advantages




2 WAN Technology: 10
2.1 Introducing ATM Technology, Need and Benefit, Concept, Faces of ATM

2.2 Why ATM, BISDN Reference Model, ATM Layer, ATM Adaptation Layer,
ATM Signaling
3 Protocols and Interfaces: 10
3.1 Introduction to TCP/IP: Issues in IPV4, IPV6 protocol

3.2 Mature Packet Switching Protocols:
ITU Recommendation X.25, User Connectivity, Theory of Operations,
Network Layer Functions, X.75 Internetworking Protocol, Advantages and
Drawbacks

Page 56

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 55
4 Advance Routing Protocols: 14
4.1

Internet Routing Protocols : OSPF, RIP, BGP
Multicast Routing: Reverse Path Broadcasting, Internet Group Management
Protocol, Reverse Path Multicasting, Discrete Vector Multicasting protocol
4.2 IP forwarding Architectures
Overlay Model: Classical IP over ATM and LANE
4.3 Multiprotocol Label Switching MPLS :
Fundamentals of Labels, Label Stack, VC Merging, Label Distribution
Protocol, Explicit routing for Traffic Engineering
4.4 Integrated services, RSVP, Differentiated Services
4.5 MultiMedia Over Internet: RTP, Session Control Protocol H.323
5 Traffic Engineering : 08
5.1 Requirement Definition: User requirement Traffic Sizing , Traffic
Characteristics, Protocols, Time and Delay Considerations

5.2 Traffic Engineering and Capacity planning: Throughput calculation,
Traffic Engineering basics, Traditional traffic Engineering and Queued data
and Packet Switched packet modeling , Queuing Disciplines (M/M/1), Design
parameters for Peak: delay or latency, availability and reliability.
6 Network management 04
6.1 Network Management : SNMP Concept and format, Management
Components: SMI, MIB

Text Books:
1. M. A. Gallo and W. M. Hancock, Computer Communications and Networking Technologies,
Cengage Learning, (1e).
2. Leon -Garcia, Communication Networks, Tata McGraw -Hill.
3. Darren L. Spohn, Data Network Design, Tata McGraw -Hill.
4. BehrouzForouzan, TCP/IP Protocol Suite ,McGraw -Hill, (5e).
5. William Stallings, High -Speed Networks and Internets, Pearson Education, (2e).

Page 57

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 56
Reference Books:
1. Andrew Tanenbaum― Computer Networks‖, Prentice Hall, (5e).
2. Cisco Certified Network Analyst study guide, Wiley Publishing House.(7e).
3. Douglas E. Comer, Internetworking with TCP/IP Volume One, (6e).
4. James F. Kurose, Keith W. Ross, ―Computer Networking, A Top -Down Approach Featuring the
Internet‖,Addison Wesley, (5e).

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

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



















Page 58

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

Lab Code Lab Name Credits
CSL601 Software Engineering Lab 1

Lab Outcome:
On successful completion of laboratory sessions, learners will be able to
1. Identify requirements and apply process model to selected case study.
2. Analyze and design models for the selected case study using UML modeling.
3. Use various software engineering tools.

Description:
The Software Engineering Lab has been developed by keeping in mind the following objective s:
 Select case studies to solve real life problems by applying software engineering principles.
 To impart state -of-the-art knowledge on Software Engineering and UML.

List of Experiments:
Laboratory work will be based on course syllabus with minimum 10 ex periments to be incorporated.
Assign case study to a group of two/three students and each group to perform the following experiments on
their case study.
Sr. No. Title of Experiments
1 Prepare detailed statement of problem for the selected / allotted mini project and identify
suitable process model for the same with justification.
2 Develop Software Requirement Specification (SRS) document in IEEE format for the
project.
3 Use project management tool to prepare schedule for the project.
4 Prepare RMMM plan for the project.
5 Identify scenarios & develop UML Use case and Class Diagram for the project.
6 Draw DFD (upto 2 levels) and prepare Data Dictionary for the project.
7 Develop Activity / State Transition diagram for the project.
8 Develop Sequence and Collaboration diagram for the project.
9 Change specification and make different versions using any SCM Tool.
10 Develop test cases for the project using white box testing.

Page 59

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


Digital Material:
Practical can be conducted using any open source software tools like Dia, Star UML, etc.
Term Work:
Term work (25 Marks) shall consist of
 Laboratory work ….. 15 marks
 Two assignments … 05 marks
 Attendance (theory and practical) ….. 05 marks
Oral exam will be based on CSC601 and CSL601 sylla bus.































Page 60

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


Lab Code Lab Name Credits
CSL602 System Software Lab 1

Outcome: At the end of the course learner will be able to
1. Generate machine code by using various databases generated in pass one of two pass assembler.
2. Construct different databases of single pass macro processor.
3. Identify and validate different tokens for given high level language code.
4. Parse the given input string by constructing Top down /Bottom up parser.
5. Implement synthesis phase o f compiler with code optimization techniques.
6. Explore various tools like LEX and YACC.

Description: The current System Software is highly complex with huge built in functionality offered to the
programmer to develop complex applications with ease. This laboratory course aims to make a student
understand -
 The need for modular design
 The need for well -defined data structures and their storage management
 The increase in the complexity of translators as we move from assembly level to high level
programming
 The need to produce an efficient machine code that is optimized for both execution speed and
memory requirement
 The efficient programming constructs that make them a good coder
Suggested List of Experiments:
Sr. No. Title of Experiments
1 Implementations of two pass Assembler.
2 Implementation of single pass Macro Processor.
4 Implementation of Lexical Analyzer.
5 Implementation of Parser (Any one).
6 Implementation of Intermediate code generation phase of compiler.
7 Implementation of code generation phase of compiler.
8 Study and implement experiments on LEX. YACC, Grey Box Probing.


Reference Books:

1. Modern Compiler . Implementation in Java , Second. Edition. Andrew W. Appel Princeton
University. Jens Palsberg Purdue University. CAMBRIDGE.
2. Crafting a compiler with C , Charles N. Fischer, Ron K. Cytron, Richard J. LeBlanc .

Page 61

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

Term Work:
Laboratory work will be based on above syllabus with minimum 10 experiments to be incorporated.
The distribution of marks for term work shall be as follows:
 Laboratory work (experiments/case studies): ……………………………..(15) Marks.
 Assignment: ...………..…………………………………………………... (05) Marks.
 Attendance ………..……………………………………………………… (05) Marks
TOTAL: ………………………………………………………………….. (25) Marks.

Oral & Pra ctical exam will be based on the above and CSC602 syllabus.















Page 62

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

Lab Code Lab Name Credits
CSL603 Data Warehousing and Mining Lab 1

Lab Outcome:
1. Design data warehouse and perform various OLAP operations.
2. Implement classification, prediction, clustering and association rule mining algorithms.
3. Demonstrate classifications, prediction, clustering and association rule mining algorithms on a given
set of data sample using data mining tools.
4. Implement spatial and web mining algorithms.

Description:
An operational database undergoes frequent changes on a daily basis on account of the transactions that take
place. A data warehouses provides us generalized and consolidated data in multidimensional view. Data
mining functions such as classification, prediction, clustering, and association rule mining can be integrated
with OLAP operations to enhance the interactive mining of knowledge at multiple level of abstraction. Data
mining supports knowledge discovery by finding hidden patterns and associations, constructing analytical
models, performing classification and prediction, these mining results can be demonstrated using the data
mining tools.

Suggested List of Experiments:
Sr. No. Title of Experiments
1 Build Data Warehouse/Data Mart for a given problem statement
i) Identifying the source tables and populating sample data
ii) Design dimensional data model i.e. Star schema, Snowflake schema and Fact
Constellation schema (if applicable)
2 To perform various OLAP operations such as slice, dice, drilldown, rollup, pivot
3 Implementation of Classification algorithm( Decision Tree/ Bayesian)
4 Implementation of Linear Regression.
5 Implementation of Clustering algorithm( K -means/ Agglomerative).
6 Implementation of Association Rule Mining algorithm(Apriori).

Page 63

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 62
7 Perform data Pre -processing task and Demonstrate performing Classification,
Clustering, Association algorithm on data sets using data mining tool (WEKA,R
tool, XL Miner, etc.)
8 Implementation of page rank algorithm.
9 Implementation of HITS algorithm.
10 Implementation of Spatial Clustering Algorithm - CLARANS Extensions

Term Work:
Laboratory work will be based on above syllabus with minimum 08 experiments to be incorporated.
Experiments ---------------------------------------------------------------------- (15) Marks
Assignment ----------------------------------------------------------------------- (05) Marks
Attendance (Theory + Practical) ----------------------------------------------- (05) Marks
Total ------------------------------------------------------------------------------- (25) Marks

Oral & Practical exam will be based on the above and CSC603:―Data Warehousing and Mining‖ syllabus.












Page 64

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

Lab Code Lab Name Credit
CSL604 System Security Lab 01


Lab Outcome:
Learner will able to
1. To be able to apply the knowledge of symmetric cryptography to implement simple ciphers.
2. To be able to analyze and implement public key algorithms like RSA and El Gamal.
3. To analyze and evaluate performance of hashing algorithms.
4. To explore the different network reconnaissance tools to gather information about networks.
5. To explore and use tools like sniffers, port scanners and other related tools for analysing packets in a
network.
6. To be able to set up firewalls and intrusion detection systems using open source technologies and to
explore email security.
7. To be able to explore various attacks like buffer -overflow, and web -application attacks.

Suggested Experiment List: (Any 10)
Sr. No Description
1 Design and Implementation of a product cipher using Substitution and Transposition
ciphers
2 Implementation and analysis of RSA cryptosystem and Digital signature scheme using
RSA/El Gamal.
3 Implementation of Diffie Hellman Key exchange algorithm
4 For varying message sizes, test integrity of message using MD -5, SHA -1, and analyse
the performance of the two protocols. Use crypt APIs
5 Study the use of network reconnaissance tools like WHOIS, dig, traceroute, nslookup
to gather information about networks and domain registrars.
6 Study of packet sniffer tools : wireshark, :
1. Download and install wireshark and capture icmp, tcp, and http packets in
promiscuous mode.
2. Explore how the packets can be traced based on different filters.
7 Download and install nmap. Use it with different options to scan open ports, perform
OS fingerprinting, do a ping scan, tcp port scan, udp port scan, xmas scan etc.
8 Detect ARP spoofing using nmap and/or open source tool ARPWATCH and
wireshark. Use arpin g tool to generate gratuitous arps and monitor using wireshark
9 Simulate DOS attack using Hping, hping3 and other tools.
10 Simulate buffer overflow attack using Ollydbg, Splint, Cppcheck etc

Page 65

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 64
11 a. Set up IPSEC under LINUX.
b. Set up Snort and study the logs.
12 Setting up personal Firewall using iptables
13 Explore the GPG tool of linux to implement email security
14 SQL injection attack, Cross -Cite Scripting attack simulation

Reference Books:
1. Build your own Security Lab, Michael Gregg, Wiley India
2. CCNA Security, Study Guide, TIm Boyles, Sybex.
3. Network Security Bible, Eric Cole, Wiley India.
4. Web Application Hacker‘s Handbook, Dafydd Stuttard, Marcus Pinto, Wiley India.

Term Work:
Laboratory work will be based on above syl labus with minimum 10 experiments to be incorporated.
Experiments ---------------------------------------------------------------------- (15) Marks
Assignment ----------------------------------------------------------------------- (05) Marks
Attendance (Th eory + Practical) ----------------------------------------------- (05) Marks
Total ------------------------------------------------------------------------------- (25) Marks

Oral & practical examination will be based on the above and Cryptography and System Security (CSC604)
syllabus.




















Page 66

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



Lab Code Lab Name Credit
CSM605 Mini -Project 2

Lab Outcome: After successful completion of this Lab student will be able to
1. Acquire practical knowledge within the chosen area of technology for project development.
2. Identify, analyze, formulate and handle programming projects with a comprehensive and systematic
approach
3. Contribute as an individual or in a team in development of technical projects
4. Develop effective communication skills for presentation of project related activities

Description:
Mini project may be carried out in one or more form of following:
Product preparations, prototype development model, fabrication of set -ups, laboratory experiment
development, process modification/developme nt, simulation, software development, integration of
software and hardware, statistical data analysis, creating awareness in society, etc.

Guidelines:
 A project to be developed based on one or more of the following fields -
Advance Database Management System, Enterprise Resource Planning, Advance Operating System,
Advance Computer Network, etc.
 Mini project may be carried out a group of 2 /3 students. The student is required to submit a report based
on the work. The evaluat ion of the project shall be on continuous basis.


Term Work (TW):
Distribution of marks for term work shall be as follows:
1. Attendance 05 Marks
2. Mini project work 10 Marks
3. Project Report (Spiral Bound) 10 Marks

The final certifica tion and acceptance of TW ensures the satisfactory performance on the above three aspects.

Oral & Practical Examination should be conducted by internal and external examiners appointed by
University of Mumbai. Students have to give presentation and demons tration on the Mini -Project.





Page 67

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



Course Code Course Name Credits
CSC701 Digital Signal & Image Processing 4

Course objectives:
1. To understand the fundamental concepts of digital signal processing and Image processing.
2. To explore DFT for 1 -D and 2 -D signal and FFT for 1 -D signal
3. To apply processing techniques on 1 -D and Image signals.
4. To apply digital image processing techniques for edge detection.

Course outcomes: On successful completion of the course learner will be able to:
1. Apply the concept of DT Signal and DT Systems.
2. Classify and analyze discrete time signals and systems
3. Implement Digital Signal Transform techniques DFT and FFT.
4. Use the enhancement techniques for digital Image Processing
5. Differentiate between the advantages and disadvantages of different edge detection techniques
6. Develop small projects of 1 -D and 2 -D Digital Signal Processing.

Prerequisite: Applied Mathematics

Module
No. Unit
No. Topic details Hrs.
1.0 Discrete -Time Signal and Discrete -Time System 14
1.1 Introduction to Digital Signal Processing, Sampling and
Reconstruction, Standard DT Signals, Concept of Digital Frequency,
Representation of DT signal using Standard DT Signals, Signal
Manipulations(shifting, reversal, scaling, addition, multiplication).
1.2 Classification of Discrete -Time Signals, Classification of Discrete -
Systems
1.3 Linear Convolution formulation for 1 -D and 2 -D signal (without
mathematical proof), Circular Convolution (without mathematical
proof), Linear convolution using Circular Convolution. Auto and
Cross Correlation formula evaluation, LTI system, Concept of
Impulse Response and Step Response, Output of DT system using
Time Domain Linear Convolution.
2.0
Discrete Fourier Transform 08
2.1 Introduction to DTFT, DFT, Relation between DFT and DTFT, IDFT
2.2 Properties of DFT without mathematical proof (Scaling and
Linearity, Periodicity, Time Shift and Frequency Shift, Time
Reversal, Convolution Property and Parsevals‘ Energy Theorem).
DFT computation using DFT properties.
2.3 Transfer function of DT System in frequency domain using DFT.
Linear and Circular Convolution using DFT, Convolution of long
sequences, Introduction to 2 -D DFT
3.0 Fast Fourier Transform 06
3.1 Need of FFT, Radix -2 DIT -FFT algorithm,

Page 68

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 67
Module
No. Unit
No. Topic details Hrs.
3.2 DIT-FFT Flow graph for N=4 and 8, Inverse FFT algorithm.
3.3 Spectral Analysis using FFT
4.0 Digital Image Fundamentals 08
4.1 Introduction to Digital Image, Digital Image Processing System,
Sampling and Quantization
4.2 Representation of Digital Image, Connectivity
4.3 Image File Formats: BMP, TIFF and JPEG.
5.0 Image Enhancement in Spatial domain 10
5.1 Gray Level Transformations, Zero Memory Point Operations,
5.2 Histogram Processing, Histogram equalization.
5.3 NeighborhoodProcessing, Spatial Filtering, Smoothing and
Sharpening Filters, Median Filter.
6.0 Image Segmentation 06
6.1 Segmentation based on Discontinuities (point, Line, Edge),
6.2 Image Edge detection using Robert, Sobel, Previtt masks, Image
Edge detection using Laplacian Mask.
Total 52


Text Books:

1. John G. Proakis, Dimitris and G.Manolakis, ‗Digital Signal Processing: Principles, Algorithms, and
Applications‘ 4th Edition 2007, Pearson Education.
2. A. Anand Kumar, ‗Digital Signal Processing‘, PHI Learning Pvt. Ltd. 2013.
3. Rafel C. Gonzalez and Richard E. Woods, ‗Digital Image Processing‘, Pearson Education Asia, 3rd
Edition, 2009,
4. S. Sridhar, ‗Digital Image Process ing‘, Oxford University Press, Second Edition, 2012.

Reference Books:

1. Sanjit Mitra, ‗Digital Signal Processing: A Computer Based Approach‘, TataMcGraw Hill, 3rd Edition.
2. S. Salivahanan, A. Vallavaraj, and C. Gnanapriya, ‗Digital Signal Processing‘ Tata McGraw Hill
Publication 1st Edition (2010).
3. S. Jayaraman, E. Esakkirajan and T. Veerkumar, ‗Digital Image Processing‘ TataMcGraw Hill
Education Private Ltd, 2009.
4. Anil K. Jain, ‗Fundamentals and Digital Image Processing‘, Prentice Hall of India Pri vate Ltd, 3rd
Edition.


Assessment:

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

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

Page 69

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



Course Code Course Name Credits
CSC702 Mobile Communication & Computing 4

Course objectives:
1. To introduce the basic concepts and principles in mobile computing. This includes major techniques
involved, and networks & systems issues for the design and implementation of mobile computing
systems and applications.
2. To explore both theoretical and practical issues of mo bile computing.
3. To provide an opportunity for students to understand the key components and technologies involved
and to gain hands -on experiences in building mobile applications.

Course outcomes: On successful completion of course learner will be able:
1. To identify basic concepts and principles in mobile communication & computing, cellular
architecture.
2. To describe the components and functioning of mobile networking.
3. To classify variety of security techniques in mobile network.
4. To apply the concept s of WLAN for local as well as remote applications.
5. To describe and apply the concepts of mobility management
6. To describe Long Term Evolution (LTE) architecture and its interfaces.
Prerequisite: Computer Networks

Module
No. Unit
No. Topics Hrs
1.0 1.1 Introduction to Mobile Computing, Telecommunication
Generations, Cellular systems, 06
1.2 Electromagnetic Spectrum, Antenna ,Signal Propagation,
Signal Characteristics, , Multiplexing, Spread Spectrum:
DSSS & FHSS
2.0 2.1 GSM Mobile services, System Architecture, Radio interface,
Protocols , Localization and Calling, Handover, security
(A3,A5 & A8) 10
2.2 GPRS system and protocol architecture
2.2 UTRAN , UMTS core network ; Improvements on Core
Network,
3.0 3.1 Mobile Networking : Medium Access Protocol, Internet
Protocol and Transport layer 12
3.2 Medium Access Control:
Motivation for specialized MAC, , Introduction to multiple
Access techniques (MACA)

Page 70

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 69
3.3 Mobile IP: IP Packet Delivery, Agent Advertisement
and Discovery, Registration, Tunneling and
Encapsulation, Reverse Tunneling, Routing (DSDV,DSR)
3.4 Mobile TCP :
Traditional TCP, Classical TCP Improvements like Indirect
TCP, Snooping TCP & Mobile TCP, Fast Retransmit/ Fast
Recovery, Transmission/Timeout Freezing, Selective
Retransmission
4.0 4.1 Wireless Local Area Networks : Introduction, Infrastructure
and ad -hoc network 08
4.2 IEEE 802.11: System architecture , Protocol architecture ,
Physical layer, Medium access control layer, MAC
management, 802.11a, 802.11b
4.3 Wi-Fi security : WEP ,WPA, Wireless LAN Threats ,
Securing Wireless Networks
4.4 HiperLAN 1 & HiperLAN 2
4.5 Bluetooth: Introduction, User Scenario, Architecture, protocol
stack
5.0 5.1 Mobility Management : Introduction, IP Mobility,
Optimization, IPv6 06
5.2 Macro Mobility : MIPv6, FMIPv6,
5.3 Micro Mobility: CellularIP, HAWAII, HMIPv6,
6.0 6.1 Long -Term Evolution (LTE) of 3GPP : LTE System
Overview, Evolution from UMTS to LTE 10
6.2 LTE/SAE Requirements, SAE Architecture
6.3 EPS: Evolved Packet System, E -UTRAN, Voice over LTE
(VoLTE), Introduction to LTE -Advanced,
6.4 System Aspects, LTE Higher Protocol Layers, LTE MAC
layer, LTE PHY Layer,
6.5 Self Organizing Network (SON -LTE),SON for Heterogeneous
Networks (HetNet), Introduction to 5G
Total 52


Assessment:

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

Page 71

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




End Semester Theory Examination :

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


Text Books:
1 Jochen Schilller,‖Mobile Communication ―, Addision wisely,P earson Education
2 ―Wireless Communications & Networks,‖ By William Stallings, Second Edition, Pearson
Education
3 Raj Kamal, Mobile Computing, 2/e , Oxford University Press -New Delhi

Reference Books:

1 LTE Self -Organizing Networks (SON): Network Management Automation for Operational
Efficiency, Seppo Hamalainen , Henning Sanneck , Cinzia Sartori , Wiley publications
2 Christopher Cox, ― An Introduction to LTE: LTE, LTE -Advanced, SAE and 4G Mobile
Communications,‖ Wiley publications
3 Mobility Protocols and Handover Optimization: Design, Evaluation and Application By Ashutosh
Dutta, Henning Schulzrinne, IE EE Press, Wiley Publication
4 Michael Gregg, ―Build your own securit y lab,‖ Wiley India edition
5 Emerging Wireless Technologies and the Future Mobile Int ernet, Dipankar Raychaudhu ri, Mario
Gerla, Cambridge.
6 Andreas F.Molisch, ―Wireless Communications,‖ Second Edition, Wiley Publications .

















Page 72

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

Course Code Course Name Credits
CSC703 Artificial Intelligence & Soft Computing 4


Course Objectives (CO):
1 To conceptualize the basic ideas and techniques of AI and SC.
2 To distinguish various search techniques and to make student understand knowledge representation
and planning.
3 To become familiar with basics of Neural Netwo rks and Fuzzy Logic.
4 To familiarize with Hybrid systems and to build expert system.

Course Outcomes: Students should be able to -
1 Identify the various characteristics of Artificial Intelligence and Soft Computing techniques.
2 Choose an appropriate problem solving method for an agent to find a sequence of actions to reach the
goal state.
3 Analyse the strength and weakness of AI approaches to knowledge representation, reasoning and
planning.
4 Construct supervised and unsupervised ANN f or real world applications.
5 Design fuzzy controller system.
6 Apply Hybrid approach for expert system design.

Pre-requisites: Basic Mathematics, Algorithms

Module
No. Unit
No. Topics Hrs.
1.0 Introduction to Artificial Intelligence(AI) and Soft Computing 4
1.1 Introduction and Definition of Artificial Intelligence.
1.2 Intelligent Agents : Agents and Environments ,Rationality, Nature of
Environment, Structure of Agent, types of Agent
1.3 Soft Computing: Introduction of soft computing, soft computing vs. hard
computing, various types of soft computing techniques.
2.0 Problem Solving 10
2.1 Problem Solving Agent, Formulating Problems, Example Problems
2.2 Uninformed Search Methods: Depth Limited Search, Depth First Iterative
Deepening (DFID), Informed Search Method: A* Search
2.3 Optimization Problems: Hill climbing Search, Simulated annealing, Genetic
algorithm
3.0 Knowledge, Reasoning and Planning 10
3.1 Knowledge based agents
3.2 First order logic: syntax and Semantic, Knowledge Engineering in FOL
Inference in FOL : Unification, Forward Chaining, Backward Chaining and
Resolution
3.3 Planning Agent, Types of Planning: Partial Order, Hierarchical Order,
Conditional Order
4.0 Fuzzy Logic 12

Page 73

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 72
4.1 Introduction to Fuzzy Set: Fuzzy set theory, Fuzzy set versus crisp set, Crisp
relation & fuzzy relations, membership functions,
4.2 Fuzzy Logic: Fuzzy Logic basics, Fuzzy Rules and Fuzzy Reasoning
4.3 Fuzzy inference systems: Fuzzification of input variables, defuzzification and
fuzzy controllers.
5.0 Artificial Neural Network 12
5.1 Introduction – Fundamental concept – Basic Models of Artificial Neural
Networks – Important Terminologies of ANNs – McCulloch -Pitts Neuron
5.2 Neural Network Architecture: Perceptron, Single layer Feed Forward ANN,
Multilayer Feed Forward ANN, Activation functions, Supervised Learning:
Delta learning rule, Back Propagation algorithm.
5.3 Un-Supervised Learning algorithm: Self Organizing Maps
6. Expert System 4
6.1 Hybrid Approach - Fuzzy Neural Systems
6.2 Expert system : Introduction, Characteristics, Architecture, Stages in the
development of expert system,
Total 52


Text Books:
1. Stuart J. Russell and Peter Norvig, "Artificial Intelligence A Modern Approach ―Second Edition"
Pearson Education.
2. Samir Roy and Chakraborty, ―Introduction to soft computing‖, Pearson Edition.
3. S.N.Sivanandam, S.N.Deepa "Principles of Soft Computing" Second Edition, Wiley Publication.
4. S.Rajasekaran and G.A.VijayalakshmiPai "Neural Networks, Fuzzy Logic and Genetic Algorithms"
PHI Learning.
5. N.P.Padhy, ―Artificial Intelligence and Intelligent Systems‖, Oxford University Press.

Reference Books:
1. Elaine Rich and Kevin Knight ―Artificial Intelligence‖ Third E dition, Tata McGraw -Hill Education
Pvt. Ltd., 2008.
2. Satish Kumar "Neural Networks A Classroom Approach" Tata McGrawHill.
3. Zimmermann H.S "Fuzzy Set Theory and its Applications"Kluwer Academic Publishers.
4. Hagan, Demuth, Beale,"Neural Network Design" CENGAGE Learning, India Edition.
5. J.-S.R.Jang "Neuro -Fuzzy and Soft Computing" PHI 2003.
6. JacekM.Zurada "Introduction to Artificial Neural Sytems" Jaico Publishing House.

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

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

Page 74

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 73
Credits Course Name Course Code
4 Advanced System Security and Digital Forensics CSDLO7031

Course Objectives:
1. To understand cyber attacks and defence strategies.
2. To understand underlying principles of access control mechanisms.
3. To explore software vulnerabilities, attacks and protection mechanisms of wireless networks and
protocols, mobile devices and web applications.
4. To develop and mitigate security management and policies.
5. To understand and explore techniques used in digital forensics.

Course Outcomes: At the end of the course learner will able to
1. Understand cyber attacks and apply access control policies and control mechanisms.
2. Identify malicious code and targeted malicious code.
3. Detect and counter threats to web applications.
4. Understand the vulnerabilities of Wi -Fi networks and explore different measures to secure wireless
protocols, WLAN and VPN networks.
5. Understand the ethical and legal issues associated with cyber crimes and be able to mitigate impact
of crimes with suitable policies.
6. Use different forensic tools to acquire and duplicate data from compromised systems and analyse the
same.

Prerequisite: Cryptography and System Security
Hrs
. Detailed Content Unit
No. Module
No.
08 Introduction & Access Control

1 Cyber -attacks, Vulnerabilities, Defence Strategies and Techniques,
Authentication Methods and Protocols, Defence in Depth Strategies. 1.1
Access Control Policies: DAC, MAC, Multi -level Security Models: Biba
Model, Bell La Padula Model, Single Sign on, Federated Identity
Management. 1.2
08 Program & OS Security
2 Malicious and Non -Malicious programming errors, Targeted Malicious
codes: Salami Attack, Linearization Attack, Covert Channel, Control
against Program threats. 2.1
Operating System Security: Memory and Address protection, File
Protection Mechanism, User Authentication. 2.2
Linux and Windows: Vulnerabilities, File System Security. 2.3
12 Web Application Security
3
OWASP, Web Security Considerations, User Authentication and Session

Page 75

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 74
Management, Cookies, SSL, HTTPS, SSH, Privacy on Web, Web Browser
Attacks, Account Harvesting, Web Bugs, Clickjacking, Cross -Site Request
Forgery, Session Hijacking and Management, Phishing and Pharming
Techniques, Web Service Security, OAuth 2.0
08 Wireless Security

4 Wi-Fi Security, WEP, WPA, WPA -2, Mobile Device Security - Security
Threats, Device Security, GSM and UMTS Security, IEEE 802.11/802.11i
Wireless LAN Security, VPN Security.
06 Legal and Ethical issues

5 Cybercrime and its types, Intellectual property, Privacy, Ethical issues. 5.1
Protecting Programs and Data, Information and the Law, Rights of
Employees and Employers, Redress for Software Failures, Computer Crime,
Ethical Issues in Computer Security, case studies of ethics. 5.2
10 Digital Forensics

6 Introduction to Digital Forensics, Acquiring Volatile Data from Windows
and Unix systems, Forensic Duplication Techniques, Analysis of forensic
images using open source tools like Autopsy and SIFT, Investigating logs
from Unix and windows systems, Investigating Windows Registry.

Text Books:
1. Computer Security Principles and Practice, William Stallings, Sixth Edition, Pearson Education
2. Security in Computing, Charles P. Pfleeger, Fifth Edition, Pearson Education
3. Network Security and Cryptography, Bernard Menezes, Cengage Learning
4. Network Security Bible, Eric Cole, Second Edition, Wile y

Reference Books:
1. Computer Security, Dieter Gollman, Third Edition, Wiley
2. Digital Forensics by Nilakshi Jain & Kalbande, Wiley.
3. Incident Response & Computer Forensics by Kevin Mandia, Chris Prosise, Wiley.
4. Cyber Security. Nina Godbole, Sunit Belapure, Wiley.

Digital references:
1. https://www.owasp.org/index.php/Category:OWASP_Top_Ten_Project
Assessment:
Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional 40% syllabus is completed.
Duration of each test shall be one hour.

Page 76

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 75
Theory Examination:
1. Question paper will comprise of total six question.
2. All question carry equal marks
3. Questions will be mixed in nature (for example supposed Q.2 has part (a) from module 3 then part (b)
will be from any module other than module 3)
4. Only Four question need to be solved.

=================================================================
Laboratory/ Experimental Work
# The Experiments for this course are required to be performed and to be evaluated
in CSL704: Computational Lab -1.

Lab Outcome:
Learner will able to
1. Analyze static code and program vulnerabilities using open source tools.
2. Explore and analyze network vulnerabilities using open source tools.
3. Explore and analyze different security tools to detect web application and browser vulnerabilities.
4. Explore and ana lyze different tools to secure wireless networks and routers, and mobile devices and
perform penetration testing, and analyze its impact.
5. Understand and implement AAA using RADIUS and TACACS.
6. Explore various forensics tools in Kali Linux and use them to acquire, duplicate and analyze data and
recover deleted data.
Sr. No Description
1 Static code analysis using open source tools like RATS, Flawfinder etc.
3 Vulnerability scanning using Nessus, Nikto (Kali Linux)
4 Explore web-application vulnerabilities using open source tools like Wapiti, browser
exploitation framework (BeEf), etc.
5 Detect SQL injection vulnerabilities in a website database using SQLMap
6 Performing a penetration testing using Metasploit (Kali Linux)
7 Exploring Router and VLAN security, setting up access lists using Cisco Packet tracer(student
edition)
8 Exploring VPN security using Cisco Packet tracer(student edition)
9 Exploring Authentication and access control using RADIUS, TACACS and TACACS+
10 Install and use a security app on an Android mobile (e.g. Droidcrypt)
11 Explore forensics tools in Kali Linux for acquiring, analyzing and duplicating data: dd,
dcfldd, foremost, scalpel, debugfs, wireshark, tcptrace, tcpflow
12 Analysis of forensic images using open source tools like Autopsy, SIFT, FKT Imager
13 Use of steganographic tools like OpenStego, to detect data hiding or unauthorized file
copying

Page 77

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 76
14. Use Password cracking using tools like John the Ripper/Cain and Abel/ Ophcrack to detect
weak passwords.

Reference Books:
1. Build your own Security Lab, Michael Gregg, Wiley India
2. CCNA Security, Study Guide, Tim Boyles, Sybex.
3. Web Application Hacker‘s Handbook, Dafydd Stuttard, Marcus Pinto, Wiley India
4. Network Infrastructure Security, Randy Waver, Dawn Weaver, Cengage Learning.
5. Incident Response & Computer Forensics by Kevin Mandia, Chris Prosise, Wiley.

Digital References:
http://www.opentechinfo.com/learn -use-kali-linux/































Page 78

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 77
Course Code Course/Subject Name Credits
CSDLO7032 Big Data Analytics 4

Course Objectives :

1. To provide an overview of an exciting growing field of big data analytics.
2. To introduce programming skills to build simple solutions using big data technologies such as
MapReduce and scripting for NoSQL, and the ability to write parallel algorithms for multiprocessor
execution.
3. To teach the fundamental techniques and principles in achieving big data analytics with scalability
and streaming capability.
4. To enable students to have skills that will help them to solve complex real -world problems in for
decision support.
5. To provide an indication of the current research approaches that is likely to provide a basis for
tomorrow's solutions.

Course Outcomes: Learner will be able to…
1. Understan d the key issues in big data management and its associated applications for business
decisions and strategy.
1. Develop problem solving and critical thinking skills in fundamental enabling techniques like
Hadoop, Mapreduce and NoSQL in big data analytics.
2. Collect, manage, store, query and analyze various forms of Big Data.
3. Interpret business models and scientific computing paradigms, and apply software tools for big data
analytics.
4. Adapt adequate perspectives of big data analytics in various applications li ke recommender
systems, social media applications etc.
5. Solve Complex real world problems in various applications like recommender systems, social
media applications, health and medical systems, etc.

Prerequisite:
Some prior knowledge about Java programming, Basics of SQL, Data mining and machine learning methods
would be beneficial.

Module Detailed Contents Hrs.



01

Introduction to Big Data and Hadoop
1.1 Introduction to Big Data,
1.2 Big Data characteristics, types of Big Data,
1.3 Traditional vs. Big Data business approach,
1.4 Case Study of Big Data Solutions.
1.5 Concept of Hadoop
1.6 Core Hadoop Components; Hadoop Ecosystem


06

Page 79

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



02

Hadoop HDFS and MapReduce
2.1 Distributed File Systems: Physical Organization of Compute
Nodes, Large -Scale File -System Organization.
2.2 MapReduce: The Map Tasks, Grouping by Key, The Reduce
Tasks, Combiners, Details of MapReduce Execution, Coping
With Node Failures.
2.3 Algorithms Using MapReduce: Matrix -Vector Multiplication by
MapReduce, Relational -Algebra Operations, Computing
Selections by MapReduce, Computing Projections by
MapReduce, Union, Intersection, and Difference by MapReduce
2.4 Hadoop Limitations


10





03

NoSQL
3.1 Introduction to NoSQL, NoSQL Business Drivers,
3.2 NoSQL Data Architecture Patterns: Key -value stores, Graph
stores, Column family (Bigtable)stores, Document stores,
Variations of NoSQL architectural patterns, NoSQL Case Study
3.3 NoSQL solution for big data, Understanding the types of big
data problems; Analyzing big data with a shared -nothing
architecture; Choosing distribution models: master -slave versus
peer-to-peer; NoSQL systems to handle big data problems.


06





04 Mining Data Streams:
4.1 The Stream Data Model: A Data -Stream -Management System,
Examples of Stream Sources, Stream Queries, Issues in Stream
Processing.
4.2 Sampling Data techniques in a Stream
4.3 Filtering Streams: Bloom Filter with Analysis.
4.4 Counting Distinct Elements in a Stream, Count -Distinct
Prob lem, Flajolet -Martin Algorithm, Combining Estimates,
Space Requirements
4.5 Counting Frequent Items in a Stream, Sampling Methods for
Streams, Frequent Itemsets in Decaying Windows.
4.6 Counting Ones in a Window: The Cost of Exact Counts, Th e
Datar -Gionis -Indyk -Motwani Algorithm, Query Answering in
the DGIM Algorithm, Decaying Windows.


12

05
Finding Similar Items and Clustering
5.1 Distance Measures:
Definition of a Distance Measure, Euclidean Distances, Jaccard
Distance, Cosine Distance, Edit Distance, Hamming Distance.
5.2 CURE Algorithm, Stream -Computing , A Stream -Clustering
Algorithm, Initializing & Merging Buckets, Answering Queries



08



Real -Time Big Data Models
6.1 PageRank Overview, Efficient computation of

Page 80

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

06
PageRank: PageRank Iteration Using MapReduce, Use of
Combiners to Consolidate the Result Vector.
6.2 A Model for Recommendation Systems, Content -Based
Recommendations, Collaborative Filtering.
6.3 Social Networks as Graphs, Clustering of Social -Network
Graphs, Direct Discovery of Communities in a social graph.
10


Text Books:
1. CreAnand Rajaraman and Jeff Ullman ―Mining of Massive Datase ts‖, Cambridge University Press,
2. Alex Holmes ―Hadoop in Practice‖, Manning Press, Dreamtech Press.
3. Dan Mcary and Ann Kelly ―Making Sense of NoSQL‖ – A guide for managers and the rest of us,
Manning Press.
References books:
1. Bill Franks , ―Taming The Big Data Tidal Wave: Finding Opportunities In Huge Data Streams With
Advanced Analytics‖, Wiley
2. Chuck Lam, ―Hadoop in Action‖, Dreamtech Press
3. Jared Dean, ―Big Data, Data Mining, and Machine Learning: Value Creation for Business Leaders
and Practitioners‖ , Wiley India Private Limited, 2014.
4. 4. Jiawei Han and Micheline Kamber, ―Data Mining: Concepts and Techniques‖, Morgan Kaufmann
Publishers, 3rd ed, 2010.
5. Lior Rokach and Oded Maimon, ―Data Mining and Knowledge Discovery Handbook‖, Springer, 2nd
edition, 2 010.
6. Ronen Feldman and James Sanger, ―The Text Mining Handbook: Advanced Approaches in
Analyzing Unstructured Data‖, Cambridge University Press, 2006.
7. Vojislav Kecman, ―Learning and Soft Computing‖, MIT Press, 2010.

Term Work:
Assign a case study for grou p of 3/4 students and each group to perform the following experiments on their
case-study; Each group should perform the exercises on a large datasetcreated by them.

The distribution of marks for term work shall be as follows:
• Programming Exercises: .................................. ......................... (10) Marks.
• Mini project: ............................................................ (10) Marks.
• Attendance (Theory & Practical) ................................ (05) Marks.
TOTAL: ............................... ............................ (25) Marks.

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


Page 81

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

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

Oral examination:
An oral exam will be held bas ed on the above syllabus.

Suggested Practical List:
1. Hadoop HDFS Practical:
-HDFS Basics, Hadoop Ecosystem Tools Overview.
-Installing Hadoop.
-Copying File to Hadoop.
-Copy from Hadoop File system and deleting file.
-Moving and displaying files in HDFS.
-Programming exercises on Hadoop.
2. Use of Sqoop tool to transfer data between Hadoop and relational database servers.
a. Sqoop - Installation.
b. To execute basic commands of Hadoop eco system component Sqoop.
3. To install and configure MongoDB/ Cassandra/ HB ase/ Hypertable to execute NoSQL commands.
4. Experiment on Hadoop Map -Reduce / PySpark:
2. -Implementing simple algorithms in Map -Reduce: Matrix multiplication, Aggregates, Joins, Sorting,
Searching, etc.
5. Create HIVE Database and Descriptive analytics -basic sta tistics, visualization using Hive/PIG/R.
6. Write a program to implement word count program using MapReduce.
7. Implementing DGIM algorithm using any Programming Language/ Implement Bloom Filter using
any programming language.
8. Implementing any one Clustering alg orithm ( K-Means/CURE) using Map -Reduce.
9. Streaming data analysis – use flume for data capture, HIVE/PYSpark for analysis of twitter data,
chat data, weblog analysis etc.
10. Implement PageRank using Map -Reduce.
11. Implement predictive Analytics techniques (regress ion / time series, etc.) using R/ Scilab/ Tableau/
Rapid miner.
12. Mini Project: One real life large data application to be implemented (Use standard Datasets
available on the web).

# The Experiments for this course are required to be performed and to be evaluated
in CSL704: Computational Lab -1.


Page 82

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

Course Code Course Name Credits
CSDLO7033 Robotics 4

Course objectives:
1 To know basics of a typical robot and its characteristics.
2 To analyse mathematically kinematic modelling of a typical robot manipulator.
3 To identify actuators, sensors and control of a robot for different applications.
4 To apply task planning and vision algorithms.

Course outcomes: On successful completion of course learner will be able to:
1. Describe typical robot and its characteristics.
2. Analyse kinematics parameters of robotic manipulator.
3. Identify actuators, sensors and control of a robot for different applications.
4. Design task plan and motion for a robot.
5. Apply Robotics to solve day to day problems u sing vision algorithms.
6. Use robot programming languages and acquire skills to program robots.

Prerequisite: Mathematical concepts of Geometry, Matrices Algebra, knowledge of Basic Electronics.

Module
No. Unit
No. Topics Hrs.
1.0 Introduction and Fundamentals of Robotics
08 1.1 Types of automation, Introduction, definition of a Robot,
Classification of Robots, Robotics, History of Robotics,
Advantages and Disadvantages of Robots, Robot Applications
1.2 Tasks involved in Robotics, Robot Components, Robot
characteristics and classification, Degrees of Freedom, Robot
joints, Robot Coordinates, Robot Reference frames,
Programming Modes, Robot Workspace, Work Envelop.
2.0 Direct and Inverse Kinematics
08 2.1 Direct (Forward) Kinematics: Homogeneous coordinates, Link
coordinates, Coordinate frame, coordinate transform, Arm
equations, An example – Four Axis SCARA.
2.2 Inverse Kinematics: Inverse kinematics problem, Tool
Configuration, An example – Four Axis SCARA.

Sensors, Actuators and Drive Systems 08

Page 83

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 82
3.0
3.1 Sensors: Characteristics, Utilization, Types - Position, Velocity,
Acceleration, Force and Pressure, Torque, Visible Light and
Infrared, Touch and Tactile, Proximity, Range Finders sensors.
3.2 Actuators and Drive System: Characteristics, Hydraulic
Actuators, Pneumatic Devices, Electric Motors
4.0 Robot Task and Motion Planning
10 4.1 Reactive Paradigms: Overview, Attributes of reactive paradigm
4.2 Task level programming, Uncertainty, Configuration Space, Gross
motion planning, Fine -motion planning, Simulation of Planner
motion, Source and goal scene, Task planner Simulation.
4.3 Robot Motion Planning: Concept of motion planning, BUG 1,
BUG 2 and Tangent Bug Algorithms
5.0 Robot Vision
10
5.1 Image Representation, Template Matching, Polyhedral Objects
5.2 Shape Analysis, Iterative Processing
5.3 Perspective Transformations, Structured Illumination , Camera
Calibration
6.0 Expert Systems, Robot Language and Fuzzy Logic 12
6.1 Introduction to Expert Systems, Expert system Characteristics,
Robot as a Expert System,
Robot Languages: Classification of Robot Languages, Computer
Control and Robot Software, VAL System, and Language.

6.2 Introduction, Fuzzy set, Fuzzification, Fuzzy Inference Rule Base,
Defuzzification, Applications of Fuzzy Logic in Robotics.
Total 52


Text Books:
1. Introduction Robotics - Analysis, Control, Applications by Saeed B. Niku, Second
Edition, Wiley India.
2. Fundamentals of Robotics – Analysis and Control by Robert J. Schilling, Pearson
3. Introduction to AI robotics by Robin Murphy, PHI.

Page 84

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 83
4. Robotics Technology and Flexible Automation by S. R. Deb, TMH.
5. Artificial Intelligence by Rich, Knight and Nair, TMH.
6. Introduction to Fuzzy Sets by M Ganesh PHI

Reference Books:
1. Robotics – Control, Sensing, Vision, and Intelligence by K. S. Fu, R. C. Gonzalez, C. S. G.
Lee, Tata McGraw Hill
2. Principles of Robot Motion – Theory, Algorithms and Implementation by Howie Choset,
Lynch, PHI
3. Introduction to Fuzzy Logic using Matlab,By: S.N.Sivanandam,S.N.Deepa,P Sumathi ,
Springer Publications

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

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

Term Work :
The distribution of marks for term work shall be as follows:
• Programming Exercises: .................................. ......................... (10) Marks.
• Mini project: ............................................................ (10) Marks.
• Attendance (Theory & Practical) ................................ (05) Marks.
TOTAL: ........................................................... (25) Marks.


Suggested List of Experiments:
1 Representation of Various Robots and there all Specification (Study Experiment)
2 Co-ordinate Transform of a Robot
3 Fundamental Rotation
4 Composite Rotation
5 BFS and DFS
6 Homogeneous Rotation
7 Run Length Encoding
8 Shrink and swell Operator
9 BUG1 Algorithm

Page 85

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 84
10 Bug2 Algorithm
11 Tangent Bug Algorithm
12 Edge detection algorithm
13 Case Study of CNC Machine
14 Designing a Robot Manipulator for Pre defined Task

Students can perform experiments based on Theory Syllabus or any 12 experiments from above list of
experiments or experiments framed by teachers.

# The Experiments for this course are re quired to be performed and to be evaluated
in CSL704: Computational Lab -1.




























Page 86

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 85
Course Code Course Name Credits
ILO 7011 Product Life Cycle Management 03

Objectives:
1. To familiarize the students with the need, benefits and components of PLM
2. To acquaint students with Product Data Management & PLM strategies
3. To give insights into new product development program and guidelines for designing and developing
a product
4. To familiarize the students with Virtual Product Development
Outcomes: Learner will be able to…
1. Gain knowledge about phases of PLM, PLM strategies and methodology for PLM feasibility study
and PDM implementation.
2. Illustrate various approaches and techniques for designing and developing products.
3. Apply product engineering guidelines / thumb rules in designing products for moulding, machining,
sheet metal working etc.
4. Acquire knowledge in applying virtual product development tools for components, machining and
manufacturing plant

Sr. No. Detailed Contents Hrs
01 Introduction to Product Lifecycle Management (PLM): Product Lifecycle
Management (PLM), Need for PLM, Product Lifecycle Phases, Opportunities of
Globalization, Pre -PLM Environment, PLM Paradigm, Importance & Benefits of PLM,
Widespread Impact of PLM, Focus and Application, A PLM Project, Starting the PLM
Initiative, PLM Applications
PLM Strategies: Industrial strategies, Strategy elements, its identification, selection
and implementation, Developing PLM Vision and PLM Strategy , Change management
for PLM 10
02 Product Design: Product Design and Development Process, Engineering Design,
Organization and Decomposition in Product Design, Typologies of Design Process
Models, Reference Model, Product Design in the Context of the Product Devel opment
Process, Relation with the Development Process Planning Phase, Relation with the Post
design Planning Phase, Methodological Evolution in Product Design, Concurrent
Engineering, Characteristic Features of Concurrent Engineering, Concurrent
Engineerin g and Life Cycle Approach, New Product Development (NPD) and
Strategies, Product Configuration and Variant Management, The Design for X System,
Objective Properties and Design for X Tools, Choice of Design for X Tools and Their
Use in the Design Process 09
03 Product Data Management (PDM): Product and Product Data, PDM systems and
importance, Components of PDM, Reason for implementing a PDM system, financial
justification of PDM, barriers to PDM implementation 05
04 Virtual Product Development Tools: For components, machines, and manufacturing
plants, 3D CAD systems and realistic rendering techniques, Digital mock -up, Model
building, Model analysis, Modeling and simulations in Product Design, Examples/Case
studies 05
05 Integration of Environmental Aspects in Product Design: Sustainable Development, 05

Page 87

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 86
Design for Environment, Need for Life Cycle Environmental Strategies, Useful Life
Extension Strategies, End -of-Life Strategies, Introduction of Environmental Strategies
into t he Design Process, Life Cycle Environmental Strategies and Considerations for
Product Design
06 Life Cycle Assessment and Life Cycle Cost Analysis: Properties, and Framework of
Life Cycle Assessment, Phases of LCA in ISO Standards, Fields of Application and
Limitations of Life Cycle Assessment, Cost Analysis and the Life Cycle Approach,
General Framework for LCCA, Evolution of Models for Product Life Cycle Cost
Analysis 05

Assessment :

Internal Assessment for 20 marks:
Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:
Weightage of each module in end semester examinat ion will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions , each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remain ing questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved .



REFERENCES:
1. John Stark, ―Product Lifecycle Management: Paradigm for 2 1st Century Product Realisation‖,
Springer -Verlag, 2004. ISBN: 1852338105
2. Fabio Giudice, Guido La Rosa, Antonino Risitano, ―Product Design for the environment -A life cycle
approach‖, Taylor & Francis 2006, ISBN: 0849327229
3. Saaksvuori Antti, Immonen Anselmie, ―Product Life Cycle Management‖, Springer, Dreamtech,
ISBN: 3540257314
4. Michael Grieve, ―Product Lifecycle Management: Driving the next generation of lean thinking‖,
Tata McGraw Hill, 2006, ISBN: 0070636265

Page 88

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 87
Course Code Course Name Credits
ILO 7012 Reliability Engineering 03

Objectives:
1. To familiarize the students with various aspects of probability theory
2. To acquaint the students with reliability and its concepts
3. To introduce the students to methods of estimating the system reliability of simple and complex
systems
4. To understand the various aspects of Maintainability, Availability and FMEA procedure
Outcomes: Learner will be able to…
1. Understand and apply the concept of Probability to engineering problems
2. Apply various reliability concepts to calculate different reliability parameters
3. Estimate the system reliability of simple and complex systems
4. Carry out a Failure Mode Effect and Criticality Analysis

Sr. No Detailed Contents Hrs
01 Probability theory: Probability: Standard definitions and concepts; Conditional
Probability, Baye‘s Theorem.
Probability Distributions: Central tendency and Dispersion; Binomial, Normal,
Poisson, Weibull, Exponential, relations between them and their significance.
Measures of Dispersion: Mean, Median, Mode, Range, Mean Deviation, Standard
Deviation, Variance, Skewness and Kurtosis. 08
02 Reliability Concepts: Reliability definitions, Importance of Reliability, Quality
Assurance and Reliability, Bath Tub Curve.
Failure Data Analysis: Hazard rate, failure density, Failure Rate, Mean Time To
Failure (MTTF), MTBF, Reliability Functions.
Reliability Hazard Models: Constant Failure Rate, Linearly increasing, Time
Dependent Failure Rate, Weibull Model. Distribution functions and re liability analysis. 08
03 System Reliability: System Configurations: Series, parallel, mixed configuration, k out
of n structure, Complex systems. 05
04 Reliability Improvement: Redundancy Techniques: Element redundancy, Unit
redundancy, Standby redundancies. Markov analysis.
System Reliability Analysis – Enumeration method, Cut -set method, Success
Path method, Decomposition method. 08
05 Maintainability and Availability: System downtime, Design for Maintainability:
Maintenance requirements, Design methods: Fault Isolation and self -diagnostics, Parts
standardization and Interchangeability, Modularization and Accessibility, Repair Vs
Replacement.
Availability – qualitative aspects. 05
06 Failure Mode, Effects and Criticality Analysis: Failure mode effects analysis,
severity/criticality analysis, FMECA examples. Fault tree construction, basic symbols,
development of functional reliability block diagram, Fau1t tree analysis and Event tree
Analysis 05



Page 89

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 88
Assessment :

Internal Assessment for 20 marks:
Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:
Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions , each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved .



REFERENCES:
1. L.S. Srinath, ―Reliability Engineer ing‖, Affiliated East -Wast Press (P) Ltd., 1985.
2. Charles E. Ebeling, ―Reliability and Maintainability Engineering‖, Tata McGraw Hill.
3. B.S. Dhillion, C. Singh, ―Engineering Reliability‖, John Wiley & Sons, 1980.
4. P.D.T. Conor, ―Practical Reliability Engg.‖, John Wiley & Sons, 1985.
5. K.C. Kapur, L.R. Lamberson, ―Reliability in Engineering Design‖, John Wiley & Sons.
6. Murray R. Spiegel, ―Probability and Statistics‖, Tata McGraw -Hill Publishing Co. Ltd.



Page 90

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 89
Course Code Course Name Credits
ILO 7013 Management Information System 03

Objectives:
1. The course is blend of Management and Technical field.
2. Discuss the roles played by information technology in today‘s business and define various
technology architectures on which information systems are built
3. Define and analyze typical functional information systems and identify how they meet the needs of
the firm to deliver efficiency and competitive advantage
4. Identify the basic steps in systems development
Outcomes: Learner will be able to…
1. Explain how information systems Transform Business
2. Identify the impact information systems have on an organization
3. Describe IT infrastructure and its components and its current trends
4. Understand the principal tools and technologies for accessing information from databases to
improve business performance and decision making
5. Identify the types of systems used for enterprise -wide knowledge management and how they provide
value for businesses

Sr. No. Detailed Contents Hrs
01 Introduction To Information Systems (IS): Computer Based Information Systems,
Impact of IT on organizations, Importance of IS to Society. Organizational Strategy,
Competitive Advantages and IS 4
02 Data and Knowledge Management: Database Approach, Big Data, Data warehouse and
Data Marts, Knowledge Management
Business intelligence (BI): Managers and Decision Making, BI for Data analysis and
Presenting Results 7
03 Ethical issues and Privacy: Information Security. Threat to IS, and Security Controls 7
04 Social Computing (SC): Web 2.0 and 3.0, SC in business -shopping, Marketing,
Operational and Analytic CRM, E -business and E -commerce – B2B B2C. Mobile
commerce. 7
05 Computer Networks Wired and Wireless technology, Pervasive computing, Cloud
computing model. 6
06 Information System within Organization: Transaction Processing Systems, Functional
Area Information System, ERP and ERP support of Business Process.
Acquiring Information Systems and Applications: Various System development life
cycle models. 8







Page 91

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

Assessment :

Internal Assessment for 20 marks:
Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:
Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions , each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved .



REFERENCES:
1. Kelly Rainer, Brad Prince, Management Information Systems, Wiley
2. K.C. Laudon and J.P. Laudon, Management Information Systems: Managing the Digital Firm, 10th
Ed., Prentice Hall, 2007.
3. D. Boddy, A. Boonstra, Managing Information Systems: Strategy and Organization, Prentice Hall,
2008

Page 92

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 91
Course Code Course Name Credits
ILO 7014 Design of Experiments 03

Objectives:
1. To understand the issues and principles of Design of Experiments (DOE)
2. To list the guidelines for designing experiments
3. To become familiar with methodologies that can be used in conjunction with experimental designs
for robustness and optimization

Outcomes: Learner will be able to…
1. Plan data collection, to turn data into information and to make decisions that lead to appropriate
action
2. Apply the methods taught to real li fe situations
3. Plan, analyze, and interpret the results of experiments

Sr. No Detailed Contents Hrs
01 Introduction
1.1 Strategy of Experimentation
1.2 Typical Applications of Experimental Design
1.3 Guidelines for Designing Experiments
1.4 Response Surface Methodology 06
02 Fitting Regression Models
2.1 Linear Regression Models
2.2 Estimation of the Parameters in Linear Regression Models
2.3 Hypothesis Testing in Multiple Regression
2.4 Confidence Intervals in Multiple Regression
2.5 Prediction of new response observation
2.6 Regression model diagnostics
2.7 Testing for lack of fit 08
03 Two -Level Factorial Designs
3.1 The 22 Design
3.2 The 23 Design
3.3 The General2k Design
3.4 A Single Replicate of the 2k Design
3.5 The Addition of Center Points to the 2k Design,
3.6 Blocking in the 2k Factorial Design
3.7 Split -Plot Designs 07
04 Two -Level Fractional Factorial Designs
4.1 The One -Half Fraction of the 2k Design
4.2 The One -Quarter Fraction of the 2k Design
4.3 The General 2k-p Fractional Factorial Design
4.4 Resolution III Designs
4.5 Resolution IV and V Designs
4.6 Fractional Factorial Split -Plot Designs 07
05 Response Surface Methods and Designs
5.1 Introduction to Response Surface Methodology 07

Page 93

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 92
5.2 The Method of Steepest Ascent
5.3 Analysis of a Second -Order Response Surface
5.4 Experimental Designs for Fitting Response Surfaces
06 Taguchi Approach
6.1 Crossed Array Designs and Signal -to-Noise Ratios
6.2 Analysis Methods
6.3 Robust design examples 04
Assessment :

Internal Assessment for 20 marks:
Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:
Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions , each carrying 20 marks
2. Question 1 will be compulsory and shoul d cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved .


REFERENCES:
1. Raymond H. Mayers, Douglas C. Montgomery, Christine M. Anderson -Cook , Response Surface
Methodology: Process and Product Optimization using Designed Experiment, 3rd edition, John
Wiley & Sons, New York, 2001
2. D.C. Montgomery, Design and Analysis of Experiments, 5t h edition, John Wiley & Sons, New York,
2001
3. George E P Box, J Stuart Hunter, William G Hunter, Statics for Experimenters: Design, Innovation
and Discovery, 2nd Ed. Wiley
4. W J Dimond, Peactical Experiment Designs for Engineers and Scintists, John Wiley and Sons Inc.
ISBN: 0 -471-39054 -2
5. Design and Analysis of Experiments (Springer text in Statistics), Springer by A.M. Dean, and D.
T.Voss

Page 94

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 93
Course Code Course Name Credits
ILO 7015 Operations Research 03

Objectives:
1. Formulate a real -world problem as a mathematical programming model.
2. Understand the mathematical tools that are needed to solve optimization problems.
3. Use mathematical software to solve the proposed models.
Outcomes: Learner will be able to…
1. Understand the theoretical workings of the simplex method, the relationship between a linear
program and its dual, including strong duality and complementary slackness.
2. Perform sensitivity analysis to determine the direction and magnitude of change of a model‘s optim al
solution as the data change.
3. Solve specialized linear programming problems like the transportation and assignment problems,
solve network models like the shortest path, minimum spanning tree, and maximum flow problems.
4. Understand the applications of in teger programming and a queuing model and compute important
performance measures

Sr. No. Detailed Contents Hrs
01 Introduction to Operations Research : Introduction, , Structure of the Mathematical
Model, Limitations of Operations Research
Linear Programming : Introduction, Linear Programming Problem, Requirements of
LPP, Mathematical Formulation of LPP, Graphical method, Simplex Method Penalty
Cost Method or Big M -method, Two Phase Method, Revised simplex method,
Duality , Primal – Dual construc tion, Symmetric and Asymmetric Dual, Weak Duality
Theorem, Complimentary Slackness Theorem, Main Duality Theorem, Dual Simplex
Method, Sensitivity Analysis
Transportation Problem : Formulation, solution, unbalanced Transportation problem.
Finding basic fea sible solutions – Northwest corner rule, least cost method and Vogel‘s
approximation method. Optimality test: the stepping stone method and MODI method.
Assignment Problem : Introduction, Mathematical Formulation of the Problem,
Hungarian Method Algorithm, Processing of n Jobs Through Two Machines and m
Machines, Graphical Method of Two Jobs m Machines Problem Routing Problem,
Travelling Salesman Problem
Integer Programming Problem : Introduction, Types of Integer Programming
Problems, Gomory‘s cutting plane Algorithm, Branch and Bound Technique .
Introduction to Decomposition algorithms. 14
02 Queuing models : queuing systems and structures, single server and multi -server
models, Poisson input, exponential service, constant rate service, finite and infinite
population 05
03 Simulation : Introduction, Methodology of Simulation, Basic Concepts, Simulation
Procedure, Application of Simulation Monte -Carlo Method: Introduction, Monte -Carlo
Simulation, Applications of Simulation, Advantages of Simulation, Limitations of
Simulation 05

Page 95

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 94
04 Dynamic programming . Characteristics of dynamic programming. Dynamic
programming approach for Priority Management employment smoothening, capital
budgeting, Stage Coach/Shortest Path, cargo loading and Reliability problems. 05
05 Game Theory . Competitive games, rectangular game, saddle point, minimax
(maximin) method of optimal strategies, value of the game. Solution of games with
saddle points, dominance principle. Rectangular games without saddle point – mixed
strategy fo r 2 X 2 games. 05
06 Inventory Models : Classical EOQ Models, EOQ Model with Price Breaks, EOQ with
Shortage, Probabilistic EOQ Model, 05

Assessment :

Internal Assessment for 20 marks:
Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:
Weightage of each module in end semester examination will be proportional to number of respe ctive lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions , each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved .


REFERENCES:
1. Taha, H.A. "Operations Research - An Introduction", Prentice Hall, (7th Edition), 2002.
2. Ravindran, A, Phillips, D. T and Solberg, J. J. "Operations Research: Principles and Practice", John
Willey and Sons, 2nd Edition, 2009
3. Hiller, F. S. and Liebermann, G. J. "Introduction to Operations Research", Tata McGraw Hill, 2002.
4. Operations Research, S. D. Sharma, KedarNath Ram Nath -Meerut
5. Operations Research, KantiSwarup, P. K. Gupta and Man Mohan, Sultan Chand & Sons

Page 96

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 95
Course Code Course Name Credits
ILO 7016 Cyber Security and Laws 03

Objectives:
1. To understand and identify different types cybercrime and cyber law
2. To recognized Indian IT Act 2008 and its latest amendments
3. To learn various types of security standards compliances
Outcomes: Learner will be able to…
1. Understand the concept of cybercrime and its effect on outside world
2. Interpret and apply IT law in various legal issues
3. Distinguish different aspects of cyber law
4. Apply Information Security Standards compliance during software design and development

Sr. No. Detailed Contents Hrs
01 Introduction to Cybercrime: Cybercrime definition and origins of the world,
Cybercrime and information security, Classifications of cybercrime, Cybercrime and the
Indian ITA 2000, A global Perspective on cybercrimes. 4
02 Cyber offenses & Cybercrime: How criminal plan the attacks, Social Engg, Cyber
stalking, Cyber café and Cybercrimes, Botnets, Attack vector, Cloud computing,
Proliferation of Mobile and Wireless Devices, Trends in Mobility, Credit Card Frauds in
Mobile and Wireless Computing Era, Security Challenges Posed by Mobile Devices,
Registry Settings for Mob ile Devices, Authentication Service Security, Attacks on
Mobile/Cell Phones, Mobile Devices: Security Implications for Organizations,
Organizational Measures for Handling Mobile, Devices -Related Security Issues,
Organizational Security Policies and Measure s in Mobile Computing Era, Laptops 9
03 Tools and Methods Used in Cyberline
Phishing, Password Cracking, Key loggers and Spywares, Virus and Worms,
Steganography, DoS and DDoS Attacks, SQL Injection, Buffer Over Flow, Attacks on
Wireless Networks, Phishi ng, Identity Theft (ID Theft) 6
04 The Concept of Cyberspace
E-Commerce , The Contract Aspects in Cyber Law ,The Security Aspect of Cyber Law
,The Intellectual Property Aspect in Cyber Law
, The Evidence Aspect in Cyber Law , The Criminal Aspect in Cyber Law, Global
Trends in Cyber Law , Legal Framework for Electronic Data Interchange Law Relating
to Electronic Banking , The Need for an Indian Cyber Law 8
05 Indian IT Act.
Cyber Crime and Criminal Justice: Penalties, Adjudication and Appeals Unde r the IT
Act, 2000, IT Act. 2008 and its Amendments 6
06 Information Security Standard compliances
SOX, GLBA, HIPAA, ISO, FISMA, NERC, PCI. 6





Page 97

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 96
Assessment :

Internal Assessment for 20 marks:
Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:
Weightage of each module in end semester examination will be proportional to number of r espective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions , each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved .



REFERENCES:
1. Nina Godbole, Sunit Belapure, Cyber Security , Wiley India, New Delhi
2. The Indian Cyber Law by S uresh T. Vishwanathan; Bharat Law House New Delhi
3. The Information technology Act, 2000; Bare Act - Professional Book Publishers, New Delhi.
4. Cyber Law & Cyber Crimes By Advocate Prashant Mali; Snow White Publications, Mumbai
5. Nina Godbole, Information Systems Security, Wiley India, New Delhi
6. Kennetch J. Knapp, Cyber Security &Global Information Assurance Information Science Publishing.
7. William Stallings , Cryptography and Network Security, Pearson Publication
8. Websites for more information is available on : The Information Technology ACT, 2008 - TIFR :
https://www.tifrh.res.in
9. Website for more information , A Compliance Primer for IT professional :
https://www.sans.org/reading -room/whitepapers/compliance/compliance -primer -professionals -33538

Page 98

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 97
Course Code Course Name Credits
ILO 7017 Disaster Management and Mitigation Measures 03

Objectives:
1. To understand physics and various types of disaster occurring around the world
2. To identify extent and damaging capacity of a disaster
3. To study and understand the means of losses and methods to overcome /minimize it.
4. To understand role of individual and various organization during and after disaster
5. To understand application of GIS in the field of disaster management
6. To understand the emerg ency government response structures before, during and after disaster
Outcomes: Learner will be able to…
1. Get to know natural as well as manmade disaster and their extent and possible effects on the
economy.
2. Plan of national importance structures based upon the previous history.
3. Get acquainted with government policies, acts and various organizational structure associated
with an emergency.
4. Get to know the simple do‘s and don‘ts in such extreme events and act accordingly.

Sr. No. Detailed Contents Hrs
01 Introduction
1.1 Definition of Disaster, hazard, global and Indian scenario, general perspective,
importance of study in human life, Direct and indirect effects of disasters, long
term effects of disasters. Introduction to global warming and climate change. 03
02 Natural Disaster and Manmade disasters:
2.1 Natural Disaster: Meaning and nature of natural disaster, Flood, Flash flood,
drought, cloud burst, Earthquake, Landslides, Avalanches, Volcanic eruptions,
Mudflow, Cyclone, Storm, Storm Surge, climate change, global warming, sea
level rise, ozone depletion
2.2 Manmade Disasters: Chemical, Industrial, Nuclear and Fire Hazards. Role of
growing population and subsequent industrialization, urbanization and changing
lifestyle of human beings in frequent occurrences of manmade disasters. 09
03 Disaster Ma nagement, Policy and Administration
3.1 Disaster management: meaning, concept, importance, objective of disaster
management policy, disaster risks in India, Paradigm shift in disaster
management.
3.2 Policy and administration:
Importance and principles of disaster management policies, command and co -
ordination of in disaster management, rescue operations -how to start with and
how to proceed in due course of time, study of flowchart showing the entire
process. 06
04 Institutional Framework for Disaster Management in India:
4.1 Importance of public awareness, Preparation and execution of emergency
management program. Scope and responsibilities of National Institute of Disaster
Management (NIDM) and National disaster management authority (NDMA) in
India. Methods and measures to avoid disasters, Management of casualties, set up
of emergency facilities, importance of effective communication amongst different
agencies in such situations.
4.2 Use of Internet and softwares for effective disaster management. Applications of
GIS, Remote sensing and GPS in this regard. 06
05 Financing Relief Measures: 09

Page 99

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 98
5.1 Ways to raise finance for relief expenditure, role of government agencies and
NGO‘s in this process, Legal aspects relat ed to finance raising as well as overall
management of disasters. Various NGO‘s and the works they have carried out in
the past on the occurrence of various disasters, Ways to approach these teams.
5.2 International relief aid agencies and their role in e xtreme events.
06 Preventive and Mitigation Measures:
6.1 Pre -disaster, during disaster and post -disaster measures in some events in general
6.2 Structural mapping: Risk mapping, assessment and analysis, sea walls and
embankments, Bio shield, shelters, early warning and communication
6.3 Non Structural Mitigation: Community based disaster preparedness, risk transfer
and risk financing, capacity development and training, awareness and education,
contingency plans.
6.4 Do‘s and don‘ts in case of disasters and effective implementation of relief aids. 06

Assessment :

Internal Assessment for 20 marks:
Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:
Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions , each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other th an module 3)
4. Only Four questions need to be solved .

REFERENCES:
1. ‗Disaster Management‘ by Harsh K.Gupta, Universities Press Publications.
2. ‗Disaster Management: An Appraisal of Institutional Mechanisms in India‘ by O.S.Dagur, published
by Centre for land wa rfare studies, New Delhi, 2011.
3. ‗Introduction to International Disaster Management‘ by Damon Copolla, Butterworth Heinemann
Elsevier Publications.
4. ‗Disaster Management Handbook‘ by Jack Pinkowski, CRC Press Taylor and Francis group.
5. ‗Disaster management & rehabilitation‘ by Rajdeep Dasgupta, Mittal Publications, New Delhi.
6. ‗Natural Hazards and Disaster Management, Vulnerability and Mitigation – R B Singh, Rawat
Publications
7. Concepts and Techniques of GIS –C.P.Lo Albert, K.W. Yonng – Prentice Hall (India) P ublications.

(Learners are expected to refer reports published at national and International level and updated information
available on authentic web sites)







Page 100

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


Course Code Course Name Credits
ILO 7018 Energy Audit and Management 03

Objectives:
1. To understand the importance energy security for sustainable development and the fundamentals of
energy conservation.
2. To introduce performance evaluation criteria of various electrical and thermal installations to
facilitate the energy manageme nt
3. To relate the data collected during performance evaluation of systems for identification of energy
saving opportunities.

Outcomes: Learner will be able to…
1. To identify and describe present state of energy security and its importance.
2. To identify and describe the basic principles and methodologies adopted in energy audit of an utility.
3. To describe the energy performance evaluation of some common electrical installations and identify
the energy saving opportunities.
4. To describe the energy performance e valuation of some common thermal installations and identify
the energy saving opportunities
5. To analyze the data collected during performance evaluation and recommend energy saving
measures

Sr. No Detailed Contents Hrs
01 Energy Scenario:
Present Energy Scenario, Energy Pricing, Energy Sector Reforms, Energy Security,
Energy Conservation and its Importance, Energy Conservation Act -2001 and its
Features. Basics of Energy and its various forms, Material and Energy balance 04
02 Energy Audit Principles:
Definition, Energy audit - need, Types of energy audit, Energy management (audit)
approach -understanding energy costs, Bench marking, Energy performance, Matching
energy use to requirement, Maximizing system efficiencies, Optimizing the input
energy requirements, Fuel and energy substitution. Elements of monitoring& targeting;
Energy audit Instruments; Data and information -analysis.
Financial analysis techniques: Simple payback period, NPV, Return on investment
(ROI), Internal rate of return ( IRR) 08
03 Energy Management and Energy Conservation in Electrical System:
Electricity billing, Electrical load management and maximum demand Control; Power
factor improvement, Energy efficient equipments and appliances, star ratings.
Energy efficiency measures in lighting system, Lighting control: Occupancy sensors,
daylight integration, and use of intelligent controllers.
Energy conservation opportunities in: water pumps, industrial drives, induction motors,
motor retrofitting, soft starters, variabl e speed drives. 10
04 Energy Management and Energy Conservation in Thermal Systems:
Review of different thermal loads; Energy conservation opportunities in: Steam
distribution system, Assessment of steam distribution losses, Steam leakages, Steam
trappin g, Condensate and flash steam recovery system.
General fuel economy measures in Boilers and furnaces, Waste heat recovery, use of
insulation - types and application. HVAC system: Coefficient of performance, Capacity, 10

Page 101

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 100
factors affecting Refrigeration and Air Conditioning system performance and savings
opportunities.
05 Energy Performance Assessment:
On site Performance evaluation techniques, Case studies based on: Motors and variable
speed drive, pumps, HVAC system calculations; Lighting System: Installed Load
Efficacy Ratio (ILER) method, Financial Analysis. 04
06 Energy conservation in Buildings:
Energy Conservation Building Codes (ECBC): Green Building, LEED rating,
Application of Non -Conventional and Renewable Energy Sources 03

Assessment :

Internal Assessment for 20 marks :
Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:
Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions, each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved.


REFERENCES:
1. Handbook of Electrical Installation Practice, Geofry Stokes, Blackwell Science
2. Designing with light: Lighting Handbook, By Anil Valia, Lighting System
3. Energy Management Handbook, By W.C. Turner, John Wiley and Sons
4. Handbook on Energy Audits and Management, edited by A. K. Tyagi, Tata Energy Research
Institute (TERI).
5. Energy Management Principles, C.B.Smith, Pergamon Press
6. Energy Conservation Guidebook, Dale R. Patrick, S. Fardo, Ray E. Richardson, Fairmont Pr ess
7. Handbook of Energy Audits, Albert Thumann, W. J. Younger, T. Niehus, CRC Press
8. www.energymanagertraining.com
9. www.bee -india.nic.in





Page 102

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

Course Code Course Name Credits
ILO7019 Development Engineering 03

Objectives:
1. To understand the characteristics of rural Society and the Scope, Nature and Constraints of rural
Development.
2. To study Implications of 73rd CAA on Planning, Development and Governance of Rural Areas
3. An exploration of human values, which go into making a ‗good‘ human being, a ‗good‘ professional,
a ‗good‘ society and a ‗good life‘ in the context of work life and the personal life of modern Indian
professionals
4. To understand the Nature and Type of Human Values relevant to Planning Institutions

Outcomes: Learner will be able to…
1. Apply knowledge for Rural Development.
2. Apply knowledge for Management Issues.
3. Apply knowledge for Initiatives and Strategies
4. Develop acumen for higher education and research.
5. Master the art of working in group of different nature.
6. Dev elop confidence to take up rural project activities independently

Sr. No. Module Contents Hrs
01 Introduction to Rural Development Meaning, nature and scope of devel opment;
Nature of rural society in India; Hierarchy of settlements; Social, economic and
ecological co nstraints for rural development Roots of Rural Development in
India Rural reconstruction and Sarvodaya programme before independence;
Impact of voluntary effort and Sarvodaya Movement on rural development;
Constitutional direction, directive principles; Panchayati Raj - beginning of
planning and community development; National extension services. 08
02 Post-Independence rural Development Balwant Rai Mehta Committee - three
tier system of rural local Government; Need and scope for people‘s
participation and Panchayati Raj; Ashok Mehta Committee - linkage between
Panchayati Raj, participation and rural development 04
03 Rural Development Initiatives in Five Year Plans Five Year Plans and Rural
Development; Planning process at National, State, Regional and District levels;
Planning , development, implementing and monitoring organizations and
agencies; Urban and rural interface - integrated approach and local plans;
Development initiatives and their convergence; Special component plan an d
sub-plan for the weaker section; Micro -eco zones; Data base for local planning;
Need for decentralized planning; Sustainable rural development. 06
04 Post 73rd Amendment Scenario 73rd Constitution Amendmen t Act, including -
XI schedule, devolution of powers, func tions and finance; Panchayati Raj
institut ions - organizational linkages; Recent changes in rural local planning;
Gram Sabha - revitalized Pancha yati Raj; Institutionalization; resource
mapping, resource mobilization including social mobilizat ion; Informat ion
Technology and rural planning; Need for further amendments. 04
05 Values and Science and Technology Material development and its values; the
challenge of science and technology; Values in planning profession, research
and education. 10

Page 103

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 102
Types of Values Psychological values — integrated personality; mental health;
Societal values — the modern search for a good society; justice, democracy,
rule of law, values in the Indian constitution;
Aesthetic values — perception and enjoyment of beauty; Moral and ethic al
values; nature of moral judgment; Spiritual values; different concepts; secular
spirituality; Relative and absolute values;
Human values — humanism and human values; human rights; human values as
freedom, creativity, love and wisdom.
06 Ethics Canons of ethics; ethics of virtue; ethics of duty; ethics of responsibility;
Work ethics;
Professional ethics; Ethics in planning profession, research and education 04


Assessment:

Internal Assessment for 20 marks:
Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately
40% but excluding contents covered in Test I)

End Semester Examination:
Weightage of each module in end semester examination will be proportional to nu mber of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions , each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved


Reference s:
1. ITPI, Village Planning and Rural Development, ITPI, Ne w Delhi
2. Thooyavan, K.R. Human Settlements: A 2005 MA Publication, Chennai
3. GoI, Constitution (73rd GoI, New Delhi Amendment) Act, GoI, New Delhi
4. Planning Commission, Five Year Plans, Planning Commission
5. Planning Commission, Manual of Integrated District Pla nning, 2006, Planning Commission
New Delhi
6. Planning Guide to Beginners
7. Weaver, R.C., The Urban Complex, Doubleday.
8. Farmer, W.P. et al, Ethics in Planning, American Planning Association, Washington.
9. How, E., Normative Ethics in Planning, Journal of Planning Literature, Vol.5, No.2, pp. 123 -150.
10. Watson, V. , Conflicting Rationalities: -- Implications for Planning Theory and Ethics, Planning
Theory andPractice, Vol. 4, No.4, pp.395 – 407






Page 104

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


Lab Code Lab Name Credits
CSL701 Digital Signal and Image Processing Lab 1

Lab Outcome: The learner will be able to
1. Sample and reconstruct the signal.
2. Implement and apply operations like Convolution, Correlation, DFT and FFT on DT signals
3. Implement spatial domain Image enhancement techniques.
4. Implement Edge detection techniques using first order derivative filters.

Description:
Implementation of programs can be in C or C++ or any computational software. A List of ten experiments is
given below, are needed to be performed covering all syllabus modules. Additional experiments within the
scope of the syllabus can be added.

Suggested List of Experiments:
1. Sampling and Reconstruction
2. To perform Discrete Correlation
3. To perform Discrete Convolution
4. To perform Discrete Fourier Transform
5. To perform Fast Fourier Transform
6. Implementation of Image negative, Gray level Slicing and Thresholding
7. Implementation of Contrast Stretching ,Dynamic range compression & Bit plane Slicing
8. Implementation of Histogram Processing
9. Implementation of Image smoothing/ Image s harpening
10. Implementation of Edge detection using Sobel and Previtt masks

Term Work:
 Laboratory work will be based on above syllabus of CSC701 - ‗Digital Signal and Image Processing‘
with minimum 10 experiments to be incorporated.
 The distribution of marks for term work shall be as follows:
Lab Performance 15 Marks
Assignments 05 Marks
Attendance (Theory & practical) 05 Marks







Page 105

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

Lab Code Lab Name Credits
CSL702 Mobile Application Development Lab 1

Lab Outcome:
1. To develop and demonstrate mobile applications using various tools
2. Students will articulate the knowledge of GSM, CDMA & Bluetooth technologies and demonstrate
it.
3. Students will able to carry out simulation of frequency reuse , hidden terminal problem
4. To develop security algorithm s for mobile communication network
5. To demonstrate simulation and compare the performance of Wireless LAN
6. To implement and demonstrate mobile node discovery and route maintains.

Description: The softwares like Android Studio, J2ME, NS2, NS3 and any othe r software which is suitable
are recommended for performing the practical s.


Suggested List of Experiments:

Sr. No. Title of Experiments
01 To understand the cellular frequency reuse concept to find the co -channel cells for a
particular cell. Design a game based application on the above concept.
02 To understand the cellular frequency reuse concept to find the cell clusters within certain
geographic area.
Design a game based application on the above concept.
03 Implementation a Bluetooth network with application as transfer of a file from one device
to another .
04 To implement a basic function of Code Division Mul tiple Access (CDMA) to test the
orthogonality and autocorrelation of a code to be used for CDMA operation. Write an
application based on the above concept.
05 To implement Mobile node discovery
06 Implementation of GSM security algorithms (A3/A5/A8)
07 Illustration of Hidden Terminal Problem (NS -2)
Consider two Wifi base stations (STA) and an access point (AP) located along the x -axis. All
the nodes are fixed. The AP is situated at the middle of the two STA, the distance of
separation being 150 m. [variable]. Node #0 and node #1 are the hidden terminals. Both are
transmitting some data to the AP (almost at same rate) at the same time. Th e loss across the
wireless link between each STA and the AP is fixed at 50 dB irrespective of the distance of
separation .

To study how RTS/CTS helps in wireless networks,
1. No RTS/CTS is being sent.
2. Nodes do exchange RTS/CTS packets.
Compare the no. of packet retransmissions required in both the cases (as obtained in
the output) and compare the results.

Page 106

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 105
08 To setup & configuration of Wireless Access Point (AP) using NS3. Analyze the Wi -Fi
communication range in the presence of the access point (AP) and the base station (BS).
Consider BS and AP are static. Find out the maximum distance to which two way
communications is possible. Try multiple iterations by adjusting its distance in the code and
test it.
09 Develop an application that writes data to the S D card.
10 Develop an application that uses GUI components.
11 Write an application that draws basic graphical primitives on the screen.
12 Develop an application that makes use of database.
13 Develop a native application that uses GPS location information.
14 Implement an application that creates an alert upon receiving a message.
15 Implementation of income tax/loan EMI calculator and deploy the same on real devices.

Digital Material (if Any):
1. http://www.isi.edu/nsnam/ns/ : NS-2 software download
2. https://nsnam.isi.edu/nsnam/index.php/NS_manual
3. https://www.nsnam.org/ : Ns-3 Software Download
4. http://vlssit.iitkgp.ernet.in/ant/ant/


Text Books:
1. Jochen Schilller,‖Mobile Communication ―, Addisi on wisely,Pearson Education
2. ―Wireless Communications & Networks,‖ By William Stallings, Second Edit ion, Pearson Education
3. Ekram Hossain and Teerawat Issariyakul, ―Introduction to Network Simulator NS -2,‖ Springer ,
Second Edition.
4. Michael Burton, ―Android Appliocation Development for Dummies, ― A wiley brand
5. Marko Gargenta & Masumi Nakamura, ― Learning Andr oid,‖ O‘reilly publications
6. James Keogh, ―The complete re ference J2ME, ― Mcgraw -Hill.

Term Work:
Laboratory work will be based on above syllabus with minimum 10 experiments to be incorporated.
Laboratory work (experiments): ………………… (15) Marks.
Assignments: ………………………… ............... (05) Marks.
Attendance (Theory + Practical)…………………… (05) Marks
TOTAL: …………………………………………… (25) Marks.


Oral & Practical exam will be based on the above and CSC702 : Mobile Communication & Computing
syllabus.

Page 107

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

Lab Code Lab Name Credits
CSL703 Artificial Intelligence & Soft Computing Lab 1

Lab Outcomes: Learner will be able to
1 To realize the basic techniques to build intelligent systems
2 To create knowledge base and apply appropriate search techniques used in problem solving.
3 Apply the supervised/unsupervised learning algorithm.
4 Design fuzzy controller system.

Description: The current applications from almost all domains, like games, robots, expert system,
optimiza tion or even the search engines are becoming smarter. We have moved to the era of knowledge
processing from data and information processing. Therefore learning these technologies practically is very
essential for a student to gain the proficiency. They wil l also learn and be able to appreciate the use of fusion
of basic techniques.
LAB Topic / Activity Explanation of Activity
Lab 1  Identify the problem
 PEAS Description
 Problem formulation Select a problem statement relevant to
AI
Lab 2 Introduce AI programming Language Introduce PROLOG programming.
Lab 3  Start Implementation
 Knowledge Representation and Create
Knowledge Base Use AI programming languages
Or
C/JAVA
Lab 4 Implement search algorithms to reach goal
state Identify and analyse Algorithm to
solve the problem
Lab 5 To implement Mc -Culloch Pitts Model for a
problem Apply to solve AND / OR/ XOR, etc.
Lab 6 To implement Fuzzy Controller system Design an automobile or washing
machine controller, etc. and implement
Lab 7 To implement Basic Supervised /
Unsupervised Neural Network learning rules
for a problem. Design a NN using a learning method to
generate knowledge for classification.
Lab 8 Case study on Hybrid Systems Study the designing of Neuro Fuzzy
systems
Lab 9 Case study of an Application Printed Character Recognition, Face
Recognition, etc.

Page 108

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


Term Work:
1. Labs 1 -4 are to design and implement an intelligent system using AI techniques .
2. Labs 5 -7 are to design and implement an Intelligent System using SC techniques.
3. Perform any one from Lab 8 and lab 9.

The distribution of marks for term work shall be as follows:
Lab Performance (Experiments /case studies): 15
Assignment 05
Attendance (Theory & Practical) 05

Oral exam ination will be based on the abo ve and CSC703 : ‗AI and SC ‘ Syllabus.
















Page 109

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


Lab Code Lab Name Credits
CSL703 Computational Lab -I 1


Lab Outcome: After successful completion of this course student will be able to:
1. Acquire practical knowledge within the chosen area of technology for project development.
2. Identify, discuss and justify the technical aspects of the chosen project with a comprehensive and
systematic approach.

Description:
Design and implementation of any case study/ applications /experiments / mini project based on
departmental level optional courses using modern tools.

Term work:
The distribution of marks for term work shall be as follows:
Lab/ Experimental Work : 15
Report/ Documentation : 05
Attendance (Theory & Practical) : 05

Practical & Oral examination is to be conducted based on respective departmental level optional courses by
pair of internal and external examiners appointed by the University of Mumbai.














Page 110

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

Course Code Title Credit
CSP705 Major Project - I 3

Objective: The Project work e nables students to develop further skills and knowledge gained during the
programme by applying them to the analysis of a specific problem or issue, via a substantial piece of work
carried out over an extended period. For students to demonstr ate proficiency in the design of a research
project, application of appropriate research methods, collection and analysis of data and presentation of
results.

Guidelines:
1. Project Topic:
 To proceed with the project work it is very important to select a rig ht topic. Project can be
undertaken on any subject addressing IT programme. Research and development projects on
problems of practical and theoretical interest should be encouraged.
 Project work must be carried out by the group of at least two students an d maximum three and must
be original.
 Students can certainly take ideas from anywhere, but be sure that they should evolve them in the
unique way to suit their project requirements.
 The project work can be undertaken in a research institute or organizat ion/company/any business
establishment.
 Student must consult internal guide along with external guide (if any) in selection of topic.
 Head of department and senior staff in the department will take decision regarding selection of
projects.
 Student has to submit weekly progress report to the internal guide and where as internal guide has to
keep track on the progress of the project and also has to maintain attendance report. This progress
report can be used for awarding term work marks.
 In case of industr y projects, visit by internal guide will be preferred.

2. Project Report Format:
At the end of semester a project report should preferably contain at least following details: -
 Abstract
 Introduction
 Literature Survey
o Survey Existing system
o Limitation Existing system or research gap
o Problem Statement and Objective
o Scope
 Proposed System
o Analysis/Framework/ Algorithm
o Details of Hardware & Software
o Design details
o Methodology (your approach to solve the problem)

Page 111

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 110
 Implementation Plan for next s emester
 Conclusion
 References

3. Term Work:
Distribution of marks for term work shall be as follows:
a. Weekly Attendance on Project Day
b. Project work contribute
c. Project Report (Spiral Bound)
d. Term End Presentation (Internal)

The final certification and acceptance of TW ensures the satisfactory performance on the above aspects.

4. Oral & Practical :
Oral &Practical examination of Project -I should be conducted by Internal and External examiners
approved by University of Mumbai. S tudents have to give presentation and demonstration on the Project -
I.





























Page 112

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

Course Code Course Name Credits
CSC801
Human Machine Interaction 4

.Course Objectives: At the end of the course, students will be able to –
1. Learn the foundation of human machine interaction.
2. Understand the importance of human psychology in designing good interfaces.
3. Be aware of mobile in teraction design and its usage in day – to – day activities.
4. Understand various design technologies to meet user requirements.
5. Encourage to indulge into research in Machine Interaction Design.

Course Outcomes: At the end of the course, the students will be able to -
1. Identify User Interface (UI) design principles.
2. Analysis of effective user friendly interfaces.
3. Apply Interactive Design process in real world applications.
4. Evaluate UI design and justify.
5. Create application for social and technical task.

Pre-requisites: Web Technologies; Software Engineering; Experience in designing interfaces for
applications and web sites. Basic knowledge of designing tools and languages like HTML, Java, etc

Module
No. Topics Hrs.
1.0 FOUNDATIONS OF HMI:
The Human: History of User Interface Designing, I/O channels, Hardware, Software
and Operating environments, The Psychopathology of everyday Things, Psychology of
everyday actions, Reasoning and problem solving . The computer: Devices, Memory,
processing and networks. Interaction: Models, frameworks, Ergonomics, styles,
elements, interactivity, Paradigms. 8
2.0 DESIGN & SOFTWARE PROCESS :
Mistakes performed while designing a computer system, Human interaction with
computers, importance of human characteristics human consideration, Human
interaction speeds .Interactive Design basics, process, scenarios, navigation, Iteration
and pr ototyping. HMI in software process: software life cycle, usability engineering,
Prototyping in practice, design rationale. Design rules: principles, standards, guidelines,
rules. Recognize the goals, Goal directed design process. Evaluation Techniques:
Universal Design. 10
3.0 GRAPHICAL USER INTERFACE:
The graphical User Interface: Popularity of graphics, the concept of direct manipulation,
graphical systems, Characteristics. Web user Interface: Interface popularity,
characteristics. The merging of graphic al Business systems and the Web. Principles of
user interface design. 8

Page 113

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 112
4.0 SCREEN DESIGNING :
Design goals , Screen planning and purpose, organizing screen elements, ordering of
screen data and content , screen navigation and flow, Visually pleasing composition,
amount of information, focus and emphasis, presentation information simply and
meaningfully, information retrieval on web, statistical graphics, Technological
consideration in interface design. 10
5.0 INTERFACE DESIGN FOR MOBILE DEVICES :
Mobile Ecosystem: Platforms, Application frameworks: Types of Mobile Applications:
Widgets, Applications, Games, Mobile Information Architecture, Mobile 2.0, Mobile
Design: Elements of Mobile Design, Tools. 8
6.0 INTERACTION STYLES AND COMMUNICATION :
Windows:Characteristics, Components, Presentation styles, Types of Windows,
Management, operations. Text messages: Words, Sentences, messages and text words,
Text for web pages. Icons, Multimedia and colors 8
Total 52


Text Books:
1. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale, ―Human Computer Interaction‖, 3rdEdition,
Pearson Education, 2004.
2. Wilbert O. Galitz, ―The Essential Guide to User Interface Design‖, Wiley publication.
3. Alan Cooper, Robert Reimann, David Cronin, ―About Face3: Essentia ls of Interaction design‖,
Wiley publication.
4. Jeff Johnson, ―Designing with the mind in mind‖, Morgan Kaufmann Publication.
5. Donald A. Normann, ― Design of everyday things‖, Basic Books; Reprint edition 2002.
6. Brian Fling, ―Mobile Design and Development‖, Fir st Edition , O‘Reilly Media Inc., 2009.

Reference Books:
1. Rogers Sharp Preece,‖Interaction Design:Beyond Human Computer Interaction‖,,Wiley.
2. Guy A. Boy ―The Handbook of Human Machine Interaction‖, Ashgate publishing Ltd.
3. Kalb ande,Kanade,Iyer,‖Galitz‘s Human Machine Interaction‖, Wiley Publications.


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

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


Page 114

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


Course Code Course Name Credits
CSC802 Distributed Computing 04

Course objectives:
1. To provide students with contemporary knowledge in distributed systems
2. To equip students with skills to analyze and design distributed applications.
3. To provide master skills to measure the performance of distributed synchronization algorithms

Course ou tcomes: On successful completion of course learner will be able to:
1. Demonstrate knowledge of the basic elements and concepts related to distributed system
technologies;
2. Illustrate the middleware technologies that support distributed applications such as RPC, RMI and
Object based middleware.
3. Analyze the various techniques used for clock synchronization and mutual exclusion
4. Demonstrate the concepts of Resource and Process management and synchronization algorithms
5. Demonstrate the concepts of Consistency and Replication Management
6. Apply the knowledge of Distributed File System to analyze various file systems like NFS, AFS and
the experience in building large -scale distributed applications.
Prerequisite: Java Pro gramming, Operating Systems, Computer Networks
Module
No. Unit
No. Topics Hrs.
1.0 Introduction to Distributed Systems 06
1.1 Characterization of Distributed Systems: Issues, Goals, and Types of
distributed systems, Distributed System Models, Hardware concepts,
Software Concept.
1.2 Middleware: Models of Middleware, Services offered by middleware,
Client Server model.
2.0 Communication 10
2.1 Layered Protocols, Interprocess communication (IPC): MPI, Remote
Procedure Call (RPC), Remote Object Invocation, Remote Method
Invocation (RMI)
2.2 Message Oriented Communication, Stream Oriented Communication,
Group Communication
3.0 Synchronization 10
3.1 Clock Synchronization, Logical Clocks, Election Algorithms, Mutual
Exclusion, Distributed Mutual Exclusion -Classification of mutual
Exclusion Algorithm, Requirements of Mutual Exclusion Algorithms,
Performance measure.
3.2 Non Token based Algorithms: Lamport Algorithm, Ricart –Agrawala‘s
Algorithm, Maekawa‘s Algorithm
3.3 Token Based Algorithms: Suzuki -Kasami‘s Broardcast Algorithms,
Singhal‘s Heurastic Algorithm, Raymond‘s Tree based Algorithm,
Comparative Performance Analysis.
4.0 Resource and Process Management 06
4.1 Desirable Features of global Scheduling algorithm, Task assignment
approach, Load balancing approach, load sharing approach
4.2 Introduction to process management, process migration, Threads,

Page 115

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 114
Virtualization, Clients, Servers, Code Migration
5.0 Consistency, Replication and Fault Tolerance 08
5.1 Introduction to replication and consistency, Data -Centric and Client -
Centric Consistency Models, Replica Management
5.2 Fault Tolerance: Introduction, Process resilience, Reliable client -server and
group communication, Recovery
6.0 Distributed File Systems and Name Services 12
6.1 Introduction and features of DFS, File models, File Accessing models,
File-Caching Schemes, File Replication, Case Study: Distributed File
Systems (DSF), Network File System (NFS), Andrew File System (AFS)
6.2 Introduction to Name services and Domain Name System, Directory
Services, Case Study: The Global Name Service, The X.500 Directory
Service
6.3 Designing Distributed Systems: Google Case Study
Total 52


Assessment:

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

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


Text Books:
1. Andrew S. Tanenbaum and Maarten Van Steen, ―Distributed Systems: Principles and Paradigms, 2nd
edition, Pearson Education.
2. George Coulouris, Jean Dollimore, Tim Kindberg, , "Distributed Systems: Concepts and Design",
4th Edition, Pearson Education, 2005.

Reference Books:
1. A. S. Tanenbaum and M. V. Steen, "Distributed Systems: Principles and Paradigms", Second
Editio n, Prentice Hall, 2006.
2. M. L. Liu, ―Distributed Computing Principles and Applications‖, Pearson Addison Wesley, 2004.








Page 116

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

Course Code Course Name Credit
DLO8011 High Performance Computing 04

Course Objectives:
1. To learn concepts of parallel processing as it pertains to high -performance computing.
2. To design, develop and analyze parallel programs on high performance computing resources using
parallel programming paradigms.

Course Outcomes: Learner will be able to -
1. Memorize parallel processing approaches
2. Describe different parallel processing platforms involved in achieving High Performance Computing.
3. Discuss different design issues in parallel programming
4. Develop efficient and high performance parallel programming
5. Learn parallel programming using message passing paradigm using open source APIs.

Prerequisite: Computer Organization
Sr.No. Module Detailed Content Hours
1 Introduction Introduction to Parallel Computing: Motivating
Parallelism, Scope of Parallel Computing, Levels of
parallelism (instruction, transaction, task, thread, memory,
function)
Classification Models : Architectural Schemes (Flynn‘s,
Shore‘s, Feng‘s, Handler‘s) and Memory access (Shared
Memory, Dist ributed Memory, Hybrid Distributed Shared
Memory)
Parallel Architectures: Pipeline Architecture, Array
Processor, Multiprocessor Architecture, Systolic
Architecture, Data Flow Architecture 6
2 Pipeline
Processing Introduction, Pipeline Performance, Arit hmetic Pipelines,
Pipeline instruction processing, Pipeline stage design,
Hazards, Dynamic instruction scheduling 8
3 Parallel
Programming
Platforms Parallel Programming Platforms: Implicit Parallelism:
Trends in Microprocessor & Architectures, Limitations of
Memory System Performance, Dichotomy of Parallel
Computing Platforms, Physical Organization of Parallel
Platforms, Communication Costs in Parallel Machines 10

4 Parallel
Algorithm
Design Principles of Parallel Algorithm Design: Preliminari es,
Decomposition Techniques, Characteristics of Tasks and
Interactions, Mapping Techniques for Load Balancing,
Methods for Containing Interaction Overheads, Parallel
Algorithm Models 12

Page 117

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 116
5 Performance
Measures Performance Measures : Speedup, execution time,
efficiency, cost, scalability, Effect of granularity on
performance, Scalability of Parallel Systems, Amdahl‘s
Law, Gustavson‘s Law, Performance Bottlenecks 6




6




HPC
Programming Programming Using the Message -Passing Paradigm:
Principles of Message Passing Programming, The Building
Blocks: Send and Receive Operations

MPI: the Message Passing Interface, Topology and
Embedding, Overlapping Communication with
Computation, Collective Communication and Computation
Operations, Introduction to Ope nMP 10

Text Books:
1. AnanthGrama, Anshul Gupta, George Karypis, Vipin Kumar , ―Introduction to Parallel Computing‖,
Pearson Education, Second Edition, 2007.
2. M. R. Bhujade, ―Parallel Computing‖, 2nd edition, New Age International Publishers, 2009.
3. Kai Hwang, Naresh Jotwani, ―Advanced Computer Architecture: Parallelism, Scalability,
Programmability‖, McGraw Hill, Second Edition, 2010.
4. Georg Hager, Gerhard Wellein, ―Introduction to High Performance Computing for Scientists and
Engineers", Chapman & H all / CRC Computational Science series, 2011.

Reference Books:
1. Michael J. Quinn, ―Parallel Programming in C with MPI and OpenMP‖, McGraw -Hill International
Editions, Computer Science Series, 2008.
2. Kai Hwang, Zhiwei Xu, ―Scalable Parallel Computing: Technology, Architecture, Programming‖,
McGraw Hill, 1998.
3. Laurence T. Yang, MinyiGuo, ―High - Performance Computing: Paradigm and Infrastructure‖ Wiley,
2006.

Internal Assessment: Assessment consists of two tests out of which; one should be compulsory class test
(on minimum 02 Modules) and the other is either a class test or assignment on live problems or course
project.
Theory Examination:
1. Question paper will comprise of total six questions.
2. All question carry equal marks.
3. Questions will be mixed in na ture (for example supposed Q.2 has part (a) from module 3 then part
(b) will be from any module other than module 3).
4. Only Four question need to be solved.

Page 118

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


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


Laboratory Work:

Description: The Laboratory Work (Experiments) for this course is required to be performed and to be
evaluated in CSL803: Computational Lab -II

Suggested Experiment List:
Sr.
No. Detailed Content
1 Execution of Simple Hello world program on MPI platform
2 a. Program to send data and receive data to/from processors using MPI
b. Program illustrating Broadcast of data using MPI
3 Implement a parallel program to demonstrate the cube of N number within a set range.
4 Write a parallel program for area of a circle/triangle
5 Implement a program to demonstrate balancing of workload on MPI platform
6 Using directives of MPI/OpenMP implement parallel programming for calculator application
(add, sub, multiplication and division)
7 Mini Project
Evaluate performance enhancement of HPC for any of the following:
One-Dimensional Matrix -Vector Multiplication/ Single -Source Shortest -Path/ Sample
Sort/Two -Dimensional Matrix -Vector Multiplication














Page 119

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

Course Code Course Name Credits
DLO801 2 Natural Language Processing 4

Course objectives:
1. To understand natural language processing and to learn how to apply basic algorithms in this field.
2. To get acquainted with the basic concepts and algorithmic description of the main language levels:
morphology, syntax, semantics, and pragmatics.
3. To design and implement applications based on natural language processing
4. To implement various language Models.
5. To design systems that uses NLP techniques

Course out comes: On successful completion of course learner should:
1. Have a broad understanding of the field of natural language processing.
2. Have a sense of the capabilities and limitations of current natural language technologies,
3. Be able to model linguistic phenomena with formal grammars.
4. Be able to Design, implement and test algorithms for NLP problems
5. Understand the mathematical and linguistic foundations underlying approaches to the various areas in
NLP
6. Be able to apply NLP techniques to design real worl d NLP applications such as machine translation, text
categorization, text summarization, information extraction...etc.

Prerequisite: Data structure & Algorithms, Theory of computer science, Probability Theory.

Module
No. Unit No. Topics Hrs.
1 Introduction
History of NLP, Generic NLP system, levels of NLP , Knowledge in
language processing , Ambiguity in Natural language , stages in NLP,
challenges of NLP ,Applications of NLP 4
2 Word Level
Analysis
Morphology analysis –survey of English Morphology, Inflectional
morphology & Derivational morphology, Lemmatization, Regular
expression, finite automata, finite state transducers (FST)
,Morphological parsing with FST , Lexicon free FST Porter stemmer.
N –Grams - N-gram language model, N -gram for spelling correction. 10
3 Syntax
analysis
Part-Of-Speech tagging( POS) - Tag set for English ( Penn Treebank ) ,
Rule based POS tagging, Stochastic POS tagging, Issues –Multiple
tags & words, Unknown words. Introduction to CFG, Sequence
labeling: Hidden Markov Model (HMM), Maximum Entropy, and
Conditional Random Field (CRF). 10
4 Semantic
Analysis Lexical Semantics, Attachment for fragment of English - sentences,
noun phrases, Verb phrases, prepositional phrases, Relations among
lexemes & their senses –Homonymy, Polysemy, Synonymy,
Hyponymy, WordNet, Robust Word Sense Disambiguation (WSD)
,Dictionary based approach 10

Page 120

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 119
5 Pragmatics
Discourse –reference resolution, reference phenomenon , syntactic &
semantic constraints on co reference 8
6 Applications (
preferably for
Indian
regional
languages) Machine translation, Information retrieval, Question answers system,
categorization, summarization, sentiment analysis, Named Entity
Recognition. 10


Text Books:

1. Daniel Jurafsky, James H. Martin ―Speech and Language Processing‖ Second Edition, Prentice Hall,
2008.
2. Christopher D.Manning and Hinrich Schutze, ― Foundations of Statistical Natural
Language Processing ―, MIT Press, 1999.
Reference Books:

1. Siddiqui and Tiwary U.S., Natural Language Processing and Information Retrieval, Oxford
University Press (2008).
2. Daniel M Bikel and Imed Zitouni ― Multilingual natural language processing applications‖ Pearson,
2013
3. Alexander Clark (Editor), Chris Fox (Editor), Shalom Lappin (Editor) ― The Handbook of
Computational Linguistics and Natural Language Processing ― ISBN: 978 -1-118-
4. Steven Bird, Ewan Klein, Natural Language Processing with Python, O‘Reilly
5. Brian Neil Levine, An Introduction to R Programming
6. Niel J le Roux, Sugnet Lubbe, A step by step tutorial : An introduction into R application and
programming

Assessment:

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

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



Page 121

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

Laboratory Work /Case study/Experiments:

Description: The Laboratory Work (Experiments) for this course is required to be performed and to be
evaluated in CSL803: Computational Lab -II

The objective of Natural Language Processing lab is to introduce the students with the basics of NLP which
will empower them for developing adva nced NLP tools and solving practical problems in this field.
Reference for Experiments: http://cse24 -iiith.virtual -labs.ac.in/#
Reference for NPTEL: http://www.cse.iitb.ac.in/~cs626 -449
Sample Experiments : possible tools / language: R tool/ Python programming Language
Note: Although it is not mandatory, the experiments can be conducted with reference to any Indian regional
language.
1. Preprocessing of text (Tokenization, Filtration, Script Validation, Stop Word Removal, Stemming)
2. Morphological Analysis
3. N-gram model
4. POS tagging
5. Chunking
6. Named Entity Recognition
7. Case Study/ Mini Project based on Application mentioned in Module 6.




















Page 122

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

Course Code Course Name Credits
DLO801 3 Adhoc Wireless Networks 4

Course objectives:
1. To Identify the major issues associated with ad -hoc networks
2. To identify the requirements for protocols for wireless ad -hoc networks as compared to the protocols
existing for wired network.
3. To explore current ad -hoc technologies by researching key areas such as algorithms, protocols,
hardware, and applications.
4. To Provide hands -on experience through real -world programming projects
5. To provide advanced in –depth netwo rking materials to graduate students in networking research.

Course outcomes: On successful completion of course learner will be able to:
1. Identify the characteristics and features of Adhoc Networks.
2. Understand the concepts & be able to design MAC protoco ls for Ad Hoc networks
3. Implement protocols / Carry out simulation of routing protocols of Adhoc Networks
4. Interpret the flow control in transport layer of Ad Hoc Networks
5. Analyze security principles for routing of Ad Hoc Networks
6. Utilize the concepts of Adhoc Networks in VANETs

Prerequisite: Computer Network, Wireless Networking

Module
No. Unit
No. Topics Hrs.
1.0 Introduction 04
1.1 Introduction to wireless Networks. Characteristics of Wireless
channel,
1.2 Issues in Ad hoc wireless networks, Adhoc Mobility Models: -
Indoor and outdoor models,
1.3 Introduction to Adhoc networks – definition, characteristics
features, applications.
2.0 MAC protocols for Wireless Ad -Hoc Networks 12
2.1 Introduction
2.2 Issues in designing MAC for Wireless Ad -Hoc Networks
2.3 Design Goals and classification of MAC for Wireless Ad -Hoc
Networks
2.4 Contention based MAC protocols for Wireless Ad -Hoc
Networks, with reservation mechanisms, scheduling
Mechanisms
2.5 MAC protocols using directional antennas, Other MAC
Protocols
2.6 IEEE standards MAC Protocols: 802.15.1(WPAN based on
Bluetooth), 802.15.4 (WSN/Zigbee), 802.15.6 (WBAN).
3.0 Routing Protocols for Wireless Ad -Hoc Networks 10
3.1 Introduction, Issues in designing a routing protocol for Wireless
Ad-Hoc Networks
3.2 Classification of routing protocols, Table driven routing
protocols like DSDV, WRP,

Page 123

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 122
On- demand routing protocols like ABR, DSR, TORA, AODV,
etc.
3.3 Hybrid Routing Protocols : ZRP, Routing Protocols with
efficient flooding mechanism, Hierarchical Routing Protocols,
Power aware routing protocols
4.0 Transport Layer 10
4.1 Transport layer protocols for Ad hoc wireless Networks:
Introduction,
4.2 Issues in designing a transport layer protocol for Ad hoc
wireless Networks,
4.3 Design goals of a transport layer protocol for Ad hoc wireless
Networks,
4.4 Classification of transport layer solutions: Split Approach ,
End-to-End approach :TCP -F,TCP -ELFN, Ad -Hoc TCP, TCP
Buffering capability and Sequencing information
4.5 End-to-End Quality of Service
5.0 Security 08
5.1 Security attacks in wireless Ad hoc wireless Networks,
Network security requirements,
5.2 Issues & challenges in security provisioning,
5.3 Link Layer security attacks: 802.11 MAC , WPA and variations
5.4 Network Security Attacks: Routing Protocol Attacks: attacks
using falsifying route errors and broadcasting falsifying routes,
spoofing attacks, Rushing attacks, Secure routing in Ad hoc
wireless Networks
6.0 Vehicular Ad -Hoc Network (VANET) 08
6.1 Introduction: Challenges and Requirements, , Layered
architecture for VANETs, DSRC /WAVE standard (IEEE
802.11p )
6.2 IEEE 802.11p protocol Stack (PHY & MAC) ,
A Survey on Proposed MAC Approaches for VANETs like
TDMA, SDMA and CDMA based approaches, DSRC MAC &
LLC
6.3 Georouting: CBF, Flooding with broadcast suppression
6.4 Delay Tolerant Network, Introduction to Opportunistic
Networking in Delay Tolerant Vehicular Ad Hoc Networks
Total 52


Assessment:

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

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

Page 124

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

Text Books:
1. Siva Ram Murthy and B.S. Manoj , ―Ad hoc Wireless Networks Architectures and protocols‖, 2nd
edition, Pearson Education, 2007 (T1)
2. C. K. Toh, ―Adhoc Mobile Wireless Networks‖, Pearson Education, 2002 (T2)
3. Charles E. Perkins, ―Adhoc Networking‖, Addison – Wesley, 2000 (T3)
4. Dipankar Raychaudhuri, Mario Gerla, ―Emerging Wireless Technologies and the Future Mobile Internet,
D, Cambridge. (T4)

Reference Books:
1. Subir Kumar Sarkar, ―Ad -Hoc Mobile Wireless Networks: principles, protocols and applications‖ CRC
Press (R1)
2. Prasant Mohapatra and Sriramamurthy, ―Ad Hoc Networks: Technologies and Protocols‖, Springer
International Edition, 2009, (R2)
3. Stefano Basangi, Ma rco Conti, Silvia Giordano, Ivan Stojmenovic, ―Mobile Ad -Hoc Networking , ―
John -Wiley and Sons Publications, 2004, (R3)
4. Hannes Hartenstein , Kenneth Laberteaux , ―VANET Applications and Interworking Technologies,‖
Wiley Publications (R4)
5. Christoph Sommer , Falko Dressle r, ―Vehicular Networking,‖ Cambridge University Press, 2014 (R5)
Laboratory Work

Lab Outcome:
1. Explore the knowledge of NS2 and NS3 by installing it and make it ready
2. Shall synthesize a simulation and evaluate the performance of WLAN 802.11 and Bluetooth
3. Students will able to analyze and implement MAC & Network layer protocols using open source
and synthesis as well as evaluate its performance
4. Implement Transport layer protocols / Carry out simulation of routing protocols of Adhoc Networks
5. Describe and interpret the use security routines and evalua te its performance
6. Explore and understand the capability of SUMO and MOVE as well as Nessi by installing it and
analyze it by applying on various scenarios

Description: It is recommended that Network simulation Softwares like NS -2, NS -3, SUMO (Simulat ion
software for Urban MObility) with MOVE. Software like Nessi is also recommended for the event based
security attacks simulation and measure.

The Laboratory Work (Experiments) for this course is required to be performed and to be evaluated in
CSL803: Computational Lab -II

Suggested List of Experiments:
Sr. No. Title of Experiments
1 Installation of NS2 & NS3 in Fedora 19 (32 bit) OS Linux.
2 Simulating IEEE 802.11 wireless LAN in Ad -Hoc Mode using NS2
3 Implementation a Bluetooth network in NS3 with application as transfer of a file from one
device to another
4 To implement and compare MAC layer protocols, MACAW, MACA -BI and MACA with
piggybacked Reservation using NS -3

Page 125

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 124
5 Develop sample wireless network in which
a. implement AODV and AOMDV protocol
b. Calculate the time to receive reply from the receiver using NS2.
c. Generate graphs which show the transmission time for packet.
Implement wireless network. Capture data frame and identify fields using NS2.
6 Communicate between two different networks (NS -3) which has following specifications:
a. One network has Class A network with ―TORA protocol‖
b. Second has Class B network ―AODV protocol‖
7 To calculate and compare average throughput for various TCP variants like TCP -F (Feedback)
and Ad-Hoc TCP using NS -3
8 Explore and use security tools like WEP & WPA and evaluate its performance on mobile
terminals
9 Simulation of Urban Mobility (SUMO) along with MOVE is software that helps in simulating
the VANETs. Install it on Fedora 19 (32 bit ) OS Linux
10 Create a simulation for road traffic with 6 junctions. There are various vehicles going on and
your own car also. Select a shortest route for your car. Demonstrate with simulation software
SUMO and MOVE.
11 A car acts as a malicious node and can be analyzed for the packet loss before and after malicious
activity. Using SUMO and MOVE.
12 Create an Ad -hoc Network using nessi Simulation software and include events incorporate
dropped packets, infected flows, compromised machines, unavailabl e services etc, and check its
performance

Digital Material (if Any):

1. http://www.isi.edu/nsnam/ns/ : NS-2 software download (D1)
2. https://nsnam.isi.edu/nsnam/index.php/NS_manual (D2)
3. https://www.nsnam.org/ : Ns-3 Software Download (D3)
4. http://www.nsnam.com/2013/11/vanet -simulator -in-fedora -19-32-bit.html (D4)
5. http://www.sumo.dlr.de/userdoc/Tutorials/Quick_Start.html (D5)
6. http://v eins.car2x.org/ (D6)
7. http://www.nessi2.de/ (D7)

Text Books:
1. Ekram Hossain and Teerawat Issariyakul, ―Introduction to Network Simulator NS -2,‖ Springer ,
Second Edition. (T1)
2. Jack L. Burbank, ―Introduction to Network Simulator 3,‖ Wiley Publications(T2)
3. Siva Ram Murthy and B.S. Manoj , ―Ad hoc Wireless Networks Architectures and protocols‖, 2nd
edition, Pearson Education, 2007 (T3)
4. Michael Gregg, ―Build your own security lab,‖ Wiley India edition (T4)



Page 126

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

Course Code Course Name Credits
ILO 8021 Project Management 03

Objectives:
1. To familiarize the students with the use of a structured methodology/approach for each and every
unique project undertaken, including utilizing project management concepts, tools and techniques.
2. To appraise the students with the project management life cycle and make them knowledgeable
about the various phases from project initiation through closure.

Outcomes: Learner will be able to…
1. Apply selection criteria and select an appropriate project from different options.
2. Write work break down structure for a project and develop a schedule based on it.
3. Identify opportunities and threats to the project and decide an approach to deal with them
strategically.
4. Use Earned value technique and determine & predict status of the project.
5. Capture lessons learned during project phases and document them for future reference

Module Detailed Contents Hrs
01 Project Management Foundation:
Definition of a project, Project Vs Operations, Necessity of project management, Triple
constraints, Project life cycles (typical & atypical) Project phases and stage gate
process. Role of project manager, Negotiations and resolving conflicts, Project
management in various organization structures, PM knowledge area s as per Project
Management Institute (PMI) 5
02 Initiating Projects:
How to get a project started, Selecting project strategically, Project selection models
(Numeric /Scoring Models and Non -numeric models), Project portfolio process, Project
sponsor and creating charter; Project proposal. Effective project team, Stages of team
development & growth (forming, storming, norming &performing), team dynamics. 6
03 Project Planning and Scheduling:
Work Breakdown structure (WBS) and linear responsibility chart, Interface
Co-ordination and concurrent engineering, Project cost estimation and budgeting, Top
down and bottoms up budgeting, Networking and Scheduling techniques. PERT, CPM,
GANTT chart, In troduction to Project Management Information System (PMIS). 8
04 Planning Projects:
Crashing project time, Resource loading and levelling, Goldratt's critical chain, Project
Stakeholders and Communication plan
Risk Management in projects: Risk management planning, Risk identification and risk
register, Qualitative and quantitative risk assessment, Probability and impact matrix.
Risk response strategies for positive and negative risks 6
05 5.1 Executing Projects:
Planning monitoring and controlling cycle, Information needs and reporting, engaging
with all stakeholders of the projects, Team management, communication and project
meetings
5.2 Monitoring and Controlling Projects:
Earned Value Management techniques for measuring value of work completed; Using
milestones for measurement; change requests and scope creep, Project audit 8

Page 127

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 126
5.3 Project Contracting
Project procurement management, contracting and outsourcing,
06 6.1 Project Leadership and Ethics:
Introduction to project leadership, ethics in pr ojects, Multicultural and virtual projects
6.2 Closing the Project:
Customer acceptance; Reasons of project termination, Various types of project
terminations (Extinction, Addition, Integration, Starvation), Process of project
termination, completing a final report; doing a lessons learned analysis; acknowledging
successes and failures; Project management templates and other resources; Managing
without authority; Areas of further study. 6

Assessment :

Internal Assessment for 20 marks:
Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:
Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions , each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculu m
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved


REFERENCES:
1. Project Management: A managerial approach, Jack Mer edith & Samuel Mantel, 7th Edition, Wiley
India
2. A Guide to the Project Management Body of Knowledge (PMBOK ® Guide), 5th Ed, Project
Management Institute PA, USA
3. Project Management,Gido Clements, Cengage Learning
4. Project Management,Gopalan, Wiley India
5. Project Management,Dennis Lock, 9th Edition, Gower Publishing England

Page 128

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 127
Course Code Course Name Credits
ILO 8022 Finance Management 03

Objectives:
1. Overview of Indian financial system, instruments and market
2. Basic concepts of value of money, returns and risks, corporate finance, working capital and its
management
3. Knowledge about sources of finance, capital structure, dividend policy
Outcomes: Learner will be able to…
1. Understand Indian finance system and corporate finance
2. Take investment, finance as well as dividend decisions

Module Detailed Contents Hrs
01 Overview of Indian Financial System: Characteristics, Components and Functions of
Financial System.
Financial Instruments: Meaning, Characteristics and Classification of Basic Financial
Instruments — Equity Shares, Preference Shares, Bonds -Debentures, Certificates of
Deposit, and Treasury Bills.
Financial Markets: Meaning, Characteristics and Classification of Financial Markets
— Capital Market, Money Market and Foreign Currency Market
Financial Instit utions: Meaning, Characteristics and Classification of Financial
Institutions — Commercial Banks, Investment -Merchant Banks and Stock Exchanges 06
02 Concepts of Returns and Risks: Measurement of Historical Returns and Expected
Returns of a Single Securit y and a Two -security Portfolio; Measurement of Historical
Risk and Expected Risk of a Single Security and a Two -security Portfolio.
Time Value of Money: Future Value of a Lump Sum, Ordinary Annuity, and Annuity
Due; Present Value of a Lump Sum, Ordinary An nuity, and Annuity Due; Continuous
Compounding and Continuous Discounting. 06
03 Overview of Corporate Finance: Objectives of Corporate Finance; Functions of
Corporate Finance —Investment Decision, Financing Decision, and Dividend Decision.
Financial Ratio Analysis: Overview of Financial Statements —Balance Sheet, Profit
and Loss Account, and Cash Flow Statement; Purpose of Financial Ratio Analysis;
Liquidity Ratios; Efficiency or Activity Ratios; Profitability Ratios; Capital Structure
Ratios ; Stock Market Ratios; Limitations of Ratio Analysis. 09
04 Capital Budgeting: Meaning and Importance of Capital Budgeting; Inputs for Capital
Budgeting Decisions; Investment Appraisal Criterion —Accounting Rate of Return,
Payback Period, Discounted Paybac k Period, Net Present Value(NPV), Profitability
Index, Internal Rate of Return (IRR), and Modified Internal Rate of Return (MIRR)
Working Capital Management: Concepts of Meaning Working Capital; Importance of
Working Capital Management; Factors Affecting a n Entity‘s Working Capital Needs;
Estimation of Working Capital Requirements; Management of Inventories;
Management of Receivables; and Management of Cash and Marketable Securities. 10
05 Sources of Finance: Long Term Sources —Equity, Debt, and Hybrids; Mezzanine 05

Page 129

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 128
Finance; Sources of Short Term Finance —Trade Credit, Bank Finance, Commercial
Paper; Project Finance.
Capital Structure: Factors Affecting an Entity‘s Capital Structure; Overview of
Capital Structure T heories and Approaches — Net Income Approach, Net Operating
Income Approach; Traditional Approach, and Modigliani -Miller Approach. Relation
between Capital Structure and Corporate Value; Concept of Optimal Capital Structure
06 Dividend Policy: Meaning a nd Importance of Dividend Policy; Factors Affecting an
Entity‘s Dividend Decision; Overview of Dividend Policy Theories and Approaches —
Gordon‘s Approach, Walter‘s Approach, and Modigliani -Miller Approach 03

Assessment :

Internal Assessment for 20 marks:
Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:
Weightage of each module in end se mester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions , each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the cu rriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved .

REFERENCES:
1. Fundamentals of Financial Management, 13th Edition (2015) by Eugene F. Brigham and Joel F.
Houston; Publisher: Cengage Publications, New Delhi.
2. Analysis for Financial Management, 10th Edition (2013) by Robert C. Higgins; Publishers: McGraw
Hill Education, New Delhi.
3. Indian Financial System, 9th Edition (2015) by M. Y. Khan; Publisher: McGraw Hill Education, New
Delhi.
4. Financial Management, 11th Edition (2015) by I. M. Pandey; Publisher: S. Chand (G/L) & Company
Limited, New Delhi.

Page 130

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

Course Code Course Name Credits
ILO8023 Entrepreneurship Development and Management 03

Objectives:
1. To acquaint with entrepreneurship and management of business
2. Understand Indian environment for entrepreneurship
3. Idea of EDP, MSME
Outcomes: Learner will be able to…
1. Understand the concept of business plan and ownerships
2. Interpret key regulations and legal aspects of entrepreneurship in India
3. Understand government policies for entrepreneurs

Module Detailed Contents Hrs
01 Overview Of Entrepreneurship: Definitions, Roles and Functions/Values of
Entrepreneurship, History of Entrepreneurship Development, Role of Entrepreneurship
in the National Economy, Functions of an Entrepreneur, Entrepreneurship and Forms of
Business Ownership
Role of Money and Capita l Markets in Entrepreneurial Development: Contribution of
Government Agencies in Sourcing information for Entrepreneurship 04
02 Business Plans And Importance Of Capital To Entrepreneurship: Preliminary and
Marketing Plans, Management and Personnel, Start -up Costs and Financing as well as
Projected Financial Statements, Legal Section, Insurance, Suppliers and Risks,
Assumptions and Conclusion, Capital and its Importance to the Entrepreneur
Entrepreneurship And Business Development: Starting a New Business, Buying an
Existing Business, New Product Development, Business Growth and the Entrepreneur
Law and its Relevance to Business Operations 09
03 Women‘s Entrepreneurship Development, Social e ntrepreneurship -role and need, EDP
cell, role of sustainability and sustainable development for SMEs, case studies,
exercises 05
04 Indian Environment for Entrepreneurship: key regulations and legal aspects ,
MSMED Act 2006 and its implications, schemes and policies of the Ministry of MSME,
role and responsibilities of various government organisations, departments, banks etc.,
Role of State governments in terms of infrastruc ture developments and support etc.,
Public private partnerships, National Skill development Mission, Credit Guarantee
Fund, PMEGP, discussions, group exercises etc 08
05 Effective Management of Business: Issues and problems faced by micro and small
enterp rises and effective management of M and S enterprises (risk management, credit
availability, technology innovation, supply chain management, linkage with large
industries), exercises, e -Marketing 08
06 Achieving Success In The Small Business: Stages of the small business life cycle, four
types of firm -level growth strategies, Options – harvesting or closing small business
Critical Success factors of small business 05



Page 131

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

Assessment :

Internal Assessment for 20 marks:
Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:
Weightage of each module in end semester examinat ion will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions , each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remain ing questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved .



REFERENCES:
1. Poornima Charantimath, Entrepreneurship development - Smal l Business Enterprise, Pearson
2. Education Robert D Hisrich, Michael P Peters, Dean A Shapherd, Entrepreneurship, latest edition,
The McGrawHill Company
3. Dr TN Chhabra, Entrepreneurship Development, Sun India Publications, New Delhi
4. Dr CN Prasad, Small and Me dium Enterprises in Global Perspective, New century Publications,
New Delhi
5. Vasant Desai, Entrepreneurial development and management, Himalaya Publishing House
6. Maddhurima Lall, Shikah Sahai, Entrepreneurship, Excel Books
7. Rashmi Bansal, STAY hungry STAY foolish, CIIE, IIM Ahmedabad
8. Law and Practice relating to Micro, Small and Medium enterprises, Taxmann Publication Ltd.
9. Kurakto, Entrepreneurship - Principles and Practices, Thomson Publication
10. Laghu Udyog Samachar
11. www.msme .gov.in
12. www.dcmesme.gov.in
13. www.msmetraining.gov.in



Page 132

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

Course Code Course Name Credits
ILO8024 Human Resource Management 03

Objectives:
1. To introduce the students with basic concepts, techniques and practices of the human resource
management
2. To provide opportunity of learning Human resource management (HRM) processes, related with the
functions, and challenges in the emerging perspective of today‘s organizations
3. To familiarize the students about the latest developments, trends & different aspects of HRM
4. To acquaint the student with the importance of inter -personal & inter -group behavioural skills in an
organizational setting required for future stable engineers, leaders and managers

Outcomes: Learner will be able to…
1. Understand the concepts, aspects, techniques and practices of the human resource management.
2. Understand the Human resource management (HRM) processes, functions, changes and challenges
in today‘s emerging organizational perspective.
3. Gain knowledge about the latest developments and trends in HRM.
4. Apply the knowledge of behavioural skills learnt and integrate it with in inter personal and
intergroup environment emerging as future stable engineers and managers.

Module Detailed Contents Hrs
01 Introduction to HR
 Human Resource Management - Concept, Scope and Importance, Interdisciplinary
Approach Relationship with other Sciences, Competencies of HR Manager, HRM
functions
 Human resource development (HRD): changing role of HRM – Human resource
Planning, Technological change, Restru cturing and rightsizing, Empowerment, TQM,
Managing ethical issues 5
02 Organizational Behaviour (OB)
 Introduction to OB Origin, Nature and Scope of Organizational Behaviour, Relevance
to Organizational Effectiveness and Contemporary issues
 Personality: Meaning and Determinants of Personality, Personality development,
Personality Types, Assessment of Personality Traits for Increasing Self Awareness
 Perception: Attitude and Value, Effect of perception on Individual Decision -making,
Attitude and Behaviour
 Motivation: Theories of Motivation and their Applications for Behavioural Change
(Maslow, Herzberg, McGregor);
 Group Behaviour and Group Dynamics: Work groups formal and informal groups and
stages of group development, Team Effectiveness: High performing teams, Team
Roles, cross functional and self -directed team.
 Case study 7
03 Organizational Structure &Design
 Structure, size, technology, Environment of organization; Organizational Roles &
conflicts: Concept of roles; role dynamics; role conflicts and stress.
 Leadership: Concepts and skills of leadership, Leadership and managerial roles,
Leadership styles and contemporary issues in leadership.
 Power and Politics: Sources and uses of power; Politics at workplace, Tactics and
strategies. 6

Page 133

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 132
04 Human resource Planning
 Recruitment and Selection process, Job -enrichment, Empowerment - Job-Satisfaction,
employee morale
 Performance Appraisal Systems: Traditional & modern methods, Performance
Counselling, Career Planning
 Training & Development: Identificatio n of Training Needs, Training Methods 5
05 Emerging Trends in HR
 Organizational development; Business Process Re -engineering (BPR), BPR as a tool
for organizational development , managing processes & transformation in HR.
Organizational Change, Culture, Environment
 Cross Cultural Leadership and Decision Making : Cross Cultural Communication and
diversity at work , Causes of diversity, managing diversity with special reference to
handicapped, women and ageing people, intra company cultural difference in
employee motivation 6
06 HR & MIS: Need, purpose, objective and role of information system in HR, Applications
in HRD in various industries (e.g. manufacturing R&D, Public Transport, Hospitals,
Hotels and service industries
Strategic HRM: Role of Strategic HRM in the modern business world, Concept of
Strategy, Strategic Management Process, Approaches to Strategic Decision Making;
Strategic Intent – Corporate Mission, Vision, Objectives and Goals
Labor Laws & Industrial Relations: Evolution of IR, IR issues in organizations,
Overview of Labor Laws in India; Industrial Disputes Act, Trade Unions Act, Shops and
Establishments Act 10

Internal Assessment for 20 marks:
Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:
Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions , each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining question s will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved .

REFERENCES:
1. Stephen Robbins, Organizational Behavior, 16th Ed, 2013
2. V S P Rao, Human Resource Management, 3rd Ed, 2010, Excel publishing
3. Aswathapa, Human resource management: Text & cases, 6th edition, 2011
4. C. B. Mamoria and S V Gankar, Dynamics of Industrial Relations in India, 15th Ed, 2015, Himalaya
Publishing, 15thedition, 2015
5. P. Subba Rao, Essentials of Human Resource management and Industrial relations, 5th Ed, 2013,
Himalaya Publishing
6. Laurie Mullins, Management & Organizational Behavior, Latest Ed, 2016, Pearson Publications

Page 134

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

Course Code Course Name Credits
ILO8025 Professional Ethics and Corporate Social Responsibility (CSR) 03

Objectives:
1. To understand professional ethics in business
2. To recognized corporate social responsibility
Outcomes: Learner will be able to…
1. Understand rights and duties of business
2. Distinguish different aspects of corporate social responsibility
3. Demonstrate professional ethics
4. Understand legal aspects of corporate social responsibility

Module Detailed Contents Hrs
01 Professional Ethics and Business: The Nature of Business Ethics; Ethical Issues in
Business; Moral Responsibility and Blame; Utilitarianism: Weighing Social Costs and
Benefits; Rights and Duties of Business 04
02 Professional Ethics in the Marketplace: Perfect Competition; Monopoly Competition;
Oligopolistic Competition; Oligopolies and Public Policy
Professional Ethics and the Environment: Dimensions of Pollution and Resource
Depletion; Ethics of Pollution Control; Ethics of Conserving Depletable Resources 08
03 Professional Ethics of Consumer Protection: Markets and Consumer Protection;
Contract View of Business Firm‘s Duties to Consumers; Due Care Theory; Advertising
Ethics; Consumer Privacy
Professional Ethics of Job Discrimination: Nature of Job Discrimination; Extent of
Discrimination; Reservation of Job s. 06
04 Introduction to Corporate Social Responsibility: Potential Business Benefits —Triple
bottom line, Human resources, Risk management, Supplier relations; Criticisms and
concerns —Nature of business; Motives; Misdirection.
Trajectory of Corporate Social Responsibility in India 05
05 Corporate Social Responsibility: Articulation of Gandhian Trusteeship
Corporate Social Responsibility and Small and Medium Enterprises (SMEs) in India,
Corporate Social Responsibility and Public -Private Partnership (PPP) in India 08
06 Corporate Social Responsibility in Globalizing India: Corporate Social
Responsibility Voluntary Guidelines, 2009 issued by the Ministry of Corporate Affairs,
Government of India, Legal Aspects of Corporate Social Responsibility —Compan ies
Act, 2013. 08







Page 135

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

Assessment :

Internal Assessment for 20 marks:
Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:
Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions , each carrying 20 mark s
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved .


REFERENCES:
1. Business Ethics: Texts and Cases from the Indian Perspective (2013) by Ananda Das Gupta;
Publisher: Springer.
2. Corporate Social Responsibility: Readings and Cases in a Global Context (2007) by Andrew Crane,
Dirk Matten, Laura Spence; Publisher: Routledge.
3. Business Ethics: Concepts and Cases, 7th Edition (2011) by Manuel G. Velasquez; Publisher:
Pearson, New Delhi.
4. Corporate Social Responsibility in India (2015) by Bidyut Chakrabarty, Routledge, New Delhi.





Page 136

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

Course Code Course Name Credits
ILO8026 Research Methodology 03

Objectives:
1. To understand Research and Research Process
2. To acquaint students with identifying problems for research and develop research strategies
3. To familiarize students with the techniques of data collection, analysis of data and interpretation
Outcomes: Learner will be able to…
1. Prepare a preliminary research design for projects in t heir subject matter areas
2. Accurately collect, analyze and report data
3. Present complex data or situations clearly
4. Review and analyze research findings

Module Detailed Contents Hrs
01 Introduction and Basic Research Concepts
1.1 Research – Definition; Concept of Construct, Postulate, Proposition, Thesis,
Hypothesis, Law, Principle.Research methods vs Methodology
1.2 Need of Research in Business and Social Sciences
1.3 Objectives of Research
1.4 Issues and Problems in Research
1.5 Characteristics of Rese arch:Systematic, Valid, Verifiable, Empirical and Critical 09
02 Types of Research
2.1. Basic Research
2.2. Applied Research
2.3. Descriptive Research
2.4. Analytical Research
2.5. Empirical Research
2.6 Qualitative and Quantitative Approaches 07
03 Research Design and Sample Design
3.1 Research Design – Meaning, Types and Significance
3.2 Sample Design – Meaning and Significance Essentials of a good sampling Stages in
Sample Design Sampling methods/techniques Sampling Errors 07
04 Research Methodology
4.1 Meaning of Research Methodology
4.2. Stages in Scientific Research Process:
a. Identification and Selection of Research Problem
b. Formulation of Research Problem
c. Review of Literature
d. Formulation of Hypothesis
e. Formulation of research Design
f. Sample Design
g. Data Collection
h. Data Analysis
i. Hypothesis testing and Interpretation of Data
j. Preparation of Research Report 08

Page 137

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 136
05 Formulating Research Problem
5.1 Considerations: Relevance, Interest, Data Availability, Choice of data, Analysis of
data, Generalization and Interpretation of analysis 04
06 Outcome of Research
6.1 Preparation of the report on conclusion reached
6.2 Validity Testing & Ethical Issues
6.3 Suggestions and Recommendation 04

Assessment :

Internal Assessment for 20 marks:
Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:
Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions , each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be sol ved.


REFERENCES:
1. Dawson, Catherine, 2002, Practical Research Methods, New Delhi, UBS Publishers Distributors.
2. Kothari, C.R.,1985, Research Methodology -Methods and Techniques, New Delhi, Wiley Eastern
Limited.
3. Kumar, Ranjit, 2005, Research Methodology -A Step-by-Step Guide for Beginners, (2nded),
Singapore, Pearson Education


Page 138

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

Course Code Course Name Credits
ILO8027 IPR and Patenting 03

Objectives:
1. To understand intellectual property rights protection system
2. To promote the knowledge of Intellectual Property Laws of India as well as International treaty
procedures
3. To get acquaintance with Patent search and patent filing procedure and applications
Outcomes: Learner will be able to…
1. understand Intellectual Property assets
2. assist individuals and organizations in capacity building
3. work for development, promotion, protection, compliance, and enforcement of Intellectual Property
and Patenting

Module Detailed Contents Hr
01 Introduction to Intellectual Property Rights (IPR) : Meaning of IPR, Different
category of IPR instruments - Patents, Trademarks,Copyrights, Industrial Designs, Plant
variety protection, Geographical indications,Transfer of technology etc.
Importance of IPR in Modern Global Economic Environment: Theories of IPR,
Philosophical aspects of IPR laws, Need for IPR, IPR as an instrument of development 05
02 Enforcement of Intellectual Property Rights: Introduction, Magnitude of problem,
Factors that create and sustain counterfeiting/piracy, International agree ments,
International organizations (e.g. WIPO, WTO) active in IPR enforcement
Indian Scenario of IPR: Introduction, History of IPR in India, Overview of IP laws in
India, Indian IPR, Administrative Machinery, Major international treaties signed by
India, P rocedure for submitting patent and Enforcement of IPR at national level etc. 07
03 Emerging Issues in IPR: Challenges for IP in digital economy, e -commerce, human
genome, biodiversity and traditional knowledge etc. 05
04 Basics of Patents: Definition of Patents, Conditions of patentability, Patentable and
non-patentable inventions, Types of patent applications (e.g. Patent of addition etc),
Process Patent and Product Patent, Precautions while patenting, Patent specification
Patent claims, Disclosures and non-disclosures, Patent rights and infringement, Method
of getting a patent 07
05 Patent Rules: Indian patent act, European scenario, US scenario, Australia scenario,
Japan scenario, Chinese scenario, Multilateral treaties where India is a member (TRIPS
agreement, Paris convention etc.) 08
06 Procedure for Filing a Patent (National and International): Legislation and Salient
Features, Patent Search, Drafting and Filing Patent Applications, Processing of patent,
Patent Litigation, Patent Publication, Time frame and cost, Patent Licensing, Patent
Infringement
Patent databases: Important websites, Searching international databases 07

Page 139

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

Assessment :

Internal Assessment for 20 marks:
Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:
Weightage of each module in end se mester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions , each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the cu rriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved .
REFERENCE BOOKS:
1. Rajkumar S. Adukia, 2007, A Handbook on Laws Relating to Intellectual Property Rights in India,
The Institute of Chartered Accountants of India
2. Keayla B K, Patent system and related issues at a glance, Published by National Working Group on
Patent Laws
3. T Sengupta, 2011, Intellectual Property Law in India, Kluwer Law International
4. Tzen Wong and Graham Dutfield, 2010, Intellectual Property and Human Development: Current
Trends and Future Scenario, Cambridge University Press
5. Cornish, William Rodolph & Llewelyn, David. 2010, Intellectual Property: Patents, Copyrights,
Trade Marks and Allied Right, 7th Edition, Sweet & Maxwell
6. Lous Harns, 2012, The enforcement of Intellactual Property Rights: A Case Book, 3rd Edition, WIPO
7. Prabhuddha Ganguli, 2012, Intellectual Property Rights, 1st Edition, TMH
8. R Radha Krishnan & S Balasubramanian, 2012, Intellectual Property Rights, 1st Edition, Excel
Books
9. M Ashok Kumar and mohd Iqbal Ali, 2 -11, Intellectual Property Rights, 2nd Edition, Serial
Publications
10. Kompal Bansal and Praishit Bansal, 2012, Fundamentals of IPR for Engineers, 1st Edition, BS
Publications
11. Entrepreneurship Development and IPR Unit, BITS Pilani, 2007, A Manual on Intellectual Property
Rights,
12. Mathew Y Maa, 2009, Fundamentals of Patenting and Licensing for Scientists and En gineers, World
Scientific Publishing Company
13. N S Rathore, S M Mathur, Priti Mathur, Anshul Rathi , IPR: Drafting,Interpretation of Patent
Specifications and Claims , New India Publishing Agency
14. Vivien Irish, 2005, Intellectual Property Rights for Engineers,IET
15. Howard B Rockman, 2004, Intellectual Property Law for Engineers and scientists, Wiley -IEEE
Press .



Page 140

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


Course Code Course Name Credits
ILO 8028 Digital Business Management 03

Objectives:
1. To familiarize with digital business concept
2. To acquaint with E -commerce
3. To give insights into E -business and its strategies

Outcomes: The learner will be able to …..
1. Identify drivers of digital business
2. Illustrate various approaches and techniques for E -business and management
3. Prepare E -business plan

Module Detailed content Hours
1 Introduction to Digital Business -
Introduction, Background and current status, E -market places, structures,
mechanisms, economics and impacts
Difference between physical economy and digital economy,
Drivers of digital business - Big Data & Analytics, Mobile, Cloud Computing,
Social media, BYOD, and Internet of Things(digitally intelligent machines/services)
Opportunities and Challenges in Digital Business, 09
2 Overview of E -Commerce
E-Commerce - Meaning, Retailing in e -commerce -products and services, consumer
behavior, market research and advertisement
B2B-E-commerce -selling and buying in private e -markets, public B2B exchanges
and support services, e -supply chains, Collaborative Commerce, Intra business EC
and Corporate portals
Other E -C models and applications, innovative EC System -From E -government and
learning to C2C, mobile commerce and pervasive computing
EC Strategy and Implementation -EC strategy and global EC, Economics and
Justification of EC, Using Affiliate marketing to promote your e -commerce
business, Launching a successful online business and EC project, Legal, Ethics and
Societal impacts of EC 06
3 Digital Business Support services : ERP as e –business backbone, knowledge Tope
Apps, Information and refer ral system
Application Development: Building Digital business Applications and
Infrastructure 06
4 Managing E -Business -Managing Knowledge, Management skills for e -business,
Managing Risks in e –business
Security Threats to e -business -Security Overview, Electronic Commerce Threats,
Encryption, Cryptography, Public Key and Private Key Cryptography, Digital
Signatures, Digital Certificates, Security Protocols over Public Networks: HTTP,
SSL, Firewall as Security Control, Public Key Infrastructure (PKI) for Security,
Prominent Cryptographic Applications 06
5 E-Business Strategy -E-business Strategic formulation - Analysis of Company‘s
Internal and external environment, Selection of strategy,
E-business strategy into Action, challenges and E -Transition
(Process of Digital Transformation) 04
6 Materializing e -business: From Idea to Realization -Business plan preparation
Case Studies and presentations 08

Page 141

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

Assessment :

Internal Assessment for 20 marks:
Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)

End Semester Examination:
Weightage of each module in end semester examination will be proportional to number of r espective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions , each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved .

References:

1. A textbook on E -commerce , Er Arunrajan Mishra, Dr W K Sarwade,Neha Publishers & Distributors,
2011
2. E-commerce from vision to fulfilment, Elias M. Awad, PHI-Restricted, 2002
3. Digital Business and E -Commerce Management, 6th Ed, Dave Chaffey, Pearson, August 2014
4. Introduction to E -business -Management and Strategy, Colin Combe, ELSVIER, 2006
5. Digital Bus iness Concepts and Strategy, Eloise Coupey, 2nd Edition, Pearson
6. Trend and Challenges in Digital Business Innovation, VinocenzoMorabito, Springer
7. Digital Business Discourse Erika Darics, April 2015, Palgrave Macmillan
8. E-Governance -Challenges and Opportunit ies in : Proceedings in 2nd International Conference theory
and practice of Electronic Governance
9. Perspectives the Digital Enterprise –A framework for Transformation, TCS consulting journal Vol.5
10. Measuring Digital Economy -A new perspective - DoI:10.1787/978 9264221796 -enOECD Publishing

Page 142

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

Course Code Course Name Credits
ILO8029 Environmental Management 03

Objectives:
1. Understand and identify environmental issues relevant to India and global concerns
2. Learn concepts of ecology
3. Familiarise environment related legislations
Outcomes: Learner will be able to…
1. Understand the concept of environmental management
2. Understand ecosystem and interdependence, food chain etc.
3. Understand and interpret environment related legislations

Module Detailed Contents Hrs
01 Introduction and Definition of Environment: Significance of Environment
Management for contemporary managers, Career opportunities, Environmental
issues relevant to India, Sustainable Development, the Energy scenario 10
02 Global Environmental concerns : Global Warming, Acid Rain, Ozone Depletion,
Hazardous Wastes, Endangered life -species, Loss of Biodiversity, Industrial/Man -
made disasters, Atomic/Biomedical hazards, etc. 06
03 Concepts of Ecology: Ecosystems and interdependence between living organisms,
habitats, limiting factors, carrying capacity, food chain, etc. 05
04 Scope of Environment Management, Role and functions of Government as a
planning and regulating agency
Environment Quality Management and Corporate Environmental Responsibility 10
05 Total Quality Environmental Management, ISO -14000, EMS certification. 05
06 General overview of major legislations like Environment Protection Act, Air (P &
CP) Act, Water (P & CP) Act, Wildlife Protection Act, Forest Act, Factories Act,
etc. 03

Assessment :

Internal Assessment for 20 marks:
Consisting Two Compulsory Class Tests
First test based on approximately 40% of contents and second test based on remaining contents
(approximately 40% but excluding contents covered in Test I)





Page 143

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


End Semester Examination:
Weightage of each module in end semester examination will be proportional to number of respective lecture
hours mentioned in the curriculum.
1. Question paper will comprise of total six questions , each carrying 20 marks
2. Question 1 will be compulsory and should cover maximum contents of the curriculum
3. Remaining questions will be mixed in nature (for example if Q.2 has part (a) from module 3 then
part (b) will be from any module other than module 3)
4. Only Four questions need to be solved .



REFERENCES:
1. Environmental Management: Principles and Practice, C J Barrow, Routledge Publishers London,
1999
2. A Handbook of Environmental Management Edited by Jon C. Lovett and David G. Ockwell, Edward
Elgar Publishing
3. Environmental Management V Ramachandra and Vijay Kulkarni, TERI Press
4. Indian Standard Environmental Management Systems — Requirements With Guida nce For Use,
Bureau Of Indian Standards, February 2005
5. Environmental Management: An Indian Perspective, S N Chary and Vinod Vyasulu, Maclillan India,
2000
6. Introduction to Environmental Management, Mary K Theodore and Louise Theodore, CRC Press
Environment and Ecology, Majid Hussain, 3rd Ed. Access Publishing.2015

























Page 144

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


Lab Code Lab Name Credits
CSL801 Human Machine Interactions Lab 1

Lab Outcome:
1: To design user centric interfaces.
2: To design innovative and user friendly interfaces.
3: To apply HMI in their day -to-day activities.
4: To criticize existing interface designs, and improve them.
5: To Design application for social Task.
6: To Design application for Technical Tasks

Description:
Human Machine Interaction provide s the study of user interface and benefit of good design. The design
process gives an idea about how people interact with computer and the problems that they fall, so
understanding the human characteristics is important as this lays the base for a good int erface. It enables the
students to apply his/her design skills to develop an appropriate Mobile App or Website. Students also learn
the different types of icon, color and its representation with social and ethical concerns. Students can also
learn the diff erent software tools used to assemble and build user interface along with the different types of
interaction devices and finally try to measure the usability of the application by learning HMI principles.

Suggested List of Experiments:
Sr. No. Title of Experiments
1 Problem representation for Designing User Interface
2 Design a Mobile app/ Website that can teach mathematics to children of 4 -5 years age
in schools in Rural /Urban Sector
3 Design a Mobile App/Website that can help people to sell their handmade products in
metro cities
4 ATM machine/KIOSK screen design for rural people.
5 Design a Mobile App/Website to get an experience for passengers whose flight /train
is delayed.
6 Design an UI application for Institute event management.
7 Design of User interface for the system using various interaction styles.
8 Statistical Graphics and its use in visualization
9 Design appropriate icons pertaining to a given domain .(Eg. Greeting cards)

Page 145

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 144
10 Design a personal website for an Artisan
11 Design a interface for Home appliances
12 Design an interactive data access using Graphics (QR, BAR Code, Image etc) and
generating a print form
13 Redesign of a user interface
(Suggest and implement changes in Existing User Interface
14 Design a navigator for a student new in your Institute.
15 Design a navigator for a person new in tourist city/ village
16 Design UI for Motor paralysis for disabled people.
17 KIOSK design for hospital/school/educational campus/National Institute.
18 To calculate screen complexity of existing Graphical User Interface and redesign the
interface to minimize the screen complexity.


Guidelines:
1. Students are expected to use advanced tools and Technologies towards execution of lab work.
2. Students can work individually or only 2-3 Students can form a team if they wish to work in Group.
3. Case Study and assignments may be linked with CSC801 Syllabus.

Term Work:
Laboratory work will be based on above syllabus with minimum 10(Ten) experiments in line with the above
Lab outcomes to b e incorporated with 13(Thirteen) lab session of 2 (two) hours each. The problem statement
can be decided by the instructor in line with the above list of experiments

The distribution of 25 marks for term work shall be as follows:
Lab Performance 15
Mini Project 05
Attendance (Theory & Practical) 05

Oral exam will be based on the above and CSC801: ‗HMI Theory ‘ Syllabus .


Page 146

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 145
Lab Code Lab Name Credits
CSL802 Distributed Computing Lab 01

Lab Outcome:
1. Develop, test and debug RPC/RMI based client -server programs.
2. Implement the main underlying components of distributed systems (such as IPC, name resolution,
file systems etc.)
3. Implement various techniques of synchronization.
4. Design and implement application programs on distributed systems.

Suggested List of Experiments:
Sr. No. Title of Experiments
1 Client/server using RPC/RMI.
2 Implementation of multi tread application
3 Inter -process communication
4 Group Communication
5 Load Balancing Algorithm.
6 Name Resolution protocol.
7 Election Algorithm.
8 Clock Synchronization algorithms.
9 Mutual Exclusion Algorithm.
10 Deadlock management in Distributed systems
11 Distributed File System
12 CORBA

Term Work:
Laboratory work will be based on above syllabus with minimum 10 experiments to be incorporated.
Laboratory work (experiments): ………………… (15) Marks.
Assignments: ………………………… ............... (05) Marks.
Attendance (Theory + Practical)…………………… (05) Marks
TOTAL: …………………………………………… (25) Marks.

Oral exam will be based on the above and CSC802 syllabus.

Page 147

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

Lab Code Course Name Credits
CSL803 Cloud Computing Lab 2

Lab Objectives: The course will help the learners to get familiar with
1. Key concepts of virtualization.
2. Various deployment models such as private, public, hybrid and community.
3. Various service models such as IaaS and PaaS.
4. Security and Privacy issues in cloud.
Lab Outcomes: On completion of the course learners will be able to
1. Adapt different types of virtualization and increase resource util ization.
2. Build a private cloud using open source technologies.
3. Analyze security issues on cloud.
4. Develop real world web applications and deploy on commercial cloud.
5. Demonstrate various service models.

Module Detailed Contents Hours
01 Title: Study of NIST model of cloud computing.
Objective: Understand deployment models, service models, advantages of
cloud computing. 2
02 Title: Virtualization.
Objective : Understand different types of virtualizations, Host and bare
metal hypervisors and impl ement horizontal scalability.
Technology: XEN/ Vmwares EXSi
2
03 Title: Infrastructure as a Service.
Objective: Implement IaaS using your resources.
Technology: Open Stack / Eucalyptus 2
04 Title: Identity Management in Cloud
Concept: Simulate identity management in your private cloud.
Technology: Open Stack 2
05 Title: Storage as a Service
Objective: Explore Storage as a Service for remote file access using web
interface.
Technology: ownCloud 2
06 Title: Cloud Security
Objective: Understand security of web server and data directory.
Technology: ownCloud 2
07 Title: Platform as a Service
Objective: Deploy web applications on commercial cloud.
Technology: Google appEngine/ Windows Azure 2
08 Title: Amazon Web Service
Objective: To create and access VM instances and demonstrate various 2

Page 148

University of Mumbai, B. E. (Computer Engineering), Rev . 2016 147
components such as EC2, S3, Simple DB, DynamoDB.
Technology: AWS
09 Title: Software as a Service
Objective: Understand on demand application delivery and Virtual desktop
infrastructure.
Technolo gy: Ulteo 2
10 Title: Case Study on Fog Computing
Objective : To have a basic understanding of implementation/applications of
fog computing. 2
11 Title: Mini Project
Objective: Using the concepts studied throughout the semester students
shall be able to
1. Create their private cloud for the institute using the available
resources.
2. Apply security concepts to secure a private cloud.
3. Implement efficient load balancing.
4. Compare various virtualization technologies with given resource.
5. Create cloud applications su ch as messenger, photo editing website,
your own social media etc.
Note: Evaluators must check if students have used appropriate cloud
computing tools for their projects. 6

Digital Material
www.openstack.org

Text Books:
1. Enterprise Cloud Computing by Gautam Shroff, Cambridge,2010
2. Cloud Security by Ronald Krutz and Russell Dean Vines, Wiley - India, 2010 ,
3. Getting Started with OwnCloud by Aditya Patawar , Packt Publishing Ltd, 2013

Term Work:
 Term work should consist of at least 6 ex periments and a mini project.
 Journal must include at least 2 assignments.
 The final certification and acceptance of term work indicates that performance in laboratory work is
satisfactory and minimum passing marks may be given in term work.
 The distributi on of marks for term work shall be as follows:
 Laboratory work (experiments): ………………….. (15) Marks.
 Mini project.................... ………………………… (15) Marks.
 Mini Project Presentation & Report....................... (10) Marks
Assignments............... ............................................. (05) Marks
 Attendance ……………………………………….....(05) Marks
 TOTAL: ……………………………………………(50) Marks.

Practical and Oral examination will be based on Laboratory work, mini project and above syllabus.

Page 149

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

Lab Code Course Name Credits
CSL804 Computational Lab II 1

Lab Outcome: After successful completion of this course student will be able to:
1. Acquire practical knowledge within the chosen area of technology for project development.
2. Identify, discuss and justify the technical aspects of the chosen project with a comprehensive and
systematic approach.

Description:
Design and implementation of any case study/ applications /experiments / mini project based on
departmental level optional courses using modern tools.

Term work:
The distribution of marks for term work shall be as follows:
Lab Experimental Work & mini project : 25
Report/ Documentation /Presentation : 20
Attendance (Theory & Practical) : 05

Practical & Oral examination is to be conducted based on depart mental level optional courses by pair of
internal and external examiners appointed by the University of Mumbai.










Page 150

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

Course Code Title Credit
CSP805 Major Project - II 6

Objective: The primary objective is to meet the milestone s formed in the overall project plan decided in
Project - I. The idea presented in Project -I should be implemented in Project -II with results, conclusion and
future work. The project will culminate in the production of a thesis by each individual student.

Guidelines:
Project Report Format:
At the end of semester a student need to prepare a project report should be prepared as per the guidelines
issued by the University of Mumbai. Along with project report a CD containing: project documentation,
Implementation code, requ ired utilities, Software‘s and user Manuals need to be attached.

Term Work:
Student has to submit weekly progress report to the internal guide and where as internal guide has to
keep track on the progress of the project and also has to maintain attendanc e report. This progress report
can be used for awarding term work marks. In case of industry projects, visit by internal guide will be
preferred to get the status of project.

Distribution of marks for term work shall be as follows:
a) Weekly Attendance on Project Day
b) Project work contributions as per objective
c) Project Report (Hard Bound)
d) Term End Presentation (Internal)
The final certification and acceptance of TW ensures the satisfactory performance on the above aspects.

Oral & Practical :
Oral & Practical examination of Project - II should be conducted by Internal and External examiners
approved by University of Mumbai. Students have to give presentation and demonstration on the Project -
II.