R-20 Syllabus for CSE-AI&ML, JNTUK w. e. f.

2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF CSE - ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

COURSE STRUCTURE AND SYLLABUS

For UG – R20

B. Tech - COMPUTER SCIENCE AND ENGINEERING with Specialization

Common to
(i) CSE (ARTIFICIAL INTELLIGENCE and MACHINE LEARNING)-Branch Code:42
(ii) ARTIFICIAL INTELLIGENCE and MACHINE LEARNING - Branch Code: 61
(Applicable for batches admitted from 2020-2021)

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA - 533 003, Andhra Pradesh, India
 R-20 Syllabus for CSE-AI&ML, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF CSE - ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

II Year – I SEMESTER

Course
S. No Courses L T P Credits
Code
1 BS Mathematics III 3 0 0 3
2 CS Mathematical Foundations of Computer Science 3 0 0 3
Introduction to Artificial Intelligence and Machine
3 CS 3 0 0 3
Learning
4 CS Object Oriented Programming with Java 3 0 0 3
5 CS Database Management Systems 3 0 0 3
Introduction to Artificial Intelligence and Machine
6 CS 0 0 3 1.5
Learning Lab
7 CS Object Oriented Programming with Java Lab 0 0 3 1.5
8 CS Database Management Systems Lab 0 0 3 1.5
9 SO Mobile App Development 0 0 4 2
10 MC Essence of Indian Traditional Knowledge 2 0 0 0
Total Credits 17 0 13 21.5

II Year – II SEMESTER

Course
S. No Courses L T P Credits
Code
1 BS Probability and Statistics 3 0 0 3
2 CS Computer Organization 3 0 0 3
3 CS Data warehousing and Mining 3 0 0 3
4 ES Formal Languages and Automata Theory 3 0 0 3

5 HS Managerial Economics and Financial Accountancy 3 0 0 3

6 CS R Programming Lab 0 0 3 1.5

7 CS Data Mining using Python Lab 0 0 3 1.5
8 ES Web Application Development Lab 0 0 3 1.5
9 SO Natural Language Processing with Python 0 0 4 2
Total Credits 15 0 13 21.5
 R-20 Syllabus for CSE-AI&ML, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF CSE - ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

L T P C
II Year -I Semester
3 0 0 3
MATHEMATICS - III

Course Objectives:
x To familiarize the techniques in partial differential equations
x To furnish the learners with basic concepts and techniques at plus two level to lead them into advanced level
by handling various real world applications.

Course Outcomes:
At the end of the course, the student will be able to
x Interpret the physical meaning of different operators such as gradient, curl and divergence (L5)
x Estimate the work done against a field, circulation and flux using vector calculus (L5)
x Apply the Laplace transform for solving differential equations (L3)
x Find or compute the Fourier series of periodic signals (L3)
x Know and be able to apply integral expressions for the forwards and inverse Fourier transform to a range of
non-periodic waveforms (L3)
x Identify solution methods for partial differential equations that model physical processes (L3)

UNIT I: Vector calculus: (10 hrs)

Vector Differentiation: Gradient – Directional derivative – Divergence – Curl – Scalar Potential.
Vector Integration: Line integral – Work done – Area – Surface and volume integrals – Vector integral
theorems: Greens, Stokes and Gauss Divergence theorems (without proof).

UNIT II: Laplace Transforms: (10 hrs)

Laplace transforms of standard functions – Shifting theorems – Transforms of derivatives and integrals –
Unit step function – Dirac’s delta function – Inverse Laplace transforms – Convolution theorem (without
proof).
Applications: Solving ordinary differential equations (initial value problems) using Laplace transforms.

UNIT III: Fourier series and Fourier Transforms: (10 hrs)

Fourier Series: Introduction – Periodic functions – Fourier series of periodic function –Dirichlet’s conditions
– Even and odd functions – Change of interval – Half-range sine and cosine series.
Fourier Transforms: Fourier integral theorem (without proof) – Fourier sine and cosine integrals – Sine and
cosine transforms – Properties – inverse transforms – Finite Fourier transforms.

UNIT IV: PDEof first order: (8 hrs)

Formation of partial differential equations by elimination of arbitrary constants and arbitrary functions –
Solutions of first order linear (Lagrange) equation and nonlinear (standard types) equations.

UNIT V: Second order PDE and Applications: (10 hrs)

Second order PDE: Solutions of linear partial differential equations with constant coefficients – RHS term
of the type e axby , sin( ax  by), cos( ax  by), x m y n .
Applications of PDE: Method of separation of Variables – Solution of One dimensional Wave, Heat and
two-dimensional Laplace equation.
 R-20 Syllabus for CSE-AI&ML, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF CSE - ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

