Department of Computer Science with Artificial Intelligence

B.Sc., Computer Science with Artificial Intelligence

SYLLABUS
CORE - I : I YEAR / I SEM

INTRODUCTION TO ARTIFICIAL INTELLIGENCE

UNIT - I: Introduction, growth and Applications of AI

What Is Artificial Intelligence?: Brain Science and Problem Solving, The Turing Test and Chatterbots-The
History of AI: The First Beginnings,Logic Solves (Almost) All Problems, The New
Connectionism,Reasoning Under Uncertainty,Distributed; Autonomous and Learning Agents,AI Grows Up-
The AI Revolution: AI and Society, Does AI Destroy Jobs? - Agents Knowledge - Based Systems

UNIT - II: Propositional logic

Reasoning in Daily Life-Inference Patterns, Validity, and Invalidity-Classification, Consequence, and
Update-The Language of Propositional Logic: From natural language to logical notation, Inclusive and
exclusive disjunction, implications, Double implications, Ambiguity - Semantic Situations, Truth Tables,
Binary Arithmetic, Tautology, Contradiction, conjunctive normal form, equivalence of propositions

UNIT - III: First-Order Predicate Logic

Inference rules: Modus Ponens, Modus Tollens, Hypothetical Syllogism, Disjunctive Syllogism, Addition,
Simplification, Resolution - Quantifiers in First-order logic-Properties of Quantifiers-Free and Bound
Variables-Inference in First-Order Logic:FOL inference rules for quantifier: Universal Generalization,
Universal Instantiation, Existential Instantiation, Existential introduction - Unification: Conditions for
Unification, Unification Algorithm- Resolution: Steps for Resolution- Forward Chaining and backward
chaining

UNIT - IV: Prolog

Why prolog for AI- Rules- Syntax- Constants- variables- characters- operators- Equality & unification -
Arithmetics - Satisfying goals

UNIT - V: Data structures in Prolog

Trees- lists- Recursive search- Mapping- Recursive Comparison- Joining Structures - Accumulators (VS)
Difference structures- Backtrack: Multiple solutions- The 'Cut':- Uses of Cut- problems with Cut
TEXT BOOK:
1. Introduction to Artificial Intelligence, Wolfgang Erte, Springer, Cham
2. Programming in Prolog,W.F. Clocksin, C.S. Mellish.-5th ed,Springer
REFERENCES:
1. Artificial Intelligence For Dummies,John Paul Mueller,Luca Massaron;Dummies
2. Artificial Intelligence: A Modern Approach.Stuart Russell,Peter Norvig;Prentice Hall
3. PROLOG: Programming for Artificial Intelligence, BRATKO,Pearson
4. Prolog by Example: by Helder Coelho , Jose C. Cotta ,Springer
WEB REFERENCES:
1. https://logicinaction.org/docs/ch2.pdf
PRACTICAL - I : I YEAR / I SEM

PROLOG LAB
LIST OF EXERCISES:

1. Check if the predicate functor(Term, F, A) succeeds if Term has functor F and arity A by defining a
functor
2. Find the number of elements of a list (with size >1) and remove the middle element (at position
size//2)
3. Create a list containing all integers within a given range and Reverse the list
4. Write a function append to concatenate elements of two lists into a third list
5. Write a predicate table/3 which prints the truth table of a given logical expression in two variables.
6. Write a Prolog program using ( ; ) operator to decide whether or not any number was between two
other numbers (i.e., to check if number N is between two numbers N1 and N2 if either N is greater
than N1 and N is less than N2 or N is less than N1 or N is greater than N2.)
7. Write a Prolog function to find the factorial of a number
8. Query if an element is a member of a list, ( using member predicate ). To the in-built select function
pass a member of the list and return the remainder of the list
9. Demonstrate the use of built-in predicate function findall in a program
10. Evaluate mathematical expressions involving power(**), integer division(//), mod, sqrt and the other
basic math operations(+,-,*,%)
11. Use conditions to check the greatest of given two numbers in the stdin/input ( not using the max
operator)
12. Check the negation of the goal using \+ operator
13. Define a new infix operator is_bigger to compare the size of two animals mentioned in the facts
14. Check whether a given term represents a binary tree
15. Construct a completely balanced binary tree in Prolog

REFERENCES:
https://sites.google.com/site/prologsite/prolog-problems/
https://ocw.upj.ac.id/files/Textbook-TIF212-Prolog-Tutorial-3.pdf
http://www.cse.unsw.edu.au/~billw/dictionaries/prolog/
https://www.dai.ed.ac.uk/groups/ssp/bookpages/quickprolog/
https://www.educba.com/prolog-programming/
CORE - II : I YEAR / II SEM
PROBLEM SOLVING USING PYTHON

UNIT – I
Introduction: The essence of computational problem solving – Limits of computational problem solving-
Computer algorithms-Computer Hardware-Computer Software-The process of computational problem
solving-Python programming language - Literals - Variables and Identifiers - Operators - Expressions and
Data types.
UNIT - II
Control Structures: Boolean Expressions - Selection Control - If Statement- Indentation in Python-
Multi-Way Selection -- Iterative Control- While Statement- Infinite loops- Definite vs. Indefinite Loops-
Boolean Flags and Indefinite Loops. Lists: List Structures - Lists in Python - Iterating over lists in Python.
UNIT - III
Functions: Program Routines- Defining Functions- More on Functions: Calling Value-Returning
Functions- Calling Non-Value-Returning Functions- Parameter Passing - Keyword Arguments in Python -
Default Arguments in Python-Variable Scope.
UNIT - V
Objects and their use: Software Objects - Turtle Graphics – Turtle attributes-Modular Design: Modules -
Top- Down Design - Python Modules - Text Files: Opening, reading and writing text files - String
Processing - Exception Handling.
UNIT - V
Dictionaries and Sets: Dictionary type in Python - Set Data type. Object Oriented Programming using
Python: Encapsulation - Inheritance – Polymorphism. Recursion: Recursive Functions.

TEXT BOOK:
1. Charles Dierbach, “Introduction to Computer Science using Python - A computational Problem
solving Focus”, Wiley India Edition, 2015.

REFERENCE BOOKS:

1. Mark Lutz, “Learning Python Powerful Object Oriented Programming”, O’reilly Media 2018, 5th
Edition.
2. Timothy A. Budd, “Exploring Python”, Tata MCGraw Hill Education Private Limited 2011, 1st
Edition.
3. Allen Downey, Jeffrey Elkner, Chris Meyers, “How to think like a computer scientist: learning with
Python”, 2012.
4. Sheetal Taneja & Naveen kumar, “Python Programming a Modular approach – A Modular
approach with Graphics, Database, Mobile and Web applications”, Pearson, 2017.
5. Ch Satyanarayana M Radhika Mani, B N Jagadesh, “Python programming”, Universities Press 2018.

WEB REFERENCES
http://interactivepython.org/courselib/static/pythonds
http://www.ibiblio.org/g2swap/byteofpython/read/
http://www.diveintopython3.net/
http://greenteapress.com/wp/think-python-2e/
NPTEL & MOOC courses titled Python programming
http://spoken-tutorial.org/tutorial-search/?search_foss=Python&search_language=English
http://docs.python.org/3/tutorial/index.html
PRACTICAL - II : I YEAR / II SEM

PYTHON PROGRAMMING LAB

LIST OF EXERCISES:
1. Program to convert the given temperature from Fahrenheit to Celsius and vice versa depending
upon user’s choice.
2. Program to calculate total marks, percentage and grade of a student. Marks obtained in each of
the five subjects are to be input by user. Assign grades according to the following criteria:
Grade A: Percentage >=80 Grade B: Percentage >=70 and <80
Grade C: Percentage >=60 and <70 Grade D: Percentage >=40 and
<60 Grade E: Percentage <40
3. Program, to find the area of rectangle, square, circle and triangle by accepting suitable input
parameters from user.
4. Program to display the first n terms of Fibonacci series.
5. Program to find factorial of the given number using recursive function.
6. Write a Python program to count the number of even and odd numbers from array of N numbers.
7. Python function that accepts a string and calculate the number of upper case letters and lower case
letters.
8. Python program to reverse a given string and check whether the give string is palindrome or not.
9. Write a program to find sum of all items in a dictionary.
10. Write a Python program to construct the following pattern, using a
nested loop 1
22
333
4444
55555
666666
7777777
88888888
999999999
11. Read a file content and copy only the contents at odd lines into a new file.
12. Create a Turtle graphics window with a specific size.
13. Write a Python program for Towers of Hanoi using recursion
14. Create a menu driven Python program with a dictionary for words and their meanings.
15. Devise a Python program to implement the Hangman Game.
CORE - III : II YEAR / III SEM
JAVA AND DATA STRUCTURE

UNIT - I
History and Evolution of Java - Features of Java - Object Oriented Concepts – Bytecode - Lexical Issues -
Data Types – Variables- Type Conversion and Casting- Operators - Arithmetic Operators - Bitwise -
Relational Operators - Assignment Operator - The conditional Operator - Operator Precedence- Control
Statements – Arrays.

UNIT - II
Classes - Objects - Constructors - Overloading method - Static and fixed methods - Inner Classes - String
Class- Overriding methods - Using super-Abstract class - this keyword – finalize() method – Garbage
Collection.

UNIT - III

Packages - Access Protection - Importing Packages - Interfaces - Exception Handling - Throw andThrows-
The Java Thread Model- Creating a Thread and Multiple Threads - Thread Priorities Synchronization-Inter
thread Communication - Deadlock
- Suspending, Resuming and stopping threads – Multithreading-I/O Streams - File Streams - Applets .

UNIT - IV
Abstract Data Types(ADTs)-List ADT-Array based implementation-linked list implementation-singly
linked list-doubly linked list-circular linked list-Stack ADT operations-Applications-Evaluating arithmetic
expressions-Conversion of infix to postfix expression-Queue ADT-operations-Applications of Queues.

UNIT - V
Trees-Binary Trees- representation - Operations on Binary Trees- Traversal of a Binary Tree -Binary
Search Trees, Graphs- Representation of Graphs - Traversal in Graph -Dijkstra’s Algorithm, Depth-First vs
Breadth-First Search.

TEXT BOOKS:
1. E.Balagurusamy,” Programming with Java: A Primer”, Tata McGraw Hill 2014, 5th Edition.
2. Mark Allen Weiss, “Data Structures and Algorithms Analysis in C++”, Person Education 2014, 4th
Edition.

REFERENCES:
. 1. Herbert Schildt, “JAVA 2: The Complete Reference”, McGraw Hill 2018, 11th Edition.
2. Aho, Hopcroft and Ullman, “Data Structures and Algorithms “, Pearson Education 2003.
3. S. Sahni, “Data Structures, Algorithms and Applications in JAVA”, Universities Press 2005, 2nd Edition

WEB REFERENCES:
NPTEL & MOOC courses titled Java and Data Structures
https://nptel.ac.in/courses/106106127/
https://nptel.ac.in/courses/106105191/
PRACTICAL - III : II YEAR / III SEM
DATA STRUCTURES USING JAVA LAB

LIST OF EXERCISES:

1. Write a Java program to implement the Stack ADT using a singly linked list.
2. Write a Java program to implement the Queue ADT using a singly linked list.
3. Write a Java program for the implementation of circular Queue.
4. Write a Java program that reads an infix expression, converts into postfix form
5. Write a Java program to evaluate the postfix expression (use stack ADT).
6. Write a Java program to Insert an element into a binary search tree.
7. Write a Java program to delete an element from a binary search tree.
8. Write a Java program to search for a key element in a binary search tree.
9. Write a Java program for the implementation of BFS for a given graph.
10. Write a Java program for the implementation of DFS for a given graph
CORE - IV : II YEAR / IV SEM

RELATIONAL DATABASE MANAGEMENT SYSTEM

UNIT - I
Introduction to DBMS– Data and Information - Database – Database Management System –
Objectives - Advantages – Components - Architecture. ER Model: Building blocks of ER Diagram –
Relationship Degree – Classification – ER diagram to Tables – ISA relationship – Constraints –
Aggregation and Composition – Advantages
UNIT - II
Relational Model: CODD’s Rule- Relational Data Model - Key - Integrity – Relational Algebra
Operations – Advantages and limitations – Relational Calculus – Domain Relational Calculus - QBE.
UNIT - III
Structure of Relational Database. Introduction to Relational Database Design - Objectives – Tools –
Redundancy and Data Anomaly – Functional Dependency - Normalization – 1NF – 2NF – 3NF –
BCNF. Transaction Processing – Database Security.
UNIT - IV
SQL: Commands – Data types – DDL - Selection, Projection, Join and Set Operations – Aggregate
Functions – DML – Modification - Truncation - Constraints – Subquery.
UNIT - V
PL/SQL: Structure - Elements – Operators Precedence – Control Structure – Iterative Control - Cursors -
Procedure
- Function - Packages – Exceptional Handling - Triggers.

TEXT BOOK:
1. S. Sumathi, S. Esakkirajan, “Fundamentals of Relational Database Management System”,
Springer International Edition 2007.

REFERENCE BOOKS:
1. Abraham Silberchatz, Henry F. Korth, S. Sudarshan, “Database System Concepts”, McGrawHill
2019, 7th Edition.
2. Alexis Leon & Mathews Leon, “Fundamentals of DBMS”, Vijay Nicole Publications 2014, 2nd
Edition.

WEB REFERENCES:
NPTEL & MOOC courses titled Relational Database Management Systems
https://nptel.ac.in/courses/106106093/
https://nptel.ac.in/courses/106106095/
PRACTICAL - IV : II YEAR / IV SEM
PL/SQL LAB

LIST OF EXERCISES

1) DDL commands with constraints.

2) DML Commands with constraints.
3) SQL Queries: Queries, sub queries, Aggregate function
4) PL/SQL : Exceptional Handling
5) PL/SQL : Cursor
6) PL/SQL : Trigger
7) PL/SQL : Packages
8) Design and Develop Application for Library Management
9) Design and Develop Application for Student Mark Sheet Processing
10) Design and Develop Application for PayRoll Processing
CORE - V : III YEAR / V SEM
OPERATING SYSTEM

