Sem 6 Syllabus

Shri Vile Parle Kelavani Mandal’s
Dwarkadas J. Sanghvi College of Engineering

(Autonomous College Affiliated to the University of Mumbai)
Course Structure and Syllabus

of
Third Year B. Tech.
in
Computer Engineering
Prepared by:- Board of Studies in Computer Engineering

Recommended by:- Academic Council of D. J. Sanghvi College of Engineering
Approved by:- Governing Body of D. J. Sanghvi College of Engineering
Revision: 1 (2021)
With effect from the Academic Year: 2021-2022
Scheme for Third Year B.Tech. Program in Computer Engineering : Semester VI (Autonomous)
(Academic Year 2021-2022)
Semester VI
Teaching Scheme Semester End Examination (A) Continuous Assessment (B) Aggregate Credits earned
(A+B)
Termwork
End
Sr Course Code Course Term CA
Theory Practical Tutorial Sem Term Test 1 Avg (TT1
Credits Duration Theory Oral Pract Oral & Pract Test 2 Total
(hrs.) (hrs.) (hrs.) Exam (TT1) & TT2) Term Work
(TT2)
Total Total
DJ19CEC601 Software Engineering 3 -- -- 3 3 75 -- -- -- 75 25 25 25 -- 25 100 3

1 4
DJ19CEL601 Software Engineering Laboratory -- 2 -- 1 2 -- 25 -- -- 25 -- -- -- 25 25 50 1
DJ19CEC602 Advance Algorithm 3 -- -- 3 3 75 -- -- -- 75 25 25 25 -- 25 100 3

2 4
DJ19CEL602 Advance Algorithm Laboratory -- 2 -- 1 2 -- -- -- 25 25 -- -- -- 25 25 50 1
DJ19CEC603 Information Security 3 -- -- 3 3 75 -- -- -- 75 25 25 25 -- 25 100 3

3 4
DJ19CEL603 Information Security Laboratory -- 2 -- 1 2 -- -- -- 25 25 -- -- -- 25 25 50 1
DJ19CEEC6011 Big Data Infrastructure 3 -- -- 3 3 75 -- -- -- 75 25 25 25 -- 25 100 3
DJ19CEEL6011 Big Data Infrastructure Laboratory -- 2 -- 1 2 -- 25 -- -- 25 -- -- -- 25 25 50 1
DJ19CEEC6012 Internet of Things 3 -- -- 3 3 75 -- -- -- 75 25 25 25 -- 25 100 3

4@ 4
DJ19CEEL6012 Internet of Things Laboratory -- 2 -- 1 2 -- 25 -- -- 25 -- -- -- 25 25 50 1
DJ19CEEC6013 Business Analytics 3 -- -- 3 3 75 -- -- -- 75 25 25 25 -- 25 100 3
DJ19CEEL6013 Business Analytics Laboratory -- 2 -- 1 2 -- 25 -- -- 25 -- -- -- 25 25 50 1
DJ19CEEC6021 Machine Learning 3 -- -- 3 3 75 -- -- -- 75 25 25 25 -- 25 100 3
DJ19CEEL6021 Machine Learning Laboratory -- 2 -- 1 2 -- 25 -- -- 25 -- -- -- 25 25 50 1
DJ19CEEC6022 Compiler Design 3 -- -- 3 3 75 -- -- -- 75 25 25 25 -- 25 100 3

5@ 4
DJ19CEEL6022 Compiler Design Laboratory -- 2 -- 1 2 -- 25 -- -- 25 -- -- -- 25 25 50 1
DJ19CEEC6023 Human Machine Interaction 3 -- -- 3 3 75 -- -- -- 75 25 25 25 -- 25 100 3
DJ19CEEL6023 Human Machine Interaction Laboratory -- 2 -- 1 2 -- 25 -- -- 25 -- -- -- 25 25 50 1
6 DJ19ILL2 Innovative Product Development - IV -- 2 -- 1 2 -- 25 -- -- 25 -- -- -- 25 25 50 1 1
7 DJ19A5 Environmental Studies 1 -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
Total 16 12 0 21 27 375 100 0 50 525 125 125 125 150 275 800 21 21
@ Any 1 Elective Course
Prepared by: HoD

Name and Signatures (with date) Department of Computer Engineering Vice-Principal Principal
Checked By
Name and Signatures (with date)
Syllabus for Third Year B.Tech Program in Computer Engineering- Semester VI (Autonomous)
Detailed Syllabus: (unit wise)
Unit Description Hours

1 Introduction to Software Engineering and Process Models: 10
Nature of Software, Software Engineering, Software Process, CMM, Generic Process Model.
Prescriptive Process Models: The Waterfall Model, V Model.
Incremental Process Model: Incremental Model
Evolutionary Process Models: Prototyping Paradigm, The Spiral Model
Concurrent Process Models: Concurrent Process Model
The Unified Process
Agile Methodology: Agility Principals, Agile Process Models: Extreme Programming (XP),
Adaptive Software Development (ASD), Dynamic Systems Development Method (DSDM),
Scrum, Crystal, Feature Driven Development (FDD), Agile Modeling (AM), Kanban Model.
2 Requirement Analysis and Project Estimation: Requirement Elicitation, Software 08
Requirement Specification (SRS).
Requirement Models: Scenario Based Models, Class Based Models, Behavioural Models
and Flow Models.
Software Project Estimation: LOC, FP, Empirical Estimation Models COCOMO I
COCOMO II, Specialized Estimation Techniques.
3 Design Engineering and Analysis: 06
Design Principles, Design Concepts, Effective Modular Design-Cohesion and Coupling.
Translating the requirement models into the design model.
Designs
Architectural Design, Component Level Design, User Interface Design.
4 Project Scheduling and Control: 04
Management Spectrum, 3Ps, Process and Project Metrics
Scheduling
Work Breakdown Structure, Network Diagram, Gantt Chart.
5 Software Risk: 05
Risk Identification, Risk Assessment, Risk Projection, Risk Refinement, RMMM Plan.
Software Configuration Management:
SCM, SCM Repositories, SCM Process, Change Control and Version Control.
6 Software Testing Fundamentals: 06
Strategic Approach to Software Testing, Unit Testing, Integration Testing, Verification,
Validation Testing, System Testing, Test Strategies for WebApps
Software Testing Techniques:
White Box Testing, Basis Path Testing, Control Structure Testing and Black Box Testing.
TDD
7 Latest Trends In Software Development Engineering: 03
DevOps: DevOps Toolchain, DevOps Architecture (e.g. Docker), DevOps for Deployment.
Books Recommended:
36 | P a g e
Text books:
1. Roger Pressman, “Software Engineering: A Practitioner’s Approach”, McGraw-Hill Publications 7th

Edition.
2. Ian Sommerville, “Software Engineering”, Pearson Education 9th Edition.
3. Ali Behfrooz and Fredeick J. Hudson, “Software Engineering Fundamentals”, Oxford University Press.
Reference Books:
1. Ugrasen Suman, “Software Engineering-Concepts and Practices”, Cengage Learning
2. Pankaj Jalote, “An integrated approach to Software Engineering”, Springer/Narosa
3. Jibitesh Mishra and Ashok Mohanty, “Software Engineering”, Pearson
4. Rajib Mall, “Fundamentals of Software Engineering”, Prentice Hall India.
5. “Machine Learning Applications in Software Engineering” Volume 16, World Scientific by Du Zhang
and P Tsai
Suggested List of Experiments:
Lab Title
Session
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 testing techniques.
11 Experiment on DevOps application.
Any other practical covering the syllabus topics and subtopics can be conducted.
37 | P a g e
Evaluation Scheme:
Semester End Examination (A):
Theory:
1. Question paper based on the entire syllabus will comprise of 5 questions (All compulsory, but with
internal choice as appropriate), each carrying 15 marks, total summing up to 75 marks.
2. Total duration allotted for writing the paper is 3 hrs.
Laboratory:
1. Oral examination will be based on the entire syllabus of course DJ19CEC601 including the practical
performed during laboratory sessions of course DJ19CEL601.
2. Oral examination will be of 25 marks.
Continuous Assessment (B):
Theory:
1. Two term tests of 25 marks each will be conducted during the semester out of which; one will be a
compulsory term test (on minimum 02 Modules) and the other can either be a term test or an assignment
on live problems.
2. Total duration allotted for writing each of the paper is 1 hr.
3. Average of the marks scored in both the two tests will be considered for final grading.
Laboratory: (Term work)

