B. Tech.

(Computer Science and Engineering- Artificial Intelligence)

Scheme of Studies/Examination w.e.f. 2023-24
Semester - V
Total
Hours Per
Contact Examination Schedule (Marks) Duration
[Link]. Category Course Title week
Course Hrs. per Credits of Exam
Code Marks of
L T P week Theory Practical Total (Hours)
classwork
1. PCC Computer Networks 3 0 0 3 3 30 70 - 100 3
Theory of Computation 3 0 0 3 3 30 70 - 100 3
2. PCC
Natural Language
3. PCC 3 0 0 3 3 30 70 - 100 3
Processing
Data Mining and
4. PCC 3 0 0 3 3 30 70 - 100 3
Warehousing
Text & Web
5. PCC 3 0 0 3 3 30 70 - 100 3
Intelligence
*Professional Elective
6. 3 0 0 3 3 30 70 - 100 3
PEC Course-I
*Open Elective Course-
3 0 0 3 3 30 70 - 100 3
7. OEC I
Computer Networks
LC 0 0 2 2 1 50 - 50 100 2
8. Lab
Text and Web
9. LC 0 0 2 2 1 50 - 50 100 2
Intelligence Lab
Data Mining and
10. LC 0 2 2 1 50 - 50 100 3
Warehousing Lab
TRAI
11. Practical Training-I 4 4 1 50 - 50 100 3
NING
Total 21 0 10 31 25 410 490 200 1100
*NOTE:
1. Choose any one from Professional Elective Course – I
2. Choose any one from Open Elective Course – I
Professional Elective Course – I
1. wireless & mobile networks
2. Mobile application development for AI
3. Introduction to Cloud Computing
4. Distributed Databases

Semester - VI
S.N. Category Course Course Title Hours Per Total Credits Examination Schedule (Marks) Duration
 internally. Each student will be required to score a minimum of 40% marks to qualify in the paper. The
marks will not be included in determining the percentage of marks obtained for the award of a degree.
However, these marks will be shown in the detailed marks certificate of the students.

B. Tech. (Computer Science and Engineering- Artificial Intelligence)

Scheme of Studies/Examination w.e.f. 2023-24
Semester - V
Total
Hours Per
Contact Examination Schedule (Marks) Duration
[Link]. Category Course Title week
Course Hrs. per Credits of Exam
Code Marks of
L T P week Theory Practical Total (Hours)
classwork
1. PCC Computer Networks 3 0 0 3 3 30 70 - 100 3
Theory of Computation 3 0 0 3 3 30 70 - 100 3
2. PCC
Natural Language
3. PCC 3 0 0 3 3 30 70 - 100 3
Processing
4. PCC Data Mining and 3 0 0 3 3 30 70 - 100 3
 Warehousing
Text & Web
5. PCC 3 0 0 3 3 30 70 - 100 3
Intelligence
*Professional Elective
6. 3 0 0 3 3 30 70 - 100 3
PEC Course-I
*Open Elective Course-
3 0 0 3 3 30 70 - 100 3
7. OEC I
Computer Networks
LC 0 0 2 2 1 50 - 50 100 2
8. Lab
Text and Web
9. LC 0 0 2 2 1 50 - 50 100 2
Intelligence Lab
Data Mining and
10. LC 0 2 2 1 50 - 50 100 3
Warehousing Lab
TRAI
11. Practical Training-I 4 4 1 50 - 50 100 3
NING
Total 21 0 10 31 25 410 490 200 1100
*NOTE:
1. Choose any one from Professional Elective Course – I
2. Choose any one from Open Elective Course – I
Professional Elective Course – I
1. Wireless & mobile networks
2. Mobile application development for AI
3. Introduction to Cloud Computing
4. Distributed Databases
 COMPUTER NETWORKS
Semester V
Course code
Category Professional Core Courses
Course title Computer Networks
Scheme and Credits L T P Credits
3 0 0 3
Classwork 30 Marks
Exam 70 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: The examiner will set nine questions in total. Question one will be compulsory. Question one will
have seven parts of 2 marks each from all units, and the remaining eight questions of 14 marks each to be
set by taking two questions from each unit. The students have to attempt five questions in total, the first
being compulsory and selecting one from each unit.

