Cse Autonomous Syllabus 31 05 24

Kunnam, TK, Sunguvarchatram, Sriperumbudur, Tamil Nadu 631604
ANNA UNIVERSITY, CHENNAI

AUTONOMOUS AFFILIATED COLLEGES
B. Tech. COMPUTER SCIENCE AND ENGINEERING
CHOICE BASED CREDIT SYSTEM
CURRICULUM AND SYLLABI FOR SEMESTERS I TO VIII
I. PROGRAM EDUCATIONAL OBJECTIVES (PEOs)
Graduates can
 Apply their technical competence in computer science to solve real world problems, with
technical and people leadership.
 Conduct cutting edge research and develop solutions on problems of social relevance.
 Work in a business environment, exhibiting team skills, work ethics, adaptability and lifelong
learning.
II. PROGRAM OUTCOMES (POs)
1 Engineering knowledge: Apply the knowledge of mathematics, science, engineering

fundamentals, and an engineering specialization to the solution of complex engineering
problems.
2 Problem analysis: Identify, formulate, review research literature, and analyze complex
engineering problems reaching substantiated conclusions using first principles of mathematics,
natural sciences, and engineering sciences.
3 Design/development of solutions: Design solutions for complex engineering problems and

design system components or processes that meet the specified needs with appropriate
consideration for the public health and safety, and the cultural, societal, and environmental
considerations.
4 Conduct investigations of complex problems: Use research-based knowledge and research

methods including design of experiments, analysis and interpretation of data, and synthesis of
the information to provide valid conclusions.
5 Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern
engineering and IT tools including prediction and modeling to complex engineering activities
with an understanding of the limitations.
6 The engineer and society: Apply reasoning informed by the contextual knowledge to assess
societal, health, safety, legal and cultural issues and the consequent responsibilities relevant to
the professional engineering practice.
7 Environment and sustainability: Understand the impact of the professional engineering

solutions in societal and environmental contexts, and demonstrate the knowledge of, and need
for sustainable development.
8 Ethics: Apply ethical principles and commit to professional ethics and responsibilities and
norms of the engineering practice.
9 Individual and team work: Function effectively as an individual, and as a member or leader
in diverse teams, and in multidisciplinary settings.
10 Communication: Communicate effectively on complex engineering activities with the

engineering community and with society at large, such as, being able to comprehend and write
effective reports and design documentation, make effective presentations, and give and receive
clear instructions.
11 Project management and finance: Demonstrate knowledge and understanding of the

engineering and management principles and apply these to one’s own work, as a member and
leader in a team, to manage projects and in multidisciplinary environments.
12 Life-long learning: Recognize the need for, and have the preparation and ability to engage
in independent and life-long learning in the broadest context of technological change.
III. PROGRAM SPECIFIC OUTCOMES (PSOs)
The Students will be able to
 Exhibit design and programming skills to build and automate business solutions using cutting
edge technologies.
 Strong theoretical foundation leading to excellence and excitement towards research, to

provide elegant solutions to complex problems.
 Ability to work effectively with various engineering fields as a team to design, build and
develop system applications.
COURSE STRUCTURE (R24 REGULATION)
(L:Lecture, T:Tutorial, P:Practical, C:Credit,
CIE:Continuous Internal Evaluation, SEE:Semester End Examination)
I YEAR I SEMESTER
S.No Course Course Title CAT L T P C CIE SEE Total

Code
1 Linear Algebra and BS 3 1 0 4 40 60 100
Calculus
2 Computational Physics BS 3 0 0 3 40 60 100
3 Programming Principles ES 3 1 0 4 40 60 100
and Coding Techniques
using Python
4 Computational Physics BS 0 0 4 2 60 40 100
Lab
5 Coding Techniques using ES 0 0 4 2 60 40 100
Python Lab
6 Communication Skills and HS 0 0 4 2 60 40 100
Technical Writing
7 Employment MC 0 0 4 0 60 40 100
Enhancement Skills
8 Professional Ethics & Human MC 0 0 2 0 60 40 100
Values
TOTAL 17 420 380 800
I YEAR II SEMESTER

Code
1 Principles of Electrical ES 3 0 0 3 40 60 100
and Electronics
Engineering
2 Introduction to Data BS 3 1 0 4 40 60 100
Science for
Engineers(MOOCs)
3 Discrete Mathematics BS 3 1 0 4 40 60 100
4 Introduction to ES 2 0 2 3 40 60 100
Virtualization and Cloud
Computing
5 Electrical and Electronics ES 0 0 4 2 60 40 100
Engineering Lab
6 Introduction to ES 0 0 4 2 60 40 100
Virtualization and Cloud
Computing Lab
7 Yoga and Happy Living MC 2 0 0 0 60 40 100
8 Indian Constitution M 2 0 0 0 60 40 100
C
TOTAL 18 400 400 800
II YEAR I SEMESTER

Code
1 Data structures and PC 3 0 0 3 40 60 100
Analysis of Algorithms
2 Object Oriented PC 3 0 0 3 40 60 100
Programming
3 Probability and Statistics ES 3 1 0 4 40 60 100
for Computer Science
4 Business Economics and HS 3 0 0 3 60 40 100
Financial Analysis
5 Data structures and PC 0 0 4 2 60 40 100
Analysis of Algorithms
Lab
6 Object Oriented PC 0 0 4 2 60 40 100
Programming Lab
7 Soft Skills I MC 3 0 0 0 60 40 100
TOTAL 17 340 360 700
II YEAR II SEMESTER

Code
1 Database Management PC 3 0 0 3 40 60 100
System
2 Operating system PC 3 0 0 3 40 60 100
3 Computer Networks PC 3 0 0 3 40 60 100
4 Environmental BS 3 0 0 2 40 60 100
Engineering and
Sustainability
5 Professional Elective 1 PE 3 0 0 3 40 60 100
6 Databases Lab PC 0 0 4 2 60 40 100
7 Operating system Lab PC - - 4 2 60 40 100
8 Soft Skills II MC 2 0 0 0 60 40 100

TOTAL 18 340 360 800
III YEAR I SEMESTER

Code
1 Computational Theory PC 3 0 2 4 40 60 100
and Compiler Design
2 Web Technologies PC 3 0 0 3 40 60 100
3 Professional Elective 2 PE 3 - - 3 40 60 100
4 Open Elective 1 OE 3 - - 3 40 60 100
5 Web Technologies Lab PC 0 0 4 2 60 40 100
6 Summer Internship PW - - 4 2 - 100 100
TOTAL 17 280 420 700
III YEAR II SEMESTER

Code
1 Artificial Intelligence PC 3 - 0 3 40 60 100
2 Software Engineering and PC 3 - 2 4 40 60 100
Quality Assurance
5 Artificial Intelligence Lab PC - - 4 2 60 40 100
6 Seminar PW 0 0 2 1 - 100 100
7 Mini Project PW 0 0 4 2 40 60 100
TOTAL 18 260 440 700
IV YEAR I SEMESTER

Code
1 Computer Vision and PC 3 - - 3 40 60 100
Augmented Reality
3 Open Elective 2 OE 3 0 0 3 40 60 100
4 Computer Vision and PC - - 4 2 60 40 100
Augmented Reality Lab
5 Major Project I PW 0 0 12 6 40 60 100
TOTAL 17 220 280 500

IV YEAR II SEMESTER

Code
1 Major Project II PW 0 0 24 12 40 60 100
TOTAL 18 120 180 300
Professional electives
Five Domains (Area of Specializations) are identified for Professional Electives

Artificial Intelligence and Virtual Reality
Data Science and Data Centric Computation
Data Retrieval Techniques
Data Security
Cognitive Science and Neuro computing
SEMESTER PE CODE COURSE
II-II PE1 Advanced Data Structures
Internet of Things
Parallel Computing
Network Security
Human Computer Interaction
III- I PE2 Graph Theory
Web and Cloud Services
Data Analytics
Cryptography
Computational Neuroscience
III-I PE3 Mobile Application Development
Ecommerce
Big Data Technology
Cyber security
Machine Learning
III-I PE4 Network Programming
Fog and Edge Computing
Multimedia
Ethical Hacking
Deep Learning
IV- I PE5 React Js
Block Chain Technology
Data Mining and Data warehousing
Digital Forensic
Natural Language Processing
IV-II PE6 NoSQL Databases
Quantum Computing
Information Retrieval System
Information Security Management
Nature Inspired Optimization

Technique
IV- II PE7 Open Source Software
Super Computing
Data Visualization Techniques
Bioinformatics
Reinforcement Learning
I YEAR I SEMESTER
PROGRAMMING PRINCIPLES AND CODING TECHNIQUES USING PYTHON L T P C

3 1 0 4
COURSE OBJECTIVES :
● To understand the basics of algorithmic problem solving.
● To learn to solve problems using Python conditionals and loops.
● To define Python functions and use function calls to solve problems.
● To use Python data structures - lists, tuples, dictionaries to represent complex data.
● To do input/output with files in Python.
UNIT I BASICS OF PYTHON PROGRAMMING 9

Overview of programming language- Python history-Interactive mode – script mode-
Tokens: Literal-Keyword-Delimiter-Identifier-Data types: Integer-Floating-Complex-
Boolean-String-Indentation-Input operation-Comments
UNIT II CONTROL STRUCTURE, OPERATORS AND FUNCTIONS 9

Statements: if, if-else, nested if, if –elif - Iterative statements: while, for, Nested loops, else
in loops, break, continue and pass statements. Operators: Arithmetic-Membership-Identity-
Bitwise Functions: Types, parameters, arguments: positional arguments, keyword
arguments, parameters with default values, functions with arbitrary arguments, Scope of
variables: Local and global scope, Recursion
UNIT III COLLECTIONS, STRINGS AND REGULAR EXPRESSIONS 9

List: Create Access, Negative Indices, Slicing, Splitting, List Methods, and comprehensions
Tuples: Create, Indexing and Slicing, Operations on tuples. Dictionary: Create, add,
traversing and replace values, operations on dictionaries. Sets: Create and operations on set.
Strings: Formatting, Comparison, Slicing, Splitting, Stripping, Negative indices, String
functions. Regular expression: Matching the patterns, Search and replace
UNIT IV FILE HANDLING AND EXCEPTIONS 9

Files: Open, Read, Write, Append, Tell, Seek and Close. Errors and Exceptions: Syntax
Errors, Exceptions, Handling Exceptions, Raising Exceptions, Exception Chaining, User
defined Exceptions, Defining Clean-Up actions.
UNIT V NUMPY, PANDAS, MATPLOTLIB 9

Introduction - Basics of NumPy - N-dimensional Array in NumPy – Methods and Properties
- Basics of SciPy - Broadcasting in NumPy Array Operations - Array Indexing in NumPy,
Pandas - Introduction - Series - DataFrame - Matplotlib - Basics - Figures and Axes -
Method subplot() - Axis container
TOTAL: 45 PERIODS
COURSE OUTCOMES: Upon completion of the course, students will be able to

CO1: Develop algorithmic solutions to simple computational problems.
CO2: Develop and execute simple Python programs.
CO3: Write simple Python programs using conditionals and loops for solving problems.
CO4: Decompose a Python program into functions.
CO5: Represent compound data using Python lists, tuples, dictionaries etc.
CO6: Read and write data from/to files in Python programs.
TEXT BOOKS:
1. Ashok Namdev Kamthane, Amit Ashok Kamthane “Programming and Problem Solving
with Python” , 2nd edition , Mc Graw Hill
2. Dr,R,Nageswara Rao, “Core Python Programming”,3rd edition, Deamtech Publisher.
REFERENCE BOOKS:
1. Paul Dietel, Harvey Deitel, “ Python for Programmers”, Pearson
2. Reema Thareja,” Problem Solving and programming with Python, Oxford University
Press.
CO’s-PO’s & PSO’s MAPPING
C O P O P S O
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 2 1 2 3 1 2 2 2 2 3 2 3 3 3
2 2 2 2 3 3 2 2 2 2 2 3 2 3 3 3
3 2 3 2 1 3 2 2 3 2 1 2 2 3 3 3
4 1 2 2 2 3 2 2 1 2 3 2 3 3 3 3
5 3 1 3 2 3 3 2 2 2 2 3 3 3 3 3
AVG 2 2 2 2 3 2 2 2 2 2 3 2 3 3 3
CODING TECHNIQUES USING PYTHON LABORATORY LTPC

0 04 2
COURSE OBJECTIVES:
 To understand the problem solving approaches.
 To learn the basic programming constructs in Python.
 To practice various computing strategies for Python-based solutions to real world problems.
 To use Python data structures - lists, tuples, dictionaries.
 To do input/output with files in Python.
1. Identification and solving of simple real life or scientific or technical problems, and
developing flow charts for the same. (Electricity Billing, Retail shop billing, Sin
series, weight of a motorbike, Weight of a steel bar, compute Electrical Current in
Three Phase AC Circuit, etc.)
2. Python programming using simple statements and expressions (exchange the values
of two variables, circulate the values of n variables, distance between two points).
3. Scientific problems using Conditionals and Iterative loops. (Number series, Number
Patterns, pyramid pattern)
4. Implementing real-time/technical applications using Lists, Tuples. (Items present in
a library/Components of a car/ Materials required for construction of a building –
operations of list & tuples)
5. Implementing real-time/technical applications using Sets, Dictionaries. (Language,
components of an automobile, Elements of a civil structure, etc.- operations of Sets
& Dictionaries)
6. Implementing programs using Functions. (Factorial, largest number in a list, area of
shape)
7. Implementing programs using Strings. (reverse, palindrome, character count,
replacing characters)
8. Implementing programs using written modules and Python Standard Libraries
(pandas, numpy. Matplotlib, scipy)
9. Implementing real-time/technical applications using File handling. (copy from one
file to another, word count, longest word)
10. Implementing real-time/technical applications using Exception handling. (divide by
zero error, voter’s age validity, student mark range validation)
11. Exploring Pygame tool. 12. Developing a game activity using Pygame like bouncing
ball, car race etc.
TOTAL: 45 PERIODS
COURSE OUTCOMES: On completion of the course, students will be able to:

CO1: Develop algorithmic solutions to simple computational problems
CO2: Develop and execute simple Python programs.
CO3: Implement programs in Python using conditionals and loops for solving problems.
CO4: Deploy functions to decompose a Python program.
CO5: Process compound data using Python data structures.
CO6: Utilize Python packages in developing software applications.
TEXT BOOKS:
1. Ashok Namdev Kamthane, Amit Ashok Kamthane “Programming and Problem
Solving with Python” , 2nd edition , Mc Graw Hill
2. Dr,R,Nageswara Rao, “Core Python Programming”,3rd edition, Deamtech
Publisher.
REFERENCE BOOKS:
1. Paul Dietel, Harvey Deitel, “ Python for Programmers”, Pearson
2. Reema Thareja,” Problem Solving and programming with Python, Oxford
University Press.
C O P O P S O
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 2 1 2 3 1 2 2 2 2 3 2 3 3 3
2 2 2 2 3 3 2 2 2 2 2 3 2 3 3 3
3 2 3 2 1 3 2 2 3 2 1 2 2 3 3 3
4 1 2 2 2 3 2 2 1 2 3 2 3 3 3 3
5 3 1 3 2 3 3 2 2 2 2 3 3 3 3 3
AVG 2 2 2 2 3 2 2 2 2 2 3 2 3 3 3
I YEAR II SEMESTER
INTRODUCTION TO VIRTUALIZATION AND CLOUD COMPUTING LTPC
300 3
COURSE OBJECTIVES:
 To understand the principles of cloud architecture, models and infrastructure.
 To understand the concepts of virtualization and virtual machines.
 To gain knowledge about virtualization Infrastructure.
 To explore and experiment with various Cloud deployment environments.
 To learn about the security issues in the cloud environment.
UNIT I INTRODUCTION 9
Introduction to cloud computing - Definition of cloud – Scalable Computing over the Internet –
System Models for Distributed and Cloud Computing – NIST Cloud Computing – Architectural
Design of Compute and storage clouds - Cloud Characteristics.
UNIT II VIRTUALIZATION BASICS 9

Basics of Virtualization - Virtualization Types – Hypervisor - Structures of Virtualization –
Implementation Levels of Virtualization – Virtualization of CPU, Memory and I/O Devices –
Virtualization for Data- Center Automation.
UNIT III CLOUD ENABLING TECHNOLOGIES AND RESOURCE MANAGEMENT 9

Layered Architectural Design - Cloud Deployment Model – Cloud Service Model – Intercloud
Resource Management – Virtual Clusters and Resource Management – Architectural Design
Challenges - Cloud Storage - Storage-as-a-Service – Advantages of Cloud Storage - Cloud Storage
Providers - S3.
UNIT IV CLOUD SOFTWARE ENVIRONMENTS 9

Public Cloud Platforms: Google App Engine – Amazon Web Service – Microsoft Azure -
Programming Support of GAE – Emerging Cloud Software Environments – Introduction to Docker –
Components of Docker – Docker Container – Docker Image and Repositories.
UNIT V CLOUD SECURITY AND APPLICATIONS 9

Hadoop – MapReduce –Virtual Box –Openstack - Eucalyptus - Federation in the Cloud - Four
Levels of Federation – Migration of Cloud – Cloud Security - Virtual Machine Security – IAM
Security Standards.
TOTAL: 45 PERIODS
COURSE OUTCOMES:
CO1: Understand the design challenges in the cloud.
CO2: Apply the concept of virtualization and its types.
CO3: Experiment with virtualization of hardware resources.
CO4: Develop and deploy services on the cloud and set up a cloud environment.
CO5: Explain security challenges in the cloud environment.
TEXT BOOKS
1. Kai Hwang, Geoffrey C. Fox, Jack G. Dongarra, "Distributed and Cloud Computing, From
Parallel Processing to the Internet of Things, Morgan Kaufmann Publishers, 2012.
2. Mastering Cloud Computing Foundations and Applications Programming Rajkumar Buyya,
Christian Vechhiola, S. Thamarai Selvi
REFERENCES
1. Cloud Computing: Concepts, Technology & Architecture by Thomas Erl, Ricardo Puttini,
Zaigham Mohammad 2013
2. Krutz, R. L., Vines, R. D, “Cloud security. A Comprehensive Guide to Secure Cloud
Computing”, Wiley Publishing, 2010.
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 2 3 1 - - - 2 3 1 2 3 3 3
2 2 2 2 3 3 - - - 1 2 2 3 1 1 3
3 3 3 3 3 3 - - - 2 1 1 2 2 1 3
4 3 3 1 1 1 - - - 1 3 1 3 2 1 1
5 3 2 2 2 3 - - - 2 3 2 2 2 3 3
AVG 2.8 2.4 2 2.4 2.2 - - - 1.6 2.4 1.4 2.4 2 1.8 2.6
VIRTUALIZATION AND CLOUD COMPUTING LAB LTP C

0 0 3 2
COURSE OBJECTIVES:
 To learn the basics and types of Virtualization
 To understand the Hypervisors and its types
 To Explore the Virtualization Solutions
 To Experiment the virtualization platforms
PRACTICAL EXERCISES
1. Create type 2 virtualization in VMWARE or any equivalent Open Source Tool. Allocate
memory and storage space as per requirement. Install Guest OS on that VMWARE.
2. Find a procedure for the following
a. Shrink and extend virtual disk
b. Create, Manage, Configure and schedule snapshots
c. Create Spanned, Mirrored and Striped volume
d. Create RAID 5 volume
3. Desktop Virtualization using VNC and Chrome Remote Desktop
4. Create type 2 virtualization on ESXI 6.5 server
5. Create a VLAN in CISCO packet tracer
6. Install KVM in Linux
7. Create Nested Virtual Machine(VM under another VM)
8. Install a C compiler in the virtual machine created using a virtual box and execute Simple
Programs
9. Install Google App Engine. Create a hello world app and other simple web applications using
python/java.
10. Find a procedure to transfer the files from one virtual machine to another virtual machine.
TOTAL : 30 PERIODS
COURSE OUTCOMES:
CO1: Analyze the virtualization concepts and Hypervisor
CO2: Apply the Virtualization for real-world applications
CO3: Install & Configure the different VM platforms
CO4: Experiment with the VM with various software
TEXT BOOKS
Parallel Processing to the Internet of Things, Morgan Kaufmann Publishers, 2012.
2. Mastering Cloud Computing Foundations and Applications Programming Rajkumar Buyya,
Christian Vechhiola, S. Thamarai Selvi
REFERENCES
1. Cloud Computing: Concepts, Technology & Architecture by Thomas Erl, Ricardo Puttini,
Zaigham Mohammad 2013
2. Krutz, R. L., Vines, R. D, “Cloud security. A Comprehensive Guide to Secure Cloud
Computing”, Wiley Publishing, 2010.
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 2 3 1 - - - 2 3 1 2 3 3 3
2 2 2 2 3 3 - - - 1 2 2 3 1 1 3
3 3 3 3 3 3 - - - 2 1 1 2 2 1 3
4 3 3 1 1 1 - - - 1 3 1 3 2 1 1
5 3 2 2 2 3 - - - 2 3 2 2 2 3 3
AVG 2.8 2.4 2 2.4 2.2 - - - 1.6 2.4 1.4 2.4 2 1.8 2.6
II YEAR I SEMESTER
DATA STRUCTURES AND ANALYSIS OF ALGORITHMS L T P C

