B.tech. 3rd Yr CSE(IOT) 2022 23 Revised

Download as pdf or txt
Download as pdf or txt
You are on page 1of 32

DR. A.P.J.

ABDUL KALAM TECHNICAL UNIVERSITY LUCKNOW

Evaluation Scheme & Syllabus


For
B.Tech. 3rd Year
COMPUTER SCIENCE AND ENGINEERING (INTERNET OF THINGS)

On
AICTE Model Curriculum

(Effective from the Session: 202


2022-23)

DR. A.P.J. ABDUL KALAM TECHNICAL UNIVERSITY LUCKNOW


B.TECH

COMPUTER SCIENCE AND ENGINEERING (INTERNET OF THINGS)


CURRICULUM STRUCTURE

SEMESTER- V

End
Sl. Subject Periods Evaluation Scheme
Subject Semester Total Credit
No.
Codes L T P CT TA Total PS TE PE

1 KCS501 Database Management System 3 1 0 30 20 50 100 150 4

2 KOT501 Introduction to Internet of 3 1 0 30 20 50 100 150 4


Things
Design and Analysis of
3 KCS503 3 1 0 30 20 50 100 150 4
Algorithm

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

Database Management System


6 KCS551 0 0 2 25 25 50 1
Lab

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

Mini Project or Internship


9 KCS554 0 0 2 50 50 1
Assessment*

Constitution of India. Law and


KNC501/
10 Engineering / Indian Tradition, 2 0 0 15 10 25 50
KNC502
Culture and Society

MOOCs (Essential for Hons.


11
Degree)

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

1 KOT601 IoT Architecture and 3 1 0 30 20 50 100 150 4


Protocols
2 KCS602 Web Technology 3 1 0 30 20 50 100 150 4

3 KCS603 Computer Networks 3 1 0 30 20 50 100 150 4

Dept
4 Departmental Elective-III 3 0 0 30 20 50 100 150 3
Elective-III

5 Open Elective-I 3 0 0 30 20 50 100 150 3


[Annexure - B(iv)]
Advance Internet of Things
6 KOT651 0 0 2 25 25 50 1
Lab

7 KCS652 Web Technology Lab 0 0 2 25 25 50 1

8 KCS653 Computer Networks Lab 0 0 2 25 25 50 1

Constitution of India. Law and


KNC601/
9 Engineering / Indian Tradition, 2 0 0 15 10 25 50
KNC602
Culture and Society

MOOCs (Essential for Hons.


10
Degree)

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)

KCS 501DATABASE MANAGEMENT SYSTEM


Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to understand
CO 1 Apply knowledge of database for real life applications. K3
CO 2 Apply query-processing techniques to automate the real time problems of databases. K 3, K 4
CO 3 Identify and solve the redundancy problem in database tables using normalization. K 2, K 3
Understand the concepts of transactions, their processing so they will familiar with broad range K 2, K 4
CO 4
of database management issues including data integrity, security and recovery.
CO 5 Design, develop and implement a small database project using database tools. K 3, K 6
DETAILED SYLLABUS 3-1-0
Unit Topic Proposed
Lecture
Introduction: Overview, Database System vs File System, Database System Concept and
Architecture, Data Model Schema and Instances, Data Independence and Database Language and
Interfaces, Data Definitions Language, DML, Overall Database Structure. Data Modeling Using the
I 08
Entity Relationship Model: ER Model Concepts, Notation for ER Diagram, Mapping Constraints,
Keys, Concepts of Super Key, Candidate Key, Primary Key, Generalization, Aggregation,
Reduction of an ER Diagrams to Tables, Extended ER Model, Relationship of Higher Degree.
Relational data Model and Language: Relational Data Model Concepts, Integrity Constraints,
Entity Integrity, Referential Integrity, Keys Constraints, Domain Constraints, Relational Algebra,
Relational Calculus, Tuple and Domain Calculus. Introduction on SQL: Characteristics of SQL,
II Advantage of SQL. SQl Data Type and Literals. Types of SQL Commands. SQL Operators and 08
Their Procedure. Tables, Views and Indexes. Queries and Sub Queries. Aggregate Functions.
Insert, Update and Delete Operations, Joins, Unions, Intersection, Minus, Cursors, Triggers,
Procedures in SQL/PL SQL
Data Base Design & Normalization: Functional dependencies, normal forms, first, second, 8 third
III normal forms, BCNF, inclusion dependence, loss less join decompositions, normalization using 08
FD, MVD, and JDs, alternative approaches to database design
Transaction Processing Concept: Transaction System, Testing of Serializability, Serializability of
Schedules, Conflict & View Serializable Schedule, Recoverability, Recovery from Transaction
IV 08
Failures, Log Based Recovery, Checkpoints, Deadlock Handling. Distributed Database: Distributed
Data Storage, Concurrency Control, Directory System.
Concurrency Control Techniques: Concurrency Control, Locking Techniques for Concurrency
V Control, Time Stamping Protocols for Concurrency Control, Validation Based Protocol, Multiple 08
Granularity, Multi Version Schemes, Recovery with Concurrent Transaction, Case Study of Oracle.
Text books:
1. Korth, Silbertz, Sudarshan,” Database Concepts”, McGraw Hill
2. Date C J, “An Introduction to Database Systems”, Addision Wesley
3. Elmasri, Navathe, “ Fundamentals of Database Systems”, Addision Wesley
4. O’Neil, Databases, Elsevier Pub.
5. RAMAKRISHNAN"Database Management Systems",McGraw Hill
6. Leon &Leon,”Database Management Systems”, Vikas Publishing House
7. Bipin C. Desai, “ An Introduction to Database Systems”, Gagotia Publications
8. Majumdar& Bhattacharya, “Database Management System”, TMH
KOT 501 INTRODUCTION TO INTERNET OF THINGS
Course Outcome (CO) Bloom’s Knowledge Level (KL)
At the end of course, the student will be able to understand
CO 1 Demonstrate basic concepts, principles and challenges in IoT. K1,K2
CO 2 Illustrate functioning of hardware devices and sensors used for IoT. K2
CO 3 Analyze network communication aspects and protocols used in IoT. K4
CO 4 Apply IoT for developing real life applications using Ardunio programming. K3
CP 5 To develop IoT infrastructure for popular applications K2, K3

DETAILED SYLLABUS 3-1-0


Proposed
Unit Topic
Lecture
Internet of Things (IoT): Vision, Definition, Conceptual Framework, Architectural view,
technology behind IoT, Sources of the IoT, M2M Communication, IoT Examples. Design
I Principles for Connected Devices: IoT/M2M systems layers and design standardization, 08
communication technologies, data enrichment and consolidation, ease of designing and
affordability
Hardware for IoT: Sensors, Digital sensors, actuators, radio frequency identification (RFID)
technology, wireless sensor networks, participatory sensing technology. Embedded Platforms for
II 08
IoT: Embedded computing basics, Overview of IOT supported Hardware platforms such as
Arduino, NetArduino, Raspberry pi, Beagle Bone, Intel Galileo boards and ARM cortex.
Network & Communication aspects in IoT: Wireless Medium access issues, MAC protocol
III survey, Survey routing protocols, Sensor deployment & Node discovery, Data aggregation & 08
dissemination
Programming the Ardunio:Ardunio Platform Boards Anatomy, Ardunio IDE, coding, using
IV 08
emulator, using libraries, additions in ardunio, programming the ardunio for IoT.
Challenges in IoT Design challenges: Development Challenges, Security Challenges, Other
challenges IoT Applications: Smart Metering, E-health, City Automation, Automotive
V 08
Applications, home automation, smart cards, communicating data with H/W units, mobiles, tablets,
Designing of smart street lights in smart city.
Text books:
1. Olivier Hersent,DavidBoswarthick, Omar Elloumi“The Internet of Things key applications and protocols”, willey
2. Jeeva Jose, Internet of Things, Khanna Publishing House
3. Michael Miller “The Internet of Things” by Pearson
4. Raj Kamal “INTERNET OF THINGS”, McGraw-Hill, 1ST Edition, 2016
5. ArshdeepBahga, Vijay Madisetti “Internet of Things (A hands on approach)” 1ST edition, VPI publications,2014
6. Adrian McEwen,HakinCassimally “Designing the Internet of Things” Wiley India
KCS 503 DESIGN AND ANALYSIS OF ALGORITHM
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to understand


