JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA-533 003, ANDHRA PRADESH, INDIA

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

COURSE STRUCTURE & SYLLABUS

M.Tech CSE
for
ARTIFICIAL INTELLIGENCE Programme
(Applicable for batches admitted from 2020-2021)

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

I-SEMESTER
S.No Course Code Courses Cate gory L T P C

1 MTAI1101 Program Core-1 PC 3 0 0 3

Artificial Intelligence
2 MTAI1102 Program Core-2 PC 3 0 0 3
Mathematics for ML
Program Elective-1
3 MTAI1103 1. Data Mining PE 3 0 0 3
2. Big Data Analytics
3. High Performance Computing
Program Elective-2
4 MTAI1104 1. Cloud Computing PE 3 0 0 3
2. Internet of Things
3. Android Application Development
5 MTAI1105 Research Methodology and IPR CC 2 0 0 2
6 MTAI1106 Laboratory-1 LB 0 0 4 2
Artificial Intelligence Lab
7 MTAI1107 Laboartory-2 LB 0 0 4 2
Python Libraries for Data exploration Lab
8 MTAI1108 Audit Course-1* AC 2 0 0 0
Total Credits 18

*Student has to choose any one audit course listed below.

II SEMESTER
S.No Course Courses Category L T P C
Code
1 MTAI1201 Program Core-3 PC 3 0 0 3
Machine learning
2 MTAI1202 Program Core-4 PC 3 0 0 3
Soft Computing
Program Elective-3
3 MTAI1203 1. Deep Learning PE 3 0 0 3
2. Natural Language Processing
3. Computer Vision
Program Elective-4
4 MTAI1204 1. Robotics and Intelligent Systems PE 3 0 0 3
2. Reinforcement Learning
3. AI Chatbots
5 MTAI1205 Laboratory-3 LB 0 0 4 2
Machine Learning Lab
6 MTAI1206 Laboartory-4 LB 0 0 4 2
Soft Computing Lab
7 MTAI1207 Mini Project with Seminar MP 2 0 0 2
8 MTAI1208 Audit Course-2 * AC 2 0 0 0
Total Credits 18

*Student has to choose any one audit course listed below.

 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

Audit Course 1 & 2:

1. English for Research Paper 5. Constitution of India
Writing 6. Pedagogy Studies
2. Disaster Management 7. Stress Management by Yoga
3. Sanskrit for Technical Knowledge 8. Personality Development through
4. Value Education Life Enlightenment Skills

III-SEMESTER
Course Cate
S.No Courses L T P C
Code gory
Program Elective-5 PE
1. Recommender Systems
2. Expert Systems
1 MTAI2101 3. MOOCs-1 (NPTEL/SWAYAM) 12 Week PG 3 0 0 3
Level course related to the programme which is
not listed in the course structure
Open Elective OE
1. MOOCs-2 (NPTEL/SWAYAM)-Any 12
Week PG Level course on Engineering/
2 MTAI2102 Management/ Mathematics offered by other 3 0 0 3
than the parent department
2. Course offered by other departments in the
college
Dissertation-I/ Industrial Project # PJ
3 MTAI2103 0 0 20 10
Total Credits 16

#Students going for Industrial Project/Thesis will complete these courses through MOOCs

IV SEMESTER
Course Cate
S.No Courses L T P C
Code gory
1 MTAI2201 Dissertation-II PJ 0 0 32 16
Total Credits 16

Open Elective Subjects

1. OPTIMIZATION TECHNIQUES
2. MODELING AND SIMULATION TECHNIQUES
3. BIOINFORMATICS
4. OPERATIONS RESEARCH
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

ARTIFICIAL INTELLIGENCE L T P C
I Year - I Semester
(MTAI1101) 3 0 0 3

Course Objectives:
 Gain a historical perspective of Artificial Intelligence (AI) and its foundations.
 Become familiar with basic principles of AI toward problem solving, inference, perception,
knowledge representation, and learning.
 Investigate applications of AI techniques in intelligent agents, expert systems, artificial
neural networks and other machine learning models.
 Experience AI development tools such as an ‘AI language’, expert system shell, and/or data
mining tool. Experiment with a machine learning model for simulation and analysis.
 Explore the current scope, potential, limitations, and implications of intelligent systems.

Course Outcomes (COs): At the end of the course, student will be able to
 Demonstrate knowledge of the building blocks of AI as presented in terms of intelligent
agents.
 Analyze and formalize the problem as a state space, graph, design heuristics and select
amongst different search or game based techniques to solve them.
 Develop intelligent algorithms for constraint satisfaction problems and also design intelligent
systems for Game Playing.
 Attain the capability to represent various real life problem domains using logic based
techniques and use this to perform inference or planning.
 Solve problems with uncertain information using Bayesian approaches.

UNIT-I:
Introduction to artificial intelligence: Introduction , history, intelligent systems, foundations of
AI, applications, tic-tac-tie game playing, development of AI languages, current trends in AI,
Problem solving: state-space search and control strategies: Introduction, general problem
solving, characteristics of problem, exhaustive searches, heuristic search techniques, iterative-
deepening a*, constraint satisfaction

UNIT-II:
Problem reduction and game playing: Introduction, problem reduction, game playing, alpha-
beta pruning, two-player perfect information games, Logic concepts: Introduction, propositional
calculus, proportional logic, natural deduction system, axiomatic system, semantic tableau system
in proportional logic, resolution refutation in proportional logic, predicate logic

UNIT-III:
Knowledge representation: Introduction, approaches to knowledge representation, knowledge
representation using semantic network, extended semantic networks for KR, knowledge
representation using frames, advanced knowledge representation techniques: Introduction,
conceptual dependency theory, script structure, cyc theory, case grammars, semantic web.

UNIT-IV:
Uncertainty measure: probability theory: Introduction, probability theory, Bayesian belief
networks, certainty factor theory, dempster-shafer theory
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

UNIT-V:
Fuzzy sets and fuzzy logic: Introduction, fuzzy sets, fuzzy set operations, types of membership
functions, multi valued logic, fuzzy logic, linguistic variables and hedges, fuzzy propositions,
inference rules for fuzzy propositions, fuzzy systems.

Text Books:
1. Artificial intelligence, A modern Approach, 2nded, Stuart Russel, Peter Norvig, Prentice Hall
2. Artificial Intelligence, Saroj Kaushik, 1st Edition, CENGAGE Learning, 2011.

Reference Books:
1. Artificial intelligence, structures and Strategies for Complex problem solving, 5 th Edition,
George F Lugar, PEA
2. Introduction to Artificial Intelligence, Ertel, Wolf Gang, Springer, 2017
3. Artificial Intelligence, A new Synthesis, 1 st Edition, Nils J Nilsson, Elsevier, 1998
4. Artificial Intelligence- 3rd Edition, Rich, Kevin Knight, Shiv Shankar B Nair, TMH
5. Introduction To Artificial Intelligence And Expert Systems, 1st Edition, Patterson, Pearson
India, 2015
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

MATHEMATICS FOR ML L T P C
I Year - I Semester
(MTAI1102) 3 0 0 3

Course Objectives:

Course Outcomes:

UNIT-I
Linear Algebra: Systems of Linear Equations, Matrices, Solving Systems of Linear Equations,
Vector Spaces, Linear Independence, Basis and Rank, Linear Mappings, Affine Spaces

UNIT-II
Analytic Geometry: Norms, Inner Products, Lengths and Distances, Angles and Orthogonality,
Orthonormal Basis, Orthogonal Complement, Inner Product of Functions, Orthogonal Projections,
Rotations

UNIT-III
Matrix Decompositions: Determinant and Trace, Eigenvalues and Eigenvectors, Cholesky
Decomposition, Eigen decomposition and Diagonalization, Singular Value Decomposition, Matrix
Approximation, Matrix Phylogeny

UNIT-IV
Vector Calculus : Differentiation of Univariate Functions, Partial Differentiation and Gradients,
Gradients of Vector-Valued Functions, Gradients of Matrices, Useful Identities for Computing
Gradients, Backpropagation and Automatic Differentiation, Higher-Order Derivatives,
Linearization and Multivariate Taylor Series

UNIT-V
Probability and Distributions: Construction of a Probability Space, Discrete and Continuous
Probabilities, Sum Rule, Product Rule, and Bayes’ Theorem, Summary Statistics and
Independence, Gaussian Distribution, Conjugacy and the Exponential Family, Change of
Variables/Inverse Transform
Continuous Optimization: Optimization Using Gradient Descent, Constrained Optimization and
Lagrange Multipliers, Convex Optimization

Text Books:
1. “Mathematics for Machine Learning”, Marc Peter Deisenroth, A. Aldo Faisal and Cheng
Soon Ong, Cambridge University Press.
2. The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2 nd Edition,
Trevor Hastie, Robert Tibshirani, Jerome Friedman, Springer 2017.

Reference Books:
1. Machine Learning: An Applied Mathematics Introduction, Paul Wilmott, Panda Ohana
Publishing 2019.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

DATA MINING L T P C
I Year - I Semester
(MTAI1103) 3 0 0 3
Course Objectives:

Course Outcomes:
After the completion of the course, student will be able to:
 Compare types of data, quality of data, suitable measures required to perform data analysis.
(UNIT-I) - K2
 Choose appropriate classification technique to perform classification, model building and
evaluation (UNIT-II)- K3
 Make use of association rule mining techniques on categorical and continuous data (UNIT III)
- K3
 Identify and apply clustering algorithm (with open source tools), interpret, evaluate and
report the result (UNIT IV) - K3
 Analyze and Compare anomaly detection techniques (UNI-V) - K4

Unit I:
Introduction to Data mining, types of Data, Data Quality, Data Processing, Measures of Similarity
and Dissimilarity, Exploring Data: Data Set, Summary Statistics, Visualization, OLAP and multi-
dimensional data analysis.

Unit II:
Classification: Basic Concepts, Decision Trees and model evaluation: General approach for
solving a classification problem, Decision Tree induction, Model over fitting: due to presence of
noise, due to lack of representation samples, Evaluating the performance of classifier. Nearest
Neighborhood classifier, Bayesian Classifier, Support vector Machines: Linear SVM, Separable
and Non Separable case.

Unit III:
Association Analysis: Problem Definition, Frequent Item-set generation, rule generation, compact
representation of frequent item sets, FP-Growth Algorithms. Handling Categorical, Continuous
attributes, Concept hierarchy, Sequential, Sub graph patterns

Unit IV:
Clustering: Over view, K-means, Agglomerative Hierarchical clustering, DBSCAN, Cluster
evaluation: overview, Unsupervised Cluster Evaluation using cohesion and separation, using
proximity matrix, Scalable Clustering algorithm

Unit V:
Anomaly Detection: Characteristics of Anomaly Detection Problems and Methods, Statistical
Approaches, Proximity-based Approaches, Clustering-based Approaches and Reconstruction-based
Approaches

Text Books:
1. Introduction to Data Mining: Pang-Ning Tan; Michael Steinbach; Anuj Karpatne; Vipin Kumar,
2nd edition.
2. Data Mining, Concepts and Techniques, 2nd edition, Jiawei Han, Micheline Kamber, Elsevier,
2006.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