3 0 0 3
COURSE OBJECTIVES
 To understand concepts of linked list, searching and sorting techniques.
 To implement basic concepts of stacks and queues.
 To develop the ability to solve problems by choosing and applying the right data structures.
 To gain knowledge of the foundational mathematics needed to analyse algorithms and solve
recurrence equations.
 To understand and apply the design strategies to real world problems.
UNIT 1 INTRODUCTION TO DATA STRUCTURES AND ALGORITHMS 9
Introduction to Data Structures - Need - Classification-Arrays - Singly linked list - Representation of
a linked list in memory - Operations on a singly linked list - Circular linked list - Doubly linked list.
Fundamentals of Algorithmic Problem Solving - Time Complexity - Space complexity with
examples - Growth of Functions - Asymptotic Notations and its properties - Complexity Analysis
Examples - Performance measurement - Instance Size, Test Data, Experimental setup
UNIT 2 STACK AND QUEUES 9

Basic Stack Operations - Representation of a Stack using Arrays - Algorithm for Stack Operations -
Infix to postfix Transformation - Evaluating Arithmetic Expressions.Basic Queue Operations -
Representation of a Queue using array - Enqueue - Dequeue - Circular Queues - Priority Queues.
Solving Recurrence Equations - Substitution Method - Recursion Tree Method - Master Method -
Sorting in Linear Time - Lower bounds for Sorting: Counting Sort
UNIT 3 TREES AND GRAPHS 9

Trees- Binary Trees - Properties of Binary trees -Implementation using Array and Linked list -
Recursive and Non-Recursive Binary Tree traversals - Binary Search Tree - Insertion and Deletion.
Graph - Representation using Array and Linked List - Types of graphs - Graph traversals - BFS and
DFS -Minimum Spanning Tree - Kruskal‘s, Prim‘s Algorithm - Shortest path using Dijkstra‘s,
Bellman Ford and Floyd Warshall Algorithm.
UNIT 4 ALGORITHM DESIGN TECHNIQUES 9

Divide and Conquer methodology: Finding maximum and minimum - Merge sort - Quick sort ,
Binary Search: Dynamic programming: Elements of dynamic programming - Multi stage graph —
Optimal Binary Search Trees. Greedy Technique: Elements of the greedy strategy - Activity-
selection problem –- Optimal Merge pattern — Huffman Trees.
UNIT 5 STATE SPACE SEARCH ALGORITHMS 9

Backtracking: n-Queens problem - Hamiltonian Circuit Problem - Subset Sum Problem – Graph
colouring problem Branch and Bound: Solving 15-Puzzle problem - Assignment problem - Knapsack
Problem - Travelling Salesman Problem- Polynomial time algorithms - NP Complete Problems.
TOTAL : 45 PERIODS
COURSE OUTCOMES.
CO1 - Comprehend the concepts of data structures and analyze the efficiency of an algorithm based
on time and space complexity.
CO2 - Design applications of linear data structures and apply appropriate algorithms for solving
problems like sorting and searching.
CO3 - Demonstrate the representation and traversal techniques of graphs and their applications
CO4 - Design a solution by using branch and bound, backtracking techniques and implement the
various non-linear data structures and perform the intended operations.
CO5 - Utilize the state space tree method for solving problems.
TEXT BOOKS
1. Anany Levitin, ―Introduction to the Design and Analysis of Algorithms‖, 3rd Edition,
Pearson Education, 2012.
2. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, ―Fundamentals of Computer
Algorithms‖, 2nd Edition, Universities Press, 2007.
3. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein,
―Introduction to Algorithms‖, 4th Edition, MIT Press, 2022.
REFERENCES
1. Goodrich MT, Tamassia R, Goldwasser MH., ― Data structures and Algorithms in Python‖,
John Wiley and Sons Ltd; 2013.
2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, ―Data Structures and Algorithms
David E. Goldberg, ―Genetic Algorithm In Search Optimization And Machine Learning‖
Pearson Education India, 2013
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 1 - - 2 2 3 1 2 2 2 2 3 3 3
2 3 2 - - 3 3 3 1 2 2 2 2 3 3 3
3 3 - 1 - 2 2 2 1 2 2 2 2 3 3 3
4 3 2 1 1 2 2 2 1 2 2 2 2 3 3 3
5 3 2 1 - 2 2 2 1 2 2 2 1 3 3 3
AVG 2.8 1.8 1 1 - 2.2 2.4 2 2 2 2 1.8 3 3 3
OBJECT ORIENTED PROGRAMMING LTPC

3 0 03
COURSE OBJECTIVES:
 To understand Object Oriented Programming concepts and basics of Java programming
language
 To know the principles of packages, inheritance and interfaces
 To develop a java application with threads and generics classes
 To define exceptions and use I/O streams
 To design and build Graphical User Interface Application using JAVAFX
UNIT I INTRODUCTION TO OOP AND JAVA 9
Overview of OOP – Object oriented programming paradigms – Features of Object Oriented
Programming – Java Buzzwords – Overview of Java – Data Types, Variables and Arrays –
Operators – Control Statements – Programming Structures in Java – Defining classes in Java –
Constructors-Methods -Access specifiers - Static members- Java Doc comments
UNIT II INHERITANCE, PACKAGES AND INTERFACES 9

Overloading Methods – Objects as Parameters – Returning Objects –Static, Nested and Inner
Classes. Inheritance: Basics– Types of Inheritance -Super keyword -Method Overriding –
Dynamic Method Dispatch –Abstract Classes – final with Inheritance. Packages and Interfaces:
Packages – Packages and Member Access –Importing Packages – Interfaces.
UNIT III EXCEPTION HANDLING AND MULTITHREADING 9

Exception Handling basics – Multiple catch Clauses – Nested try Statements – Java’s Built-in
Exceptions – User defined Exception. Multithreaded Programming: Java Thread Model–
Creating a Thread and Multiple Threads – Priorities – Synchronization – Inter Thread
Communication Suspending –Resuming, and Stopping Threads –Multithreading. Wrappers –
Auto boxing.
UNIT IV I/O, GENERICS, STRING HANDLING 9

I/O Basics – Reading and Writing Console I/O – Reading and Writing Files. Generics: Generic
Programming – Generic classes – Generic Methods – Bounded Types – Restrictions and
Limitations. Strings: Basic String class, methods and String Buffer Class.
UNIT V JAVAFX EVENT HANDLING, CONTROLS AND COMPONENTS 9

JAVAFX Events and Controls: Event Basics – Handling Key and Mouse Events. Controls:
Checkbox, ToggleButton – RadioButtons – ListView – ComboBox – ChoiceBox – Text Controls
– ScrollPane. Layouts – FlowPane – HBox and VBox – BorderPane – StackPane – GridPane.
Menus – Basics – Menu – Menu bars – MenuItem.
COURSE OUTCOMES: On completion of this course, the students will be able to

CO1:Apply the concepts of classes and objects to solve simple problems
CO2:Develop programs using inheritance, packages and interfaces
CO3:Make use of exception handling mechanisms and multithreaded model to solve real world
problems
CO4:Build Java applications with I/O packages, string classes, Collections and generics concepts
CO5:Integrate the concepts of event handling and JavaFX components and controls for
developing GUI based applications
TOTAL:45 PERIODS
TEXT BOOKS
1. Herbert Schildt, “Java: The Complete Reference”, 11 th Edition, McGraw Hill Education,
New Delhi, 2019
2. Herbert Schildt, “Introducing JavaFX 8 Programming”, 1 st Edition, McGraw Hill Education,
New Delhi, 2015
REFERENCES
1. Cay S. Horstmann, “Core Java Fundamentals”, Volume 1, 11 th Edition, Prentice Hall, 2018.
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 1 - - 2 2 3 1 2 2 2 2 3 3 3
2 3 2 - - 3 3 3 1 2 2 2 2 3 3 3
3 3 - 1 - 2 2 2 1 2 2 2 2 3 3 3
4 3 2 1 1 2 2 2 1 2 2 2 2 3 3 3
5 3 2 1 - 2 2 2 1 2 2 2 1 3 3 3
AVG 2.8 1.8 1 1 - 2.2 2.4 2 2 2 2 1.8 3 3 3
DATA STRUCTURES AND ALGORITHMS LABORATORY L T P C

0 0 3 2
COURSE OBJECTIVES:
 To demonstrate array implementation of linear data structure algorithms.

 To demonstrate linked list implementation of linear data structure algorithms
 To understand and apply the algorithm analysis techniques on searching and sorting
algorithms
 To critically analyze the efficiency of graph algorithms
 To understand different algorithm design techniques
LIST OF EXPERIMENTS
1. Implement Linear Search and recursive Binary Search. Determine the time required to search
for an element. Repeat the experiment for different values of n, the number of elements in the
list to be searched and plot a graph of the time taken versus n.
2. Given a text txt [0...n-1] and a pattern pat [0...m-1], write a function search (char pat [ ], char
txt [ ]) that prints all occurrences of pat [ ] in txt [ ]. You may assume that n > m.
3. Sort a given set of elements using the Insertion sort and Heap sort methods and determine the
time required to sort the elements. Repeat the experiment for different values of n, the number
of elements in the list to be sorted and plot a graph of the time taken versus n.
4. Develop a program to implement graph traversal using Breadth First Search and Depth First
Search
5. From a given vertex in a weighted connected graph, develop a program to find the shortest
paths to other vertices using Dijkstra’s algorithm.
6. Find the minimum cost spanning tree of a given undirected graph using Prim’s algorithm. 5.
Implement Floyd’s algorithm for the All-Pairs- Shortest-Paths problem.
7. Develop a program to find out the maximum and minimum numbers in a given list of n
numbers using the divide and conquer technique.
8. Implement Merge sort and Quick sort methods to sort an array of elements and determine the
time required to sort. Repeat the experiment for different values of n, the number of elements
in the list to be sorted and plot a graph of the time taken versus n.
COURSE OUTCOMES: At the end of this course, the students will be able to:
CO1: Implement Linear data structure algorithms using arrays and Linked lists
CO2: Analyze the efficiency of algorithms using various frameworks
CO3: Analyze the various searching and sorting algorithms.
CO4: Apply graph algorithms to solve problems and analyze their efficiency.
CO5: Make use of algorithm design techniques like divide and conquer, dynamic programming and
greedy techniques to solve problems
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 1 - - 2 2 3 1 2 2 2 2 3 3 3
2 3 2 - - 3 3 3 1 2 2 2 2 3 3 3
3 3 - 1 - 2 2 2 1 2 2 2 2 3 3 3
4 3 2 1 1 2 2 2 1 2 2 2 2 3 3 3
5 3 2 1 - 2 2 2 1 2 2 2 1 3 3 3
AVG 2.8 1.8 1 1 - 2.2 2.4 2 2 2 2 1.8 3 3 3
OBJECT ORIENTED PROGRAMMING LABORATORY L T PC
0 0 3 2
COURSE OBJECTIVES
 To build software development skills using java programming for real-world applications.
 To understand and apply the concepts of classes, packages, interfaces, inheritance, exception
handling and file processing.
 To develop applications using generic programming and event handling
LIST OF EXPERIMENTS
1. Solve problems by using sequential search, binary search, and quadratic sorting algorithms
(selection, insertion)
2. Develop stack and queue data structures using classes and objects.
3. Develop a java application with an Employee class and Generate pay slips for the employees
with their gross and net salary.
4. Write a Java Program to create an abstract class named Shape that contains two integers and
an empty method named printArea(). Each one of the classes contains only the method
printArea( ) that prints the area of the given shape.
5. Solve the above problem using an interface.
6. Implement exception handling and creation of user defined exceptions.
7. Write a java program that implements a multi-threaded application that has three threads. First
thread generates a random integer every 1 second and if the value is even, the second thread
computes the square of the number and prints. If the value is odd, the third thread will print the
value of the cube of the number.
8. Write a program to perform file operations.
9. Develop applications to demonstrate the features of generics classes.
10. Develop applications using JavaFX controls, layouts and menus.
11. Develop a mini project for any application using Java concepts.
TOTAL: 45 PERIODS
COURSE OUTCOMES: On completion of this course, the students will be able to
CO1 : Design and develop java programs using object oriented programming concepts
CO2 : Develop simple applications using object oriented concepts such as package, exceptions
CO3: Implement multithreading, and generics concepts
CO4 : Create GUIs and event driven programming applications for real world problems
CO5: Implement and deploy web applications using Java
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 1 - - 2 2 3 1 2 2 2 2 3 3 3
2 3 2 - - 3 3 3 1 2 2 2 2 3 3 3
3 3 - 1 - 2 2 2 1 2 2 2 2 3 3 3
4 3 2 1 1 2 2 2 1 2 2 2 2 3 3 3
5 3 2 1 - 2 2 2 1 2 2 2 1 3 3 3
AVG 2.8 1.8 1 1 - 2.2 2.4 2 2 2 2 1.8 3 3 3
BUSINESS ECONOMICS AND FINANCIAL ANALYSIS L T PC
0 0 3 2
UNIT – I: - Introduction to Business and Economics: Business: Structure of Business Firm, Theory
of Firm, Types of Business Entities, Limited Liability Companies, Sources of Capital for a Company,
Non-Conventional Sources of Finance. Economics: Significance of Economics, Micro and Macro
Economic Concepts, Concepts and Importance of National Income, Inflation, Money Supply in
Inflation, Business Cycle, Features and Phases of Business Cycle. Nature and Scope of Business
Economics, Role of Business Economist, Multidisciplinary nature of Business Economics.
UNIT – II: - Demand and Supply Analysis: Elasticity of Demand: Elasticity, Types of Elasticity,
Law of Demand, Measurement and Significance of Elasticity of Demand, Factors affecting Elasticity
of Demand, Elasticity of Demand in decision making, Demand Forecasting: Characteristics of Good
Demand Forecasting, Steps in Demand Forecasting, Methods of Demand Forecasting. Supply
Analysis: Determinants of Supply, Supply Function & Law of Supply.
UNIT- III: - Production, Cost, and Market Structures & Pricing: Production Analysis: Factors of
Production, Production Function, Production Function with one variable input, two variable inputs,
Returns to Scale, Different Types of Production Functions. Cost analysis: Types of Costs, Short run
and Long run Cost Functions. Market Structures: Nature of Competition, Features of Perfect
competition, Monopoly, Oligopoly, and Monopolistic Competition. Pricing: Types of Pricing,
Product Life Cycle based Pricing, Break Even Analysis, & Cost Volume Profit Analysis.
UNIT – IV:- Financial Accounting: Accounting concepts and Conventions, Accounting Equation,
Double-Entry system of Accounting, Rules for maintaining Books of Accounts, Journal, Posting to
Ledger, Preparation of Trial Balance, Elements of Financial Statements, and Preparation of Final
Accounts.
UNIT – V:- Financial Analysis through Ratios: Concept of Ratio Analysis, Liquidity Ratios,
Turnover Ratios, Profitability Ratios, Proprietary Ratios, Solvency, Leverage Ratios (simple
problems), Introduction to Fund Flow and Cash Flow Analysis (simple problems)
Books and References:
TEXT BOOKS
I. A.R. Aryasri, “Managerial Economics and Financial Analysis”, TMH Publications, 3nd Edition,
2007.
REFERENCE BOOKS:
II. D.N. Dwivedi, “Managerial Economics”, Vikas Publication House Pvt. Ltd, 2nd Edition, 2012.
III. S.N. Maheshwari & S.K.Maheshwari, “Financial Accounting”, Vikas Publication House Pvt.Ltd,
4th Edition, 2012.
IV. R. Narayana Swamy, “Financial Accounting- A managerial Perspective”, Pearson publications,

1st Indian Reprint Edition, 2012.
V. J.V. Prabhakar Rao & P.V. Rao, “Managerial Economics & Financial Analysis”, Maruthi
Publishers, 1st Revised Edition, 2011.
VI. M.Kasi Reddy & Saraswathi, “Managerial Economics and Financial Analysis”, PHI Publications,
New Delhi, 10th Revised Edition, 2012.
VII. Varshney & Maheswari, “Managerial Economics”, Sulthan Chand Publishers, 1st Revised
Edition, 2009.
II YEAR II SEMESTER
DATABASE MANAGEMENT SYSTEMS LTPC

3 03 3
COURSE OBJECTIVE
 This course aims to understand the concepts of database design, database languages,
database-system implementation and maintenance.
 To represent a database system using ER diagrams and to learn normalization techniques
 To understand the fundamental concepts of transaction, concurrency and recovery processing
 To understand the internal storage structures using different file and indexing techniques
which will help in physical DB design
 To have an introductory knowledge about the Distributed databases, NOSQL and database
security
UNIT I RELATIONAL DATABASES 9

Introduction: Overview of DBMS fundamentals – Overview of Relational Databases and Keys.
Relational Data Model: Structure of relational databases – Database schema – Formal Relational
Query Languages – Overview of Relational Algebra and Relational Operations. Database Design:
Overview of the design process - The E-R Models – Constraints - Removing Redundant
Attributes in Entity Sets - E-R Diagrams - Reduction to Relational Schemas - Entity Relationship
Design Issues - Extended E-R Features – Alternative E-R Notations – Overview of Unified
Modeling Language (UML).
UNIT II DATABASE DESIGN 9

Relational Database Design: Features of Good Relational Designs - Atomic Domains and 1NF -
Decomposition using Functional Dependencies: 2NF, 3NF, BCNF and Higher Normal Forms.
Functional Dependency Theory - Algorithm for Decomposition – Decomposition using multi-
valued dependency: 4NF and 4NF decomposition. Database design process and its issues. SQL:
review of SQL – Intermediate SQL – Advanced SQL.
UNIT III 9
Transactions: Transaction concept – A simple transaction model - Storage structure - Transaction
atomicity and durability - Transaction isolation – Serializability – Recoverable schedules,
Cascadeless schedules. Concurrency control: Lock-based protocols – Locks, granting of locks,
The two-phase locking protocol, implementation of locking, Graph-based protocols. Deadlock
handling: Deadlock prevention, Deadlock detection and recovery.
UNIT IV 9
Distributed Database: Distributed Database concepts, Data Fragmentation, Replication, Allocation
Techniques for Distributed Database Design, Distributed Database Architectures, Types of
distributed database Distributed Catalog Management, Transaction Management, Concurrency
Control and Recovery, Query processor and optimization in distributed database, Views -
Integrity Procedures, Functions, Cursor and Triggers
UNIT V 9
NOSQL Databases: Introduction to NOSQL, CAP Theorem, Document-Based NOSQL System
and MongoDB, NOSQL Key-Value Stores, Column-Based, NOSQL Graph Database and Neo4j,
Big Data Technologies Based on MapReduce and Hadoop: Introduction, HDFS, MapReduce,
HadoopV2 alias YARN.
Case Study: Different types of high level databases – MongoDB, Hadoop/Hbase, Redis, IBM
Cloudant, DynamoDB, Cassandra and CouchDB etc . Tips for choosing the right database for the
given problem.
TEXT BOOK
1. Silberschatz A, Korth HF, Sudharshan S. Database System Concepts. Sixth Edition, TMH
publishing company limited; 2011. (unit 1,2,3)
2. Elmasri R, Navathe SB. Fundamentals of Database Systems. Seventh Edition, Addison
Wesley;2017. (unit 4&5)
REFERENCES
1. Garcia-Molina H, Ullman JD, Widom J. Database System ; The complete book. Second
Edition, Pearson Education India, 2011.
2. Ramakrishnan R, Gehrke J. Database Management Systems. Third Edition, TMH; 2003.
CO1: Formulate and apply relational algebraic expressions, SQL and PL/SQL statements to query
relational databases.
CO2: Design and build ER models for real world databases.
CO3: Design and build a normalized database management system for real world databases.
CO4: Understand and apply the principles of transaction processing and concurrency control.
CO5: To learn different high level databases and selection of right database.
CO-PO-PSO Mapping
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 1 3 1 1 - - - 1 3 3 3 2 1 3
2 3 1 1 2 2 - - - 3 2 1 1 3 1 2
3 3 3 2 1 2 - - - 3 3 1 2 2 2 2
4 1 2 2 3 2 - - - 3 1 3 1 1 2 1
5 2 2 1 1 3 - - - 1 2 2 3 1 3 3
AVG 2 2 2 2 2 - - - 2 2 2 2 2 2 2
OPERATING SYSTEMS LTPC
3 0 0 3
COURSE OBJECTIVES:
 To understand the basics and functions of operating systems.
 To understand processes and threads
 To analyze scheduling algorithms and process synchronization.
 To understand the concept of deadlocks.
 To analyze various memory management schemes.
 To be familiar with I/O management and file systems.
 To be familiar with the basics of virtual machines and Mobile OS like iOS and Android.
Operating System Overview - Objectives and Functions - Evolution of Operating System; Operating
System Structures - User Operating System Interface - System Calls – System Programs - Design and
Implementation - Structuring methods.
UNIT II PROCESS MANAGEMENT 11

Processes - Process Concept - Process Scheduling - Operations on Processes - Inter-process
Communication; CPU Scheduling - Scheduling criteria - Scheduling algorithms: Threads -
Multithread Models – Threading issues; Process Synchronization - The Critical-Section problem -
Synchronization hardware – Semaphores – Mutex - Classical problems of synchronization -
Monitors; Deadlock - Methods for handling deadlocks, Deadlock prevention, Deadlock avoidance,
Deadlock detection, Recovery from deadlock.
UNIT III MEMORY MANAGEMENT 10