Text Books:
1) B. S. Grewal, Higher Engineering Mathematics, 43 rd Edition, Khanna Publishers.
2) B. V. Ramana, Higher Engineering Mathematics, 2007 Edition, Tata Mc. Graw Hill Education.

Reference Books:
1) Erwin Kreyszig, Advanced Engineering Mathematics, 10th Edition, Wiley-India.
2) Dean. G. Duffy, Advanced Engineering Mathematics with MATLAB, 3 rd Edition, CRC Press.
3) Peter O’ Neil, Advanced Engineering Mathematics, Cengage.
4) Srimantha Pal, S C Bhunia, Engineering Mathematics, Oxford University Press.
 R-20 Syllabus for CSE-AI&ML, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF CSE - ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

L T P C
II Year – I Semester
3 0 0 3
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE

Course Objectives:
This course is designed to:
x To introduce the students to the topics and techniques of discrete methods and combinatorial
reasoning
x To introduce a wide variety of applications. The algorithmic approach to the solution of problems is
fundamental in discrete mathematics, and this approach reinforces the close ties between this
discipline and the area of computer science

Course Outcomes:
At the end of the course student will be able to
x Demonstrate skills in solving mathematical problems
x Comprehend mathematical principles and logic
x Demonstrate knowledge of mathematical modeling and proficiency in using mathematical software
x Manipulate and analyze data numerically and/or graphically using appropriate Software
x Communicate effectively mathematical ideas/results verbally or in writing

UNIT I
Mathematical Logic: Propositional Calculus: Statements and Notations, Connectives, Well Formed
Formulas, Truth Tables, Tautologies, Equivalence of Formulas, Duality Law, Tautological Implications,
Normal Forms, Theory of Inference for Statement Calculus, Consistency of Premises, Indirect Method of
Proof, Predicate Calculus:Predicates, Predicative Logic, Statement Functions, Variables and Quantifiers,
Free and Bound Variables, Inference Theory for Predicate Calculus.

UNIT II
Set Theory: Sets: Operations on Sets, Principle of Inclusion-Exclusion, Relations: Properties, Operations,
Partition and Covering, Transitive Closure, Equivalence, Compatibility and Partial Ordering, Hassie
Diagrams, Functions: Bijective, Composition, Inverse, Permutation, and Recursive Functions, Lattice and its
Properties, Algebraic Structures: Algebraic Systems, Properties, Semi Groups and Monoids, Group,
Subgroup and Abelian Group, Homomorphism, Isomorphism.

UNIT III
Combinatorics: Basis of Counting, Permutations, Permutations with Repetitions, Circular and Restricted
Permutations, Combinations, Restricted Combinations, Binomial and Multinomial Coefficients and
Theorems, Number Theory: Properties of Integers, Division Theorem, Greatest Common Divisor, Euclidean
Algorithm, Least Common Multiple, Testing for Prime Numbers, The Fundamental Theorem of Arithmetic,
Modular Arithmetic, Fermat’s and Euler’s Theorems

UNIT IV
Recurrence Relations: Generating Functions, Function of Sequences, Partial Fractions, Calculating
Coefficient of Generating Functions, Recurrence Relations, Formulation as Recurrence Relations, Solving
Recurrence Relations by Substitution and Generating Functions, Method of Characteristic Roots, Solving
Inhomogeneous Recurrence Relations
 R-20 Syllabus for CSE-AI&ML, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF CSE - ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

UNIT V
Graph Theory: Basic Concepts, Graph Theory and its Applications, Sub graphs, Graph Representations:
Adjacency and Incidence Matrices, Isomorphic Graphs, Paths and Circuits, Eulerian and Hamiltonian
Graphs, Multigraphs, Bipartite and Planar Graphs, Euler’s Theorem, Graph Colouring and Covering,
Chromatic Number, Spanning Trees, Prim’s and Kruskal’s Algorithms, BFS and DFS Spanning Trees.

Text Books:
1) Discrete Mathematical Structures with Applications to Computer Science, J. P. Tremblay and P.
Manohar, Tata McGraw Hill.
2) Elements of Discrete Mathematics-A Computer Oriented Approach, C. L. Liu and D. P. Mohapatra,
3rdEdition, Tata McGraw Hill.

Reference Books:
1) Discrete Mathematics for Computer Scientists and Mathematicians, J. L. Mott, A. Kandel and T. P.
Baker, 2nd Edition, Prentice Hall of India.
2) Discrete Mathematical Structures, Bernand Kolman, Robert C. Busby and Sharon Cutler Ross, PHI.
3) Discrete Mathematics and its Applications with Combinatorics and Graph Theory, K. H. Rosen, 7 th
Edition, Tata McGraw Hill.