Reference Books:
1. Fundamentals of data warehouses, 2ndedition,Jarke, Lenzerini, Vassiliou, Vassiliadis, Springer.

Suggested NPTEL Course and other Useful Websites:

1. https://nptel.ac.in/courses/106105174/
2. http://cse20-iiith.vlabs.ac.in/
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

BIG DATA ANALYTICS L T P C

I Year - I Semester
(MTAI1103) 3 0 0 3

Course Objectives:
This course is aimed at enabling the students to
 Provide an overview of an exciting growing field of big data analytics.
 Introduce the tools required to manage and analyze big data like Hadoop, NoSQL, Map
Reduce, HIVE, Cassandra, Spark.
 Teach the fundamental techniques and principles in achieving big data analytics with
scalability and streaming capability.
 Optimize business decisions and create competitive advantage with Big Data analytics

Course Outcomes:
After the completion of the course, student will be able to
 Illustrate on big data and its use cases from selected business domains.
 Interpret and summarize on NoSQL, Cassandra
 Analyze the HADOOP and Map Reduce technologies associated with big data analytics and
explore on Big Data applications Using Hive.
 Make use of Apache Spark, RDDs etc. to work with datasets.
 Assess real time processing with Spark Streaming.

UNIT I:
What is big data, why big data, convergence of key trends, unstructured data, industry examples
of big data, web analytics, big data and marketing, fraud and big data, risk and big data, credit risk
management, big data and algorithmic trading, big data and healthcare, big data in medicine,
advertising and big data, big data technologies, introduction to Hadoop, open source technologies,
cloud and big data, mobile business intelligence, Crowd sourcing analytics, inter and trans
firewall analytics.

UNIT II:
Introduction to NoSQL, aggregate data models, aggregates, key-value and document data models,
relationships, graph databases, schema less databases, materialized views, distribution models,
sharding, master-slave replication, peer- peer replication, sharding and replication, consistency,
relaxing consistency, version stamps, Working with Cassandra ,Table creation, loading and
reading data.

UNIT III:
Data formats, analyzing data with Hadoop, scaling out, Architecture of Hadoop distributed file
system (HDFS), fault tolerance ,with data replication, High availability, Data locality , Map
Reduce Architecture, Process flow, Java interface, data flow, Hadoop I/O, data integrity,
compression, serialization. Introduction to Hive, data types and file formats, HiveQL data
definition, HiveQL data manipulation, Logical joins, Window functions, Optimization, Table
partitioning, Bucketing, Indexing, Join strategies.

UNIT IV:
Apache spark- Advantages over Hadoop, lazy evaluation, In memory processing, DAG, Spark
context, Spark Session, RDD, Transformations- Narrow and Wide, Actions, Data frames ,RDD
to Data frames, Catalyst optimizer, Data Frame Transformations, Working with Dates and
Timestamps, Working with Nulls in Data, Working with Complex Types, Working with JSON,
Grouping, Window Functions, Joins, Data Sources, Broadcast Variables, Accumulators,
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

Deploying Spark- On-Premises Cluster Deployments, Cluster Managers- Standalone Mode,

Spark on YARN , Spark Logs, The Spark UI- Spark UI History Server, Debugging and Spark
First Aid

UNIT V:
Spark-Performance Tuning, Stream Processing Fundamentals, Event-Time and State full
Processing - Event Time, State full Processing, Windows on Event Time- Tumbling Windows,
Handling Late Data with Watermarks, Dropping Duplicates in a Stream, Structured Streaming
Basics - Core Concepts, Structured Streaming in Action, Transformations on Streams, Input and
Output.

Text Books:
1. Big Data, Big Analytics: Emerging, Michael Minnelli, Michelle Chambers, and Ambiga
Dhiraj
2. SPARK: The Definitive Guide, Bill Chambers &Matei Zaharia, O'Reilley, 2018Edition
3. Business Intelligence and Analytic Trends for Today's Businesses", Wiley,2013
4. P. J. Sadalage and M. Fowler, "NoSQL Distilled: A Brief Guide to the Emerging World
Polyglot Persistence", Addison-Wesley Professional,2012
5. Tom White, "Hadoop: The Definitive Guide", Third Edition, O'Reilley,2012

Reference Books:
1. "Hadoop Operations", O'Reilley, Eric Sammer,2012
2. "Programming Hive", O'Reilley, E. Capriolo, D. Wampler, and J. Rutherglen,2012
3. "HBase: The Definitive Guide", O'Reilley, Lars George,2011
4. "Cassandra: The Definitive Guide", O'Reilley, Eben Hewitt,2010
5. "Programming Pig", O'Reilley, Alan Gates,2011
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

HIGH PERFORMANCE COMPUTING L T P C

I Year - I Semester
(MTAI1103) 3 0 0 3
Course Objectives:
The objective of the subject is to
 Introduce the basic concepts related to HPC architecture and parallel computing
 Discuss various computational techniques for studying soft matter systems.
 Apply these concepts to examine complex biomolecular/materials systems that generally
require large-scale HPC platform with hybrid CPU-GPU architectures

Course Outcomes: After completion of this course

 Design, formulate, solve and implement high performance versions of standard single
threaded algorithms.
 Demonstrate the architectural features in the GPU and MIC hardware accelerators.
 Design programs to extract maximum performance in a multicore, shared memory
execution environment processor.
 Analyze Symmetric and Distributed architectures.
 Develop and deploy large scale parallel programs on tightly coupled parallel systems
using the message passing paradigm.

UNIT I:
Graphics Processing Units-Introduction to Heterogeneous Parallel Computing, GPU
architecture, Thread hierarchy, GPU Memory Hierarchy.

UNIT II:
GPGPU Programming-Vector Addition, Matrix Multiplication algorithms. 1D, 2D, and 3D
Stencil Operations, Image Processing algorithms – Image Blur, Gray scaling. Histogramming,
Convolution, Scan, Reduction techniques.

UNIT III:
Many Integrated Cores-Introduction to Many Integrated Cores. MIC, Xeon Phi architecture.
Thread hierarchy. Memory Hierarchy, .Memory Bandwidth and performance considerations.

UNIT IV:
Shared Memory Parallel Programming- Symmetric and Distributed architectures, OpenMP
Introduction. Thread creation, Parallel regions. Worksharing, Synchronization.

UNIT V:
Message Passing Interface-MPI Introduction, Collective communication, Data grouping for
communication.

Text Books:
1. Programming Massively Parallel Processors A Hands-on Approach, 3e Wen-Mei W Hwu,
David B Kirk, MorgannKaufmann,2013.
2. Using OpenMP, Scientific and Engineering edition, Barbara Chapman, Gabriele Jost, Ruud
vander Pas, MIT Press,2008.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

Reference Books:
1. Intel Xeon Phi Coprocessor Architecture and Tools, Rezaur Rahman, Apress Open,2013.
2. Using MPI, Gropp, Lusk, Skjellum, The MIT press,2014.
3. High Performance Computing: Programming and Applications, John Levesque, CRC Press,
2010.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

CLOUD COMPUTING L T P C
I Year - I Semester
(MTAI1104) 3 0 0 3

Course Objectives:
 To implement Virtualization
 To implement Task Scheduling algorithms.
 Apply Map-Reduce concept to applications.
 To build Private Cloud.
 Broadly educate to know the impact of engineering on legal and societal issues involved.

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

 Interpret the key dimensions of the challenge of Cloud Computing
 Examine the economics, financial, and technological implications for selecting cloud
computing for own organization.
 Assessing the financial, technological, and organizational capacity of employer’s for actively
initiating and installing cloud-based applications
 Evaluate own organizations’ needs for capacity building and training in cloud computing-related
IT areas.
 Illustrate Virtualization for Data-Center Automation.

UNIT I:
Introduction: Network centric computing, Network centric content, peer-to –peer systems, cloud
computing delivery models and services, Ethical issues, Vulnerabilities, Major challenges for cloud
computing. Parallel and Distributed Systems: Introduction, architecture, distributed systems,
communication protocols, logical clocks, message delivery rules, concurrency, model concurrency
with Petri Nets.

UNIT II:
Cloud Infrastructure: At Amazon, The Google Perspective, Microsoft Windows Azure, Open
Source Software Platforms, Cloud storage diversity, Inter cloud, energy use and ecological impact,
responsibility sharing, user experience, Software licensing, Cloud Computing :Applications and
Paradigms: Challenges for cloud, existing cloud applications and new opportunities, architectural
styles, workflows, The Zookeeper, The Map Reduce Program model, HPC on cloud, biological
research.

UNIT III:
Cloud Resource virtualization: Virtualization, layering and virtualization, virtual machine
monitors, virtual machines, virtualization- full and para, performance and security isolation,
hardware support for virtualization, Case Study: Xen, vBlades, Cloud Resource Management and
Scheduling: Policies and Mechanisms, Applications of control theory to task scheduling, Stability
of a two-level resource allocation architecture, feedback control based on dynamic thresholds,
coordination, resource bundling, scheduling algorithms, fair queuing, start time fair queuing, cloud
scheduling subject to deadlines, Scheduling Map Reduce applications, Resource management and
dynamic application scaling.

UNIT IV:
Storage Systems: Evolution of storage technology, storage models, file systems and database,
distributed file systems, general parallel file systems. Google file system. Apache Hadoop, Big
Table, Megastore (text book 1), Amazon Simple Storage Service(S3) (Text book 2), Cloud
Security: Cloud security risks, security – a top concern for cloud users, privacy and privacy
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

impact assessment, trust, OS security, Virtual machine security, Security risks.

UNIT V:
Cloud Application Development: Amazon Web Services : EC2 – instances, connecting clients,
security rules, launching, usage of S3 in Java, Installing Simple Notification Service on Ubuntu
10.04, Installing Hadoop on Eclipse, Cloud based simulation of a Distributed trust algorithm,
Cloud service for adaptive data streaming ( Text Book 1), Google: Google App Engine, Google
Web Toolkit (Text Book 2), Microsoft: Azure Services Platform, Windows live, Exchange
Online, Share Point Services, Microsoft Dynamics CRM (Text Book2).

Text Books:
1. Cloud Computing, Theory and Practice, Dan C Marinescu, MK Elsevier
2. Cloud Computing, A Practical Approach, Anthony T Velte, Toby J Velte, Robert Elsenpeter,
TMH

Reference book:
1. Mastering Cloud Computing, Foundations and Application Programming, Raj Kumar Buyya,
Christen vecctiola, S Tammaraiselvi, TMH
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

INTERNET OF THINGS L T P C
I Year - I Semester
(MTAI1104) 3 0 0 3
Course Objectives:
 Vision and Introduction to Internet of Things (IoT).
 Understand IoT Market perspective.
 Data and Knowledge Management and use of Devices in IoT Technology.
 Understand State of the Art – IoT Architecture.
 Understand Real World IoT Design Constraints, Industrial Automation and Commercial.

Course Outcomes (COs): At the end of the course, student will be able to
 Explain in a concise manner how the general Internet as well as Internet of Things work.
 Understand constraints and opportunities of wireless and mobile networks for Internet of