Main Memory - Swapping - Contiguous Memory Allocation – Paging - Structure of the Page Table -
Segmentation, Segmentation with paging; Virtual Memory - Demand Paging – Copy on Write – Page
Replacement - Allocation of Frames –Thrashing.
UNIT IV STORAGE MANAGEMENT 10

Mass Storage system – Disk Structure - Disk Scheduling and Management; File-System Interface -
File concept - Access methods - Directory Structure - File system mounting - File Sharing and
Protection; File System Implementation - File System Structure – Directory implementation -
Allocation Methods - Free Space Management; I/O Systems – I/O Hardware, Application I/O
interface, Kernel I/O subsystem.
UNIT V VIRTUAL MACHINES AND MOBILE OS 7

Virtual Machines – History, Benefits and Features, Building Blocks, Types of Virtual Machines and
their Implementations, Virtualization and Operating-System Components; Mobile OS - iOS and
Android.
TOTAL:45 PERIODS
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1 : Analyze various scheduling algorithms and process synchronization.
CO2 : Explain deadlock prevention and avoidance algorithms.
CO3 : Compare and contrast various memory management schemes.
CO4 : Explain the functionality of file systems, I/O systems, and Virtualization
CO5 : Compare iOS and Android Operating Systems.
TEXT BOOKS:
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”‖, 10th
Edition, John Wiley and Sons Inc., 2018.
2. Andrew S Tanenbaum, "Modern Operating Systems", Pearson, 5th Edition, 2022 New Delhi.
REFERENCES:
1. Ramaz Elmasri, A. Gil Carrick, David Levine, “ Operating Systems – A Spiral Approach”, Tata
McGraw Hill Edition, 2010.
2. William Stallings, "Operating Systems: Internals and Design Principles", 7th Edition, Prentice
Hall, 2018.
3. Achyut S.Godbole, Atul Kahate, “Operating Systems”, McGraw Hill Education, 2016.
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 1 3 1 1 - - - 1 3 3 3 2 1 3
2 3 1 1 2 2 - - - 3 2 1 1 3 1 2
3 3 3 2 1 2 - - - 3 3 1 2 2 2 2
4 1 2 2 3 2 - - - 3 1 3 1 1 2 1
5 2 2 1 1 3 - - - 1 2 2 3 1 3 3
AVG 2 2 2 2 2 - - - 2 2 2 2 2 2 2
OPERATING SYSTEMS LABORATORY LTPC

00 3 2
COURSE OBJECTIVES
 To install windows operating systems.
 To understand the basics of Unix command and shell programming.
 To implement various CPU scheduling algorithms.
 To implement Deadlock Avoidance and Deadlock Detection Algorithms
 To implement Page Replacement Algorithms
 To implement various memory allocation methods.
 To be familiar with File Organization and File Allocation Strategies.
LIST OF EXPERIMENTS:
1. Installation of windows operating system

2. Install any guest operating system like Linux using VMware.
3. Illustrate UNIX commands and Shell Programming
4. Process Management using System Calls : Fork, Exit, Getpid, Wait, Close
5. Write C programs to implement the various CPU Scheduling Algorithms
6. Illustrate the inter process communication strategy
7. Implement mutual exclusion by Semaphore
8. Write C programs to avoid Deadlock using Banker's Algorithm and to Implement Deadlock
Detection Algorithm
9. Write C programs to implement the following Memory Allocation Methods
a. First Fit b. Worst Fit c. Best Fit
10. Write C programs to implement the various Page Replacement Algorithms
11. Implement the following File Allocation Strategies using C programs
a. Sequential b. Indexed c. Linked
12. Write C programs for the implementation of various disk scheduling algorithms
TOTAL:45 PERIODS
CO1 : Define and implement UNIX Commands.
CO2 : Compare the performance of various CPU Scheduling Algorithms.
CO3 : Compare and contrast various Memory Allocation Methods.
CO4 :Define File Organization and File Allocation Strategies.
CO5 : Implement various Disk Scheduling Algorithms.

CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 1 3 1 1 - - - 1 3 3 3 2 1 3
2 3 1 1 2 2 - - - 3 2 1 1 3 1 2
3 3 3 2 1 2 - - - 3 3 1 2 2 2 2
4 1 2 2 3 2 - - - 3 1 3 1 1 2 1
5 2 2 1 1 3 - - - 1 2 2 3 1 3 3
AVG 2 2 2 2 2 - - - 2 2 2 2 2 2 2
DATABASE MANAGEMENT SYSTEMS LABORATORY LTPC

0 0 32
COURSE OBJECTIVES:
 To learn and implement important commands in SQL.
 To learn the usage of nested and joint queries.
 To understand functions, procedures and procedural extensions of databases.
 To understand design and implementation of typical database applications.
 To be familiar with the use of a front end tool for GUI based application development.
1. Create a database table, add constraints (primary key, unique, check, Not null), insert rows,
update and delete rows using SQL DDL and DML commands.
2. Create a set of tables, add foreign key constraints and incorporate referential integrity.
3. Query the database tables using different ‘where’ clause conditions and also implement
aggregate functions.
4. Query the database tables and explore sub queries and simple join operations.
5. Query the database tables and explore natural, equi and outer joins.
6. Write user defined functions and stored procedures in SQL.
7. Execute complex transactions and realize DCL and TCL commands.
8. Write SQL Triggers for insert, delete, and update operations in a database table.
9. Create View and index for database tables with a large number of records.
10. Create an XML database and validate it using XML schema.
11. Create Document, column and graph based data using NOSQL database tools.
12. Develop a simple GUI based database application and incorporate all the above mentioned
features
13. Case Study using any of the real life database applications from the following list
a) Inventory Management for a EMart Grocery Shop
b) Society Financial Management
c) Cop Friendly App – Eseva
d) Property Management – eMall
e) Star Small and Medium Banking and Finance
● Build Entity Model diagram. The diagram should align with the business and functional
goals stated in the application.
● Apply Normalization rules in designing the tables in scope.
● Prepared applicable views, triggers (for auditing purposes), functions for enabling
enterprise grade features.
● Build PL SQL / Stored Procedures for Complex Functionalities, ex EOD Batch Processing
for calculating the EMI for Gold Loan for each eligible Customer.
● Ability to showcase ACID Properties with sample queries with appropriate settings
TOTAL: 30 PERIODS
CO1: Create databases with different types of key constraints.
CO2: Construct simple and complex SQL queries using DML and DCL commands.
CO3: Use advanced features such as stored procedures and triggers and incorporate in GUI based
application development.
CO4: Create an XML database and validate with meta-data (XML schema).
CO5: Create and manipulate data using NOSQL database.
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 1 3 1 1 - - - 1 3 3 3 2 1 3
2 3 1 1 2 2 - - - 3 2 1 1 3 1 2
3 3 3 2 1 2 - - - 3 3 1 2 2 2 2
4 1 2 2 3 2 - - - 3 1 3 1 1 2 1
5 2 2 1 1 3 - - - 1 2 2 3 1 3 3
AVG 2 2 2 2 2 - - - 2 2 2 2 2 2 2
COMPUTER NETWORKS L T P C
3 0 0 3
COURSE OBJECTIVES:
• To understand the protocol layering and physical level communication.
• To analyze the performance of a network.
• To understand the various components required to build different networks.
• To learn the functions of network layer and the various routing protocols.
• To familiarize the functions and protocols of the Transport layer.
UNIT I INTRODUCTION AND PHYSICAL LAYER 9

Networks – Network Types – Protocol Layering – TCP/IP Protocol suite – OSI Model – Physical
Layer: Performance – Transmission media – Switching – Circuit-switched Networks – Packet
Switching.
UNIT II DATA-LINK LAYER & MEDIA ACCESS 9
Introduction – Link-Layer Addressing – DLC Services – Data-Link Layer Protocols – HDLC
– PPP - Media Access Control - Wired LANs: Ethernet - Wireless LANs – Introduction – IEEE
802.11, Bluetooth – Connecting Devices.
UNIT III NETWORK LAYER 9
Network Layer Services – Packet switching – Performance – IPV4 Addresses – Forwarding of IP
Packets - Network Layer Protocols: IP, ICMP v4 – Unicast Routing Algorithms – Protocols –
Multicasting Basics – IPV6 Addressing – IPV6 Protocol.
UNIT IV TRANSPORT LAYER 9
Introduction – Transport Layer Protocols – Services – Port Numbers – User Datagram
Protocol – Transmission Control Protocol – SCTP.
UNIT V APPLICATION LAYER 9
WWW and HTTP – FTP – Email –Telnet –SSH – DNS – SNMP.
TOTAL :45 PERIODS
COURSE OUTCOMES:
On Completion of the course, the students should be able to:
 Understand the basic layers and its functions in computer networks.
 Evaluate the performance of a network.
 Understand the basics of how data flows from one node to another.
 Analyze and design routing algorithms.
 Design protocols for various functions in the network.
 Understand the working of various application layer protocols.
TEXT BOOK:
1. Behrouz A. Forouzan, Data Communications and Networking, Fifth Edition TMH, 2013.
REFERENCES
1. Larry L. Peterson, Bruce S. Davie, Computer Networks: A Systems Approach, Fifth Edition,
Morgan Kaufmann Publishers Inc., 2012.
2. William Stallings, Data and Computer Communications, Tenth Edition, Pearson Education,
2013.
3. Nader F. Mir, Computer and Communication Networks, Second Edition, Prentice Hall, 2014.
4. Ying-Dar Lin, Ren-Hung Hwang and Fred Baker, Computer Networks: An Open Source
Approach, McGraw Hill Publisher, 2011.
5. James F. Kurose, Keith W. Ross, Computer Networking, A Top-Down Approach
6. Featuring the Internet, Sixth Edition, Pearson Education, 2013.

CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 1 3 1 1 - - - 1 3 3 3 2 1 3
2 3 1 1 2 2 - - - 3 2 1 1 3 1 2
3 3 3 2 1 2 - - - 3 3 1 2 2 2 2
4 1 2 2 3 2 - - - 3 1 3 1 1 2 1
5 2 2 1 1 3 - - - 1 2 2 3 1 3 3
AVG 2 2 2 2 2 - - - 2 2 2 2 2 2 2
III YEAR I SEMESTER
COMPUTATIONAL THEORY AND COMPILER DESIGN L T P C

3 0 2 4
OBJECTIVES:
 To learn the various phases of compiler.
 To learn the various parsing techniques.
 To understand intermediate code generation and run-time environment.
 To learn to implement front-end of the compiler.
 To learn to implement code generator.
UNIT I INTRODUCTION TO COMPILERS 9
Structure of a compiler – Lexical Analysis – Role of Lexical Analyzer – Input Buffering –
Specification of Tokens – Recognition of Tokens – Lex – Finite Automata – Regular Expressions to
Automata – Minimizing DFA.
UNIT II SYNTAX ANALYSIS 12
Role of Parser – Grammars – Error Handling – Context-free grammars – Writing a grammar – Top
Down Parsing - General Strategies Recursive Descent Parser Predictive Parser-LL(1) Parser-Shift
Reduce Parser-LR Parser-LR (0)Item Construction of SLR Parsing Table - Introduction to LALR
Parser - Error Handling and Recovery in Syntax Analyzer-YACC.
UNIT III INTERMEDIATE CODE GENERATION 8
Syntax Directed Definitions, Evaluation Orders for Syntax Directed Definitions, Intermediate
Languages: Syntax Tree, Three Address Code, Types and Declarations, Translation of Expressions,
Type Checking.
UNIT IV RUN-TIME ENVIRONMENT AND CODE GENERATION 8
Storage Organization, Stack Allocation Space, Access to Non-local Data on the Stack, Heap
Management - Issues in Code Generation - Design of a simple Code Generator.
UNIT V CODE OPTIMIZATION 8
Principal Sources of Optimization – Peep-hole optimization - DAG- Optimization of Basic Blocks-
Global Data Flow Analysis - Efficient Data Flow Algorithm.
1. Develop a lexical analyzer to recognize a few patterns in C. (Ex. identifiers, constants,
comments, operators etc.). Create a symbol table, while recognizing identifiers.
2. Implement a Lexical Analyzer using Lex Tool
3. Implement an Arithmetic Calculator using LEX and YACC
4. Generate three address code for a simple program using LEX and YACC.
5. Implement simple code optimization techniques (Constant folding, Strength reduction and
Algebraic transformation)
6. Implement back-end of the compiler for which the three address code is given as input and the
8086 assembly language code is produced as output.
PRACTICALS 30 PERIODS
THEORY 45 PERIODS
TOTAL : 75 PERIODS
OUTCOMES:
On Completion of the course, the students should be able to:
 Understand the different phases of compiler.
 Design a lexical analyzer for a sample language.
 Apply different parsing algorithms to develop the parsers for a given grammar.
 Understand syntax-directed translation and run-time environment.
 Learn to implement code optimization techniques and a simple code generator.
 Design and implement a scanner and a parser using LEX and YACC tools.
TEXT BOOK:
1. Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman, Compilers: Principles,
Techniques and Tools‖, Second Edition, Pearson Education, 2009.
REFERENCES
1. Randy Allen, Ken Kennedy, Optimizing Compilers for Modern Architectures: A Dependence
based Approach, Morgan Kaufmann Publishers, 2002.
2. Steven S. Muchnick, Advanced Compiler Design and Implementation‖, Morgan Kaufmann
Publishers - Elsevier Science, India, Indian Reprint 2003.
3. Keith D Cooper and Linda Torczon, Engineering a Compiler‖, Morgan Kaufmann Publishers
Elsevier Science, 2004.
4. V. Raghavan, Principles of Compiler Design, Tata McGraw Hill Education Publishers, 2010.
5. Allen I. Holub, Compiler Design in C‖, Prentice-Hall Software Series, 1993.

CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 1 3 1 1 - - - 1 3 3 3 2 1 3
2 3 1 1 2 2 - - - 3 2 1 1 3 1 2
3 3 3 2 1 2 - - - 3 3 1 2 2 2 2
4 1 2 2 3 2 - - - 3 1 3 1 1 2 1
5 2 2 1 1 3 - - - 1 2 2 3 1 3 3
AVG 2 2 2 2 2 - - - 2 2 2 2 2 2 2
WEB TECHNOLOGIES L T P C
3 0 0 3
COURSE OBJECTIVES:
 To understand different Internet Technologies.
 To learn java-specific web services architecture
UNIT I WEBSITE BASICS, HTML 5, CSS 3, WEB 2.0 9
Web Essentials: Clients, Servers and Communication – The Internet – Basic Internet protocols –
World wide web – HTTP Request Message – HTTP Response Message – Web Clients – Web
Servers – HTML5 – Tables – Lists – Image – HTML5 control elements – Semantic elements –
Drag and Drop – Audio – Video controls - CSS3 – Inline, embedded and external style sheets –
Rule cascading – Inheritance – Backgrounds – Border Images – Colors – Shadows – Text –
Transformations – Transitions – Animations.
UNIT II CLIENT SIDE PROGRAMMING 9
Java Script: An introduction to JavaScript–JavaScript DOM Model-Date and Objects,- Regular
Expressions- Exception Handling-Validation-Built-in objects-Event Handling- DHTML with
JavaScript- JSON introduction – Syntax – Function Files – Http Request – SQL.
UNIT III SERVER SIDE PROGRAMMING 9
Servlets: Java Servlet Architecture- Servlet Life Cycle- Form GET and POST actions- Session
Handling- Understanding Cookies- Installing and Configuring Apache Tomcat Web Server-
DATABASE CONNECTIVITY: JDBC perspectives, JDBC program example - JSP:
Understanding Java Server Pages-JSP Standard Tag Library (JSTL)-Creating HTML forms by
embedding JSP code.
UNIT IV PHP and XML 9
An introduction to PHP: PHP- Using PHP- Variables- Program control- Built-in functions- Form
Validation- Regular Expressions - File handling – Cookies - Connecting to Database. XML:
Basic XML- Document Type Definition- XML Schema DOM and Presenting XML, XML
Parsers and Validation, XSL and XSLT Transformation, News Feed (RSS and ATOM).
UNIT V INTRODUCTION TO AJAX and WEB SERVICES 9
AJAX: Ajax Client Server Architecture-XML Http Request Object-Call Back Methods; Web
Services: Introduction- Java web services Basics – Creating, Publishing, Testing and Describing
a Web services (WSDL)-Consuming a web service, Database Driven web service from an
application –SOAP.
TOTAL 45 PERIODS
COURSE OUTCOMES:
At the end of the course, the students should be able to:
 Construct a basic website using HTML and Cascading Style Sheets.
 Build dynamic web page with validation using Java Script objects and by applying
different event handling mechanisms.
 Develop server side programs using Servlets and JSP.
 Construct simple web pages in PHP and to represent data in XML format.
 Use AJAX and web services to develop interactive web applications
TEXT BOOK:
1. Deitel and Deitel and Nieto, ―Internet and World Wide Web - How to Program‖,
Prentice Hall, 5th Edition, 2011.
REFERENCES:
1. Stephen Wynkoop and John Burke ―Running a Perfect Website‖, QUE, 2nd
Edition,1999.
2. Chris Bates, Web Programming – Building Intranet Applications, 3rd Edition, Wiley
Publications, 2009.
3. Jeffrey C and Jackson, ―Web Technologies A Computer Science Perspective‖, Pearson
Education, 2011.
4. Gopalan N.P. and Akilandeswari J., ―Web Technology‖, Prentice Hall of India, 2011.
5. UttamK.Roy, ―Web Technologies‖, Oxford University Press, 2011.

CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 1 3 1 1 - - - 1 3 3 3 2 1 3
2 3 1 1 2 2 - - - 3 2 1 1 3 1 2
3 3 3 2 1 2 - - - 3 3 1 2 2 2 2
4 1 2 2 3 2 - - - 3 1 3 1 1 2 1
5 2 2 1 1 3 - - - 1 2 2 3 1 3 3
AVG 2 2 2 2 2 - - - 2 2 2 2 2 2 2
WEB TECHNOLOGIES LABORATORY LT P C

0 0 4 2
OBJECTIVES:
 To be familiar with Web page design using HTML/XML and style sheets
 To be exposed to creation of user interfaces using Java frames and applets.
 To learn to create dynamic web pages using server side scripting.
 To learn to write Client Server applications.
 To be familiar with the PHP programming.
 To be exposed to creating applications with AJAX
LIST OF EXPERIMENTS
1. Create a web page with the following using HTML
a. To embed a map in a web page
b. To fix the hot spots in that map
c. Show all the related information when the hot spots are clicked.
2. Create a web page with the following.
3. Cascading style sheets.
4. Embedded style sheets.
5. Inline style sheets. Use our college information for the web pages.
6. Validate the Registration, user login, user profile and payment by credit card pages using
JavaScript.
7. Write programs in Java using Servlets:
(i) To invoke servlets from HTML forms
(ii) Session tracking using hidden form fields and Session tracking for a hit count
8. Write programs in Java to create three-tier applications using servlets for conducting on-
line examination for displaying student mark list. Assume that student information is
available in a database which has been stored in a database server.
9. Install TOMCAT web server. Convert the static web pages of programs into dynamic web
pages using servlets (or JSP) and cookies. Hint: Users information (user id, password, credit
card number) would be stored in web.xml. Each user should have a separate
Shopping Cart.
10. Redo the previous task using JSP by converting the static web pages into dynamic web
pages. Create a database with user information and books information. The books catalogue
should be dynamically loaded from the database.
11. Create and save an XML document at the server, which contains 10 users Information.
Write a Program, which takes user Id as an input and returns the User details by taking
the user information from the XML document
12. Validate the form using PHP regular expression.
13. PHP stores a form data into database.
14. Write a web service for finding what people think by asking 500 people‘s opinion for any
consumer product.
TOTAL: 45 PERIODS
COURSE OUTCOMES:
Upon Completion of the course, the students will be able to:
 Construct Web pages using HTML/XML and style sheets.
 Build dynamic web pages with validation using Java Script objects and by applying
different event handling mechanisms.
 Develop dynamic web pages using server side scripting.
 Use PHP programming to develop web applications.
 Construct web applications using AJAX and web services.
SOFTWARE REQUIRED:
 Dream Weaver or Equivalent, MySQL or Equivalent, Apache Server, WAMP/XAMPP

CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 1 3 1 1 - - - 1 3 3 3 2 1 3
2 3 1 1 2 2 - - - 3 2 1 1 3 1 2
3 3 3 2 1 2 - - - 3 3 1 2 2 2 2
4 1 2 2 3 2 - - - 3 1 3 1 1 2 1
5 2 2 1 1 3 - - - 1 2 2 3 1 3 3
AVG 2 2 2 2 2 - - - 2 2 2 2 2 2 2
ARTIFICIAL INTELLIGENCE L T P C
3 0 0 3
OBJECTIVES
The main objectives of this course are to:
 Learn the basic AI approaches to develop problem solving agent
 Learn game playing
 Perform knowledge representation in Logic
 Perform probabilistic reasoning under uncertainty
 Perform Planning and Controlling Uncertain movements in robots
UNIT I PROBLEM-SOLVING 9
Foundations of Artificial Intelligence, History of Artificial Intelligence, State of the Art, Risk and
Benefits of AI Intelligent Agents – Agents and Environments, Concept of Rationality, Nature of
Environments, Structure of Agents; Problem-solving – Problem-Solving Agents, Search Algorithms,
Uninformed Search Strategies Informed Search Strategies, Heuristic Functions
UNIT II ADVERSARIAL SEARCH 9