COURSE OBJECTIVE:
1. To develop an understanding of modern network architectures from a design and
Performance perspective.
2. To introduce the student to the major concepts involved in wide-area networks (WANs),
local area networks (LANs), and Wireless LANs (WLANs).
3. To provide an opportunity to do Network programming.
4. To provide WLAN measurement ideas.
UNIT I
Introduction: Data communication, Components, Data Representation, Simplex, Half Duplex, and Full
Duplex Transmission, Modulation, Multiplexing, Computer networks, distributed processing, Internet,
Topologies, Packet and circuit switching, connectionless and connection- oriented services.
Network Models: OSI model and TCP/IP Model Physical Layer – LAN: Ethernet.
UNIT II
Data Link Layer and Medium Access Sub Layer: MAC Addressing, Framing, Stop and Wait, Go back
– N ARQ, Selective Repeat ARQ, Sliding Window Protocol.
Medium Access Control: Random access, Controlled Access, and channelization protocols. Network
Layer: Logical addressing, classful and classless addressing, subnetting, Ipv4, ICMPv4, ARP, RARP and
BOOTP, Ipv6, Ipv6 addressing.
UNIT III
Network Devices: Repeater, hub, switch, router, and gateway.
Routing Algorithms: introduction to routing, Shortest Path Algorithm, Flooding, Hierarchical Routing,
Link State, and Distance Vector Routing
Transport Layer: Process to Process Communication, User Datagram Protocol (UDP), Transmission
Control Protocol (TCP), TCP connection management.
UNIT IV
Congestion Control, Quality of Service, QoS Improving techniques.
Application Layer: Domain Name Space (DNS), EMAIL, File Transfer Protocol (FTP), HTTP, SNMP
Network Security: Firewalls, security goals, types of attack, symmetric and asymmetric key ciphers.
COURSE OUTCOMES:
At the end of this course, students will demonstrate the ability to
CO1: Explain the functions of the different layers of the OSI Protocol.
CO2: Draw the functional block diagram of wide-area networks (WANs), local area networks
(LANs), and Wireless LANs (WLANs) and describe the function of each.
CO3: Identify and connect various connecting components of a computer network.
CO4: Configure DNS DDNS, TELNET, EMAIL, File Transfer Protocol (FTP), WWW, HTTP,
SNMP, Bluetooth, and Firewalls using open-source available software and tools.
CO5: outline various models, topologies and devices of Computer Networks.

TEXT AND REFERENCE BOOKS:

1. Data Communication and Networking, 4th Edition, Behrouz A. Forouzan, McGraw-Hill.
2. Data and Computer Communication, 8th Edition, William Stallings, Pearson Prentice Hall India.
3. Computer Networks, latest Edition, Andrew S. Tanenbaum, Pearson New International Edition.
4. Internetworking with TCP/IP, Volume 1, latest Edition Douglas Comer, Prentice Hall of India.
5. TCP/IP Illustrated, Volume 1, W. Richard Stevens, Addison-Wesley, United States of America.
 COMPUTER NETWORK LAB
Semester V
Course code
Category Professional Core Courses
Course title Computer Networks Lab
Scheme and Credits L T P Credits
3 0 0 3
Classwork 30 Marks
Exam 70 Marks
Total 100 Marks
Duration of Exam 03 Hours

COURSE OBJECTIVE:
Learn basic concepts of computer networking and acquire practical notions of protocols with the
emphasis on TCP/IP. A lab provides a practical approach to Ethernet/Internet networking: networks are
assembled, and experiments are made to understand the layered architecture and how do some important
protocols work
CONTENTS
List of Experiments
To construct a simple network topology on Packet Tracer.
2. To verify and configure VLAN and VLAN trunk in packet tracer.
3. To construct RJ45 cable.
4. a) To configure simple static routing.
b) To implement Security on interconnecting devices.
5. To configure a Network Topology constitutes Routers and Switches using Packet Tracer.
6 Working with complex network topologies.
7. Mid Term Evaluation
8. To monitor network traffic using Wire Shark
9. To get the MAC or Physical Address of the system Using Address Resolution Protocol.
10. To Configure network using Routing Information Protocol (RIP)
11 To configure network state routing protocol (OSPF).
12 To configure Border Gateway Protocol.
13 To configure Application Layer protocols: DHCP and DNS.

COURSE OUTCOMES:
At the end of this course, students will demonstrate the ability to
CO1. Understand the structure and organization of computer networks; including the division into
network layers, role of each layer, and relationships between the layers. ·
CO2. Understand the basic concepts of application layer protocol design; including client/server
models, peer to peer models, and network naming.
CO3. In depth understanding of transport layer concepts for congestion control and flow control.
CO4. Learning protocol design; including connection oriented and connection-less models,
techniques to provide reliable data delivery and algorithms
CO5. Applying and configuring virtual LANS
 THEORY OF COMPUTATION