UNIT - I
Introduction: Views - Types of System - OS Structure – Operations - Services – Interface- System Calls-
System Structure - System Design and Implementation. Process Management: Process - Process Scheduling -
Inter-process Communication. CPU Scheduling: CPU Schedulers - Scheduling Criteria - Scheduling
Algorithms.

UNIT - II
Process Synchronization: Critical- Section Problem - Synchronization Hardware Semaphores - Classical
Problems of Synchronization - Monitors. Deadlocks: Characterization - Methods for Handling Deadlocks -
Deadlock Prevention - Avoidance - Detection - Recovery.

UNIT - III
Memory Management: Hardware - Address Binding – Address Space - Dynamic Loading and Linking –
Swapping – Contiguous Allocation - Segmentation - Paging – Structure of the Page Table.

UNIT - IV
Virtual Memory Management: Demand Paging - Page Replacement Algorithms - Thrashing. File System:
File Concept -. Access Methods - Directory and Disk Structure - Protection - File System Structures -
Allocation Methods - Free Space Management.

UNIT - V
I/O Systems: Overview - I/O Hardware - Application I/O Interface - Kernel I/O Subsystem - Transforming
1/0 Requests to Hardware Operations - Performance. System Protection: Goals - Domain - Access matrix.
System Security: The Security Problem - Threats – Encryption- User Authentication.

TEXT BOOK:
1. Abraham Silberschatz, Peter B Galvin, Greg Gagne, “Operating System Concepts”, Wiley India Pvt.
Ltd 2018, 9th Edition,.
REFERENCES:
1. William Stallings, “Operating Systems Internals and Design Principles”, Pearson, 2018, 9th Edition.
2. Andrew S. Tanenbaum, Herbert Bos, “Modern Operating Systems”, Pearson 2014, 4th Edition.
WEB REFERENCES:
NPTEL & MOOC courses titled Operating Systems https://nptel.ac.in/courses/106106144/
 CORE - VI : III YEAR / V SEM
COMPUTER NETWORK

UNIT - I
Introduction – Network Hardware - Software - Reference Models - OSI and TCP/IP Models - Example
Networks: Internet, ATM, Ethernet and Wireless LANs - Physical Layer - Theoretical Basis for Data
Communication - Guided Transmission Media.
UNIT - II
Wireless Transmission - Communication Satellites - Telephone System: Structure, Local Loop, Trunks and
Multiplexing and Switching. Data Link Layer: Design Issues - Error Detection and Correction.

UNIT - III
Elementary Data Link Protocols - Sliding Window Protocols - Data Link Layer in the Internet - Medium
Access Layer - Channel Allocation Problem - Multiple Access Protocols - Bluetooth.

UNIT - IV
Network Layer - Design Issues - Routing Algorithms - Congestion Control Algorithms - IP Protocol - IP
Addresses - Internet Control Protocols.

UNIT - V
Transport Layer - Services - Connection Management - Addressing, Establishing and Releasing a Connection
- Simple Transport Protocol - Internet Transport Protocols (ITP) - Network Security: Cryptography.

TEXT BOOK :
1. A. S. Tanenbaum, “Computer Networks”, Prentice-Hall of India 2008, 4th Edition.
REFERENCE BOOKS:

1. Stallings, “Data and Computer Communications”, Pearson Education 2012, 7th Edition.
2. B. A. Forouzan, “Data Communications and Networking”, Tata McGraw Hill 2007, 4th Edition.
3. F. Halsall, “Data Communications, Computer Networks and Open Systems”, Pearson Education 2008.
4. D. Bertsekas and R. Gallagher, “Data Networks”, PHI 2008, 2nd Edition.
5. Lamarca, “Communication Networks”, Tata McGraw Hill 2002.
WEB REFERENCES:
NPTEL & MOOC courses titled Computer Networks
https://nptel.ac.in/courses/106106091/
CORE - VII : III YEAR / V SEM

COMPUTER VISION

Unit1: Introduction

Image Processing, Computer Vision and Computer Graphics, what is Computer Vision - Low-level, Mid-
level, High-level, Overview of Diverse Computer Vision Applications: Document Image Analysis,
Biometrics, Object Recognition, Tracking, Medical Image Analysis, Content-Based Image Retrieval, Video
Data Processing, Multimedia, Virtual Reality and Augmented Reality

Unit II: Digital Image Formation and low-level processing

Fundamentals of Image Formation, Transformation: Orthogonal, Euclidean, Affine, Projective; Fourier
Transform, Convolution and Filtering, Image Enhancement, Restoration, Histogram Processing.

Unit III: Feature Extraction & Image Segmentation

Edges - Canny, LOG, DOG; Line detectors (Hough Transform), Corners - Harris and Hessian Affine, Gabor
Filters and DWT; Image Segmentation: Contour based representation, Region based representation, Level set
representations, Fourier and wavelet descriptors, Multiresolution analysis.

Unit IV: Pattern & Motion Analysis

Clustering: K-Means, K-Medoids, Classification: Discriminant Function, Supervised, Un-supervised, Semi-
supervised; Classifiers: Bayes, KNN, Dimensionality Reduction: LDA, ICA, Background Subtraction and
Modeling, Spatio-Temporal Analysis, Dynamic Stereo; Motion parameter estimation.

Unit V: Applications
Photo album – Face detection – Face recognition – Active appearance and 3D shape models of faces
Application: Surveillance – foreground-background separation – particle filters – tracking and occlusion –
combining views from multiple cameras – human gait analysis Application: In-vehicle vision system:
locating roadway – road markings – identifying road signs – locating pedestrians

TEXT BOOK:
1. Richard Szeliski, Computer Vision: Algorithms and Applications, Springer-Verlag London Limited
2011.
REFERENCE BOOK:
1. Computer Vision: A Modern Approach, D. A. Forsyth, J. Ponce, Pearson Education, 2003.
2. Richard Hartley and Andrew Zisserman, Multiple View Geometry in Computer Vision, Second
Edition, Cambridge University Press, March 2004.
3. Christopher M. Bishop; Pattern Recognition and Machine Learning, Springer, 2006
4. E. R. Davies, Computer & Machine Vision, Fourth Edition, Academic Press, 2012
5. Simon J. D. Prince, Computer Vision: Models, Learning, and Inference, Cambridge University Press,
2012
6. Mark Nixon and Alberto S. Aquado, Feature Extraction & Image Processing for Computer Vision,
Third Edition, Academic Press, 2012.
WEB REFERENCES:
1. https://viso.ai/blog/
2. https://learnopencv.com/
3. https://www.analyticsvidhya.com/blog/
4. https://www.rsipvision.com/rsip-vision-learns/
PRACTICAL - V : III YEAR / V SEM
COMPUTER VISION - LAB

LIST OF EXERCISES:
1. Perform the image transformations that include the geometric and morphological transformations.

2. Perform the image enhancement by applying contrast limited adaptive histogram Equalization

3. Perform the Contours and Region based segmentation in images

4. Perform the Wavelet Transforms on image using PyWavelets.

5. Perform the K-Means clustering for Image segmentation using CV2 library.

6. Perform basic motion detection and tracking using python and OpenCV

7. Perform face detection using OpenCV library

8. Perform Foreground Extraction in an image

9. Perform Pedestrian Detection using OpenCV and Python.

 ELECTIVE - I-A : III YEAR / V SEM

NATURAL LANGUAGE PROCESSING

Unit – I: Introduction
Overview: Origins and challenges of NLP- Theory of Language -Features of Indian Languages – Issues in
Font –Models and Algorithms- NLP Applications.

UNIT II - MORPHOLOGY AND PARTS-OF-SPEECH

Phonology – Computational Phonology - Words and Morphemes – Segmentation – Categorization and
Lemmatisation – Word Form Recognition – Valency - Agreement - Regular Expressions – Finite State
Automata – Morphology- Morphological issues of Indian Languages – Transliteration.

UNIT III - PROBABILISTIC MODELS

Probabilistic Models of Pronunciation and Spelling – Weighted Automata – N- Grams – Corpus Analysis –
Smoothing – Entropy - Parts-of-Speech – Taggers – Rule based – Hidden Markov Models – Speech
Recognition.

UNIT IV - SYNTAX
Basic Concepts of Syntax – Parsing Techniques – General Grammar rules for Indian Languages – Context
Free Grammar – Parsing with Context Free Grammars – Top Down Parser – Earley Algorithm – Features and
Unification - Lexicalised and Probabilistic Parsing.

UNIT V - SEMANTICS AND PRAGMATICS (6 hours) Representing Meaning – Computational

Representation – Meaning Structure of Language – Semantic Analysis – Lexical Semantics – WordNet –
Pragmatics – Discourse – Reference Resolution – Text Coherence – Dialogue Conversational Agents.

TEXT BOOK:
1. Ronald Hausser, “Foundations of Computational Linguistics”, Springer-Verleg, 1999.

REFERENCES:

2. Daniel Jurafskey and James H. Martin “Speech and Language Processing”, Prentice Hall, 2009.
3. Christopher D.Manning and Hinrich Schutze, “Foundation of Statistical Natural Language
Processing”, MIT Press, 1999.
4. James Allen, “Natural Language Understanding”, Benjamin/Cummings Publishing Co. 1995.
5.Applied Natural Language Processing with Python: Implementing Machine Learning
and Deep Learning Algorithms for Natural Language Processing,By Taweh Beysolow
II, September 2018
WEB REFERENCES:
1. https://blog.algorithmia.com/introduction-natural-language-processingnlp/
2. https://www.udacity.com/course/natural-language-processingnanodegree--nd892.
https://www.coursera.org/learn/language-processing
3. https://towardsdatascience.com/a-practitioners-guide-to-naturallanguage-processing-part-i-processing-
understanding-text-9f4abfd13e72
4. https://www.edx.org/course/natural-language-processing
ELECTIVE - I-B : III YEAR / V SEM
MOBILE APP DEVELOPMENT FOR ML
Unit I:
Mobile App Development:
Mobile App Development – Android Platform – Android SDK – Eclipse Installation – Building simple
Android Applications.
Unit II:
Android Application Design Essentials:
Anatomy of an Android Application – Android Terminologies: Application Context, Activities, Services,
Intents – Receiving and broadcasting Intents – Intent Filters – Content Providers.
Unit III:
Android User Interface Design Essentials:
User Interface Design Elements – Designing User Interfaces with Layouts – Drawing and working with
animation.
Unit IV:
TensorFlow Lite:
Converting a Machine Learning model to TensorFlow Lite – Saving the model – Loading the Model and
allocating Tensors – Performing prediction – Optimizing the model.
Unit – V:
TensorFlow Android App Development:
Editing Layout File – Adding TensorFlow Lite dependencies – Adding TensorFlow Lite model – Writing
Activity code for getting insights from data - Case Study: Processing Images on a Mobile.
TEXT BOOKS:
1. Ryan Cohen and Tao Wang, “GUI Design for Android Apps”, Apress, 2014.
2. John Horton, “Android Programming for Beginners”, Second Edition, Packt, 2018.
REFERENCES:
1. Ted Hagos, “Learn Android Studio with Kotlin: Efficient Android App Development”, Apress, 2018.
2. Laurence Moroney, “AI and ML for Coders”, O’Reilly, 2020.
3. Reto Meier, “Professional Android 2 Application Development”, Wiley India Pvt Ltd
4. Mark L Murphy, “Beginning Android”, Wiley India Pvt Ltd
5. Android Application Development All in one for Dummies by Barry Burd, Edition: I
WEB REFERENCES:
http://venturebeat.com/2009/01/01/android-netbooks-on-their-way-likely-by-2010/
ELECTIVE - I-C : III YEAR / V SEM

INTRODUCTION TO REINFORCEMENT LEARNING

Unit – I: Monte-Carlo Methods

Monte-Carlo methods: policy evaluation, rollouts, on policy and off-policy learning, importance sampling

Unit – II: Temporal Difference Learning

Temporal Difference learning: TD prediction, Optimality of TD(0), SARSA, Q-learning, Games and after
states, Maximization Bias and Double Learning.

Unit – III: EligibilityTraces

Eligibility traces: n-step TD prediction, TD(lambda), forward and backward views, Q(lambda),
SARSA(lambda), replacing traces and accumulating traces.

Unit – IV: Function Approximation

Function Approximation: Value prediction, gradient descent methods, linear function approximation, Control
algorithms, Fitted Iterative Methods, Deep Q-learning.

Unit – V: Computer Vision

Policy Gradient methods: non-associative learning - REINFORCE algorithm, exact gradient methods,
estimating gradients, approximate policy gradient algorithms, actor-critic methods, Asynchronous Advantage
Actor-Critic.
Hierarchical RL: MAXQ framework, Options framework, HAM framework, Option discovery algorithms.
Case studies: Elevator dispatching, Samuel's checker player, TD-gammon, Acrobot, Helicopter piloting,
Alpha Go

BOOKS:
● R. S. Sutton and A. G. Barto. Reinforcement Learning - An Introduction. MIT Press. 2nd Edition.
2018.
● Richard S. Sutton and Andrew G. Barto, "Reinforcement learning: An introduction", Second Edition,
MIT Press, 2019
REFERENCES
1. Li, Yuxi. "Deep reinforcement learning." arXiv preprint arXiv:1810.06339 (2018).
2. Wiering, Marco, and Martijn Van Otterlo. "Reinforcement learning." Adaptation, learning, and
optimization 12 (2012)
3. Russell, Stuart J., and Peter Norvig. "Artificial intelligence: a modern approach."Pearson Education
Limited, 2016.
4. Goodfellow, Ian, Yoshua Bengio, and Aaron Courville. "Deep learning." MIT press, 2016.
WEB REFERENCES:
1. David Silver’s course on Reinforcement Learning (link)
2. Video Lectures by Prof. David Silver
3. Video Lectures by Prof. B.Ravindran
PRACTICAL -VI-A : III YEAR / V SEM

NATURAL LANGUAGE PROCESSING Lab

LIST OF EXERCISES

1. How to tokenize a given text?

2. How to get the sentences of a text document ?
3. How to tokenize text with stop words as delimiters?
4. How to remove stop words and punctuations in a text ?
5. How to perform stemming?
6. How to lemmatize a given text ?
7. How to extract usernames from emails ?
8. How to find the most common words in the text excluding stopwords?
9. How to do spell correction in a given text ?
10. How to classify a text as positive/negative sentiment?
11. How to extract Noun and Verb phrases from a text ?
12. How to find the ROOT word of any word in a sentence?
13. Write a Python program to load the iris data from a given csv file into a dataframe and print the shape
of the data, type of the data and first 3 rows.
14. Write a Python NLTK program to find the sets of synonyms and antonyms of a given word.
15. Write a Python NLTK program to print the first 15 random combine labeled male and labeled female
names from names corpus.