Game Theory, Optimal Decisions in Games, Heuristic Alpha-Beta Tree Search, Monte Carlo Tree
Search, Stochastic Games; Constraint Satisfaction Problems – Inference, Backtracking Search and
Local Search and Structure of Problems
UNIT III KNOWLEDGE, REASONING AND PLANNING 9

Logical Agents - Knowledge-based agents, Logic, Propositional Logic; First-Order Logic –
Representation, Syntax and Semantics, Using First-Order Logic; Inference in First-Order Logic –
Unification, Forward Chaining, Backward Chaining, Resolution
UNIT IV UNCERTAIN KNOWLEDGE AND REASONING 9

Quantifying Uncertainty – Acting under Uncertainty, Inference using Full Joint Distributions, Bayes’
Rule, Naive Bayes Model; Probabilistic Reasoning – Representing Knowledge in an Uncertain
Domain, Semantics of Bayesian Networks, Exact Inference, Approximate Inference in Bayesian
Networks Probabilistic Reasoning Over Time – Inference in Temporal Models, Hidden Markov
Models
UNIT V ROBOTICS 9
Reinforcement Learning – Learning from Rewards, Passive and Active Reinforcement Learning,
Policy Search Applications; Robotics – Robots, Robots Hardware, Robotic Perception, Planning and
Control, Planning Uncertain Movements, Reinforcement Learning in Robotics, Humans and
Robots, Robotic Frameworks
Application Domains
TOTAL : 45 PERIODS
COURSE OUTCOMES:
Upon completion of the course, students will be able to
CO1 Apply intelligent agent frameworks for toy problems
CO2 Apply search algorithms for game playing
CO3 Perform logical reasoning
CO4 Perform probabilistic reasoning under uncertainty
CO5 Learn robotic frameworks for various application domains
TEXT BOOKS
1. Stuart Russell and Peter Norvig, Artificial Intelligence: A Modern Approach, Pearson, 4th
Edition, 2020
REFERENCES
1. Dan W. Patterson, “Introduction to AI and ES”, Pearson Education,2007
2. Kevin Night, Elaine Rich, and Nair B., “Artificial Intelligence”, McGraw Hill, 2008
3. Patrick H. Winston, "Artificial Intelligence", Third Edition, Pearson Education, 2006
4. Deepak Khemani, “Artificial Intelligence”, Tata McGraw Hill Education, 2013
5. https://nptel.ac.in/
POs PSOs
COs
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 - 3 3 3 - - - - - - 3 3 3 3
2 3 3 3 - 3 - - - - - - 3 3 3 3
3 3 - 3 - 3 - - - - - - 3 3 3 3
4 3 - 3 3 3 - - - - - - 3 3 3 3
5 3 3 3 - 3 - - - - - - 3 3 3 3
ARTIFICIAL INTELLIGENCE LABORATORY LTPC

00 32
COURSE OBJECTIVES
 To design and implement search strategies.
 To implement game playing and CSP techniques.
 To develop systems with logical and probabilistic reasoning.
LIST OF EXPERIMENTS
1. Implement intelligent agents – Vacuum World Problem
2. Implement basic search strategies – 8-Puzzle, 8 - Queens problem
3. Implement A* algorithm – Route-Finding problem
4. Implement Minimax algorithm for game playing (Alpha-Beta pruning)
5. Solve constraint satisfaction problems (Cryptarithmetic, MapColouring)
6. Study of Prolog
7. Implement forward chaining, backward chaining, and resolution strategies in First-order
logic
8. Building Naive Bayes model
9. Probabilistic Inferencing in Bayesian Network
10. Implementation of policy search in Reinforcement learning
TOTAL: 45 PERIODS
LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:
Standalone desktops with C/C++/Java/Python/Prolog/JESS compiler 30 Nos.
COURSE OUTCOMES:
Upon successful completion of the course, the students should be able to
CO1 Design and implement search strategies
CO2 Implement game playing and CSP techniques
CO3 Develop logical reasoning and probabilistic systems
POs PSOs
COs
1 2 3 4 5 6 7 8 9 10 11 12 1 2
1 3 3 3 3 - - - - 3 3 2 3 3 2
2 3 2 3 3 3 - - - 3 2 3 3 3 3
3 3 3 3 3 3 - - - 3 3 3 3 3 3
SOFTWARE ENGINEERING AND QUALITY ASSURANCE LTPC

3 003
COURSE OBJECTIVES :
● To understand Software Engineering Lifecycle Models
● To Perform software requirements analysis
● To define the analysis, design concepts and principles of software requirement.
● To understand software testing and maintenance approaches
● To work on Quality Assurance and Standards in software.
UNIT I SOFTWARE PRODUCT AND PROCESS

9
Introduction – S/W Engineering Paradigm – Verification – Validation – Life Cycle Models – System
Engineering – Computer Based System – Business Process Engineering Overview – Product
Engineering Overview.
UNIT II SOFTWARE REQUIREMENTS

9
Functional and Non-Functional – Software Document – Requirement Engineering Process –
Feasibility Studies – Software Prototyping – Prototyping in the Software Process – Data – Functional
and Behavioral Models – Structured Analysis and Data Dictionary.
UNIT III ANALYSIS, DESIGN CONCEPTS AND PRINCIPLES

9
Systems Engineering - Analysis Concepts - Design Process And Concepts – Modular Design –
Design Heuristic – Architectural Design – Data Design – User Interface Design – Real Time
Software Design – System Design – Real Time Executives – Data Acquisition System – Monitoring
And Control System.
UNIT IV TESTING 9
Taxonomy Of Software Testing – Types Of S/W Test – Black Box Testing – Testing Boundary
Conditions – Structural Testing – Test Coverage Criteria Based On Data Flow Mechanisms –
Regression Testing – Unit Testing – Integration Testing – Validation Testing – System Testing And
Debugging – Software Implementation Techniques.
UNIT V SOFTWARE QUALITY ASSURANCE 9

Process and Product Quality – Quality Assurance and Standards – Quality Planning and Control –
Software metrics – Process Improvement – Software configuration Management.
TOTAL: 45 PERIODS
COURSE OUTCOMES:
CO1: Compare various Software Development Lifecycle Models.
CO2: Evaluate project management approaches as well as cost and schedule estimation strategies.
CO3: Perform formal analysis on specifications.
CO4: Architect and design using architectural styles and design patterns, and test the system.
CO5: Explain the quality assurance and standard in software.
TEXT BOOKS:
1. Ian Sommerville, “Software engineering”, Seventh Edition, Pearson Education Asia, 2007.
2. Roger S. Pressman, “Software Engineering – A practitioner’s Approach”, Sixth Edition,
McGraw-Hill International Edition, 2005.
REFERENCES:
1. Watts S.Humphrey,”A Discipline for Software Engineering”, Pearson Education, 2007.
2. James F.Peters and Witold Pedrycz,”Software Engineering, An Engineering Approach”,
Wiley-India, 2007.
3. Stephen R.Schach, “ Software Engineering”, Tata McGraw-Hill Publishing Company
Limited, 2007.
4. S.A.Kelkar,”Software Engineering”, Prentice Hall of India Pvt, 2007.

CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 2 1 2 2 - - - - 1 1 2 2 2 1
2 2 3 2 3 2 - - - 2 2 3 2 3 2 1
3 2 3 2 1 1 - - - 2 2 3 2 2 3 1
4 2 3 2 2 3 - - - 2 2 3 2 2 3 1
5 2 3 1 2 2 - - - - - - 1 3 2 2
AVG 2 2 1 2 2 - - - 1.2 1 1 2 2 2 1
IV YEAR I SEMESTER
COMPUTER VISION & AUGMENTED REALITY LTPC

3 003
COURSE OBJECTIVES
 To understand the fundamental concepts related to Image formation and processing.
 To learn feature detection, matching and detection
 To develop skills on 3D reconstruction
 To gain knowledge about AR/VR application development.
 To know the technologies involved in the development of AR/VR based applications
UNIT I INTRODUCTION TO IMAGE FORMATION AND PROCESSING 6
Computer Vision - Geometric primitives and transformations - Photometric image formation - The
digital camera - Point operators - Linear filtering - More neighborhood operators - Fourier transforms
- Pyramids and wavelets - Geometric transformations - Global optimization.
UNIT II FEATURE DETECTION, MATCHING AND SEGMENTATION 6
Points and patches - Edges - Lines - Segmentation - Active contours - Split and merge - Mean shift
and mode finding - Normalized cuts - Graph cuts and energy-based methods.
UNIT III FEATURE-BASED ALIGNMENT & MOTION ESTIMATION 6
2D and 3D feature-based alignment - Pose estimation - Geometric intrinsic calibration -

Triangulation - Two-frame structure from motion - Factorization - Bundle adjustment - Constrained
structure and 123 motion - Translational alignment - Parametric motion - Spline-based motion -
Optical flow - Layered motion.
UNIT IV 3D RECONSTRUCTION 6
Shape from X - Active range finding - Surface representations - Point-based representations

volumetric representations - Model-based reconstruction - Recovering texture maps and albedosos.
UNIT V AUGMENTED REALITY 6
Introduction to AR-AR Technologies-Input Devices – 3D Position Trackers – Types of Trackers –

Navigation and Manipulation Interfaces – Gesture Interfaces – Types of Gesture Input Devices –
Output Devices – Graphics Display – Human Visual System – Personal Graphics Displays – Large
Volume Displays – Sound Displays – Human Auditory System - Computer vision for AR-
Interaction-Modelling and Annotation Navigation-Wearable device.
TOTAL HOURS : 30 PERIODS
TEXT BOOKS:
1. Richard Szeliski, “Computer Vision: Algorithms and Applications”, Springer- Texts in Computer
Science, Second Edition, 2022.
2. Computer Vision: A Modern Approach, D. A. Forsyth, J. Ponce, Pearson Education, Second
Edition, 2015.
3. Dieter Schmalstieg, Tobias Hollerer, “Augmented Reality: Principles & Practice”, Addison
Wesley, 2016
4. William R. Sherman, Alan B. Craig: Understanding Virtual Reality – Interface, Application,
Design”, Morgan Kaufmann, 2003
REFERENCES:
1. Richard Hartley and Andrew Zisserman, Multiple View Geometry in Computer Vision, Second
Edition, Cambridge University Press, March 2004.
2. Christopher M. Bishop; Pattern Recognition and Machine Learning, Springer, 2006 3. E. R.
Davies, Computer and Machine Vision, Fourth Edition, Academic Press, 2012.
COMPUTER VISION & AUGMENTED REALITY LABORATORY LTPC

0 032
LIST OF EXPERIMENTS
Software needed: OpenCV computer vision Library for OpenCV in Python / PyCharm or C++ /
Visual Studio or equivalent
 OpenCV Installation and working with Python
 Basic Image Processing - loading images, Cropping, Resizing, Thresholding, Contour analysis,
Bolb detection
 Image Annotation – Drawing lines, text circle, rectangle, ellipse on images
 Image Enhancement - Understanding Color spaces, color space conversion, Histogram
equialization, Convolution, Image smoothing, Gradients, Edge Detection
 Image Features and Image Alignment – Image transforms – Fourier, Hough, Extract ORB Image
features, Feature matching, cloning, Feature matching based image alignment
 Image segmentation using Graphcut / Grabcut
 Camera Calibration with circular grid
 Pose Estimation
 3D Reconstruction – Creating Depth map from stereo images
 Develop AR enabled applications with interactivity like E learning environment, Virtual
walkthroughs and visualization of historic places.
 Develop AR enabled simple applications like human anatomy visualization, DNA/RNA
structure visualization and surgery simulation.
1. docs.opencv.org 2. https://opencv.org/opencv-free-course/
TOTAL HOURS : 30 PERIODS
CO1:To understand basic knowledge, theories and methods in image processing and computer
vision. CO2:To implement basic and some advanced image processing techniques in OpenCV.
CO3:To apply 2D a feature-based based image alignment, segmentation and motion estimations.
CO4:To apply 3D image reconstruction techniques
CO5:To design and develop innovative image processing and computer vision applications.
CO6: : Develop AR/VR applications in different domains
TEXT BOOKS:
1. Richard Szeliski, “Computer Vision: Algorithms and Applications”, Springer- Texts in Computer
Science, Second Edition, 2022.
2. Computer Vision: A Modern Approach, D. A. Forsyth, J. Ponce, Pearson Education, Second
Edition, 2015.
3. Dieter Schmalstieg, Tobias Hollerer, “Augmented Reality: Principles & Practice”, Addison
Wesley, 2016
4. William R. Sherman, Alan B. Craig: Understanding Virtual Reality – Interface, Application,
Design”, Morgan Kaufmann, 2003
REFERENCES:
1. Richard Hartley and Andrew Zisserman, Multiple View Geometry in Computer Vision, Second
Edition, Cambridge University Press, March 2004.
2. Christopher M. Bishop; Pattern Recognition and Machine Learning, Springer, 2006 3. E. R.
Davies, Computer and Machine Vision, Fourth Edition, Academic Press, 2012.
Professional Elective 4
NETWORK PROGRAMMING LTPC

3 003
COURSE OBJECTIVES :
● To understand the concept of layering in networks.
● Understand the concepts of address structures and their significance in network programming.
● Apply signal handling techniques to manage server process termination gracefully.
● Implement the poll function to monitor multiple file descriptors for I/O readiness and optimize
resource utilization.
● Understand the fundamentals of UDP and its role in communication protocols.
UNIT I NETWORK MODELS AND STANDARDS

9
OSI model, Unix standards, TCP and UDP & TCP connection establishment and Format, Buffer
sizes and limitation, standard internet services, Protocol usage by common internet application.
UNIT II SOCKETS 9
Address structures, value – result arguments, Byte ordering and manipulation function and related
functions Elementary TCP sockets – Socket, connect, bind, listen, accept, fork and exec function,
concurrent servers, Close function.
UNIT III TCP CLIENT SERVER 9

Introduction, TCP Echo server functions, Normal startup, terminate and signal handling server
process termination, Crashing and Rebooting of server host shutdown of server host.
UNIT IV I/O MULTIPLEXING AND SOCKET OPTIONS

9
I/O Models, select function, Batch input, shutdown function, poll function, TCP Echo server..
UNIT V ELEMENTARY UDP SOCKETS
9
Introduction UDP Echo server function, lost datagram, summary of UDP example, Lack of flow
control with UDP, determining outgoing interface with UDP.
TOTAL: 45 PERIODS
COURSE OUTCOMES:
CO1: Familiar with UNIX based TCP/IP concepts and standard internet services.
CO2: Know the usage of data manipulation functions during the network communication.
CO3: Understand the TCP and UDP services and related UNIX System Calls.
CO4: Differentiate the concurrent server and iterative server.
CO5: Design UDP client and server application to echo the given input sentence.
TEXT BOOKS:
1.W. Richard Stevens, “UNIX Network Programming Vol. I Sockets API”, 3nd Edition, Pearson,
2015.
2. W.Richard Stevens, “UNIX Network Programming”, 1st Edition, PHI, 1990.
REFERENCES:
1. King abls, “UNIX for Programmers and Users”, 3rd Edition, Pearson, 2003.
2. M.J.Rochkind, “Advanced UNIX Programming”, 2nd Edition, Pearson, 2000.
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 1 - - - 2 3 - - - - 2 - - -
2 3 2 - - - 3 3 - - - - 2 - - -
3 3 - 1 - - 2 2 - - - - 2 - - -
4 3 2 1 1 - 2 2 - - - - 2 - - -
5 3 2 1 - - 2 2 - - - - 1 - - -
AVG 2.8 1.8 1 1 - 2.2 2.4 - - - - 1.8 - - -
FOG AND EDGE COMPUTING LTPC

3 003
COURSE OBJECTIVES :
● Examine the Fog-IoT architectural model and its components.
● Understand the concept of Fog Computing and its role in enhancing health monitoring systems.
● Discuss the implementation of SDN in home networks and its benefits in terms of flexibility, control,
and security.
● Analyze the benefits and challenges associated with Edge Computing adoption.
● Explore the value of a network in IoT ecosystems, referencing Metcalfe's and Beckstrom's laws
UNIT I EDGE COMPUTING 9
Fog computing requirements when applied to IoT - Scalability, Interoperability, Fog - IoT
architectural model - Challenges on IoT Stack Model via TCP/IP Architecture - Data Management,
filtering - Event Management - Device Management – cloudification - virtualization, security and
privacy issues. Integrating IoT – Fog - Cloud Infrastructures: Methodology - Integrated C2F2T
Literature by Modeling Technique re by Use-Case Scenarios - Integrated C2F2T Literature by
Metrics.
UNIT II FOG COMPUTING IN HEALTH MONITORING 9

Exploiting Fog Computing in Health Monitoring : An Architecture of a Health Monitoring IoT- Based
System with Fog Computing , Fog Computing Services in Smart E-Health Gateways, Discussion of
Connected Components. Fog Computing Model for Evolving Smart Transportation Applications:
Introduction , Data-Driven Intelligent Transportation Systems , Fog Computing for Smart
Transportation Applications Case Study: Intelligent Traffic Lights Management (ITLM) System.
UNIT III FOG COMPUTING APPLICATION 9

Software Defined Networking and application in Fog Computing: Open Flow Protocol, Open Flow
Switch, SDN in Fog Computing, Home Network using SDN. Security and Privacy issues: Trust and
privacy issues in IoT Network, web Semantics and trust Management for Fog Computing, Machine
Learning based security in Fog Computing, Cyber- Physical Energy Systems over Fog Computing
UNIT IV INTRODUCTION TO EDGE COMPUTING 9

Introduction to Edge Computing Scenarios and Use cases - Edge computing purpose and definition,
Edge computing use cases, Edge computing hardware architectures, Edge platforms, Edge vs Fog
Computing, Communication Models - Edge, Fog, and M2M.
UNIT V IOT ARCHITECTURE AND CORE IOT MODULES 9

IoT Architecture and Core IoT Modules-A connected ecosystem,IoT versus machine-to-machine
versus, SCADA, The value of a network and Metcalfe's and Beckstrom's laws, IoT and edge
architecture, Role of an architect, Understanding Implementations with the examples- Edge
computing with RaspberryPi, Industrial, and Commercial IoT and Edge, and Edge computing and
solutions.
TOTAL: 45 PERIODS
COURSE OUTCOMES:
CO1: Explore the need for new computing paradigms.
CO2: Explain the major components of fog and edge computing architectures.
CO3: Identify potential technical challenges of the transition process and suggest solutions.
CO4: Analyze data and application requirements and pertaining issues.
CO5: Design and model infrastructures.
TEXT BOOKS:
1.Fog Computing: Theory and Practice by Assad Abbas, Samee U. Khan, Albert Y. Zomaya
2. IoT and Edge Computing for Architects - Second Edition, by Perry Lea, Publisher: Packt
Publishing, 2020, ISBN: 9781839214806
3. Raspberry Pi Cookbook, 3rd Edition, by Simon Monk, Publisher: O'Reilly Media, Inc., 2019,
ISBN: 978149204322
4. David Jensen, “Beginning Azure IoT Edge Computing: Extending the Cloud to the
Intelligent Edge, MICROSOFT AZURE
REFERENCES:
1. Fog and Edge Computing: Principles and Paradigms (Wiley Series on Parallel and
Distributed Computing) by RajkumarBuyya and Satish Narayana Srirama
2. FlavioBonomi, Rodolfo Milito, Jiang Zhu, SateeshAddepalli, ―Fog Computing and
Its Role in the Internet of Thingsǁ, MCC’12, August 17, 2012, Helsinki, Finland.
Copyright 2012 ACM 978- 1-4503-1519-7/12/08... $15.00.
3. Shanhe Yi, Cheng Li, Qun Li, ―A Survey of Fog Computing: Concepts,
Applications and Issuesǁ, Mobidata’15, ACM 978-1-4503-3524-9/15/06, DOI:
10.1145/2757384.2757397, June 21, 2015, Hangzhou, China..
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 2 1 2 - 2 3 - - - - 2 2 2 1
2 2 3 2 3 - 3 3 - - - - 2 3 2 1
3 2 3 2 1 - 2 2 - - - - 2 2 3 1
4 2 3 2 2 - 2 2 - - - - 2 2 3 1
5 2 3 1 2 - 2 2 - - - - 1 3 2 2
AV 2 2 1 2 - 2.2 2.4 - - - - 1.8 2 2 1

G
MULTIMEDIA LTPC
3 003
COURSE OBJECTIVES :
 To grasp the fundamental knowledge of Multimedia elements and systems
 To get familiar with Multimedia file formats and standards
 To learn the process of Authoring multimedia presentations
 To learn the techniques of animation in 2D and 3D and for the mobile UI
 To explore different popular applications of multimedia
UNIT I INTRODUCTION TO MULTIMEDIA 9

Definitions, Elements, Multimedia Hardware and Software, Distributed multimedia systems,
challenges: security, sharing / distribution, storage, retrieval, processing, computing. Multimedia
metadata, Multimedia databases, Hypermedia, Multimedia Learning.
UNIT II MULTIMEDIA FILE FORMATS AND STANDARDS