Things.
 Use basic sensing and measurement and tools to determine the real-time performance of
network of devices.
 Develop prototype models for various applications using IoT technology.

UNIT I:
The Internet of Things: An Overview of Internet of things, Internet of Things Technology,
behind IoTs Sources of the IoTs, M2M Communication, Examples of IoTs, Design Principles For
Connected Devices Internet Connectivity Principles, Internet connectivity, Application Layer
Protocols: HTTP, HTTPS, FTP, Telnet.

UNIT II:
Business Models for Business Processes in the Internet of Things ,IoT/M2M systems LAYERS
AND designs standardizations ,Modified OSI Stack for the IoT/M2M Systems ,ETSI M2M
domains and High- level capabilities ,Communication Technologies, Data Enrichment and
Consolidation and Device Management Gateway Ease of designing and affordability

UNIT III:
Design Principles for the Web Connectivity for connected-Devices, Web Communication protocols
for Connected Devices, Message Communication protocols for Connected Devices, Web
Connectivity for connected-Devices.

UNIT IV:
Data Acquiring, Organizing and Analytics in IoT/M2M, Applications /Services /Business
Processes, IOT/M2M Data Acquiring and Storage, Business Models for Business Processes in the
Internet Of Things, Organizing Data, Transactions, Business Processes, Integration and Enterprise
Systems.

UNIT V:
Data Collection, Storage and Computing Using a Cloud Platform for IoT/M2M
Applications/Services, Data Collection, Storage and Computing Using cloud platform Everything
as a service and Cloud Service Models, IOT cloud-based services using the Xively
(Pachube/COSM), Nimbits and other platforms Sensor, Participatory Sensing, Actuator, Radio
Frequency Identification, and Wireless, Sensor Network Technology, Sensors Technology, Sensing
the World.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

Text Books:
1. Internet of Things: Architecture, Design Principles And Applications, Rajkamal, McGraw Hill
Higher Education
2. Internet of Things, A.Bahgya and V.Madisetti, Univesity Press,2015

Reference Books:
1. Designing the Internet of Things, Adrian McEwen and Hakim Cassimally, Wiley
2. Getting Started with the Internet of Things, CunoPfister , Oreilly
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

ANDRIOD APPLICATION DEVELOPMENT L T P C

I Year - I Semester
(MTAI1104) 3 0 0 3
Course Objectives:
 To demonstrate their understanding of the fundamentals of Android operating systems
 To demonstrate their skills of using Android software development tools

Course Outcomes:
 Develop an android app using Android software development tools
 Deploy an android app into a mobile device
 Debug android application programs running on mobile devices.

UNIT –I :
Introduction to Android Operating System: Android OS design and Features – Android
development framework, SDK features, Installing and running applications on Eclipse platform,
Creating AVDs, Types of Android applications, Best practices in Android programming, Android
tools Android application components – Android Manifest file, Externalizing resources like values,
themes, layouts, Menus etc, Resources for different devices and languages, Runtime Configuration
Changes Android Application Lifecycle – Activities, Activity lifecycle, activity states, monitoring
state changes

UNIT – II:
Android User Interface: Measurements – Device and pixel density independent measuring units.
Layouts – Linear, Relative, Grid and Table Layouts. User Interface (UI) Components – Editable and
non-editable Text Views, Buttons, Radio and Toggle Buttons, Checkboxes, Spinners, Dialog and
pickers. Event Handling – Handling clicks or changes of various UI components. Fragments –
Creating fragments, Lifecycle of fragments, Fragment states, Adding fragments to Activity, adding,
removing and replacing fragments with fragment transactions, interfacing between fragments and
Activities, Multi-screen Activities

UNIT –III :
Intents and Broadcasts: Intent – Using intents to launch Activities, Explicitly starting new Activity,
Implicit Intents, Passing data to Intents, Getting results from Activities, Native Actions, using Intent
to dial a number or to send SMS Broadcast Receivers – Using Intent filters to service implicit Intents,
Resolving Intent filters, finding and using Intents received within an Activity Notifications – Creating
and Displaying notifications, Displaying Toasts.

UNIT – IV:
Persistent Storage: Files – Using application specific folders and files, creating files, reading data
from files, listing contents of a directory Shared Preferences – Creating shared preferences, saving
and retrieving data using Shared Preference Database – Introduction to SQLite database, creating and
opening a database, creating tables, inserting retrieving and deleting data, Registering Content
Providers, Using content Providers (insert, delete, retrieve and update)

UNIT – V:
Advanced Topics: Alarms – Creating and using alarms. Using Internet Resources – Connecting to
internet resource, using download manager Location Based Services – Finding Current Location and
showing location on the Map, updating location
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

Text Books:
1. Professional Android 4 Application Development, Reto Meier, Wiley India, (Wrox) , 2012
2. Android Application Development for Java Programmers, James C Sheusi, Cengage Learning,
2013

Reference Books:
1. Beginning Android 4 Application Development, Wei-Meng Lee, Wiley India (Wrox), 2013
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

RESEARCH METHODOLOGY AND IPR L T P C

I Year - I Semester
(MTAI1105) 2 0 0 2
Course Objectives: To understand the research problem
 To know the literature studies, plagiarism and ethics
 To get the knowledge about technical writing
 To analyze the nature of intellectual property rights and new developments
 To know the patent rights

Course Outcomes: At the end of this course, students will be able to

 Understand research problem formulation.

 Analyze research related information
 Follow research ethics
 Understand that today’s world is controlled by Computer, Information Technology, but
tomorrow world will be ruled by ideas, concept, and creativity.
 Understanding that when IPR would take such important place in growth of individuals &
nation, it is needless to emphasis the need of information about Intellectual Property Right to
be promoted among students in general & engineering in particular.
 Understand that IPR protection provides an incentive to inventors for further research work
and investment in R & D, which leads to creation of new and better products, and in turn
brings about, economic growth and social benefits.
UNIT I:
Meaning of research problem, Sources of research problem, Criteria Characteristics of a good
research problem, Errors in selecting a research problem, Scope and objectives of research problem.
Approaches of investigation of solutions for research problem, data collection, analysis,
interpretation, Necessary instrumentations

UNIT II:
Effective literature studies approaches, analysis Plagiarism, Research ethics, Effective technical
writing, how to write report, Paper Developing a Research Proposal, Format of research proposal, a
presentation and assessment by a review committee

UNIT III:
Nature of Intellectual Property: Patents, Designs, Trade and Copyright. Process of Patenting and
Development: technological research, innovation, patenting, development. International Scenario:
International cooperation on Intellectual Property. Procedure for grants of patents, Patenting under
PCT.

UNIT IV:
Patent Rights: Scope of Patent Rights. Licensing and transfer of technology. Patent information and
databases. Geographical Indications.

UNIT V:
New Developments in IPR: Administration of Patent System. New developments in IPR; IPR of
Biological Systems, Computer Software etc. Traditional knowledge Case Studies, IPR and IITs.

Text Books:
1. Stuart Melville and Wayne Goddard, “Research methodology: an introduction for science &
engineering students” Juta Education, 1996.
2. Ranjit Kumar, 2nd Edition, “Research Methodology: A Step by Step Guide for beginners”
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

References:
1. Halbert, “Resisting Intellectual Property”, Taylor & Francis Ltd ,2007.
2. Mayall, “Industrial Design”, McGraw Hill,1992.
3. Niebel, “Product Design”, McGraw Hill,1974.
4. Asimov, “Introduction to Design”, Prentice Hall,1962.
5. Robert P. Merges, Peter S. Menell, Mark A. Lemley, “ Intellectual Property in New
Technological Age”,2016.
6. T. Ramappa, “Intellectual Property Rights Under WTO”, S. Chand,2008
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

ARTIFICIAL INTELLIGENCE LAB L T P C

I Year - I Semester
(MTAI1106) 0 0 4 2

Course Objectives:
● To provide a strong foundation of fundamental concepts in Artificial Intelligence.
● To provide a basic exposition to the goals and methods of Artificial Intelligence.
● To apply the techniques in applications which involve perception, reasoning and learning.
Course Outcomes:
Upon successful completion of the course, the student will be able to:
● Apply the basic principles of AI in problem solving using LISP/PROLOG
● Implement different algorithms using LISP/PROLOG
● Develop an Expert System using JESS/PROLOG

List of Experiments

1. Implementation of DFS for water jug problem using LISP/PROLOG

2. Implementation of BFS for tic-tac-toe problem using LISP/PROLOG/Java
3. Implementation of TSP using heuristic approach using Java/LISP/Prolog
4. Implementation of Simulated Annealing Algorithm using LISP/PROLOG
5. Implementation of Hill-climbing to solve 8- Puzzle Problem
6. Implementation of Monkey Banana Problem using LISP/PROLOG
7. Implementation of A* Algorithm using LISP/PROLOG
8. Implementation of Hill Climbing Algorithm using LISP/PROLOG
9. Implementation Expert System with forward chaining using JESS/CLIPS
10. Implementation Expert System with backward chaining using RVD/PROLOG
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

PYTHON LIBRARIES FOR DATA L T P C

I Year - I Semester EXPLORATION LAB
0 0 4 2
(MTAI1107)

Course Objectives:
After the completion of the course, student will be able to
 Implement data science operations like data collection, management and storing.
 Apply Python programming concepts in data science, including their real-world applications.
 Implement data collection and management scripts using Python Pandas.

Course Outcomes:

List of Experiments:

Experiment 1:
Demonstrate how to load data files using pandas.
i. CSV files
ii. Excel files
iii. Txt files

Experiment2:
Demonstrate how to convert a variable to a different data type using pandas?
i. Convert numeric variables to string variables and vice versa
ii. Convert character date to Date.

Experiment 3:
i. Demonstrate how to transpose a Data set or dataframe using Pandas?
ii. Demonstrate how to sort a Pandas DataFrame?

Experiment 4:
Demonstrate how to create following plots using matplotlib, seaborn?
i. Histogram
ii. Scatter Plot
iii. Box Plot

Experiment 5:
i. Demonstrate how to generate frequency tables with Pandas?
ii. Demonstrate how to generate sample Data set in Python using random?
Experiment 6:
i. Demonstrate how to remove duplicate values of a variable in a Pandas Dataframe?
ii. Demonstrate how to group variables in Pandas to calculate count, average, sum?

Experiment 7:
i. Demonstrate how to recognize and Treat missing values and outliers in Pandas?
ii. Demonstrate how to merge / join data sets and Pandas Dataframes?

Experiment 8:
Create a Dataframe and apply aggregations on it.
i. On a single column
ii. On multiple columns
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

iii. On entire Dataframe

Experiment 9:
Write a Python Program to Extract all the html tag values from a web page using beautifulsoup(Web
Scraping)

Experiment 10:
Write a Python Program to calculate mean, median and mode, standard deviation and skewness.

Text Books:
1. Learning Python ,5th Edition, MarkLutz, OReilly, 2013.
2. Programming Python, 4th Edition, MarkLutz, OReilly, 2010.
3. Python For Data Analysis, 2nd Edition, WesMckinney, O Reilly, 2017.