Laboratory work will be based on DJ19CEL601 with minimum 10 experiments.
The distribution of marks for term work shall be as follows:
1. Laboratory work (Performance of Experiments): 15 Marks
2. Journal Documentation (Write-up and Mini Project): 10 marks
The final certification and acceptance of term work will be subject to satisfactory performance of laboratory work
and upon fulfilling minimum passing criteria in the term work.
Note: Mini Project Presentations can be conducted if required.
Prepared by Checked by Head of the Department Principal
38 | P a g e
Program: Third Year Computer Engineering Semester : VI
Course : Advance Algorithm Course Code: DJ19CEC602
Course: Advance Algorithm Laboratory Course Code: DJ19CEL602
Evaluation Scheme
Teaching Scheme
Semester End Continuous Assessment
(Hours / week) Total
Examination Marks (A) Marks (B)
Term Term marks

Theory Avg. (A+ B)
Test 1 Test 2
Total
Lectures Practical Tutorial
Credits 75 25 25 25 100
Laboratory Examination Term work
Tutorial / Total
Oral & Mini project Term
Laboratory
Oral Practical Practica / work 50
Work
3 2 -- 4 l presentation/
Journal
-- -- 25 15 10 25
Prerequisite: Concepts of Data structures, Discrete Mathematics and Analysis of Algorithm
Objectives: To provide conceptual and practical knowledge of Advance Algorithm
Outcomes: On completion of the course, learner will be able to:
1. Analyze the chosen algorithm.

2. Choose appropriate data structure and algorithm for given problem statement.
3. Design the algorithm.
39 | P a g e
Unit Description Hours

1 Analysis of Algorithm Based on Time: 6
Asymptotic notations: Omega, Theta, Big-O, Small-o, small Omega and Tilde
Amortized Analysis: Aggregate Method, Accounting Method, Potential Method
Beyond worst-case analysis
Dynamic tables and its amortized analysis
RAM model analysis of algorithm
2 Probabilistic and Randomized Algorithm: 6

Probabilistic approach to algorithm and Randomized Analysis
Indicator Random Variable (IRV)
Randomized Quick Sort
Analysis of Hiring Problem (Flipped Classroom: Analysis of Birthday Paradox Problem,
Bins and Balls Problem using IRV)
Numerical Probabilistic algorithms with example
Las Vegas and Monte Carlo algorithm
Game theoretic randomized algorithm techniques (Tic-Tac-Toe)
3 Advanced Data Structures: 12

Balanced Search Trees: Red-Black Tree, Randomized BST, Tango Tree
Heap and Operations: Binomial Tree, Binomial Heap
Spatial Data Structure: KD Tree, R Tree (Flipped Classroom: R* Tree)
Probabilistic Data Structure: LogLog and HyperLogLog, MinHash with Data mining
context. (Flipped Classroom: Count-Min Sketch with Data mining context)
4 Graph Based Algorithms: 6

Flow Network Introduction: Residual Network, Augmenting Path, Ford-Fulkerson
Method, Edmonds-Karp Method, Push-Relable Algorithm (Flipped Classroom: Relable to
Front algorithm)
Bipartite Matching: Maximum Bipartite Matching, Weighted Bipartite Matching,
Weighted Non-Bipartite Matching (Edmonds algorithm)
Max Flow Min Cut
5 Computational Geometry: Line Segment Properties, Convex Hull Graham’s scan 6

algorithm, Determining whether any pair of segments intersects, Finding the closest pair of
points. (Flipped Classroom: Conic Programming)
Geometric Searching: Point Location in polygon using Ray Crossing.
Online Algorithms: River Search Problem, Competitive Ratio, K-Server (Flipped
Classroom: List accessing, Paging)
40 | P a g e
6 Algorithm Classes: P, NP, NP Hardness and NP Completeness 6

Np Completeness Proofs: Satisfiability(3 sat), Reducibility, TSP (Flipped Classroom:
Sum of Subsets)
Approximation Algorithms: Vertex Cover Problem, Travelling SalesPerson problem
Network Approximation: Randomized Rounding, Primal Dual algorithms
Randomized Classes: RP, BPP, ZPP (Adleman’s theorem)
Special Topic: Turing Machine Halting Problem (time and space bounds,
nondeterminism), Diagonalization problem.
Books Recommended:
Text books:
1. Introduction to Algorithms by Thomas H Cormen, Charles E. Leiserson, Ronald L Rivest, Clifford Stein,
Third Edition.
2. Design and analysis of algorithms by S. Sridhar
3. Horowitz, Sahani and Rajsekaran, ―Fundamentals of Computer Algorithms‖, Galgotia.
4. 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.
4. Computational Complexity, Stanford University.
Lab Title
Session
1 Experiment on Amortized Analysis
2 Experiment on Randomized Algorithms (Randomized Quick Sort)
3 Experiment on Advanced Data Structure (Red-black Tree Operations)
4 Experiment on Graph Based Algorithms (Ford Fulkerson Method)
5 Experiment on Online Algorithms (K-Server algorithm)
● Students need to select the problem statement of relevance and provide the implementable solution by
selecting appropriate Advance Data structure and Advance Algorithm.
● Also perform Analysis of the same.
Any other practical covering the syllabus topics and subtopics can be conducted.
41 | P a g e
Evaluation Scheme:
Theory:
1. Question paper based on the entire syllabus will comprise of 5 questions (All compulsory, but with
internal choice as appropriate), each carrying 15 marks, total summing up to 75 marks.
Laboratory:
1. Oral and practical examination will be based on the entire syllabus of course DJ19CEC602 including the
practical performed during laboratory sessions of course DJ19CEL602.
2. Oral and practical examination will be of 25 marks.
Theory:
on live problems.
Laboratory work will be based on DJ19CEL602 with minimum 6 experiments to be incorporated.

2. Journal Documentation (Write-up and solution of selected problem statement): 10 marks
42 | P a g e
Program: Third Year B.Tech. in Computer Engineering Semester : VI
Course : Information Security Course Code: DJ19CEC603
Course : Information Security Laboratory Course Code: DJ19CEL603
Evaluation Scheme
Teaching Scheme
Semester End Continuous Assessment Marks
Examination Marks (A) (B)
marks
Term Term
Total Theory Avg. (A+ B)
Lecture Practica Test 1 Test 2
Tutorial Credit
s l
s
75 25 25 25 100
Tutorial Total
/ Mini Term
Oral
Laboratory project /
Oral Practical &Practic work 50
Work present
3 2 - 4 al
ation/
Journal
- - 25 15 10 25
Pre-requisite: Knowledge of Programming Basics and Computer Network.
Objectives:
1. To introduce classical encryption techniques and concepts of modular arithmetic and number theory.
2. To explore the working principles and utilities of symmetric cryptographic algorithms.
3. To distinguish symmetric and asymmetric cryptography and explore the working principles and utilities
of asymmetric cryptographic algorithms.
4. To understand data integrity and explore the design issues and working principles of various
authentication protocols, PKI standards and various secure communication standards
5. To understand network and system attacks and develop utility programs for secure communication.
6. To explore Software vulnerability and develop and apply preventive measures.
1. Understand system security goals and concepts, classical encryption techniques and acquire fundamental
knowledge on the concepts of modular arithmetic and number theory.
2. Understand, compare and apply different encryption and decryption techniques to solve problems related
to confidentiality and authentication
3. Apply the knowledge of cryptographic checksums and evaluate the performance of different message digest
algorithms for verifying the integrity of varying message sizes.
4. Apply different digital signature algorithms to achieve authentication and design secure applications
5. Understand network security basics, analyze different attacks on networks and systems.
6. Understand Software vulnerability and Apply preventive measures.
43 | P a g e
Unit Description Duration
1 Introduction and Number Theory 07
Services, Mechanisms and attacks-the OSI security architecture-Network security model