9
File formats – Text, Image file formats, Graphic and animation file formats, Digital audio and Video
file formats, Color in image and video, Color Models. Multimedia data and file formats for the web.
UNIT III MULTIMEDIA AUTHORING 9
Authoring metaphors, Tools Features and Types: Card and Page Based Tools, Icon and Object Based
Tools, Time Based Tools, Cross Platform Authoring Tools, Editing Tools, Painting and Drawing
Tools, 3D Modeling and Animation Tools, Image Editing Tools, audio Editing Tools, Digital Movie
Tools, Creating interactive presentations, virtual learning, simulations.
UNIT IV ANIMATION 9
Principles of animation: staging, squash and stretch, timing, onion skinning, secondary action, 2D, 2
½ D, and 3D animation, Animation techniques: Keyframe, Morphing, Inverse Kinematics, Hand
Drawn, Character rigging, vector animation, stop motion, motion graphics, , Fluid Simulation,
skeletal animation, skinning Virtual Reality, Augmented Reality.
UNIT V MULTIMEDIA APPLICATIONS

9
Multimedia Big data computing, social networks, smart phones, surveillance, Analytics, Multimedia
Cloud Computing, Multimedia streaming cloud, media on demand, security and forensics, Online
social networking, multimedia ontology, Content based retrieval from digital libraries.
TOTAL: 45 PERIODS
COURSE OUTCOMES:
CO1: Get the bigger picture of the context of Multimedia and its applications
CO2: Use the different types of media elements of different formats on content pages
CO3: Author 2D and 3D creative and interactive presentations for different target multimedia
applications.
CO4: Use different standard animation techniques for 2D, 21/2 D, 3D applications
CO5: Understand the complexity of multimedia applications in the context of cloud, security, bigdata
streaming, social networking, CBIR etc.,
TEXT BOOKS:
1. Ze-Nian Li, Mark S. Drew, Jiangchuan Liu, Fundamentals of Multimedia”, Third Edition,
Springer Texts in Computer Science, 2021.
REFERENCES:
1.John M Blain, The Complete Guide to Blender Graphics: Computer Modeling &
Animation, CRC press, 3rd Edition, 2016.
2. Gerald Friedland, Ramesh Jain, “Multimedia Computing”, Cambridge University Press,
2018.
3. Prabhat K.Andleigh, Kiran Thakrar, “Multimedia System Design”, Pearson Education, 1st
Edition, 2015.
4.Mohsen Amini Salehi, Xiangbo Li, “Multimedia Cloud Computing Systems”, Springer
Nature, 1st Edition, 2021.
5.Mark Gaimbruno, “3D Graphics and Animation”, Second Edition, New Riders, 2002.
6.Rogers David, “Animation: Master – A Complete Guide (Graphics Series)”, Charles River
Media, 2006.
7.Rick parent, “Computer Animation: Algorithms and Techniques”, Morgan Kauffman, 3rd
Edition, 2012.
8.Emilio Rodriguez Martinez, Mireia Alegre Ruiz, “UI Animations with Lottie and After
Effects: Create, render, and ship stunning After Effects animations natively on mobile with React
Native”, Packt Publishing, 2022.
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 3 2 3 - - - 3 2 1 2 3 2 3
2 3 3 3 3 3 - - - 3 3 2 2 3 2 3
3 3 3 3 3 3 - - - 3 3 2 3 3 2 3
4 3 3 3 3 3 2 - - 3 3 3 3 3 3 3
5 3 3 3 3 3 2 - - 3 3 3 3 3 3 3
AVG 3 2.8 3 2.8 3 2 - - 3 2.8 2.2 2.6 3 2.4 3
ETHICAL HACKING LTPC

3 003
COURSE OBJECTIVES :
 To understand the basics of computer based vulnerabilities.
 To explore different foot printing, reconnaissance and scanning methods.
 To expose the enumeration and vulnerability analysis methods.
 To understand hacking options available in Web and wireless applications.
 To explore the options for network protection.
Ethical Hacking Overview - Role of Security and Penetration Testers .- Penetration-Testing
Methodologies- Laws of the Land - Overview of TCP/IP- The Application Layer - The Transport
Layer - The Internet Layer - IP Addressing .- Network and Computer Attacks - Malware - Protecting
Against Malware Attacks.- Intruder Attacks - Addressing Physical Security.
UNIT II FOOT PRINTING, RECONNAISSANCE AND SCANNING NETWORKS

9
Footprinting Concepts - Footprinting through Search Engines, Web Services, Social Networking
Sites, Website, Email - Competitive Intelligence - Footprinting through Social Engineering -
Footprinting Tools - Network Scanning Concepts - Port-Scanning Tools - Scanning Techniques -
Scanning Beyond IDS and Firewall
UNIT III ENUMERATION AND VULNERABILITY ANALYSIS

9
Enumeration Concepts - NetBIOS Enumeration – SNMP, LDAP, NTP, SMTP and DNS
Enumeration - Vulnerability Assessment Concepts - Desktop and Server OS Vulnerabilities –
Windows OS Vulnerabilities - Tools for Identifying Vulnerabilities in Windows- Linux OS
Vulnerabilities- Vulnerabilities of Embedded Oss
UNIT IV SYSTEM HACKING 9

Hacking Web Servers - Web Application Components- Vulnerabilities - Tools for Web Attackers and
Security Testers Hacking Wireless Networks - Components of a Wireless Network – Wardriving-
Wireless Hacking - Tools of the Trade.
UNIT V NETWORK PROTECTION SYSTEMS 9

Access Control Lists. - Cisco Adaptive Security Appliance Firewall - Configuration and Risk
Analysis Tools for Firewalls and Routers - Intrusion Detection and Prevention Systems - Network-
Based and Host-Based IDSs and IPSs - Web Filtering - Security Incident Response Teams –
Honeypots.
TOTAL: 45 PERIODS
COURSE OUTCOMES:
CO1: To express knowledge on basics of computer based vulnerabilities
CO2: To gain understanding on different foot printing, reconnaissance and scanning methods.
CO3: To demonstrate the enumeration and vulnerability analysis methods.
CO4: To gain knowledge on hacking options available in Web and wireless applications.
CO5: To acquire knowledge on the options for network protection.
CO6: To use tools to perform ethical hacking to expose the vulnerabilities.
TEXT BOOKS:
1. Michael T. Simpson, Kent Backman, and James E. Corley, Hands-On Ethical Hacking and
Network Defense, Course Technology, Delmar Cengage Learning, 2010.
2. The Basics of Hacking and Penetration Testing - Patrick Engebretson, SYNGRESS,
Elsevier, 2013.
3. The Web Application Hacker’s Handbook: Finding and Exploiting Security Flaws, Dafydd
Stuttard and Marcus Pinto, 2011.
REFERENCES:
1. Black Hat Python: Python Programming for Hackers and Pentesters, Justin Seitz , 2014.
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 2 3 1 - - - 2 3 1 2 3 3 3
2 2 2 2 3 3 - - - 1 2 2 3 1 1 3
3 3 3 3 3 3 - - - 2 1 1 2 2 1 3
4 3 3 1 1 1 - - - 1 3 1 3 2 1 1
5 3 2 2 2 3 - - - 2 3 2 2 2 3 3
AVG 2.8 2.4 2 2.4 2.2 - - - 1.6 2.4 1.4 2.4 2 1.8 2.6
DEEP LEARNING LTPC
3 003
COURSE OBJECTIVES :
 To understand and need and principles of deep neural networks
 To understand CNN and RNN architectures of deep neural networks
 To comprehend advanced deep learning models
 To learn the evaluation metrics for deep learning models
 Define under complete autoencoders and their role in dimensionality reduction.
UNIT I DEEP NETWORKS BASICS 9

Linear Algebra: Scalars -- Vectors -- Matrices and tensors; Probability Distributions -- Gradient-
based Optimization – Machine Learning Basics: Capacity -- Overfitting and underfitting --
Hyperparameters and validation sets -- Estimators -- Bias and variance -- Stochastic gradient descent
-- Challenges motivating deep learning; Deep Networks: Deep feedforward networks; Regularization
-- Optimization.
UNIT II CONVOLUTIONAL NEURAL NETWORKS 9

Convolution Operation -- Sparse Interactions -- Parameter Sharing -- Equivariance -- Pooling --
Convolution Variants: Strided -- Tiled -- Transposed and dilated convolutions; CNN Learning:
Nonlinearity Functions -- Loss Functions -- Regularization -- Optimizers --Gradient Computation.
UNIT III RECURRENT NEURAL NETWORKS

9
Unfolding Graphs -- RNN Design Patterns: Acceptor -- Encoder --Transducer; Gradient Computation
-- Sequence Modeling Conditioned on Contexts -- Bidirectional RNN -- Sequence to Sequence RNN
– Deep Recurrent Networks -- Recursive Neural Networks -- Long Term Dependencies; Leaky Units:
Skip connections and dropouts; Gated Architecture: LSTM.
UNIT IV MODEL EVALUATION 9

Performance metrics -- Baseline Models -- Hyperparameters: Manual Hyperparameter -- Automatic
Hyperparameter -- Grid search -- Random search -- Debugging strategies.
UNIT V AUTOENCODERS AND GENERATIVE MODELS 9

Autoencoders: Undercomplete autoencoders -- Regularized autoencoders -- Stochastic encoders and
decoders -- Learning with autoencoders; Deep Generative Models: Variational autoencoders –
Generative adversarial networks.
TOTAL: 45 PERIODS
COURSE OUTCOMES:
CO1: Explain the basics in deep neural networks
CO2: Apply Convolution Neural Network for image processing
CO3: Apply Recurrent Neural Network and its variants for text analysis
CO4: Apply model evaluation for various applications
CO5: Apply autoencoders and generative models for suitable applications
TEXT BOOKS:
1. Ian Goodfellow, Yoshua Bengio, Aaron Courville, ``Deep Learning'', MIT Press, 2016.
2. Andrew Glassner, “Deep Learning: A Visual Approach”, No Starch Press, 2021.
REFERENCES:
1. Salman Khan, Hossein Rahmani, Syed Afaq Ali Shah, Mohammed Bennamoun, ``A Guide
to Convolutional Neural Networks for Computer Vision'', Synthesis Lectures on Computer Vision,
Morgan & Claypool publishers, 2018.
2. Yoav Goldberg, ``Neural Network Methods for Natural Language Processing'', Synthesis
Lectures on Human Language Technologies, Morgan & Claypool publishers, 2017.
3. Francois Chollet, ``Deep Learning with Python'', Manning Publications Co, 2018.
4. Charu C. Aggarwal, ``Neural Networks and Deep Learning: A Textbook'', Springer
International Publishing, 2018.
5. Josh Patterson, Adam Gibson, ``Deep Learning: A Practitioner's Approach'', O'Reilly
Media, 2017.
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 1 - - - 2 3 - - - - 2 - - -
2 3 2 - - - 3 3 - - - - 2 - - -
3 3 - 1 - - 2 2 - - - - 2 - - -
4 3 2 1 1 - 2 2 - - - - 2 - - -
5 3 2 1 - - 2 2 - - - - 1 - - -
AVG 2.8 1.8 1 1 - 2.2 2.4 - - - - 1.8 - - -

Jeppiaar Institute of Technology, Sriperumbudur w.e.f.2024-2025
PROFESSIONAL ELECTIVE 3
MOBILE APPLICATION DEVELOPMENT LTPC
3003
OBJECTIVES:
 To make the student understand the basic concepts of mobile application development
 Be aware of Characteristics of mobile applications, User-interface design, basics of graphics and
multimedia
 To gain knowledge about testing and publishing of Android application
 To facilitate students to understand android SDK
 To help students to gain a basic understanding of Android application development
UNIT – I 11
Mobile Application Development - Mobile Applications and Device Platforms - Alternatives for Building
Mobile Apps -Comparing Native vs. Hybrid Applications -The Mobile Application Development
Lifecycle-The Mobile Application Front-End-The Mobile Application Back-EndKey Mobile Application
Services-What is Android-Android version history-Obtaining the Required Tools- Launching Your First
Android Application-Exploring the IDE-Debugging Your Application-Publishing Your Application
UNIT – II 7
Understanding Activities-Linking Activities Using Intents-Fragments-Displaying Notifications

Understanding the Components of a Screen-Adapting to Display Orientation-Managing Changes to Screen
Orientation- Utilizing the Action Bar-Creating the User Interface Programmatically Listening for UI
Notifications
UNIT – III 10
Using Basic Views-Using Picker Views -Using List Views to Display Long Lists-Understanding
Specialized Fragments - Using Image Views to Display Pictures -Using Menus with ViewsUsing
WebView- Saving and Loading User Preferences-Persisting Data to Files-Creating and Using Databases.
UNIT – IV 7
Testing Android applications, Publishing Android application, Using Android preferences, Managing
Application resources in a hierarchy, working with different types of resources.
UNIT – V 10
Using Common Android APIs: Using Android Data and Storage APIs, Managing data using Sqlite,
Sharing Data between Applications with Content Providers, Using Android Networking APIs, Using
Android Web APIs, Using Android Telephony APIs, Deploying Android Application to the World.
TOTAL:45 PERIODS
OUTCOMES:
At the end of this course, students will be able to:
 To explain the basics of mobile application development

 Develop Android application with User interface, networking and animation.
 Use simulator tools to test and publish the application.
 Program mobile applications for the Android operating system that use basic and advanced phone
features
 Deploy applications to the Android marketplace for distribution.
TEXT BOOK:
1. Jerome DiMarzio, “Beginning Android Programming with Android Studio”, 4th edition.
2. T1. Lauren Darcey and Shane Conder, “Android Wireless Application Development”, Pearson
Education, 2nd ed. (2011)
REFERENCE BOOKS:
1. Dawn Griffiths, David Griffiths, “Head First Android Development: A Brain-Friendly Guide”, 2017.
2. Neil Smyth , “Android Studio 3.0 Development Essentials: Android”, 8th Edition.
3. Pradeep Kothari, “Android Application Development”, Black Book, 2014.
MOBILE APPLICATIONS DEVELOPMENT LABORATORY LTPC
00 42
Objectives
 To learn the basics of mobile application development

 To get accustomed to Android platform
 To develop skills in developing basic Android applications
 To help students to gain a basic understanding of Android application development
 To inculcate working knowledge of Android Studio development tool
Experiments
1. Install the Android SDK and developer tools and build a test project to confirm that those tools are
properly installed and configured
2. Write a program using a Table Layout for our restaurant data entry form, add a set of radio buttons to
represent the type of restaurant
3. Write a program using activity class to show different events.
4. Write a program to send user from one application to another. (For example redirection to map)
5. Write a program to play audio files.
6. Write a program to play video files.
7. Write a program to capture image using built in camera.
8. Write a program to send SMS.
9. Write a program to convert text to speech.
10. Write a program to call a number.
TOTAL:30 PERIODS
OUTCOMES
 Hands on experience in Android application

 Acquire skill set to execute applications in Android based devices
 Program mobile applications for the Android operating system that use basic and advanced
phone features
 Deploy applications to the Android marketplace for distribution.
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 2 1 2 3 - - - 1 1 2 1 2 3 3
2 2 1 3 2 2 - - - 3 2 2 3 3 2 1
3 2 2 2 1 2 - - - 1 1 1 1 1 1 2
4 1 3 1 1 3 - - - 1 1 3 2 1 3 1
5 1 1 3 1 3 - - - 1 1 2 1 3 2 1
AVG 1.6 1.8 2 1.4 2.6 - - - 1.4 1.2 2 1.6 2 2.2 1.6
ELECTRONIC COMMERCE LTPC
3003
OBJECTIVES:
• To Learn the E-Commerce Platform and its concepts

• To Understand the Technology, infrastructure and Business in E-Commerce
• To Understand the Security and Challenges in E-Commerce
• To Build an Own E-Commerce using Open Source Frameworks
UNIT I INTRODUCTION TO E-COMMERCE 9
Working of Web - HTML Markup for Structure - Creating simple page - Marking up text - Adding Links -
Adding Images - Table Markup - Forms - HTML5
UNIT II BUILDING AN E-COMMERCE WEBSITE, MOBILE SITE 9
Systematic approach to build an E-Commerce: Planning, System Analysis, System Design, Building the
system, Testing the system, Implementation and Maintenance, Optimize Web Performance – Choosing
hardware and software – Other E-Commerce Site tools – Developing a Mobile Website and Mobile App
UNIT III E-COMMERCE SECURITY AND PAYMENTS SYSTEMS 9
E-Commerce Security Environment – Security threats in E-Commerce – Technology Solutions:

Encryption, Securing Channels of Communication, Protecting Networks, Protecting Servers and Clients –
Management Policies, Business Procedure and Public Laws - Payment Systems
UNIT IV BUSINESS CONCEPTS IN E-COMMERCE 9
Digital Commerce Marketing and Advertising strategies and tools – Internet Marketing Technologies –
Social Marketing – Mobile Marketing – Location based Marketing – Ethical, Social, Political Issues in E-
Commerce
UNIT V PROJECT CASE STUDY 9
Case Study : Identify Key components, strategy, B2B, B2C Models of E-commerce Business model of any
e-commerce website - Mini Project : Develop E-Commerce project in any one of Platforms like Woo-
Commerce, Magento or Opencart
TOTAL : 45 PERIODS
OUTCOMES:
On Successful completion of the course ,Students will be able to
• Design Website using HTML CSS and JS
• Design Responsive Sites
• Manage, Maintain and Support Web Apps
TEXT BOOK:
1. Kenneth C.Laudon, Carol Guercio Traver ―E-Commerce‖, Pearson, 10th Edition, 2016
REFERENCES
1. http://docs.opencart.com/
2. http://devdocs.magento.com/
3. http://doc.prestashop.com/display/PS15/Developer+tutorials
4. Robbert Ravensbergen, ―Building E-Commerce Solutions with WooCommerce‖, PACKT, 2nd Edition
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 2 1 2 3 1 2 2 2 2 3 2 3 3 -
2 2 2 2 3 3 2 2 2 2 2 3 2 3 3 -
3 2 3 2 1 3 2 2 3 2 1 2 2 3 3 -
4 1 2 2 2 3 2 2 1 2 3 2 3 3 3 -
5 3 1 3 2 3 3 2 2 2 2 3 3 3 3 -
AVG 2 2 2 2 3 2 2 2 2 2 3 2 3 3 -
BIG DATA TECHNOLOGY LTP C
3003
Course Objectives:
 To have knowledge on accessing, storing and manipulating the huge data from different resources.
 To understand the working environment of Pig and Hive for processing the structured and unstructured
data.
 To differentiate the RDBMS and Hive architectures and implement queries to process the data using
sqoop.
 To have a knowledge on searching mechanisms using solr
UNIT I INTRODUCTION TO BIG DATA 7 Big Data

Overview - Background of Data Analytics - Role of Distributed System in Big Data - Role of Data
Scientist - Current Trend in Big Data Analytics
UNIT II GOOGLE FILE SYSTEM AND NOSQL 7
Architecture – Availability - Fault tolerance - Optimization for large scale data. Structured and
Unstructured Data - Taxonomy of NoSQL Implementation - Discussion of basic architecture of Hbase,
Cassandra and MongoDb.
UNIT III MAP-REDUCE FRAMEWORK 10
Basics of functional programming - Fundamentals of functional programming - Real world problems

modeling in functional style - Map reduce fundamentals - Data flow (Architecture) - Real world problems
- Scalability goal - Fault tolerance - Optimization and data locality - Parallel Efficiency of Map-Reduce
UNIT IV SEARCHING AND INDEXING BIG DATA 7
Full text Indexing and Searching - Indexing with Lucene - Distributed Searching with elastic search
UNIT V CASE STUDY: HADOOP 8
Introduction to Hadoop Environment - Data Flow - Hadoop I/O - Query languages for Hadoop - Hadoop
and Amazon Cloud.
TOTAL: 45 PERIODS
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 1 2 3 1 3 2 1 - - -
2 2 3 3 2 3 1 1 - - -
3 1 3 2 1 2 3 - - -
4 1 2 3 3 2 1 - - -
5 1 2 3 1 2 3 - - -
AVG 0.6 5.4 3.6 5.6 4.6 2.2 3.6 4.6 2.6 3.6 1.4 2.2 - - -
LIST OF EXPERIMENTS: 30 PERIODS
1. Downloading and installing Hadoop; Understanding different Hadoop modes. Startup scripts,
Configuration files.
2. Hadoop Implementation of file management tasks, such as Adding files and directories,
retrieving files and Deleting files
3. Implement of Matrix Multiplication with Hadoop Map Reduce
4. Run a basic Word Count Map Reduce program to understand Map Reduce Paradigm.
5. Installation of Hive along with practice examples.
7. Installation of HBase, Installing thrift along with Practice examples
8. Practice importing and exporting data from various databases.
Software Requirements:
Cassandra, Hadoop, Java, Pig, Hive and HBase.
COURSE OUTCOMES:
On Successful completion of the course ,Students will be able to

 To study the basic technologies that forms the foundations of Big Data.
 To study the programming aspects of cloud computing with a view to rapid prototyping of complex
applications.
 To understand the specialized aspects of big data including big data application, and big data
analytics.
 To study different types Case studies on the current research and applications of the Hadoop and
big data in industry
 Student must be know the recent research trends related to Hadoop File System, MapReduce and
Google File System etc
TEXT BOOKS
1. Jeffrey Dean, Sanjay Ghemawat MapReduce:Simplified Data Processing on Large Clusters
REFERENCES
1. Sanjay Ghemawat, Howard Gobioff, and Shun-Tak Leung The Google File System
2. http://wiki.apache.org/hadoop/
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 1 2 3 1 3 2 1 3 1
2 2 3 3 2 3 1 1 2 3 3
3 1 3 2 1 2 3 2
4 1 2 3 3 2 1 1 2
5 1 2 3 1 2 3 3 1
AVG 0.6 5.4 3.6 5.6 4.6 2.2 3.6 4.6 2.6 3.6 1.4 2.2 3.6 5.6 4.6
CYBER SECURITY LTPC
2023
COURSE OBJECTIVES:
 To learn cybercrime and cyberlaw.

 To understand the cyber attacks and tools for mitigating them.
 To understand information gathering.
 To learn how to detect a cyber attack.
 To learn how to prevent a cyber attack.