e-Resources:
1) https://nptel.ac.in/courses/106/106/106106094/
 R-20 Syllabus for CSE-AI&ML, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF CSE - ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

L T P C
II Year – I Semester
3 0 0 3
INTRODUCTION TO ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Objectives:
x To provide a strong foundation of fundamental concepts in Artificial Intelligence.
x To provide a basic exposition to the goals and methods of Artificial Intelligence.
x To provide fundamentals of machine learning

Course Outcomes:
Upon successful completion of the course, the student will be able to:
x Enumerate the history and foundations of Artificial Intelligence
x Apply the basic principles of AI in problem solving
x Choose the appropriate representation of Knowledge
x Enumerate the Perspectives and Issues in Machine Learning
x Identify issues in Decision Tree Learning

UNIT I
Introduction: What Is AI?, The Foundations of Artificial Intelligence, The History of Artificial Intelligence, The
State of the Art, Agents and Environments, Good Behavior: The Concept of Rationality, The Nature of Environments,
The Structure of Agents.

UNIT II
Problem Solving: Problem-Solving Agents, Example Problems, Searching for Solutions, Uninformed Search
Strategies, Informed (Heuristic) Search Strategies, Local Search Algorithms and Optimization Problems, Searching
with Nondeterministic Actions.

UNIT III
Knowledge Representation: Knowledge-Based Agents, Logic, Propositional Logic: A Very Simple Logic,
Ontological Engineering, Categories and Objects, Events, Mental Events and Mental Objects, Reasoning Systems for
Categories, The Internet Shopping World.

UNIT IV
Introduction to Machine Learning: Well-Posed Learning Problem, Designing a Learning system,
Perspectives and Issues in Machine Learning.
Concept Learning and The General-to-Specific Ordering: Introduction, A Concept Learning Task,
Concept Learning as Search, FIND-S: Finding a Maximally Specific Hypothesis, Version Spaces and the
Candidate Elimination Algorithm, Remarks on Version spaces and Candidate-Elimination, Inductive Bias

UNIT V
Decision Tree Learning: Introduction, Decision Tree Representation, Appropriate Problems for Decision
Tree Learning, The Basic Decision Tree Learning Algorithm, Hypothesis Space Search in Decision Tree
Learning, Inductive Bias in Decision Tree Learning, Issues in Decision Tree Learning.
 R-20 Syllabus for CSE-AI&ML, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF CSE - ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

Text Books:
1) Stuart Russell and Peter Norvig, “Artificial Intelligence: A Modern Approach” , 3rd Edition,
Pearson
2) Tom M. Mitchell, Machine Learning, McGraw Hill Edition, 2013

Reference Books:
1) Saroj Kaushik, “Artificial Intelligence”, Cengage Learning India, 2011
2) Elaine Rich and Kevin Knight, “Artificial Intelligence”, Tata McGraw Hill
3) David Poole and Alan Mackworth, “Artificial Intelligence: Foundations for Computational
Agents”, Cambridge University Press 2010.
4) Trivedi, M.C., “A Classical Approach to Artifical Intelligence”, Khanna Publishing House, Delhi.
5) Christopher Bishop, Pattern Recognition and Machine Learning (PRML) , Springer, 2007.
6) ShaiShalev-Shwartz and Shai Ben-David, Understanding Machine Learning: From Theory to
Algorithms (UML) , Cambridge University Press, 2014.

Web Resources:
1) https://nptel.ac.in/courses/106105077
2) https://nptel.ac.in/courses/106106126
3) https://aima.cs.berkeley.edu
4) https://ai.berkeley,edu/project_overview.html
5) http://www.zuj.edu.jo/download/machine-learning-tom-mitchell-pdf/
6) http://www.ntu.edu.sg/home/egbhuang/pdf/ieee-is-elm.pdf
7) https://swayam.gov.in/nd1_noc20_cs73/preview
 R-20 Syllabus for CSE-AI&ML, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF CSE - ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

L T P C
II Year – I Semester
3 0 0 3
OBJECT ORIENTED PROGRAMMING WITH JAVA

Course Objectives:
The learning objectives of this course are:
x To identify Java language components and how they work together in applications
x To learn the fundamentals of object-oriented programming in Java, including defining classes,
invoking methods, using class libraries.
x To learn how to extend Java classes with inheritance and dynamic binding and how to use exception
handling in Java applications
x To understand how to design applications with threads in Java
x To understand how to use Java APIs for program development

Course Outcomes:
By the end of the course, the student will be
x Able to realize the concept of Object Oriented Programming & Java Programming Constructs
x Able to describe the basic concepts of Java such as operators, classes, objects, inheritance, packages,
Enumeration and various keywords
x Apply the concept of exception handling and Input/ Output operations
x Able to design the applications of Java & Java applet
x Able to Analyze & Design the concept of Event Handling and Abstract Window Toolkit