Design new algorithms, prove them correct, and analyze their asymptotic and absolute runtime K 4, K 6
CO 1
and memory demands.
Find an algorithm to solve the problem (create) and prove that the algorithm solves the problem K 5, K 6
CO 2
correctly (validate).
Understand the mathematical criterion for deciding whether an algorithm is efficient, and know K 2, K 5
CO 3
many practically important problems that do not admit any efficient algorithms.
CO 4 Apply classical sorting, searching, optimization and graph algorithms. K 2, K 4

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)

At the end of course , the student will be able:

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)

At the end of course , the student will be able to:

CO 1 Understand principle of Web page design and about types of websites K 3, K 4

CO 2 Visualize and Recognize the basic concept of HTML and application in web designing. K 1, K 2

CO 3 Recognize and apply the elements of Creating Style Sheet (CSS). K 2, K 4

CO 4 Understand the basic concept of Java Script and its application. K 2, K 3

CO 5 Introduce basics concept of Web Hosting and apply the concept of SEO K 2, K 3

DETAILED SYLLABUS 3-0-0


Unit Topic Proposed
Lecture
Introduction : Basic principles involved in developing a web site, Planning process , Domains and
Hosting, Responsive Web Designing , Types of Websites (Static and Dynamic Websites), Web
I Standards and W3C recommendations, 08
Introduction to HTML: What is HTML , HTML Documents, Basic structure of an HTML
document , Creating an HTML document , Mark up Tags , Heading-Paragraphs , Line Breaks
Elements of HTML: HTML Tags., Working with Text , Working with Lists, Tables and Frames,
II 08
Working with Hyperlinks, Images and Multimedia, Working with Forms and controls
Concept of CSS: Creating Style Sheet, CSS Properties , CSS Styling(Background, Text Format,
Controlling Fonts) , Working with block elements and objects , Working with Lists and Tables,
CSS Id and Class, Box Model(Introduction, Border properties, Padding Properties, Margin
III 08
properties) CSS Advanced(Grouping, Dimension, Display, Positioning, Floating, Align, Pseudo
class, Navigation Bar, Image Sprites, Attribute sector) , CSS Color , Creating page Layout and Site
Designs.
Introduction to Client Side Scripting , Introduction to Java Script , Javascript Types , Variables in
JS, Operators in JS , Conditions Statements , Java Script Loops, JS Popup Boxes , JS Events , JS
IV 08
Arrays, Working with Arrays, JS Objects ,JS Functions , Using Java Script in Real time ,
Validation of Forms, Related Examples
Web Hosting: Web Hosting Basics , Types of Hosting Packages, Registering domains , Defining
Name Servers , Using Control Panel, Creating Emails in Cpanel , Using FTP Client, Maintaining a
V 08
Website
Concepts of SEO : Basics of SEO, Importance of SEO, Onpage Optimization Basics
Text Books:
1. Steven M. Schafer, “HTML, XHTML, and CSS Bible, 5ed”, Wiley India
2. Ian Pouncey, Richard York, “Beginning CSS: Cascading Style Sheets for Web Design”, Wiley India
KOT 051 SENSORS, ACTUATORS AND SIGNAL PROCESSING
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to:

CO 1 Understand the concept of Sensors and Transducers K2

CO 2 Application of Sensors, Actuators and Signal Processing K 3, K4

CO 3 Understand the concept of Radiation Sensors and smart sensor K 2, K 3

CO 4 Learn various types of sensors and actuators used. K 2, K3

CO 5 Learn fundamentals of signal processors and digital signal processors K 1, K 2

DETAILED SYLLABUS 3-0-0


Unit Topic Proposed
Lecture
Sensors / Transducers: Principles Classification, Parameters, Characteristics, Environmental
Parameters (EP), Characterization. Mechanical and Electromechanical Sensors: Introduction,
I Resistive Potentiometer, Strain Gauge, Resistance Strain Gauge, Semiconductor Strain Gauges, 8
Inductive Sensors- Sensitivity and Linearity of the Sensor, Types- Capacitive Sensors, Electrostatic
Transducer, Force/Stress Sensors using Quartz Resonators, Ultrasonic Sensors.
Thermal Sensors: Introduction, Gas thermometric Sensors, Thermal Expansion Type
Thermometric Sensors, Acoustic Temperature Sensor, Dielectric Constant and Refractive Index
Thermo-sensors, Helium Low Temperature Thermometer, Nuclear Thermometer, Magnetic
Thermometer, Resistance Change Type Thermometric Sensors, Thermo-EMF Sensors, Junction
Semiconductor Types, Thermal Radiation Sensors, Quartz Crystal Thermo-electric Sensors, NQR
II Thermometry, Spectroscopic Thermometry, Noise Thermometry, Heat Flux Sensors. Magnetic 8
Sensors: Introduction, Sensors and the Principles Behind, Magneto-resistive Sensors, Anisotropic
Magneto-resistive Sensing, Semiconductor Magneto-resistors, Hall Effect and Sensors, Inductance
and Eddy Current Sensors, Angular/Rotary Movement Transducers, Synchronous, Synchronous-
resolvers, Eddy Current Sensors, Electromagnetic Flow meter, Switching Magnetic Sensors,
SQUID Sensors.
Radiation Sensors: Introduction – Basic Characteristics – Types of Photosensistors/Photo
detectors– X-ray and Nuclear Radiation Sensors– Fiber Optic Sensors Electro Analytical Sensors:
Introduction – The Electrochemical Cell – The Cell Potential – Standard Hydrogen Electrode
(SHE) – Liquid Junction and Other Potentials – Polarization – Concentration Polarization–
Reference Electrodes – Sensor Electrodes – Electro ceramics in Gas Media .
III 8
Smart Sensors: Introduction, Primary Sensors, Excitation, Amplification, Filters, Converters,
Compensation, Information Coding/Processing, Data Communication, Standards for Smart Sensor
Interface, the Automation. Sensors Applications: Introduction, On-board Automobile Sensors
(Automotive Sensors), Home Appliance Sensors, Aerospace Sensors, Sensors for Manufacturing,
Sensors for environmental Monitoring.
Actuators: Pneumatic and Hydraulic Actuation Systems- Actuation systems, Pneumatic and
hydraulic systems, Directional Control valves, Pressure control valves, Cylinders, Servo and
proportional control valves, Process control valves, Rotary actuators. Mechanical Actuation
IV 8
SystemsTypes of motion, Kinematic chains, Cams, Gears, Ratchet and pawl, Belt and chain drives,
Bearings, Mechanical aspects of motor selection, Electrical Actuation Systems, Electrical systems,
Mechanical switches, Solid-state switches, Solenoids, D.C. Motors, A.C. Motors, Stepper motors.
Introduction of Signal Processing: Classification of systems: Continuous, discrete, linear, causal,
stable, dynamic, recursive, time variance; classification of signals: continuous and discrete, energy
Syllabus B. Tech., ICE: July 2018 admissions onwards Page36 and power; mathematical
V representation of signals; spectral density; sampling techniques, quantization, quantization error, 8
Nyquist rate, aliasing effect. Digital signal representation
Digital Signal Processors: Introduction – Architecture – Features – Addressing Formats –
Functional modes – Introduction to Commercial Processors.
Text Books:
1. D. Patranabis,” Sensors and Transducers”, PHI Learning Private Limited.
2. W. Bolton, “Mechatronics”, Pearson Education Limited.
3. Patranabis , “Sensors and Actuators”, 2nd Edition, PHI, 2013.
4. Proakis JG and Manolakis DG, “Digital signal processing,” Pearson Education India
5. Ifeacher EC and Jerris BW, “Digital signal processing – A practical approach,” Pearson Education
KCS 054 OBJECT ORIENTED SYSTEM DESIGN
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to:
Understand the application development and analyze the insights of object oriented K 2, K 4
CO 1
programming to implement application
Understand, analyze and apply the role of overall modeling concepts (i.e. System, K 2, K 3
CO 2
structural)
CO 3 Understand, analyze and apply oops concepts (i.e. abstraction, inheritance) K 2, K3, K4
Understand the basic concepts of C++ to implement the object oriented concepts K 2, K 3
CO 4
CO 5 To understand the object oriented approach to implement real world problem. K 2, K 3
DETAILED SYLLABUS 3-0-0
Unit Topic Proposed
Lecture
Introduction: The meaning of Object Orientation, object identity, Encapsulation, information
I hiding, polymorphism, generosity, importance of modelling, principles of modelling, object 08
oriented modelling, Introduction to UML, conceptual model of the UML, Architecture.
Basic Structural Modeling: Classes, Relationships, common Mechanisms, and diagrams. Class
&Object Diagrams: Terms, concepts, modelling techniques for Class & Object Diagrams.
Collaboration Diagrams: Terms, Concepts, depicting a message, polymorphism in
collaboration Diagrams, iterated messages, use of self in messages. Sequence Diagrams: Terms,
concepts, depicting asynchronous messages with/without priority, call-back mechanism,
II broadcast messages. 08
Basic Behavioural Modeling: Use cases, Use case Diagrams, Activity Diagrams, State
Machine , Process and thread, Event and signals, Time diagram, interaction diagram, Package
diagram.
Architectural Modeling: Component, Deployment, Component diagrams and Deployment
diagrams.
Object Oriented Analysis: Object oriented design, Object design, Combining three models,
Designing algorithms, design optimization, Implementation of control, Adjustment of
inheritance, Object representation, Physical packaging, Documenting design considerations.
Structured analysis and structured design (SA/SD), Jackson Structured Development
III (JSD).Mapping object oriented concepts using non-object oriented language, Translating classes 08
into data structures, Passing arguments to methods, Implementing inheritance, associations
encapsulation.
Object oriented programming style: reusability, extensibility, robustness, programming in the
large. Procedural v/s OOP, Object oriented language features. Abstraction and Encapsulation.
C++ Basics : Overview, Program structure, namespace, identifiers, variables, constants, enum,
operators, typecasting, control structures
IV C++ Functions : Simple functions, Call and Return by reference, Inline functions, Macro Vs. 08
Inline functions, Overloading of functions, default arguments, friend functions, virtual functions
Objects and Classes: Basics of object and class in C++, Private and public members, static
data and function members, constructors and their types, destructors, operator overloading, type
conversion. Inheritance : Concept of Inheritance, types of inheritance: single, multiple,
V 08
multilevel, hierarchical, hybrid, protected members, overriding, virtual base class
Polymorphism : Pointers in C++, Pointes and Objects, this pointer, virtual and pure virtual
functions, Implementing polymorphism
Text Books
1. James Rumbaughet. al, “Object Oriented Modeling and Design”, PHI
2. Grady Booch, James Rumbaugh, Ivar Jacobson, “The Unified Modeling Language User Guide”, Pearson
Education
3. Object Oriented Programming With C++, E Balagurusamy, TMH
4. C++ Programming, Black Book, Steven Holzner, dreamtech
5. Object Oriented Programming in Turbo C++, Robert Lafore, Galgotia
6. Object Oriented Programming with ANSI and Turbo C++, Ashok Kamthane, Pearson
7. The Compete Reference C++, Herbert Schlitz, TMH