Cyber Security – History of Internet – Impact of Internet – CIA Triad; Reason for Cyber Crime – Need for
Cyber Security – History of Cyber Crime; Cybercriminals – Classification of Cybercrimes – A Global
Perspective on Cyber Crimes; Cyber Laws – The Indian IT Act – Cybercrime and Punishment.
UNIT II ATTACKS AND COUNTERMEASURES 6
OSWAP; Malicious Attack Threats and Vulnerabilities: Scope of Cyber-Attacks – Security Breach –
Malicious Attacks Types – Malicious Software – Common Attack Vectors – Social engineering Attack –
Wireless Network Attack – Web Application Attack – Attack Tools – Countermeasures.
UNIT III RECONNAISSANCE 5
Harvester – Whois – Netcraft – Host – Extracting Information from DNS – Extracting Information from E-
mail Servers – Social Engineering Reconnaissance; Scanning – Port Scanning – Network Scanning and
Vulnerability Scanning – Scanning Methodology – Ping Sweer Techniques – Nmap Command Switches –
FIN Scans – Banner Grabbing and OS Finger printing Techniques.
UNIT IV INTRUSION DETECTION 5
Host -Based Intrusion Detection – Network -Based Intrusion Detection – Distributed or Hybrid Intrusion
Detection – Intrusion Detection Exchange Format – Honeypots – Example System Snort.
UNIT V INTRUSION PREVENTION 5
Firewalls and Intrusion Prevention Systems: Need for Firewalls – Firewall Characteristics and Access
Policy – Types of Firewalls – Firewall Basing – Firewall Location and Configurations – Intrusion
Prevention Systems – Example Unified Threat Management Products.
TOTAL: 30 PERIODS
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 2 1 1 3 3 1 3 - 1 - 3 - 2 -
2 2 2 1 1 3 3 2 3 - 1 - 3 - 3 -
3 2 2 1 1 - 3 1 3 - 1 - 3 - 3 -
4 2 2 1 1 3 3 1 3 - 1 - 3 - 2 -
5 2 2 1 1 - 3 1 3 - 1 - 3 - 3 -
AVG 2 2 1 1 1 3 1 3 - 1 - 3 - 3 -
PRACTICAL EXERCISES: 30 PERIODS
1. Install Kali Linux on Virtual box

2. Explore Kali Linux and bash scripting
3. Perform open source intelligence gathering using Netcraft, Whois Lookups, DNS
Reconnaissance, Harvester and Maltego
4. Understand the nmap command d and scan a target using nmap
5. Install metasploitable2 on the virtual box and search for unpatched vulnerabilities
6. Use Metasploit to exploit an unpatched vulnerability
7. Install Linus server on the virtual box and install ssh
8. Use Fail2banto scan log files and ban Ips that show the malicious signs
9. Launch brute-force attacks on the Linux server using Hydra.
10. Perform real-time network traffic analysis and data pocket logging using Snort
COURSE OUTCOMES:
On successful completion of this course, the student will be able to
 Understand the various tools and methods used in cybercrime.
 Identify risk management processes, risk treatment methods, organization of information security.
 Classify cyber security solutions and information assurance
 Examine software vulnerabilities and security solutions to reduce the risk of exploitation.
 Analyze the cyber security needs of an organization.
TOTAL:60 PERIODS
TEXTBOOKS
1. Anand Shinde, “Introduction to Cyber Security Guide to the World of Cyber Security”,
Notion Press, 2021 (Unit 1)
2. Nina Godbole, Sunit Belapure, “Cyber Security: Understanding Cyber Crimes, Computer
Forensics and Legal Perspectives”, Wiley Publishers, 2011 (Unit 1)
3. https://owasp.org/www-project-top-ten/
REFERENCES
1. David Kim, Michael G. Solomon, “Fundamentals of Information Systems Security”, Jones & Bartlett
Learning Publishers, 2013 (Unit 2)
2. Patrick Engebretson, “The Basics of Hacking and Penetration Testing: Ethical Hacking and
Penetration Testing Made easy”, Elsevier, 2011 (Unit 3)
3. Kimberly Graves, “CEH Official Certified Ethical hacker Review Guide”, Wiley Publishers,
2007 (Unit 3)
4. William Stallings, Lawrie Brown, “Computer Security Principles and Practice”, Third Edition, Pearson
Education, 2015 (Units 4 and 5)
5. Georgia Weidman, “Penetration Testing: A Hands-On Introduction to Hacking”, No Starch
Press, 2014 (Lab)
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 2 1 1 3 3 1 3 - 1 - 3 - 2 -
2 2 2 1 1 3 3 2 3 - 1 - 3 - 3 -
3 2 2 1 1 - 3 1 3 - 1 - 3 - 3 -
4 2 2 1 1 3 3 1 3 - 1 - 3 - 2 -
5 2 2 1 1 - 3 1 3 - 1 - 3 - 3 -
AVG 2 2 1 1 1 3 1 3 - 1 - 3 - 3 -
MACHINE LEARNING LTPC
3003
COURSE OBJECTIVES:
 Acquire theoretical Knowledge on setting hypothesis for pattern recognition

 Apply suitable machine learning techniques for data handling and to gain knowledge from it
 Evaluate the performance of algorithms and to provide solution for various realworld applications.
UNIT I INTRODUCTION TO MACHINE LEARNING AND ENSEMBLE LEARNING

9
Introduction - Examples of Various Learning Paradigms - Perspectives and Issues - Version Spaces - Finite
and Infinite Hypothesis Spaces - PAC Learning, VC Dimension. Model Combination Schemes, Voting,
Error-Correcting Output Codes, Bagging: Random Forest Trees, Boosting: Adaboost, Stacking.
UNIT II SUPERVISED LEARNING 9
Decision Trees: ID3, Classification and Regression Trees, Regression: Linear Regression, Multiple Linear
Regression, Logistic Regression, Neural Networks: Introduction, Perceptron, Multilayer Perceptron,
Support vector machines: Linear and Non-Linear, Kernel Functions, KNearest Neighbours.
UNIT III UNSUPERVISED LEARNING AND PROBABILISTIC LEARNING 9
Introduction to clustering, Hierarchical: AGNES, DIANA, Partitional: K-means clustering, K-Mode

Clustering, Expectation Maximization, Gaussian Mixture Models. Bayesian Learning, Bayes Optimal
Classifier, Naıve Bayes Classifier, Bayesian Belief Networks.
UNIT IV LEARNING ASSOCIATION RULES AND ML IN PRACTICE 9
Mining Frequent Patterns - basic concepts -Apriori algorithm, FP- Growth algorithm, Associationbased
Decision Trees. Design, Analysis and Evaluation of Machine Learning Experiments, Other Issues:
Handling imbalanced data sets.
UNIT V RECENT TRENDS IN BIG DATA ANALYTICS AND SOLR 9
Big Data Overview - Background of Data Analytics - Role of Distributed System in Big Data - Role of
Data Scientist - Current Trend in Big Data Analytics. Information retrieval search engine, categories of
data, inverted index. Design- field attributes and types. Indexing- indexing tool. Indexing operations using
csv documents. Searching data- parameters, default query.
TOTAL : 45 PERIODS
COURSE OUTCOME:
1. Recognize the characteristics of Machine Learning techniques that enable to solve real
world problems
2. Recognize the characteristics of machine learning strategies
3. Apply various supervised learning methods to appropriate problems
4.Identify and integrate more than one techniques to enhance the performance of
learning
5. Create probabilistic and unsupervised learning models for handling unknown pattern
6. Analyze the co-occurrence of data to find interesting frequent patterns
TEXT BOOKS
1. Kevin P. Murphy ”Machine Learning: A Probabilistic Perspective”, The MIT Press, 2012
2. Jiawei Hanand Micheline Kambers andJianPei,“DataMining Concepts and Techniques”,3rd edition,

Morgan Kaufman Publications, 2012.
Reference Books
1. Ethem Alpaydin,”IntroductiontoMachineLearning”,MITPress,PrenticeHallofIndia, Third
Edition2014.
2. Mehryar Mohri, Afshin Rostamizadeh, Ameet Talwalkar ”Foundations of Machine Learning”, MIT
Press,2012.
3. Tom Mitchell, “Machine Learning”, McGraw Hill, 3rdEdition,1997.
4. CharuC.Aggarwal,“DataClassificationAlgorithmsandApplications”,CRCPress,2014.
5. Charu C. Aggarwal, “DATA CLUSTERING Algorithms and Applications”, CRC Press,

2014.
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 1 2 3 2 2 1 - 1 - - - - - - -
2 1 3 2 2 - 1 1 - - - - - - -
3 1 1 3 1 1 1 - - - - - - - -
4 2 1 1 2 - 1 1 - - - - - - -
5 1 1 3 2 2 1 - - - - - - -
AVG 4.2 4.2 10.2 9.4 5.4 0.6 0.6 0. - - - - - - -

6
MACHINE LEARNING LAB LTPC
0 0 3 1.5
COURSE OUTCOMES:
At the end of the Course the student shall be able to
 Implement procedures for the machine learning algorithms.

 Design Python programs for various Learning algorithms.
 Apply appropriate data sets to the Machine Learning algorithms.
 Identify and apply Machine Learning algorithms to solve real world problems.
 Design and develop Python programs to implement linear and polynomial regression.
LIST OF PROGRAMS:
1. Write a Program to perform the following operations on matrices
a) Matrix addition
b) Matrix Subtraction
c) Matrix Multiplication
d) Matrix Inversion
e) Transpose of a Matrix
2. Write a Program to perform the following operations
a) Find the minimum and maximum element of the matrix
b) Find the minimum and maximum element of each row in the matrix
c) Find the minimum and maximum element of each column in the matrix
d) Find trace of the given matrix
e) Find rank of the given matrix
f) Find eigenvalues and eigenvectors of the given matrix
3. Write a Program to find the mean, median, standard deviation and mode using user defined
functions.
4. Create a data frame with columns at least 5 observations
a) Retrieve a particular column from the DataFrame
b) Summarize the data frame and observe the statistics of the DataFrame created
c) Observe the mean and standard deviation of the data frame and print the values.
5. Write a program to implement the Linear Regression for a sample training data set stored as
a .CSV file. Compute Mean Square Error by considering few test data sets.
6. Write a program to implement the Non-linear Regression for a sample training data set
stored as a .CSV file. Compute Mean Square Error by considering few test data sets.
7. Write a program to implement the Logistic Regression for a sample training data set stored
as a .CSV file. Compute the accuracy of the classifier.
8. Write a program to implement the naïve Bayesian classifier for a sample training data set
stored as a .CSV file. Compute the accuracy of the classifier, considering few test data sets.
9. Write a program to implement k-Nearest Neighbor algorithm to classify the iris data set.
Print both correct and wrong predictions.
10. Write a program to implement Support Vector Machine algorithm to classify the iris data
set. Print both correct and wrong predictions.
11. Write a program to demonstrate the working of the decision tree based ID3 algorithm. Use
an appropriate data set for building the decision tree and apply this knowledge to classify a new
sample.
12. Write a program to demonstrate the working of the decision tree based CART algorithm. Use
an appropriate data set for building the decision tree and apply this knowledge to classify a new
sample.
13. Write a program to construct a Regression tree for cost estimation by assuming any
numerical dataset.
14. Write a program to calculate the accuracy, precision, and recall for your data set. Assume a set of
documents that need to be classified, use the naïve Bayesian Classifier model to perform this task.
15. Implement a single neural network and test for different logic gates.
16. Build an Artificial Neural Network by implementing the Backpropagation algorithm and test the same
using appropriate data sets.
REFERENCES:
1. Vijayvargia, Abhishek, Machine Learning with Python: An Approach to Applied Machine

Learning, BPB Publications, 1st edition,2018.
2. Aurelien Geron, Hands-On Machine Learning with Scikit-Learn and TensorFlow, Oreilly,March 2017.
3. Dr. M Gopal, Applied Machine Learning, 1st Edition, McGraw-Hill,2018.
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 1 2 3 2 2 1 - 1 - - - - - - -
2 1 3 2 2 - 1 1 - - - - - - -
3 1 1 3 1 1 1 - - - - - - - -
4 2 1 1 2 - 1 1 - - - - - - -
5 1 1 3 2 2 1 - - - - - - -
AVG 4.2 4.2 10.2 9.4 5.4 0.6 0.6 0. - - - - - - -

6
SOFTWARE ENGINEERING AND QUALITY ASSURANCE LTPC

3 003
COURSE OBJECTIVES :
● To understand Software Engineering Lifecycle Models
● To Perform software requirements analysis

● To define the analysis, design concepts and principles of software requirement.
● To understand software testing and maintenance approaches
● To work on Quality Assurance and Standards in software.
UNIT I SOFTWARE PRODUCT AND PROCESS 9

Introduction – S/W Engineering Paradigm – Verification – Validation – Life Cycle Models – System
Engineering – Computer Based System – Business Process Engineering Overview – Product Engineering
Overview.
UNIT II SOFTWARE REQUIREMENTS 9

Functional and Non-Functional – Software Document – Requirement Engineering Process – Feasibility
Studies – Software Prototyping – Prototyping in the Software Process – Data – Functional and Behavioral
Models – Structured Analysis and Data Dictionary.
UNIT III ANALYSIS, DESIGN CONCEPTS AND PRINCIPLES 9

Systems Engineering - Analysis Concepts - Design Process And Concepts – Modular Design – Design
Heuristic – Architectural Design – Data Design – User Interface Design – Real Time Software Design –
System Design – Real Time Executives – Data Acquisition System – Monitoring And Control System.
UNIT IV TESTING 9
Taxonomy Of Software Testing – Types Of S/W Test – Black Box Testing – Testing Boundary Conditions
– Structural Testing – Test Coverage Criteria Based On Data Flow Mechanisms – Regression Testing –
Unit Testing – Integration Testing – Validation Testing – System Testing And Debugging – Software
Implementation Techniques.
UNIT V SOFTWARE QUALITY ASSURANCE 9

Process and Product Quality – Quality Assurance and Standards – Quality Planning and Control – Software
metrics – Process Improvement – Software configuration Management.
TOTAL: 45 PERIODS
COURSE OUTCOMES:
CO1: Compare various Software Development Lifecycle Models.
CO2: Evaluate project management approaches as well as cost and schedule estimation strategies.
CO3: Perform formal analysis on specifications.
CO4: Architect and design using architectural styles and design patterns, and test the system.
CO5: Explain the quality assurance and standard in software.
TEXT BOOKS:
1. Ian Sommerville, “Software engineering”, Seventh Edition, Pearson Education Asia, 2007.
2. Roger S. Pressman, “Software Engineering – A practitioner’s Approach”, Sixth Edition,
McGraw-Hill International Edition, 2005.
REFERENCES:
1. Watts S.Humphrey,”A Discipline for Software Engineering”, Pearson Education, 2007.
2. James F.Peters and Witold Pedrycz,”Software Engineering, An Engineering Approach”, Wiley-
India, 2007.
3. Stephen R.Schach, “ Software Engineering”, Tata McGraw-Hill Publishing Company Limited,
2007.
4. S.A.Kelkar,”Software Engineering”, Prentice Hall of India Pvt, 2007.
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 2 1 2 2 - - - - 1 1 2 2 2 1
2 2 3 2 3 2 - - - 2 2 3 2 3 2 1
3 2 3 2 1 1 - - - 2 2 3 2 2 3 1
4 2 3 2 2 3 - - - 2 2 3 2 2 3 1
5 2 3 1 2 2 - - - - - - 1 3 2 2
AVG 2 2 1 2 2 - - - 1.2 1 1 2 2 2 1
Professional Elective 4
NETWORK PROGRAMMING LTPC

3 003
COURSE OBJECTIVES :
● To understand the concept of layering in networks.
● Understand the concepts of address structures and their significance in network programming.
● Apply signal handling techniques to manage server process termination gracefully.
● Implement the poll function to monitor multiple file descriptors for I/O readiness and optimize resource
utilization.
● Understand the fundamentals of UDP and its role in communication protocols.
UNIT I NETWORK MODELS AND STANDARDS 9

OSI model, Unix standards, TCP and UDP & TCP connection establishment and Format, Buffer sizes and
limitation, standard internet services, Protocol usage by common internet application.
UNIT II SOCKETS 9
Address structures, value – result arguments, Byte ordering and manipulation function and related
functions Elementary TCP sockets – Socket, connect, bind, listen, accept, fork and exec function,
concurrent servers, Close function.
UNIT III TCP CLIENT SERVER 9

Introduction, TCP Echo server functions, Normal startup, terminate and signal handling server process
termination, Crashing and Rebooting of server host shutdown of server host.
UNIT IV I/O MULTIPLEXING AND SOCKET OPTIONS 9

I/O Models, select function, Batch input, shutdown function, poll function, TCP Echo server..
UNIT V ELEMENTARY UDP SOCKETS 9

Introduction UDP Echo server function, lost datagram, summary of UDP example, Lack of flow control
with UDP, determining outgoing interface with UDP.
TOTAL: 45 PERIODS
COURSE OUTCOMES:
CO1: Familiar with UNIX based TCP/IP concepts and standard internet services.
CO2: Know the usage of data manipulation functions during the network communication.
CO3: Understand the TCP and UDP services and related UNIX System Calls.
CO4: Differentiate the concurrent server and iterative server.
CO5: Design UDP client and server application to echo the given input sentence.
TEXT BOOKS:
1.W. Richard Stevens, “UNIX Network Programming Vol. I Sockets API”, 3nd Edition, Pearson,
2015.
2. W.Richard Stevens, “UNIX Network Programming”, 1st Edition, PHI, 1990.
REFERENCES:
1. King abls, “UNIX for Programmers and Users”, 3rd Edition, Pearson, 2003.
2. M.J.Rochkind, “Advanced UNIX Programming”, 2nd Edition, Pearson, 2000.
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 1 - - - 2 3 - - - - 2 - - -
2 3 2 - - - 3 3 - - - - 2 - - -
3 3 - 1 - - 2 2 - - - - 2 - - -
4 3 2 1 1 - 2 2 - - - - 2 - - -
5 3 2 1 - - 2 2 - - - - 1 - - -
AVG 2.8 1.8 1 1 - 2.2 2.4 - - - - 1.8 - - -
FOG AND EDGE COMPUTING LTPC

3 003
COURSE OBJECTIVES :
● Examine the Fog-IoT architectural model and its components.
● Understand the concept of Fog Computing and its role in enhancing health monitoring systems.
● Discuss the implementation of SDN in home networks and its benefits in terms of flexibility, control,
and security.
● Analyze the benefits and challenges associated with Edge Computing adoption.
● Explore the value of a network in IoT ecosystems, referencing Metcalfe's and Beckstrom's laws
UNIT I EDGE COMPUTING 9

Fog computing requirements when applied to IoT - Scalability, Interoperability, Fog - IoT
architectural model - Challenges on IoT Stack Model via TCP/IP Architecture - Data Management,
filtering - Event Management - Device Management – cloudification - virtualization, security and
privacy issues. Integrating IoT – Fog - Cloud Infrastructures: Methodology - Integrated C2F2T
Literature by Modeling Technique re by Use-Case Scenarios - Integrated C2F2T Literature by
Metrics.
UNIT II FOG COMPUTING IN HEALTH MONITORING 9

Exploiting Fog Computing in Health Monitoring : An Architecture of a Health Monitoring IoT- Based
System with Fog Computing , Fog Computing Services in Smart E-Health Gateways, Discussion of
Connected Components. Fog Computing Model for Evolving Smart Transportation Applications:
Introduction , Data-Driven Intelligent Transportation Systems , Fog Computing for Smart
Transportation Applications Case Study: Intelligent Traffic Lights Management (ITLM) System.
UNIT III FOG COMPUTING APPLICATION 9

Software Defined Networking and application in Fog Computing: Open Flow Protocol, Open Flow
Switch, SDN in Fog Computing, Home Network using SDN. Security and Privacy issues: Trust and
privacy issues in IoT Network, web Semantics and trust Management for Fog Computing, Machine
Learning based security in Fog Computing, Cyber- Physical Energy Systems over Fog Computing
UNIT IV INTRODUCTION TO EDGE COMPUTING 9

Introduction to Edge Computing Scenarios and Use cases - Edge computing purpose and definition,
Edge computing use cases, Edge computing hardware architectures, Edge platforms, Edge vs Fog
Computing, Communication Models - Edge, Fog, and M2M.
UNIT V IOT ARCHITECTURE AND CORE IOT MODULES 9