UNIT I
Program Structure in Java: Introduction, Writing Simple Java Programs, Elements or Tokens in Java
Programs, Java Statements, Command Line Arguments, User Input to Programs, Escape Sequences
Comments, Programming Style.
Data Types, Variables, and Operators :Introduction, Data Types in Java, Declaration of Variables, Data
Types, Type Casting, Scope of Variable Identifier, Literal Constants, Symbolic Constants, Formatted Output
with printf() Method, Static Variables and Methods, Attribute Final, Introduction to Operators, Precedence
and Associativity of Operators, Assignment Operator ( = ), Basic Arithmetic Operators, Increment (++) and
Decrement (- -) Operators, Ternary Operator, Relational Operators, Boolean Logical Operators, Bitwise
Logical Operators.
Control Statements:Introduction, if Expression, Nested if Expressions, if–else Expressions, Ternary
Operator?:, Switch Statement, Iteration Statements, while Expression, do–while Loop, for Loop, Nested for
Loop, For–Each for Loop, Break Statement, Continue Statement.

UNIT II
Classes and Objects: Introduction, Class Declaration and Modifiers, Class Members, Declaration of Class
Objects, Assigning One Object to Another, Access Control for Class Members, Accessing Private Members
of Class, Constructor Methods for Class, Overloaded Constructor Methods, Nested Classes, Final Class and
Methods, Passing Arguments by Value and by Reference, Keyword this.
Methods: Introduction, Defining Methods, Overloaded Methods, Overloaded Constructor Methods, Class
Objects as Parameters in Methods, Access Control, Recursive Methods, Nesting of Methods, Overriding
Methods, Attributes Final and Static.
 R-20 Syllabus for CSE-AI&ML, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF CSE - ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

UNIT III
Arrays: Introduction, Declaration and Initialization of Arrays, Storage of Array in Computer Memory,
Accessing Elements of Arrays, Operations on Array Elements, Assigning Array to Another Array, Dynamic
Change of Array Size, Sorting of Arrays, Search for Values in Arrays, Class Arrays, Two-dimensional
Arrays, Arrays of Varying Lengths, Three-dimensional Arrays, Arrays as Vectors.
Inheritance: Introduction, Process of Inheritance, Types of Inheritances, Universal Super Class-Object
Class, Inhibiting Inheritance of Class Using Final, Access Control and Inheritance, Multilevel Inheritance,
Application of Keyword Super, Constructor Method and Inheritance, Method Overriding, Dynamic Method
Dispatch, Abstract Classes, Interfaces and Inheritance.
Interfaces: Introduction, Declaration of Interface, Implementation of Interface, Multiple Interfaces, Nested
Interfaces, Inheritance of Interfaces, Default Methods in Interfaces, Static Methods in Interface, Functional
Interfaces, Annotations.

UNIT IV
Packages and Java Library: Introduction, Defining Package, Importing Packages and Classes into Programs,
Path and Class Path, Access Control, Packages in Java SE, Java.lang Package and its Classes, Class Object,
Enumeration, class Math, Wrapper Classes, Auto-boxing and Auto-unboxing, Java util Classes and
Interfaces, Formatter Class, Random Class, Time Package, Class Instant (java.time.Instant), Formatting for
Date/Time in Java, Temporal Adjusters Class, Temporal Adjusters Class.
Exception Handling: Introduction, Hierarchy of Standard Exception Classes, Keywords throws and throw,
try, catch, and finally Blocks, Multiple Catch Clauses, Class Throwable, Unchecked Exceptions, Checked
Exceptions, try-with-resources, Catching Subclass Exception, Custom Exceptions, Nested try and catch
Blocks, Rethrowing Exception, Throws Clause.

UNIT V
String Handling in Java: Introduction, Interface Char Sequence, Class String, Methods for Extracting
Characters from Strings, Methods for Comparison of Strings, Methods for Modifying Strings, Methods for
Searching Strings, Data Conversion and Miscellaneous Methods, Class String Buffer, Class String Builder.
Multithreaded Programming: Introduction, Need for Multiple Threads Multithreaded Programming for
Multi-core Processor, Thread Class, Main Thread- Creation of New Threads, Thread States, Thread
Priority-Synchronization, Deadlock and Race Situations, Inter-thread Communication - Suspending,
Resuming, and Stopping of Threads.
Java Database Connectivity: Introduction, JDBC Architecture, Installing MySQL and MySQL Connector/J,
JDBC Environment Setup, Establishing JDBC Database Connections, ResultSet Interface, Creating JDBC
Application, JDBC Batch Processing, JDBC Transaction Management