KDS 052 DISTRIBUTED SYSTEM


Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to understand
CO 1 To provide hardware and software issues in modern distributed systems. K1 , K2
To get knowledge in distributed architecture, naming, synchronization, consistency and
CO 2 K2
replication, fault tolerance, security, and distributed file systems.
To analyze the current popular distributed systems such as peer-to-peer (P2P) systems will also
CO 3 K4
be analyzed.
CO 4 To know about Shared Memory Techniques and have Sufficient knowledge about file access K1
CO 5 Have knowledge of Synchronization and Deadlock. K1
DETAILED SYLLABUS 3-0-0
Proposed
Unit Topic
Lecture
Characterization of Distributed Systems: Introduction, Examples of distributed Systems,
Resource sharing and the Web Challenges. Architectural models, Fundamental Models.
I Theoretical Foundation for Distributed System: Limitation of Distributed system, absence of 08
global clock, shared memory, Logical clocks ,Lamport’s& vectors logical clocks. Concepts in
Message Passing Systems: causal order, total order, total causal order, Techniques for Message
Ordering, Causal ordering of messages, global state, termination detection.
Distributed Mutual Exclusion: Classification of distributed mutual exclusion, requirement of
mutual exclusion theorem, Token based and non token based algorithms, performance metric
II for distributed mutual exclusion algorithms. Distributed Deadlock Detection: system model, 08
resource Vs communication deadlocks, deadlock prevention, avoidance, detection & resolution,
centralized dead lock detection, distributed dead lock detection, path pushing algorithms, edge
chasing algorithms.
Agreement Protocols: Introduction, System models, classification of Agreement Problem,
Byzantine agreement problem, Consensus problem, Interactive consistency Problem, Solution
III to Byzantine Agreement problem, Application of Agreement problem, Atomic Commit in 08
Distributed Database system. Distributed Resource Management: Issues in distributed File
Systems, Mechanism for building distributed file systems, Design issues in Distributed Shared
Memory, Algorithm for Implementation of Distributed Shared Memory.
Failure Recovery in Distributed Systems: Concepts in Backward and Forward recovery,
IV Recovery in Concurrent systems, Obtaining consistent Checkpoints, Recovery in Distributed 08
Database Systems. Fault Tolerance: Issues in Fault Tolerance, Commit Protocols, Voting
protocols, Dynamic voting protocols
Transactions and Concurrency Control: Transactions, Nested transactions, Locks, Optimistic
Concurrency control, Timestamp ordering, Comparison of methods for concurrency control.
V Distributed Transactions: Flat and nested distributed transactions, Atomic Commit protocols, 08
Concurrency control in distributed transactions, Distributed deadlocks, Transaction recovery.
Replication: System model and group communication, Fault - tolerant services, highly available
services, Transactions with replicated data.
Text books:
1. Singhal&Shivaratri, "Advanced Concept in Operating Systems", McGraw Hill
2. Ramakrishna,Gehrke,” Database Management Systems”, McGraw Hill
3. Vijay K.Garg Elements of Distributed Compuitng , Wiley
4. Coulouris, Dollimore, Kindberg, "Distributed System: Concepts and Design”, Pearson Education
5. Tenanuanbaum, Steen,” Distributed Systems”, PHI
KOT 052 PROGRAMMING AND INTERFACING WITH MICROCONTROLLERS
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to:

CO 1 Understand advanced and emerging networking technologies K 1, K 2

CO 2 Obtain skills to do advanced networking research and programming K 3, K 4

CO 3 Learn how to use software programs to perform varying and complex networking tasks K 1, K 2

Understand Advanced I/O Interfacing K 2, K 3


CO 4

CO 5 Expand upon the knowledge learned and apply it to solve real world problems K 5, K 6

DETAILED SYLLABUS 3-0-0