Semester V
Course code
Category Professional Core Courses
Course title Theory of Computation
Scheme and Credits L T P Credits
3 0 0 3
Classwork 30 Marks
Exam 70 Marks
Total 100 Marks
Duration of Exam 03 Hours
Note: The examiner will set nine questions in total. Question one will be compulsory. Question one will
have seven parts of 2 marks each from all units, and the remaining eight questions of 14 marks each to
be set by taking two questions from each unit. The students have to attempt five questions in total, the
first being compulsory and selecting one from each unit.
COURSE OBJECTIVES:
1. To understand basic concepts of formal languages and automata theory.
2. To study the types of Automata i.e., NFA, DFA, NFA with ϵ-transition and their interconversion
methods and importance.
3. To Study formal languages of different kinds, such as regular and context-free languages. Understand
the concept of grammar and its types. Removal of ambiguity and reduced form and Normal forms of
grammar.
4. To develop the concepts and design of higher-level automata to accept the language not accepted by
finite automata such as PDA &Turing machine.
5. To study the various properties of Turing machines and their design.
COURSE OUTCOMES:
At the end of this course, students will demonstrate the ability to
CO1: Define terminology related to the theory of computation.
CO2: Explain the basic concepts and applications of Theory of Computation.
CO3: Apply the principles of Theory of Computation to solve computational problems.
CO4: Compare and contrast the hierarchy of grammars.
CO5: Design various types of automata for given problems.
CO6: To solve various problems of applying normal form techniques, push-down automata, and
Turing Machines.
UNIT - I
Finite Automata: Introduction: Set, Power Set, Super Set, Alphabet, languages and grammars,
productions and derivation, Deterministic finite automata (DFA), Non-Deterministic finite automata
(NDFA), Equivalence of DFA and NDFA, Conversion of NFA to DFA, minimization of finite automata,
Finite automata with ϵ- moves, Acceptability of a string by a finite Automata.
Introduction to Machines: Properties and limitations of Finite Automata, Mealy and Moore Machines,
Equivalence of Mealy and Moore machines.
UNIT - II
Regular Expression: State and prove Arden’s Method, Regular Expressions, Recursive definition of the
regular expression, Regular expression conversion to Finite Automata, and vice versa.
Properties of regular languages: Regular language, pumping lemma for regular sets/languages, Application of
regular languages.
UNIT - III
Grammars: Chomsky hierarchy of languages, Relation between different types of grammars, Context-
free grammar, Derivation tree / Parse tree, Ambiguity in regular grammar and their removal,
Reduced Forms: Removal of useless symbols, null and unit productions, Normal Form: Chomsky Normal
form (CNF) and Greibach Normal Form (GNF),
Push Down Automata: Introduction to PDA, Deterministic and Non-Deterministic PDA, Design of
PDA: Transition table, Transition diagram and acceptability of strings by designed PDA, Pushdown
automata (PDA) and equivalence with CFG.
UNIT - IV
Turing machines: The basic model for Turing machines I, Deterministic and Non- Deterministic Turing
machines and their equivalence, Design of Turing Machines: Transition table, Transition diagram and
acceptability of strings by a designed Turing machine. Variants of Turing machines, Halting problem of
Turing machine, PCP Problem of Turing Machine, Linear Bounded Automata, TMs as enumerators.
Undecidability: Church-Turing thesis, universal Turing machine, the universal and diagonalization
languages, reduction between languages and Rice s theorem, undecidable problems about languages.
TEXT AND REFERENCE BOOKS:
1. Introduction to Automata Theory, Languages, and Computation, 3nd Edition, John E. Hopcroft, Rajeev
Motwani, Jeffrey D. Ullman, Pearson Education.
2. Introduction to the Theory of Computation, Michael Sipser, 3rd edition, Cengage Learning.
3. K. L. P Mishra, N. Chandrashekaran (2003), Theory of Computer Science-Automata Languages and
Computation, 2nd edition, Prentice Hall of India, India.
4. Raymond Greenlaw, H. James Hoover, Fundamentals of the Theory of Computation, Principles and
Practice, Morgan Kaufmann, 1998.
5. John C. Martin: Introduction to Languages and Automata Theory, 3rd edition, Tata McGraw- Hill,
2007
 NATURAL LANGUAGE PROCESSING
Semester V
Course code
Category Professional Core Courses
Course title Natural Processing Language
Scheme and Credits L T P Credits
3 0 0 3
Classwork 30 Marks
Exam 70 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: The examiner will set nine questions in total. Question one will be compulsory. Question one will
have seven parts of 2 marks each from all units, and the remaining eight questions of 14 marks each to
be set by taking two questions from each unit. The students have to attempt five questions in total, the
first being compulsory and selecting one from each unit.

COURSE OBJECTIVE: The main objective of this course is to give a practical introduction to NLP.
It deals with morphological processing, syntactic parsing, information extraction, probabilistic NLP and
classification of text using Python’s NLTK Library.