IoT Architecture and Core IoT Modules-A connected ecosystem,IoT versus machine-to-machine
versus, SCADA, The value of a network and Metcalfe's and Beckstrom's laws, IoT and edge
architecture, Role of an architect, Understanding Implementations with the examples- Edge
computing with RaspberryPi, Industrial, and Commercial IoT and Edge, and Edge computing and
solutions.
TOTAL: 45 PERIODS
COURSE OUTCOMES:
CO1: Explore the need for new computing paradigms.
CO2: Explain the major components of fog and edge computing architectures.
CO3: Identify potential technical challenges of the transition process and suggest solutions.
CO4: Analyze data and application requirements and pertaining issues.
CO5: Design and model infrastructures.
TEXT BOOKS:
1.Fog Computing: Theory and Practice by Assad Abbas, Samee U. Khan, Albert Y. Zomaya
2. IoT and Edge Computing for Architects - Second Edition, by Perry Lea, Publisher: Packt
Publishing, 2020, ISBN: 9781839214806
3. Raspberry Pi Cookbook, 3rd Edition, by Simon Monk, Publisher: O'Reilly Media, Inc.,
2019, ISBN: 978149204322
4. David Jensen, “Beginning Azure IoT Edge Computing: Extending the Cloud to the
Intelligent Edge, MICROSOFT AZURE
REFERENCES:
4. Fog and Edge Computing: Principles and Paradigms (Wiley Series on Parallel and
Distributed Computing) by RajkumarBuyya and Satish Narayana Srirama
5. FlavioBonomi, Rodolfo Milito, Jiang Zhu, SateeshAddepalli, ―Fog Computing and
Its Role in the Internet of Thingsǁ, MCC’12, August 17, 2012, Helsinki, Finland.
Copyright 2012 ACM 978- 1-4503-1519-7/12/08... $15.00.
6. Shanhe Yi, Cheng Li, Qun Li, ―A Survey of Fog Computing: Concepts,
Applications and Issuesǁ, Mobidata’15, ACM 978-1-4503-3524-9/15/06, DOI:
10.1145/2757384.2757397, June 21, 2015, Hangzhou, China..
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 2 1 2 - 2 3 - - - - 2 2 2 1
2 2 3 2 3 - 3 3 - - - - 2 3 2 1
3 2 3 2 1 - 2 2 - - - - 2 2 3 1
4 2 3 2 2 - 2 2 - - - - 2 2 3 1
5 2 3 1 2 - 2 2 - - - - 1 3 2 2
AV 2 2 1 2 - 2.2 2.4 - - - - 1.8 2 2 1

G
MULTIMEDIA LTPC
3 003
COURSE OBJECTIVES :
 To grasp the fundamental knowledge of Multimedia elements and systems
 To get familiar with Multimedia file formats and standards
 To learn the process of Authoring multimedia presentations
 To learn the techniques of animation in 2D and 3D and for the mobile UI
 To explore different popular applications of multimedia
UNIT I INTRODUCTION TO MULTIMEDIA 9

Definitions, Elements, Multimedia Hardware and Software, Distributed multimedia systems, challenges:
security, sharing / distribution, storage, retrieval, processing, computing. Multimedia metadata, Multimedia
databases, Hypermedia, Multimedia Learning.
UNIT II MULTIMEDIA FILE FORMATS AND STANDARDS 9

File formats – Text, Image file formats, Graphic and animation file formats, Digital audio and Video file
formats, Color in image and video, Color Models. Multimedia data and file formats for the web.
UNIT III MULTIMEDIA AUTHORING 9

Authoring metaphors, Tools Features and Types: Card and Page Based Tools, Icon and Object Based
Tools, Time Based Tools, Cross Platform Authoring Tools, Editing Tools, Painting and Drawing Tools,
3D Modeling and Animation Tools, Image Editing Tools, audio Editing Tools, Digital Movie Tools,
Creating interactive presentations, virtual learning, simulations.
UNIT IV ANIMATION 9
Principles of animation: staging, squash and stretch, timing, onion skinning, secondary action, 2D, 2 ½ D,
and 3D animation, Animation techniques: Keyframe, Morphing, Inverse Kinematics, Hand Drawn,
Character rigging, vector animation, stop motion, motion graphics, , Fluid Simulation, skeletal animation,
skinning Virtual Reality, Augmented Reality.
UNIT V MULTIMEDIA APPLICATIONS 9

Multimedia Big data computing, social networks, smart phones, surveillance, Analytics, Multimedia Cloud
Computing, Multimedia streaming cloud, media on demand, security and forensics, Online social
networking, multimedia ontology, Content based retrieval from digital libraries.
TOTAL: 45 PERIODS
COURSE OUTCOMES:
CO1: Get the bigger picture of the context of Multimedia and its applications
CO2: Use the different types of media elements of different formats on content pages
CO3: Author 2D and 3D creative and interactive presentations for different target multimedia applications.
CO4: Use different standard animation techniques for 2D, 21/2 D, 3D applications
CO5: Understand the complexity of multimedia applications in the context of cloud, security, bigdata
streaming, social networking, CBIR etc.,
TEXT BOOKS:
1. Ze-Nian Li, Mark S. Drew, Jiangchuan Liu, Fundamentals of Multimedia”, Third Edition,
Springer Texts in Computer Science, 2021.
REFERENCES:
1.John M Blain, The Complete Guide to Blender Graphics: Computer Modeling & Animation,
CRC press, 3rd Edition, 2016.
2. Gerald Friedland, Ramesh Jain, “Multimedia Computing”, Cambridge University Press, 2018.
3. Prabhat K.Andleigh, Kiran Thakrar, “Multimedia System Design”, Pearson Education, 1st
Edition, 2015.
4.Mohsen Amini Salehi, Xiangbo Li, “Multimedia Cloud Computing Systems”, Springer Nature,
1st Edition, 2021.
5.Mark Gaimbruno, “3D Graphics and Animation”, Second Edition, New Riders, 2002.
6.Rogers David, “Animation: Master – A Complete Guide (Graphics Series)”, Charles River
Media, 2006.
7.Rick parent, “Computer Animation: Algorithms and Techniques”, Morgan Kauffman, 3rd
Edition, 2012.
8.Emilio Rodriguez Martinez, Mireia Alegre Ruiz, “UI Animations with Lottie and After Effects:
Create, render, and ship stunning After Effects animations natively on mobile with React Native”, Packt
Publishing, 2022.
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 3 2 3 - - - 3 2 1 2 3 2 3
2 3 3 3 3 3 - - - 3 3 2 2 3 2 3
3 3 3 3 3 3 - - - 3 3 2 3 3 2 3
4 3 3 3 3 3 2 - - 3 3 3 3 3 3 3
5 3 3 3 3 3 2 - - 3 3 3 3 3 3 3
AVG 3 2.8 3 2.8 3 2 - - 3 2.8 2.2 2.6 3 2.4 3
ETHICAL HACKING LTPC

3 003
COURSE OBJECTIVES :
 To understand the basics of computer based vulnerabilities.
 To explore different foot printing, reconnaissance and scanning methods.

 To expose the enumeration and vulnerability analysis methods.
 To understand hacking options available in Web and wireless applications.
 To explore the options for network protection.
Ethical Hacking Overview - Role of Security and Penetration Testers .- Penetration-Testing
Methodologies- Laws of the Land - Overview of TCP/IP- The Application Layer - The Transport Layer -
The Internet Layer - IP Addressing .- Network and Computer Attacks - Malware - Protecting Against
Malware Attacks.- Intruder Attacks - Addressing Physical Security.
UNIT II FOOT PRINTING, RECONNAISSANCE AND SCANNING NETWORKS 9

Footprinting Concepts - Footprinting through Search Engines, Web Services, Social Networking Sites,
Website, Email - Competitive Intelligence - Footprinting through Social Engineering - Footprinting Tools -
Network Scanning Concepts - Port-Scanning Tools - Scanning Techniques - Scanning Beyond IDS and
Firewall
UNIT III ENUMERATION AND VULNERABILITY ANALYSIS 9

Enumeration Concepts - NetBIOS Enumeration – SNMP, LDAP, NTP, SMTP and DNS Enumeration -
Vulnerability Assessment Concepts - Desktop and Server OS Vulnerabilities – Windows OS
Vulnerabilities - Tools for Identifying Vulnerabilities in Windows- Linux OS Vulnerabilities-
Vulnerabilities of Embedded Oss
UNIT IV SYSTEM HACKING 9

Hacking Web Servers - Web Application Components- Vulnerabilities - Tools for Web Attackers and
Security Testers Hacking Wireless Networks - Components of a Wireless Network – Wardriving- Wireless
Hacking - Tools of the Trade.
UNIT V NETWORK PROTECTION SYSTEMS 9

Access Control Lists. - Cisco Adaptive Security Appliance Firewall - Configuration and Risk Analysis
Tools for Firewalls and Routers - Intrusion Detection and Prevention Systems - Network-Based and Host-
Based IDSs and IPSs - Web Filtering - Security Incident Response Teams – Honeypots.
TOTAL: 45 PERIODS
COURSE OUTCOMES:
CO1: To express knowledge on basics of computer based vulnerabilities
CO2: To gain understanding on different foot printing, reconnaissance and scanning methods.
CO3: To demonstrate the enumeration and vulnerability analysis methods.
CO4: To gain knowledge on hacking options available in Web and wireless applications.
CO5: To acquire knowledge on the options for network protection.
CO6: To use tools to perform ethical hacking to expose the vulnerabilities.
TEXT BOOKS:
1. Michael T. Simpson, Kent Backman, and James E. Corley, Hands-On Ethical Hacking and
Network Defense, Course Technology, Delmar Cengage Learning, 2010.
2. The Basics of Hacking and Penetration Testing - Patrick Engebretson, SYNGRESS, Elsevier,
2013.
3. The Web Application Hacker’s Handbook: Finding and Exploiting Security Flaws, Dafydd
Stuttard and Marcus Pinto, 2011.
REFERENCES:
2. Black Hat Python: Python Programming for Hackers and Pentesters, Justin Seitz , 2014.
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 2 3 1 - - - 2 3 1 2 3 3 3
2 2 2 2 3 3 - - - 1 2 2 3 1 1 3
3 3 3 3 3 3 - - - 2 1 1 2 2 1 3
4 3 3 1 1 1 - - - 1 3 1 3 2 1 1
5 3 2 2 2 3 - - - 2 3 2 2 2 3 3
AVG 2.8 2.4 2 2.4 2.2 - - - 1.6 2.4 1.4 2.4 2 1.8 2.6
DEEP LEARNING LTPC

3 003
COURSE OBJECTIVES :
 To understand and need and principles of deep neural networks
 To understand CNN and RNN architectures of deep neural networks
 To comprehend advanced deep learning models
 To learn the evaluation metrics for deep learning models
 Define under complete autoencoders and their role in dimensionality reduction.
UNIT I DEEP NETWORKS BASICS 9

Linear Algebra: Scalars -- Vectors -- Matrices and tensors; Probability Distributions -- Gradient-based
Optimization – Machine Learning Basics: Capacity -- Overfitting and underfitting --Hyperparameters and
validation sets -- Estimators -- Bias and variance -- Stochastic gradient descent -- Challenges motivating
deep learning; Deep Networks: Deep feedforward networks; Regularization -- Optimization.
UNIT II CONVOLUTIONAL NEURAL NETWORKS 9

Convolution Operation -- Sparse Interactions -- Parameter Sharing -- Equivariance -- Pooling --
Convolution Variants: Strided -- Tiled -- Transposed and dilated convolutions; CNN Learning:
Nonlinearity Functions -- Loss Functions -- Regularization -- Optimizers --Gradient Computation.
UNIT III RECURRENT NEURAL NETWORKS 9

Unfolding Graphs -- RNN Design Patterns: Acceptor -- Encoder --Transducer; Gradient Computation --
Sequence Modeling Conditioned on Contexts -- Bidirectional RNN -- Sequence to Sequence RNN – Deep
Recurrent Networks -- Recursive Neural Networks -- Long Term Dependencies; Leaky Units: Skip
connections and dropouts; Gated Architecture: LSTM.
UNIT IV MODEL EVALUATION 9

Performance metrics -- Baseline Models -- Hyperparameters: Manual Hyperparameter -- Automatic
Hyperparameter -- Grid search -- Random search -- Debugging strategies.
UNIT V AUTOENCODERS AND GENERATIVE MODELS 9

Autoencoders: Undercomplete autoencoders -- Regularized autoencoders -- Stochastic encoders and
decoders -- Learning with autoencoders; Deep Generative Models: Variational autoencoders – Generative
adversarial networks.
TOTAL: 45 PERIODS
COURSE OUTCOMES:
CO1: Explain the basics in deep neural networks
CO2: Apply Convolution Neural Network for image processing
CO3: Apply Recurrent Neural Network and its variants for text analysis
CO4: Apply model evaluation for various applications
CO5: Apply autoencoders and generative models for suitable applications
TEXT BOOKS:
1. Ian Goodfellow, Yoshua Bengio, Aaron Courville, ``Deep Learning'', MIT Press, 2016.
2. Andrew Glassner, “Deep Learning: A Visual Approach”, No Starch Press, 2021.
REFERENCES:
1. Salman Khan, Hossein Rahmani, Syed Afaq Ali Shah, Mohammed Bennamoun, ``A Guide to
Convolutional Neural Networks for Computer Vision'', Synthesis Lectures on Computer Vision, Morgan
& Claypool publishers, 2018.
2. Yoav Goldberg, ``Neural Network Methods for Natural Language Processing'', Synthesis
Lectures on Human Language Technologies, Morgan & Claypool publishers, 2017.
3. Francois Chollet, ``Deep Learning with Python'', Manning Publications Co, 2018.
4. Charu C. Aggarwal, ``Neural Networks and Deep Learning: A Textbook'', Springer International
Publishing, 2018.
5. Josh Patterson, Adam Gibson, ``Deep Learning: A Practitioner's Approach'', O'Reilly Media,
2017.
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 1 - - - 2 3 - - - - 2 - - -
2 3 2 - - - 3 3 - - - - 2 - - -
3 3 - 1 - - 2 2 - - - - 2 - - -
4 3 2 1 1 - 2 2 - - - - 2 - - -
5 3 2 1 - - 2 2 - - - - 1 - - -
AVG 2.8 1.8 1 1 - 2.2 2.4 - - - - 1.8 - - -
AD22301 ARTIFICIAL INTELLIGENCE L T P C
3 0 0 3
OBJECTIVES
The main objectives of this course are to:
 Learn the basic AI approaches to develop problem solving agent
 Learn game playing
 Perform knowledge representation in Logic
 Perform probabilistic reasoning under uncertainty
 Perform Planning and Controlling Uncertain movements in robots
UNIT I PROBLEM-SOLVING 9
Foundations of Artificial Intelligence, History of Artificial Intelligence, State of the Art, Risk and Benefits
of AI Intelligent Agents – Agents and Environments, Concept of Rationality, Nature of Environments,
Structure of Agents; Problem-solving – Problem-Solving Agents, Search Algorithms, Uninformed Search
Strategies Informed Search Strategies, Heuristic Functions
UNIT II ADVERSARIAL SEARCH 9

Game Theory, Optimal Decisions in Games, Heuristic Alpha-Beta Tree Search, Monte Carlo Tree Search,
Stochastic Games; Constraint Satisfaction Problems – Inference, Backtracking Search and Local Search
and Structure of Problems
UNIT III KNOWLEDGE, REASONING AND PLANNING 9

Logical Agents - Knowledge-based agents, Logic, Propositional Logic; First-Order Logic –

Representation, Syntax and Semantics, Using First-Order Logic; Inference in First-Order Logic –
Unification, Forward Chaining, Backward Chaining, Resolution
UNIT IV UNCERTAIN KNOWLEDGE AND REASONING 9

Quantifying Uncertainty – Acting under Uncertainty, Inference using Full Joint Distributions, Bayes’ Rule,
Naive Bayes Model; Probabilistic Reasoning – Representing Knowledge in an Uncertain Domain,
Semantics of Bayesian Networks, Exact Inference, Approximate Inference in Bayesian Networks
Probabilistic Reasoning Over Time – Inference in Temporal Models, Hidden Markov Models
UNIT V ROBOTICS 9
Reinforcement Learning – Learning from Rewards, Passive and Active Reinforcement Learning, Policy
Search Applications; Robotics – Robots, Robots Hardware, Robotic Perception, Planning and Control,
Planning Uncertain Movements, Reinforcement Learning in Robotics, Humans and Robots,
Robotic Frameworks
Application Domains
TOTAL : 45 PERIODS
OUTCOMES:
CO statements RBT
CO Upon successful completion of the course, the students should be able to Level
CO1 Apply intelligent agent frameworks for toy problems 3
CO2 Apply search algorithms for game playing 3
CO3 Perform logical reasoning 3
CO4 Perform probabilistic reasoning under uncertainty 3
CO5 Learn robotic frameworks for various application domains 3
TEXT BOOKS
1. Stuart Russell and Peter Norvig, Artificial Intelligence: A Modern Approach, Pearson, 4th
Edition, 2020
REFERCENCES
6. Dan W. Patterson, “Introduction to AI and ES”, Pearson Education,2007

7. Kevin Night, Elaine Rich, and Nair B., “Artificial Intelligence”, McGraw Hill, 2008
8. Patrick H. Winston, "Artificial Intelligence", Third Edition, Pearson Education, 2006
9. Deepak Khemani, “Artificial Intelligence”, Tata McGraw Hill Education, 2013
10. https://nptel.ac.in/
CO-PO_PSO Mapping
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 - 3 3 3 - - - - - - 3 3 3 3
2 3 3 3 - 3 - - - - - - 3 3 3 3
3 3 - 3 - 3 - - - - - - 3 3 3 3
4 3 - 3 3 3 - - - - - - 3 3 3 3
5 3 3 3 - 3 - - - - - - 3 3 3 3
AVG 3 - 3 3 3 - - - - - - 3 3 3 3
ARTIFICIAL INTELLIGENCE LABORATORY L T P C
0 0 3 1.5
OBJECTIVES
 To design and implement search strategies.

 To implement game playing and CSP techniques.
 To develop systems with logical and probabilistic reasoning.
LIST OF EXPERIMENTS
11. Implement intelligent agents – Vacuum World Problem

12. Implement basic search strategies – 8-Puzzle, 8 - Queens problem
13. Implement A* algorithm – Route-Finding problem
14. Implement Minimax algorithm for game playing (Alpha-Beta pruning)
15. Solve constraint satisfaction problems (Cryptarithmetic, MapColouring)
16. Study of Prolog
17. Implement forward chaining, backward chaining, and resolution strategies in First-order logic
18. Building Naive Bayes model
19. Probabilistic Inferencing in Bayesian Network
20. Implementation of policy search in Reinforcement learning
TOTAL: 45 PERIODS
LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:
Standalone desktops with C/C++/Java/Python/Prolog/JESS compiler 30 Nos.
COURSE OUTCOMES:
CO statements RBT
CO Upon successful completion of the course, the students should be able to level
CO1 Design and implement search strategies 3
CO2 Implement game playing and CSP techniques 3
CO3 Develop logical reasoning and probabilistic systems 3
POs PSOs
COs
1 2 3 4 5 6 7 8 9 10 11 12 1 2
1 3 3 3 3 - - - - 3 3 2 3 3 2
2 3 2 3 3 3 - - - 3 2 3 3 3 3
3 3 3 3 3 3 - - - 3 3 3 3 3 3
3-High, 2-Medium, 1-Low
SOFTWARE TESTING L T P C
3 0 0 3
COURSE OBJECTIVES
 To Understand the roles of software process
 To introduce the basics and necessity of software testing.
 To Know various testing terminologies and techniques.
 To understand various the levels and types of testing
 To learn to manage automation in testing.
Unit 1 SOFTWARE PROCESS FUNDAMENTALS 9

Generic process model, Process Assessment and Improvement, Prescriptive Process

models, Specialized Process models, Personal and Team Process models. Agile
Development - Software Requirements: Functional and Non-Functional, User
requirements, System requirements, Software Requirements Document
Unit 2 SOFTWARE TESTING FUNDAMENTALS 9

Testing activities in software life cycle, Readiness of a Product: dependability, availability,
MTBF, reliability, alpha test, beta test , regression test; Validation and Verification; Basic
Principles; Test and Analysis Activities - Within a Software Process: The Quality Process,
Planning and Monitoring, Quality Goals, Dependability Properties, Analysis, Testing,
Improving the Process;
Unit 3 TESTING TECHNIQUES 9

Using White Box Approach to Test design - Static Testing Vs. Structural Testing – Code
Functional Testing – Coverage and Control Flow Graphs –Using Black Box Approaches to
Test Case Design – Random Testing – Requirements based testing –Decision tables –State-
based testing – Cause-effect graphing – Error guessing.
Unit 4 TEST LEVELS AND METHODOLOGIES 9

Levels of Testing - Unit Testing - Integration Testing - Defect Bash Elimination- System
Testing– System and Acceptance Testing – Testing Strategies – White Box and Black Box
Approach- Compatibility testing-Performance Testing – Regression Testing -
Internationalization Testing – Ad-hoc Testing – Website Testing –Usability and
Accessibility Testing – Configuration Testing - Compatibility Testing - MC/DC Testing,
Mutation testing, Case study for White box testing and Black box testing techniques.
Unit 5 TEST AUTOMATION AND MANAGEMENT 9

Test plan – Management – Execution and Reporting – Software Test Automation – Test
Automation framework - Agile Testing - End-to-end test automation - Automated Testing
tools - Hierarchical Models of Software Quality – Configuration Management –
Documentation Control.
Total :45 Periods