Unit Topic Proposed
Lecture
INTRODUCTION
Introduction – History – Creative Coding Platforms – Open Source Platforms – PIC – Arduino,
Sketch, Raspberry Pi, Iterative coding methodology – Python Programming –Mobile phones and
I 08
similar devices – Arm Devices – Getting used to Arduino – Sensor Characterization: Safety, Basic
Electronics (circuit theory, measurements, parts identification) Sensors and Software:
Understanding Processing Code Structure, variables and flow control, Interfacing to the Real World
SOFTWARE FRAMEWORKS
Software: openFrameworks as our IDE (C/C++) – “Arduino” Language (C/C++) – Hardware:
II Desktop / Laptop / Raspberry Pi – How to approach a programming problem? Representing 08
“reality” with computers.Digital vs. Analog circuits, audio, communication, etc.Analog to Digital
Conversion (ADC) – Digital to Analog Conversion (DAC) – Microcontrollers
HARDWARE COMMUNICATION
Communication – Serial& Parallel – Hardware to Hardware Communication – I2C/IIC (Inter-
Integrated Circuit) – SPI (Serial Peripheral Interface) – Serial UART Communication –
III 08
Introduction to the command line – git/github. Introduction to Programming: A comparative studio
between Arduino + open Frameworks – Arduino compatible Microcontrollers Sensors and
Actuators
ADVANCED I/O INTERFACING
Advanced I/O – open Frameworks: Live Network feeds (push and pull) – Data persistence
IV 08
(saving data and preferences) – Database interface (MySQL, sqLite, XML, PHP/Web) –
Arduino:Wired/Wireless Networking
IoT, FUTURE AND PERSPECTIVES
V Talking to the cloud: Baby steps to Internet of Things, TCP/IP and UDP – Building peer 08
to peer communication system using Bluetooth &WiFi– Experiments
Text Books:
1. Programming Interactivity, Second Edition By Josha Noble, 2012
2. Programming the Raspberry Pi: Getting Started with Python 2E, 2016
KAI 052 NATURAL LANGUAGE PROCESSING
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able :
CO 1 To learn the fundamentals of natural language processing K 1 , K2
CO 2 To understand the use of CFG and PCFG in NLP K 1 , K2
CO 3 To understand the role of semantics of sentences and pragmatic K2
CO 4 To Introduce Speech Production And Related Parameters Of Speech. K 1 , K2
To Show The Computation And Use Of Techniques Such As Short Time Fourier Transform,
CO 5 K3, K4
Linear Predictive Coefficients And Other Coefficients In The Analysis Of Speech.
DETAILED SYLLABUS 3-0-0
Proposed
Unit Topic
Lecture
INTRODUCTION: Origins and challenges of NLP – Language Modeling: Grammar-based LM,
Statistical LM – Regular Expressions, Finite-State Automata – English Morphology, Transducers for
lexicon and rules, Tokenization, Detecting and Correcting Spelling Errors, Minimum Edit Distance
I WORD LEVEL ANALYSIS : Unsmoothed N-grams, Evaluating N-grams, Smoothing, 08
Interpolation and Backoff – Word Classes, Part-of-Speech Tagging, Rule-based, Stochastic and
Transformation-based tagging, Issues in PoS tagging – Hidden Markov and Maximum Entropy
models.
SYNTACTIC ANALYSIS: Context Free Grammars, Grammar rules for English, Treebanks, Normal
Forms for grammar – Dependency Grammar – Syntactic Parsing, Ambiguity, Dynamic Programming
II 08
parsing – Shallow parsing – Probabilistic CFG, Probabilistic CYK, Probabilistic Lexicalized CFGs –
Feature structures, Unification of feature structures.
SEMANTICS AND PRAGMATICS:
Requirements for representation, First-Order Logic, Description Logics – Syntax-Driven Semantic
III analysis, Semantic attachments – Word Senses, Relations between Senses, Thematic Roles, 08
selectional restrictions – Word Sense Disambiguation, WSD using Supervised, Dictionary &
Thesaurus, Bootstrapping methods – Word Similarity using Thesaurus and Distributional methods.
BASIC CONCEPTS of Speech Processing :Speech Fundamentals: Articulatory Phonetics –
Production And Classification Of Speech Sounds; Acoustic Phonetics – Acoustics Of Speech
IV 08
Production; Review Of Digital Signal Processing Concepts; Short-Time Fourier Transform, Filter-
Bank And LPC Methods.
SPEECH-ANALYSIS: Features, Feature Extraction And Pattern Comparison Techniques: Speech
Distortion Measures– Mathematical And Perceptual – Log–Spectral Distance, Cepstral Distances,
Weighted Cepstral Distances And Filtering, Likelihood Distortions, Spectral Distortion Using A
V Warped Frequency Scale, LPC, PLP And MFCC Coefficients, Time Alignment And Normalization –
Dynamic Time Warping, Multiple Time – Alignment Paths. 08
SPEECH MODELING : Hidden Markov Models: Markov Processes, HMMs – Evaluation, Optimal
State Sequence – Viterbi Search, Baum-Welch Parameter Re-Estimation, Implementation Issues.
Text books:
1. Daniel Jurafsky, James H. Martin―Speech and Language Processing: An Introduction to Natural Language
Processing, Computational Linguistics and Speech, Pearson Publication, 2014.
2. Steven Bird, Ewan Klein and Edward Loper, ―Natural Language Processing with Python, First Edition, OReilly
Media, 2009.
3. Lawrence RabinerAndBiing-Hwang Juang, “Fundamentals Of Speech Recognition”, Pearson Education, 2003.
4. Daniel JurafskyAnd James H Martin, “Speech And Language Processing – An Introduction To Natural Language
Processing, Computational Linguistics, And Speech Recognition”, Pearson Education, 2002.
5. Frederick Jelinek, “Statistical Methods Of Speech Recognition”, MIT Press, 1997.
6. 1. Breck Baldwin, ―Language Processing with Java and LingPipe Cookbook, Atlantic Publisher, 2015.
7. Richard M Reese, ―Natural Language Processing with Java, OReilly Media, 2015.
8. Nitin Indurkhya and Fred J. Damerau, ―Handbook of Natural Language Processing, Second Edition, Chapman and
Hall/CRC Press, 2010.
9. Tanveer Siddiqui, U.S. Tiwary, ―Natural Language Processing and Information Retrieval, Oxford University
Press, 2008.
KOT 053 WEARABLE COMPUTING, MIXED REALITY AND INTERNET OF EVERYTHING
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to:

CO 1 Understand advanced and emerging technologies K 1, K 2

CO 2 Obtain skills to do advanced research and programming K 1, K 2

CO 3 Learn how to use software programs to perform varying andcomplex tasks K 1, K 2

CO 4 Expand upon the knowledge learned and apply it to solve real worldproblems K 3, K 5

DETAILED SYLLABUS 3-0-0


Unit Topic Proposed
Lecture
INTRODUCTION : Introduction – History - Creative Coding Platforms - Open Source Platforms
– PIC - Arduino, Sketch, Raspberry Pi, Iterative coding methodology – Python Programming -
I Mobile phones and similar devices - Arm Devices - Basic Electronics (circuit theory, 08
measurements, parts identification) Sensors and Software: Understanding Processing Code
Structure, variables and flow control, Interfacing to the Real World
SOFTWARE HARDWARE FRAMEWORKS: Software: open Frameworks as our IDE (C/C++)
- “Arduino” Language (C/C++) - Hardware: Desktop / Laptop / Raspberry Pi - How to approach a
programming problem? Representing “reality” with computers. Digital vs. Analog circuits, audio,
II communication, etc. Analog to Digital Conversion (ADC) - Digital to Analog Conversion (DAC)– 08
Microcontrollers - Communication – Serial& Parallel - Hardware to Hardware Communication -
I2C/IIC (Inter-Integrated Circuit) - SPI (Serial Peripheral Interface) – Serial UART
Communication
CYBERNETICS AND HUMANISTIC INTELLIGENCE: Wearables - Augmented Reality –
Mixed Reality. Case studies, Oculus Rift (2012, 2013), AR versus VR - IoT and Wearables: Smart
Cites and Wearable Computing as a form of urban design - Advanced I/O – open Frameworks:Live
III Network feeds (push and pull) - Data persistence (saving data and preferences) - Database interface 08
(MySQL, sqLite, XML, PHP/Web) - Arduino: Wired/Wireless Networking (hardware vs. USB
proxy) - Software serial (RS-232) talking to other devices - Advanced sensor/device
communication SPI - Advance IC interfacing / Bitbanging (bitwise operators) - Linux –GPIO
THE WORLD OF THE FUTURE – INTERNET OF EVERYTHING: Humanistic Intelligence,
Mann 1998. Wearable Computing and IoT (Internet of Things) The scalespace theory;
sur/surveillance; integrity; Veillance Contract; Humanistic Intelligence; MedialityAxis? Overview
IV of Mobile and Wearable Computing, Augmented Reality, and Internet of Things. The fundamental 08
axes of the Wearables + IoT + AR space - Free-roaming AR: Wearable Computing, Wireless,
Sensing, and Metasensing with light bulbs Phenomenal Augmented Reality: Real world physical
phenomena as the fundamental basis of mobile and wearable AR.
FUTURE AND PERSPECTIVES: Internet of Everything – The Future and perspectives -
V 08
Challenges
Text Books:
1. Practical Electronics for Inventors, Third Edition,” by Paul ScherzandSimon Monk. 2016
2. Intel Galileo and Intel Galileo Gen 2API Features and Arduino Projects for Linux Programmers, Ramon, Manoel
2014 (Open Access)
3. Fundamentals of Wearable Computers and Augmented Reality, Second Edition by Woodrow Barfield 2015
4. Making Sense of Sensors: End-to-End Algorithms and Infrastructure Design By OmeshTickoo, Ravi Iyer 2016
5. Programming Interactivity, Second Edition By Josha Noble, 2012
6. Programming the Raspberry Pi: Getting Started with Python 2E, 2016
KOT 054 PRIVACY AND SECURITY IN IOT
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to:

CO 1 Ability to understand the Security requirements in IoT. K 1 , K2

CO 2 Understand the cryptographic fundamentals for IoT K 1 , K2


Ability to understand the authentication credentials and access K1, K2
CO 3
control
CO 4 Understand the various types Trust models and Cloud Security. K 1 , K2

DETAILED SYLLABUS 3-0-0


Unit Topic Proposed
Lecture
INTRODUCTION: SECURING THE INTERNET OF THINGS: Security Requirements in IoT
Architecture - Security in Enabling Technologies -Security Concerns in IoT Applications. Security
Architecture in the Internet of Things -Security Requirements in IoT - Insufficient
I 08
Authentication/Authorization – Insecure Access Control - Threats to Access Control, Privacy, and
Availability - Attacks Specific to IoT. Vulnerabilities – Secrecy and Secret-Key Capacity -
Authentication/Authorization for Smart Devices - Transport Encryption – Attack & Fault trees
CRYPTOGRAPHIC FUNDAMENTALS FOR IOT: Cryptographic primitives and its role in
IoT – Encryption and Decryption – Hashes –Digital Signatures – Random number generation –
II 08
Cipher suites – key management fundamentals – cryptographic controls built into IoT messaging
and communication protocols – IoT Node Authentication
IDENTITY & ACCESS MANAGEMENT SOLUTIONS FOR IOT: Identity lifecycle –
III authentication credentials – IoT IAM infrastructure – Authorization with Publish / Subscribe 08
schemes – access control
PRIVACY PRESERVATION AND TRUST MODELS FOR IOT: Concerns in data
IV dissemination – Lightweight and robust schemes for Privacy protection – Trust and Trust models 08
for IoT – self-organizing Things - Preventing unauthorized access
CLOUD SECURITY FOR IOT:
Cloud services and IoT – offerings related to IoT from cloud service providers – Cloud IoT security
V 08
controls – An enterprise IoT cloud security architecture – New directions
in cloud enabled IoT computing
Text Books:
1. Practical Internet of Things Security (Kindle Edition) by Brian Russell, Drew Van Duren
2. Securing the Internet of Things Elsevier
3. Security and Privacy in Internet of Things (IoTs): Models, Algorithms, and Implementations
KOT 055 EMBEDDED SYSTEMS AND REAL TIME OPERATING SYSTEM
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to:


CO 1 To understand the aspects of Real Time Embedded concepts K 1, K 2
CO 2 To learn the Essentials of Open Source RTOS and their usage K 1, K 2
CO 3 To select the proper technique to design a Real-Time System K 1, K 2
CO 4 To understand VxWorks RTOS and real time application programming with it K 2, K 3
To build the device driver and kernel internal for Embedded OS and RTOSearn and K 5, K 6
CO 5
apply the knowledge of Memory systems
DETAILED SYLLABUS 3-0-0
Unit Topic Proposed
Lecture
EMBEDDED OS INTERNALS: Linux internals: Process Management, File Management,
Memory Management, I/O Management. Overview of POSIX APIs, Threads – Creation,
Cancellation, POSIX Threads Inter Process Communication – Semaphore, Pipes, FIFO, Shared
I 08
Memory Kernel: Structure, Kernel Module Programming Schedulers and types of scheduling.
Interfacing: Serial, Parallel Interrupt Handling Linux Device Drivers: Character, USB,
Block & Network.
OPEN SOURCE RTOS: Basics of RTOS: Real-time concepts, Hard Real time and Soft Real-
time, Differences between General Purpose OS & RTOS, Basic architecture of an RTOS,
Scheduling Systems, Inter-process communication, Performance Matric in scheduling models,
II 08
Interrupt management in RTOS environment, Memory management, File systems, I/O
Systems, Advantage and disadvantage of RTOS. POSIX standards, RTOS Issues – Selecting a
Real-Time Operating System, RTOS comparative study
REAL TIME KERNEL BASICS: Converting a normal Linux kernel to real time kernel,
Xenomai basics. Overview of Open source RTOS for Embedded systems (Free RTOS/
ChibiosRT) and application development. Real Time Operating Systems: Event based, process
III based and graph based models, Petrinet models. Real time languages, real time kernel, OS tasks, 08
task states, task scheduling, interrupt processing, clocking, communication and Synchronization.
Control blocks, memory requirements and control, kernel services,
basic design using RTOS
VXWORKS / FREE RTOS: VxWorks/ Free RTOS Scheduling and Task Management –
Realtime scheduling, Task Creation, Intertask Communication, Pipes, Semaphore, Message
IV 08
Queue, Signals, Sockets, Interrupts I/O Systems – General Architecture, Device Driver Studies,
Driver Module explanation, Implementation of Device Driver for a peripheral.
CASE STUDY: Software Development and Tools: Simulators, debuggers, cross compilers, in
circuit emulators for the microcontrollers. Interface Issues Related to Embedded Systems:A/D,
D/A converters, FPGA, ASIC, diagnostic port. Cross compilers, debugging
V 08
Techniques, Creation of binaries & porting stages for Embedded Development board
(Beagle Bone Black, Rpi or similar), Porting an Embedded OS/ RTOS to a target board
().Testing a real-time application on the board.
Text Books:
1. VenkateswaranSreekrishnan,” Essential Linux Device Drivers” , Ist Kindle edition, Prentice Hall, 2008
2. Jerry Cooperstein , ”Writing Linux Device Drivers: A Guide with Exercises”, J. Cooperstein publishers ,2009
3. Qing Li and CarolynYao,”3Real Time Concepts for Embedded Systems – Qing Li, Elsevier ISBN:1578201241
CMP Books c 2003
4. Raj Kamal,” Embedded Systems Architecture Programming and Design”:,Tata McGraw Hill, 2011
5. KVK Prasad, ”Embedded/Real Time Systems Concepts, Design and Programming Black Book”, , Wiley India
2003
6. Seppo J. Ovaska Phillip A. Laplante,”Real-Time Systems Design and Analysis:Tools for the Practitioner”, 4ed
Paperback – 17 May 2013
7. Ward, Paul T & Mellor, Stephen,” Structured Development for Real – Time Systems v1, v2,V3 : Implementation
ModelingTechniques “ Prentice hall,2015
KCS 551 DATABASE MANAGEMENT SYSTEMS LAB
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to:


Understand and apply oracle 11 g products for creating tables, views, indexes, sequences and K 2, K 4
CO 1
other database objects.
Design and implement a database schema for company data base, banking data base, library K3, K5,
CO 2
information system, payroll processing system, student information system. K6
CO 3 Write and execute simple and complex queries using DDL, DML, DCL and TCL K 4, K 5
CO 4 Write and execute PL/SQL blocks, procedure functions, packages and triggers, cursors. K 4, K 5
Enforce entity integrity, referential integrity, key constraints, and domain constraints K 3, K 4
CO 5
on database.
DETAILED SYLLABUS
1. Installing oracle/ MYSQL
2. Creating Entity-Relationship Diagram using case tools.
3. Writing SQL statements Using ORACLE /MYSQL:
a)Writing basic SQL SELECT statements.
b) Restricting and sorting data.
c)Displaying data from multiple tables.
d)Aggregating data using group function.
e)Manipulating data.
e)Creating and managing tables.
4. Normalization
5. Creating cursor
6. Creating procedure and functions
7. Creating packages and triggers
8. Design and implementation of payroll processing system
9. Design and implementation of Library Information System
10. Design and implementation of Student Information System
11. Automatic Backup of Files and Recovery of Files
12.Mini project (Design & Development of Data and Application ) for following :
a) Inventory Control System.
b) Material Requirement Processing.
c) Hospital Management System.
d) Railway Reservation System.
e) Personal Information System.
f) Web Based User Identification System.
g) Timetable Management System.
h) h) Hotel Management System
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 (MySQL , SQL server ,
Oracle ,MongoDB ,Cubrid ,MariaDBetc)