COURSE OUTCOMES:
At the end of the course the student will be able to
• Write Python programs to manipulate and analyze language data
• Understand key concepts from NLP and linguistics to describe and analyze language
• Understand the data structures and algorithms that are used in NLP
• Classify texts using machine learning and deep learning
Unit-I
Language Processing and Python: Computing with Language: Texts and Words, A Closer Look at
Python: Texts as Lists of Words, Computing with Language: Simple Statistics, Back to Python: Making
Decisions and Taking Control, Automatic Natural Language Understanding.
Accessing Text Corpora and Lexical Resources:Accessing Text Corpora, Conditional Frequency
Distributions, Lexical Resources, WordNet.
Unit-II
Processing Raw Text: Accessing Text from the Web and from Disk, Strings: Text Processing at the
Lowest Level, Text Processing with Unicode, Regular Expressions for Detecting Word Patterns, Useful
Applications of Regular Expressions, Normalizing Text, Regular Expressions for Tokenizing Text,
Segmentation, Formatting: From Lists to Strings.
Categorizing and Tagging Words: Using a Tagger, Tagged Corpora, Mapping Words to Properties
Using Python Dictionaries, Automatic Tagging, N-Gram Tagging, Transformation-Based Tagging,
How to Determine the Category of a Word.
Unit-III
Learning to Classify Text: Supervised Classification, Evaluation, Naive Bayes Classifiers.
Deep Learning for NLP: Introduction to Deep Learning, Convolutional Neural Networks, Recurrent
Neural Networks, Classifying Text with Deep Learning.
Unit-IV
Extracting Information from Text
Information Extraction, Chunking, Developing and Evaluating Chunkers, Recursion in Linguistic Structure,
Named Entity Recognition, Relation Extraction.
 Analyzing Sentence Structure
Some Grammatical Dilemmas, What’s the Use of Syntax. Context-Free Grammar, Parsing with
Context-Free Grammar.
References:
1. Natural Language Processing with Python. Steven Bird, Ewan Klein, and Edward Lope, O’Reily,
2009
2. Natural Language Processing Recipes: Unlocking Text Data with Machine Learning and Deep
Learning using Python. Akshay Kulkarni, Adarsha Shivananda, Apress, 2019

Suggested Reading:
3. Allen James, Natural Language Understanding, Benjamin/Cumming,1995.
4. Charniack, Eugene, Statistical Language Learning, MIT Press, 1993.
 DATA MINING AND WAREHOUSING
Semester V
Course code
Category Professional Core Courses
Course title Data Mining and Warehousing
Scheme and Credits L T P Credits
3 0 0 3
Classwork 30 Marks
Exam 70 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: The examiner will set nine questions in total. Question one will be compulsory. Question one will
have seven parts of 2 marks each from all units, and the remaining eight questions of 14 marks each to be
set by taking two questions from each unit. The students have to attempt five questions in total, the first
being compulsory and selecting one from each unit.

COURSE OBJECTIVES:
This course is designed to expand students' knowledge and skills gained in Data Mining and
Warehousing courses and look in depth at data warehousing and data mining methods. The course
examines the database architecture and technologies required for solving complex problems of data and
information management, information retrieval, and knowledge discovery facing modern organizations.
Case studies of organizations using these technologies to support business intelligence gathering and
decision making are examined. This course also provides hands-on experience with state-of-the-art data
warehousing and data mining methods and tools.
COURSE OUTCOMES:
After the completion of the course the students will be able
CO1. To understand Concept of Data Mining, Data warehousing and schemas for multidimensional
Databases.
CO2. To understand Basic Statistics in order to apply data mining techniques.
CO3. To analyse the data, identify the problems, and choose the relevant models and algorithms to
apply.
CO4. To combine and consolidate data from various databases scattered throughout a company into
a Datawarehouse.
CO5. To characterize the kinds of patterns that can be discovered by association rule mining,
classification and clustering.
UNIT-I
BASIC STATISTICS:
Statistical descriptions of data: mean, median, mode, Measuring dispersion of data: range, quartiles,
variance, standard deviation, chi-square test, Correlation coefficient and covariance, Regression
analysis.
UNIT-II
DATA PREPROCESSING:
Introduction to Data preprocessing, Need to preprocess the data, Data cleaning: missing values, Data
integration: Redundancy, Data reduction and its strategies, Data transformation and discretization,
Strategies of data transformation.
UNIT-III
INTRODUCTION TO DATA MINING AND ITS ALGORITHMS:
Introduction to Data Mining and algorithms, Processes, Market Basket Analysis, The Apriori Algorithm,
Decision Tree.
INTRODUCTION TO DATA WAREHOUSING AND DATA WRANGLING:
Data Warehouse, Difference between Operational Database systems and Data Warehouse, From Table
and Spreadsheets to Data Cubes, Schemas for Multidimensional Databases: Star, Snowflakes and Fact
Constellations, Data Wrangling, Combining and Merging DataSets, Reshaping and Pivoting, Data
Transformation, String Manipulation, Regular Expressions (Regex)

UNIT-IV
ETL:
ETL Phase 1 Data Wrangling before the Load, ETL Phase 2 Step-by-step guide to uploading data using
SSIS, Handling errors during ETL Phases 1,2, ETL Phase 3 Data Wrangling after the load, Handling
errors during ETL Phase 3, Different types of ETL tools.

TEXT AND REFERENCE BOOKS:

1. Jiawei Han, Micheline Kamber and Jian Pei, “Data Mining Concepts and Techniques”, Third
Edition, Elsevier, 2011.
2. Alex Berson and Stephen J. Smith “Data Warehousing, Data Mining & OLAP”, Tata McGraw
– Hill Edition, Tenth Reprint 2007
3. K.P. Soman, Shyam Diwakar and V. Ajay “Insight into Data mining Theory and Practice”, Easter
Economy Edition, Prentice Hall of India, 2006
4. G. K. Gupta “Introduction to Data Mining with Case Studies”, Easter Economy Edition, Prentice
Hall of India, 2006.
5. Pang-Ning Tan, Michael Steinbach and Vipin Kumar “Introduction to Data Mining”, Pearson
Education, 2007.
 DATA MINING & WAREHOUSING LAB
Semester V
Course code
Category Professional Core Courses
Course title DATA MINING & WAREHOUSING LAB
Scheme and Credits L T P Credits
0 0 2 1
Classwork 50 Marks
Exam 50 Marks
Total 100 Marks
Duration of Exam 02 Hours
COURSE OBJECTIVES:
1. Learn how to build a data warehouse and query it (using open-source tools like Pentaho Data Integration
Tool, Pentaho Business Analytics).
2. Learn to perform data mining tasks using a data mining toolkit (such as open-source WEKA).
3. Understand the data sets and data preprocessing.
4. Demonstrate the working of algorithms for data mining tasks such association rule mining,
classification, clustering and regression.
5. Exercise the data mining techniques with varied input values for different parameters.
6. To obtain Practical Experience Working with all real data sets.

COURSE OUTCOMES:
1. Ability to add mining algorithms as a component to the existing tools
2. Demonstrate the classification, clustering and etc. in large data sets.
3. Ability to apply mining techniques for realistic data.
1 Installation of WEKA Tool
2 Creating new Arff File
3 Pre-Processes Techniques on Data Set 16 Pre-process a given dataset based on Handling Missing Values
4 Generate Association Rules using the Apriori Algorithm
5 Generating association rules using fp growth algorithm
6 Build a Decision Tree by using J48 algorithm
7 Naïve bayes classification on a given data set
8 Applying k-means clustering on a given data set
9 Calculating Information gains measurs
10 OLAP Cube and its different operations
11 Case Study: Create Student. ariff file to suggest better college using Decision tree
12 Case Study: Create [Link] file to identify the students who are eligible for placements using
KNN
 TEXT AND WEB INTELLIGENCE
Semester V
Course code
Category Professional Core Courses
Course title Text and Web Intelligence
Scheme and Credits L T P Credits
3 0 0 3
Classwork 30 Marks
Exam 70 Marks
Total 100 Marks
Duration of Exam 03 Hours
Note: The examiner will set nine questions in total. Question one will be compulsory. Question one will
have seven parts of 2 marks each from all units, and the remaining eight questions of 14 marks each to be
set by taking two questions from each unit. The students have to attempt five questions in total, the first
being compulsory and selecting one from each unit.
COURSE OBJECTIVES:
1. Understand the fundamentals of information retrieval systems and its technologies
2. Process structured and unstructured data
3. Mining text and learning different analyzing techniques
4. Learning different techniques for textual and nontextual data
COURSE OUTCOMES:
At the end of this course, students will demonstrate the ability to
CO1. To understand the concepts of Boolean retrieval utilized in Information retrieval system and
acquire the ability to Process Unstructured Data.
CO2. To get an overview of text mining and analytics with different techniques of finding similarity.
CO3. To comprehend the building and evaluation of Supervised and Unsupervised Categorization
Models.
CO4. To analyse the concepts of opinion and sentiment analysis
CO5. To apply the techniques for joint mining textual and non-textual data.

UNIT - I
INTRODUCTION AND DATA PREPROCESSING:
Introduction to the course, Introduction with example of Information retrieval problem, Boolean
Retrieval (Term Incidence Matrix, Inverted Index, Dictionary-Postings list, Processing Boolean Queries,
Skip Pointers), Preprocessing steps (Tokenization, stop word removal, normalization, stemming,
lemmatization, part of speech tagging), wildcard queries

UNIT - II
OVERVIEW OF TEXT MINING AND ANALYTICS:
Overview of Text Mining and Analytics, Paradigmatic Relation Discovery, syntagmatic relation
discovery, cosine similarity, tf-idf calculation, PLSA, LDA
UNIT - III
SENTIMENT ANALYSIS AND OPINION MINING:
Introduction to Sentiment Analysis, sentiment classification, opinion mining. Python NLTK Sentiment
Analysis, Recommendation Systems and its working
 UNIT - IV
CASCADING AND DIFFUSION IN NETWORKS:
Introduction to web Analytics, Web mining process and techniques- data collection, web scraping,
Ranking Techniques: Page Rank and HITS

TEXT AND REFERENCE BOOKS:

Christopher D. Manning, Prabhakar Raghavan and Hinrich Schutze, Introduction to Information
Retrieval, Cambridge University Press, 2008
Tony Ojeda, Rebecca Bilbro, Benjamin Bengfort, Applied Text Analysis with Python, O’Reilly Media,
June 2018.
Web Analytics for dummies, by Pedro Sostr and Jennifer LeClaire, Wiley Publishing, Inc.
Ashok N. Shrivastva, Mehran Sahami, Text Mining: Classification, Clustering and Applications; CRC
Press, edition 2010.
 TEXT AND WEB INTELLIGENCE LAB
Semester V
Course code
Category Lab Courses
Course title Text and Web Intelligence Lab
Scheme and Credits L T P Credits
0 0 2 1
Classwork 50 Marks
Exam 50 Marks
Total 100 Marks
Duration of Exam 02 Hours

COURSE OUTCOMES:
CO1. Apply the basic concepts of Web mining using NLTK
CO2. Utilizing regular expression to retrieve and mining information
CO3. To understand and apply different stemming and lemmatization techniques
CO4. To capture and contrast different clustering methodologies
CO5. To work on HTML markups

EXPERIMENTS
1. Consider the input string - “Joe waited for the train. The train was late. Mary and Samantha took
the bus. I looked for Mary and Samantha at the bus station.”
• Write a Python NLTK program to split the text sentence/paragraph into a list of words.
• Write a Python NLTK program to create a list of words from a given string. Consider same
input as in the previous question.
• Write a Python NLTK program to split all punctuation into separate tokens.
2. Write a Python NLTK program to tokenize words, sentence wise.
3. Write a Python NLTK program to remove Twitter username handles from a given twitter
text. Consider input string as: "@abcd @pqrsNoSQL introduction - w3resource
[Link] #nosql #database #webdev".
4. Write a Python NLTK program to find parenthesized expressions in a given string and
divide the string into a sequence of substrings.
5. Use PorterStemmer() to perform Stemming on the list. Input = ["program", "programs",
"programer", "programing", "programers"]
6. Apply SnowballStemmer on the previous input.
7. Perform lemmatization on the list. Input = ["program", "programs", "programer", "programing",
"programers"]
8. Write a program to strip away HTML markup with the help of the BeautifulSoup library,
and use regular expressions to remove open and close double brackets and anything in
between them.
9. Write a program to Normalize the data and remove non-ASCII characters from a list of
normalized tokens.
10. Write a program to remove accented characters
 PROFESSIONAL
ELECTIVE COURSE – I
 WIRELESS & MOBILE NETWORKS
Semester V
Course cod
Category Professional Elective Course – I
Course title Advanced wireless & mobile networks
Scheme and Credits L T P Credits
3 0 0 3
Classwork 30 Marks
Exam 70 Marks
Total 100 Marks
Duration of Exam 03 Hours
Note: The examiner will set nine questions in total. Question one will be compulsory. Question one will
have seven parts of 2 marks each from all units, and the remaining eight questions of 14 marks each to be
set by taking two questions from each unit. The students have to attempt five questions in total, the first
being compulsory and selecting one from each unit.
Unit I
Fundamentals of Wireless Communication Technology: Overview and Applications/types of Wireless
and Mobile Networks; Evolution and Challenges of Wireless Networks; The Electromagnetic Spectrum;
Spread Spectrum; Frequency Reuse; Radio Propagation Mechanisms, Signals, Antennas; Characteristics
of Wireless Channels; Modulation Techniques and Multiple Access Techniques for Wireless Systems.
Wireless LANs & PANs: Use and Design Goals for WLANs; IEEE802.11 standard: Architecture,
Infrastructure vs. Ad-hoc Modes, Physical & MAC layer, CSMA/CA mechanism; HIPERLAN 1/2
standards; Technical features of HOMERF; BLUETOOTH specifications and architecture; Introduction
to other PAN technologies and their applications.
Unit II
Wireless WANs & MANs: The Cellular Concept; Call Set-up; Frequency Reuse Channel Allocation
Algorithms; Handoffs; Mobility Management.
Telecommunication Systems: GSM and IS-95 architecture, channels and Call Establishment; Wireless
Data Service; Generations in Wireless Cellular Networks and their features; DECT, TETRA, UMTS;
Satellite Systems.
Unit III
AdHoc Wireless Networks: Introduction; Applications & Design Issues.
MAC Protocols for Ad Hoc Wireless Networks: Issues, design Goals and Classification; Contention
Based Protocols; Contention Based MAC Protocols with Reservation and Scheduling Mechanism; Other
MAC Protocols.
Routing Protocols for Ad Hoc Networks: Introduction, Issues; Classification; Table-Driven Routing
Protocols; On-Demand Routing Protocols; Hybrid Routing Protocols; Routing Protocols with Efficient
Flooding Mechanisms; Hierarchical Routing Protocols.
Unit IV
Multicast Routing in Ad Hoc Networks: Introduction; Issues; Operation of Multicast Routing Protocols;
Classification; Tree-Based Multicast Routing Protocols; Mesh-Based Multicast Routing Protocols;
Energy Efficient Multicasting.
Energy Management in Ad Hoc Wireless Networks: Need and classification of energy management
schemes.
Transport Layer for Ad Hoc Wireless Networks: Introduction and Design Issues; TCP over Ad Hoc
Wireless Networks.
Security Requirements in wireless networks: Issues and challenges; Network Security Attacks; Key
Management; Secure Routing in Ad Hoc Wireless Networks; WEP protocol.
 MOBILE APPLICATIONS DEVELOPMENT FOR AI