Web References:
1. https://www.analyticsvidhya.com/blog/2015/04/comprehensive-guide-data-exploration-sas-
using-python-numpy-scipy-matplotlib-pandas/
2. https://www.tutorialspoint.com/python_data_science/python_date_and_time.htm
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

MACHINE LEARNING L T P C
I Year - II Semester
(MTAI1201) 3 0 0 3

Course Objectives:
Machine Learning course will
 Develop an appreciation for what is involved in learning from data.
 Demonstrate a wide variety of learning algorithms.
 Demonstrate how to apply a variety of learning algorithms to data.
 Demonstrate how to perform evaluation of learning algorithms and model selection.

Course Outcomes:
After the completion of the course, student will be able to
 Domain Knowledge for Productive use of Machine Learning and Diversity of Data.
 Demonstrate on Supervised and Computational Learning
 Analyze on Statistics in learning techniques and Logistic Regression
 Illustrate on Support Vector Machines and Perceptron Algorithm
 Design a Multilayer Perceptron Networks and classification of decision tree

UNIT-I:
Introduction-Towards Intelligent Machines, Well posed Problems, Example of Applications in
diverse fields, Data Representation, Domain Knowledge for Productive use of Machine Learning,
Diversity of Data: Structured / Unstructured, Forms of Learning, Machine Learning and Data
Mining, Basic Linear Algebra in Machine Learning Techniques.

UNIT-II:
Supervised Learning- Rationale and Basics: Learning from Observations, Bias and Why
Learning Works: Computational Learning Theory, Occam's Razor Principle and Overfitting
Avoidance Heuristic Search in inductive Learning, Estimating Generalization Errors, Metrics for
assessing regression, Metris for assessing classification.

UNIT-III:
Statistical Learning- Machine Learning and Inferential Statistical Analysis, Descriptive Statistics
in learning techniques, Bayesian Reasoning: A probabilistic approach to inference, K-Nearest
Neighbor Classifier. Discriminant functions and regression functions, Linear Regression with
Least Square Error Criterion, Logistic Regression for Classification Tasks, Fisher's Linear
Discriminant and Thresholding for Classification, Minimum Description Length Principle.

UNIT-IV:
Support Vector Machines (SVM)-Introduction, Linear Discriminant Functions for Binary
Classification, Perceptron Algorithm, Large Margin Classifier for linearly seperable data, Linear
Soft Margin Classifier for Overlapping Classes, Kernel Induced Feature Spaces, Nonlinear
Classifier, Regression by Support vector Machines. Learning with Neural Networks: Towards
Cognitive Machine, Neuron Models, Network Architectures, Perceptrons, Linear neuron and the
Widrow-Hoff Learning Rule, The error correction delta rule.

UNIT -V:
Multilayer Perceptron Networks and error back propagation algorithm, Radial Basis Functions
Networks. Decision Tree Learning: Introduction, Example of classification decision tree,
measures of impurity for evaluating splits in decision trees, ID3, C4.5, and CART decision trees,
pruning the tree, strengths and weakness of decision tree approach.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

Text Books:
1. Applied Machine Learning, M.Gopal, McGraw Hill Education, 2019
2. Kevin Murphy, Machine Learning: A Probabilistic Perspective, MIT Press,2012

Reference Books:
1. Trevor Hastie, Robert Tibshirani, Jerome Friedman, The Elements of Statistical Learning,
Springer 2009 (freely available online)
2. Christopher Bishop, Pattern Recognition and Machine Learning, Springer,2007.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

SOFTCOMPUTING L T P C
I Year - II Semester
(MTAI1202) 3 0 0 3

Course Objectives:

Course Outcomes
After completion of course, students would be able to:

UNIT-I:
Introduction to Soft computing, Artificial Neural Network: An Introduction, Evolution of Neural
Networks, Basic Models of Artificial Neural Network, Important Terminologies of ANNs, McCulloch–
Pitts Neuron, Linear Separability, Hebb Network.

UNIT-II:
Supervised Learning Network, Perceptron Networks, Adaptive Linear Neuron (Adaline), Multiple
Adaptive Linear Neurons, Back-Propagation Network, Radial Basis Function Network, Time Delay
Neural Network, Associative Memory Networks, Hopfield Networks

UNIT-III :
Introduction to Fuzzy Logic, Classical Sets and Fuzzy Sets, Classical Relations and Fuzzy Relations,
Tolerance and Equivalence Relations, Noninteractive Fuzzy Sets, Membership Function, Features of the
Membership Functions, Fuzzification, Methods of Membership Value Assignments, Methods of
Membership Value Assignments, Defuzzification

UNIT-IV:
Fuzzy Arithmetic and Fuzzy Measures, Measures of Fuzziness, Fuzzy Rule Base and Approximate
Reasoning, Fuzzy Propositions, Formation of Rules, Decomposition of Rules (Compound Rules),
Aggregation of Fuzzy Rules, Fuzzy Reasoning (Approximate Reasoning), Fuzzy Inference Systems (FIS),
Overview of Fuzzy Expert System

UNTI-V :
Genetic Algorithm, Introduction, Biological Background, Genetic Algorithm and Search Space, Basic
Terminologies in Genetic Algorithm, General Genetic Algorithm, Operators, Stopping Condition for
Genetic Algorithm Flow, Constraints, Problem Solving Using Genetic Algorithm, The Schema Theorem,
Classification of Genetic Algorithm, Advantages and Limitations of Genetic Algorithm, Applications of
Genetic Algorithm.

Text Books:
1. S.N. Sivanandam, S.N. Deepa, Principles of Soft Computing, 3ed, Wiley India.
2. Fakhreddine O. Karray, Clarence W. De Silva, Soft Computing and Intelligent Systems Design: Theory,
Tools and Applications, 1e, Pearson.

References:
1. Fundamentals of Neural Networks – Laurene Fauseett, Prentice Hall India, New Delhi, 1994.
2. Timothy J. Ross,Fuzzy Logic with Engineering Applications, 3 ed, Wiley India
3. E – Neuro Fuzzy and Soft computing – Jang J.S.R., Sun C.T and Mizutami, Prentice hall New Jersey, 1998
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

DEEP LEARNING L T P C
I Year - II Semester
(MTAI1203) 3 0 0 3

Course Objectives:
The objective of this course is to cover the fundamentals of neural networks as well as some
advanced topics such as recurrent neural networks, long short term memory cells and
convolutional neural networks.

Course Outcomes
After completion of course, students would be able to:
 Explore feed forward networks and Deep Neural networks
 Mathematically understand the deep learning approaches and paradigms
 Apply the deep learning techniques for various applications

UNIT I:
Basics- Biological Neuron, Idea of computational units, McCulloch–Pitts unit and
Thresholding logic, Linear Perceptron, Perceptron Learning Algorithm, Linear separability,
Convergence theorem for Perceptron Learning Algorithm.

UNIT II:
Feedforward Networks- Multilayer Perceptron, Gradient Descent, Backpropagation,
Empirical Risk Minimization, regularization, autoencoders.
Deep Neural Networks: Difficulty of training deep neural networks, Greedy layer wise
training.

UNIT III:
Better Training of Neural Networks- Newer optimization methods for neural networks
(Adagrad, adadelta, rmsprop, adam, NAG), second order methods for training, Saddle point
problem in neural networks, Regularization methods (dropout, drop connect, batch
normalization).

UNIT IV:
Recurrent Neural Networks- Back propagation through time, Long Short Term Memory,
Gated Recurrent Units, Bidirectional LSTMs, Bidirectional RNNs.
Convolutional Neural Networks: LeNet, AlexNet. Generative models: Restrictive Boltzmann
Machines (RBMs), Introduction to MCMC and Gibbs Sampling, gradient computations in
RBMs, Deep Boltzmann Machines.

UNIT V:
Recent trends- Variational Autoencoders, Generative Adversarial Networks, Multi-task Deep
Learning, Multi-view Deep Learning
Applications: Vision, NLP, Speech

Text Books:
1. Deep Learning, Ian Goodfellow and Yoshua Bengio and Aaron Courville, MIT Press, 2016.

Reference Books:
1. Neural Networks: A Systematic Introduction, Raúl Rojas, 1996
2. Pattern Recognition and Machine Learning, Christopher Bishop,2007
3. Deep Learning with Python, François Chollet, Manning Publications, 2017.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

NATURAL LANGUGAGE PROCESSING L T P C

I Year - II Semester
(MTAI1203) 3 0 0 3

Course Objectives:
This course introduces the fundamental concepts and techniques of natural language processing
(NLP).
 Students will gain an in-depth understanding of the computational properties of natural
languages and the commonly used algorithms for processing linguistic information.
 The course examines NLP models and algorithms using both the traditional symbolic and
the more recent statistical approaches.
 Enable students to be capable to describe the application based on natural language
processing and to show the points of syntactic, semantic and pragmatic processing.

Course Outcomes:
After completion of this course
 Demonstrate a given text with basic Language features
 To design an innovative application using NLP components
 Explain a rule based system to tackle morphology/syntax of a language
 To design a tag set to be used for statistical processing for real-time applications
 To compare and contrast the use of different statistical approaches for different types of
NLP applications.

UNIT I:
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.

UNIT II:
WORD LEVEL ANALYSIS: Unsmoothed N-grams, Evaluating N-grams, Smoothing,
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.

UNIT III:
SYNTACTIC ANALYSIS: Context-Free Grammars, Grammar rules for English, Treebanks,
Normal Forms for grammar – Dependency Grammar – Syntactic Parsing, Ambiguity, Dynamic
Programming parsing – Shallow parsing Probabilistic CFG, Probabilistic CYK, Probabilistic
Lexicalized CFGs – Feature structures, Unification of feature structures

UNIT IV:
SEMANTICS AND PRAGMATICS: Requirements for representation, First-Order Logic,
Description Logics – Syntax-Driven Semantic analysis, Semantic attachments – Word Senses,
Relations between Senses, Thematic Roles, selectional restrictions – Word Sense
Disambiguation, WSD using Supervised, Dictionary & Thesaurus, Bootstrapping methods –
Word Similarity using Thesaurus and Distributional methods.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

UNIT V:
DISCOURSE ANALYSIS AND LEXICAL RESOURCES: Discourse segmentation,
Coherence – Reference Phenomena, Anaphora Resolution using Hobbs and Centering Algorithm
– Coreference Resolution – Resources: Porter Stemmer, Lemmatizer, Penn Treebank, Brill’s
Tagger, WordNet, PropBank, FrameNet, Brown Corpus, British National Corpus (BNC).

Text Books:
1. Speech and Language Processing: An Introduction to Natural Language Processing,
nd
Computational Linguistics and Speech, 2 Edition, Daniel Jurafsky, James H. Martin -
Pearson Publication,2014.
2. Natural Language Processing with Python, First Edition, Steven Bird, Ewan Klein and
Edward Loper, OReilly Media,2009.