Database Management Systems Lab KCS 551: Mapping with Virtual Lab

Name of the Lab Name of the Experiment


Data Definition Language(DDL) Statements: (Create table, Alter table, Drop table)
Data Manipulation Language(DML) Statements
Database Management Lab Data Query Language(DQL) Statements: (Select statement with operations like Where
(KCS-551) clause, Order by, Logical operators, Scalar functions and Aggregate functions)
Transaction Control Language(TCL) statements: (Commit(make changes permanent),
Rollback (undo)
Describe statement: To view the structure of the table created
KOT 551 INTERNET OF THINGS LAB
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to

CO 1 Understand the concept of Internet of Things K3

CO 2 Implement interfacing of various sensors with Arduino/Raspberry Pi K4, K5

CO 3 Demonstrate the ability to transmit data wirelessly between different devices. K4

CO 4 Show an ability to upload/download sensor data on cloud and server K2

CO 5 Examine various SQL queries from MySQL database K 4, K 5

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.

Note: The Instructor may add/delete/modify/tune experiments


KCS 553 DESIGN AND ANALYSIS OF ALGORITHM LAB
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to:

CO 1 Implement algorithm to solve problems by iterative approach. K 2, K 4

CO 2 Implement algorithm to solve problems by divide and conquer approach K 3, K 5

CO 3 Implement algorithm to solve problems by Greedy algorithm approach. K 4, K 5

Implement algorithm to solve problems by Dynamic programming, backtracking, K 4, K 5


CO 4
branch and bound approach.
CO 5 Implement algorithm to solve problems by branch and bound approach. K 3, K 4

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)

At the end of course , the student will be able to

CO 1 To Understand the Architectural Overview of IoT K1,K2

CO 2 To Understand the IoT Reference Architecture and RealWorldDesign Constraints K1,K2


To Understand the various IoT Protocols ( Datalink, Network, Transport, Session,
CO 3 K3
Service)
CO 4 Application of various IoT Protocols ( Datalink, Network, Transport, Session, Service) K4,K5

CO 5 To Understand the various Real-World Design Constraints. K4,K5

DETAILED SYLLABUS 3-0-0


Unit Topic Proposed
Lectures
IoT-An Architectural Overview: Building an architecture, Main design principles and needed
capabilities, An IoT architecture outline, standards considerations. M2M and IoT Technology
I Fundamentals- Devices and gateways, Local and wide area networking, Data management, 06
Business processes in IoT, Everything as a Service(XaaS), M2M and IoT Analytics, Knowledge
Management
Reference Architecture: IoT Architecture-State of the Art – Introduction, State of the art,
Reference Model and architecture, IoT reference Model - IoT Reference Architecture- Introduction,
II Functional View, Information View, Deployment and Operational View, Other Relevant 08
architectural views. Real-World Design Constraints- Introduction, Technical Design constraints-
hardware is popular again, Data representation and visualization, Interaction and remote control.
IOT Data Link Layer & Network Layer Protocols : PHY/MAC Layer(3GPP MTC, IEEE
802.11, IEEE 802.15), WirelessHART,ZWave, Bluetooth Low Energy, Zigbee Smart Energy,
III 08
DASH7 - Network Layer-IPv4, IPv6, 6LoWPAN, 6TiSCH,ND, DHCP, ICMP, RPL, CORPL,
CARP
Transport & Session Layer Protocols: Transport Layer (TCP, MPTCP, UDP, DCCP, SCTP)-
IV 08
(TLS, DTLS) – Session Layer-HTTP, CoAP, XMPP, AMQP, MQTT
Service Layer Protocols & Security : Service Layer -oneM2M, ETSI M2M, OMA, BBF –
V 08
Security in IoT Protocols – MAC 802.15.4 , 6LoWPAN, RPL, Application Layer
Text books
1. Jan Holler, VlasiosTsiatsis, Catherine Mulligan, Stefan Avesand,StamatisKarnouskos, David Boyle, “From
Machine-to-Machine to the Internet of Things: Introduction to a New Age of Intelligence”, 1st Edition, Academic
Press,2014.
2. Peter Waher, “Learning Internet of Things”, PACKT publishing, BIRMINGHAM –MUMBAI
3. Bernd Scholz-Reiter, Florian Michahelles, “Architecting the Internet of Things”,ISBN 978-3-642-19156-5 e-
ISBN 978-3-642-19157-2, Springer
4. Daniel Minoli, “Building the Internet of Things with IPv6 and MIPv6: The Evolving World of M2M
Communications”, ISBN: 978-1-118-47347-4, Willy Publications
5. Vijay Madisetti and ArshdeepBahga, “Internet of Things (A Hands-on-Approach)”, 1st Edition, VPT, 2014.
KCS 602 WEB TECHNOLOGY
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to
CO 1 Explain web development Strategies and Protocols governing Web. K 1, K 2

CO 2 Develop Java programs for window/web-based applications. K 2, K 3

CO 3 Design web pages using HTML, XML, CSS and JavaScript. K 2, K 3

CO 4 Creation of client-server environment using socket programming K1, K2,

CO 5 Building enterprise level applications and manipulate web databases using JDBC K 3, K4

CO6 Design interactive web applications using Servlets and JSP K 2, K 3

DETAILED SYLLABUS 3-0-0


Unit Topic Proposed
Lecture
Introduction: Introduction and Web Development Strategies, History of Web and Internet, Protocols
Governing Web, Writing Web Projects, Connecting to Internet, Introduction to Internet services and
I tools, Introduction to client-server computing. Core Java: Introduction, Operator, Data type, Variable,
Arrays, Methods & Classes, Inheritance, Package and Interface, Exception Handling, Multithread 08
programming, I/O, Java Applet, String handling, Event handling, Introduction to AWT, AWT
controls, Layout managers
Web Page Designing: HTML: List, Table, Images, Frames, forms, CSS, Document type definition,
II XML: DTD, XML schemes, Object Models, presenting and using XML, Using XML Processors: 08
DOM and SAX, Dynamic HTML
Scripting: Java script: Introduction, documents, forms, statements, functions, objects; introduction to
III AJAX, Networking : Internet Addressing, InetAddress, Factory Methods, Instance Methods, 08
TCP/IP Client Sockets, URL, URL Connection, TCP/IP Server Sockets, Datagram.
Enterprise Java Bean: Preparing a Class to be a JavaBeans, Creating a JavaBeans, JavaBeans
Properties, Types of beans, Stateful Session bean, Stateless Session bean, Entity bean
IV 08
Java Database Connectivity (JDBC): Merging Data from Multiple Tables: Joining,
Manipulating, Databases with JDBC, Prepared Statements, Transaction Processing, Stored
Procedures.
Servlets: Servlet Overview and Architecture, Interface Servlet and the Servlet Life Cycle,
Handling HTTP get Requests, Handling HTTP post Requests, Redirecting Requests to Other
V Resources, Session Tracking, Cookies, Session Tracking with Http Session 08
Java Server Pages (JSP): Introduction, Java Server Pages Overview, A First Java Server Page
Example, Implicit Objects, Scripting, Standard Actions, Directives, Custom Tag Libraries..
Text books:
1. Burdman, Jessica, “Collaborative Web Development” Addison Wesley
2. Xavier, C, “ Web Technology and Design” , New Age International
3. Ivan Bayross,” HTML, DHTML, Java Script, Perl & CGI”, BPB Publication
4. Bhave, “Programming with Java”, Pearson Education
5. Herbert Schieldt, “The Complete Reference:Java”, TMH.
6. Hans Bergsten, “Java Server Pages”, SPD O’Reilly
7. Margaret Levine Young, “The Complete Reference Internet”, TMH
8. Naughton, Schildt, “The Complete Reference JAVA2”, TMH
9. Balagurusamy E, “Programming in JAVA”, TMH
KCS- 603 COMPUTER NETWORKS
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to