Text Books:
1) JAVA one step ahead, Anitha Seth, B.L.Juneja, Oxford.
2) The complete Reference Java, 8th edition, Herbert Schildt, TMH.

References Books:
1) Introduction to java programming, 7th edition by Y Daniel Liang, Pearson
2) Murach's Java Programming, Joel Murach

e-Resources:
1) https://nptel.ac.in/courses/106/105/106105191/
2) https://www.w3schools.com/java/java_data_types.asp
 R-20 Syllabus for CSE-AI&ML, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF CSE - ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

L T P C
II Year – I Semester
3 0 0 3
DATABASE MANAGEMENT SYSTEMS

Course Objectives:
x To introduce about database management systems
x To give a good formal foundation on the relational model of data and usage of Relational Algebra
x To introduce the concepts of basic SQL as a universal Database language
x To demonstrate the principles behind systematic database design approaches by covering conceptual
design, logical design through normalization
x To provide an overview of physical design of a database system, by discussing Database indexing
techniques and storage techniques

Course Outcomes:
By the end of the course, the student will be able to
x Describe a relational database and object-oriented database
x Create, maintain and manipulate a relational database using SQL
x Describe ER model and normalization for database design
x Examine issues in data storage and query processing and can formulate appropriate solutions
x Outline the role and issues in management of data such as efficiency, privacy, security, ethical
responsibility, and strategic advantage

UNIT I
Introduction: Database system, Characteristics (Database Vs File System), Database Users(Actors on Scene,
Workers behind the scene), Advantages of Database systems, Database applications. Brief introduction of
different Data Models; Concepts of Schema, Instance and data independence; Three tier schema
architecture for data independence; Database system structure, environment, Centralized and Client Server
architecture for the database.

UNIT II
Relational Model: Introduction to relational model, concepts of domain, attribute, tuple, relation, importance
of null values, constraints (Domain, Key constraints, integrity constraints) and their importance BASIC
SQL: Simple Database schema, data types, table definitions (create, alter), different DML operations (insert,
delete, update), basic SQL querying (select and project) using where clause, arithmetic & logical operations,
SQL functions (Date and Time, Numeric, String conversion).

UNIT III
Entity Relationship Model: Introduction, Representation of entities, attributes, entity set, relationship,
relationship set, constraints, sub classes, super class, inheritance, specialization, generalization using ER
Diagrams. SQL: Creating tables with relationship, implementation of key and integrity constraints, nested
queries, sub queries, grouping, aggregation, ordering, implementation of different types of joins,
view(updatable and non-updatable), relational set operations.
 R-20 Syllabus for CSE-AI&ML, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF CSE - ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

UNIT IV
Schema Refinement (Normalization):Purpose of Normalization or schema refinement, concept of functional
dependency, normal forms based on functional dependency(1NF, 2NF and 3 NF), concept of surrogate key,
Boyce-codd normal form(BCNF), Lossless join and dependency preserving decomposition, Fourth normal
form(4NF), Fifth Normal Form (5NF).

UNIT V
Transaction Concept: Transaction State, Implementation of Atomicity and Durability, Concurrent
Executions, Serializability, Recoverability, Implementation of Isolation, Testing for Serializability, Failure
Classification, Storage, Recovery and Atomicity, Recovery algorithm.
Indexing Techniques: B+ Trees: Search, Insert, Delete algorithms, File Organization and Indexing, Cluster
Indexes, Primary and Secondary Indexes , Index data Structures, Hash Based Indexing: Tree base Indexing
,Comparison of File Organizations, Indexes and Performance Tuning

Text Books:
1) Database Management Systems, 3/e, Raghurama Krishnan, Johannes Gehrke, TMH
2) Database System Concepts,5/e, Silberschatz, Korth, TMH

Reference Books:
1) Introduction to Database Systems, 8/e C J Date, PEA.
2) Database Management System, 6/e Ramez Elmasri, Shamkant B. Navathe, PEA
3) Database Principles Fundamentals of Design Implementation and Management, Corlos Coronel,
Steven Morris, Peter Robb, Cengage Learning.

e-Resources:
1) https://nptel.ac.in/courses/106/105/106105175/
2) https://www.geeksforgeeks.org/introduction-to-nosql/
 R-20 Syllabus for CSE-AI&ML, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF CSE - ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

L T P C
II Year – I Semester
0 0 3 1.5
INTRODUCTION TO ARTIFICIAL INTELLIGENCE AND
MACHINE LEARNING LAB

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 (Artificial Intelligence)

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

List of Experiments (Machine Learning)