Reference Books:
st
1. Language Processing with Java and Ling Pipe Cookbook, 1 Edition, Breck Baldwin,
Atlantic Publisher,2015.
nd
2. Natural Language Processing with Java, 2 Edition, Richard M Reese, OReilly Media,2015.
3. Handbook of Natural Language Processing, Second, Nitin Indurkhya and Fred J. Damerau,
Chapman and Hall/CRC Press, 2010.Edition
rd
4. Natural Language Processing and Information Retrieval, 3 Edition, Tanveer Siddiqui, U.S.
Tiwary, Oxford University Press,2008.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

COMPUTER VISION L T P C
I Year - II Semester
(MTAI1203) 3 0 0 3

Course Objective:
To Recognize and describe both the theoretical and practical aspects of computing with images and to
Connect issues from Computer Vision to Human Vision

Course Outcomes:
 Provide an introduction to computer vision including fundamentals of image formation
 Enumerate the concepts of Feature detection and Matching
 Discuss about Image Segmentation Techniques
 Discuss applications of Feature based alignment like pose estimation
 Discuss different recognition techniques.

UNIT-I
Introduction: What is computer vision, A brief history, Image Formation, Geometric primitives
and transformations, Photometric image formation, The digital camera.

UNIT-II
Feature detection and matching: Points and patches, Feature detectors, Feature descriptors,
Feature matching, Feature tracking, Application: Performance-driven animation, Edges,
Application: Edge editing and enhancement, Lines, Application: Rectangle detection.

UNIT-III
Segmentation: Active contours, Split and merge, Mean shift and mode finding, Normalized cuts,
Graph cuts and energy-based methods, Application: Medical image segmentation.

UNIT-IV
Feature-based alignment: 2D and 3D feature-based alignment, Pose estimation, Geometric
intrinsic calibration, Calibration patterns, Vanishing points, Application: Single view metrology,
Rotational motion, Radial distortion.

UNIT-V
Recognition: Object detection, Face detection, Pedestrian detection, Face recognition,
Eigenfaces, Active appearance and 3D shape models, Application: Personal photo collections,
Instance recognition, Category recognition, Context and scene understanding.

Text Books:
1. Richard Szeliski,"Computer Vision: Algorithms and Applications", Springer, 2010.
2. Rafael C. Gonzalez "Digital Image Processing", Pearson Education; Fourth edition (2018)

Reference Books:
1. Forsyth /Ponce, "Computer Vision: A Modern Approach", Pearson Education India; 2nd edition (2015)
2. S.Nagabhushana, "Computer Vision and Image Processing", New Age International Pvt Ltd; First edition
(2005)
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

ROBOTICS AND INTELLIGENT SYSTEMS L T P C

I Year - II Semester
(MTAI1204) 3 0 0 3

Course Objective:
To understand the use of robotics in building intelligent systems.

Course Outcomes:
 Enumerate the fundamentals of robotics and Artificial Intelligence (AI).
 Demonstrate how to setting up a Robot.
 Discuss about the practical Robot Design Process.
 Discuss Object Recognition Using Neural Networks and Supervised Learning

UNIT-I:
Foundation for Advanced Robotics and AI: The basic principle of robotics and AI, What is AI and
what is it not, The example problem, Artificial intelligence and advanced robotics techniques, Introducing
the robot and our development environment, Software components (ROS, Python, and Linux), Robot
control systems and a decision-making framework, The robot control system – a control loop with soft
real-time control

UNIT-II:
Setting Up Your Robot: Technical requirements, What is a robot, Robot anatomy, Subsumption
architecture, Software setup, Hardware, Assembling the tracks, Mounting the tracks, Arm base assembly,
Wiring.

UNIT-III:
A Concept for a Practical Robot Design Process, A systems engineering-based approach to robotics,
Use cases, The problem –put away the toys, Project goals, Decomposing hardware needs, Breaking down
software needs.

UNIT-IV:
Object Recognition Using Neural Networks and Supervised Learning: Technical requirements, The
image recognition process, The image recognition training and deployment process – step by step, The
convolution neural network process, Build the toy/not toy detector

UNIT-V:
Picking up the Toys: Technical requirements, Task analysis, Summary of robot arm learning process,
Teaching the robot arm, Version one – action state reinforcement learning, Adaptive learning rate, Q-
learning implementation, Google’s SAC-X, Amazon Robotics Challenge

Text Books:
1. Francis X. Govers, Artificial Intelligence for Robotics: Build intelligent robots that perform
human tasks using AI techniques, PACKT
2. J. J. Craig, Introduction to Robotics, Addison Wesley Publishers, 2005

Reference Books:
1. M. Negnevitsky, Artificial Intelligence – A guide to intelligent systems Addison-Wesley, 2005
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

REINFORCEMENT LEARNING L T P C
I Year - II Semester
(MTAI1204) 3 0 0 3

Course Objective:
To provide the fundamentals of Reinforcement learning.

Course Outcomes:
 Enumerate the elements of Reinforcement Learning
 Solve the n-armed Bandit problem
 Compare different Finite Markov Decision Process
 Discuss about Monte Carlo Methods in solving real world problems
 List the Applications and Case Studies of Reinforcement Learning

UNIT-I
The Reinforcement Learning Problem: Reinforcement Learning, Examples, Elements of Reinforcement
Learning, Limitations and Scope, An Extended Example: Tic-Tac-Toe, Summary, History of Reinforcement
Learning.

UNIT-II
Multi-arm Bandits: An n-Armed Bandit Problem, Action-Value Methods, Incremental Implementation, Tracking
a Nonstationary Problem, Optimistic Initial Values, Upper-Confidence-Bound Action Selection, Gradient Bandits,
Associative Search (Contextual Bandits)

UNIT-III
Finite Markov Decision Processes: The Agent–Environment Interface, Goals and Rewards, Returns, Unified
Notation for Episodic and Continuing Tasks, The Markov Property, Markov Decision Processes,
Value Functions, Optimal Value Functions, Optimality and Approximation.

UNIT-IV
Monte Carlo Methods: Monte Carlo Prediction, Monte Carlo Estimation of Action Values, Monte Carlo Control,
Monte Carlo Control without Exploring Starts, Off-policy Prediction via Importance Sampling, Incremental
Implementation, Off-Policy Monte Carlo Control, Importance Sampling on Truncated Returns

UNIT-V
Applications and Case Studies: TD-Gammon, Samuel’s Checkers Player, TheAcrobot, Elevator
Dispatching, Dynamic Channel Allocation, Job-Shop Scheduling.

Text Books:
1. Richard S. Sutton and Andrew G. Barto, “Reinforcement Learning-An Introduction”,2nd
Edition,The MIT Press,2018
2. Marco Wiering , Martijn van Otterlo Reinforcement Learning: State-of-the-Art (Adaptation,
Learning, and Optimization (12)) 2012th Edition

Reference Books:
1. Vincent François-Lavet , Peter Henderson , Riashat Islam, An Introduction to Deep
Reinforcement Learning (Foundations and Trends(r) in Machine Learning) , 2019
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

AI CHATBOTS L T P C
I Year - II Semester
(MTAI1204) 3 0 0 3

Course Objectives:
 Learn how artificial intelligence powers chatbots, get an overview of the bot ecosystem and bot anatomy, and study
different types of bots and use cases.
 Identify best practices for defining a chatbot use case, and use a rapid prototyping framework to develop a use case
for a personalized chatbot.

Course Outcomes:
 Develop an in-depth understanding of conversation design, including onboarding, flows,
utterances, entities, and personality.
 Design, build, test, and iterate a fully-functional, interactive chatbot using a commercial platform.
 Deploy the finished chatbot for public use and interaction.

UNIT-I
Introduction: Benefits from Chatbots for a Business, A Customer-Centric Approach in Financial Services,
Chatbots in the Insurance Industry, Conversational Chatbot Landscape,
Identifying the Sources of Data: Chatbot Conversations, Training Chatbots for Conversations, Personal
Data in Chatbots, Introduction to the General Data Protection Regulation (GDPR)

UNIT-II
Chatbot Development Essentials: Customer Service-Centric Chatbots, Chatbot Development Approaches,
Rules-Based Approach, AI-Based Approach, Conversational Flow, Key Terms in Chatbots, Utterance,
Intent, Entity, Channel, Human Takeover, Use Case: 24x7 Insurance Agent

UNIT-III
Building a Chatbot Solution: Business Considerations, Chatbots Vs Apps, Growth of Messenger
Applications, Direct Contact Vs Chat, Business Benefits of Chatbots, Success Metrics, Customer
Satisfaction Index, Completion Rate, Bounce Rate, Managing Risks in Chatbots Service, Generic
Solution Architecture for Private Chatbots

UNIT-IV
Natural Language Processing, Understanding, and Generation: Chatbot Architecture, Popular Open
Source NLP and NLU Tools, Natural Language Processing, Natural Language Understanding, Natural
Language Generation, Applications.

UNIT-V
Introduction to Microsoft Bot, RASA, and Google Dialogflow: Microsoft Bot Framework, Introduction
to QnA Maker, Introduction to LUIS, Introduction to RASA, RASA Core, RASA NLU, Introduction to
Dialogflow
Chatbot Integration Mechanism: Integration with Third-Party APIs, Connecting to an Enterprise Data
Store, Integration Module

Text Books:
1. Abhishek Singh, Karthik Ramasubramanian, Shrey Shivam, “Building an Enterprise Chatbot:
Work with Protected Enterprise Data Using Open Source Frameworks”, ISBN 978-1-4842-5034-
1, Apress,2019
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

References:
1. Janarthanam and Srini, Hands-on chatbots and conversational UI development: Build chatbots and
voice user interfaces with C (1 ed.), Packt Publishing Ltd, 2017. ISBN 978-1788294669.
2. Galitsky, Boris., Developing Enterprise Chatbots (1 ed.), Springer International Publishing, 2019.
ISBN 978-303004298
3. Kelly III, John E. and Steve Hamm, Smart machines: IBM's Watson and the era of cognitive
computing (1 ed.), Columbia University Press, 2013. ISBN 978- 0231168564.
4. Abhishek Singh, Karthik Ramasubramanian and Shrey Shivam, Building an Enterprise Chatbot
(1 ed.), Springer, 2019. ISBN 978-1484250334.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

MACHINE LEARNING LAB L T P C

I Year - II Semester
(MTAI1205) 0 0 4 2

Course Objectives:

Course Outcomes: On completion of this course, the student will be able to

 Implement machine learning algorithms to real world problems
 Choose appropriate machine learning algorithm for a problem
 Interpret the results of two different machine learning algorithms

List of Experiments:

1. Implement Principal Component Analysis (PCA) and Singular Value Decomposition (SVD)
using NumPy.
2. Implement and demonstrate the FIND-S algorithm for finding the most specific hypothesis based
on a given set of training data samples. Read the training data from a .CSV file.
3. For a given set of training data examples stored in a .CSV file, implement and demonstrate the
Candidate-Elimination algorithm to output a description of the set of all hypotheses consistent
with the training examples.
4. Write a program to demonstrate the working of the decision tree based ID3 algorithm. Use an
appropriate data set for building the decision tree and apply this knowledge to classify a new
sample.
5. Build an Artificial Neural Network by implementing the Back propagation algorithm and test
the same using appropriate data sets.
6. Write a program to implement the naïveBayesian classifier for a sample training data set stored
as a .CSV file. Compute the accuracy of the classifier, considering few test data sets.
7. Assuming a set of documents that need to be classified, use the naïve Bayesian Classifier model
to perform this task. Built-in Java classes/API can be used to write the program. Calculate the
accuracy, precision, and recall for your data set.
8. Write a program to construct a Bayesian network considering medical data. Use this model to
demonstrate the diagnosis of heart patients using standard Heart Disease Data Set. You can use
Java/Python ML library classes/API.
9. Apply EM algorithm to cluster a set of data stored in a .CSV file. Use the same data set for
clustering using k-Means algorithm. Compare the results of these two algorithms and comment
on the quality of clustering. You can add Java/Python ML library classes/API in the program.
10. Write a program to implement k-Nearest Neighbour algorithm to classify the iris data set. Print
both correct and wrong predictions. Java/Python ML library classes can be used for this problem.
11. Implement the non-parametric Locally Weighted Regression algorithm in order to fit data
points. Select appropriate data set for your experiment and draw graphs.
12. Create the following plots using Matplotlib, Pandas Visualization, Seaborn on iris dataset, wine
reviews datasets.
a) Scatter Plot
b) Line chart
c) Histogram
d) Heatmap
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

Text Books:
1. Hands–On Machine Learning with Scikit–Learn and TensorFlow 2e: Concepts, Tools, and Techniques to Build
Intelligent Systems, Aurelien Geron, 2019.

References:
1. https://scikit-learn.org/stable/tutorial/index.html
2. https://archive.ics.uci.edu/ml/index.php
3. https://towardsdatascience.com/pca-and-svd-explained-with-numpy-5d13b0d2a4d8
4. https://towardsdatascience.com/introduction-to-data-visualization-in-python-89a54c97fbed
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

SOFT COMPUTING LAB L T P C

I Year - II Semester
(MTAI1206) 0 0 4 2

Course Objectives:

Course Outcomes: On completion of this course, the student will be able to



List of Experiments
1. Create a perceptron with appropriate number of inputs and outputs. Train it using fixed increment
learning algorithm until no change in weights is required. Output the final weights.
2. Write a program to implement artificial neural network without back propagation. Write a
program to implement artificial neural network with back propagation.
3. Implement Union, Intersection, Complement and Difference operations on fuzzy sets. Also create
fuzzy relation by Cartesian product of any two fuzzy sets and perform max-min composition on
any two fuzzy relations.
4. Implement travelling sales person problem (tsp) using genetic algorithms.
5. Plot the correlation plot on dataset and visualize giving an overview of relationships among data
on soya bins data. Analysis of covariance: variance (ANOVA), if data have categorical variables
on iris data.
6. Implement linear regression and multi-regression for a set of data points
7. Implement crisp partitions for real-life iris dataset
8. Write a program to implement Hebb’s rule Write a program to implement Delta rule.
9. Write a program to implement logic gates.
10. Implement SVM classification by fuzzy concepts.
11. Design a neural network for classifying movie reviews (Binary Classification) using IMDB
dataset.
12. Build a Convolution Neural Network for simple image (dogs and Cats) Classification
13. Implement a Recurrent Neural Network for IMDB movie review classification problem
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

RECOMMENDER SYSTEMS L T P C
II Year - I Semester
(MTAI2101) 3 0 0 3

Course Objectives:
This course covers the basic concepts of recommender systems, including personalization algorithms,
evaluation tools, and user experiences

Course Outcomes:
 Describe basic concepts behind recommender systems
 Explain a variety of approaches for building recommender systems
 Describe system evaluation methods from both algorithmic and users’ perspectives
 Describe applications of recommender systems in various domains

UNIT-I:
Introduction: Recommender system functions, Linear Algebra notation: Matrix addition, Multiplication,
transposition, and inverses, covariance matrices, Understanding ratings, Applications of recommendation
systems, Issues with recommender system.

UNIT-II:
Collaborative Filtering: User-based nearest neighbor recommendation, Item-based nearest neighbor
recommendation, Model based and pre-processing based approaches, Attacks on collaborative
recommender systems.

UNIT-III:
Content-based recommendation: High level architecture of content-based systems, Advantages and
drawbacks of content based filtering, Item profiles, Discovering features of documents, Obtaining item
features from tags, Representing item profiles, Methods for learning user profiles, Similarity based
retrieval, Classification algorithms.
Knowledge based recommendation: Knowledge representation and reasoning, Constraint based
recommenders, Case based recommenders.

UNIT-IV:
Hybrid approaches: Opportunities for hybridization, Monolithic hybridization design: Feature
combination, Feature augmentation, Parallelized hybridization design: Weighted, Switching, Mixed,
Pipelined hybridization design: Cascade Meta-level, Limitations of hybridization strategies.

UNIT-V:
Evaluating Recommender System: Introduction, General properties of evaluation research, Evaluation
designs, Evaluation on historical datasets, Error metrics, Decision-Support metrics, User-Centered
metrics.
Recommender Systems and communities: Communities, collaboration and recommender systems in
personalized web search, Social tagging recommender systems, Trust and recommendations
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

Text Books:
1. Jannach D., Zanker M. and Fel Fering A., Recommender Systems: An Introduction, Cambridge
University Press(2011), 1st ed.
2. Ricci F., Rokach L., Shapira D., Kantor B.P., Recommender Systems Handbook, Springer(2011),
1sted.

References:
1. Manouselis N., Drachsler H., Verbert K., Duval E., Recommender Systems For Learning,
Springer (2013), 1st ed
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

EXPERT SYSTEMS L T P C
II Year - I Semester
(MTAI2101) 3 0 0 3

Course Objectives:
The main objectives of the course are to learn about Techniques for the construction of expert systems,
including computer inference and knowledge acquisition, knowledge representation schemes, conceptual
date analysis, plausible reasoning techniques, validation and measurement methods, production-rule
programming.

Course Outcomes: By the end of the course

1. Students will be able to explain and describe the concepts central to the creation of knowledge bases
and expert systems.
2. Students will be knowledgeable about the tools and the processes used for the creation of an expert
system.
3. Student will know methods used to evaluate the performance of an expert system.
4. Students will be able to conduct an in-depth examination of an existing expert system with an
emphasis on basic methods of creating a knowledge base.
5. Students will be able to examine properties of existing systems in a case-study manner,comparing
differing approaches.

UNIT-I :
Introduction to Expert Systems: The meaning of an expert system, problem domain and knowledge
domain, the advantages of an expert system, general stages in the development of an expert system,
general characteristics of an expert system, history and uses of expert systems today, rule-based expert
systems, procedural and nonprocedural paradigms, characteristics of artificial neural systems.

UNIT-II:
The Representation of Knowledge: The study of logic, difference between formal logic and informal
logic, meaning of knowledge, how knowledge can be represented, semantic nets, how to translate
semantic nets into PROLOG, how to use logic and set symbols to represent knowledge, the meaning of
propositional and first order predicate logic, quantifiers, imitations of propositional and predicate logic.

UNIT-III:
Methods of Inference: Trees, lattices, and graphs, state and problem spaces, AND-OR trees and goals,
methods of inference, rules of inference, limitations of propositional logic, logic systems, resolution rule
of inference, resolution systems, and deduction, shallow and causal reasoning, applying resolution to
first-order predicate logic, forward and backward chaining, additional methods of reference, Meta
knowledge, the Markov decision process.

UNIT-IV:
Reasoning Under Uncertainty: The meaning of uncertainty and theories devised to deal with it, types of
errors attributed to uncertainty, errors associate, with induction, features of classical probability,
hypothetical reasoning and backward induction, temporal reasoning, Markov chains, odds of belief,
sufficiency and necessity, role of uncertainty in inference chains, implications of combining evidence,
role of inference nets in expert systems

UNIT-V:
Design of Expert Systems: How to select an appropriate problem, the stages in the development of an
expert system, types of errors to expect in the development stages, the role of the knowledge engineer in
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

the building of expert systems, the expected life cycle of an expert system, how to do a life cycle model,
Expert System Design Examples

Text Books:
1. Joseph C. Giarratano , Expert Systems : Principles and Programming, 4 th Edition, cengage
learning, 2004
2. Dan w. Patterson, Introduction to Artificial Intelligence and Expert Systems, 1 st Edition, Pearson,
2015.

Reference Books:
1. Durkin, J., Expert systems Design and Development, Macmillan, 1994
2. Elias M. Awad, Building Expert Systems, West Publishing Company 1996
3. Peter Jackson, Introduction to Expert Systems, Addison Wesley Longman, 1999.ISBN 0-
20187686-8.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

AUDIT 1 / 2: ENGLISH FOR RESEARCH PAPER WRITING

Course objectives:
Students will be able to:
1. Understand that how to improve your writing skills and level of readability
2. Learn about what to write in each section
3. Understand the skills needed when writing a Title Ensure the good quality of paper at very
first-time submission

Course Outcomes:

Syllabus

Units CONTENTS Hours

1 Planning and Preparation, Word Order, Breaking up long sentences, 4

Structuring Paragraphs and Sentences, Being Concise
and Removing Redundancy, Avoiding Ambiguity and Vagueness
2 Clarifying Who Did What, Highlighting Your Findings, Hedging and 4
Criticising, Paraphrasing and Plagiarism, Sections of a Paper,
Abstracts. Introduction
3 Review of the Literature, Methods, Results, Discussion, 4
Conclusions, The Final Check.
4 key skills are needed when writing a Title, key skills are needed when 4
writing an Abstract, key skills are needed when writing an
Introduction, skills needed when writing a Review of the Literature,
5 skills are needed when writing the Methods, skills needed when writing the 8
Results, skills are needed when writing the Discussion,
skills are needed when writing the Conclusions

useful phrases, how to ensure paper is as good as it could possibly

be the first- time submission

Suggested Studies:
1. Goldbort R (2006) Writing for Science, Yale University Press (available on Google Books)
2. Day R (2006) How to Write and Publish a Scientific Paper, Cambridge University Press
3. Highman N (1998), Handbook of Writing for the Mathematical Sciences, SIAM.
Highman’sbook .
4. Adrian Wallwork , English for Writing Research Papers, Springer New York Dordrecht
Heidelberg London, 2011
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

AUDIT 1 / 2: DISASTER MANAGEMENT

Course Objectives: -Students will be able to:

1. Learn to demonstrate a critical understanding of key concepts in disaster risk reduction and
humanitarian response.
2. Critically evaluate disaster risk reduction and humanitarian response policy and practice from
multiple perspectives.
3. Develop an understanding of standards of humanitarian response and practical relevance in
specific types of disasters and conflict situations.
4. Critically understand the strengths and weaknesses of disaster management approaches,
planning and programming in different countries, particularly their home country or the
countries they work in

Course Outcomes:

Syllabus

Units CONTENTS Hours