TEXT BOOKS:
1. Jurafsky Dan and Martin James H. “Speech and Language Processing” ,3rd Edition, 2018.
REFERENCE BOOKS:
1. Jurafsky D. and Martin J. H., “Speech and language processing: An Introduction to Natural Language
Processing, Computational Linguistics, and Speech Recognition”, 2nd
Edition, Upper Saddle River, NJ: Prentice-Hall, 2008.
2. Goldberg Yoav “A Primer on Neural Network Models for Natural Language Processing”.
3. Natural Language Processing with Python, Steven Bird, Ewan Klein, and Edward Loper
PRACTICAL -VI-B : III YEAR / V SEM
MOBILE APP DEVELOPMENT FOR ML - LAB

LIST OF EXERCISES:

1. Calculator App – Setting up the UI using Linear Layouts

2. Calculator App – Using OnClick and implementing CLR functionality
3. Calculator App – Adding the OnDecimalPoint and OnOperator functionalities
4. Calculator App – Adding Subtraction using split and substring methods
5. Calculator App – Adding other required operators and finalizing the App
6. Quiz App – Setting up the UI using cardview
7. Quiz App – Creating the Question Model and preparing the Questions
8. Quiz App – Setting up the Question UI and Question Activity
9. Quiz App – Selecting right and wrong answers and displaying subsequent Question
10. Quiz App – Preparing UI for the Result Activity
11. TensorFlow Regression App – Editing the Layout File
12. TensorFlow Regression App – Adding TensorFlow Lite Dependencies
13. TensorFlow Regression App – Adding TensorFlow Lite Model
14. TensorFlow Regression App – Writing Activity code for inference

TEXT BOOKS:

1. Ryan Cohen and Tao Wang, “GUI Design for Android Apps”, Apress, 2014.
2. John Horton, “Android Programming for Beginners”, Second Edition, Packt, 2018.
3. Ted Hagos, “Learn Android Studio with Kotlin: Efficient Android App Development”, Apress, 2018.
4. Laurence Moroney, “AI and ML for Coders”, O’Reilly, 2020.
PRACTICAL -VI-C : III YEAR / V SEM
REINFORCEMENT LEARNING - LAB

.
LIST OF EXERCISES:

1. Solving Frozen Lake Problem with Value Iteration

2. Solving Frozen Lake Problem with Policy Iteration

3. Every-visit MC Prediction with Blackjack Game

4. First-visit MC Prediction with Blackjack Game

5. Implementing on-policy MC control

6. Computing Optimal Policy using SARSA

7. Computing Optimal Policy using Q Learning

8. Implementing epsilon-greedy algorithm

9. Implementing Softmax Exploration strategy

10. Implementing Upper Confidence Bound Algorithm

11. Implementing Thomson Sampling strategy

12. Finding the Best Advertisement Banner using Bandits

BOOKS:
1. R. S. Sutton and A. G. Barto. Reinforcement Learning - An Introduction. MIT Press. 2nd Edition.
2018.
2. Sudharsan Ravichandran, Deep Reinforcement Learning with Python, PACKT, 2020.
3. Video Lectures by Prof. David Silver
4. Video Lectures by Prof. B.Ravindran
CORE - VIII : III YEAR / VI SEM
CLOUD COMPUTING

UNIT - I
Cloud Computing Foundation: Introduction to Cloud Computing – Move to Cloud Computing – Types of
Cloud – Working of Cloud Computing
UNIT - II
Cloud Computing Architecture : Cloud Computing Technology – Cloud Architecture – Cloud Modeling
and Design - Virtualization : Foundation – Grid, Cloud and Virtualization – Virtualization and Cloud
Computing
UNIT - III
Data Storage and Cloud Computing : Data Storage – Cloud Storage – Cloud Storage from LANs to
WANs – Cloud Computing Services : Cloud Services – Cloud Computing at Work
UNIT - IV
Cloud Computing and Security : Risks in Cloud Computing – Data Security in Cloud – Cloud Security
Services – Cloud Computing Tools : Tools and Technologies for Cloud – Cloud Mashups – Apache Hadoop –
Cloud Tools
UNIT - V
Cloud Applications – Moving Applications to the Cloud – Microsoft Cloud Services – Google Cloud
Applications – Amazon Cloud Services – Cloud Applications

TEXT BOOK:
1. A.Srinivasan and J.Suresh, “Cloud Computing – A Practical Approach for Learning and
Implementation”, Pearson India Publications 2014.
REFERENCE BOOK:
1. Rajkumar Buyya, James Broberg, Andrzej , “Cloud Computing: Principles and Paradigms”,
Wiley India Publications 2011.
2. Arshdeep Bahga and Vijay Madisetti ,“Cloud Computing – A Hands on Approach”, Universities
Press (India) Pvt Ltd. 2014.

WEB REFERENCES:
1. NPTEL & MOOC courses titled Cloud computing https://nptel.ac.in/courses/106105167/
CORE - IX : III YEAR / VI SEM
INTERNET OF THINGS

UNIT – I
IoT & Web Technology, The Internet of Things Today, Time for Convergence, Towards the IoT Universe,
Internet of Things Vision, IoT Strategic Research and Innovation Directions, IoT Applications, Future
Internet Technologies, Infrastructure, Networks and Communication, Processes, Data Management,
Security, Privacy & Trust, Device Level Energy Issues, IoT Related Standardization, Recommendations
on Research Topics.

UNIT - II
M2M to IoT – A Basic Perspective– Introduction, Some Definitions, M2M Value Chains, IoT Value
Chains, An emerging industrial structure for IoT, The international driven global value chain and global
information monopolies. M2M to IoT-An Architectural Overview– Building an architecture, Main design
principles and needed capabilities, An IoT architecture outline, standards considerations.

UNIT - III
IoT Architecture -State of the Art – Introduction, State of the art, Architecture. Reference Model-
Introduction, Reference Model and architecture, IoT reference Model, IoT Reference Architecture-
Introduction, Functional View, Information View, Deployment and Operational View, Other Relevant
architectural views.