Explain basic concepts, OSI reference model, services and role of each layer of OSI model and
CO1 K1,K2
TCP/IP, networks devices and transmission media, Analog and digital data transmission
CO2 Apply channel allocation, framing, error and flow control techniques. K3
Describe the functions of Network Layer i.e. Logical addressing, subnetting& Routing
CO3 K2,K3
Mechanism.
Explain the different Transport Layer function i.e. Port addressing, Connection Management,
CO4 K2,K3
Error control and Flow control mechanism.
CO5 Explain the functions offered by session and presentation layer and their Implementation. K 2,K3
Explain the different protocols used at application layer i.e. HTTP, SNMP, SMTP, FTP,
CO6 K2
TELNET and VPN.
DETAILED SYLLABUS 3-0-0
Unit Topic Proposed
Lecture
Introductory Concepts: Goals and applications of networks, Categories of networks,
Organization of the Internet, ISP, Network structure and architecture (layering principles, services,
protocols and standards), The OSI reference model, TCP/IP protocol suite, Network devices and
I components.
08
Physical Layer:
Network topology design, Types of connections, Transmission media, Signal transmission and
encoding, Network performance and transmission impairments, Switching techniques and
multiplexing.
Link layer: Framing, Error Detection and Correction, Flow control (Elementary Data Link
II Protocols, Sliding Window protocols).
08
Medium Access Control and Local Area Networks: Channel allocation, Multiple access protocols,
LAN standards, Link layer switches & bridges (learning bridge and spanning tree algorithms).
Network Layer: Point-to-point networks, Logical addressing, Basic internetworking (IP, CIDR,
III 08
ARP, RARP, DHCP, ICMP), Routing, forwarding and delivery, Static and dynamic routing,
Routing algorithms and protocols, Congestion control algorithms, IPv6.
Transport Layer: Process-to-process delivery, Transport layer protocols (UDP and TCP),
IV 08
Multiplexing, Connection management, Flow control and retransmission, Window management,
TCP Congestion control, Quality of service.
Application Layer: Domain Name System, World Wide Web and Hyper Text Transfer Protocol,
V 08
Electronic mail, File Transfer Protocol, Remote login, Network management, Data compression,
Cryptography – basic concepts.
Text books:
Text books and References:
1. Behrouz Forouzan, “Data Communication and Networking”, McGraw Hill
2. Andrew Tanenbaum “Computer Networks”, Prentice Hall.
3. William Stallings, “Data and Computer Communication”, Pearson.
4. Kurose and Ross, “Computer Networking- A Top-Down Approach”, Pearson.
5. Peterson and Davie, “Computer Networks: A Systems Approach”, Morgan Kaufmann
6. W. A. Shay, “Understanding Communications and Networks”, Cengage Learning.
7. D. Comer, “Computer Networks and Internets”, Pearson.
8. Behrouz Forouzan, “TCP/IP Protocol Suite”, McGraw Hill.
KAI061 CYBER FORENSIC ANALYTICS
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to:
CO 1 Outline the Cyber crime and its types. K 1, K 2
CO 2 Explore the Cyber Forensics Techniques K 1, K 2
CO 3 Use the Cyber Investigation Techniques K 3, K 4
CO 4 Explore the Cyber Evidence Management Techniques K 3, K 4
CO 5 Outline the Cyber Laws in India K 1, K 2
DETAILED SYLLABUS 3-0-0
Unit Topic Proposed
Lecture
Cyber Crime:
Cyber Space – Cyber Crime – Criminal Behaviour – Jurisdictional Concerns - Jurisprudential
Inconsistency – eCash Security – Prepaid Cards – Stored Values Cards – Mobile Payments –
Internet Payment Services -Cyber stalking - Cyber extortion – Cyber terrorism - Cyber warfare –
I Cyber weapons -ATM frauds – 08
Phreaking – Internet Gambling
Practical Component:
1. Key logger
2. Email Fraud
Cyber Forensics:
Digital device – Hard disk –Disk characteristics - Disk imaging - Data Carving – Techniques –
commercial piracy - soft lifting – Steganography – Network components - Port scans - Wireshark -
pcap analysis - Trojans and Backdoors – Botnets - DoS – DDoS Attacks - Honey Pots – Malware
II 08
– Virus and Worms
Practical Component:
1. Pcab file Analysis – Case Study
2. Network Port Scan – Forensics
Cyber Investigation
Concepts of Investigation - cyber investigation, Network Investigation - Investigating audit logs -
Investigating Web attacks - Investigating Computer Intrusions - Profiling – Cyber Criminal
profiling – Stylometric Techniques – Warranted searches – Warrantless searches – Undercover
III 08
Techniques
Practical Component:
1. Investigating Audit Logs
2. Investigating Web attacks
Evidence Management:
Evidence – Digital Evidence - Types – physical evidence – Real evidence – Circumstantial
evidence –network evidence - Evidence collection – Evidence Analysis - Contextual Information –
IV Evidence Management – pre search activities – On Scene activities – Report Preparations 08
Practical Component:
1. Digital Evidence Analysis
2. Network Analysis
Cyber Laws and Authorities
Information Technology Act 2000 – Digital signature - Electronic Governance - Secure electronic
records
V - Regulation of certifying authorities – CERNTin - Electronic signature certificates - Penalties
compensation - Future Trends and Emerging Concerns
Practical Component: 08
1. Digital Signature
Text Books:
1. Marjie T. Britz, “Computer Forensics and Cyber Crime”, Pearson, 2013.
2. Garima Tiwari, “Understanding Laws– Cyber Laws And Cyber Crimes”, Lexis Nexis, 2014.
3. Chuck Easttom, Jeff Taylor, “Computer Crime, Investigation, and the Law”, Course Technology, 2018.
4. Eoghan Casey, “Digital Evidence and Computer Crime: Forensic Science, Computers, and the
Internet”, Eoghan Casey, 2018.
KOT 061 BIG DATA ANALYTICS FOR IOT
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to:

CO 1 Understand the Concepts of big data analytics K 1, K 2

CO 2 Understand the concepts about Internet of things K 1, K 2

CO 3 understand and implement smart systems K 1, K 2

CO 4 Understand the Concept of FOG Computing K 1, K 2

CO 5 Understand the Sustainability Data and Analytics K 1, K 2

DETAILED SYLLABUS 3-0-0


Unit Topic Proposed
Lecture
BIG DATA PLATFORMS FOR THE INTERNET OF THINGS
Big Data Platforms for the Internet of Things: network protocol- data dissemination –
current state of art- Improving Data and Service Interoperability with
I Structure,Compliance, Conformance and Context Awareness: interoperability problem in 08
the IoT
context- Big Data Management Systems for the Exploitation of PervasiveEnvironments -
Big Data challenges and requirements coming from different SmartCity applications
RFID FALSE AUTHENTICATIONS
On RFID False Authentications: YA TRAP – Necessary and sufficient condition for
false authentication prevention - Adaptive Pipelined Neural Network Structure in
II SelfawareInternet of Things: self-healing systems- Role of adaptive neural network-
Spatial Dimensions of Big Data: Application of Geographical Concepts and
SpatialTechnology to the Internet of Things- Applying spatial relationships, functions,
andmodels
FOG COMPUTING
Fog Computing: A Platform for Internet of Things and Analytics: a massivelydistributed
III
number of sources - Big Data Metadata Management in Smart Grids:semantic
inconsistencies – role of metadata
WEB ENHANCED BUILDING
Toward Web Enhanced Building Automation Systems: heterogeneity between existing
installations and native IP devices - loosely-coupled Web protocol stack –energysaving
IV
in smart building- Intelligent Transportation Systems and Wireless Access inVehicular
Environment Technology for Developing Smart Cities: advantages andachievements-
Emerging Technologies in Health Information Systems: GenomicsDriven Wellness
Tracking and Management System (GO-WELL) – predictive care –personalized
medicine
SUSTAINABILITY DATA AND ANALYTICS
Sustainability Data and Analytics in Cloud-Based M2M Systems – potential
V
stakeholders and their complex relationships to data and analytics applications – Social 08
Networking Analysis - Building a useful understanding of a social network – Leveraging
Social Media and IoT to Bootstrap Smart Environments : lightweight Cyber Physical
Social Systems - citizen actuation
Text Books:
1. Stackowiak, R., Licht, A., Mantha, V., Nagode, L.,” Big Data and The Internet of Things Enterprise
Information Architecture for A New Age”, Apress, 2015.
2. Dr. John Bates , “Thingalytics - Smart Big Data Analytics for the Internet of Things”, john Bates,
2015.