classical Encryption techniques (Symmetric cipher models, substitution techniques,
transposition Techniques), Number theory Groups, Rings, Fields-Modular arithmetic-
Euclid’s algorithm-Finite fields-Polynomial Arithmetic –Prime numbers-Fermat’s and
Euler’s theorem, Chinese Remainder theorem.
2 Symmetric Cryptography: 07
Block cipher principles block cipher modes of operation, Simplified Data Encryption
Standard (DES), DES, Double DES, Triple DES, Simplified Advanced Encryption
Standard (S-AES), AES- Blowfish, IDEA.
3 Asymmetric Cryptography: 08
Symmetric vs. Asymmetric Cryptography, Principles of public key cryptosystems, and

Essential Number Theory for Public-Key Algorithm: Euclidean algorithm, Extended
Euclidean Algorithm, Euiler’s Phi Function, Fermat’s Little Theorem and Euiler’s
Theorem. The RSA algorithm, Key management, Diffie Hellman Key exchange, Elliptic
curve arithmetic, Elliptic curve cryptography.
4 Integrity, Authentication and Digital Certificates: 07
Cryptographic hash functions, Properties of secure hash function, MD5, SHA-1, MAC,
HMAC, CMAC. User Authentication and Entity Authentication, One-way and mutual
authentication schemes, Needham Schroeder Authentication protocol, Kerberos
Authentication protocol. RSA Signature Schemes, Elgamal Digital Signatures, Digital
Signature Algorithm. Digital Certificate: X.509, PKI.
5 Network Security: 08
Network security basics: TCP/IP vulnerabilities (Layer wise), Packet Sniffing, ARP
spoofing, port scanning, IP spoofing, TCP syn flood, DNS Spoofing. 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. Internet
Security Protocols: SSL, IPSEC, Secure Email: PGP, Firewalls, IDS and types, Honey pots,
Case Study on Network Security.
44 | P a g e
6 Software Security 05
Software Vulnerabilities: Buffer Overflow, Salami Attack, Format string, cross-site

scripting, SQL injection, Malware: Viruses, Worms, Trojans, Logic Bomb, Bots, Rootkits
Introduction to Secured Software Development Life Cycle. , Case Study on Software
Security.
Books Recommended:
Text books:
1. William Stallings, Cryptography and Network Security, Principles and Practice, 7thEdition, Pearson Education,
June 2017.
2. Behrouz A. Ferouzan, ―Cryptography & Network Security, Tata Mc Graw Hill, 2007
Reference Books:
1. Applied Cryptography, Protocols Algorithms and Source Code in C, Bruce Schneier, Wiley.
2. Charles Pfleeger, Shari Lawrence Pfleeger & Jonathan Margulies, Security in Computing, 5th Edition,
Prentice Hall
3. Secured Development Life Cycle by Michael Howard, Steve Lipner , Microsoft Press.
List of Laboratory Experiments: (Any Seven)
Sr. No. Title of the Experiment
1 Design and Implement Caesar cipher cryptographic algorithm by considering letter [A..Z] and digits
[0..9]. Apply Brute Force Attack to reveal secret.
2 Design and Implement Encryption and Decryption algorithm using Simple Columnar Transposition
cipher technique. Study how dictionary attack can be applied on it.
3 Design and Implement your “own” cipher combining “Substitution” and “Transposition” techniques.
4 Implement RSA Cryptosystem using RSA Algorithm / Implement Elliptical Curve Digital Signature
Algorithm (ECDSA).
5 Demonstrate the data integrity using various cryptographic algorithms viz. MD-5, SHA-1 using
VLAB, IIT Bombay.
6 Implement registration webpage asking for information along with the password (Strong enough).
Store the password in database in encrypted form after adding few salt characters in the password.
Verify the strength of password and perform analyses using various attack.
45 | P a g e
7 Study the use of network reconnaissance tools like WHOIS, dig, traceroute, nslookup to gather
information about networks and domain registrars.
8 Study of packet sniffer tools wireshark, : Download and install wireshark and capture icmp, tcp, and
http packets in promiscuous mode. Explore how the packets can be traced based on different filters.
9 Implementation of Network Intrusion Detection System using SNORT and IPTABLE
10 Implement DOS Attack using HPing, Hping3 and other tools.
11 Implement Buffer Overflow Attack using Ollydbg, Splint, Cppcheck
Any other experiment based on syllabus may be included, which would help the learner to understand topic/concept.
Evaluation Scheme:
Theory:
1. Question paper based on the entire syllabus will comprise of 5 questions (All compulsory, but with internal
choice as appropriate), each carrying 15 marks, total summing up to 75 marks.
Laboratory:
1. Oral and practical examination will be based on the entire syllabus including, the practicals performed during
laboratory sessions.

Theory:
compulsory term test (on minimum 02 Modules) and the other can either be a term test or an assignment on
live problems or a course project.
Term work shall consist of minimum 7 experiments, 1 Power Point Presentation and minimum 2 assignments.
i. Laboratory work (Performance of Experiments): 15 Marks