UNIT - IV
IoT Applications for Value Creations Introduction, IoT applications for industry: Future Factory Concepts,
Brownfield IoT, Smart Objects, Smart Applications, Four Aspects in your Business to Master IoT, Value
Creation from Big Data and Serialization, IoT for Retailing Industry, IoT For Oil and GasIndustry,
Opinions on IoT Application and Value for Industry, Home Management, eHealth.

UNIT - V
Internet of Things Privacy, Security and Governance Introduction, Overview of Governance, Privacy and
Security Issues, Contribution from FP7 Projects, Security, Privacy and Trust in IoT-Data-Platforms for
Smart Cities, First Steps Towards a Secure Platform, Smartie Approach. Data Aggregation for the IoT in
Smart Cities, Security

TEXT BOOK:
1. Vijay Madisetti and ArshdeepBahga, “Internet of Things: (A Hands-on Approach)”, Universities Press
(INDIA) Private Limited 2014, 1st Edition.
REFERENCE BOOKS:
1. Michael Miller, “The Internet of Things: How Smart TVs, Smart Cars, Smart Homes, and Smart Cities
Are Changing the World”, Pearson Education 2015.
2. Francis da Costa, “Rethinking the Internet of Things: A Scalable Approach to Connecting Everything”,
Apress Publications 2013, 1st Edition.
3. Waltenegus Dargie, Christian Poellabauer, "Fundamentals of Wireless Sensor Networks: Theory and
Practice”, Wiley 2014.
4. CunoPfister, “Getting Started with the Internet of Things”, O‟Reilly Media 2011.
WEB REFERENCES:
1. https://github.com/connectIOT/iottoolkit
2. https://www.arduino.cc/
3. http://www.zettajs.org/
CORE - X : III YEAR / VI SEM
MACHINE LEARNING

UNIT – I: Introduction
Machine Learning Foundations – Overview – Design of a Learning System – Types of Machine Learning –
Supervised Learning and Unsupervised Learning – Applications of Machine Learning – Tools Overview for
ML.

UNIT – II: Supervised Learning - I

Simple Linear Regression – Multiple Linear Regression – Polynomial Regression – Ridge Regression – Lasso
Regression – Evaluating Regression Models – Model Selection – Bagging – Ensemble Methods.

UNIT – III: Supervised Learning - II

Classification – Logistic Regression – Decision Tree Regression and Classification – Random Forest
Regression and Classification – Support Vector Machine Regression and Classification - Evaluating
Classification Models.

UNIT – IV: Unsupervised Learning

Clustering – K-Means Clustering – Density-Based Clustering – Dimensionality Reduction – Collaborative
Filtering.

UNIT – V: Association Rule Learning

Association Rule Learning – Concepts related to ARL – ARL Algorithms - Apriori – Eclat – Concepts and
Algorithms.

TEXT BOOK:
1. Kevin P. Murphy, “Machine Learning: A Probabilistic Perspective”, MIT Press, 2012.

REFERENCE BOOK:
1. Ethem Alpaydin, “Introduction to Machine Learning”, MIT Press, Third Edition, 2014.
2. Tom Mitchell, "Machine Learning", McGraw-Hill, 1997.
3. Sebastian Raschka, Vahid Mirjilili,” Python Machine Learning and deep learning”, 2nd edition, kindle
book, 2018
4. Carol Quadros,” Machine Learning with python, scikit-learn and Tensorflow”, Packet
Publishing, 2018
5. Gavin Hackeling,” Machine Learning with scikit-learn”, Packet publishing, O'Reilly, 2018
WEB REFERENCES:
1. Stanford Lectures of Prof. Andrew Ng on Machine Learning
PRACTICAL - VII III YEAR / VI SEM

MACHINE LEARNING - LAB

LIST OF EXERCISES:

1. Write a program to implement the Simple and Multiple Linear Regression

2. Write a program to implement the Polynomial Regression
3. Write a program to implement the Bagging Technique
4. Write a program to implement the Adaboost Methods
5. Write a program to implement Logistic Regression algorithm
6. Write a program to demonstrate the workflow of Decision Tree Classification
7. Write a program to implement the Random Forest Classification
8. Write a program to implement the SVM Classification
9. Write a program to perform the K Means Clustering
10. Write a program to perform the Density based Clustering
11. Write a program to implement the Apriori algorithm for market basket analysis
12. Write a program to compare the Supervised Machine Learning algorithms.

REFERENCE BOOK:
1. Kevin P. Murphy, “Machine Learning: A Probabilistic Perspective”, MIT Press, 2012.
2. Ethem Alpaydin, “Introduction to Machine Learning”, MIT Press, Third Edition, 2014.
3. Tom Mitchell, "Machine Learning", McGraw-Hill, 1997.
4. Sebastian Raschka, Vahid Mirjilili,” Python Machine Learning and deep learning”, 2nd edition, kindle
book, 2018
5. Carol Quadros,” Machine Learning with python, scikit-learn and Tensorflow”, Packet
Publishing, 2018
6. Gavin Hackeling,” Machine Learning with scikit-learn”, Packet publishing, O'Reilly, 2018
7. Stanford Lectures of Prof. Andrew Ng on Machine Learning
 ELECTIVE - II-A : III YEAR / VI SEM

INFORMATION SECURITY