Semester V
Course code
Category Professional Elective Courses
Course title Mobile applications development for AI
Scheme and Credits L T P Credits
3 0 0 3
Classwork 30 Marks
Exam 70 Marks
Total 100 Marks
Duration of Exam 03 Hours

Note: The examiner will set nine questions in total. Question one will be compulsory. Question one will
have seven parts of 2 marks each from all units, and the remaining eight questions of 14 marks each to be
set by taking two questions from each unit. The students have to attempt five questions in total, the first
being compulsory and selecting one from each unit.

COURSE OBJECTIVE:
1. Introduce the students with the various “Next Generation Technologies” in the area of
mobile computing
2. Assist students understand the various Mobile operating Systems
3. Explore the findings using Android Technologies
UNIT I
Introduction: Mobile operating system, Operating system structure, Constraints and Restrictions,
Hardware configuration with mobile operating system, Features: Multitasking Scheduling, Memory
Allocation, File System Interface, Keypad Interface, I/O Interface, Protection and Security, Multimedia
features
UNIT II
Introduction to Mobile development IDE's, Introduction to Worklight basics, Optimization, pages and
fragments, Writing a basic program- in Worklight Studio, Client technologies, Client-side debugging,
Creating adapters, Invoking adapters from Worklight Client application, Common Controls, Using Java
in adapters, Programming exercise with Skins, Understanding Apache Cordova.
UNIT III
Understanding Apple iOS development, Android development, Shell Development, Creating Java ME
application, Exploring the Worklight Server, Working with UI frameworks, Authentication, Push
notification, SMS Notifications, Globalization.
UNIT IV
Android: Introduction to Android, Architecture, memory management, communication protocols,
application development methods, deployment. iOS: Introduction to iOS, Architecture, memory
management, communication protocols, application development methods, deployment
COURSE OUTCOMES:
At the end of this course, students will demonstrate the ability to
CO1: Explain the principles and theories of mobile computing technologies.
CO2: Describe infrastructures and technologies of mobile computing technologies.
CO3: List applications in different domains that mobile computing offers to the public, employees,
and businesses.
CO4: Describe the possible future of mobile computing technologies and applications.
CO5: Effectively communicate course work through written and oral presentations

TEXT AND REFERENCE BOOKS:

1. Anubhav Pradhan, Anil V Deshpande, “Mobile Apps Development” Edition:
2. Jeff McWherter, Scott Gowell “Professional Mobile Application Development”, John
Wiley & Sons, 2012.
3. Barry Burd, “Android Application Development All in one for Dummies”, Edition: I
4. Teach Yourself Android Application Development In 24 Hours, Edition: I, Publication: SAMS
5. Neal Goldstein, Tony Bove, “iPhone Application Development All-In-One For
Dummies”, John Wiley & Sons
6. Henry
7. Lee, Eugene Chuvyrov, “Beginning Windows Phone App Development”, Apress, latest
edition.
8. Jochen Schiller,“Mobile Communications”, Addison-Wesley, latest edition
9. Stojmenovic and Cacute, “Handbook of Wireless Networks and Mobile Computing”,
Wiley, 2002, ISBN 0471419028.
 INTRODUCTION TO CLOUD COMPUTING
Semester V
Course cod
Category Professional Elective Course – I
Course title Introduction to Cloud Computing
Scheme and Credits L T P Credits
3 0 0 3
Classwork 30 Marks
Exam 70 Marks
Total 100 Marks
Duration of Exam 03 Hours
Note: The examiner will set nine questions in total. Question one will be compulsory. Question one will
have seven parts of 2 marks each from all units, and the remaining eight questions of 14 marks each to be
set by taking two questions from each unit. The students have to attempt five questions in total, the first
being compulsory and selecting one from each unit.
COURSE OBJECTIVES (CEOS):
To make students familiar with:
2. To provide students with the fundamentals and essentials of Cloud Computing.
3. To provide students a sound foundation of the Cloud Computing so that they are able to start
using and adopting Cloud Computing services and tools in their real life scenarios.
4. To enable students exploring some important cloud computing driven commercial systems and
applications.
5. To expose the students to frontier areas of Cloud Computing and information systems, while
providing sufficient foundations to enable further study and research.
UNIT I
Introduction of Cloud Computing: What is Cloud Computing?, How it works? Cloud Computing
Delivery Models and Services, Ethical issues in Cloud Computing, Cloud Vulnerabilities, Major
Challenges faced by Cloud Computing