1 Introduction 4
Disaster: Definition, Factors And Significance; Difference Between Hazard And
Disaster; Natural And Manmade Disasters: Difference, Nature, Types And
Magnitude.
2 Repercussions Of Disasters And Hazards: Economic Damage, Loss Of 4
Human And Animal Life, Destruction Of Ecosystem.
Natural Disasters: Earthquakes, Volcanisms, Cyclones, Tsunamis, Floods,
Droughts And Famines, Landslides And Avalanches, Man- made disaster:
Nuclear Reactor Meltdown, Industrial Accidents, Oil Slicks And Spills,
Outbreaks Of Disease And Epidemics, War And Conflicts.
3 Disaster Prone Areas In India 4
Study Of Seismic Zones; Areas Prone To Floods And Droughts, Landslides And
Avalanches; Areas Prone To Cyclonic And Coastal Hazards With Special
Reference To Tsunami; Post-Disaster Diseases And Epidemics

4 Disaster Preparedness And Management 4

Preparedness: Monitoring Of Phenomena Triggering A Disaster Or Hazard;
Evaluation Of Risk: Application Of Remote Sensing, Data From Meteorological
And Other Agencies, Media Reports: Governmental And Community
Preparedness.
5 Risk Assessment 8
Disaster Risk: Concept And Elements, Disaster Risk Reduction, Global And
National Disaster Risk Situation. Techniques Of Risk Assessment, Global Co-
Operation In Risk Assessment And Warning, People’s Participation In Risk
Assessment. Strategies for Survival.

Disaster Mitigation
Meaning, Concept And Strategies Of Disaster Mitigation, Emerging
Trends In Mitigation. Structural Mitigation And Non-Structural Mitigation,
Programs Of Disaster Mitigation In India.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

Suggested Readings:
1. R. Nishith, Singh AK, “Disaster Management in India: Perspectives, issues and strategies “’New Royal
book Company.
2. Sahni, Pardeep Et.Al. (Eds.),” Disaster Mitigation Experiences And Reflections”, Prentice Hall Of
India, New Delhi.
3. Goel S. L. , Disaster Administration And Management Text And Case Studies” ,Deep &Deep
Publication Pvt. Ltd., New Delhi.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

AUDIT 1 / 2: SANSKRIT FOR TECHNICAL KNOWLEDGE

Course Objectives
1. To get a working knowledge in illustrious Sanskrit, the scientific language in the world
2. Learning of Sanskrit to improve brain functioning
3. Learning of Sanskrit to develop the logic in mathematics, science & other subjects enhancing
the memory power
4. The engineering scholars equipped with Sanskrit will be able to explore the huge knowledge
from ancient literature

Course Outcomes:
Students will be able to
1. Understanding basic Sanskrit language
2. Ancient Sanskrit literature about science & technology can be understood
3. Being a logical language will help to develop logic in students

Syllabus

Unit Content Hours

1 Alphabets in Sanskrit, 4
Past/Present/Future Tense,
Simple Sentences
2 Order 4
Introduction of roots
Technical information about Sanskrit Literature
3 Technical concepts of Engineering-Electrical, 4

4 Technical concepts of Engineering - Mechanical. 4

5 Technical concepts of Engineering - Architecture. 8

Technical concepts of Engineering – Mathematics.

Suggested reading
2. “Abhyaspustakam” – Dr.Vishwas, Samskrita-Bharti Publication, New Delhi
3. “Teach Yourself Sanskrit” Prathama Deeksha-Vempati Kutumbshastri, Rashtriya Sanskrit Sansthanam,
New Delhi Publication
4. “India’s Glorious Scientific Tradition” Suresh Soni, Ocean books (P) Ltd., New Delhi.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

AUDIT 1 / 2: VALUE EDUCATION

Course Objectives
Students will be able to
1. Understand value of education and self- development
2. Imbibe good values in students
3. Let the should know about the importance of character

Course Outcomes:
Students will be able to
1.have Knowledge of self-development
2.Learn the importance of Human values 3.Developing the overall personality

Syllabus

Unit Content Hours

1 Values and self-development –Social values and individual attitudes. Work ethics, 4
Indian vision of humanism. Moral and non- moral valuation. Standards and
principles. Value judgements
2 Importance of cultivation of values. 4
Sense of duty. Devotion, Self-reliance. Confidence, Concentration. Truthfulness,
Cleanliness. Honesty, Humanity. Power of faith, National Unity, Patriotism. Love
for nature ,Discipline
3 Personality and Behavior Development - Soul and Scientific attitude. Positive 4
Thinking. Integrity and discipline. Punctuality, Love and Kindness.
Avoid fault Thinking.
4 Free from anger, Dignity of labour. Universal brotherhood and religious tolerance. 4
True friendship. Happiness Vs suffering, love for truth. Aware of self-destructive
habits. Association and Cooperation. Doing best for saving nature
5 Character and Competence –Holy books vs Blind faith. Self-management and Good 8
health. Science of reincarnation. Equality, Nonviolence , Humility, Role of Women.

All religions and same message. Mind your Mind, Self-control. Honesty, Studying
effectively

Suggested reading
1 Chakroborty, S.K. “Values and Ethics for organizations Theory and practice”, Oxford University Press,
New Delhi
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

AUDIT 1 / 2: CONSTITUTION OF INDIA

Course Objectives:
Students will be able to:
1. Understand the premises informing the twin themes of liberty and freedom from a civil rights
perspective.
2. To address the growth of Indian opinion regarding modern Indian intellectuals’ constitutional
role and entitlement to civil and economic rights as well as the emergence of nationhood in the
early years of Indian nationalism.
3. To address the role of socialism in India after the commencement of the Bolshevik Revolution
in 1917 and its impact on the initial drafting of the Indian Constitution.

Course Outcomes:
Students will be able to:
1. Discuss the growth of the demand for civil rights in India for the bulk of Indians before the
arrival of Gandhi in Indian politics.
2. Discuss the intellectual origins of the framework of argument that
informed the conceptualization of social reforms leading to revolution in India.
3. Discuss the circumstances surrounding the foundation of the Congress Socialist Party [CSP]
under the leadership of Jawaharlal Nehru and the eventual failure of the proposal of direct
elections through adult suffrage in the Indian Constitution.
4. Discuss the passage of the Hindu Code Bill of 1956.

Syllabus

Units Content Hours

History of Making of the Indian Constitution:
1 History 4
Drafting Committee, ( Composition & Working)
Philosophy of the Indian Constitution:
2 Preamble Salient Features 4
Contours of Constitutional Rights & Duties:
Fundamental Rights
Right to Equality
Right to Freedom
3 Right against Exploitation 4
Right to Freedom of Religion
Cultural and Educational Rights
Right to Constitutional Remedies
Directive Principles of State Policy
Fundamental Duties.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

Organs of Governance:
Parliament
Composition
Qualifications and Disqualifications
Powers and Functions
4 Executive 4
President
Governor
Council of Ministers
Judiciary, Appointment and Transfer of Judges, Qualifications
Powers and Functions
Local Administration:
District’s Administration head: Role and Importance,
5 Municipalities: Introduction, Mayor and role of Elected Representative, CE of
Municipal Corporation. 8
Pachayati raj: Introduction, PRI: ZilaPachayat.
Elected officials and their roles, CEO ZilaPachayat: Position and role.
Block level: Organizational Hierarchy (Different departments),
Village level: Role of Elected and Appointed officials,
Importance of grass root democracy

Election Commission:
Election Commission: Role and Functioning.
Chief Election Commissioner and Election Commissioners.
State Election Commission: Role and Functioning.
Institute and Bodies for the welfare of SC/ST/OBC and women.

Suggested reading
1. The Constitution of India, 1950 (Bare Act), Government Publication.
2. Dr. S. N. Busi, Dr. B. R. Ambedkar framing of Indian Constitution, 1st Edition, 2015.
3. M. P. Jain, Indian Constitution Law, 7th Edn., Lexis Nexis, 2014.
4. D.D. Basu, Introduction to the Constitution of India, Lexis Nexis, 2015.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

AUDIT 1 / 2: PEDAGOGY STUDIES

Course Objectives:
Students will be able to:
1. Review existing evidence on the review topic to inform programme design and policy
making undertaken by the DfID, other agencies and researchers.
2. Identify critical evidence gaps to guide the development.

Course Outcomes:
Students will be able to understand:
1. What pedagogical practices are being used by teachers in formal and informal classrooms in
developing countries?
2. What is the evidence on the effectiveness of these pedagogical practices, in what conditions,
and with what population of learners?
3. How can teacher education (curriculum and practicum) and the school curriculum and
guidance materials best support effective pedagogy?

Syllabus

Units Content Hours

Introduction and Methodology:
Aims and rationale, Policy background, Conceptual framework and terminology
1 Theories of learning, Curriculum, Teacher education. 4
Conceptual framework, Research questions.
Overview of methodology and Searching.

Thematic overview: Pedagogical practices are being used by teachers in formal

2 and informal classrooms in developing countries. 4
Curriculum, Teacher education.
3 Evidence on the effectiveness of pedagogical practices
Methodology for the in depth stage: quality assessment of included studies.
How can teacher education (curriculum and practicum) and the school curriculum
and guidance materials best support effective pedagogy?
4
Theory of change. Strength and nature of the body of evidence for effective
pedagogical practices. Pedagogic theory and pedagogical approaches.
4 Teachers’ attitudes and beliefs and Pedagogic strategies. 4
Professional development: alignment with classroom practices and follow-up
support, Peer support, Support from the head teacher and the community.
Curriculum and assessment, Barriers to learning: limited resources and large class 8
5 sizes

Research gaps and future directions

Research design
Contexts
Pedagogy
Teacher education
Curriculum and assessment
Dissemination and research impact.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

Suggested reading

1. Ackers J, Hardman F (2001) Classroom interaction in Kenyan primary schools, Compare, 31 (2):
245-261.
2. Agrawal M (2004) Curricular reform in schools: The importance of evaluation, Journal of
Curriculum Studies, 36 (3): 361-379.
3. Akyeampong K (2003) Teacher training in Ghana - does it count? Multi-site teacher education
research project (MUSTER) country report 1. London: DFID.
4. Akyeampong K, Lussier K, Pryor J, Westbrook J (2013) Improving teaching and learning of basic
maths and reading in Africa: Does teacher preparation count? International Journal Educational
Development, 33 (3): 272–282.
5. Alexander RJ (2001) Culture and pedagogy: International comparisons in primary education.
Oxford and Boston: Blackwell.
6. Chavan M (2003) Read India: A mass scale, rapid, ‘learning to read’ campaign.
7. www.pratham.org/images/resource%20working%20paper%202.pdf.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

AUDIT 1 / 2: STRESS MANAGEMENT BY YOGA

Course Objectives
1. To achieve overall health of body and mind
2. To overcome stress

Course Outcomes:
Students will be able to:
1. Develop healthy mind in a healthy body thus improving social health also
2. Improve efficiency

Syllabus
Unit Content Hours
1 Definitions of Eight parts of yog. ( Ashtanga ) 5
2 Yam and Niyam. Do`s and Don’t’s in life. 5
Ahinsa, satya, astheya, bramhacharya and aparigraha
3 Yam and Niyam. Do`s and Don’t’s in life. 5
Shaucha, santosh, tapa, swadhyay, ishwarpranidhan
4 Asan and Pranayam 5
Various yog poses and their benefits for mind & body
5 Regularization of breathing techniques and its effects-Types of pranayam 4