Unit I
Introduction to Information Security : Attacks, Vulnerability, Security Goals, Security Services and
mechanisms - Conventional Cryptographic Techniques : Conventional substitution and transposition
ciphers, One-time Pad
Unit II
Block cipher and Stream Cipher, Steganography - Symmetric and Asymmetric Cryptographic Techniques :
DES, AES, RSA algorithms
Authentication and Digital Signatures : Use of Cryptography for authentication,
Unit III
Secure Hash function, Key management – Kerberos - Program Security : Nonmalicious Program errors –
Buffer overflow, Incomplete mediation, Time-of-check to Time-of- use Errors, Viruses, Trapdoors
Unit IV
Salami attack, Man-in-the- middle attacks, Covert channels - Security in Networks : Threats in networks,
Network Security Controls – Architecture, Encryption, Content Integrity, Strong
Unit V
Authentication , Access Controls, Wireless Security, Honeypots, Traffic flow security, Firewalls – Design and
Types of Firewalls, Personal Firewalls, IDS, Email Security – PGP,S/MIME
TEXT BOOKS:
1. “Information Systems Today, Managing in the Digital World”, Third Edition by Leonard
2. M. Jessup; Joseph S. Valacich, Publisher: Prentice Hall
3. “Introduction to Information Technology”, V. Rajaraman, PHI
REFERENCE BOOKS:
1. “Information Systems Management in Practice” Barbara C. McNurlin, Ralph H. Sprague,
2. and Publisher: Pearson Education.
3. Security in Computing, Fourth Edition, by Charles P. Pfleeger, Pearson Education
4. Cryptography And Network Security Principles And Practice, Fourth or Fifth Edition, William
Stallings, Pearson
5. Modern Cryptography: Theory and Practice, by Wenbo Mao, Prentice Hall.
6. Network Security Essentials: Applications and Standards, by William Stallings. Prentice Hall.
ELECTIVE - II-B : III YEAR / VI SEM
NETWORK SECURITY

Unit-I
Introduction: Attack - Services and Mechanism - Model for Internetwork Security - Cryptography - Notion of
Plain Text- Encryption Key - Ciphertext - Decryption and Cryptanalysis - Public Key Encryption - Digital
Signatures and Authentication
Unit-II
Network Security: Authentication Application - Kerberos - Directory Authentication Service - Pretty Good
Privacy
Unit-III
IP Security Architecture: Authentication header - Encapsulating Security Payload combining Security
Associations - Key Management
Unit-IV
Web Security: Requirement - Secure Sockets Layer - Transport Layer Security - Secure Electronic
Transactions, Network Management Security: Overview of SNMP Architecture - SMMPVI1 Communication
Facility - SNMPV3
Unit-V
System Security: Intruders - Viruses and Related Threats - Firewall Design Principles - Comprehensive
examples using available software platforms/case tools - Configuration Management

TEXT BOOKS:
1. William Stallings, “Cryptography and Network Security, Principles and Practices”,
Pearson Education, Third Edition
2. Charlie Kaufman, Radia Perlman and Mike speciner, “Network security, Private
communication in a Public World”
3. Atul Kahate, “Cryptography and Network Security”, TMH, Third Edition.
4. V. K. Pachghare “Cryptography and Information Security”, PHI
REFERENCE BOOKS:
1. Christopher M. King, “Security architecture, design deployment and operations”, Curtis patton and RSA
Press.
2. Stephen Northcatt, Leny Zeltser, “INSIDE NETWORK Perimeter Security”, Pearson Education Asia.
3. Robert Bragge, Mark Rhodes, Heith straggberg, “Network Security the Complete Reference”, Tata
McGraw Hill Publication.
WEB RESOURCES:
1. http://nptel.iitm.ac.in/courses/106105031/
2. http://www.cert.org/
3. http://www.howard.edu/csl/research_crypt.htm
4. http://www.cs.purdue.edu/homes/ninghui/courses/426_Fall10/lectures.html
5. http://www.cs.uwp.edu/staff/lincke/infosec/
6. http://www.cisa.umbc.edu/courses/cmsc/426/fall06/
7. http://www.cs.northwestern.edu/~ychen/classes/cs395-w05/lectures.html
 ELECTIVE - II-C : III YEAR / VI SEM
BLOCKCHAIN TECHNOLOGY
UNIT - I
History: Digital Money to Distributed Ledgers -Design Primitives: Protocols, Security, Consensus,
Permissions, Privacy- : Block chain Architecture and Design-Basic crypto primitives: Hash, Signature-Hash
chain to Block chain-Basic consensus mechanisms.

UNIT - II
Requirements for the consensus protocols-Proof of Work (PoW)-Scalability aspects of Block chain
consensus protocols: Permissioned Block chains-Design goals-Consensus protocols for Permissioned Block
chains.

UNIT - III
Decomposing the consensus process-Hyper ledger fabric components-Chain code Design and
Implementation: Hyper ledger Fabric II:-Beyond Chain code: fabric SDK and Front End-Hyper ledger
composer tool.

UNIT - IV
Block chain in Financial Software and Systems (FSS): -Settlements, -KYC, -Capital markets-Insurance-
Block chain in trade/supply chain: Provenance of goods, visibility, trade/supply chain finance, invoice
management/discounting.

UNIT - V
Block chain for Government: Digital identity, land records and other kinds of record keeping between
government entities, public distribution system / social welfare systems: Block chain Cryptography: Privacy
and Security on Block chain.

TEXT BOOKS:
1. Mark Gates, “Block chain: Ultimate guide to understanding block chain, bit coin, crypto
currencies, smart contracts and the future of money”, Wise Fox Publishing and Mark Gates 2017.
2. Salman Baset, Luc Desrosiers, Nitin Gaur, Petr Novotny, Anthony O'Dowd, Venkatraman
Ramakrishna, “Hands-On Block chain with Hyper ledger: Building decentralized applications with
Hyperledger Fabric and Composer”, 2018.
3. Bahga, Vijay Madisetti, “Block chain Applications: A Hands-On Approach”, Arshdeep Bahga,
Vijay Madisetti publishers 2017.

REFERENCE BOOKS :
1. Andreas Antonopoulos, “Mastering Bitcoin: Unlocking Digital Crypto currencies”, O'Reilly Media,
Inc. 2014.
2. Melanie Swa, “Block chain ”,O'Reilly Media 2014.

WEB REFERENCES:
1. NPTEL & MOOC courses titled blockchain technology
2. blockgeeks.comguide/what-is-block-chain-technology
3. https://nptel.ac.in/courses/106105184/