UNIT II
Parallel and Distributed Systems:
Parallel and Distributed Systems Introduction, Parallel Computing, Architecture, Distributed Systems,
Communication Protocol and Process Coordination, logical Clocks, Message Delivery Rules,
Concurrency, Atomic Actions, Consensus Protocols, Modeling Concurrency with Petri Nets, Client-
Server Paradigm

UNIT III
Cloud Infrastructure
Cloud Computing at Amazon, Google Perspective, Microsoft Windows Azure and Online Services, Open-
Source Software Platforms for Private clouds, Intercloud, Responsibility Sharing Between User and Cloud
service provider, Cloud Virtualization, Layering, Full Virtualization and Paravirtualization.

UNIT IV
Cloud Computing Services:
Standard Cloud Model, Cloud Deployment Model, Service Delivery Models, Service Abstraction, SPI
Model, Traditional System vs Cloud System Model, All Applications delivered using web services are
not SaaS, SaaS and PaaS: [Link] and [Link], Open Cloud Services.
Course Outcomes (COs): By the completion of the course, the students are able to:
CO1: Identify the Parallel and Distributed computing technologies involved in Cloud.
CO2: Explain the design principles involved in building a Cloud platform over virtualized clusters and
data centers
CO3: Analyze different performance metrics for evaluating Cloud Applications.
CO4: Prepare Cloud based applications that can scale out.
CO5: Apply task and data parallel distributed algorithms for Cloud.

TEXT BOOKS
1. Barrie Sosinsky: "Cloud Computing Bible", Wiley-India, 2010
2. Rajkumar Buyya, James Broberg, Andrzej M. Goscinski: "Cloud Computing: Principles and
Paradigms", Wiley, 2011
3. Nikos Antonopoulos, Lee Gillam: "Cloud Computing: Principles, Systems and Applications",
Springer, 2012
4. Ronald L. Krutz, Russell Dean Vines: "Cloud Security: A Comprehensive Guide to Secure Cloud
Computing", Wiley-India, 2010
5. Tim Mather, Subra Kumara swamy, Shahed Latif, Cloud Security and Privacy: An Enterprise
Perspective on Risks and Compliance, O'Reilly Media, 2009
 DISTRIBUTED DATABASES
Semester V
Course cod
Category Professional Elective Course – I
Course title Distributed Databases
Scheme and Credits L T P Credits
3 0 0 3
Classwork 30 Marks
Exam 70 Marks
Total 100 Marks
Duration of Exam 03 Hours
Note: The examiner will set nine questions in total. Question one will be compulsory. Question one will
have seven parts of 2 marks each from all units, and the remaining eight questions of 14 marks each to be
set by taking two questions from each unit. The students have to attempt five questions in total, the first
being compulsory and selecting one from each unit.
Course Objectives
The educational Objectives of this Course are:
To Introduce various Distributed Database Applications in real world scenario
1.
To be learning more about various Distributed Database Techniques
2.
3. Applying efficient Advanced Techniques to solve engineering problems
Course Outcomes
On successful completion of the course, the student will: Be able to Compare various Distributed Databases
methods Be able to understand and identify the analytical characteristics of Distributed Databases algorithms.
Employ algorithm to model engineering problems, when appropriate.
UNIT I

Introduction: Distributed Data Processing Promises of DDBs Complicating Factors and Problem Areas.
Architecture of distributed systems:Architectural Models for Distributed DBMSs Homogeneous
Heterogeneous Client/server Distributed Databases versus Replicated Databases

UNIT II
Distributed Database Design:Alternative Design Strategies Distribution Design Issues Fragmentation
Allocation.
Concepts of Database links Introduction Types Database Links Creating and Managing Database Links
Restrictions through Database Links Practical Scenarios and examples
UNIT III
Transparencies:Database link name resolution Schema object name resolution Location trans-RPC, creating
location transparencies using views, synonyms and procedures
Transaction processing Concept and Properties of Transactions Remote and Distributed SQL Statements
Shared SQL for Remote and Distributed Statements Remote and Distributed Transactions

UNIT IV

Semantic: Data Control View Management Data Security Semantic Integrity control
Query processing and Query optimization strategies: Distributed Query Processing
Methodology. Distributed Query Optimization. New query optimization techniques in distributed
database. Distributed Query Optimization problems and some solutions. Advantages of query
optimization techniques in distributed database.
Text and REFERENCE BOOKS: 1. Principles of Distributed Database Systems by M. TAMER
OZSU, Patrick Valduriez, S. Sridhar (Pearson Publication)
2. Database system concepts', 6th Edition –Abraham Silberschatz, Henry Korth, S, Sudarshan, (McGraw
Hill International )
3. Distributed Databases by Stefano Ceri, Giuseppe Pelagatti(TMH)
4. Oracle Documentation