B.tech. 3rd Yr CSE(IOT) 2022 23 Revised
B.tech. 3rd Yr CSE(IOT) 2022 23 Revised
B.tech. 3rd Yr CSE(IOT) 2022 23 Revised
On
AICTE Model Curriculum
SEMESTER- V
End
Sl. Subject Periods Evaluation Scheme
Subject Semester Total Credit
No.
Codes L T P CT TA Total PS TE PE
Dept.
4 Departmental Elective-I 3 0 0 30 20 50 100 150 3
Elective-I
Dept.
5 Departmental Elective-II 3 0 0 30 20 50 100 150 3
Elective-II
7 KOT551 0 0 2 25 25 50 1
Internet of ThingsLab
Design and Analysis of
8 KCS553 0 0 2 25 25 50 1
Algorithm Lab
Total 950 22
*The Mini Project or internship (4 weeks) conducted during summer break after IV semester and will be assessed during
V semester.
SEMESTER- VI
End
Sl. Subject Periods Evaluation Scheme
Subject Semester Total Credit
No.
Codes L T P CT TA Total PS TE PE
Dept
4 Departmental Elective-III 3 0 0 30 20 50 100 150 3
Elective-III
Total 900 21
Departmental Elective-I
1. KCS055 Machine Learning Techniques
2. KCS052 Web Designing
3. KOT051 Sensors, Actuators and Signal Processing
4. KCS054 Object Oriented System Design
5. KDS052 Distributed System
Departmental Elective-II
1. KOT052 Programming and Interfacing with Microcontrollers
2. KAI052 Natural Language Processing
3. KOT053 Wearable Computing, Mixed Reality and Internet of Everything
4. KOT054 Privacy and Security in IoT
5. KOT055 Embedded Systems and Real Time Operating System
Departmental Elective-III
1. KAI061 Cyber Forensic analytics
2. KOT061 Big Data Analytics for IoT
3. KOT063 Artificial Intelligence
4. KOT062 Energy Harvesting Technologies and Power Management for IoT Devices
5. KDS063 Software Engineering
B.TECH.
COMPUTER SCIENCE AND ENGINEERING (INTERNET OF THINGS)
FIFTH SEMESTER (DETAILED SYLLABUS)
Understand basic techniques for designing algorithms, including the techniques of recursion, K 2, K 3
CO 5
divide-and-conquer, and greedy.
DETAILED SYLLABUS 3-1-0
Unit Topic Proposed
Lecture
Introduction: Algorithms, Analyzing Algorithms, Complexity of Algorithms, Growth of
I Functions, Performance Measurements, Sorting and Order Statistics - Shell Sort, Quick Sort, Merge 08
Sort, Heap Sort, Comparison of Sorting Algorithms, Sorting in Linear Time.
Advanced Data Structures: Red-Black Trees, B – Trees, Binomial Heaps, Fibonacci Heaps,
II 08
Tries, Skip List
Divide and Conquer with Examples Such as Sorting, Matrix Multiplication, Convex Hull and
Searching.
III Greedy Methods with Examples Such as Optimal Reliability Allocation, Knapsack, Minimum 08
Spanning Trees – Prim’s and Kruskal’s Algorithms, Single Source Shortest Paths - Dijkstra’s and
Bellman Ford Algorithms.
Dynamic Programming with Examples Such as Knapsack. All Pair Shortest Paths – Warshal’s
and Floyd’s Algorithms, Resource Allocation Problem.
IV 08
Backtracking, Branch and Bound with Examples Such as Travelling Salesman Problem, Graph
Coloring, n-Queen Problem, Hamiltonian Cycles and Sum of Subsets.
Selected Topics: Algebraic Computation, Fast Fourier Transform, String Matching, Theory of NP-
V 08
Completeness, Approximation Algorithms and Randomized Algorithms
Text books:
1. Thomas H. Coreman, Charles E. Leiserson and Ronald L. Rivest, “Introduction to Algorithms”, Printice Hall of
India.
2. E. Horowitz & S Sahni, "Fundamentals of Computer Algorithms",
3. Aho, Hopcraft, Ullman, “The Design and Analysis of Computer Algorithms” Pearson Education, 2008.
4. LEE "Design & Analysis of Algorithms (POD)",McGraw Hill
5. Richard E.Neapolitan "Foundations of Algorithms" Jones & Bartlett Learning
6. Jon Kleinberg and ÉvaTardos, Algorithm Design, Pearson, 2005.
7. Michael T Goodrich and Roberto Tamassia, Algorithm Design: Foundations, Analysis, and Internet Examples,
Second Edition, Wiley, 2006.
8. Harry R. Lewis and Larry Denenberg, Data Structures and Their Algorithms, Harper Collins, 1997
9. Robert Sedgewick and Kevin Wayne, Algorithms, fourth edition, Addison Wesley, 2011.
10. Harsh Bhasin,”Algorithm Design and Analysis”,FirstEdition,Oxford University Press.
11. Gilles Brassard and Paul Bratley,Algorithmics:Theory and Practice,Prentice Hall,1995.
KCS 055 / KAI 601 MACHINE LEARNING TECHNIQUES
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
CO 1 To understand the need for machine learning for various problem solving K1 , K2
To understand a wide variety of learning algorithms and how to evaluate models generated K1 , K3
CO 2
from data
CO 3 To understand the latest trends in machine learning K2 , K3
To design appropriate machine learning algorithms and apply the algorithms to a real- K4 , K6
CO 4
world problems
To optimize the models learned and report on the expected accuracy that can be achieved K4, K5
CO 5
by applying the models
DETAILED SYLLABUS 3-0-0
Unit Topic Proposed
Lecture
INTRODUCTION – Learning, Types of Learning, Well defined learning problems,
Designing a Learning System, History of ML, Introduction of Machine Learning Approaches
I – (Artificial Neural Network, Clustering, Reinforcement Learning, Decision Tree Learning, 08
Bayesian networks, Support Vector Machine, Genetic Algorithm), Issues in Machine
Learning and Data Science Vs Machine Learning;
REGRESSION: Linear Regression and Logistic Regression
BAYESIAN LEARNING –Bayes theorem, Concept learning, Bayes Optimal Classifier,
Naïve Bayes classifier, Bayesian belief networks, EM algorithm.
II 08
SUPPORT VECTOR MACHINE: Introduction, Types of support vector kernel – (Linear
kernel, polynomial kernel,andGaussiankernel), Hyperplane – (Decision surface), Properties of
SVM, and Issues in SVM.
DECISION TREE LEARNING– Decision tree learning algorithm, Inductive bias, Inductive
inference with decision trees, Entropy and information theory, Information gain, ID-3
III Algorithm, Issues in Decision tree learning. 08
INSTANCE-BASED LEARNING – k-Nearest Neighbour Learning, Locally Weighted
Regression, Radial basis function networks, Case-based learning.
ARTIFICIAL NEURAL NETWORKS – Perceptron’s, Multilayer perceptron, Gradient
descent and the Delta rule, Multilayer networks, Derivation of Backpropagation Algorithm,
Generalization, Unsupervised Learning – SOM Algorithm and its variant;
IV DEEP LEARNING–Introduction,concept of convolutional neural network , Types of layers 08
– (Convolutional Layers , Activation function , pooling , fully connected) , Concept of
Convolution (1D and 2D) layers, Training of network, Case study of CNN for eg on Diabetic
Retinopathy, Building a smart speaker, Self-deriving car etc.
REINFORCEMENT LEARNING–Introduction to Reinforcement Learning , Learning
Task,Example of Reinforcement Learning in Practice, Learning Models for Reinforcement –
(Markov Decision process , Q Learning – Q Learning function, Q Learning Algorithm ),
V Application of Reinforcement Learning,Introduction to Deep Q Learning. 08
GENETIC ALGORITHMS: Introduction, Components, GA cycle of reproduction,
Crossover, Mutation, Genetic Programming, Models of Evolution and Learning,
Applications.
Text books:
1. Tom M. Mitchell, ―Machine Learning, McGraw-Hill Education (India) Private Limited, 2013.
2. EthemAlpaydin, ―Introduction to Machine Learning (Adaptive Computation and Machine Learning), MIT Press
2004.
3. Stephen Marsland, ―Machine Learning: An Algorithmic Perspective, CRC Press, 2009.
4. Bishop, C., Pattern Recognition and Machine Learning. Berlin: Springer-Verlag.
5. M. Gopal, “Applied Machine Learning”, McGraw Hill Education
KCS 052 WEB DESIGNING
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
CO 2 Visualize and Recognize the basic concept of HTML and application in web designing. K 1, K 2
CO 5 Introduce basics concept of Web Hosting and apply the concept of SEO K 2, K 3
CO 3 Learn how to use software programs to perform varying and complex networking tasks K 1, K 2
CO 5 Expand upon the knowledge learned and apply it to solve real world problems K 5, K 6
CO 4 Expand upon the knowledge learned and apply it to solve real worldproblems K 3, K 5
Database Management Systems Lab KCS 551: Mapping with Virtual Lab
DETAILED SYLLABUS
The student should have hands on experience in using various sensors like temperature, humidity, smoke, light, etc. and
should be able to use control web camera, network, and relays connected to the Pi.
1. Start Raspberry Pi and try various Linix commands in command terminal window: ls, cd, touch, mv, rm, man,
mkdir, rmdir, tar, gzip, cat, more, less, ps, sudo, cron, chown, chgrp, ping etc.
2. Run some python programs on Pi like:
a) Read your name and print Hello message with name
b) Read two numbers and print their sum, difference, product and division.
c) Word and character count of a given string.
d) Area of a given shape (rectangle, triangle and circle) reading shape and appropriate values from standard
input.
3. Run some python programs on Pi like: a) Print a name 'n' times, where name and n are read from standard input,
using for and while loops. b) Handle Divided by Zero Exception. c) Print current time for 10 times with an
interval of 10 seconds. d) Read a file line by line and print the word count of each line.
4. a) Light an LED through Python program
b) Get input from two switches and switch on corresponding LEDs
c) Flash an LED at a given on time and off time cycle, where the two times are taken from a file.
5. a) Flash an LED based on cron output (acts as an alarm)
b) Switch on a relay at a given time using cron, where the relay's contact terminals are connected to a load.
c) Get the status of a bulb at a remote place (on the LAN) through web.
DETAILED SYLLABUS
1. Program for Recursive Binary & Linear Search.
2. Program for Heap Sort.
3. Program for Merge Sort.
4. Program for Selection Sort.
5. Program for Insertion Sort.
6. Program for Quick Sort.
7. Knapsack Problem using Greedy Solution
8. Perform Travelling Salesman Problem
9. Find Minimum Spanning Tree using Kruskal’s Algorithm
10. Implement N Queen Problem using Backtracking
11. Sort a given set of n integer elements using Quick Sort method and compute its time complexity. Run the program for
varied values of n> 5000 and record the time taken to sort. Plot a graph of the time taken versus non graph sheet. The
elements can be read from a file or can be generated using the random number generator. Demonstrate using Java
how the divide and- conquer method works along with its time complexity analysis: worst case, average case and
best case.
12. Sort a given set of n integer elements using Merge Sort method and compute its time complexity. Run the program for
varied values of n> 5000, and record the time taken to sort. Plot a graph of the time taken versus non graph sheet.
The elements can be read from a file or can be generated using the random number generator. Demonstrate how the
divide and- conquer method works along with its time complexity analysis: worst case, average case and best case.
13.6. Implement , the 0/1 Knapsack problem using
(a) Dynamic Programming method
(b) Greedy method.
14. From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra's algorithm.
15. Find Minimum Cost Spanning Tree of a given connected undirected graph using Kruskal's algorithm. Use Union-Find
algorithms in your program.
16. Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm.
17. Write programs to (a) Implement All-Pairs Shortest Paths problem using Floyd's algorithm.
(b) Implement Travelling Sales Person problem using Dynamic programming.
18. Design and implement to find a subset of a given set S = {Sl, S2,.....,Sn} of n positive integers whose SUM is equal to
a given positive integer d. For example, if S ={1, 2, 5, 6, 8} and d= 9, there are two solutions {1,2,6}and {1,8}.
Display a suitable message, if the given problem instance doesn't have a solution.
19. Design and implement to find all Hamiltonian Cycles in a connected undirected Graph G of n vertices using
backtracking principle.
Note: The Instructor may add/delete/modify/tune experiments, wherever he/she feels in a justified manner
It is also suggested that open source tools should be preferred to conduct the lab ( C, C++ etc)
KOT 601 IOT ARCHITECTURE AND PROTOCOLS
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
CO 5 Building enterprise level applications and manipulate web databases using JDBC K 3, K4
Demonstrate the contents of a SRS and apply basic software quality assurance practices to
CO 2 K 1, K 2
ensure that design, development meet or exceed applicable standards.
Formulate testing strategy for software systems, employ techniques such as unit testing, Test
CO 4 K3
driven development and functional testing.
Manage software development process independently as well as in teams and make use of
CO 5 K5
Various software management tools for development, maintenance and analysis.
DETAILED SYLLABUS 3-1-0
Unit Topic Proposed
Lecture
Introduction: Introduction to Software Engineering, Software Components, Software
Characteristics, Software Crisis, Software Engineering Processes, Similarity and Differences from
I Conventional Engineering Processes, Software Quality Attributes. Software Development Life 08
Cycle (SDLC) Models: Water Fall Model, Prototype Model, Spiral Model, Evolutionary
Development Models, Iterative Enhancement Models.
Software Design: Basic Concept of Software Design, Architectural Design, Low Level Design:
Modularization, Design Structure Charts, Pseudo Codes, Flow Charts, Coupling and Cohesion
Measures, Design Strategies: Function Oriented Design, Object Oriented Design, Top-Down and
III Bottom-Up Design. Software Measurement and Metrics: Various Size Oriented Measures: 08
Halestead’s Software Science, Function Point (FP) Based Measures, Cyclomatic Complexity
Measures: Control Flow Graphs.
Software Testing: Testing Objectives, Unit Testing, Integration Testing, Acceptance Testing,
Regression Testing, Testing for Functionality and Testing for Performance, TopDown and Bottom-
Up Testing Strategies: Test Drivers and Test Stubs, Structural Testing (White Box Testing),
IV Functional Testing (Black Box Testing), Test Data Suit Preparation, Alpha and Beta Testing of 08
Products. Static Testing Strategies: Formal Technical Reviews (Peer Reviews), Walk Through,
Code Inspection, Compliance with Design and Coding Standards.
DETAILED SYLLABUS
A students should implement two case studies from the IOT Projects List ( Individually or in small group)
1. Wearable Computer With Temperature Distance Sensors
2. Weather Imaging CubeSat with Telemetry Transmission
3. IOT Water Pollution Monitor RC Boat
4. Mountain Climber Health & GPS Tracker
5. Contactless IOT Doorbell
6. IOT Smart Parking Using RFID
7. IOT Contactless Covid Testing Booth Automation
8. IOT Social Distancing & Monitoring Robot For Queue
9. IOT Covid Patient Health Monitor in Quarantine
10. IOT based Manhole Detection and Monitoring System
11. IOT based Smart Energy Meter Monitoring with Theft Detection
12. IOT Weather Station Airship
13. IOT based Three Phase Power Failure Monitoring with SMS Alerts
14. IOT based Intelligent Gas Leakage Detector Using Arduino
15. 360° Aerial Surveillance UAV With IOT Camera
16. IOT Garbage Segregator & Bin Level Indicator
17. IOT Temperature & Mask Scan Entry System
18. IOT based Smart Agriculture Monitoring System Project
19. IOT Based Automatic Vehicle Accident Detection and Rescue System
20. Greenhouse Monitoring and Control System using IOT Project
21. IOT Based Coal Mine Safety Monitoring and Alerting System
22. IOT Based Heart Monitoring System Using ECG
23. IOT based Anti-theft Flooring System using Raspberry Pi
24. Raspberry Pi based Weather Reporting Over IOT
25. IOT Early Flood Detection & Avoidance
26. IOT Garbage Monitoring Using Raspberry Pi
27. IOT Circuit Breaker Project
28. IOT Mining Tracking & Worker Safety Helmet
29. IOT Prison Break Monitoring & Alerting System
30. Raspberry Pi Air and Noise Pollution Monitoring System Over IOT
CO 4 Design dynamic web page using server site programming Ex. ASP/JSP/PHP K 3, K 4
CO 5 Design server site applications using JDDC,ODBC and section tracking API K 3, K 4
DETAILED SYLLABUS
This lab is based on the Web Technologies. Some examples are as follows:
1. Write HTML/Java scripts to display your CV in navigator, your Institute website, Department Website and Tutorial
website for specific subject
2. Write an HTML program to design an entry form of student details and send it to store at database server like SQL,
Oracle or MS Access.
3. Write programs using Java script for Web Page to display browsers information.
5. Write a Java applet to display the Application Program screen i.e. calculator and other.
6. Writing program in XML for creation of DTD, which specifies set of rules. Create a style sheet in CSS/ XSL & display
the document in internet explorer.
7. Program to illustrate JDBC connectivity. Program for maintaining database by sending queries. Design and implement
a simple servlet book query with the help of JDBC & SQL. Create MS Access Database, Create on ODBC link,
Compile & execute JAVA JDVC Socket.
8. Install TOMCAT web server and APACHE. Access the above developed static web pages for books web site, using
these servers by putting the web pages developed.
9. Assume four users user1, user2, user3 and user4 having the passwords pwd1, pwd2, pwd3 and pwd4 respectively.
Write a servlet for doing the following. Create a Cookie and add these four user id’s and passwords to this Cookie. 2.
Read the user id and passwords entered in the Login form and authenticate with the values available in the cookies.
10. Install a database (Mysql or Oracle). Create a table which should contain at least the following fields: name, password,
email-id, phone number Write a java program/servlet/JSP to connect to that database and extract data from the tables
and display them. Insert the details of the users who register with the web site, whenever a new user clicks the submit
button in the registration page.
11. Write a JSP which insert the details of the 3 or 4 users who register with the web site by using registration form.
Authenticate the user when he submits the login form using the user name and password from the database
12. Design and implement a simple shopping cart example with session tracking API.
Note: The Instructor may add/delete/modify/tune experiments, wherever he/she feels in a justified manner
It is also suggested that open source tools should be preferred to conduct the lab ( Java , JSP , Bootstrap
Firebug , WampServer , MongoDB, etc)
KCS 653 COMPUTER NETWORKS LAB
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
DETAILED SYLLABUS
1. Implementation of Stop and Wait Protocol and Sliding Window Protocol.
2. Study of Socket Programming and Client – Server model
3. Write a code simulating ARP /RARP protocols.
4. Write a code simulating PING and TRACEROUTE commands
5. Create a socket for HTTP for web page upload and download.
6. Write a program to implement RPC (Remote Procedure Call)
7. Implementation of Subnetting .
8. Applications using TCP Sockets like
a. Echo client and echo server b. Chat c. File Transfer
9. Applications using TCP and UDP Sockets like d. DNS e. SNMP f. File Transfer
10. Study of Network simulator (NS).and Simulation of Congestion Control Algorithms using NS
11. Perform a case study about the different routing algorithms to select the network path with its optimum and
economical during data transfer. i. Link State routing ii. Flooding iii. Distance vector
12. To learn handling and configuration of networking hardware like RJ-45 connector, CAT-6 cable, crimping tool, etc.
13. Configuration of router, hub, switch etc. (using real devices or simulators)
14. Running and using services/commands like ping, traceroute, nslookup, arp, telnet, ftp, etc.
15.Network packet analysis using tools like Wireshark, tcpdump, etc.
16. Network simulation using tools like Cisco Packet Tracer, NetSim, OMNeT++, NS2, NS3, etc.
17.Socket programming using UDP and TCP (e.g., simple DNS, data & time client/server, echo client/server, iterative &
concurrent servers)
Note: The Instructor may add/delete/modify/tune experiments, wherever he/she feels in a justified manner
It is also suggested that open source tools should be preferred to conduct the lab ( C , C++ , Java , NS3,
Mininet, Opnet, TCP Dump, Wireshark etc.