Python Libraries required: Sklearn
Note: Standard datasets can be downloaded from UCI Machine Learning Repository
(https://archive.ics.uci.edu/ml/datasets.php)
1. Implement and demonstrate 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.
2. 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.
3. Write a program to demonstrate the working of the decision tree classifier. Use appropriate dataset
for building the decision tree and apply this knowledge to classify a new sample.
4. Write a program to demonstrate the working of Decision tree regressor. Use appropriate dataset for
decision tree regressor.
5. Write a program to demonstrate the working of Random Forest classifier. Use appropriate dataset for
Random Forest Classifier.
6. Write a program to demonstrate the working of Logistic Regression classifier. Use appropriate
dataset for Logistic Regression.
 R-20 Syllabus for CSE-AI&ML, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF CSE - ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

L T P C
II Year – I Semester
0 0 3 1.5
OBJECT ORIENTED PROGRAMMING WITH JAVA LAB

Course Objectives:
The aim of this lab is to
x Practice programming in the Java
x Gain knowledge of object-oriented paradigm in the Java programming language
x Learn use of Java in a variety of technologies and on different platforms

Course Outcomes:
By the end of the course student will be able to write java program for
x Evaluate default value of all primitive data type, Operations, Expressions, Control-flow, Strings
x Determine Class, Objects, Methods, Inheritance, Exception, Runtime Polymorphism, User defined
Exception handling mechanism
x Illustrating simple inheritance, multi-level inheritance, Exception handling mechanism
x Construct Threads, Event Handling, implement packages, developing applets

Exercise - 1 (Basics)
a) Write a JAVA program to display default value of all primitive data type of JAVA
b) Write a java program that display the roots of a quadratic equation ax2+bx=0. Calculate the discriminate
D and basing on value of D, describe the nature of root.
c) Five Bikers Compete in a race such that they drive at a constant speed which may or may not be the same
as the other. To qualify the race, the speed of a racer must be more than the average speed of all 5 racers.
Take as input the speed of each racer and print back the speed of qualifying racers.

Exercise - 2 (Operations, Expressions, Control-flow, Strings)

a) Write a JAVA program to search for an element in a given list of elements using binary search
mechanism.
b) Write a JAVA program to sort for an element in a given list of elements using bubble sort
c) Write a JAVA program to sort for an element in a given list of elements using merge sort.
d) Write a JAVA program using StringBuffer to delete, remove character.

Exercise - 3 (Class, Objects)

a) Write a JAVA program to implement class mechanism. Create a class, methods and invoke them inside
main method.
b) Write a JAVA program to implement constructor.

Exercise - 4 (Methods)
a) Write a JAVA program to implement constructor overloading.
b) Write a JAVA program implement method overloading.

Exercise - 5 (Inheritance)
a) Write a JAVA program to implement Single Inheritance
b) Write a JAVA program to implement multi level Inheritance
c) Write a java program for abstract class to find areas of different shapes

Exercise - 6 (Inheritance - Continued)

a) Write a JAVA program give example for “super” keyword.
 R-20 Syllabus for CSE-AI&ML, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF CSE - ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

b) Write a JAVA program to implement Interface. What kind of Inheritance can be achieved?

Exercise - 7 (Exception)
a) Write a JAVA program that describes exception handling mechanism
b) Write a JAVA program Illustrating Multiple catch clauses

Exercise – 8 (Runtime Polymorphism)

a) Write a JAVA program that implements Runtime polymorphism
b) Write a Case study on run time polymorphism, inheritance that implements in above problem

Exercise – 9 (User defined Exception)

a) Write a JAVA program for creation of Illustrating throw
b) Write a JAVA program for creation of Illustrating finally
c) Write a JAVA program for creation of Java Built-in Exceptions
d) d)Write a JAVA program for creation of User Defined Exception

Exercise – 10 (Threads)
a) Write a JAVA program that creates threads by extending Thread class .First thread display “Good
Morning “every 1 sec, the second thread displays “Hello “every 2 seconds and the third display “Welcome”
every 3 seconds ,(Repeat the same by implementing Runnable)
b) Write a program illustrating isAlive and join ()
c) Write a Program illustrating Daemon Threads.

Exercise - 11 (Threads continuity)

a) Write a JAVA program Producer Consumer Problem
b) Write a case study on thread Synchronization after solving the above producer consumer problem

Exercise – 12 (Packages)
a) Write a JAVA program illustrate class path
b) Write a case study on including in class path in your os environment of your package.
c) Write a JAVA program that import and use the defined your package in the previous Problem

Exercise - 13 (Applet)
a) Write a JAVA program to paint like paint brush in applet.
b) Write a JAVA program to display analog clock using Applet.
c) Write a JAVA program to create different shapes and fill colors using Applet.

Exercise - 14 (Event Handling)