ii. Journal Documentation (Write-up, Power Point Presentation and Assignments: 10 marks
46 | P a g e
Course : Big Data Infrastructure Course Code: DJ19CEEC6011
Course : Big Data Infrastructure Laboratory Course Code: DJ19CEEL6011
Evaluation Scheme
Teaching Scheme
(Hours / week)
Examination Marks (A) Marks (B) Total marks
Term Term (A+ B)
Theory Avg.
Tuto Total Test 1 Test 2
Lectures Practical
rial Credits
75 25 25 25 100
Tutorial /
Total
Mini
Oral Labor Term
project /
Oral Practical &Practi atory work 50
presentati
3 2 - 4 cal Work
on/
Journal
25 - - 15 10 25
Pre-requisite: Databases, Python ,Java,R, Linux OS

Course Objectives:
1. To define big data solutions for business intelligence.
2. To analyse business case studies for big data analytics.
3. To develop map-reduce analytics using Hadoop and related tools.
4. To perform data storage and management using NoSqL.
5. To perform realtime analysis on streaming data.
Outcomes: Students will be able to

1. Describe big data and use cases from selected business domains.
2. Perform map-reduce analytics using Hadoop.
3. Use Hadoop related tools such as HBase, Cassandra, Pig, and Hive for big data Analytics
4. Build and maintain reliable, scalable, distributed systems using Apache Spark.
5. Design and build MongoDB based Big data Applications and learn MongoDB query language.
6. Use streaming tools for real time analysis of bigdata.
47 | P a g e
Uni
Description Duration
t
1 Introduction to Big Data and Hadoop 02

● Introduction to Big Data
● Distributed file system
● Big Data characteristics, Drivers, types of Big Data,
● Traditional vs. Big Data business approach,
● Case Study of Big Data Solutions.
● Bigdata Applications
● Societal and Ethical issues associated with the use of big data analytics
● The key privacy issues.
2 INTRODUCTION TO HADOOP AND HADOOP ARCHITECTURE 08

● Big Data – Apache Hadoop & Hadoop EcoSystem
● Moving Data in and out of Hadoop – Understanding inputs and outputs of
MapReduce Concept of Hadoop
● HDFS Commands
● MApReduce-The Map Tasks, Grouping by Key, The Reduce Tasks, Combiners,
Details of MapReduce Execution
3 HDFS, HIVE AND HIVEQL, HBASE 12

● HDFS-Overview, Installation and Shell, Java API;
● Hive Architecture and Installation, Comparison with Traditional Database,
HiveQL Querying Data, Sorting And Aggregating,
● Map Reduce Scripts, Joins & Sub queries
● HBase concepts, Advanced Usage, Schema Design, Advance Indexing, PIG-
Grunt – pig data model – Pig Latin – developing and testing Pig Latin scripts
● Zookeeper , how it helps in monitoring a cluster
● Build Applications with Zookeeper and HBase
4 SPARK 06
● Introduction to Data Analysis with Spark
● Downloading Spark and Getting Started
● Programming with RDDs
● Machine Learning with MLlib.
5 NoSQL 08
● Types of NoSQL databases, Why NoSQL?, Advantages of NoSQL, Use of
NoSQL in Industry, SQL vs NoSQL,
● Introduction to MongoDB key features:
48 | P a g e
● Core Server tools, MongoDB through the JavaScript’s Shell, Creating and
Querying through Indexes, Document-Oriented, principles of schema design,
Constructing queries on Databases, collections and Documents , MongoDB Query
Language.
6 Processing of Real Time Data and Streaming Data 06

● Data Streams: Introduction and Ingestion
● Kafka
● Storm & Storm Assignment
● Spark Streaming
Books Recommended:
Text Books
1. Understanding Big data - Chris Eaton,Dirk derooset al. McGraw Hill
2. MongoDB in Action - Kyle Banker,Piter Bakkum, Shaun Verch, Dream tech Press
3. Beginning Apache Pig-Big Data Processing Made Easy-Balaswamy Vaddeman, Apress'
4. Tom White, "Hadoop: The Definitive Guide", Third Edition, O'Reilley, 2012.
5. Eric Sammer, "Hadoop Operations", Reilly, 2012.
Reference Books
1. Paul Zikopoulos, Chris Eaton, Dirk DeRoos, Tom Deutsch, George Lapis, Understanding Big Data:
Analytics for Enterprise Class Hadoop and streaming Data,The McGraw-Hill Companies, 2012.
2. Vignesh Prajapati, Big data analytics with R and Hadoop, SPD 2013.
3. E. Capriolo, D. Wampler, and J. Rutherglen, "Programming Hive", O'Reilley, 2012.
4. Alan Gates, "Programming Pig", O'Reilley, 2011

1. Installation of Hadoop on a single node cluster
2. Execution OF HDFS Commands.
3. Execution of MapReduce program for sorting of numbers and counting word occurrences in
a text file.
4. Execute HIVE commands to load, insert, retrieve, update, or delete data in the tables.
5. Execute PIG built in commands and rum pig scripts on HDFS
6. Installation and Configuration of Apache Spark
7. Execution of ML algorithms using Apache Spark Mlib
49 | P a g e
8. Perform CRUD Operations using Mongodb
9. Read streaming data using Kafka.
10. Perform Twitter Sentiment analysis usinfg Spark Streaming
Evaluation Scheme:
Theory:
1. Question paper based on the entire syllabus, summing up to 75 marks.
Laboratory:
Oral examination will be based on the entire syllabus including the practicals performed during laboratory
sessions.
Theory:
on live problems or a course project.
3. Average of the marks scored in the two tests will be considered for final grading.

Laboratory work will be based on DJ19CEEC6011 with minimum 06 experiments along with a mini project to be
incorporated.

2. Journal Documentation (Write-up and Assignments: 10 marks
50 | P a g e
Course : Internet of Things Course Code: DJ19CEEC6012
Course : Internet of Things Laboratory Course Code: DJ19CEEL6012
Evaluation Scheme
Teaching Scheme
Semester End
Continuous Assessment
(Hours / week) Examination Marks Total
Marks (B)
(A)
marks
Term Term (A+ B)
Theory Avg.
Test 1 Test 2
Tuto Total
Lectures Practical 75 25 25 25 100
rial Credits
Laboratory
Term work
Examination
Total
Tutorial / Term
Oral Laborat Mini project
Practi work 50
Oral &Practic ory /
cal
al Work presentation/
3 2 - 4 Journal
25 - - 15 10 25
Pre-requisite: Basics of python programming, Computer Networks
Course Objectives:
1. Provide an overview of concepts, trends and challenges of Internet of Things.

2. Impart the knowledge of sensors and embedded systems.
3. Describe IoT deployment levels and M2M technologies
4. Facilitate use of hardware and software technologies related to Internet of Things.
5. Provide the knowledge of IoT communication models and protocols.
6. Develop skills to relate the IoT technologies for practical IoT applications.
Outcomes: At the end of the course, learner will be able to
1. Comprehend the Internet of Things concepts and investigate the challenges.

2. Gain knowledge of sensors and embedded systems.
3. Develop and deploy IoT system prototype with enhanced IoT Technologies.
4. Get hand-on exposure to different IoT processors and controllers
5. Use IoT communication models and protocols.
6. Design and develop small IoT applications to create smart objects
51 | P a g e

1 Introduction to WSN and IoT: 04
Introduction to WSN and its Technologies, Architecture and characteristics of WSN,

Scalability issues and challenges of a Wireless Sensor Network
Introduction to Internet of Things, Characteristics and applications of IoT, IoT Reference
Model, Security issues in the IoT, Disambiguation of IoT vs IoE vs M2M vs others
2 Transducers, Sensors and Actuators: 05
Introduction and classification of Transducers, Sensors and Actuators, Types of Sensors:

Motion Detectors, Occupancy Detectors, Force Sensors, Strain Sensors, Tactile sensors,
Pressure sensors, Chemical sensors, Temperature Sensors etc. Types of Actuators,
Solenoid, Voice Coil, DC Motor, AC Motor and Stepper motor, Embedded systems:
Characteristics of Embedded Systems
3 Introduction to Arduino and Raspberry Pi: 08
Pin configuration and architecture, Device and platform features, Concept of digital and
analog ports, Familiarizing with Arduino Interfacing Board and its types, Introduction to
Embedded C and Arduino platform
Introduction to Raspberry Pi, Comparison of various Rpi Models,

Understanding SoC architecture and SoCs used in Raspberry Pi, Pin Description of
Raspberry Pi, On-board components of Rpi
4 IoT model and protocols: 10
IoT Levels & Deployment Templates, IoT Level 1, IoT Level 2, IoT Level 3, IoT Level 4,
IoT Level 5, IoT Level 6, M2M, Various operating systems, TinyOS, Contiki OS,
MANTIS, Protocol Classification, MQTT, XMPP, DDS, AMQP, COAP, REST, IPv6,
6LoWPAN, Comparison of protocols
IoT Routing Protocols, Data-centric and Flat-Architecture Protocols, Flooding, Gossiping,

Sensor Protocols for Information via Negotiation (SPIN), SPIN PP, SPIN EC ( Energy
Conserve), SPIN BC, Hierarchical Protocols, LEACH, QoS-Based Protocols
5 IoT applications : 08
IoT for Entertainment and wearables: Bluetooth Headset, Fitness, Smart Watch,
location and Tracking – Personal navigation Device
IoT for Manufacturing: Flow Optimization, Real Time Inventory, Asset Tracking
Process, Analytics (pH, Gas, Concentration, Force& Humidity)- portable data terminal,
IoT for Employee safety – Fire and safety detector, Predictive Maintenance, Firmware
Updates, IoT for healthcare : Remote Monitoring-ECG, Ambulance Telemetry, Drug
Tracking, Hospital Asset Tracking, Access Control, Predictive Maintenance, IoT for
Logistics & Supply chain. Retail Supply chain control, NFC Payment, Intelligent
shopping application, Smart product management, Case studies on Smart cities, Smart
Home, Smart Environment, Smart Agriculture
52 | P a g e
6 05
IoT in Cloud, Fog and Edge Computing:
Overview of Cloud and Fog Computing, Definition, Difference between Fog and Cloud,
Related Paradigms and Technologies like MCC, MEC, Edge Computing, Taxonomy of
Fog Computing, Different dimensions of Fog computing Advantages and Applications.
Edge Computing: Architecture of Edge Computing, Benefits, Applications, Cloud, Fog
and Edge Computing Use Case Scenarios for IoT
7 05
Artificial Intelligence in IoT
Applications of Artificial Intelligence in Internet of Things,
Real world examples: Tesla Motors – Self Driving Cars, WildTrack – Endangered Species
Preservation, Nest Labs – Smart thermostat, Automated vacuum cleaner – iRobot Roomba
IoT companies and vendors: Commercially available IoT devices from vendors, Google
Home Voice Controller, Amazon Echo Plus Voice Controller, August Doorbell Cam,
August Smart Lock
Books Recommended:
1) Internet of Things by Srinivasa K.G., Siddesh G.M., Hanumantha Raju R., CENGAGE publication (Text Book)
2) Internet of Things: A Hands-On Approach by Arshdeep Bahga and Vijay Madisetti, Universities Press
3) Internet of Things, Architecture and Design Principles by Raj Kamal, Mc Graw Hill Education
Sr. Title of the Experiment