Suggested reading
1. ‘Yogic Asanas for Group Tarining-Part-I” : Janardan Swami YogabhyasiMandal, Nagpur
2. “Rajayoga or conquering the Internal Nature” by Swami Vivekananda, Advaita Ashrama
(Publication Department), Kolkata
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

AUDIT 1 / 2: PERSONALITY DEVELOPMENT THROUGH LIFE ENLIGHTENMENT SKILLS

Course Objectives
1. To learn to achieve the highest goal happily
2. To become a person with stable mind, pleasing personality and determination
3. To awaken wisdom in students

Course Outcomes
Students will be able to
1. Study of Shrimad-Bhagwad-Geeta will help the student in developing his personality and achieve the
highest goal in life
2. The person who has studied Geeta will lead the nation and mankind to peace and prosperity
3. Study of Neetishatakam will help in developing versatile personality of students

Syllabus
Unit Content Hours
1 Neetisatakam-Holistic development of personality 4
Verses- 19,20,21,22 (wisdom)
Verses- 29,31,32 (pride & heroism)
Verses- 26,28,63,65 (virtue)
2 Neetisatakam-Holistic development of personality 8
Verses- 52,53,59 (dont’s)
Verses- 71,73,75,78 (do’s)

Approach to day to day work and duties.

Shrimad Bhagwad Geeta : Chapter 2-Verses 41, 47,48,
3 Chapter 3-Verses 13, 21, 27, 35, Chapter 6-Verses 5,13,17, 23, 35, 4
Chapter 18-Verses 45, 46, 48.

4 Statements of basic knowledge. 4

Shrimad Bhagwad Geeta: Chapter2-Verses 56, 62, 68
Chapter 12 -Verses 13, 14, 15, 16,17, 18
5 4
Personality of Role model. Shrimad Bhagwad Geeta: Chapter2-Verses
17, Chapter 3-Verses 36,37,42,
Chapter 4-Verses 18, 38,39
Chapter18 – Verses 37,38,63

Suggested reading
1. “Srimad Bhagavad Gita” by Swami Swarupananda Advaita Ashram (Publication Department), Kolkata
2. Bhartrihari’s Three Satakam (Niti-sringar-vairagya) by P.Gopinath, Rashtriya Sanskrit Sansthanam,
New Delhi.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

OPTIMIZATION TECHNIQUES L T P C
II Year - I Semester
3 0 0 3

UNIT - I
CLASSICAL OPTIMIZATION TECHNIQUES: Single variable optimization with and without
constraints, multi – variable optimization without constraints, multi – variable optimization with constraints –
method of Lagrange multipliers, Kuhn-Tucker conditions, merits and demerits of classical optimization
techniques.
UNIT - II
NUMERICAL METHODS FOR OPTIMIZATION: Nelder Mead’s Simplex search method, Gradient of a
function, Steepest descent method, Newton’s method, Pattern search methods, conjugate method, types of
penalty methods for handling constraints, advantages of numerical methods.
UNIT - III
GENETIC ALGORITHM (GA) :Differences and similarities between conventional and evolutionary
algorithms, working principle, reproduction, crossover, mutation, termination criteria, different reproduction
and crossover operators, GA for constrained optimization, draw backs of GA,
GENETIC PROGRAMMING (GP): Principles of genetic programming, terminal sets, functional sets,
differences between GA & GP, random population generation, solving differential equations using GP.
MULTI-OBJECTIVE GA: Pareto’s analysis, Non-dominated front, multi – objective GA, Non-dominated
sorted GA, convergence criterion, applications of multi-objective problems .
UNIT – IV
APPLICATIONS OF OPTIMIZATION IN DESIGN AND MANUFACTURING SYSTEMS: Some
typical applications like optimization of path synthesis of a four-bar mechanism, minimization of weight of a
cantilever beam, optimization of springs and gears, general optimization model of a machining process,
optimization of arc welding parameters, and general procedure in optimizing machining operations sequence.
UNIT V
RELIABILITY: Concepts of Engineering Statistics, risk and reliability, probabilistic approach to design,
reliability theory, design for reliability, numerical problems, hazard analysis.
TEXT BOOKS:
1. Optimization for Engineering Design – Kalyanmoy Deb, PHI Publishers
2. Engineering Optimization – S.S.Rao, New Age Publishers
3. Reliability Engineering by L.S.Srinath
4. Multi objective genetic algorithm by Kalyanmoy Deb, PHI Publishers.

REFERENCES:
1. Genetic algorithms in Search, Optimization, and Machine learning – D.E.Goldberg, Addison-Wesley
Publishers
2. Multi objective Genetic algorithms - Kalyanmoy Deb, PHI Publishers
3. Optimal design – JasbirArora, McGraw Hill (International) Publishers
4. An Introduction to Reliability and Maintainability Engineering by CE Ebeling, Waveland Printers Inc.,
2009
5. Reliability Theory and Practice by I Bazovsky, Dover Publications
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

MODELING AND SIMULATION L T P C

II Year - I Semester TECHNIQUES
3 0 0 3

Unit 1
Introduction Circuits as dynamic systems, Transfer functions, poles and zeroes, State space, Deterministic
Systems, Difference and Differential Equations, Solution of Linear Difference and Differential Equations,
Numerical Simulation Methods for ODEs, System Identification, Stability and Sensitivity Analysis.
Unit 2
Statistical methods, Description of data, Data-fitting methods, Regression analysis, Least Squares Method,
Analysis of Variance, Goodness of fit.
Unit 3
Probability and Random Processes, Discrete and Continuous Distribution, Central Limit theorem, Measure of
Randomness, Monte Carlo Methods. Stochastic Processes and Markov Chains, Time Series Models.
Unit 4
Modeling and simulation concepts, Discrete-event simulation, Event scheduling/Time advance algorithms,
Verification and validation of simulation models.
Unit 5
Continuous simulation: Modeling with differential equations, Example models, Bond Graph Modeling,
Population Dynamics Modeling, System dynamics
TEXTBOOKS
1. R. L. Woods and K. L. Lawrence, “Modeling and Simulation of Dynamic Systems”, Prentice-Hall,1997.

REFERENCES
1. Z. Navalih, “VHDL Analysis and Modelling of Digital Systems”, McGraw-Hill,1993.
2. J. Banks, JS. Carson and B. Nelson, “Discrete-Event System Simulation”, 2ndEdition, Prentice-Hall of
India,1996

Course Outcomes:
At the end of this course, students will be able to
1. Identify and model discrete systems (deterministic and random)
2. Identify and model discrete signals (deterministic and random)
3. Understand modelling and simulation techniques to characterize systems/
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

BIO INFORMATICS L T P C
II Year - I Semester
3 0 0 3

Course Objectives:
• To understand Bio informatics from computing perspective.
• To comprehend bio informatics databases, file formats and its applications.
• To understand the applications of Bio informatics

UNIT I:History of bioinformatics-History of Bioinformatics-role of Bioinformatics in biological sciences-

scope of bioinformatics -introduction to internet-WWW- network basics- LAN & WAN standards-network
topologies and protocols- FTP- HTTP - division of Bioinformatics- Bioinformatics and internet-challenges in
Bioinformatics.
UNIT II:Databases in bioinformatics-Databases in Bioinformatics- Genbank- NCBI- EMBL- DDBJ -
UniGene- SGD- EMI Genomes- -protein databases-PIR- SWISSPROT-TrEMBL-Prosite- PRINTS -structural
databases-PDB- SCOP- CATH- PDB_SELECT- PDBSUM- DSSP- FSSPDALI- PRODOM- protein families
& pattern databases-Pfam- KEGG - sequence storage sequence accuracy-EST-STS- sequence retrieval
systems- Entrez-SRS- sequence query refinement using Boolean operators- limits- preview- history and index.
UNIT III:Sequence submission-Sequence submission tools-BANKIT-SEQUIN-WEBIN-SAKURAliterature
databases-PubMed and medline. Data mining and its techniques- data warehousing- Sequence annotation-
principles of genome annotation- annotation tools & resources.
UNIT IV:Applications of bioinformatics-Applications of Bioinformatics-phylogenetic analysissteps in
phylogenetic analysis-microarrays-DNA and protein microarrays- Bioinformatics in pharmaceutical industry-
informatics & drug- discovery – pharma informatics resources drug discovery and designing-SNP.
UNIT V:File formats-File formats-raw/plain format-NCBI-Genbank flat file format-ASN.1- GCGFASTA-
EMBL- NBRF- PIR-swissprot sequence formats- PDB format-Introduction to structure prediction methods.

References:
1. Attwood T.K, Parry-Smith, “Introduction to Bioinformatics”, Addison WesleyLongman, 1999.
2. David W Mount, “Bioinformatics: Sequence and Genome Analysis”, 2 ndedition, CBS Publishers, 2004.
3. ArunJagota, “Data Analysis and Classification for Bioinformatics”, PinePress, 2001.
4. Des Higgins and Willie Taylor, “Bioinformatics Sequence, Structures andDatabanks”, Oxford University
Press, 2000.
5. Jason T.L.Wang, Mohammed J. Zaki, Hannu T.T. Toivonene and DennisShasha, “Data Mining in
Bioinformatics”, Springer International Edition, 2005.
6. K. Erciyes, “Distributed and Sequential Algorithms for Bioinformatics”, Springer, 2015.
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA-533 003, ANDHRA PRADESH, INDIA

OPERATIONS RESEARCH L T P C
II Year - I Semester
3 0 0 3
Unit 1:
Optimization Techniques, Model Formulation, models, General L.R Formulation, Simplex Techniques,
Sensitivity Analysis, Inventory Control Models
Unit 2
Formulation of a LPP - Graphical solution revised simplex method - duality theory - dual simplex method -
sensitivity analysis - parametric programming
Unit 3:
Nonlinear programming problem - Kuhn-Tucker conditions min cost flow problem - max flow problem -
CPM/PERT
Unit 4
Scheduling and sequencing - single server and multiple server models - deterministic inventory models -
Probabilistic inventory control models - Geometric Programming.
Unit 5
Competitive Models, Single and Multi-channel Problems, Sequencing Models, Dynamic Programming, Flow
in Networks, Elementary Graph Theory, Game Theory Simulation
References:
1. H.A. Taha, Operations Research, An Introduction, PHI, 2008
2. H.M. Wagner, Principles of Operations Research, PHI, Delhi, 1982.
3. J.C. Pant, Introduction to Optimisation: Operations Research, Jain Brothers, Delhi, 2008
4. Hitler Libermann Operations Research: McGraw Hill Pub. 2009
5. Pannerselvam, Operations Research: Prentice Hall of India 2010
6. Harvey M Wagner, Principles of Operations Research: Prentice Hall of India 2010

Course Outcomes:
At the end of the course, the student should be able to
1. Students should able to apply the dynamic programming to solve problems of discreet and continuous
variables.
2. Students should able to apply the concept of non-linear programming
3. Students should able to carry out sensitivity analysis
4. Student should able to model the real world problem and simulate it.