COURSE OUTCOMES:
CO# Course Outcomes
1 Analyze the various software life cycle models and its roles of software process
2 Compare test activities within a software process
3 Differentiate between different testing techniques
4 Apply suitable types of testing methodologies
5 Perform automated test and configuration management with documentation.
TEXT BOOKS:
1. Roger S. Pressman, ―Software Engineering – A Practitioner‘s Approach‖, Seventh
Edition, Mc Graw-Hill International Edition, 2010.
2. Yogesh Singh, ―Software Testing‖, Cambridge University Press, 2012
3. Srinivasan Desikan, Gopalaswamy Ramesh,‖ Software Testing – Principles and

Practices‖, Pearson Education,2006
4. William Perry, ―Effective Methods of Software Testing‖, Third Edition, Wiley
Publishing 2007
5. Automated Software Testing: Foundations, Applications and Challenges, Ajay Kumar
Jena, Himansu Das, Durga Prasad Mohapatra, I Edition, Springer, 2020.
REFERENCES:
1. Agile Testing: A Practical Guide for Testers and Agile Teams, Crispin Lisa, Gregory
Janet, Addison-Wesley Signature Series, 2008
2. Aditya Mathur, ―Foundations of Software Testing‖, Pearson Education, 2008
3. Ron Patton,‖Software Testing‖ , Second Edition, Pearson Education, 2007
COs POs PSOs

1 2 3 4 5 6 7 8 9 10 11 12 13 14
1. 3 3 3 3 3 2 1 1 1 - 2 1 2 2
2. 3 3 2 2 3 2 - 1 2 2 - 1 2 3
3. 3 3 2 2 3 2 - 1 1 1 - 1 2 3
4. 3 3 2 2 3 2 - 1 1 1 2 1 2 3
5. 3 3 2 2 3 2 1 1 2 2 2 1 2 3
PROFESSIONAL ELECTIVE V
REACT JS LTPC 3003
COURSE OBJECTIVES:
At the end of the course the students will understand:
 Basics of JavaScript used in React and functional programming with JavaScript.
 Develop applications by using JSX and state management.
 Demonstrate modern web applications by using enhanced components with hooks
 . React Router and leverage its features to handle routing on the client and server.
UNIT I 9
Introducing React: Old School Multi-Page Design, New School Single-Page Apps, Meet React -
Automatic UI State Management, Lightning-fast DOM Manipulation, APIs to Create Truly
Composable UIs, Visuals Defined Entirely in JavaScript, Just the V in an MVC Architecture,
React’s Past and Future. JavaScript for React: Declaring Variables, Creating Functions, Compiling
JavaScript, Objects and Arrays, Asynchronous JavaScript, Classes, ES6 Modules. Functional
Programming with JavaScript: Imperative versus Declarative, Functional Concepts - Immutability,

Pure Functions, Data Transformations, Higher-Order Functions, Recursion, Composition, Putting It
All Together.
UNIT II 9
How React Works: Page Setup, React Elements, ReactDOM, React Components. React with JSX:
React Elements as JSX, Babel, Recipes as JSX, React Fragments, Intro to webpack. React State
Management: Building a Star Rating Component, The useState Hook, Refactoring for Advanced
Reusability, State in Component Trees, Building Forms, React Context.
UNIT III 9
Enhancing Components with Hooks: Introducing useEffect - The Dependency Array, Deep
Checking Dependencies, When to useLayoutEffect, Rules to Follow with Hooks, Improving Code
with useReducer, useReducer to Handle Complex State, Improving Component Performance,
shouldComponentUpdate and PureComponent, When to Refactor. Incorporating Data: Requesting
Data, Render Props, Virtualized Lists, Introducing GraphQL. Suspense: Error Boundaries, Code
Splitting.
UNIT IV 9
React.js: React installation and application setup, JSX, React Classes and Components, Rendering
of elements, Properties, State, Context, Component lifecycle methods, Refs & Keys, Handling
events and forms, React Router, Stateless components, React form & controls, State management
with Redux or Context API, Asynchronous data fetching with Axios or Fetch API, React hooks –
useState, useEffect
UNIT V 9
React Router: Incorporating the Router, Router Properties, Using Redirects. React and the Server:
Isomorphic Versus Universal, Server Rendering React, Server Rendering with Next.js, Gatsby,
React in the Future.
COURSE OUTCOMES:
After successful completion of the course, the students are able to:
 Summarize the ES6 features and implement functional techniques with JavaScript.
 Design and develop React applications with JSX and state management.
 Create modern data driven React web application by using enhanced components
with hooks.
 Design and implement client – server applications by using React Router.
TEXT BOOK:
1. Learning React: Modern Patterns for Developing React Apps by Alex Banks and Eve Porcello,
2nd Edition, Published by O’Reilly.
REFERENCES:
1. Learning React: A Hands-On Guide to Building Web Applications Using React and Redux by
Kirupa Chinnathambi, Second edition, Addison-Wesley Professional.
2. Fullstack React: The Complete Guide to ReactJS and Friends by Anthony Accomazzo, Nate
Murray, Ari Lerner, Clay Allsopp, David Gutman, and Tyler McGinnis.
Web References:
1. https://reactjs.org/
2. https://www.geeksforgeeks.org/reactjs-tutorials/
3. www.w3schools.com
4. www.tutorialspot.com
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 2 3 1 - - - 2 3 1 2 3 3 3
2 2 2 2 3 3 - - - 1 2 2 3 1 1 3
3 3 3 3 3 3 - - - 2 1 1 2 2 1 3
4 3 3 1 1 1 - - - 1 3 1 3 2 1 1
5 3 2 2 2 3 - - - 2 3 2 2 2 3 3
AVG 2.8 2.4 2 2.4 2.2 - - - 1.6 2.4 1.4 2.4 2 1.8 2.6
DATA MINING & DATA WAREHOUSING LTPC 3003
COURSE OBJECTIVE
 To understand the principles of Data warehousing and Data Mining.
 To be familiar with the Data warehouse architecture and its Implementation.
 To know the Architecture of a Data Mining system.
 To understand the various Data preprocessing Methods.
 To perform classification and prediction of data.
UNIT I
Data Warehousing and Business Analysis: - Data warehousing Components –Building a Data warehouse –
Data Warehouse Architecture – DBMS Schemas for Decision Support – Data Extraction, Cleanup, and
Transformation Tools –Metadata – reporting – Query tools and Applications – Online Analytical
Processing (OLAP) – OLAP and Multidimensional Data Analysis.
UNIT II
Data Mining: - Data Mining Functionalities – Data Preprocessing – Data Cleaning – Data Integration and
Transformation – Data Reduction – Data Discretization and Concept Hierarchy Generation- Architecture
Of A Typical Data Mining Systems- Classification Of Data Mining Systems.
Association Rule Mining: - Efficient and Scalable Frequent Item set Mining Methods – Mining Various
Kinds of Association Rules – Association Mining to Correlation Analysis – Constraint-Based Association
Mining.
UNIT III
Classification and Prediction: - Issues Regarding Classification and Prediction – Classification by Decision
Tree Introduction – Bayesian Classification – Rule Based Classification – Classification by Back
propagation – Support Vector Machines – Associative Classification – Lazy Learners – Other
Classification Methods – Prediction – Accuracy and Error Measures – Evaluating the Accuracy of a
Classifier or Predictor – Ensemble Methods – Model Section.
UNIT IV
Cluster Analysis: - Types of Data in Cluster Analysis – A Categorization of Major Clustering Methods –
Partitioning Methods – Hierarchical methods – Density-Based Methods – Grid-Based Methods – Model-
Based Clustering Methods – Clustering High-Dimensional Data – Constraint-Based Cluster Analysis –
Outlier Analysis.
UNIT V
Mining Object, Spatial, Multimedia, Text and Web Data:
Multidimensional Analysis and Descriptive Mining of Complex Data Objects – Spatial Data Mining –
Multimedia Data Mining – Text Mining – Mining the World Wide Web.
Course Outcome
 Technical knowhow of the Data Mining principles and techniques for real time applications.
Text Book
1. Jiawei Han, Micheline Kamber and Jian Pei“Data Mining Concepts and Techniques”, Third Edition,
Elsevier, 2011.
Reference Books
1. Alex Berson and Stephen J. Smith “Data Warehousing, Data Mining & OLAP”, Tata McGraw – Hill
Edition, Tenth Reprint 2007.
2. K.P. Soman, Shyam Diwakar and V. Ajay “Insight into Data mining Theory and Practice”, Easter
Economy Edition, Prentice Hall of India, 2006.
3. G. K. Gupta “Introduction to Data Mining with Case Studies”, Easter Economy Edition, Prentice
Hall of India, 2006.
4. Pang-Ning Tan, Michael Steinbach and Vipin Kumar “Introduction to Data Mining”, Pearson
Education, 2007.
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 2 3 1 - - - 2 3 1 2 3 3 3
2 2 2 2 3 3 - - - 1 2 2 3 1 1 3
3 3 3 3 3 3 - - - 2 1 1 2 2 1 3
4 3 3 1 1 1 - - - 1 3 1 3 2 1 1
5 3 2 2 2 3 - - - 2 3 2 2 2 3 3
AVG 2.8 2.4 2 2.4 2.2 - - - 1.6 2.4 1.4 2.4 2 1.8 2.6
DIGITAL FORENSIC LTPC 3003
COURSE OBJECTIVES
 To understand the basic digital forensics and techniques for conducting the forensic examination on
different digital devices.
 To understand how to examine digital evidences such as the data acquisition, identification analysis.
Unit -I
Computer forensics fundamentals, Benefits of forensics, computer crimes, computer forensics evidence and
courts, legal concerns and private issues.
Unit- II
Understanding Computing Investigations – Procedure for corporate High-Tech investigations,
understanding data recovery work station and software, conducting and investigations.
Unit-III
Data acquisition- understanding storage formats and digital evidence, determining the best acquisition
method, acquisition tools, validating data acquisitions, performing RAID data acquisitions, remote network
acquisition tools, other forensics acquisitions tools.
Unit-IV
Processing crimes and incident scenes, securing a computer incident or crime, seizing digital evidence at
scene, storing digital evidence, obtaining digital hash, reviewing case.
Unit-V
Current computer forensics tools- software, hardware tools, validating and testing forensic software,
addressing data-hiding techniques, performing remote acquisitions, E-Mail investigations- investigating
email crime and violations, understanding E-Mail servers, specialized E-Mail forensics tool.
Outcome
 Know how to apply forensic analysis tools to recover important evidence for identifying computer
crime.
 To be well-trained as next-generation computer crime investigators.
Text Books:
1. Warren G. Kruse II and Jay G. Heiser, “Computer Forensics: Incident Response Essentials”,
Addison Wesley, 2002.
2. Nelson, B, Phillips, A, Enfinger, F, Stuart, C., “Guide to Computer Forensics and Investigations,
2nd ed., Thomson Course Technology, 2006, ISBN: 0-619-21706-5.
Reference Books:
1. Vacca, J, Computer Forensics, Computer Crime Scene Investigation, 2nd Ed, Charles River Media,
2005, ISBN: 1-58450-389.

CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 2 3 1 - - - 2 3 1 2 3 3 3
2 2 2 2 3 3 - - - 1 2 2 3 1 1 3
3 3 3 3 3 3 - - - 2 1 1 2 2 1 3
4 3 3 1 1 1 - - - 1 3 1 3 2 1 1
5 3 2 2 2 3 - - - 2 3 2 2 2 3 3
AVG 2.8 2.4 2 2.4 2.2 - - - 1.6 2.4 1.4 2.4 2 1.8 2.6
NATURAL LANGAUGE PROCESSING LTPC 3003

COURSE OBJECTIVES:
The student should be made to:
-> Learn the techniques in natural language processing.
-> Be familiar with the natural language generation.
-> Be exposed to machine translation.
-> Understand the information retrieval techniques.
UNIT I OVERVIEW AND LANGUAGE MODELING

Overview: Origins and challenges of NLP-Language and Grammar-Processing Indian Languages - NLP
Applications-Information Retrieval. Language Modeling: Various Grammar- based Language Models-
Statistical Language Model.
UNIT II WORD LEVEL AND SYNTACTIC ANALYSIS

Word Level Analysis: Regular Expressions-Finite-State Automata-Morphological Parsing-Spelling Error
Detection and correction-Words and Word classes-Part-of Speech Tagging. Syntactic Analysis: Context-
free Grammar-Constituency- Parsing-Probabilistic Parsing.
UNIT III SEMANTIC ANALYSIS AND DISCOURSE PROCESSING

Semantic Analysis: Meaning Representation-Lexical Semantics- Ambiguity-Word Sense Disambiguation.
Discourse Processing: cohesion-Reference Resolution- Discourse Coherence and Structure.
UNIT IV NATURAL LANGUAGE GENERATION AND MACHINE TRANSLATION

Natural Language Generation: Architecture of NLG Systems- Generation Tasks and
Representations- Application of NLG. Machine Translation: Problems in Machine Translation-
Characteristics of Indian Languages- Machine Translation Approaches-Translation involving Indian
Languages.
UNIT V INFORMATION RETRIEVAL AND LEXICAL RESOURCES

Information Retrieval: Design features of Information Retrieval Systems-Classical, Non-
classical, Alternative Models of Information Retrieval – valuation Lexical Resources: World Net-Frame
Net- Stemmers-POS Tagger- Research Corpora.
TOTAL: 45 PERIODS
COURSE OUTCOMES
Upon completion of the course, the student should be able to:
-> Analyze the natural language text.
-> Generate the natural language.
-> Do machine translation.
-> Apply information retrieval techniques.
TEXT BOOK:
1. Tanveer Siddiqui, U.S. Tiwary, “Natural Language Processing and Information Retrieval”,
Oxford University Press, 2008.
REFERENCES:
1. Daniel Jurafsky and James H Martin, “Speech and Language Processing: An introduction to Natural
Language Processing, Computational Linguistics and Speech Recognition”, 2nd Edition, Prentice Hall,
2008.
2. James Allen, “Natural Language Understanding”, 2nd edition, Benjamin /Cummings
publishing company, 1995.
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 2 3 1 - - - 2 3 1 2 3 3 3
2 2 2 2 3 3 - - - 1 2 2 3 1 1 3
3 3 3 3 3 3 - - - 2 1 1 2 2 1 3
4 3 3 1 1 1 - - - 1 3 1 3 2 1 1
5 3 2 2 2 3 - - - 2 3 2 2 2 3 3
AVG 2.8 2.4 2 2.4 2.2 - - - 1.6 2.4 1.4 2.4 2 1.8 2.6
XT BOOK:
Parallel Processing to the Internet of Things", Morgan Kaufmann Publishers, 2012
2. Rittinghouse, JohnW., and James F. Ransome,―Cloud Computing: Implementation,
Management and Security‖ , CRC Press, 2017.
REFERENCES:
1. Rajkumar Buyya, Christian Vecchiola, S. ThamaraiSelvi, ―Mastering Cloud Computing, Tata

Mcgraw Hill, 2013.
2. Toby Velte, Anthony Velte, Robert Elsenpeter, "Cloud Computing -A Practical Approach, Tata
Mcgraw Hill, 2009.
3. George Reese, "Cloud Application Architectures: Building Applications and Infrastructure in
the Cloud: Transactional Systems for EC2 and Beyond (Theory in Practice), O'Reilly, 2009
Correlation of Course Outcome (CO) with Program Outcomes (PO):
CO/
PO
PO1
PO2
PO
3
PO4
PO5
PO6
PO7
PO
8
PO9
PO1
0
PO11
PO1
2
PSO1
PSO2
CO
1
2
2
--
--
--
--
--
--
--
--
--
--
3
3
CO
2
3
3
1
--
1
--
--
--
--
--
2
--
3
3
CO
3
3
3
2
--
1
--
--
--
--
--
2
--
3
3
CO
4
3
3
1
--
1
--
--
--
--
--
2
--
3
3
CO
5
2
2
--
--
--
--
--
--
--
--
--
--
3
3
2.6
2.6
1.3
--
1
--
--
--
--
--
2
--
3.00
3.00
1: Low 2: Medium 3: High
Faculty-in-Charge HoD/CSE
WEB & CLOUD SERVICES LTPC 3003
OBJECTIVES:
The student should be made to:
 Understand the division of network functionalities into layers.
 Be familiar with the components required to build different types of networks
 Be exposed to the required functionality at each layer
 Learn the flow control and congestion control algorithms
UNIT I Cloud Web concepts 9

Search engine, Apache Hadoop, Grid Computing, Amazon Web Services, REST APIs, SOAP API, Query
API, User Authentication, Connecting to the Cloud, Open SSH Keys, Tunneling / Port , Forwarding, Image
(glance), Object Storage (swift), ACL, Logging, Signed URI, Compute (nova),Cloud value proportion,
Cloud economics, cloud architecture and design principles, AWS Cloud basic services.
Unit II Networking & Storage 9

Overview, Key pairs, Network Types, LAN, Gateways and Router, IP Classes and Subnets, CIDR,
Utilities, Instances Test-1 Management, Image Management, direct connect, hybrid deployments, VPN,
Security groups, Block Storage (cinder), Ubuntu in the Cloud, Installation, Utilities, File system, basic
concepts of storage and databases, various storage services, storage solutions, database services.
UNIT III Global Infrastructure and Security 9

Methods of deploying and operating cloud, global infrastructure, availability zone, benefits of Cloud Front
and Edge locations. AWS Corer services, resources for technology support, methods for provisioning
services, Benefits of shared responsibility model, layers of security, Multi Factor Authentication, Identity
Access Management Security levels, security policies, benefits of compliance, security services.
UNIT IV Monitoring & Pricing 9

Approaches for monitoring, benefits of Cloud watch, CloudTrial, Trust Advisor, Pricing and support
model, free tire, benefits of organization and consolidated billing, Budgets, Explorer, AWS pricing
calculator, various AWS support plans, AWS market place.
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 2 3 1 - - - 2 3 1 2 3 3 3
2 2 2 2 3 3 - - - 1 2 2 3 1 1 3
3 3 3 3 3 3 - - - 2 1 1 2 2 1 3
4 3 3 1 1 1 - - - 1 3 1 3 2 1 1
5 3 2 2 2 3 - - - 2 3 2 2 2 3 3
AVG 2.8 2.4 2 2.4 2.2 - - - 1.6 2.4 1.4 2.4 2 1.8 2.6

Cse Autonomous Syllabus 31 05 24

Uploaded by

Copyright:

Available Formats

Cse Autonomous Syllabus 31 05 24

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Cse Autonomous Syllabus 31 05 24

Uploaded by

Copyright:

Available Formats

Kunnam, TK, Sunguvarchatram, Sriperumbudur, Tamil Nadu 631604

ANNA UNIVERSITY, CHENNAI

I. PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

1 Engineering knowledge: Apply the knowledge of mathematics, science, engineering

3 Design/development of solutions: Design solutions for complex engineering problems and

4 Conduct investigations of complex problems: Use research-based knowledge and research

7 Environment and sustainability: Understand the impact of the professional engineering

10 Communication: Communicate effectively on complex engineering activities with the

11 Project management and finance: Demonstrate knowledge and understanding of the

III. PROGRAM SPECIFIC OUTCOMES (PSOs)

The Students will be able to

 Strong theoretical foundation leading to excellence and excitement towards research, to

(L:Lecture, T:Tutorial, P:Practical, C:Credit,

CIE:Continuous Internal Evaluation, SEE:Semester End Examination)

S.No Course Course Title CAT L T P C CIE SEE Total

S.No Course Course Title CAT L T P C CIE SEE Total

S.No Course Course Title CAT L T P C CIE SEE Total

S.No Course Course Title CAT L T P C CIE SEE Total

7 Operating system Lab PC - - 4 2 60 40 100

8 Soft Skills II MC 2 0 0 0 60 40 100

III YEAR I SEMESTER

S.No Course Course Title CAT L T P C CIE SEE Total

III YEAR II SEMESTER

S.No Course Course Title CAT L T P C CIE SEE Total

S.No Course Course Title CAT L T P C CIE SEE Total

TOTAL 17 220 280 500

S.No Course Course Title CAT L T P C CIE SEE Total

Five Domains (Area of Specializations) are identified for Professional Electives

SEMESTER PE CODE COURSE

II-II PE1 Advanced Data Structures

Human Computer Interaction

III- I PE2 Graph Theory

Web and Cloud Services

III-I PE3 Mobile Application Development

Big Data Technology

III-I PE4 Network Programming

Fog and Edge Computing

Block Chain Technology

Data Mining and Data warehousing

Natural Language Processing

IV-II PE6 NoSQL Databases

Information Retrieval System

Information Security Management

Nature Inspired Optimization

IV- II PE7 Open Source Software

Data Visualization Techniques

PROGRAMMING PRINCIPLES AND CODING TECHNIQUES USING PYTHON L T P C

UNIT I BASICS OF PYTHON PROGRAMMING 9

UNIT II CONTROL STRUCTURE, OPERATORS AND FUNCTIONS 9

UNIT III COLLECTIONS, STRINGS AND REGULAR EXPRESSIONS 9

UNIT IV FILE HANDLING AND EXCEPTIONS 9

UNIT V NUMPY, PANDAS, MATPLOTLIB 9

COURSE OUTCOMES: Upon completion of the course, students will be able to

CO’s-PO’s & PSO’s MAPPING

CODING TECHNIQUES USING PYTHON LABORATORY LTPC

COURSE OUTCOMES: On completion of the course, students will be able to:

CO’s-PO’s & PSO’s MAPPING

UNIT II VIRTUALIZATION BASICS 9

UNIT III CLOUD ENABLING TECHNOLOGIES AND RESOURCE MANAGEMENT 9