No.
Arduino
1. LED glow
2. Traffic signal
3. Seven segment display
4. Piezo sensor
5. Light emission
6. PIR sensor
7. IR remote control sensor
8. Ultrasonic sensor
9. ESP8266 WiFi Module
53 | P a g e
10. ThingSpeak Platform
11. Blynk App
12. Working with Own Cloud Server (Hosting)
13. Creating a platform to control home appliances with own server
R-Pi
1. Varying the brightness of LED using R-pi
2. Making a user interface to Turn Things On and Off
3. Controlling GPIO Outputs using a Web Interface
4. Create an user interface to control Servo motor
5. Camera Interfacing and Programming
6. Playing an Audio File
7. GSM/GPS interfacing and programming
8. Measuring distance
9. Displaying sensor values
10. Logging to a USB flash Drive
Evaluation Scheme:
Theory:
Laboratory:
1. Oral examination will be based on the entire syllabus including, the practical’s performed during
Theory:
54 | P a g e
Laboratory work will be based on DJ19CEEL6012 with minimum 10 experiments to be incorporated.

ii. Journal Documentation (Write-up and Assignments: 10 marks
55 | P a g e
Course : Business Analytics Course Code: DJ19CEEC6013
Course : Business Analytics Laboratory Course Code: DJ19CEEL6013
Teaching Scheme Evaluation Scheme

(Hours / week) Semester End Examination Continuous Assessment Marks
Marks (A) (B) Total
marks
Term Term
Theory Avg. (A+ B)
Test 1 Test 2
Total
Credits 75 25 25 25 100

Total
Tutorial / Mini Term
Laborat
Oral project / work
Oral Practical ory 50
&Practical presentation/
3 2 - 4 Work
Journal
25 - - 15 10 25
Pre-requisite: Basic statistics and Database
Course Objectives: Students will try to:

1. Business Analytics refers to skills, practices and techniques used in converting data into information
and knowledge that aid business decision making.
2. Statistical learning including quantitative, qualitative analysis techniques
3. The use of the above analysis and visualization to aid decision making.

1. Able to familiar with Base SAS programming.
2. Understand and demonstrate visual analytics.
3. Able to design the report using reporter
4. View various reports using different media devices.
56 | P a g e

1 Introduction to Base SAS: 08
SAS Program : Introduction to SAS program, Submitting a SAS program – SAS Studio, SAS
Enterprise Guide, SAS Windowing environment, SAS program syntax
Accessing Data :Examining SAS Data sets, Accessing SAS Libraries
Producing Detail Reports: Subsetting Report data, Sorting and Grouping Report data,
Enhancing Reports
Formatting Data Values: Using SAS Formats, User defined Formats
2 Reading SAS Dataset , Spreadsheet and Database data 05
Reading SAS Dataset.

Customize SAS Dataset.
Router Reading Spreadsheet data
Reading database data.
3 Visual Analytics 04
Getting Stated with SAS Visual Analytics: Exploring SAS VA concepts, Using Home page
Administrating the Environment and Managing Data: Exploring Data Builder, Exploring
Administrator.
Demonstrations and Exercises.
4 Using the Explorer 08
Selecting Data and defining Data Item properties
Creating Visualisations, Enhancing Visualisations with Analytics

Interacting with Visualizations and Explorations
5 Designing Reports with Reporter 08

Creating a Simple Report
Creating Data Items and Working with Graphs
Working with Filters and Report sections
Working with other objects
Demonstrations and Exercises
57 | P a g e
6 Viewing SAS VA Reports and Case Study 06
Creating Analyses and Reports.
Viewing Reports on the Web
Viewing Reports on the Mobile Device/ Office Analytics
Case Study – Creating Analyses and Reports
Books Recommended:
1. SAS programming 1 – Essentials.
2. SAS Visual Analytics – Fast Track.
3. SAS Support

1. Importing data in SAS from Excel and CSV file.
2. Creating summary statistical data.
3. Exporting results to Excel and PDF.
4. Manipulating data with functions.
5. Using data with formats like charts and graphs.
6. Creating data by applying filters and performing data analysis on it.
7. Working with graph level display rules.
8. Analyzing a Text data source.
Evaluation Scheme:

Theory:
Laboratory:
1. Oral examination will be based on the entire syllabus including the practical’s performed during laboratory
sessions.
58 | P a g e
Theory:
1.Two term tests of 25 marks each will be conducted during the semester out of which; one will be a compulsory
term test (on minimum 02 Modules) and the other can either be a term test or an assignment on live problems
or a course project.

Laboratory work will be based on DJ19CEEL6013 with minimum 06 experiments along with a mini
project to be incorporated.

59 | P a g e
Course : Machine Learning Course Code: DJ19CEEC6021
Course : Machine Learning Laboratory Course Code: DJ19CEEL6021
Evaluation Scheme
Teaching Scheme
Term Term marks
Theory Avg. (A+ B)
Total Test 1 Test 2
Tuto
Lectures Practical Credit
rial
s 75 25 25 25 100
Laboratory
Term work
Examination
Total
Tutorial / Term
Oral Mini project
Laboratory work 50
Oral Practical &Practi /
Work
cal presentation
3 2 - 4 / Journal
25 - - 15 10 25
Pre-requisite: Data Structures, Basic Probability and Statistics, Algorithms
Course Objectives:
1. To introduce students to the basic concepts and techniques of Machine Learning.

2. To become familiar with regression, classification and clustering tasks.
3. To become familiar with Dimensionality reduction Techniques.
1. Gain knowledge about basic concepts of Machine Learning

2. Identify machine learning techniques suitable for a given problem
3. Apply Dimensionality reduction techniques.
4. Solve the problems using various machine learning techniques
5. Understand the basics of Reinforcement and deep learning.
6. Design application using machine learning techniques
60 | P a g e

1 Introduction to Machine Learning 05
Types of Machine Learning, Issues in Machine Learning, Application of Machine
Learning, Steps involved in developing a Machine Learning Application.
2 Learning with Regression and trees: 07

Learning with Regression: Linear Regression, Logistic Regression.
Learning with Trees: Decision Trees, Constructing Decision Trees using Gini Index,
Classification and Regression Trees (CART).
3 Dimensionality Reduction: 07
Dimensionality Reduction Techniques: Principal Component Analysis, Independent
Component Analysis, Single value decomposition,
4 Learning with Classification and Clustering 12

Learning with Classification:
Artificial Neural Networks- Backpropagation Algorithm, Self-Organizing Maps
Non-parametric classification: K Nearest Neighbour Algorithm
Support Vector Machine: Maximum Margin Linear Separators, Quadratic Programming
solution to finding maximum margin separators, Kernels for learning non-linear functions.
Bayesian belief Networks: Markov Models, Markov Chain Monte Carlo Methods, ,
Markov Random Fields, Hidden Markov Models
Learning with Clustering:

K-means clustering, Hierarchical clustering, Expectation Maximization Algorithm
Supervised learning after clustering, Radial Basis functions.
5 Reinforcement and Deep Learning 05

Reinforcement Learning:
Introduction, Elements of Reinforcement Learning, Model based learning,
Temporal Difference Learning, Generalization, Partially Observable
States.
Deep Learning:
Introduction to Deep Neural Network, Wide Vs. Deep Neural Network, Reasons to opt for
deep neural network, Deep Neural networks for unsupervised learning
6 Applications of Machine Learning 04

Recommender Systems, Machine Learning for Image Recognition, Sentiment Analysis,
Machine Learning for video surveillance
61 | P a g e
Books Recommended:
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. Kevin P. Murphy , Machine Learning ― A Probabilistic Perspective‖
6. Andreas C. Müller and Sarah Guido- Introduction to Machine Learning with Python: A Guide for Data
Scientists,O'reilly
7. François Chollet, Deep Learning with Python| Manning
8. J.-S.R.Jang "Neuro-Fuzzy and Soft Computing" PHI 2003.
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

1. To implement Linear Regression
2. To implement Logistic Regression
3. To implement CART decision tree algorithm.
4. To implement Support Vector Machine.
5. To implement Bayesian Classification.
6. To implement PCA.
7. To implement K-Nearest Neighbour.
8. To implement Radial basis functions.
9. Mini project based on any machine learning application.
Evaluation Scheme:
Theory:
62 | P a g e
Laboratory:
1. Oral examination will be based on the entire syllabus including the practical’s performed during
Theory:

Laboratory work will be based on DJ19CEEL6021 with minimum 06 experiments along with a mini project
to be incorporated.

63 | P a g e
Program: Third Year B.Tech. in Computer Engineering Semester: VI
Course: Compiler Design Course Code: DJ19CEEC6022
Course: Compiler Design Laboratory Course Code: DJ19CEEL6022
Teaching Scheme Evaluation Scheme

Term Term marks
Theory Avg. (A+ B)
Total Test 1 Test 2
Credits
75 25 25 25 100

Total
Tutorial / Term
Oral
Laboratory Mini project / work
Oral Practical &Practi 50
Work presentation/
cal
3 2 - 4 Journal
25 - - 15 10 25
Pre-requisite: Data Structures and Algorithms, Theory of Computation
Course Objectives:
1. To initiate an understanding of compilers in general and in brief about phases of compiler.

2. To provide a theoretical framework for optimizing the code.
3. To familiarize and encourage the students to use various compiler construction tools.
Outcomes: On successful completion of course learner will be able to:
1. Understand the basics of compilation steps.

2. Apply knowledge of automata theory and formal languages.
3. Understand and Implement a Parser.
4. Describe techniques for intermediate code and machine code optimization.
5. Apply various Error Recovery mechanisms.
64 | P a g e

1 Introduction to compilers: 04
Compilers Analysis of source Program, the tasks of a compiler
Analysis of the Source Program, Phases and Passes in compilers, The Grouping of phases
Cousins of the compiler, Compiler - construction tools
Introduction to Interpreters: Phases of interpreter, Types of interpreter, Compiler vs.

Interpreter
2 Lexical Analysis: 04
Role of a Lexical analyser
Input buffering, specification and recognition of tokens
Designing a lexical analyser generator, Pattern matching based on NFA’s.
3 Syntax Analysis: 10
Role of Parser
Top--down parsing, Predictive parsers -(LL)
Bottom-Up parsing, Operator precedence parsing, SLR, CLR and LALR parsers.
4 Syntax directed Translation: 04
Syntax directed definitions, Inherited and Synthesized attributes, Evaluation order for
SDDs,S - attributed Definitions, L- attributed Definitions
5 Intermediate code generation: 06
Intermediate Code types: Postfix, Parse tree and syntax tree, Three address code.
Types of Three address code: Quadruples, Triples and Indirect triples
Translation of Assignment statements, Boolean expression, case statements, array
references and procedure calls.
6 Code generation: 04
Issues in the design of Code Generator, Basic Blocks and Flow graphs, Code generation
algorithm, DAG representation of Basic Block.
7 Code optimization: 04
Principal sources of Optimization
Optimization of Basic Blocks, Loops in Flow graph, Peephole Optimization
8 Run-time storage management: 06
Data Structures for symbol table, representing scope information, Error detection and
recovery, Error handling
Storage allocation strategies, parameter passing, introduction to garbage collection and
compaction
65 | P a g e
Books Recommended:
Text Book:
1. A. V. Aho, R. Shethi, Monica Lam, J.D. Ulman: Compilers Principles, Techniques and Tools, Pearson
Education, Second Edition.
Reference books:
1. Lex & yacc, 2nd Edition by John R. Levine, Tony Mason & Doug Brown O ‘Reilly
2. Compiler construction: principles and practices, Kenneth C.Louden ,CENGAGE Learning
Sr. No. Title of Experiments
1. Develop a lexical analyzer to recognize a few patterns in c (ex. Identifiers, constants, comments,
operators etc.)
2. Implementation of lexical analyzer using lex tool.
3. Derive First and Follow of a variable.
4. Design LL (1) Parser.
5. Implementation of Intermediate code generation.

1. Assignment statement
2. Boolean statement
3. Loop
6. Implementation of code generator algorithm
7. Implementation of code optimization techniques (constant folding etc.)
8. Case study: LLVM
Evaluation Scheme:
Theory:
Laboratory:
66 | P a g e
Theory:
2. Total duration allotted for writing each of the papers is 1 hr.
Laboratory work will be based on DJ19CEEL6022 with 10 experiments to be incorporated including 07

from the above suggested list.

ii. Journal Documentation (Write-up and Assignments): 10 marks
67 | P a g e
Program: Third Year B.Tech. in Computer Engineering Semester: VI
Course: Human Machine Interaction Course Code: DJ19CEEC6023
Course: Human Machine Interaction Laboratory Course Code: DJ19CEEL6023
Evaluation Scheme
Teaching Scheme
Examination Marks (A) Marks (B)
Term Term marks

Theory Avg. (A+ B)
Test 1 Test 2
Tuto Total
Lectures Practical
rial Credits 75 25 25 25 100

Tutoria
l/
Oral Mini Total
Labor Term
&Pr project
Oral Practical atory work
actic
Work
/ 50
3 2 - 4 al present
ation/
Journal
25 - - 15 10 25
Prerequisite: Web Technologies; Experience in designing interfaces for applications and web sites. Basic
knowledge of designing tools and languages like HTML, Java, etc
Course Objectives: At the end of the course, students will be able to –
1. Learn the foundation of human machine interaction.

2. Understand the importance of human psychology in designing good interfaces.
3. Be aware of mobile interaction design and its usage in day – to – day activities.
4. Understand various design technologies to meet user requirements.
5. Encourage to indulge into research in Machine Interaction Design.
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.
68 | P a g e
1 FOUNDATIONS OF HMI: 7
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.
2 DESIGN & SOFTWARE PROCESS: 8
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
prototyping. HMI in software process: software life cycle, usability engineering,
Prototyping in practice, design rationale. Design rules: principles, standards, guidelines,
rules. Recognize the goals, Goal directed design process. Evaluation Techniques:
Universal Design.
3 GRAPHICAL USER INTERFACE: 6
The graphical User Interface: Popularity of graphics, the concept of direct manipulation,
graphical systems, Characteristics. Web user Interface: Interface popularity,
characteristics. The merging of graphical Business systems and the Web. Principles of
user interface design.
4 SCREEN DESIGNING: 7
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.
5 INTERFACE DESIGN FOR MOBILE DEVICES: 6
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.
6 INTERACTION STYLES AND COMMUNICATION: 6
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
Books Recommended:
Text books:
1. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale, ―Human Computer Interaction‖, 3rdEdition, Pearson
Education, 2004.
2. Wilbert O. Galitz, ―The Essential Guide to User Interface Design‖, Wiley publication.
3. Alan Cooper, Robert Reimann, David Cronin, ―About Face3: Essentials of Interaction design‖,
Wiley publication.
4. Jeff Johnson, ―Designing with the mind in mind‖, Morgan Kaufmann Publication.
5. Donald A. Normann, ― Design of everyday things‖,Basic Books; Reprint edition 2002.
69 | P a g e
6. Brian Fling, ―Mobile Design and Development‖, First Edition , O‘Reilly Media Inc., 2009.
Reference Books:
1. Rogers Sharp Preece,‖Interaction Design:Beyond Human Computer Interaction‖,,Wiley.
2. Guy A. Boy ―The Handbook of Human Machine Interaction‖, Ashgate publishing Ltd.
3. Kalbnde,Kanade,Iyer,‖Galitz‘s Human Machine Interaction‖, Wiley Publications.
Sr. No. Title of Experiments
1. Design a Mobile app/ Website that can teach mathematics to children of 4-5 years age in schools in
Rural /Urban Sector
2. Design a Mobile App/Website that can help people to sell their handmade products in metro cities
3. ATM machine/KIOSK screen design for rural people.
4. Design a Mobile App/Website to get an experience for passengers whose flight /train is delayed.
5. Design an UI application for Institute event management.
6. Design of User interface for the system using various interaction styles.
7. Statistical Graphics and its use in visualization
8. Design appropriate icons pertaining to a given domain .(Eg. Greeting cards)
9. Design UI for Motor paralysis for disabled people.
10. KIOSK design for hospital/school/educational campus/National Institute.
Evaluation Scheme:
Theory:
Laboratory:
Theory:
70 | P a g e
Laboratory work will be based on DJ19CEEL6023 with minimum 08 experiments to be incorporated.

ii. Journal Documentation (Write-up and Assignments: 10 marks
71 | P a g e
Course Code: DJ19ILL2
Course : Innovative Product Development-IV
Evaluation Scheme
Teaching Scheme Semester End
(Hours/week) Continuous Assessment
Examination Marks
Marks (B) Total
(A)
marks
Term
Term (A+ B)
Theory Test Avg.
Tu Total Test 2
1
Practical tor Credi
Lectures
ial ts -- -- -- -- --
Laboratory
Termwork
Examination
Tutorial
Total
Labo / Mini
Oral & Term
Pract rator project /
Oral Practic work 50
ical y presentat
-- 02 -- 01 al
Work ion/
Journal
25 -- -- -- 25
Objectives:
1. To acquaint the students with the process of identifying the need (considering a societal requirement) and
ensuring that a solution is found out to address the same by designing and developing an innovative product.
2. To familiarize the students with the process of designing and developing a product, while they work as part
of a team.
3. To acquaint the students with the process of applying basic engineering fundamentals, so as to attempt at
the design and development of a successful value added product.
4. To inculcate the basic concepts of entrepreneurship and the process of self-learning and research required
to conceptualise and create a successful product.
Outcome:
Learner will be able to:
1. Identify the requirement for a product based on societal/research needs.
2. Apply knowledge and skills required to solve a societal need by conceptualising a product, especially while
working in a team.
3. Use standard norms of engineering concepts/practices in the design and development of an innovative
product.
4. Draw proper inferences through theoretical/ experimental/simulations and analyse the impact of the
proposed method of design and development of the product.
5. Develop interpersonal skills, while working as a member of theteam or as theleader.
6. Demonstrate capabilities of self-learning as part of the team, leading to life-long learning, which could
eventually prepare themselves to be successful entrepreneurs.
72 | P a g e
7. Demonstrate product/project management principles during the design and development work and also
excel in written (Technical paper preparation) as well as oral communication.
Guidelines for the proposed product design and development:
 Students shall form a team of 3 to 4 students (max allowed: 5-6 in extraordinary cases, subject to the
approval of the department review committee and the Head of the department).
 Students should carry out a survey and identify the need, which shall be converted into conceptualization
of a product, in consultation with the faculty supervisor/head of department/internal committee of faculty
members.
 Students in the team shall understand the effective need for product development and accordingly select
the best possible design in consultation with the faculty supervisor.
 Students shall convert the best design solution into a working model, using various components drawn from
their domain as well as related interdisciplinary areas.
 Faculty supervisor may provide inputs to students during the entire span of the activity, spread over 2
semesters, wherein the main focus shall be on self-learning.
 A record in the form of an activity log-book is to be prepared by each team, wherein the team can record
weekly progress of work. The guide/supervisor should verify the recorded notes/comments and approve the
same on a weekly basis.
 The design solution is to be validated with proper justification and the report is to be compiled in a standard
format and submitted to the department. Efforts are to be made by the students to try and publish a technical
paper, either in the institute journal, “Techno Focus: Journal for Budding Engineers” or at a suitable
publication, approved by the department research committee/ Head of the department.
 The focus should be on self-learning, capability to design and innovate new products as well as on
developing the ability to address societal problems. Advancement of entrepreneurial capabilities and quality
development of the students through the year long course should ensure that the design and development
of a product of appropriate level and quality is carried out, spread over two semesters, i.e. during the
semesters V and VI.
Guidelines for Assessment of the work:
 The review/ progress monitoring committee shall be constituted by the Head of the Department. The
progress of design and development of the product is to be evaluated on a continuous basis, holding
a minimum of two reviews in each semester.
 In the continuous assessment, focus shall also be on each individual student’s contribution tothe team
activity, their understanding and involvement as well as responses to the questions being raised at all
points in time.
 Distribution of term work marks during the subsequent semester shall be as given below:
o Marks awarded by the supervisor based on log-book : 10
o Marks awarded by review committee : 10
o Quality of the write-up : 05
In the last review of the semester VI, the term work marks will be awarded as follows.
 Marks awarded by the supervisor (Considering technical paper writing) : 15

 Marks awarded by the review committee : 10
73 | P a g e
Review/progress monitoring committee may consider the following points during the assessment.
 In the semester V, the entire design proposal shall be ready, including components/system selection
as well as the cost analysis. Two reviews will be conducted based on the presentation given by the
student’s team.
 First shall be for finalisation of the product selected.
 Second shall be on finalisation of the proposed design of the product.
 In the semester VI, the expected work shall be procurement of components/systems, building of the
working prototype, testing and validation of the results based on work completed in semester III.
 First review is based on readiness of building the working prototype.
 Second review shall be based on a presentation as well as the demonstration of the working
model, during the last month of semester IV. This review will also look at the readiness of
the proposed technical paper presentation of the team.
The overall work done by the team shall be assessed based on the following criteria;
1. Quality of survey/ need identification of the product.
2. Clarity of Problem definition (design and development) based on need.
3. Innovativeness in the proposed design.
4. Feasibility of the proposed design and selection of the best solution.
5. Cost effectiveness of the product.
6. Societal impact of the product.
7. Functioning of the working model as per stated requirements.
8. Effective use of standard engineering norms.
9. Contribution of each individual as a member or the team leader.
10. Clarity on the write-up and the technical paper prepared.
 The semester reviews (V and VI) may be based on relevant points listed above, as applicable.
Guidelines for Assessment of Semester Reviews:
 The write-up should be prepared as per the guidelines given by the department.
 The design and the development of the product shall be assessed through a presentation and demonstration
of the working model by the student team to a panel of Internal and External Examiners, preferably from
industry or any research organisations having an experience of more than five years, approved by the Head
of the Institution. The presence of the external examiner is desirable only for the 2nd presentation in semester
IV.Students are compulsorily required to present the outline of the technical paper prepared by them during
the final review in semester VI.
74 | P a g e
Course : Environmental Studies Course Code: DJ19A5
Evaluation Scheme
Teaching Scheme
(Hours / week) Semester End Continuous Assessment
Examination Marks (A) Marks (B) Total
marks
Term Term (A+ B)
Theory Avg.
Test 1 Test 2
Total
Credits - - - - -

Total
Tutorial / Term
Oral & Laboratory Mini project / work
Oral Practical -
Practical Work presentation/
1 - - - Journal
- - - - - -
Pre-requisite: Interest in Environment and its impact on Human
Objectives:
1. Understand environmental issues such as depleting resources, pollution, ecological problems and the
renewable energy scenario.
2. Familiarise environment related legislation
1. Understand how human activities affect environment

2. Understand the various technology options that can make a difference
75 | P a g e

1 Social Issues and Environment: 4
Ecological footprint and Carrying Capacity, Depleting nature of Environmental resources

such as soil, water minerals and forests, Carbon emissions and Global Warming.
2 Technological Growth for Sustainable Development: 4
Social, Economical and Environmental aspects of Sustainable Development, Renewable

Energy Harvesting, Concept of Carbon credit, Green Building, Power and functions of
Central Pollution Control Board and State Pollution Control Board.
3 Green Technology:
History, Agenda, and Challenges Ahead. Sustainable Cloud Computing, and Risk 5
Management, Sustainable Software Design, Data Center Energy Efficiency, Thin-Client and
Energy Efficiency.
Books Recommended:
Text books:
1. Environmental Studies From Crisis to Cure, R. Rajagopalan, 2012

2. Textbook for Environmental Studies For Undergraduate Courses of all Branches of Higher Education,
Erach Bharucha
3. Green Information Technology A Sustainable Approach, Mohammad Dastbaz, Colin Pattinson, Babak Akhgar,
Morgan and Kaufman, Elsevier, 2015.
Reference Books:
1. Information Technologies in Environmental Engineering: New Trends and Challenges, Paulina Golinska,
Marek Fortsch, Jorge Marx-Gómez, Springer, 2011.
76 | P a g e

Sem 6 Syllabus

Uploaded by

Copyright:

Available Formats

Sem 6 Syllabus

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Sem 6 Syllabus

Uploaded by

Copyright:

Available Formats

Shri Vile Parle Kelavani Mandal’s

Dwarkadas J. Sanghvi College of Engineering

Course Structure and Syllabus

Prepared by:- Board of Studies in Computer Engineering

DJ19CEC601 Software Engineering 3 -- -- 3 3 75 -- -- -- 75 25 25 25 -- 25 100 3

DJ19CEC602 Advance Algorithm 3 -- -- 3 3 75 -- -- -- 75 25 25 25 -- 25 100 3

DJ19CEC603 Information Security 3 -- -- 3 3 75 -- -- -- 75 25 25 25 -- 25 100 3

DJ19CEEC6011 Big Data Infrastructure 3 -- -- 3 3 75 -- -- -- 75 25 25 25 -- 25 100 3

DJ19CEEL6011 Big Data Infrastructure Laboratory -- 2 -- 1 2 -- 25 -- -- 25 -- -- -- 25 25 50 1

DJ19CEEC6012 Internet of Things 3 -- -- 3 3 75 -- -- -- 75 25 25 25 -- 25 100 3

DJ19CEEC6013 Business Analytics 3 -- -- 3 3 75 -- -- -- 75 25 25 25 -- 25 100 3

DJ19CEEL6013 Business Analytics Laboratory -- 2 -- 1 2 -- 25 -- -- 25 -- -- -- 25 25 50 1

DJ19CEEC6021 Machine Learning 3 -- -- 3 3 75 -- -- -- 75 25 25 25 -- 25 100 3

DJ19CEEL6021 Machine Learning Laboratory -- 2 -- 1 2 -- 25 -- -- 25 -- -- -- 25 25 50 1

DJ19CEEC6022 Compiler Design 3 -- -- 3 3 75 -- -- -- 75 25 25 25 -- 25 100 3

DJ19CEEC6023 Human Machine Interaction 3 -- -- 3 3 75 -- -- -- 75 25 25 25 -- 25 100 3

DJ19CEEL6023 Human Machine Interaction Laboratory -- 2 -- 1 2 -- 25 -- -- 25 -- -- -- 25 25 50 1

6 DJ19ILL2 Innovative Product Development - IV -- 2 -- 1 2 -- 25 -- -- 25 -- -- -- 25 25 50 1 1

7 DJ19A5 Environmental Studies 1 -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --

@ Any 1 Elective Course

Prepared by: HoD

Unit Description Hours

1. Roger Pressman, “Software Engineering: A Practitioner’s Approach”, McGraw-Hill Publications 7th

3 Use project management tool to prepare schedule for the project.

4 Prepare RMMM plan for the project.

7 Develop Activity / State Transition diagram for the project.

8 Develop Sequence and Collaboration diagram for the project.

10 Develop test cases for the project using testing techniques.

11 Experiment on DevOps application.

Semester End Examination (A):

Laboratory: (Term work)

Note: Mini Project Presentations can be conducted if required.

Prepared by Checked by Head of the Department Principal

Course : Advance Algorithm Course Code: DJ19CEC602

Course: Advance Algorithm Laboratory Course Code: DJ19CEL602

Term Term marks

Laboratory Examination Term work

Prerequisite: Concepts of Data structures, Discrete Mathematics and Analysis of Algorithm

Objectives: To provide conceptual and practical knowledge of Advance Algorithm

Outcomes: On completion of the course, learner will be able to:

1. Analyze the chosen algorithm.

Unit Description Hours

2 Probabilistic and Randomized Algorithm: 6

3 Advanced Data Structures: 12

4 Graph Based Algorithms: 6

5 Computational Geometry: Line Segment Properties, Convex Hull Graham’s scan 6

6 Algorithm Classes: P, NP, NP Hardness and NP Completeness 6

4 Experiment on Graph Based Algorithms (Ford Fulkerson Method)

5 Experiment on Online Algorithms (K-Server algorithm)

Semester End Examination (A):

Laboratory work will be based on DJ19CEL602 with minimum 6 experiments to be incorporated.

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

Prepared by Checked by Head of the Department Principal

Course : Information Security Course Code: DJ19CEC603

Course : Information Security Laboratory Course Code: DJ19CEL603

Laboratory Examination Term work

Outcomes: On completion of the course, learner will be able to:

Unit Description Duration

1 Introduction and Number Theory 07