a) Write a JAVA program that display the x and y position of the cursor movement using Mouse.
b) Write a JAVA program that identifies key-up key-down event user entering text in a Applet.
 R-20 Syllabus for CSE-AI&ML, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF CSE - ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

L T P C
II Year – I Semester
0 0 3 1.5
DATABASE MANAGEMENT SYSTEMS LAB

Course Objectives:
This Course will enable students to
x Populate and query a database using SQL DDL/DML Commands
x Declare and enforce integrity constraints on a database
x Writing Queries using advanced concepts of SQL
x Programming PL/SQL including procedures, functions, cursors and triggers

Course Outcomes:
At the end of the course the student will be able to:
x Utilize SQL to execute queries for creating database and performing data manipulation operations
x Examine integrity constraints to build efficient databases
x Apply Queries using Advanced Concepts of SQL
x Build PL/SQL programs including stored procedures, functions, cursors and triggers

List of Exercises:
1. Creation, altering and droping of tables and inserting rows into a table (use constraints while creating
tables) examples using SELECT command.
2. Queries (along with sub Queries) using ANY, ALL, IN, EXISTS, NOTEXISTS,
UNION, INTERSET, Constraints. Example:- Select the roll number and name of the student who
secured fourth rank in the class.
3. Queries using Aggregate functions (COUNT, SUM, AVG, MAX and MIN), GROUP BY, HAVING
and Creation and dropping of Views.
4. Queries using Conversion functions (to_char, to_number and to_date), string
functions (Concatenation, lpad, rpad, ltrim, rtrim, lower, upper, initcap, length, substr and instr),
date functions (Sysdate, next_day, add_months, last_day, months_between, least, greatest,
trunc, round, to_char, to_date)
5.
i. Create a simple PL/SQL program which includes declaration section, executable section and
exception –Handling section (Ex. Student marks can be selected from the table and printed
for those who secured first class and an exception can be raised if no records were found)
ii. Insert data into student table and use COMMIT, ROLLBACK and SAVEPOINT in
PL/SQL block.
6. Develop a program that includes the features NESTED IF, CASE and CASE expression.
The program can be extended using the NULLIF and COALESCE functions.
7. Program development using WHILE LOOPS, numeric FOR LOOPS, nested loops using ERROR
Handling, BUILT –IN Exceptions, USE defined Exceptions, RAISE- APPLICATION ERROR.
8. Programs development using creation of procedures, passing parameters IN and OUT
of PROCEDURES.
9. Program development using creation of stored functions, invoke functions in SQL Statements and
write complex functions.
 R-20 Syllabus for CSE-AI&ML, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF CSE - ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

10. Develop programs using features parameters in a CURSOR, FOR UPDATE CURSOR, WHERE
CURRENT of clause and CURSOR variables.
11. Develop Programs using BEFORE and AFTER Triggers, Row and Statement Triggers
and INSTEAD OF Triggers
12. Create a table and perform the search operation on table using indexing and non-indexing
techniques.

Text Books/Suggested Reading:

1) Oracle: The Complete Reference by Oracle Press
2) Nilesh Shah, "Database Systems Using Oracle”, PHI, 2007
3) Rick F Vander Lans, “Introduction to SQL”, Fourth Edition, Pearson Education, 2007
 R-20 Syllabus for CSE-AI&ML, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF CSE - ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

L T P C
II Year - I Semester Skill Oriented Course- I
0 0 4 2
MOBILE APP DEVELOPMENT

Course Objectives:
x To understand the components and structure of mobile application development frameworks for
Android and windows OS based mobiles.
x To understand how to work with various mobile application development frameworks.
x To learn the basic and important design concepts and issues of development of mobile applications.
x To understand the capabilities and limitations of mobile devices.

Course Outcomes:
At the end of this course, students will be able to:
1. Identify various concepts of mobile programming that make it unique from programming for other platforms
2. Critique mobile applications on their design pros and cons
3. Utilize rapid prototyping techniques to design and develop sophisticated mobile interfaces,
4. Program mobile applications for the Android operating system that use basic and advanced phone features and
5. Deploy applications to the Android marketplace for distribution.

LIST OF EXPERIMENTS
1. Introduction to mobile technologies and devices , Android platform and applications overview
2. Setting Android development environments
3. Writing Android applications, Understanding anatomy of an Android application
4. Develop an application that uses GUI components, Font and Colours
5. Develop an application that uses Layout Managers and event listeners.
6. Write an application that draws basic graphical primitives on the screen.
7. Develop an application that makes use of databases.
8. Develop an application that makes use of Notification Manager
9. Implement an application that uses Multi-threading
10. Develop a native application that uses GPS location information
11. Implement an application that writes data to the SD card.
12. Implement an application that creates an alert upon receiving a message
13. Write a mobile application that makes use of RSS feed
14. Develop a mobile application to send an email.
15. Develop a Mobile application for simple needs (Mini Project)