KAI 501/KOT 063 ARTIFICIAL INTELLIGENCE


Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to understand
Understand the basics of the theory and practice of Artificial Intelligence as a discipline and K2
CO 1
about intelligent agents.
CO 2 Understand search techniques and gaming theory. K 2, K 3
The student will learn to apply knowledge representation techniques and problem solving K3 , K4
CO 3
strategies to common AI applications.
CO 4 Student should be aware of techniques used for classification and clustering. K2 , K3
CO 5 Student should aware of basics of pattern recognition and steps required for it. K2 , K4
DETAILED SYLLABUS 3-0-0
Proposed
Unit Topic
Lecture
INTRODUCTION :
I Introduction–Definition – Future of Artificial Intelligence – Characteristics of Intelligent Agents– 08
Typical Intelligent Agents – Problem Solving Approach to Typical AI problems.
PROBLEM SOLVING METHODS
Problem solving Methods – Search Strategies- Uninformed – Informed – Heuristics – Local Search
II Algorithms and Optimization Problems – Searching with Partial Observations – Constraint 08
Satisfaction Problems – Constraint Propagation – Backtracking Search – Game Playing – Optimal
Decisions in Games – Alpha – Beta Pruning – Stochastic Games
KNOWLEDGE REPRESENTATION
First Order Predicate Logic – Prolog Programming – Unification – Forward Chaining-Backward
III Chaining – Resolution – Knowledge Representation – Ontological Engineering-Categories and 08
Objects – Events – Mental Events and Mental Objects – Reasoning Systems for Categories –
Reasoning with Default Information
SOFTWARE AGENTS
IV Architecture for Intelligent Agents – Agent communication – Negotiation and Bargaining – 08
Argumentation among Agents – Trust and Reputation in Multi-agent systems.
APPLICATIONS
V AI applications – Language Models – Information Retrieval- Information Extraction – Natural 08
Language Processing – Machine Translation – Speech Recognition – Robot – Hardware –
Perception – Planning – Moving
Text books:
1. S. Russell and P. Norvig, “Artificial Intelligence: A Modern Approach‖, Prentice Hall, Third Edition, 2009.
2. I. Bratko, ―Prolog: Programming for Artificial Intelligence‖, Fourth edition, Addison-Wesley Educational Publishers
Inc., 2011.
3. M. Tim Jones, ―Artificial Intelligence: A Systems Approach(Computer Science)‖, Jones and Bartlett Publishers, Inc.;
First Edition, 2008
4. Nils J. Nilsson, ―The Quest for Artificial Intelligence‖, Cambridge University Press, 2009.
5. William F. Clocksin and Christopher S. Mellish,‖ Programming in Prolog: Using the ISO Standard‖, Fifth Edition,
Springer, 2003.
6. Gerhard Weiss, ―Multi Agent Systems‖, Second Edition, MIT Press, 2013.
7. David L. Poole and Alan K. Mackworth, ―Artificial Intelligence: Foundations of Computational Agents‖, Cambridge
University Press, 2010.
KOT 062 ENERGY HARVESTING TECHNOLOGIES AND POWERMANAGEMENT FOR IOT DEVICES
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to:

Understand the various energy sources and energy harvesting based K 1, K 2


CO 1
sensor networks
CO 2 Learn about the various Piezoelectric materials and Non-linear techniques K 1, K 2

CO 3 Understand the various Power sources for WSN K 1, K 2

CO 4 Learn about the applications of Energy harvesting systems. K 1, K 2

DETAILED SYLLABUS 3-0-0


Unit Topic Proposed
Lecture
ENERGY HARVESTING SYSTEMS: Introduction – Energy sources – energy harvesting based
I sensor networks –photovoltaic cell technologies – generation of electric power in semiconductor 08
PV cells – types
PIEZO-ELECTRIC ENERGY HARVESTING AND ELECTROMECHANICAL
MODELING :Piezoelectric materials – transducers – harvesters – microgenerators – strategies for
II enhancing the performance of energy harvesters. Electromechanical modeling of Lumped
parameter model and coupled distributed parameter models and closed-form
solutions
ELECTROMAGNETIC ENERGY HARVESTING AND NON-LINEAR TECHNIQUES
:Basic principles – micro fabricated coils and magnetic materials – scaling – power maximations –
III
micro and macro scale implementations. Non-linear techniques –vibration control & steady state
cases
ENERGY HARVESTING WIRELESS SENSORS: Power sources for WSN – Power generation
IV – conversion – examples – case studies. Harvesting microelectronic circuits – power conditioning
and losses
SELECTED APPLICATIONS OF ENERGY HARVESTING SYSTEMS: Case studies for
V Implanted medical devices – Bio-MEMS based applications – harvesting for RF sensors and ID 08
tags – powering wireless SHM sensor nodes
Text Books:
1. Carlos Manuel Ferreira Carvalho, Nuno Filipe Silva VerissimoPaulino, “CMOS Indoor Light Energy
Harvesting System for Wireless Sensing Applications”, springer
2. Danick Briand, Eric Yeatman, Shad Roundy ,“Micro Energy Harvesting”
KDS 063 SOFTWARE ENGINEERING
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course, the student will be able to


Explain various software characteristics and analyze different software Development
CO 1 K 1, K 2
Models.

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.

CO 3 Compare and contrast various methods for software design K 2, K 3

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 Requirement Specifications (SRS): Requirement Engineering Process: Elicitation,


Analysis, Documentation, Review and Management of User Needs, Feasibility Study, Information
II Modelling, Data Flow Diagrams, Entity Relationship Diagrams, Decision Tables, SRS Document, 08
IEEE Standards for SRS. Software Quality Assurance (SQA): Verification and Validation, SQA
Plans, Software Quality Frameworks, ISO 9000 Models, SEI-CMM Model.

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.

Software Maintenance and Software Project Management: Software as an Evolutionary Entity,


Need for Maintenance, Categories of Maintenance: Preventive, Corrective and Perfective
Maintenance, Cost of Maintenance, Software Re- Engineering, Reverse Engineering. Software
V Configuration Management Activities, Change Control Process, Software Version Control, An 08
Overview of CASE Tools. Estimation of Various Parameters such as Cost, Efforts,
Schedule/Duration, Constructive Cost Models (COCOMO), Resource Allocation Models, Software
Risk Analysis and Management.
Text books:
1.RS Pressman, Software Engineering: A Practitioners Approach, McGraw Hill.
2. Pankaj Jalote, Software Engineering, Wiley
3. Rajib Mall, Fundamentals of Software Engineering, PHI Publication.
4. KK Aggarwal and Yogesh Singh, Software Engineering, New Age International Publishers.
5. Ghezzi, M. Jarayeri, D. Manodrioli, Fundamentals of Software Engineering, PHI Publication.
6. Ian Sommerville, Software Engineering, Addison Wesley.
7. Kassem Saleh, “Software Engineering”, Cengage Learning.
8. P fleeger, Software Engineering, Macmillan Publication
KOT 651 ADVANCE INTERNET OF THINGS LAB
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to

CO 1 Understanding the implementation of IOT K 5, K 6

CO 2 Solving Societal problems with the help of IOT K 5, K 6

CO 3 Problem Analysis and Designing a Solution K 5, K 6

CO 4 Understanding the importance of Technology in the life of common men. K 5, K 6

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

Note: The Instructor may add/delete/modify/tune experiments


KCS 652 WEB TECHNOLOGY LAB
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to

CO 1 Develop static web pages using HTML K 2, K 3

CO 2 Develop Java programs for window/web-based applications. K 2, K 3

CO 3 Design dynamic web pages using Javascript and XML. K 3, K 4

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)

At the end of course , the student will be able to

CO 1 Simulate different network topologies. K 3, K 4

CO 2 Implement various framing methods of Data Link Layer. K 3, K 4

CO 3 Implement various Error and flow control techniques. K 3, K 4

CO 4 Implement network routing and addressing techniques. K 3, K 4

CO 5 Implement transport and security mechanisms K 3, K 4

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.

You might also like