References:
1. Android Programming unleashed , B.M. Harwani, Pearson, 2013.
2. Android Programming (Big Nerd Ranch Guide), by Bill Phillips, Chris Stewart, Brian Hardy,
Kristin Marsicano, Pearson, 2016
3. Android Programming – Pushing the limits by Hellman by Erik Hellman, WILEY, 2013
 R-20 Syllabus for CSE-AI&ML, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF CSE - ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

Web References:
1. The Complete Android N Developer Course –Udemy
https://www.udemy.com/course/complete-android-n-developer-course/?altsc=428526
2. Android Development Courses on Google developers training
https://developers.google.com/training/android/
3. Mobile Computing - Video course- NPTEL
https://nptel.ac.in/courses/106/106/106106147/#
4. Android Tutorial – Tutorial Point https://www.tutorialspoint.com/android/index.htm
 R-20 Syllabus for CSE-AI&ML, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF CSE - ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

L T P C
II Year - I Semester
2 0 0 0
ESSENCE OF INDIAN TRADITIONAL KNOWLEDGE

Course Objectives:
xThe course aims at imparting basic principles of thought process, reasoning and inferencing. Sustainability is at the
core of Indian Traditional Knowledge Systems connecting society and nature.
x Holistic life style of Yogic-science and wisdom capsules in Sanskrit literature are also important in modern society
with rapid technological advancements and societal disruptions.
x The course focuses on introduction to Indian Knowledge System, Indian perspective of modern scientific world-
view and basic principles of Yoga and holistic health care system
Course Outcomes:
Upon successful completion of the course, the student will be able to:
x Understand the significance of Indian Traditional Knowledge
x Classify the Indian Traditional Knowledge
x Compare Modern Science with Indian Traditional Knowledge system.
x Analyze the role of Government in protecting the Traditional Knowledge
x Understand the impact of Philosophical tradition on Indian Knowledge System.

Unit I
Introduction to Traditional Knowledge: Define Traditional Knowledge- Nature and Characteristics-
Scope and Importance- kinds of Traditional Knowledge- The historical impact of social change on
Traditional Knowledge Systems- Value of Traditional knowledge in global economy.

Unit II
Basic structure of Indian Knowledge System: Astadash Vidya- 4 Ved - 4 Upaved (Ayurved, Dhanurved,
Gandharva Ved & Sthapthya Adi), 6 vedanga (Shisha, Kalppa, Nirukha,Vykaran, Jyothisha & Chand),4
upanga (Dharmashastra, Meemamsa, purana & Tharka Shastra).

Unit III
Modern Science and Indian Knowledge System-Indigenous Knowledge, Characteristics- Yoga and
Holistic Health care-cases studies.

Unit IV
Protection of Traditional Knowledge: The need for protecting traditional knowledge -Significance of
Traditional knowledge Protection-Role of government to harness Traditional Knowledge.

Unit V
Impact of Traditions: Philosophical Tradition (Sarvadarshan) Nyaya, Vyshepec, Sankhya, Yog,
Meemamsa, Vedantha, Chavanka, Jain & Boudh - Indian Artistic Tradition - Chitrakala, Moorthikala,
Vasthukala , Sthapthya, Sangeetha, NruthyaYevamSahithya
 R-20 Syllabus for CSE-AI&ML, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF CSE - ARTIFICIAL INTELLIGENCE & MACHINE LEARNING

Reference Books :
1. Traditional Knowledge System in India, by AmitJha, 2009.
2. Traditional Knowledge System and Technology in India by Basanta Kumar Mohanta and
Vipin Kumar Singh, PratibhaPrakashan 2012.
3. Sivaramakrishnan (Ed.), Cultural Heritage of India-course material, BharatiyaVidya
4. Swami Jitatmanand, Holistic Science and Vedant, BharatiyaVidyaBhavan
5. Yoga Sutra of Patanjali, Ramakrishna Mission, Kolkata.
6. Pramod Chandra, India Arts, Howard Univ. Press, 1983.
7. Krishna Chaitanya, Arts of India, Abhinav Publications, 1987.

Web Resources:
1. https://www.wipo.int/wipo_magazine/en/2017/01/article_0004.html
2. http://iks.iitgn.ac.in/wp-content/uploads/2016/01/Indian-Knowledge-Systems-Kapil-Kapoor.pdf
3.https://www.wipo.int/edocs/mdocs/tk/en/wipo_grtkf_ic_21/wipo_grtkf_ic_21_ref_facilitators_text.pdf