An Autonomous College under VTU

DEPARTMENT OF COMPUTER SCIENCE &ENGINEERING

(Artificial Intelligence &Machine Learning)

Scheme and Syllabus

With effect from Academic Year 2021-22

VISION
To be a centre of excellence with quality education and research in Artificial Intelligence through nurturing
collaborative culture, disseminating customer oriented innovations and positive contribution to the welfare of
the society.
MISSION
 To impart quality technical education to the students to enhance their professional skills and make them
globally competitive.
 To carry out research in cutting out technologies in Artificial Intelligence and its allied fields to meet the
requirements of industry and society.
 To create an innovation environment with the collaboration of industry in which students can provide
solutions to global problems.
 To inculcate strong ethical and leadership qualities to the minds of students and make them as successful
entrepreneurs.
 To produce the Computer Science and Engineering professionals with a specialization in AIML with
personal and professional responsibilities and commitment to lifelong learning.

PROGRAM EDUCATIONAL OBJECTIVES(PEOs)

The graduates of Computer Science and Engineering are expected to fulfill the following PEOs after a few
years of their graduation.
 PEO1: Graduates in Computer Science and Engineering will apply the technical knowledge of analysis and
design of software used for sustainable societal growth.

PEO2: Graduates of Computer Science and Engineering will demonstrate logical thinking and programming
skills.

PEO3: Graduates in Computer Science and Engineering will demonstrate good communication skills,
dynamic leadership qualities with concern for environmental protection.

PEO4: Computer Science and Engineering graduates will be capable of pursuing higher studies, take up
research and development work blended with ethics and human values.

PEO5: Computer Science and Engineering graduates will have the ability to be come entrepreneurs there by
switching over from responsive engineer to creative engineer.

PROGRAM OUTCOMES (POs):

Graduates of the Computer Science and Engineering Programme will be able to achieve the followingPOs:

PO1:Engineering Knowledge:

Apply the knowledge of mathematics, science, engineering fundamentals, and Computer Science and
Engineering principles to the solution of complex problems in Computer Science and Engineering.

PO2: Problem Analysis:

Identify, formulate, research literature, and analyze complex Computer Science and Engineering problems
reaching substantiated conclusions using first principles of mathematics and engineering sciences.

PO3:Design/Development of Solutions:

Design solutions for complex Computer Science and 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.
PO4: 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 related to Computer
Science and Engineering problems.

PO5: Modern Tool Usage:

Create, select, and apply appropriate techniques, resources, and modern engineering and IT tools including
prediction and modeling to complex Computer Science and Engineering activities with an understanding of
the limitations.

PO6: 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 Computer Science and Engineering
practice.
PO7: Environment and Sustainability:

Understand the impact of the professional Computer Science and Engineering solutions in societal and
environmental contexts, and demonstrate the knowledge of, and need for sustainable development.

PO8: Ethics:

Apply ethical principles and commit to professional ethics and responsibilities and norms of the
Computer Science and Engineering practice

PO9: Individual and Teamwork:

Function effectively as an individual, and as a member or leader in diverse teams, and in multidisciplinary
settings.

PO10: Communication:

Communicate effectively on complex Computer Science and 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.

PO11: 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 Computer Science and Engineering projects
and in multidisciplinary environments.
PO12: 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.

PROGRAM SPECIFIC OUTCOMES (PSOs):

Program Specific Outcomes (PSOs) are what the graduates of a specific undergraduate engineering program
should be able to do at the time of graduation.

PSO1: Professional Skills:

The ability to understand, analyze and develop computer programs in the areas related to system software,
multimedia, web design, big data analytics, and networking for efficient design of computer-based systems of
varying complexity.

PSO2: Problem-Solving Skills:

The ability to apply standard practices and strategies in software project development using open-ended
programming environments to deliver a quality product for business success.

PSO3: Foundation of mathematical concepts:

Ability to apply mathematical concepts to solve real world problems using appropriate data structure and
suitable algorithms.
 Third Semester B.E - CSE (AI & ML) –Scheme
SL. Course Total L:T:P:S Online Offline Weekly
No Code Course Name Credits (Hrs/Week) Marks Load
Fourier Series, Transforms and
1 20MAT31 4 3:2:0:0 - 100 100 0+5
Numerical Techniques
2 20CSI32 Data Structures using C (IC) 4 3:0:2:0 - 100 100 0+5
Database Concepts Using
3 20CSI33 3 2:0:2:0 - 100 100 0+4
SQL(IC)
Object Oriented Programming using
4 20CSI34 4 3:0:2:0 - 100 100 0+5
JAVA(IC)
5 20CIT35 Artificial Intelligence 3 2:2:0:0 - 100 100 0+4
Logic Design &
6 20CST36 3 2:2:0:0 - 100 100 0+4
Computer Organization
Constitution of India and
7 20CPH37 Professional Ethics 1 0:2:0:0 - 100 100 0+2

20KBK38/ Baleke
8 1 0:2:0:0 - 100 100 0+2
20KSK38 Kannada/Samskruthika
Kannada

9 20PEC39 Placement & Training-I 2 1:0:2:0 - 100 100 0+3

Total 25 16: 10: 8:0 900 0+34

 Fourth Semester B.E - CSE (AI & ML) – Scheme
SL. Course Total L:T:P:S Offline Weekly
No Code Course Name Credits (Hrs/Week) Marks Load
Applied Calculus and Probability
1 20MAT41 4 4:0:0:0 100 100 4
Distribution
2 Design and Analysis of 4 3:0:2:0 100 100 5
20CSI42
Algorithms
3 20CIT43 Operating Systems 3 3:0:0:0 100 100 3

4 20CSI44 Python Programming 3 2:0:2:0 100 100 4

5 20CST45 Software Engineering 3 3:0:0:0 100 100 3

Fundamentals of Machine
6 20CIT46 3 3:0:0:0 100 100 3
Learning

7 20UHV47 Universal HumanValues-2 3 3:0:0:0 100 100 3

Professional Development of
8 20PDE49 2 1:2:0:0 100 100 3
Engineers
Total 25 21:2:2:0 800 800 28

Fifth Semester B.E. – Scheme w.e.f. 2020-2021

Sr. Course Total L:T:P:S Weekly
Course Name Offline Marks
No. Code Credits (Hrs/Week) load
1 20CIT51 Advanced AI & ML techniques 3 3:0:0:0 100 100 3

2 20CII52 Web technologies 4 3:0:2:0 100 100 5

3 20CII53 Data Warehousing and Data Mining 4 3:0:2:0 100 100 5

4 20CIT54 Microcontroller & Embedded Systems 3 3:0:0:0 100 100 3

5 20CIT55 Computer Networks 3 3:0:0:0 100 100 3

6 20CIT56X Professional Elective–I 3 3:0:0:0 100 100 3

7 20CIP57 Mini Project 3 0:0:6:0 100 100 8

PT-III: Employability & Skills
8 20PEC58 2 1:1:0:0 100 100 2
Development
25 19:1:10:0 800 800 32

Professional Elective–I
Course Code Course Name
20CIT551 Software Architecture
20CIT552 Digital Image Processing
20CIT553 Data science with R programming
 Sixth Semester B.E.–Scheme w.e.f. 2020-2021
Sr. Course Total L:T:P:S Weekly
No. Code Course Name Credits (Hrs/Week) Offline Marks load
1 20CII61 Cloud Computing 4 3:0: 2:0 100 100 5

Deep Learning
2 20CII62 4 3:0: 2:0 100 100 5

3 20CIT63 Internet of Things 3 3:0: 0:0 100 100 3

4 20CIT64 Information & Network 3 3:0: 0:0 100 100 3

Security
5 20CIT65X Professional Elective–II 3 3:0: 0:0 100 100 3

6 20CIT66X Professional Elective–III 3 3:0: 0:0 100 100 3

7 20ENV57 Environmental Science 1 1:0:0:0 100 100 1

8 20CIP68 Research Methodology 2 2:0: 0:0 100 100 2

PT-IV: Employability
9 20PED69 2 1:0: 2:0 100 100 3
&Skills Development
Total 25 22 : 0: 6 :0 900 28

Professional Elective–II Professional Elective–III

Course Code Course Name Course Code Course Name
20CIT651 Android Application 20CIT661
Natural Language Processing
Development
20CIT652 Information Retrieval System 20CIT662 Block chain Technologies
20CIT653 Devops 20CIT663 Full Stack Development
 Seventh Semester B.E. –Scheme w.e.f.2020-2021
Sr. Course Total L:T:P:S Weekly
No. Course Name Offline Marks
Code Credits (Hrs/Week) load
1 20CII71 Big Data Analytics 4 3:0: 2:0 100% 100 5
2 20CII72 AI and Robotics 4 3:0: 2:0 100% 100 5

3 20CIT73X Professional Elective-IV 3 3:0: 0:0 100% 100 3

4 20CIT74X Professional Elective-V 3 3:0: 0:0 100% 100 3

5 20CIT75X Industrial Elective-I 3 3:0: 0:0 100% 100 3

6 20CIP76 Project Phase–I 3 0:0:6:0 100% 100 3

Total 20 15:0:10:0 700 22

Professional Elective-IV Professional Elective-V

Course Course
Course Name Course Name
Code Code
20CIT731 Ethical Hacking 20CIT741 Cyber forensic
20CIT732 Green Computing 20CIT742 Precision Agriculture
20CIT733 Quantum Computing 20CIT743 Business Intelligence

Industry Elective-I
Course
Course Name
Code
20CIT751 Digital Marketing
20CIT752 Enterprise Resource Planning(ERP)
20CIT753 Supply Chain Management

Eighth Semester B.E.– Scheme w.e.f. 2020-2021

Sr. Course Total L:T:P:S
Course Name Offline Marks
No. Code Credits (Hrs/Week)
3 20CIP81 Technical Seminar 1 0:0: 2:4 100 100
Internship 3 0:0: 2:0 100
4 20CIP82 100

Project Phase and Evaluation 0:6: 8:8 100

5 20CIP83 11 100

Total 15 6:0:10:16 600 600

Note: AICTE Activity points (Mandatory)
 THIRD SEMESTER

FOURIER SERIES, TRANSFORMS AND NUMERICAL TECHNIQUES

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20MAT31 3:2:0:0 4 CIE:50 SEE:50 3 Hours BS

Course Objectives:
This course will enable students to:

• Have the efficiency in expressing a periodic function in terms of infinite trigonometricseries.

• Obtain the knowledge of Laplace Transforms.
• Acquire the skill in solving the engineering applications problem using Laplace Transforms.
• Get the ability to solve the engineering problem using Fourier Transforms.
• Developthe proficiency insolving algebraic and transcendental equations andinterpolationusing
numerical methods

Syllabus
Module – I
Fourier Series: Periodic functions, Dirichlet‟s conditions, Euler‟s Formulae (without proof), Fourier
series of periodic functions of period 2l and 2π, Half range Fourier series, Practical harmonic analysis
problems. 08 Hours
Module – II
Laplace Transform: Definition, Laplace Transform of elementary functions. Properties, transform of
derivatives, multiplication by tn and division by t - Problems. Laplace transforms of periodic functions,
unit step functions and unit impulsefunction– Problems. 08 Hours
Module – III
Inverse Laplace Transforms: Inverse Laplace Transforms of standard functions. (Formulae only).
Inverse Laplace transform by using completing the squares, partial fractions, shifting property and
differentiation - problems. Convolution theorem - problems. Applications - solution of linear differential
equations withinitial conditions- problems. 08 Hours
Module – IV
Fourier Transforms and Z - Transforms:Complex Fourier transforms, Fourier Sine and Cosine
transforms and their inverse transforms problems.Z - Transforms of some standard functions, Damping and
shifting rules - problems. Inverse Z –Transforms bypartialfraction method. 08 Hours
Module – V
Numerical Methods:Numerical solutions of algebraic and transcendental equations- Regula Falsi Method
and Newton Raphson Method (Formulae only) –Problems. Finite Differences-Forward and Backward
differences, Newton‟s Forward and Newton‟s Backward interpolation formulae. Lagrange‟s Interpolation
formula (without proof)–Problems. Numerical Differentiation using Newton‟s Forward and Backward
interpolationformulae. –Problems. 07 Hours

Course Outcomes:

On completion of this course, the students are able to:

• Demonstrate Fourier series to study the behavior of periodic functions and their applicationsin
engineering problem.
• Find the Laplace transform of different types of functions.
• Use the Laplace transform and inverse Laplace Transform in solving various types
engineering application problems.
• Make use of Fourier transform and Z-transform to illustrate discrete/continuous function arising in
Engineering applications.
• Determine the roots of Algebraic and Transcendental equations and Interpolation arising inengineering
applications, using numerical methods

Text Books:
• Dr. B.S. Grewal: ―Higher Engineering Mathematics‖, (Chapters 10, 21, 22, 28, 29, 30), Khanna
Publishers, New Delhi, 42nd Edition, 2012, ISBN:9788174 091955.
• N.P. Bali and Dr. Manish Goyal: ―A Text Book of EngineeringMathematics‖,
(Chapters 10, 18, 20, 22, 24), Laxmi Publications (P) Ltd., New Delhi, 9thEdition, 2014, ISBN:
9788131808320.

Reference Books:
1. Erwin Kreyszig: ―Advanced Engineering Mathematics‖, Wiley Pvt. Ltd. India, New Delhi, 9thEdition,
2011, ISBN 13: 9788126531356.

2. B.V. Ramana: ―Higher Engineering Mathematics‖, Tata Mc Graw –Hill PublishingCompany

Limited, New Delhi, 2nd Reprint, 2007, ISBN 13: 978-0-07063417-0.

E-Resources:
1. http://bookboon.com/en/essential-engineering-mathematics-ebook
2. https://www.free-ebooks.net/ebook/essential-engineering-mathematics
3. https://archive.org/details/AdvancedEngineeringMathematics10thEdition
 DATA STRUCTURES USING C(IC)

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CSI32 3: 0:2:0 4 CIE:50 SEE:50 3 Hours IC

Prerequisites:
A course on ―Fundamental for C‖.

Course Objectives:
As a student will be able to learn:

 Efficient storage mechanisms of data for an easy access.

 To design and implementation of various basic and advanced data structures.
 To introduce various techniques for representation of the data in the real world.
 To develop application using data structures.
 To improve the logical ability

Syllabus
Module – I
Introduction to Data Structures: Introduction to Data Structures, abstract data types, Linear list – singly linked
list implementation, insertion, deletion and searching operations on linear list, Double Linked List
08Hours

Module – II

Stacks-Operations, array and linked representations of stacks, stack applications, Queues-operations, array and linked
representations. 08Hours
Module – III
Dictionaries and Hashing: Dictionaries: linear list representation, skip list representation, operations - insertion,
deletion and searching. Hash Table Representation: hash functions, collision resolution-separate chaining, open
addressing-linear probing, quadratic probing, double hashing, and rehashing, extendible hashing.
08Hours

Module – IV
Trees : Search Trees: Binary Search Trees, Definition, Implementation, Operations- Searching, Insertion and
Deletion, AVL Trees, Definition, Height of an AVL Tree, Operations – Insertion, Deletion and Searching, Red –
Black, Splay Trees. 08Hours

Module – V
Graphs and Sorting: Graphs: Graph Implementation Methods. Graph Traversal Methods. Sorting: Insertion Sort,
Quick Sort, Merge Sort. 08Hours

Lab Programs:

1. Write a program that uses functions to perform the following operations on singly linked list.:
i) Creation ii) Insertion iii) Deletion iv) Traversal
2. Write a program that uses functions to perform the following operations on doubly linked list.:
i) Creation ii) Insertion iii) Deletion iv) Traversal
3. Write a program that implement stack (its operations) using
i) Arrays ii) Pointers
4. Write a program that implement Queue (its operations) using
i) Arrays ii) Pointers
5. Write a program that implements the following sorting methods to sort a given list of integers in ascending
order
 i) Quick sort ii) Merge sort
6. Write a program to implement the graph traversal methods.

Course Outcomes:
 Student will be able to choose appropriate data structure as applied to specified problem
definition.
 Students will be able to use linear and non-linear data structures like stacks, queues, linked list
and will be able to handle operations like searching, insertion, deletion, traversing mechanism etc.
on various data structures.
 Ability to assess efficiency trade-offs among different data structure implementations or
combinations and Design programs using a variety of data structures, including hash tables and
Dictionaries.
 Design programs using a variety of data structures, including binary and general tree structures,
search trees, AVL-trees, red-black Trees and splay Trees.
 Implement and know the application of algorithms for sorting and graphs.

Textbooks:

1. Fundamentals of Data Structures in C, 2nd Edition, E. Horowitz, S. Sahni and Susan

AndersonFreed, Universities Press
2. Data Structures using C – A. S. Tanenbaum, Y. Langsam, and M.J. Augenstein,
PHI/PearsonEducation.

Reference Books:

1. Data Structures: A Pseudocode Approach with C, 2nd Edition, R. F. Gilberg and B.A.
Forouzan, CengageLearning.
2. ―Data Structures and Algorithm Analysis in C‖ by Weiss
3. ―Data Structure Through C‖ by Yashavant P Kanetkar
4. ―Problem Solving in Data Structures and Algorithms Using C: The Ultimate Guide to
ProgrammingInterviews‖ by Hemant Jain
5. ―Data Structures and Algorithms in C‖ by Adam Drozdek

Reference Online Resources:

 Udacity's Intro to Algorithms. ...
 2Algorithms and Data Structures by edX. ...
 Data Structures and Algorithms on Udemy. ...
 Coursera's Data Structures and Algorithms Specialization. ...
 Tutsplus.com. ...
 Geeksforgeeks.org. ...
 VisuAlgo.net. ...
 Tutorialspoint.com.
 DATABASE CONCEPTS USING SQL(IC)

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CSI33 2:0:2:0 3 CIE:50 SEE:50 3 Hours Program Core

Prerequisites:
1. Students should know basics of Discrete Mathematics.
2. Students should know basic programming concepts.

Course Objectives:This course will enable students to:

 To understand the fundamentals of Relational database management systems.
 To design database using ER-modeling, Normalization and querying the database using SQL.
 To understand the fundamentals of transactions, locking mechanisms, database recovery.

Syllabus:
Module – I
Introduction to Database: Introduction, Three-schema architecture, Classification of Database Management
systems.
Conceptual Modeling and Database Design :Using High-Level Conceptual Data Models for Database Design,
Relationship types of degree higher than two. Relational Model Concepts, ER Diagrams, Naming Conventions
and Design Issues,
The Relational Data Model :Relational Model Constraints and Relational Database Schemas; Update
Operations, Transactions and dealing with constraint violations; Unary Relational Operations: SELECT and
PROJECT; Relational Algebra Operations from Set Theory; Binary Relational Operations: JOIN and DIVISION;
Additional Relational Operations; Examples of Queries in Relational Algebra. 08 Hours

Module – II
The Relational Data Model: Basic SQL:SQL Data Definition and Data Types: Specifying basic constraints in
SQL; Schema change statements in SQL; Basic queries in SQL
More SQL Complex Queries, Triggers, Views, and Schema Modification: More complex SQL Queries.
Insert, Delete and Update statements in SQL; Specifying constraints as Assertion and Trigger; Views (Virtual
Tables) in SQL. 08 Hours

Module – III
Database Design Theory and Normalization: Informal Design Guidelines for Relation Schemas; Functional
Dependencies; Normal Forms Based on Primary Keys; General Definitions of Second and Third Normal Forms;
Boyce-Codd Normal Form08 Hours

Module – IV
Disk Storage, Basic File Structures and Hashing:Introduction, Secondary Storage Devices, Buffering of
Blocks, Hashing Techniques: Internal Hashing, External Hashing for Disk Files.
Indexing Structures for Files:Types of Single-Level Ordered Indexes: Primary and Secondary Indexes, B+ tree :
Examples on Construction, insert and searching 08 hours

Module – V (Self Study/Assignment)

Overview Of Transaction Management:The ACID Properties; Transactions and Schedules; Concurrent
Execution of Transactions; Lock- Based Concurrency Control; Performance of locking; Transaction support in
SQL; Introduction to crash recovery;
Concurrency Control: 2PL, Serializability and Recoverability; Lock Management;
Crash Recovery: The write-ahead log protocol; Checkpointing; Recovering from a System Crash; Media
Recovery; Other approaches and interaction with concurrency control.

Database Concepts using SQL Laboratory – 10 Hours

PART-A

1. PROBLEM STATEMENT:
1. Choose an online application that you are familiar with that has a large user base.
Examples: Twitter, Snapchat, gmail, FaceBook, Minecraft, Healthcare.gov, Dropbox, Flickr, LinkedIn,
Instagram, Ebay, Yelp, TripAdvisor. With reference to the site selected by you answer the
following questions:

a. Estimate the total number of users with accounts for the application. Explain your estimation
process. Cite any sources you consulted.

b. List what you think is the main data for the application that is maintained on a per-user basis.

c. Estimate the average amount of data per user for this data. Explain the basis for your estimate.

d. Use the answers to Questions a - c to estimate the total amount of user data managed by the
application provider.

2. Assume that you have been asked to design the Library Management System at NMIT. List out the data
that you would need to store with respect to books, patrons etc to create an efficient system.
Note: Please analyse how a library works and then answer the above question
3. Visit an e-commerce website. Select an two items of your choice. Identify the data that the web
application would need to store with respect to this item. Which data is common to both items and which
data is specific to each item.
4. Write down the names of 5 different database management systems. Note down the following details
with respect to each
a. market share
b. type of DBMS
c. an application that uses this DBMS
Note: Please do not just list the top 5 or 5 most popular DBMS.
 2. PROBLEM STATEMENT :
Install MySQL, load sample database, execute basic mysql commands and complete the following tasks
 Open MySQL
 Create new user
 Load sample Database 1
 Load Sample Database 2
 Practice basic MySQL commands
 Answer the questionaries‘ provided in the lab.

3. PROBLEM STATEMENT
Design an ER Diagram for A pharmaceutical company manufactures database

PART-B

1. Database Schema for a Student Library scenario

Consider that a database named Student Library is developed by an application software NMITSoft company.
There are 4 tables in the database. Relationship scheme for the tables is as below:

Student(Stud_no : integer,Stud_name: string)

Membership(Mem_no: integer,Stud_no: integer)
Book(book_no: integer, book_name:string, author: string)
Iss_rec(iss_no:integer, iss_date: date, Mem_no: integer, book_no: integer)

For the above schema, perform the following—

a) Create the tables with the appropriate integrity constraints
b) Insert around 10 records in each of the tables
c) List all the student names with their membership numbers
d) List all the issues for the current date with student and Book names
e) Give a count of how many books have been bought by each student
f) Give a list of books taken by student with stud_no as 5
g) Create a view which lists out the iss_no, iss _date, stud_name, book name

2. Create a relational database schema for a Project, described by the following relations.

STUDENT (Rollno: integer, Name: String, Sem: integer, Degree: String, Contact no:integer, Guide_No:
integer)
GUIDE (Guide_name: String, Guide_No: integer, Guide_reserach_domain: String, Contat_No:
integer, Email_Id: String)
PROJECT (Project_No: Integer, Project_title: String, Project_Area: String, Start_dt, date,
Guide_No:integer)
GROUP (Group_Code:integer, Roll_No:integer )
PROJECT_GROUP (Group_Code:integer, Project_No: integer, no_of_students:integer)

For the above schema, perform the following.

a) Create the tables with the appropriate integrity constraints
b) Insert around 10 records in each of the tables
c) Find the list of guide, who are guiding more than two student groups.
d) Find the list of project no, project name & name of guide, in domain of DataBase.
e) Update guide details of a roll no „110011‟, new guide is „Ram Mohan‟ & id„112200‟.
f) Remove the Guide details, guide no is ―112211‖ and assign guide no ―133113‖ toall respective students project
group.
g) Create a view as student_project details that lists student name, project name and guide name

3. The following relations keep track of airline flight information:

Flights (flno: integer, from: string, to: string, distance: integer, departs: time, arrives: time, price: integer)
Aircraft (aid: integer, aname: string, cruisingrange: integer)
Certified (eid: integer, aid: integer)
Employees (eid: integer, ename: string, salary: integer)

Note that the Employees relation describes pilots and other kinds of employees as well; every pilot is certified for
some aircraft, and only pilots are certified to fly.

For the above schema, perform the following.

a) Create the above tables by specifying primary keys and foreign keys.
b) Insert around 10 records in each of the tables.
c) Find the names of aircraft such that all pilots certified to operate them earn more than 80,000.
d) For each pilot who is certified for more than three aircraft, find the eid and the maximum cruising range of
the aircraft that he (or she) is certified for.
e). Find the names of pilots whose salary is less than the price of the cheapest route from Los Angeles to
Honolulu.
f) Find the second highest salary of an employee.
g) Create a view which lists out the eid, ename, aid, aname

4. Consider a relational database schema for a Company database below.

Employee (F_name: string, L_name: string ,Emp_id:integer, Bdate: date, Address:string, Gender:string, Salary:
integer, Super_Emp_id: integer, D_no: integer)
Department (D_name:string, D_no:integer, D_Mgr_id:integer, Mgr_start_date: date)
Dept_Location(D_no: integer, D_location:string)
Project (P_name:string, P_number:integer, P_location:string, D_no:integer )
Works_on (Emp_id:integer, P_no:integer, Hours: int )
Dependent(Emp_id:integer,Dependent_name:string,Gender:string,Bdate:date,Relationship:String

For the above schema, perform the following

a) Create the above tables by specifying primary keys and foreign keys.
b) Insert around 10 records in each of the tables.
c) Company decided to give a raise on salaries of every employee, working on the „ProductX‟ project by 10
percent.
d) Find the names and address of all employees who work on same department.
e) List the name and address of all employees who work for the ―Research‖
department.
f) Retrieve a list of employees and the projects they are working on, ordered by department and, within each
department, ordered alphabetically by last name, then first name.
g) Create a view Dept_info that gives details of department name, Number of employees and total salary of
each employee.
5. Consider a relational database schema for a Sailors database below

Sailors(sid: integer, sname: string, rating: integer, age: real);

 Boats(bid: integer, bname: string, color: string);
Reserves(sid: integer, bid: integer, day: date).

For the above schema, perform the following.

a) Create the above tables by specifying primary keys and foreign keys.
b) Insert around 10 records in each of the tables.
c) Find the names of sailors who have reserved a red boat, and list in the order of age.
d) Find the names of sailors who have reserved boat 103
e) Find the name and the age of the youngest sailor.
f) Find the average age of sailors for each rating level that has at least two sailors.
g) Find the names and ratings of sailor whose rating is better than some sailor called Horatio.

Course Outcomes
1. Understand the essentials of DBMS and its architectures, Design and model a real time Scenario
using ER-Modeling.
2. Formulate, using relational algebra, SQL and SQL to solve queries.
3. Demonstrate an understanding of normalization theory and apply such knowledge to the
normalization of a database
4. Familiarize the concept of storage management in DBMS and processing in Distributed and Parallel
databases.
5. Illustrate the transaction management, database recovery and security issues.

Text Books:

1. Fundamentals of Database Systems; RamezElmasri and Shamkant B. Navathe;Pearson; 6 thEdition;

ISBN-13: 978-0-136-08620-8 (MODULES 1 to 4 , Chapters- 2,3,4,5,7,13,15,17,18)
2. Database management systems, Ramakrishnan, and Gehrke, 3rd Edition, 2014, McGraw Hill,
ISBN-13: 978-0072465631, ISBN-10:0072465638

Reference Books:
1. SilberschatzKorth and Sudharshan, Database System Concepts, 6th Edition, Mc- GrawHill,
2013, ISBN0-07-352332-1 (MODULE 5, Chapters-16,17,18)

E-resources:
1. https://www.db-book.com/db6/.
2. https://raw.githubusercontent.com/pforpallav/school/master/CPSC404/Ramakrishnan%20-
%20Database%20Management%20Systems%203rd%20Edition.pdf.
 OBJECT ORIENTED PROGRAMMING USING JAVA(IC)

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CSI34 3: 0:2: 0 4 CIE:50 SEE:50 3 Hours IC

Course Objectives:
This course will enable students to:
• Learn the basic concepts of object-orientedprogramming.
• Understand the basics of JAVA Programming using classes andobjects.
• Gain the knowledge of Inheritance and packages.
• Expose to the concepts of exceptions that occur while programming inJAVA.
• Acquire the knowledge of multi-threaded programming in JAVA.

Syllabus
Module – I
Introduction to Object Oriented Concepts: Procedure–Oriented Programming system, Object
Oriented Programming System, Comparison of Object Oriented Language with C.
Introduction to Java: Java‟s magic, The Byte code, Java Development Kit (JDK), Java Buzzwords,
Object- oriented programming, IO Streams, Data types, variables and arrays, reference variables,
Operators, Control Statements. Simple Java programs.

08Hours

Module – II
Classes: Classes fundamentals, Declaring objects, this keyword, garbage collection.
Methods: Method Prototyping, Member functions and data members, Constructors, Objects and
methods, Method Overloading, Objects and arrays, Access modifiers, Setters and getters, Nested classes,
Console I/O. 08 Hours
Module – III
Inheritance: Inheritance basics, using super, creating multi-level hierarchy, method overriding, using
Abstract classes, using final.Packages: Packages: Access Protection, Importing Packages.
08Hours

Module – IV
Interfaces, Exceptions, Applets: Interfaces, Exception handling fundamentals, exception types, uncaught
exceptions, using try and catch, using multiple catch clauses, nested try statements, throw, throws, finally,
Exception handling in Java, Applets, Types of Applets, Applet basics and class, AppletArchitecture.
08 Hours

Module – V
Event Handling and Multi-Threaded Programming : Two event handling mechanisms, The delegation
event model, Event classes, Sources of events, Event listener interfaces, Using the delegation event model,
Adapter classes, Inner classes. Multi-Threaded Programming: What are threads? How to make the classes
threadable, Extending threads, Implementing runnable, Synchronization, Changing state of the thread,
Bounded buffer problems, read-write problem. 08 Hours
Laboratory
1. Write a Java program that prompts the user for an integer and then prints out all prime numbers
up to that integer.
2. Write a Java program that prints the following patterntype
*****
*****
****
***
**
*
3. Write a java program to calculate gross salary & net salary taking the following data.
Input:empno,empname,basic Process: DA=50%of basic HRA=25%of basic CCA=Rs240/-
PF=10%of basic PT=Rs100/-
4. Write a Java program that displays area of different Figures(Rectangle,Square,Triangle) using
the method overloading.
5. Write a Java program that displays the time in different formats in the form of HH,MM,SS using
constructor Overloading.
6. Write a Java program that counts the number of objects created by using staticvariable.
7. Write a java program that implements educational hierarchy usinginheritance.
8. Write a java program that implements Array Index out of bound Exception using built-
in-Exception.
9. Write a java program that implements bank transactions using user definedexception.
10. Write a java program to identify the significance of finally block in handling exception.

Course Outcomes
On completion of this course, the students will be able to:
• Explain the difference between Procedure and Object Oriented Programming.
• Develop basic JAVA programs.
• Apply Inheritance properties and packages in solving real world problems.
• Use exception handling methods efficiently.
• Demonstrate the programs by using multithreaded concepts.

Text Books:
1. Herbert Schildt, ―Java The Complete Reference‖, 7th Edition, Tata McGraw Hill,
2013,ISBN-13: 978-0072263855,(Chapters 1-11).

Reference Books:
1. Herbert Schildt, ―The Complete Reference C++‖, 4th Edition, Tata McGraw Hill, 2013,ISBN-
13: 978-0072226805.
2. E Balagurusamy, ―Programming with Java-A primer‖, 2nd Edition, Tata McGraw Hill
companies,2009, ISBN-13: 978-9351343202.

E-Resources:

2. www.geeksforgeeks.org/java/

3. www.tutorialspoint.com/java/index.htm
 ARTIFICIAL INTELLIGENCE
Course Code L : T : P:S Credits Exam Marks Exam Duration Course Type

20 CIT 35 2: 2 : 0 : 0 3 100 3 Hours PCC

Prerequisites:
A course on ―Fundamental for C‖

Course Objectives:

The objective of this course is to enable the students to

 Understand the basic concepts of intelligent agents
 Develop general-purpose problem solving agents, logical reasoning agents, and agents that reason under
uncertainty
 Employ AI techniques to solve some of today‘s real world problems

Syllabus
Module – I
INTELLIGENT AGENTS: Introduction to AI – Agents and Environments – concept of rationality – nature of
environments – structure of agents
Problem solving agents – search algorithms – uninformed search strategies
08Hours
Module – II
PROBLEM SOLVING : Heuristic search strategies – heuristic functions
Local search and optimization problems – local search in continuous space – search with nondeterministic actions
– search in partially observable environments – online search agents and unknown environments
08Hours
Module – III
GAME PLAYING AND CSP : Game theory – optimal decisions in games – alpha-beta search – monte carlo tree
search – stochastic games – partially observable games
Constraint satisfaction problems – constraint propagation – backtracking search for CSP – local search for CSP –
structure of CSP 08Hours
Module – IV
LOGICAL AGENTS : Knowledge-based agents – propositional logic – propositional theorem proving –
propositional model checking – agents based on propositional logic
First-order logic – syntax and semantics – knowledge representation and engineering – inferences in first-orderlogic
– forward chaining – backward chaining -- resolution 08Hours

Module – V
KNOWLEDGE REPRESENTATION AND PLANNING: Ontological engineering – categories and
objects – events – mental objects and modal logic – reasoning systems for categories – reasoning with default
information
Classical planning – algorithms for classical planning – heuristics for planning – hierarchical planning – non-
deterministic domains – time, schedule, and resources – analysis
08Hours

Course Outcomes:
On successful completion of this course, the students will be able to
 Explain autonomous agents that make effective decisions in fully informed, partially observable,
and adversarial settings
 Choose appropriate algorithms for solving given AI problems
 Design and implement logical reasoning agents
 Design and implement agents that can reason under uncertainty
 Textbooks:

1. Stuart Russel and Peter Norvig, ―Artificial Intelligence: A Modern Approach‖, Fourth Edition, Pearson
Education, 2020.

Reference Books:

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 Edition, 2006
4. Deepak Khemani, ―Artificial Intelligence‖, Tata McGraw Hill Education, 2013 (http://nptel.ac.in/)

E-References:
 https://www.pearson.com/us/higher-education/program/Russell-Artificial-Intelligence-A-Modern-Approach-4th-
Edition/PGM1263338.html
 https://onlinecourses.nptel.ac.in/noc22_cs56
 https://onlinecourses.nptel.ac.in/noc21_ge20
 https://www.coursera.org/learn/ai-for-everyone
 https://www.edx.org/course/artificial-intelligence-for-everyone
 LOGIC DESIGN AND COMPUTER ORGANIZATION

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CST36 2:2:0:0 3 CIE:50 SEE:50 3 Hours PCC

Course Learning Objectives: This course (20CST34) will enable students to:
 Design of Switching functions
 Design a Combinational circuit design and simulation using gates
 Explain the basic sub systems of a computer, their organization, structure and operation.
 Illustrate the concept of programs as sequences of machine instructions.
 Demonstrate different ways of communicating with I/O devices and standard I/O interfaces.

Module I
Karnaugh maps: minimum forms of switching functions, two and three variable Karnaugh maps, four variable
karnaugh maps, determination of minimum expressions using essential prime implicants, Quine-McClusky Method:
determination of prime implicants, simplification using map-entered variables
Text book 1:Part B: Chapter 5 ( Sections 5.1 to 5.4) Chapter 6(Sections 6.1 to 6.5) RBT: L1, L2

8Hours
Module II
Combinational circuit design and simulation using gates: Review of Combinational circuit design, design of
circuits with limited Gate Fan-in ,Gate delays and Timing diagrams, Hazards in combinational Logic, simulation
and testing of logic circuits Multiplexers, Decoders and Programmable Logic Devices: Multiplexers, three state
buffers, decoders and encoders, Programmable Logic devices, Programmable Logic Arrays, Programmable Array
Logic.

Text book 1:Part B: Chapter 8,Chapter 9 (Sections 9.1 to 9.6) RBT: L1, L2
8Hours

Module III
Basic Structure of Computers: Basic Operational Concepts, Bus Structures, Performance – Processor Clock,
Basic Performance Equation, Clock Rate, Performance Measurement. Machine Instructions and Programs:
Memory Location and Addresses, Memory Operations, Instructions and Instruction Sequencing, Addressing Modes,
Assembly Language, Basic Input and Output Operations, Stacks and Queues, Subroutines, Additional Instructions,
Encoding of Machine Instructions
Text book 1: Chapter1 – 1.3, 1.4, 1.6 (1.6.1-1.6.4, 1.6.7), Chapter2 – 2.2 to 2.10 RBT: L1,L2, L3

8Hours
Module IV
Input/output Organization: Accessing I/O Devices, Interrupts – Interrupt Hardware, Direct Memory Access, Buses,
Interface Circuits, Standard I/O Interfaces – PCI Bus, SCSI Bus, USB.
Text book 1: Chapter4 – 4.1, 4.2, 4.4, 4.5, 4.6, 4.7 RBT: L1, L2, L3 8Hours
Module 5
Memory System: Basic Concepts, Semiconductor RAM Memories, Read Only Memories, Speed, Size, and Cost,
Cache Memories – Mapping Functions, Replacement Algorithms, and Performance Considerations.
Text book 1: Chapter5 – 5.1 to 5.4, 5.5 (5.5.1, 5.5.2), 5.6 RBT: L1, L2, L3

Textbooks:
1. Charles H Roth and Larry L Kinney, Analog and Digital Electronics, Cengage Learning,2019
2. Carl Hamacher, Zvonko Vranesic, Safwat Zaky, Computer Organization, 5th Edition, Tata McGraw Hill,
2002. (Listed topics only from Chapters 1, 2, 4, 5, 6, 7, 8, 9 and12)
Reference Books:
1. Donald P Leach, Albert Paul Malvino & Goutam Saha, Digital Principles and Applications, 8th Edition,
Tata McGraw Hill, 2015.
2. M. Morris Mani, Digital Design, 4th Edition, Pearson Prentice Hall, 2008.
3. David A. Bell, Electronic Devices and Circuits, 5th Edition, Oxford University Press, 2008.
4. William Stallings: Computer Organization & Architecture, 9th Edition, Pearson, 2015.
 CONSTITUTION OF INDIA & PROFESSIONAL ETHICS
Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CPH37 0:2:0:0 1 CIE:50 SEE:50 2 Hours -

COURSE OBJECTIVE:
This course will enable students to:
• Learn about the preamble of the Indian constitution.
• Fundamental rights & duties of a citizen.
• Special privileges of society and economically weaker section of the society.
• Individual role & ethical responsibility towards society.

Syllabus:
Module-I
introductionto constitution: Introduction, making of constitution, Salient features of theconstitution,
preamble of the Indian constitution. Fundamental rights& limitations. 03 Hours

Module-II

DPSP, Union Executives:Directive principles of state policy, Fundamental duties, union executives-
President, Prime minister, Parliament, supreme court of India. 03Hours

Module-III

State executives, Electoral process, Amendments: State executives- Governor, CM, state legislature,
High courts, Electoral process. Amendment Procedures, Amendments -42nd, 44th, 74th, 76th, 86th and
91st. 02 Hours

Module-IV

Special provisions, Municipalities, co-operative society: Provisions for SC & ST, Women, Children
& backward classes. Emergency provisions, Human rights. Municipalities, Panchayats and Co-operative
societies. 03 Hours

Module-V
Scope & aim of Engineering ethics: Ethics, Responsibility of engineers, impediments to
responsibility, Risks, Safety and Liability of engineers, Honesty, Integrity and reliability in
engineering. 02 Hours

Course Outcomes:
On completion of this course, students will be able to:
• Familiarize with fundamental rights and duties.
• Recognize the electoralprocess.
• Get exposed to legislature andjudiciary.
• Realize special provisions given for women, children and weaker section of the society.
• Exhibit engineering ethics and responsibilities of engineers.

Text Book:
1. D. Srinivasan, ―Constitution of India, professional ethics‖, Himalaya Publishing House,
2006, 1st Edition.
 2. Dr. Umapati K L, Ramesh L. Chakrasali, ―Constitution of
India, professional ethics‖,elite publishers, 2006, 2nd
Edition.

Reference Books:
1. M. Raja Ram, Constitution of India, professional ethics. New Age
International (P)Limited, Publishers, 2015, 3rd Edition
 BALEKE KANNADA/
SAMSKRUTHIKA KANNADA
Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20KBK38/ 0:2:0:0 1 CIE:50 SEE:50 2 Hours -
20KSK38
 ELEMENTS OF COMMUNICATION

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20PEC39 1:0:2:0 2 CIE:50 SEE:50 3 Hours PT

Course Objectives:
This course will enable students to:
 Implement English vocabulary at command and ensure language proficiency.
 Pronunciation skills to enhance with English vocabulary and language proficiency Language Lab.
 Augment LSRW and GV skills (Listening, Speaking, Reading, Writing and Grammar, Vocabulary) through
tests, activities, exercises etc., comprehensive web-based learning and assessment systems can bereferred
 Achieve better Technical writing and Presentation skills Identify the common errors
in speaking and writing English and acquire Employment and Workplace
communication skills.
 Define non-verbal communication

Syllabus
Module – I
Introduction to CommunicationSkills :What is communication? The importance of communication skills
inEngineering, Key concepts in communication, Kinds of communication, The communication process,
Barriers & filters in communication, Feedback in communication, Traits of a good and poor communicator,
The communication pie. 03Hours

Module – II
Listening Skills– Its importance, Difference between hearing & listening, Active Listening, Traits of good
listeners,The Listening Cycle, Listening for Pronunciation Practice. 03Hours

Reading Skills: Importance of Reading Skills in Communication, Building confidence in reading,

Countering common errors in reading, Reading rate & reading comprehension, Jigsaw reading.
06Hours
Module – III
Speaking skills: Importance of Speaking, Purpose of Speaking, Secrets to Speaking, Importance of
Pronunciation in speaking, Improving pronunciation through cluster ,Sounds, Pronunciation clarity & Cluster
sounds, JAM Sessions, Pick and Speak.
06Hours
Module – IV
Writing skills: Importance of Written Communication, The importance of good sentence and paragraph
construction, Hallmarks of good writing, Accuracy, Ambiguity & Brevity in written communication, One word
for many, 7 C‟s of written communication, Proofing your document, Activities on Written Communication.
Body Language: Importance of Body Language,Body Language Do‟s & Don‟ts, Body Language speaks
volumes – the fine print, Body Language behavior & their Interpretation.
06Hours
Module – V
Presentation Skills: How to be an effective presenter, Establishing specific purpose and desiredoutcomes of a
presentation, Organizing, writing and editing content in a presentation, Preparation of effective visuals to guide
and support a presentation, Effective use of verbal and non-verbal presentation techniques.
Group presentations :Group presentations by the participants, Presentations would be followed by question &
answer sessions, Extensive feedback would be given by the trainer on the strengths & areas of improvement,
Action plan for improvement for each individual student.
05 Hours
Course Outcomes:

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

 Students will develop knowledge, skills, and judgment around human communication that facilitate their ability
to work collaboratively with others.
 Such skills could include communication competencies such as managing conflict, understanding small group
processes, active listening, appropriate self-disclosure, etc.

Text & References:

 MadhulikaJha, Echoes, Orient Long Man
 Ramon & Prakash, Business Communication, Oxford.
 Sydney Greenbaum Oxford English Grammar, Oxford.
 M. Ashraf Rizvi ,Effective Technical Communication, Tata McGraw Hill
 AnjaneeSethi &BhavanaAdhikari, Business Communication, Tata McGraw Hill
 FOURTH SEMESTER

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20MAT41 3:0:2:0 4 CIE: 50 SEE: 50 3 Hours PCC

Course Objectives:
This course will enable students to:
 Acquire the knowledge of calculus of complex functions.
 Develop the proficiency in solving Numerical integral and Initial value problems.
 Obtain the knowledge of probability distributions.
 Learn concept of the Joint distributions and Marcos‘s chains. Known the importance of statistical inference in
engineering.

Syllabus
Module – I
Complex Variables: Functions of a complex variable, derivative of complex functions. Analyticfunctions,
(No problems by using limits). Cauchy‘s-Riemann equations in Cartesian and polar
forms, Harmonic functions – problems (No problems by
using limits). Construction of analytic functions byusing Milne- Thomson method -problems. Complex
integration: Line integrals -problems. CauchyTheorem (no problems on verification of the theorem) and
Cauchy‘s integral formula -problems.08 Hours Module – II
Numerical Methods: Numerical Integration-Trapezoidal rule, Simpson‘s 1/3rd and 3/8th
rule.
Numerical solutions of ordinary differential equations of first order and first degree- Picard‟s method,
Taylor‘s Series method, Modified Euler‘s Method, Runge-Kutta Method of 4th order and Milne‟s Predictor
Corrector Method (without proof) –Problems. 08
Hours Module – III
Random Variables and Probability Distribution: Discrete and continuous Random
Variables,
Probability density function and distributions. Binomial, Poisson, Exponential and Normal distributions.
08 Hours
Module – IV
Joint Probability and Markov’s Chain: Joint Probability distribution of two discrete random variables.
Expectations, correlation and covariation. Probability vectors, stochastic matrices, fixed point matrices,
regular stochastic matrices, Markov‟s Chains, higher transition probabilities, stationery distribution of regular
Markov‟s Chains. 08
Hours

Module – V
Sampling and inference: Sampling Distribution, testing of hypothesis, level of significance, confidence
limits, test of significance of large samples, sampling of variables, central limit theorem, confidence limitsfor
unknown means, Students t-distribution and Chi-square test. 08
Hours
 Text Books:
1. Dr. B.S. Grewal: ―Higher Engineering Mathematics‖, (Chapters 20,26,27,30,32), Khanna
Publishers, New Delhi, 42nd Edition, 2012, ISBN: 9788174091955.
2. N.P. Bali and Dr. Manish Goyal: ―A Text Book of Engineering Mathematics‖, (Chapters: 19,21),
3. Laxmi Publications (P) Ltd., New Delhi, 9th Edition, 2014, ISBN: 9788131808320.Seymour
Lipschutz and Marc Lars Lipson: ―Probability‖, (Chapters: 5 and 8), McGraw Hill Education (India) Private
Limited, Chennai, Special Indian Edition, 2010,ISBN: 978-0-07- 014622-8.

Reference Books:
1. Erwin Kreyszig: ―Advanced Engineering Mathematics‖, Wiley Pvt. Ltd., India, New Delhi,9thEdition,
2011, ISBN 13: 9788126531356.
2. B.V. Ramana: ―Higher Engineering Mathematics‖, Tata McGraw – Hill PublishingCompanyLimited, New
Delhi, 2nd Reprint, 2007, ISBN 13: 978-0-07063417-0.

E-Resources:
1. http://bookboon.com/en/essential-engineering-mathematics-ebook
2. https://www.free-ebooks.net/ebook/essential-engineering-mathematics
3. https://archive.org/details/AdvancedEngineeringMathematics10thEdition
http://www.zums.ac.ir/ebooks/mathematics/essential-engineering-mathematic.

Course Outcomes:
On completion of this course, the students are able to:
• Use the concepts of analytical functions and complex integration in engineering applicationproblems.
• Solve the Numerical integral and Initial value problems arising in engineering applications, usingnumerical
methods.
• Apply probability distributions in analyzing the probability models arising in engineering field.
• Apply Joint probability distributions and Markov‟s chains in analyzing the probability models arising in
engineeringfield.
• Use the concept of sampling analysis in analyzing the statistical models arising in engineering field
 DESIGN AND ANALYSIS OF ALGORITHMS

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CSI42 3:0:2:0 4 CIE: 50 SEE: 50 3 Hours PCC

Description of the course: Algorithms are the soul of computing. Algorithmic thinking is rooted in ancient
mathematics. This course introduces basic methods for the design and analysis of efficient algorithms
emphasizing methods useful in practice. Different algorithms for a given computational task are presented
and their relative merits evaluated based on performance measures. The following important computational
problems will be discussed: Sorting, Searching, String matching elements of Dynamic programming and
Greedy algorithms, Graph algorithms (Shortest path, Spanning trees, Tree traversals). This course covers
principles of algorithm design, elementary analysis of algorithms, and fundamental data structures. The
emphasis is on choosing appropriate data structures and designing correct and efficient algorithms to operate
on these data structures.

Prerequisite: Data Structures, Discrete Mathematics, Graph Theory.

Course Objectives:

This course will enable a student to:

 Acquire the knowledge of Algorithm and problem solving technique.
 Learn how to analyze the complexity of an algorithm in terms of time and space.
 Understand techniques like divide and conquer, decrease and conquer, transfer and conquer to solve
problems.
 Understand Space-Time Trade-offs and Dynamic programming technique.
 Describe the limitations of algorithms.

Syllabus

Module – I
Introduction: Definition of an algorithm, Fundamentals of algorithmic problem solving, Fundamentals of
the analysis of algorithm efficiency, Asymptotic Notations and basic efficiency classes, Mathematical
Analysis of Non-Recursive and Recursive Algorithms
Brute Force Approaches: Introduction, Selection Sort and Bubble Sort, Sequential Search and Brute Force
String Matching. 08 Hours

Module – II
Divide and Conquer: General Method, Binary Search, Merge Sort, Quick Sort and its performance.
The Greedy method: The General Method, Minimum-Cost Spanning Trees: Prim‘s Algorithm, Kruskal‘s
Algorithm, Single Source Shortest Paths. 08 Hours

Module – III
Decrease and Conquer: Introduction, Insertion Sort, Depth First Search, Breadth First Search, Topological
Sorting.
Transfer and Conquer: Introduction, 2-3 trees, Heap (Top-down and Bottom-Up Heap construction) and
Heap sort. 08 Hours

Module – IV
Space-Time Trade-offs: Introduction, Sorting by Counting, Input Enhancement in String Matching
(Horspool algorithm).
Dynamic programming: The General Method, Warshall‘s Algorithm, Floyd‘s Algorithm for the All-Pairs
Shortest Paths Problem, The Travelling Salesperson problem, Computing a Binomial co-efficient.
08 Hours
 Module – V
Backtracking: n-Queens problem, Subset–Sum Problem.
Hashing: Open Hashing, Closed Hashing.
Branch and Bound: Assignment problem, Knapsack problem. 08 Hours

List of Lab Programs:

Design, develop and implement the specified algorithms for the following problems using C/C++ Language
in LINUX environment.

1. Consider a list of ‗n‘ files numbered using ID‘s. Write a C program to sort files based on its ID using Quick
sort method.
2. Consider a list of ‗n‘ books numbered using Book_ID‘s. Write a C program to sort files based on its
Book_ID using Merge sort method.
3. Suppose a travel agent is interested in finding shortest path from a single city to all the other cities in a
network of ‗n‘ cities. Write a C program to implement this using Djikstra‘s algorithm.
4. Implement 0/1 Knapsack problem using Dynamic Programming.
5. Consider a Electrical layout where ‗n‘ houses are connected by electrical wires. Design a ‗C‘ program using
Prim‘s algorithm to output a connection with minimum cost.
6. Consider a network of ‗n‘ systems represented as a Graph. Write a ‗C‘ program to find the transitive closure
of such a network using Warshall‘s algorithm.
7. Suppose in a network of cities, you are interested in finding shortest paths between all cities. Design a ‗C‘
program to implement this using Floyd‘s algorithm.
8. Print all the nodes reachable from a given starting node in a digraph using BFS method.
9. Consider a network having ‗n‘ systems. Design a DFS based program in ‗C‘ which outputs all systems
reachable from a given system.
10. Consider ‗N‘ patients and ‗N X N‘ small rooms. Design a C program to allot the patients to these rooms
using n-queen‘s method such that no two patients are allotted rooms in same row, column or diagonal.

Course Outcomes:
After studying this course, the students will be able to:

 Identify asymptotic notations and basic efficiency classes.

 Solve problems using various techniques like greedy and divide-and-conquer.
 Compute problems using various techniques like decrease-and-conquer and transfer-and-conquer.
 Use different algorithms like TSP, Floyd‘s etc. to solve real world problems.
 Develop solutions for n-Queens problem, Subset–sum problem, Assignment problem, Knapsack problem
etc.

Text Books:
1. Anany Levitin: ―Introduction to The Design and Analysis of Algorithms‖, (Chapters 1-9,12), Pearson
Education, Delhi, 3rd Edition, 2007, ISBN-13 : 9780132316811.
2. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran: ―Fundamentals of Computer Algorithms‖, (Chapters
1,3-8,10-12), Universities Press, Hyderabad, 2nd Edition, 2007, ISBN-10: 8173716129.
Reference Books:
1. Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein: ―Introduction to Algorithms‖,
PHI, London, England, 3rd Edition, 2010, ISBN-13: 9780262033848.
2. R.C.T. Lee, S.S. Tseng, R.C. Chang and Y.T. Tsai: ―Introduction to the Design and Analysis of Algorithms
A Strategic Approach‖, McGraw-Hill Higher Education, USA, International Edition, 2005, ISBN-13: 978-
0071243469.

Reference Online Resources:

1. https://www.geeksforgeeks.org/fundamentals-of-algorithms/
2. http://www.citc.ui.ac.ir/zemoni/cls.pdf
 OPERATING SYSTEMS

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CIT43 3:0:0:0 3 CIE:50 SEE:50 3 Hours PCC

Description of the course:

This course enable the students to learn concepts of operating systems, such as processes and threads,
scheduling, synchronization, memory management, file systems, input and output device management and
security. The course will consist of assigned reading, weekly lectures, a CIE and SEE exam, and a sequence
of programming assignments. The goal of the readings and lectures is to introduce the core concepts. The
goal of the programming assignments is to give students some exposure to operating system code. Students
are expected to read the assigned materials prior to each class, and to participate in in-class discussions.
Prerequisite:
Students must be aware of basic computer concepts like what is keyboard, mouse, monitor, input,
output, primary memory and secondary memory etc. Students should have the knowledge of Digital logic
and its design (Basics will make them understand storing memory and page faults, Difference between ram
and rom. etc.). Computer Organization and Architecture (Design of Computer architecture will help you
understand computer peripherals and its storages, accessing them in operating system.
Course Objectives:
This course will enable students to:
• Learn the basic concepts of operating system, services and Process Handling.
• Impart adequate knowledge on the need of parallel programming using multi-threading concepts.
• Identify and handling deadlocks.
• Enable effective usage of the memory management techniques.
• Know about various file systems and understand the working of Linux Platform.

Syllabus
Module – I
Introduction to Operating Systems, System Structures: What operating systems do; Computer System
organization; Computer System architecture; Operating System structure; Operating System operations;
Process management; Memory management; Storage management; Protection and Security; Distributed
system; Special- purpose systems; Computing environments.
Operating System Services: User - Operating System interface; System calls; Types of system calls;
System programs; Operating system design and implementation; Operating System structure; Virtual
machines; Operating System generation; System boot.
08Hours
Module – II
Process Management: Process concept; Process scheduling; Operations on processes; Inter process
communication.
Multi-threaded Programming: Overview; Multithreading models; Thread Libraries; threading issues.
Process Scheduling: Basic concepts; Scheduling Criteria; Scheduling Algorithms; Multiple- processor
scheduling; thread scheduling.
08Hours
Module – III
Deadlocks: Deadlocks; System model; Deadlock characterization; Methods for handling deadlocks;
Deadlock prevention; Deadlock avoidance; Deadlock detection and recovery from deadlock.
08Hours
 Module – IV
Memory Management: Memory management strategies: Background; Swapping; Contiguous memory
allocation; Paging; Structure of page table; Segmentation.
Virtual Memory Management: Background; Demand paging; Copy-on-write; Page replacement;
Allocation of frames; Thrashing.
08Hours
Module – V
File System, Implementation of File System: File system: File concept; Access methods; Directory
structure; File system mounting; File sharing; Protection: Implementing File system: File system structure;
File system implementation; Directory implementation; Allocation methods; Free space management.
Case Study: The Linux Operating System: Linux history; Design principles; Kernel modules; Process
management; Scheduling; Memory Management; File systems, Input and output; Inter-process
communication.
08Hours

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

• Demonstrate functional architecture of an operating system.

• Describe process scheduling and Multithreading Concepts.
• Use suitable techniques for handling the deadlocks.
• Apply various memory management techniques.
• Realize the different concepts of OS in platform of usage through case studies.

Text Books:
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, ―Operating System Concepts‖ 9th edition, Wiley-
India, 2016.ISBN-13: 978-8126554270.

Reference Books:
1. Andrew S. Tanenbaum, Herbert Bos, "Modern Operating Systems " , 4th edition, Pearson, India, 2014.
ISBN-13: 978-0133591620.
2. D.M Dhamdhere, ―Operating Systems: A Concept Based Approach ―, 3rd Ed, McGraw-Hill, 2013.ISBN:
9781259005589.

E-Resources:
1. https://www.tutorialspoint.com/operating_system/index.htm.
2. https://www.studytonight.com/operating-system/.
 PYTHON PROGRAMMING (IC)

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type

20CSI44 2-0-2-0 4 CIE:50 SEE:50 3Hours PCC

Description of the course:

Python is a language with a simple syntax, and a powerful set of libraries. It is an interpreted
language, with a rich programming environment. Includes procedural and data abstractions, program
design, debugging, testing, and documentation. Covers data types, control structures, functions,
parameter passing, library functions, arrays, Regular expressions, inheritance and object oriented design.
Laboratory exercises in Python.
Prerequisite:
There are no such prerequisites to learn Python but having basic computer skills and knowledge of
any programming language concepts like what is a loop, what if and else does, how operators are used,
etc. will be helpful. If you have strong command over the basics of any programming language, you can
learn Python quickly.
Course Objectives:
This course will enable students to
• Learn the fundamentals of writing Python programming.
• Study the concepts of Iterations, Strings and Files in python.
• Understand the concept of core data structures.
• Acquire the knowledge of Object-Oriented Concepts in python.
• Gain the Knowledge about Python Libraries.

Syllabus
Module – I
Introduction :Why should you learn Python Programming, Introduction to Python, Python Interpreter
and its working, Syntax and Semantics, Variables, Expressions and Statements, Operators, Conditional
execution, User Input and Output.
08 hours
Module – II
Iteration: Looping Statements, Break Statement, Continue Statement.
Manipulating Strings: Creating String in Python, Traversal of Strings, String Slices, String Methods,
Strings are Immutable, Parsing Strings.
Files:File Operations, Exception Handling, Working with Files Example Programs.
08hours
Module – III
Data Structure’s:Lists,Dictionaries,Tuples.
Regular Expressions: Finding Patterns of Text without Regular Expressions, Finding Patterns of Text
with Regular Expressions, Matching Multiple Groups with the Pipe, Optional Matching with the
Question Mark, Matching Zero or More with the Star, Character Classes.
08 hours

Module – IV
OOP’s Concepts in Python:Classes and objects, Classes and functions, Classes and methods, Types of
methods, Inner class, Inheritance, Constructor,Method Overloading, Method Overriding.
08hours
Module – V
Python Libraries:Introduction to Numpy with Programming Examples.Working with DataSets
usingPandas withProgramming Examples.
Data Visualization:Introduction to Matplotlib with Programming Examples.Introduction to
Seabornwith Programming Examples.
08 hours
Laboratory
 1) Implement a Python Program to find GCDof twonumbers.
2) Implement a Python Program to find the square root of a number by Newton‘s Method.
3) Implement a Python program to find the exponentiation of a number.
4) Implement a Python Program to find the maximum from a list of numbers.
5) Implement a Python Program to perform Linear Search.
6) Implement a Python Program to perform Binary Search.
7) Implement a Python Program to perform Selection sort.
8) Implement a Python Program to perform Insertion sort.
9) Implement a Python Program to perform Merge sort.
10) Implement a Python Program to find first n Prime numbers.

Course Outcomes
On completion of this course, the students will be able to
 Apply Python syntax and semantics and be fluent in the use of Python flow control and functions.
 Demonstrate proficiency in handling Strings and Files.
 Implement Python Programs using core data structures like Lists, Dictionaries and use
Regular Expressions.
 Pertain the concepts of Object-Oriented Programming in Python.
 Develop exemplary applications using Python Libraries.

Text Books:
1. Charles R. Severance, ―Python for Everybody: Exploring Data Using Python 3‖, 1 st Edition, Create
Space Independent Publishing Platform, 2016, ISBN 13: 9781530051120, (Chapters 1 – 13, 15).
2. Allen B. Downey, "Think Python: How to Think Like a Computer Scientist‖, 2ndEdition, Green Tea
Press, 2015, ISBN 13:9781491939369, (Chapters 15, 16, 17).
3.Wes Mc Kinney, ―Python for Data Analysis‖ 1 st Edition, O‘Reilly Media Inc., ISBN: 978-1-449-31979-
3, (Chapters 4, 5).

Reference Books:
1. Charles Dierbach, "Introduction to Computer Science Using Python", 1st Edition, Wiley India Pvt Ltd,
2013. ISBN-13: 978-8126556014.
2. Mark Lutz, ―Programming Python‖, 4th Edition, O‟Reilly Media, 2011.ISBN-13: 978- 9350232873.
3. Wesley J Chun, ―Core Python Applications Programming‖, 3 rd Edition, Pearson Education India, 2015.
ISBN-13: 978-9332555365.
4. Roberto Tamassia, Michael H Goldwasser, Michael T Goodrich, ―Data Structures and Algorithms in
Python‖, 1st Edition, Wiley India Pvt Ltd, 2016. ISBN-13: 978-8126562176.
 SOFTWARE ENGINEERING

Course Code L:T:P:S Credits Exam marks Exam Duration Course Type
20CST45 3:0:0:0 3 CIE:50 SEE:50 3 hours PCC

Pre-requisite:
Software Development Life Cycle (SDLC), Scripting Language, Version Control Tool, Database

Course Objectives:

This course will enable students to,

• Recollect Software process models and compare their applicability
• Acquire Software Requirement Analysis and Specification
• Acquire Systematic software design procedure for Object Oriented and Real Time software
• Interpret how to develop and test a software application/product
• Cognize software cost estimation techniques and to know project management

Syllabus
Module – I

Introduction to Software Engineering & Software Process Model: what is Software Engineering
(SE), Difference between SE and System Engineering. The evolving role of software – the changing
nature of software- Life cycle models [Text Book-1]
Software Process Model: - Water fall, Incremental, Spiral, Evolutionary, Prototyping Concurrent
development – Specialized Process Models: Component-Based Development, The Formal Methods
Model, and Aspect-Oriented Software Development [Text Book-2]
08 Hours
Module – II
Software Requirement Analysis and Specifications: Functional and Non-Functional, User, System –
Requirement, Interface specification, software requirement documents.[Text Book-1]
Requirement Engineering Process: Feasibility Studies, Requirements Elicitation and analysis,
Requirement Validation and Requirement management. [Text Book-1]
System Model: Context Model, Behavioral model, Data Model, Object Model, Structured Model [Text
Book-1]
08 Hours
Module – III
Software Design: Architectural design, Architectural Design Document, Client Server Architecture
Distributed Object Architecture. [Text Book-1]
Object Oriented Design: Object Oriented Design Process, Design Evolution, [Text Book-1]
Real time Software Design: System Design, Real time Operating System, Monitoring and Control
System and Data Acquisition System [Text Book-1] 08 Hours

Module – IV

Software Development and Testing: Rapid Software Development-Agile Methods, Extreme

Programming, Rapid Application Development, [Text Book-1]
Software Reuse: Reuse landscape, Design Pattern, Application system Reuse [Text Book-1]
Verification and Validation; Planning Verification & Validation, Software Inspection, Verification and
 formal Methods. [Text Book-1]
Software Testing: Approaches of Software Testing, Software Testing Strategies, Test Strategies for
Object Oriented Software-Unit Testing, Integration Testing [Text Book-2]
08 Hours
Module – V

Software Cost Estimation and Project Management: Software cost estimation - COCOMO model –
Estimation Techniques, Project Duration and Staffing, [Text Book-1]
Quality management: Quality Assurance and Standard, Quality Planning and Quality Control [Text
Book-1]
Configuration Management: Configuration Management Planning, Change Management, Version and
Release Management [Text Book-1]
Emerging Technology: Security Concepts, Security Risk Management. [Text Book-1]
08 Hours

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

• Identify and apply Software life cycle and process models to compare their applicability
• Analyze the types of requirements and summarize Requirement Engineering for various System models
• Design data, functional and behavioral model for any given software requirement
• Apply appropriate techniques and Test the software application/product for a given problem
• Comprehend concepts of software quality assurance and software configuration management

Text Books:
1. Ian Sommerville, ‖Software Engineering‖, 8th Edition,ISBN-10-9332582696,ISBN-13- 978-
9332582699,Pearson Education (24 May2017).
2. Rogar Pressman, ―Software Engineering and Application‖, 7th Edition, McGraw Hill Education
Publication, 2009,ISBN-13:9789339212087.
REFERENCES:
1. Pankaj Jalote, ―Software Engineering, A Precise Approach‖, Wiley India, 2010,ISBN: 9788126523115
2. Pfleeger and Lawrance, ―Software Engineering: Theory and Practice‖ Pearson Education, 2 nd Edition,
200.1
3. Stephan Schach, ―Software Engineering‖, Tata McGraw Hill, 2007.
4. Rajib Mall, ―Fundamentals of Software Engineering‖, 3 rd Edition, PHI Learning Private Limited, 2009,
.ISBN-10-9788120338197,ISBN-13-978-8120338197.
5. Kelkar S.A., ―Software Engineering‖, ISBN 10: 8120332725, ISBN 13: 9788120332720,
Publisher: Prentice-Hall of India Pvt.Ltd, 2007.

E-Resources:
1. https://www.pearson.com/us/higher-education/product/Sommerville-Software-Engineering- 9th-
Edition/9780137035151.html.
2. https://www.abebooks.com/9788120332720/Software-Engineering-Kelkar-S-A- 8120332725/plp
3. https://www.wileyindia.com/pankaj-jalote-s-software-engineering-a-precise-approach.html
 FUNDAMENTALS OF MACHINE LEARNING

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CIT46 3:0:0:0 3 CIE 50: SEE 50 3Hrs PCC

Description of the course: Machine learning (ML) is a form of Artificial intelligence that makes
predictions from data.it is a new technological aspects which are used to automate processes like image
classification, speech recognition, and market forecasting. A machine learning (ML) developer is an
expert on using data to training models.

Prerequisite: Introduction to Machine learning, udemy, NPTEL

Course Objectives:
This course will enable students to:
• Understand the basic concepts of machine learning
 Understand the well posed learning techniques.
• Understand decision tree algorithms
• Learn Artificial Neural Networks with multilayer perceptron‘s.
• Understand Reinforcement learning concept.

Module - I
Introduction: Introduction to machine learning, types of Machine learning, supervised learning,
unsupervised learning, semi supervised learning, reinforcement learning, Batch learning, Online
Learning, Instance based learning, Model based learning, Bad and insufficient quality of data,poor
quality data, Irrelevant features, Testing, Over fitting and Under fitting the data
08 Hours

Module – II
Introduction to Well-Posed Learning problems, Designing a learning system, Perspectives and issues in
machine learning,Find-S Algorithm, Candidate elimination Algorithm.
08 Hours

Module-III
Decision Tree Learning : Introduction, Decision Tree representation, Appropriate problems for
decision tree learning, The basic decision tree algorithm, Hypothesis space search in decision tree
algorithms, Issues in decision tree learning.
08 Hours

Module – IV
Artificial Neural Networks: Introduction, Neural network representation, Problems for neural network
learning, Perceptrons, Multiple layer networks and back propagation algorithm, Remarks on the Back
propagation Algorithm
08 Hours

Module – V
Reinforcement Learning: Introduction, Reinforcement learning problem, Reinforcement learning
problem characteristics, The Learning task, Q Learning ,An Algorithm for Q learning
08 Hours

Course Outcomes (CO's):

At the end of course Students will be able to
CIT46.1 Learning the basic concepts of machine learning and its types.
CIT46.2 Choose the well posed learning techniques and investigate the
examples
 CIT46.3 Identify the characteristics of decision tree and solve problems
associated with Machine
Learning.

CIT46.4 Apply effectively neural networks for appropriate applications.

CIT46.5 investigate Reinforcement techniques and derive effectively

learning rules.

Text Books:

1. Tom M Mitchell, ―Machine Learning‖, McGrraw-Hill

2. Rudolph Russell, Machine Learning Step by step guide to implement machine learning algorithms with
python

Reference Books:

1. Aaron Courville, Ian Goodfellow, and YoshuaBengio, Deep Learning, MIT Press,2015, ISBN:
9780262035613

2. Christopher Bishop, Pattern recognition and machine learning. Himalaya Publishing House.
ISBN: 98345789

3. Course material available on Swayam platform and NPTEL, for the course on Introduction to
Machine Learning, conducted by Prof. SudeshnaSarkar, IIT Kharagpur.

4.EthemAlpaydın, Introduction to Machine Learning, MIT press 4th edition ISBN: 9780262043793.

5. C Agarwal, Machine Learning for Text, Pearson Education - 2006 (2 & 4). ISBN – 15:34519801.
 UNIVERSAL HUMAN VALUES

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
CIE:50SEE:50 MC
20UHV47 3:0:0:0 3 3 Hours

Course Objectives:
□ To help students distinguish between values and skills, and understand the need, basicguidelines,
content and process of value education.
□ To help students initiate a process of dialog within themselves to know what they ‗really wantto be‘ in
their life and profession.
□ To help students understand the meaning of happiness and prosperity for a human being.
□ To facilitate the students to understand harmony at all the levels of human living, and live
accordingly.
□ To facilitate the students in applying the understanding of harmony in existence in their
profession and lead an ethical life.

Module-1
Introduction to Value Education: Understanding the need, basic guidelines, content and process for
Value Education. Self-Exploration–what is it? - its content and process; ‗Natural Acceptance‘ and
Experiential Validation- as the mechanism for self-exploration. Continuous Happiness and Prosperity- A
look at basic Human Aspirations. Right understanding, Relationship and Physical Facilities- the basic
requirements for fulfilment of aspirations of every human being with their correct priority.
Understanding Happiness and Prosperity correctly- A critical appraisal of the current scenario. Method
to fulfil the above humanaspirations: understanding and living in harmony at various levels.

Module-2
Harmony in the Human Being: Understanding human being as a co-existence of the sentient ‗I‘ and
the material ‗Body‘. Understanding the needs of Self (‗I‘) and ‗Body‘ - Sukh and Suvidha.
Understanding the Body as an instrument of ‗I‘ (I being the doer, seer and enjoyer). Understanding the
characteristics and activities of ‗I‘ and harmony in ‗I‘. Understanding the harmony of I with the Body:
Sanyam and Swasthya; correct appraisal of Physical needs, meaning of Prosperity in detail. Programs to
ensure Sanyam and Swasthya.
Module-3
Harmony in the Family and Society: Understanding harmony in the Family- the basic unitof human
interaction. Understanding values in human-human relationship; meaning of Nyaya and program
for its fulfilment to ensure Ubhay-tripti; Trust (Vishwas) and Respect (Samman) as the foundational
values of relationship. Understanding the meaning of Vishwas; Difference between intention and
competence. Understanding the meaning of Samman, Difference between respect and differentiation; the
other salient values in relationship. Visualizing a universal harmonious order in society- Undivided
Society (AkhandSamaj), Universal Order (SarvabhaumVyawastha )- from family to world family!

Module – IV
Harmony in the Nature (Existence): Understanding the harmony in the Nature. Interconnectedness
and mutual fulfilment among the four orders of nature- recyclability and self-regulation in nature.
Understanding Existence as Co-existence (Sah-astitva) of mutually interacting units in all-pervasive
space.Holistic perception of harmony at all levels of existence
Module – V
Implications of the Holistic Understanding - a look at Professional Ethics: Natural acceptance of
human values. Definitiveness of Ethical Human Conduct. Basis for Humanistic Education, Humanistic
Constitution and Humanistic Universal Order. Competence in Professional Ethics: Ability to utilize the
professional competence for augmenting universal human order. Ability to identify the scope and
characteristics of people-friendly and eco- friendly production systems, technologies and management
models. Strategy for transition
 from the present state to Universal Human Order: At the level of society: as mutuallyenriching
institutions and organizations.

Course Outcomes:
On completion of this course, the students will be able to
□ Understand the significance of value inputs in a classroom and start applying them in their lifeand
profession.
□ Distinguish between values and skills, happiness and accumulation of physical facilities, theSelf and
the Body, Intention and Competence of an individual etc.
□ Understand the value of harmonious relationship based on trust and respect in their life and
profession.
□ Understand the role of a human being in ensuring harmony in society and nature.
Distinguish between ethical and unethical practices and start working out the strategy toactualize a
harmonious environment wherever they work
Text Books:
• R R Gaur, R Sangal, G P Bagaria, 2009, A Foundation Course in Human Values and
Professional Ethics.
Reference Books:
Ivan Illich, 1974, Energy & Equity, The Trinity Press, Worcester, and Harper Collins,USA
2. E.F. Schumacher, 1973, Small is Beautiful: a study of economics as if people mattered,Blond & Briggs,
Britain.
3. Sussan George, 1976, How the Other Half Dies, Penguin Press. Reprinted 1986, 1991
4. Donella H. Meadows, Dennis L. Meadows, Jorgen Randers, William W. Behrens III, 1972,Limits to
Growth – Club of Rome‘s report, Universe Books.
5. A Nagraj, 1998, Jeevan Vidya Ek Parichay, Divya Path Sansthan, Amarkantak.
6. P L Dhar, RR Gaur, 1990, Science and Humanism, Commonwealth Publishers.
7. A N Tripathy, 2003, Human Values, New Age International Publishers.
8. SubhasPalekar, 2000, How to practice Natural Farming, Pracheen (Vaidik)KrishiTantraShodh,
Amravati.
9. E G Seebauer & Robert L. Berry, 2000, Fundamentals of Ethics for Scientists & Engineers ,Oxford
University Press
10. M Govindrajran, S Natrajan & V.S. Senthil Kumar, Engineering Ethics (including HumanValues),
Eastern Economy Edition, Prentice Hall of India Ltd.
11. B P Banerjee, 2005, Foundations of Ethics and Management, Excel Books.
B L Bajpai, 2004, Indian Ethos and Modern Management, New Royal Book Co., Lucknow.Reprinted
2008.
Reference Online Resource:
https://meet.google.com/oad-yohu-drv
 PROFESSIONAL DEVELOPMENT OF ENGINEERS
Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20PDE49 1:2:0:0 2 CIE:50 SEE:50 3 Hours PT

Course Objectives:
This course will enable students to:
□ Explain instances when sending email is necessary and appropriate.
□ Create an email subject line that accurately describes the content of themessage.
□ Clarify and prioritize one‟s objectives and goals, by creating more planning time.
□ Set and accomplish goals by self-reflection and self-monitoring
□ Identify, prevent, and manage stress to improve academic success.
□ Distinguishing between management and leadership and Sharpening interpersonalandcommunication
Skills.

Syllabus
Module – I
Team Building: Defining team and its important elements, Clarifying the advantages and challenges
ofteam work, understanding bargains in team building, defining behavior to sync with team work,
Teambuilding activities. Email etiquette: Before you start typing: what to send by Email, ―What I‘m
trying to say‖: creating an accurate subject line It's still business writing: 12 common errors to
avoid, Before clicking „send‟: checking, proofing and copying, Damage control: Rx for bad email
moments.

Module – II
Time Management: Assessing time management strengths and weaknesses, Removing the barriers
ofproductivity Overcoming the procrastination habit Focusing and staying in the zone Learning to be
present: the power of now Managing tasks, projects, goals and Ideas Determining and managing
priorities.
Module – III
Stress Management: Achieving work-life balance by becoming better at stress management,
Approaching stress management in scientific manner, enhancing personal effectivenessthrough
managing stress, Learning stress management techniques, responding resourcefully tostress situations.
Goal Setting Developing a mission statement, creating goal, establishing specific, measurable,
achievable, realistic and time-targeted (S.M.A.R.T) goals, Constructingaction Steps, Making
Module – IV
Business Etiquettes: Importance of Business Etiquettes, Difference between Social and Business
Etiquettes, Types of Business Etiquettes – Dining, Telephone, Office, Meeting, Dressing, Cubicle and
Networking an action plan presentation. Leadership Skills: What is Leadership? Leaders V/s Followers,
Managers V/s Leaders, Testing your Leadership Potential, Your Personality – Conduit of Leadership,
Team Leadership, Leadership & ConflictResolution, Assertiveness and Leadership.

Module – V
SWOT:Understanding SWOT, SWOT analysis, Understand the concept behind SWOT analysis,
Understand the value of SWOT analysis on an individual, Successfully perform a SWOT analysis
Individual Presentations: Individual presentations by the Participants, Presentationswould be followed
by question & answer sessions, Extensive feedback would be given by the trainer on the strengths &
areas of improvement, Review of performance when compared with previous semesters, Action plan for
improvement for each individual student.
 FIFTHSEMESTER

ADVANCED AI & ML TECHNIQUES

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CIT51 3:0:0:0 3 CIE:50 SEE:50 3 Hours PCC

Pre-Requisites:
1. Mathematics, Probability and statistics
2. Knowledge in programmingLanguage
Course objectives:
The Student will:
1. Know the AI basedproblems.
2. Illustrate AI techniques for representing the basicproblem.
3. Illustrate Advanced AI techniques to solve theproblem.
4. Define Learning and explain various learningtechniques.
5. Understand the usage expertsystem.
Module 1:
Introduction: AI problems, Agents and Environments, Structure of Agents, Problem Solving Agents
Basic Search Strategies: Problem Spaces, Uninformed Search (Breadth-First, Depth- First Search, Depth-
first with Iterative Deepening), Heuristic Search (Hill Climbing, Generic Best-First, A*), Constraint
Satisfaction (Backtracking, Local Search)
Module 2:
Advanced Search: Constructing Search Trees, Stochastic Search, A* Search
Implementation, Minimax Search, Alpha-BetaPruning
Basic Knowledge Representation and Reasoning: Propositional Logic, First-Order Logic, Forward
Chaining and Backward Chaining, Introduction to Probabilistic Reasoning, Bayes Theorem.
Module 3:
Advanced Knowledge Representation and Reasoning: Knowledge Representation Issues, Non-
monotonic Reasoning, Other Knowledge Representation Schemes.
Reasoning Under Uncertainty: Basic probability, Acting Under Uncertainty, Bayes‘ Rule, Representing
Knowledge in an Uncertain Domain, Bayesian Networks.
Module 4:
Learning: What Is Learning? Rote Learning, Learning by Taking Advice, Learning in Problem Solving,
Learning from Examples, Winston‘s Learning Program, Decision Trees.
 Module 5:
Expert Systems: Representing and Using Domain Knowledge, Shell, Explanation, Knowledge
Acquisition.
Text Books:
1. Russell, S. and Norvig, P, Artificial Intelligence: A Modern Approach, Third Edition, Prentice- Hall, 2010
References Books:
1. Artificial Intelligence, Elaine Rich, Kevin Knight, Shivasankar B. Nair, The McGraw Hill publications,
Third Edition,2009.
2. George F. Luger, Artificial Intelligence: Structures and Strategies for Complex Problem Solving, Pearson
Education, 6th ed.,2009.
E - Resources:
1. https://www.tutorialspoint.com/artificial_intelligence/artificial_intelligence_pdf_version.ht
m
2. https://www.alljntuworld.in/download/artificial-intelligence-ai-materials-notes/
3. https://drive.google.com/file/d/1mPiI4jy6YkJRDiCT21xgzN0VDNkrW23X/view4.https://n
ptel.ac.in/courses/106/105/106105077/
Course outcomes:
The Student will be able to:
1. Identify the AI based problems.
2. Apply AI techniques for representing the basic problem.
3. Apply Advanced AI techniques to solve the problem.
4. Analyze Learning and explain various learning techniques.
5. Illustrate the use of expert system.
 WEB TECHNOLOGY(IC)

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CII52 3 : 0 : 2: 0 4 CIE:50 SEE:50 3 Hours PCC

Description of the course:This course provides an introduction to web development and client-side
scripting. After providing a review of HTML5 and CSS, the course provides exposé to the concepts of
web programming using client side scripting. The course covers basic construction of web page, cascading
style sheet, and java script.

Prerequisite:
Basic programming and debugging skills, Java Programming, Database and SQL queries , connectivity of
front end and back end

Course Objectives: This course will enable students to:

• Recollect the evolution of World Wide Web and its relevance to today's technological revolution and also,
to comprehend HTML, CSS scripts to design web layouts.
• Aquire Java Script skills for developing client side web applications.
• Interpret the use of jQuery libraries to simplify complicated JavaScript applications and also, to perform
DOM manipulation using jQuery constructs.
• Cognize Bootstrap framework with a focus on creating interactive and responsive web pages.
• Assimilate XML fundamentals for developing applications over web.

Syllabus
Module - I
HTML 5 and CSS: Introduction to Hyper Text Markup Language, HTML Elements and Attributes,
Headers, Colors, Formatting Elements, Links, Images, Tables, Divs, Lists, Forms, Frames, iframes,
HTML Media. CSS: Introduction to CSS, CSS selector, CSS formatting, positioning, layouts, debugging.
08 Hours

Module - II

JavaScript: Introduction, Scripts and HTML Document, JS Output Statements, Variables, Data Types
and Conversions, Operators, Expressions, Control Structure, Decisions and Loops, Functions, Document
Object Model, Forms and Form Handling Elements, Scripting, Event Handling, Regular Expressions,
WEB SQL database
08 Hours

Module-III
JQuery: Introduction, Selectors, Events, jQuery DOM Manipulation: jQuery HTML, jQuery CSS, jQuery
Event Model, jQuery Effects and Animations, jQuery Plugins.
08 Hours

Module - IV
Bootstrap: Bootstrap Scaffolding, Bootstrap CSS, Bootstrap Layout Components, Bootstrap JavaScript
Plugins, Using Bootstrap, Web services
08 Hours
Module – V
XML: Introduction, Syntax, Document Type Definitions, Namespaces, XML Schemas, Displaying Raw
XML Documents, Displaying XML Documents with CSS.
08 Hours

Laboratory: 12 Hours
I. HTML and CSS
1. Write and Implement HTML script to display employee details like name, address, mobile number,
email id etc similar to a telephone directory.
2. Demonstrate a HTML program to display a nested list to list down all the elements serviced by an event
management company. The list should be a nested list with main events and subevents.
3. Implement a HTML and CSS script to create a webpage with table structure containing alternative
backgrounds using class selector functionalities.
4. Design a HTML and CSS program for the coverpage which displays the events taking place in and
around the state.
II. JavaScript
5. Construct a HTML and javascript program to implement a simple banking application using SQL
database. The application should provide features like withdraw, deposit, balance enquiry etc.
6. Implement a HTML and javascript program to create a registration page having fields name, username,
email Id, password & re-enter password and apply validation using match &equalfunctions.

III. jQuery
7. Create a webpage to fetch the details of the event anddisplay the invitation using HTML and jQuery.
8. Design a webpage to accept event organizer name from the user and display it on the webpage using
HTML and jQuery

IV. Bootstrap
9. Illustrate a HTML and bootstrap program to display glyphicons like envelop, print, search etc. Also,
create buttons having glyphicons as links to carry out specific tasks.

V. XML
10. Develop a XML program to store book details like title, author, publication year, price etc. using RSS.

Course Outcomes
Sl. No. Course Outcomes
C203.1 Apply to Analyze the web layouts with style sheets and web screens in a
presentable form.
C203.2 Create interactive web pages through form validations using Java Script and
other methods.
C203.3 Use jQuery libraries to accelerate UI development.
C203.4 Designanddevelopresponsivewebpagesusingbootstrapframework.
C203.5 Createapplicationsbyusingsynchronousandasynchronouscommunication
overweb.
Text Books:
1. Robert W. Sebesta: ―Programming the World Wide Web‖, Pearson, 4th Edition, 2012, ISBN: 978-81-
317-6458-9.
2. Jon Duckett: ―Web Design with HTML, CSS, JavaScript and jQuery Set‖, Wiley, 1st Edition, 2014,
ISBN 13: 978-1118907443.
3. Silvio Moreto, Matt Lambert, Benjamin Jakobus, Jason Marah:‖ Bootstrap 4 - Responsive Web
Design‖, Packt Publishing, 2016, ISBN 978-1-78839-731-5

Reference Books:
1. Jake Spurlock: ―Bootstrap, Shroff‖, O‟Reilly Media, United States of America, 1st Edition, 2013,
ISBN: 978 -1 -4493-4391-0.
2. Bear Bibeault, Yehuda Katz and Aurelio De Rosa: ―jQuery in Action‖, Dreamtech Press, New Delhi,
India, 3rd Edition, 2015, ISBN: 978-1617292071
E-Resources:

1. http://www.w3schools.com/
2. https://www.tutorialspoint.com/
3. https://www.javascript.com/learn/
4. https://learn.jquery.com
 DATA WAREHOUSING & DATA MINING(IC)

Course L:T:P:S Credits Exam Marks Exam Course

Code duration Type
20CII53 3:0:2:0 4 CIE:50 SEE:50 3 hours PCC

Course Objectives:
This course will enable students to,
1. Identify the scope and necessity of Data Mining and Warehousing forth society
2. Describe various Data Models and Design Methodologies of Data Warehousing destined to solvethe
root problems
3. UnderstandvariousToolsofDataMiningandtheirTechniquestosolvetherealtimeproblems
4. Learn how to analyze the data, identify the problems, and choose the relevant algorithms to apply.
5. Assess the Pros and Cons of various algorithms and analyze their behavior on real datasets

Syllabus

Module – I
Data Mining: Introduction - Steps in KDD - System Architecture – Types of data -Data mining
functionalities - Classification of data mining systems - Integration of a data mining system with a data
warehouse - Issues - Data Preprocessing – Data Mining Application.
08 Hours

Module – II
Data Warehousing: Data warehousing components - Building a data warehouse - Multi Dimensional
Data Model - OLAP Operation in the Multi- Dimensional Model - Three Tier Data Warehouse
Architecture - Schemas for Multi-dimensional data Model - Online Analytical Processing (OLAP) -
OLAP Vs OLTP Integrated OLAM and OLAP Architecture.
08 Hours

Module – III
Association Rule Mining: Mining frequent patterns - Associations and correlations - Mining Methods
Finding Frequent item set using Candidate Generation - Generating Association Rules from Frequent Item
sets - Mining Frequent item set without Candidate Generation Mining various kinds of association rules -
Mining Multi-Level Association Rule-Mining Multidimensional Association Rule- Mining Correlation
analysis - Constraint based association mining.
08Hours

Module – IV
Classification and Prediction: Classification and prediction - Issues Regarding Classification and
Prediction - Classification by Decision Tree Induction - Bayesian classification – Bayes‘ Theorem - Naïve
Bayesian Classification - Bayesian Belief Network - Rule based classification - Classification by Back
propagation - Support vector machines - Prediction-Linear Regression.
08 Hours

Module – V
Clustering, Applications and Trends in Data Mining: Cluster analysis - Types of data in Cluster
Analysis- Categorization of major clustering methods - Partitioning methods– Hierarchical methods -
Density-based methods - Grid-based methods - Model based clustering methods -Constraint Based cluster
analysis - Outlier analysis - Social Impacts of Data Mining- Case Studies: Mining WWW- Mining Text
Database- Mining Spatial Databases.
08Hours
 Course Outcomes:
On completion of this course, the students will be able to,
CO1: Assess Raw Input Data and process it to provide suitable input for a range of data mining
algorithm
CO2: Design and Modelling of Data Warehouse
CO3: Discover interesting pattern from large amount of data CO4: Design and Deploy appropriate
Classification TechniquesCO5: Able to cluster high dimensional data

Text Books:
1) Jiawei Han and Micheline Kamber, ―Data Mining Concepts and Techniques‖, 2ndEdition,Elsevier,
2007,ISBN-10 -9789380931913,ISBN-13-978-9380931913.
2) Alex Berson and Stephen J. Smith, ―Data Warehousing, Data Mining & OLAP‖, Published byTata
McGraw-Hill Education Pvt. Ltd., 2004, ISBN 10: 0070587418 / ISBN 13: 9780070587410.
3) Pang-Ning Tan, Michael Steinbach and Vipin Kumar, ―Introduction to Data Mining‖, Person
Education, 2007.ISBN-13-9788131714720,ISBN-10-8131714720.
4) G. K. Gupta, ―Introduction to Data Mining with Case Studies‖, Easter Economy Edition, PrenticeHall of
India, 2006,ISBN-13:9788120350021,ISBN - 10 :8120350022.
5) Daniel T.Larose, ―Data Mining Methods and Models‖, Publisher-John Wiley & Sons, 2006,2006,ISBN
8126507764, 9788126507764.

References:
1) Pieter Adriagus, DolfZantinge"DataMining",Addison-WesleyPublisher,Pearson education,2007,
ISBN978-81-317-0717-3.
2) Sam Anahory, Dennis Murray "Data Warehousing in the Real World", Pearson
education,ISBN978-81-317-0459-2,2009.

E-Resources:
1) https://study.com/academy/lesson/data-warehousing-and-data-mining-information-for-business-
intelligence.html
2) http://myweb.sabanciuniv.edu/rdehkharghani/files/2016/02/The-Morgan-Kaufmann-Series-in-Data-
Management-Systems-Jiawei-Han-Micheline-Kamber-Jian-Pei-Data-Mining.-Concepts-and- Techniques-
3rd-Edition-Morgan-Kaufmann-2011.pdf.
https://www-users.cs.umn.edu/~kumar001/dmbook/index.php
 MICROCONTROLLER & EMBEDDED SYSTEMS

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CIT54 3:0:0:0 3 CIE 50: SEE 50 3Hrs PCC

Module 1

Microprocessors versus Microcontrollers, ARM Embedded Systems: The RISC design philosophy, The
ARM Design Philosophy, Embedded System Hardware, Embedded System Software. ARM Processor
Fundamentals: Registers, Current Program Status Register, Pipeline, Exceptions, Interrupts, and the
Vector Table , Core Extensions

Module 2

Introduction to the ARM Instruction Set : Data Processing Instructions , Programme Instructions,
Software Interrupt Instructions, Program Status Register Instructions, Coprocessor Instructions, Loading
Constants ARM programming using Assembly language: Writing Assembly code, Profiling and cycle
counting, instruction scheduling, Register Allocation, Conditional Execution, Looping Constructs

Module 3

Embedded Vs General computing system, Classification of Embedded systems, Major applications and
purpose of ES. Core of an Embedded System including all types of processor/controller, Memory,
Sensors, Actuators, LED, 7 segment LED display, Optocoupler, Relay, Piezo buzzer, Push button switch,
Communication Interface (onboard and external types), Embedded firmware, Other system components.

Module 4

Embedded System Design Concepts: Characteristics and Quality Attributes of Embedded Systems,
Operational quality attributes ,non-operational quality attributes, Embedded 08
Systems-Application and Domain specific, Hardware Software Co-Design and Program Modelling,
embedded firmware design and development

Module 5

RTOS and IDE for Embedded System Design: Operating System basics, Types of operating systems,
Task, process and threads (Only POSIX Threads with an example program), Thread preemption,
Multiprocessing and Multitasking, Task Communication (without any program), Task synchronization
issues-Racing and Deadlock, Concept of Binary and counting semaphores (Mutex example without any
program), How to choose an RTOS, Integration and testing of Embedded hardware and firmware,
Embedded system Development Environment-Block diagram (excluding Keil), Disassembler/decompiler,
simulator, emulator and debugging techniques, target hardware debugging, boundary scan.

Course outcomes:
 Course Outcome

After studying this course, students will be able to:

 Describe the architectural features and instructions of 32 bit microcontroller ARM Cortex M3.
 Apply the knowledge gained for Programming ARM Cortex M3 for different applications. 
 Understand the basic hardware components and their selection method based on the characteristics and
attributes of an embedded system.
 Develop the hardware /software co-design and firmware design approaches.
 Explain the need of real time operating system for embedded system applications. 

Text Books:
1. Andrew N Sloss, Dominic Symes and Chris Wright, ARM system developers guide, Elsevier, Morgan
Kaufman publishers, 2008.
2. Shibu K V, Introduction to Embedded Systems, Tata McGraw Hill Education, Private Limited, 2nd
Edition.
 COMPUTER NETWORKS
Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
21CIT55 3:0:0:0 3 CIE:50 SEE:50 3 Hours PCC

Course Objectives:
This course will enable students to:

• Understand the basics of data flow, network categories, models and different types of switchednetworks used
in communication.
• Know different types of error detection and correction techniques and also, error controlprotocols
applied in the data link layer.
• Compare the design, working and implementation of Internet protocols as well as routingprotocols
responsible for network layer communication.
• Gain Knowledge about TCP, UDP protocols and also, network security concepts.
• Learn the use of various application layer protocols.

Syllabus
Module – I
Introduction, Network Models & Switching: Data Communications, Networks, Network Types,
Network Models: TCP/IP Protocol Suite, The OSI Model. Switching: Circuit-Switched Networks, Packet
Switching. 08 hours

Module – II
Error Detection and Correction & Data Link Control (DLC): Error Detection and Correction:
Introduction, Block Coding, Cyclic Codes, Checksum, Forward Error Correction. Data Link Control: DLC
Services, Data-Link Layer Protocols, HDLC, PPP (Framing, Transition pha s e s only).
08 hours
Module – III
Network Layer Protocols & Routing: Network Layer Protocols: IPv4 addressing, Internet Protocol (IP),
Mobile IP. Routing: Introduction, Routing Algorithms, Unicast Routing Protocols. Next Generation IP:
IPv6 addressing, IPv6 protocol. 08 hours

Module – IV
Transport and End-to-End protocol & Network Security: User Datagram Protocols (UDP),
Transmission Control Protocol (TCP), TCP Congestion Control. Overview of Network Security:
Symmetric-Key Cryptography, Public-Key Cryptography. 08 hours

Module – V
Applications: Overview of the Application Layer, Domain Name System (DNS), Electronic Mail (E-
Mail), World Wide Web (WWW), Remote Login Protocols, File transfer and FTP.
08 hours
 Course Outcomes:
On completion of this course, the students will be able to:
 Establish appropriate switched networks based on the network models and use them forcommunication.
 Resolve errors that occur during communication and also, to analyze DLC protocols.
 Assign/map internet (logical) addresses to PDUs as well as, they can implement different routing
algorithms.
 Implement network applications choosing either TCP or UDP depending on the requirements andalso, can
integrate security measures for the applications.
 Use application level protocols in the current technology trends.

Text Books:
1. Behrouz A. Forouzan,: Data Communication and Networking, 5th Edition, Tata McGraw- Hill, July 2013,
ISBN : 978-0-07-131586-9( Chapters 1, 2, 8, 10, 11,18,19, 20).ISBN:12- 786-3452156432.
2. Nader F. Mir: Computer and Communication Networks, 2nd Edition, Pearson Education, 2015, ISBN:
0133814742, (Chapters 8, 9, 10).

Reference Books:
1. William Stallings: Data and Computer Communication, 8th Edition, Pearson Education,2007, ISBN-
13: 978-0133506488.
2. Larry L. Peterson and Bruce S. Davie: Computer Networks – A Systems Approach, 4thEdition,
Elsevier, 2007, ISBN: 978-0-12-385059-1.

E-Resources:
1. https://archive.org/details/Data.Communications.and.Networking.5th.Edition.
2. https://doc.lagout.org/network/Data%20Communications%20and%20Networking%20By%20
Behrouz%20A.Forouzan.pdf
3. http://ptgmedia.pearsoncmg.com/images/9780133814743/samplepages/9780133814743.pdf
 SOFTWARE ARCHITECTURE

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CIT561 3:0:0:0 3 CIE 50: SEE 50 3Hrs PEC

Course Objectives
The Student will:
1. Understand that design patterns are standard solutions to common software design problems
2. Discuss to know how to use systematic approach that focus and describe thatdescribe abstract systems of
interaction between classes, objects and communicationflow
3. Understand the architecture evaluation and design decision making
4. Understand how to apply these patterns on variousplatforms.
5. Understand the responsibilities for developingsoftware.
Module 1:
Envisioning Architecture The Architecture Business Cycle, What is Software Architecture, Architectural
patterns, reference models, reference architectures, architectural structures and views. Creating an
Architecture Quality Attributes, Achieving qualities, Architectural styles and patterns, designing the
Architecture, Documenting software architectures, Reconstructing Software Architecture.

Module 2:
Analyzing Architectures Architecture Evaluation, Architecture design decision making, ATAM, CBAM.
Moving from one system to many Software Product Lines, Building systems from off the shelf
components, Software architecture in future.

Module 3:
Patterns Pattern Description, Organizing catalogs, role in solving design problems, Selection and
usage.Creational and Structural patterns Abstract factory, builder, factory method, prototype, singleton,
adapter, bridge, composite, façade, fly weight.

Module 4:
Behavioural patterns Chain of responsibility, command, Interpreter, iterator, mediator, memento, observer,
state, strategy, template method, visitor
 Module 5:
Case Studies A-7E –A case study in utilizing architectural structures, The World Wide Web -a case study
in interoperability, Air Traffic Control –a case study in designing for high availability, Celsius Tech –a
case study in product line development.

Text books:
1. Software Architecture in Practice, second edition, Len Bass, Paul Clements & Rick Kazman, Pearson
Education,2003.
2. Design Patterns, Erich Gamma, Pearson Education,1995.

Reference books:
1. Architecture in Practice, Len Bass, Paul Clements, RickKazman.
2. Software Documenting Software Architectures: Views and Beyond Paul Clements, Felix Bachmann, Len
Bass, David Garlen, James Ivers, Reed Little, Robert Nord, JudithStafford.

E - Resources:
1.http://en.wikibooks.org/wiki/Introduction_to_Software_Engineering/Architecture/Design_Patterns.

Course Outcomes
The student will be able to:
1. Apply a deeper knowledge of the principles of Object OrientedDesign.
2. Show the knowledge of the design patterns that are common in softwareapplications.
3. Illustrate the knowledge of these patterns that are related to object –orienteddesign.
4. Analyze various architecturalpatterns
5. Apply the Knowledge for developing asoftware.
 DIGITAL IMAGE PROCESSING

Course L:T:P:S Credits Exam Marks Exam Course

Code Duration Type
20CIT562 3:0:0:0 3 CIE:50 SEE:50 3 Hours PEC

Course Objectives:
This course will enable students to:
□ Study the fundamental concepts of image representation and image processing system.
□ Evaluate techniques followed in image enhancements
□ Illustrate image segmentation and compression algorithms

Syllabus
Module – I
Introduction to Image Processing: Digital Image Fundamentals Light, brightness adaption and
discrimination, Human visual system, Image as a 2D data, Image representation Gray scale and Color
images, Image sampling and quantization, Color Fundamentals, Color Models, Pseudo-color image
processing. 08Hours

Module – II
Image Enhancement In The Spatial Domain: Some Basic Gray Level Transformations, Histogram
Processing, Enhancement Using Arithmetic/Logic Operations, Basics of Spatial Filtering, Smoothing
Spatial Filters, Sharpening Spatial Filters, Combining Spatial Enhancement Methods. 08Hours

Module – III
Image Enhancement in Frequency Domain: Introduction, Fourier Transform, Discrete Fourier
Transform (DFT), properties of DFT, Discrete Cosine Transform (DCT), Image filtering in frequency
domain
08Hours

Module – IV
Image Segmentation: Introduction, Detection of isolated points, line detection, Edge detection, Edge
linking, Region based segmentation- Region growing, split and merge technique, local processing,
regional processing, Hough transform, Segmentation using Threshold. 08Hours

Module – V
Image Compression: Introduction, coding Redundancy, Inter-pixel redundancy, image compression
model, Lossy and Lossless compression, Huffman Coding, Arithmetic Coding, LZW coding, Transform
Coding, Sub-image size selection, blocking, DCT implementation using FFT, run length coding
08Hours
 Course Outcomes:
On completion of this course, students will be able to:
□ Explain fundamentals of image processing
□ Compare transformation algorithms
□ Contrast enhancement, segmentation and compression techniques

Text Book:
1. Rafael C. Gonzalez and Richard E. Woods: ―Digital Image Processing, 3rdEdition, PearsonEducation,
Pearson Education, 2014, ISBN-10: 9332518467, ISBN-13: 9789332518469,

Reference Books:
1. S Jayaraman, S Esakkirajan, T Veerakumar: ―Digital Image Processing‖, Tata Mc- Graw
HillPublication.
2. S Sridhar: ―Digital Image Processing‖, Oxford University Press, ISBN-10: 0199459355, ISBN-
13:9780199459353.

E-Resources:
1. https://www.abebooks.com/9789332518469/Digital-Image-Processing-3rd-Edi-tion-9
2. www.synergy.ac.in/intranet/classnotes/introduction.pdf
 DATA SCIENCE THROUGH R PROGRAMMING

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CIT563 3:0:0:0 3 CIE 50: SEE 50 3Hrs PEC

Pre-Requisites: Nil
Course objectives:
The Student will:
1. Know about the fundamental concepts of DataScience.
2. Explore Data Analysis and the Data Science Process and LinearRegression.
3. Investigate the various methods of DataAnalysis.
4. Understand the Basics of REnvironment.
5. Develop the Data Science analysis using R programming andData Visualisation.

Syllabus

Module 1: Introduction to Data Science

What is Data Science? - Big Data VS Data Science, Datafication, Current landscape of perspectives and
Skill sets needed.
Statistical Inference, Populations and samples, Statistical modeling, probability distributions, fitting a
model.

Module 2: Exploratory Data Analysis and the Data Science Process. Unit 1:
Basic tools (plots, graphs and summary statistics) of EDA, Philosophy of EDA, The Data Science Process.
Unit 2:
Simple Linear Regression, Multiple Linear Regression, other Considerations in the Regression Model,
The Marketing Plan, Comparison of Linear Regression with K- Nearest Neighbours

Module 3: Classification
Unit 1:
An Overview of Classification, Why Not Linear Regression? Logistic Regression, Linear Discriminant
Analysis, A Comparison of Classification Methods.
Unit 2:
Cross- Validation and The Bootstrap.

Module 4: The R Environment:

Unit 1:
Command Line interface, R Studio, Installing R Packages. Basics of R: Basic math, variables, data types,
vectors, calling function, missing data, data frames, lists, matrices, arrays.
Unit 2:
Reading CSVs, Excel Data.
Base Graphs, ggplot2. Writing R functions, control statements – if and else, switch, compound tests, for
loops, while loops.

Module 5: Group manipulation and Data Reshaping Unit 1:

Apply Family, aggregate, plyr, data.table. Data Reshaping: cbind, rbind, joins, reshape2. Strings: paste,
sprint, extracting text, regular expressions.
Doing math and simulations in R: Math Functions: Calculating a Probability, cumulative sums and
products, minima and maxima, calculus, sorting, set operations. Unit 2:
Simulation Programming in R: Built-in-Random Variable generators, obtaining the same random stream
 in repeated runs, an example to a combinatorial simulation

Text Books:
1. Gareth James, Daniela Witten, Trevor Hatie, RoberstTibhirani , ―An Introductionto Statistical Learning-
with Applications in R―,
2. Jared P. Lander, R for Everyone, Addison Wesley Data & AnalyticsSeries, Pearson,2014.

Reference Books:
1. Cathy O‘Neil and Rachel Schutt. Doing Data Science, Straight Talk FromThe Frontline. O‘Reilly.2014.
2. Mark Gardener, ―Beginning R: The statistical programming language‖,2012.
3. Norman Matloff, The Art of R Programming, No Strach Press, San Francisco2011.

E-Links:
1. https://nptel.ac.in/courses/106/106/106106179/
2. https://towardsdatascience.com/
3. https://www.r-bloggers.com/

Course outcomes:
The Student will be able to:
1. Analyze the fundamental concepts of DataScience.
2. Evaluate the Data analysis and Data Science Process and LinearRegression.
3. Analyze the various methods of DataAnalysis.
4. Apply the Basics of R in itsEnvironment.
5. Evaluate the Data Science analysis using R programming and DataVisualisation.
 Sixth Semester

CLOUD COMPUTING (IC)

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CII61 3:0:2:0 4 CIE:50 SEE:50 3 Hours PCC

Course Objectives:
This course will enable students to
1. Identify the Cloud infrastructure components and service management processes
2. Explain the fundamentals of cloud computing
3. Gainthe knowledge about virtualization and its techniques.
4. Illustrate the cloud application programming and Aneka platform
5. Differentiate Various cloud platforms used in industry

Prerequisite: Computer Networks, Database Management System, Operating system

Syllabus

Module – I
Introduction: Cloud Computing at a Glance, The Vision of Cloud Computing, Defining a Cloud, A
Closer Look, Cloud Computing Reference Model, Characteristics and Benefits, Challenges Ahead,
Historical Developments, Distributed Systems, Virtualization, Web 2.0,Service-Oriented Computing,
Utility- Oriented Computing, Building Cloud Computing Environments, Application Development,
Infrastructure and System Development, Computing Platforms and Technologies, Google AppEngine,
Microsoft Azure, Hadoop, Force.com and Salesforce.com, Manjrasoft Aneka.Virtualization: Introduction,
Characteristics of Virtualized, Virtualization and Cloud Computing, Pros and Cons of Virtualization
08 Hours

Module – II
Cloud Computing Architecture: Introduction, Cloud Reference Model, Architecture, Infrastructure /
Hardware as a Service, Platform as a Service, Software as a Service, Types of Clouds, Public Clouds,
Private Clouds, Hybrid Clouds, Community Clouds, Economics of the Cloud, Open Challenges, Cloud
Definition, Cloud Interoperability and Standards Scalability and Fault Tolerance Security, Trust, and
Privacy Organizational Aspects.Aneka: Cloud Application Platform, Framework Overview, Anatomy of
the Aneka Container, From the Ground Up: Platform Abstraction Layer, Fabric Services, foundation
Services, Application Services, Building Aneka Clouds, Infrastructure Organization, LogicalOrganization,
Private Cloud Deployment Mode, Public Cloud Deployment Mode, Hybrid Cloud Deployment Mode,
Cloud Programming and Management, Aneka SDK, Management Tools.
08 Hours

Module – III
Concurrent Computing: Thread Programming, Introducing Parallelism for Single Machine
Computation, Programming Applications with Threads, What is a Thread?, Thread APIs, Multithreading
with Aneka, Introducing the Thread Programming Model, Aneka Thread vs. Common Threads.High-
Throughput Computing: Task Programming, Task Computing, characterizing a Task, Computing
Categories, Frameworks for Task Computing, Task-based Application Models,Embarrassingly Parallel
Applications, Parameter Sweep Applications, Workflow Applications with Task Dependencies.

08 Hours

Module – IV
Data Intensive Computing: Map-Reduce Programming, What is Data-Intensive Computing?
 Characterizing Data-Intensive Computations, Challenges Ahead, Historical Perspective, Technologies for
Data-Intensive Computing, Storage Systems, Programming Platforms.
08 Hours

Module – V
Cloud Platforms in Industry: Amazon Web Services, Compute Services, Storage Services,
Communication Services, Additional Services, Google AppEngine, Architecture and Core Concepts,
Application Life-Cycle, Cost Model, Observations, Microsoft Azure, Azure Core Concepts, SQLAzure,
Windows Azure Platform Appliance.Cloud Applications: Scientific Applications, Businessand Consumer
Applications, CRM and ERP, Productivity, Social Networking, Media Applications, Multiplayer Online
Gaming.
08 Hours

Laboratory
List of Experiments
1) Installation and Configuration of Justcloud.
2) Working in Cloud9 to demonstrate different language.
3) Working and installation of Google App Engine.
4) Working and installation of Microsoft AZURE.
5) Working with Mangrasoft Aneka Software.
6) Create an application (Ex: Word Count) using Hadoop Map/Reduce

Course Outcomes
On completion of this course, the students will be able to:
CO1: Explain cloud computing, classify services of cloud computing
CO2: Illustrate architecture and programming in cloud
CO3: Demonstrate data intensive computing.
CO4: Apply cloud computing services to commercial systems for deploying cloud
CO5: Analyzing different Cloud platform in industry and their applications

Text Books:
1) Rajkumar Buyya, Christian Vecchiola, and ThamaraiSelvi, ―Mastering Cloud Computing‖,McGraw
Hill Education, ISBN: 9780124095397

Reference Books:
1) Dan C. Marinescu, ―Cloud Computing Theory and Practice‖, Morgan Kaufmann, Elsevier 2013.
2) Thomas Erl: ―Cloud Computing‖, Pearson Education, 1st Edition, 2014, ISBN-13: 978-9332535923.

Reference Online Resources:

1) http://index-of.co.uk/Cloud-Computing-Books/Mastering%20Cloud%20Computing%20-
%20Rajkumar%20Buyya.pdf
2) http://nptel.ac.in/courses/106105033/41
3) http://video.mit.edu/watch/mitef-nyc-cloud-computing-8347/
 DEEP LEARNING

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CII62 3:0:2:0 4 CIE 50: SEE 50 3Hrs PCC

Pre-Requisites:
1. Probability Statistics, linear algebra. Machine learning .
Course Objectives:
The Student will:
1. Get introduced to various learning techniques of machine learning andunderstand differences between
machine learning and deeplearning
2. Understand and analyse optimization techniques and improvements inlearning methods
3. Appreciate, understand and apply neural networks as tools for complete learning problems
4. Investigate and deploy/club multi-layer neural networks for learning relatedto images, text and
speechsequences.
5. Appreciate, understand and implement Deep learning in real worldpractical problems
Module 1:
Introduction to Deep Learning
Introduction to Deep Learning, Brief History of Deep Learning, AI, Machine Learning and Deep
Learning, Statistical Learning,
Bayesian Learning, Decision Surfaces, Success stories of Deep Learning
Module 2:
Linear Classifiers
Linear Classifiers, Linear Machines with Hinge Loss, Optimization Techniques, Gradient Descent, Batch
Optimization,
Revisiting Gradient Descent, Momentum Optimizer, RMSProp, Adam.
Module 3:
Neural Network
Introduction to Neural Network, Multilayer Perceptron, Back Propagation Learning, Unsupervised
Learning with Deep Network, Autoencoders, Convolutional Neural Network, Building blocks of CNN,
Transfer Learning, LSTM Networks, NN in python
Module 4:
Deep Neural Net
Effective training in Deep Net- early stopping, Dropout, Batch Normalization, Instance Normalization,
Group Normalization,
Recent Trends in Deep Learning Architectures, Residual Network, Skip Connection Network, Fully
Connected CNN, CNN in Python
Module 5:
Practical areas of Deep Learning
Classical Supervised Tasks with Deep Learning, Image Denoising, Semantic
Segmentation, Object Detection, Generative Modelling with DeepLearning,
VariationalAutoencoder, Generative Adversarial Network, Object recognition with Python.
Text Books:
1. Deep Learning- Ian Goodfelllow, YoshuaBenjio, Aaron Courville, The MITPress
2. Pattern Classification- Richard O. Duda, Peter E. Hart, David G. Stork, John Wiley & SonsInc.
 Reference Books:
1. Deep Learning: A Practitioner's Approach by Josh Patterson & Adam Gibson, OReilly Press
2. Python Deep Learning: Exploring deep learning techniques and neural network architectures with
PyTorch, Keras, and TensorFlow, 2nd Edition by Ivan Vasilev, Pakt Publication.

E - Resources:
1. https://nptel.ac.in/courses/106/105/106105215/
2. https://www.slideshare.net/LuMa921/deep-learning-a-visual-introduction
3. https://yiqiaoyin.files.wordpress.com/2018/02/deep-learning-notes.pdf

Course Outcomes:
The student will be able to:
1. Identify tools of machine learning and deep learning, appropriate to anyproblems
2. Apply optimization techniques to improve the quality of various learningsolutions.
3. Apply and investigate, neural network for complete learningproblems.
4. Deploy deep learning methods in the area of multidimensional and sequentialinputs.
5. Investigate the scope of implementation of various deep learning techniques in any real world problem.
 INTERNET OF THINGS

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CIT63 3:0:0:0 3 CIE:50 SEE:50 3 hours PCC

Course Objectives:
This course is designed to:
1. Introduce the fundamental concepts of IoT and physical computing
2. Expose the student to a variety of embedded boards and IoT Platforms
3. Create a basic understanding of the communication protocols in IoT communications.
4. Familiarize the student with application program interfaces for IoT.
5. Enable students to create simple IoT applications

Module-I
Overview of IoT: The Internet of Things: An Overview, The Flavor of the Internet of Things, the
―Internet‖ of ―Things‖, The Technology of the Internet of Things, Enchanted Objects, who is Making the
Internet of Things? Design Principles for Connected Devices: Calm and Ambient Technology, Privacy,
Web Thinking for Connected Devices, Affordances. Prototyping: Sketching, Familiarity, Costs Vs Ease
of Prototyping, Prototypes and Production, Open source Vs Close source, Tapping into the community. 8
Hours
Module-II
Embedded Devices: Electronics, Embedded Computing Basics, Arduino, Raspberry Pi, Mobile phones
and tablets, Plug Computing: Always-on Internet of Things. 8 Hours

Module-III
Communication in the IoT: Internet Communications: An Overview, IP Addresses, MAC Addresses,
TCP and UDP Ports, Application Layer Protocols. Prototyping Online Components: Getting Started
with an API, Writing a New API, Real-Time Reactions, Other Protocols Protocol.
8 Hours
Module-IV
Business Models: A short history of business models, the business model canvas, who is the business
model for, Models, funding an Internet of Things startup, Lean Startups. Manufacturing: What are you
producing, designing kits, Designing printed circuit boards.
8 Hours
Module-V
Manufacturing continued: Manufacturing printed circuit boards, Mass-producing the case and other
fixtures, Certification, Costs, Scaling up software. Ethics: Characterizing the Internet of Things, Privacy,
Control, Environment, Solutions. 8 Hours

Course outcomes:
Upon completion of the course, the students should be able to:
1. Choose the sensors and actuators for an IoT application.
2. Select protocols for a specific IoT application.
3. Utilize the cloud platform and APIs for IoT applications.
4. Experiment with embedded boards for creating IoT prototypes.
5. Design a solution for a given IoT application.
 Text Book:
1. Adrian McEwen, Hakim Cassimally- Designing the Internet of Things, WileyPublications,2012

Reference Books:
1. ArshdeepBahga, Vijay Madisetti - Internet of Things: A Hands-On Approach, UniversitiesPress,2014.
2. The Internet of Things, Enabling technologies and use cases – PethuruRaj, Anupama C. Raman,CRCPress.

Reference sites:
1. https://www.arduino.cc/
2. https://www.raspberrypi.org/
 INFORMATION &NETWORK SECURITY
Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CIT64 3:0:0:0 3 CIE:50 SEE:50 3 hours PCC

Pre-Requisites: Computer Networks.

Course objectives:
The Student will:
1. Define about security goals, security attacks, security services and security mechanism.
2. Describe conventional encryption algorithms& public-key encryption algorithms, digital Signature and
issues of keyManagement
3. Explain authentication application & discuss how PGP and S/MIME can provide security services fore-
mail.
4. Discuss IP security, WebSecurity.
5. Discuss system level security issues include threats, Intruders, Intrusion detection system andfirewalls.

Module 1:
Introduction: Security Attacks (Interruption, Interception, Modification and Fabrication), Security
Services (Confidentiality, Authentication, Integrity, Non- repudiation, access Control and Availability) and
Mechanisms, A model for Internetwork security, Internet Standards andRFCs.
Understanding Attacks: Buffer overflow & format string vulnerabilities, TCP session hijacking, ARP
attacks, route table modification, UDP hijacking, and man-in-the-middle attacks.

Module 2:
Symmetric Encryption and Message Authentication: Conventional Encryption Principles, Conventional
encryption algorithms, cipher block modes of operation, location of encryption devices, key distribution.
Public-Key Cryptography and Message Authentication: Approaches of Message Authentication, Secure
Hash Functions and HMAC Public key cryptography principles, public key cryptography algorithms,
digital signatures, digital Certificates, Certificate Authority and key management.
 Module 3:
Authentication Applications: Kerberos, X.509 Directory Authentication Service. Electronic Mail
Security: Pretty Good Privacy (PGP) and Secure /Multipurpose Internet Mail Extension (S/MIME)
Module 4:
IP Security: IP Security Overview, IP Security Architecture, Authentication Header, Encapsulating
Security Payload, Combining Security Associations and KeyManagement. Web Security: Web Security
Requirements, Secure Socket Layer (SSL) and Transport Layer Security (TLS), Secure Electronic
Transaction(SET).
Module 5:
Network Management Security: Basic concepts of SNMP, SNMPv1 Community facility and SNMPv3.
System Security: Intruders, Viruses and related threats. Firewall Design principles, Trusted Systems.
Intrusion Detection Systems.
Text Books:
1. Network Security Essentials (Applications and Standards) by William Stallings PearsonEducation.
2. Hack Proofing your network by Ryan Russell, Dan Kaminsky, Rain ForestPuppy, Joe Grand, David
Ahmad, Hal Flynn Ido Dubrawsky, Steve W.Manzuik and Ryan Permeh, WileyDreamtech
Reference Books:
1. Network Security and Cryptography: Bernard Menezes, CENGAGELearning.
2. Network Security - Private Communication in a Public World by Charlie Kaufman, Radia Perlman and
Mike Speciner,Pearson/PHI.
3. Cryptography and network Security, Third edition, Stallings,PHI/Pearson.

E - Resources:
1. WilliamStallings.com/Crypto3e.html
2. WilliamStallings.com/StudentSupport.html

Course outcomes:
The Student will be able to:
1. Analyze the security goals, security attacks, security services and security mechanism,cryptography.
2. Compare how conventional encryption algorithms &public key cryptography can be used to ensure the
Identity of the sender of an encryptedmessage.
3. Identify authentication application & discuss how PGP and S/MIME can provide security services fore-
mail.
4. Identify IP security, Web security using Secure Socket Layer (SSL) and Transport Layer Security (TLS),
Secure Electronic Transaction(SET).
5. Apply system level security includes threats, Intruders, Intrusion detection System andFirewalls.
 RESEARCH METHODOLOGY

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CIP68 2:0:0:0 2 CIE:50 SEE:50 3 Hours PCC

Course objectives:
1. To give an overview of the research methodology and explain the technique of defining aresearch
problem
2. To explain the functions of the literature review in research.
3. To explain carrying out a literature search, its review, developing theoretical and conceptualframeworks
and writing are view.
4. To explain various research designs and their characteristics.
5. To explain the details of sampling designs, measurement and scaling techniques and alsodifferent
methods of data collections.
6. To explain several parametric tests of hypotheses and Chi-square test.
7. To explain the art of interpretation and the art of writing research reports.
8. To explain various forms of the intellectual property, its relevance and business impact in thechanging
global business environment.

To discuss leading International Instruments concerning Intellectual Property Rights

Module-1

Research Methodology: Introduction, Meaning of Research, Objectives of Research, Types of Research,

Research Approaches, Significance of Research, Research Methods versus Methodology, Research and
Scientific Method, Research Process, Criteria of Good Research, Problems Encountered by Researchers in
India.
Defining the Research Problem: Research Problem, Selecting the Problem, Necessity of Defining the
Problem, Technique Involved in Defining a Problem, An Illustration.

Module 2

Reviewing the literature: Place of the literature review in research, bringing clarity and focus to research
problem, improving research methodology, broadening knowledge base in research area, enabling
contextual findings, Review of the literature, searching the existing literature, reviewing the selected
literature, developing a theoretical framework, developing a conceptual framework, writing about the
literature reviewed.
Research Design: Meaning of Research Design, Need for Research Design, Features of a Good Design,
Important Concepts Relating to Research Design, Different Research Designs, Basic Principles of
Experimental Designs, Important Experimental Designs.

Module 3

Design of Sample Surveys: Design of Sampling: Introduction, Sample Design, Sampling and Non-
Sampling Errors, Sample Survey versus Census Survey, Types of Sampling Designs.
Measurement and Scaling: Qualitative and Quantitative Data, Classifications of Measurement Scales,
Goodness of Measurement Scales, Sources of Error in Measurement, Techniques of Developing
Measurement Tools, Scaling, Scale Classification Bases, Scaling Technics, Multidimensional Scaling,
Deciding the Scale.
Data Collection: Introduction, Experimental and Surveys, Collection of Primary Data, Collection of
Secondary Data, Selection of Appropriate Method for Data Collection, Case Study Method.
 Module 4

Testing of Hypotheses: Hypothesis, Basic Concepts Concerning Testing of Hypotheses, Testing of

Hypothesis, Test Statistics and Critical Region, Critical Value and Decision Rule, Procedure for
Hypothesis Testing, Hypothesis Testing for Mean, Proportion, Variance, for Difference of Two Mean, for
Difference of Two Proportions, for Difference of Two Variances, P-Value approach, Power of Test,
Limitations of the Tests of Hypothesis.
Chi-square Test: Test ofDifference of more than Two Proportions, Test of Independence of Attributes,
Test of
Goodness of Fit, Cautions in Using Chi Square Tests.

Module 5

Interpretation and Report Writing: Meaning of Interpretation, Technique of Interpretation, Precaution

in Interpretation, Significance of Report Writing, Different Steps in Writing Report, Layout of the
Research Report, Types of Reports, Oral Presentation, Mechanics of Writing a Research Report,
Precautions for Writing Research Reports.
Intellectual Property: The Concept, Intellectual Property System in India, Development of TRIPS
Complied Regime in India, Patents Act, 1970, Trade Mark Act, 1999,The Designs Act, 2000, The
Geographical Indications of Goods (Registration and Protection) Act1999, Copyright Act,1957,The
Protection of Plant Varieties and Farmers‘ Rights Act, 2001,The Semi-Conductor Integrated Circuits
Layout Design Act, 2000, Trade Secrets, Utility Models, IPR and Biodiversity, The Convention on
Biological Diversity (CBD) 1992, Competing Rationales for Protection of IPRs, Leading International
Instruments Concerning IPR, World Intellectual Property Organisation (WIPO),WIPO and WTO, Paris
Convention for the Protection of Industrial Property, National Treatment, Right of Priority, Common
Rules, Patents, Marks, Industrial Designs, Trade Names, Indications of Source, Unfair Competition,
Patent Cooperation Treaty (PCT), Advantages of PCT Filing, Berne Convention for the Protection of
Literary and Artistic Works, Basic Principles, Duration of Protection, Trade Related Aspects of
Intellectual Property Rights(TRIPS) Agreement, Covered under TRIPS Agreement, Features of the
Agreement, Protection of Intellectual Property under TRIPS, Copyright and Related Rights, Trademarks,
Geographical indications,IndustrialDesigns, Patents, Patentable Subject Matter, Rights Conferred,
Exceptions, Term of protection, Conditions on Patent Applicants, Process Patents, Other Use without
Authorization of the Right Holder, Layout-Designs of
Integrated Circuits, Protection of Undisclosed Information, Enforcement of Intellectual Property
Rights,UNSECO.

Textbooks
1 Research Methodology: C.R. New Age 4th
Methods andTechniques Koth International Editio
ari, n,
Gaur 2018
avGa
rg
2 ResearchMethodologyastep-by- Ranj SAGE 3rd
stepguideforbeginners. it PublicationsLt Editio
(For the top Kum d n, 201
ar
3 Study Material Professional Programme Intellectual
(For the topic Intellectual Property RightLaw and Practice, The
Property undmodule 5) Institute of Compa
Secretaries of India, Statutory Body Under
an Act Parliament, September 2013
Reference Books
1 Research Methods: the con Trochi Atomic Dog 2005
m Publishing
2 Conducting Research Fink A Sage 2009
Literatu Publications
Reviews: From the Internet
to Paper
 ANDROID APPLICATION DEVELOPMENT

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CIT651 3:0:0:0 4 CIE:50 SEE:50 3 Hours PEC

Course Objectives:
This course will enable students to:
 Outline the Android SDK features and the Development Framework and understanding Activities.
 Learn adaptive, responsive user interfaces that work across a wide range of devices.
 Identify background work and long-running tasks in Android applications
 Describe the concepts of Storing, sharing and retrieving data in Android applications
 Learn permissions, security and performance affect applications.

Prerequisite: Basic Knowledge of JAVA Programming and XML (Extension Markup Language)

Syllabus
Module- I
Basics of Android: What Is Android? Android Versions, Features of Android, Architecture of Android,
Android Devices in the Market, The Android Market, Obtaining the Required Tools, Eclipse, Android
SDK, Android Development Tools (ADT), Creating Android Virtual Devices (AVDs), Creating Your
First Android Application, Anatomy of an Android Application. Understanding Activities, Applying
Styles and Themes to Activity, Hiding the Activity Title, displaying a Dialog Window, displaying a
Progress Dialog, Linking Activities Using Intents, Resolving Intent Filter Collision, Returning Results
from an Intent. 08 Hours

Module- II
Components of Screen, Views and Layouts: Understanding the Components of a Screen, Views and
View Groups, Linear Layout, Absolute Layout, Table Layout, Relative Layout, Frame Layout, Scroll
View, Adapting to Display Orientation, Anchoring Views, Resizing and Repositioning, Managing
Changes to Screen Orientation, Persisting State Information during Changes in Configuration, Detecting
Orientation Changes, Controlling the Orientation of the Activity, Creating the User Interface
Programmatically, Basic Views. 08 Hours

Module- III
Image Views, Preferences ( ) and Storage: Using Image Views to Display Pictures - Gallery and Image
View Views, Image Switcher, Grid View, Using Menus with Views - Creating the Helper Methods,
Options Menu, Context Menu, Saving and Loading User Preferences - Using get Shared Preferences( ),
Using get Preferences( ), Persisting Data to Files - Saving to Internal Storage, Saving to External Storage
(SD Card), Choosing the Best Storage Option, Using Static Resources, Creating and Using Databases.
08 Hours
Module- IV
Content Provider, SMS Messaging Sharing Data in Android, using a Content Provider - Predefined
Query String Constants, Projections, Filtering, Sorting, Creating Your Own Content Providers - Using the
Content Provider. SMS Messaging - Sending SMS Messages Programmatically, Getting Feedback after
Sending the Message, Sending SMS Messages Using Intent, Receiving SMS Messages, updating an
Activity from a Broadcast Receiver, Invoking an Activity from a Broadcast Receiver. 08 Hours
Module- V
Services, Activities and Publishing APK Files. Creating Your Own Services - Performing Long-
Running Tasks in a Service, Performing Repeated Tasks in a Service, Executing Asynchronous Tasks on,
Separate Threads Using Intent Service, Communicating between a Service and an Activity, Binding
Activities to Services. Preparing for Publishing, Versioning, Digitally Signing Your Android
Applications, Deploying APK Files - Using the adb.exe Tool, using a Web Server, publishing on the
 Android Market, creating a Developer Profile, Submitting Your Apps. 08 Hours

Course Outcomes:
On completion of this course, students will be able to:
CO1: Comprehend the basic features of Android Platform and Create Activities in Android. CO2:
Demonstrate the design concepts of user interface using components and views in Android.CO3: Create
and use databases for Android Application.
CO4: Implement messaging services in Android.
CO5: Deploy mobile applications in various market place for distribution

Text Books:
1) Wei – Meng Lee: ―Beginning Android Application Development‖, Wiley publications, ISBN: 978-
1-118-01711-1, (Chapters 1-8,10,11).
2) Reto Meier: ―Professional Android 4 Application Development‖, Wiley publications Publisher,
2012,ISBN-10: 812653608X

Reference Books:
1) Mark Murphy: ―Beginning Android 3‖, Apress Springer India Pvt. Ltd., 1st Edition, 2011, ISBN-
13:978-1-4302-3297-1
2) Sayed Hashimi, Satya Komatineni, Dave MacLean; Pro Android 4; Apress Springer India Pvt Ltd;
1stEdition; 2012; ISBN: 978-1-4302-3930-7.
3) Reto Meier: ―Professional Android 2 Application Development‖, Wiley India Pvt. Ltd., 1st
Edition,2012, ISBN: 9788126525898.
4) James Steele: ―The Android Developer‘s Cookbook: Building Applications with the Android
SDK‖,Addison-Wesley Professional, 2010.

E-Resources:
1) https://developers.google.com/training/adf
2) https://goo.gl/ADKvq8
3) https://innovator.samsungmobile.com
 INFORMATION RETRIEVAL SYSTEM

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CIT652 3:0:0:0 3 CIE:50 SEE:50 3 hours PEC

Course Objectives:
This course is designed to:
 Learn to write code for text indexing and retrieval.
 Learn to evaluate information retrieval systems
 Learn to analyze textual and semi-structured data sets
 Learn to evaluate information retrieval systems
 Learn about text similarity measure
 Understanding about search engine
Prerequisite:
 Probabilistic models, statistical language models, Text classification & Textclustering
Module-I
Overview of text retrieval systems: Boolean retrieval, the term vocabulary and postings lists,
Dictionaries and tolerant retrieval, Index construction and compression. Retrieval models and
implementation: Vector Space Models, Vector Space Model, TF-IDF Weight, Evaluation in information
retrieval.
Module 2
Query expansion and feedback: Relevance feedback, pseudo relevance feedback, Query
Reformulation
Module 3
Probabilistic models; statistical language models: Okapi/BM25, Language models, KL-
divergence, Smoothing
Module 4
Text classification & Text clustering: The text classification problem, Naive Bayes text classification, k-
nearest neighbors, Support vector Machine, Feature Selection, Vector-space clustering, K-means
algorithm, Hierarchical clustering, DBSCAN algorithm, PAM and PAMK
EM algorithm
Module 5
Web search basics, crawling, indexes, Link analysis: Web Characteristic, Crawling, Web as a graph,
Page Rank, Hubs and Authorities, IR applications: Information extraction, Question answering, Opinion
summarization, Social Network

Course outcomes:
Upon completion of the course, the students should be able to:

□ To Understand Document as Vector

□ Performance evolution metric for IR
□ To understand search Engine functionality
□ Various Supervised and Unsupervised Learning Method

Text Book:
 Christopher D. Manning, Prabhakar Raghavan and Hinrich Schütze, Introduction to Information Retrieval,
Cambridge University Press. 2008. http://nlp.stanford.edu/IR- book/information-retrieval-book.html
 ChengXiang Zhai, Statistical Language Models for Information Retrieval (Synthesis Lectures Series on
Human Language Technologies), Morgan & Claypool Publishers, 2008.
 DEVOPS

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CIT653 3:0:0:0 3 CIE:50 SEE:50 3 Hours PEC

Course objectives:
This course will enable students to:
 Understand the DevOps Concepts and DevOps Tool.
 Expose to the evolving Applications and advance features of Jenkins and Docker.
 Get Familiarize with Docker and Chef workstations.
 Understand the importance of testing using Jenkins, AWS EC2.
 Identify and understand security in Jenkins and monitor the azure Applications.

Syllabus

Module – I
Introduction to DevOps Concepts: Understanding DevOps movement, DevOps with changing times,
The waterfall model, Agile Model, Why DevOps? DevOps lifecycle, Benefits of DevOps.
08Hours
Module – II
Continuous Integration with Jenkins 2: Introduction, Installing Jenkins, Jenkins dashboard,
Configuration Java, Maven/Ant in Jenkins, Creating and Configuring build job for Java application with
Maven, Managing Nodes, Email notifications based on build status.
08 Hours
Module – III
Containers: Overview of Docker containers, Understanding the difference between virtual machines and
containers, Installing and configuring Docker, Creating a Tomcat container. Cloud Computing and
Configuration Management: An overview of the Chef configuration management tool, Installing and
configuring a Chef workstation, Installing knife plugins for Amazon Web Services and Microsoft Azure.
08 Hours
Module – IV
Automated Testing (Functional and Load Testing): Functional testing using Selenium, Functional test
execution in Jenkins, Load test execution using Jenkins. Orchestration - End-to-End Automation: End-
to-end automation of application life cycle management using Jenkins, End-to-end automation using
Jenkins, Chef, and AWS EC2, End-to-end automation using Jenkins and AWS Elastic Beanstalk, End-to
end automation using Jenkins and Microsoft Azure app services, End-to-end automation orchestration of
application life cycle Management using VSTS.
08 Hours
Module – V
Security and Monitoring: Security in Jenkins and VSTS, Security in Jenkins and VSTS, Monitoring
Jenkins and Microsoft Azure, Monitoring Jenkins, Azure Web Apps troubleshooting and monitoring,
Azure App Services - CPU and memory consumption, Azure App Services - Activity log, Azure
Application Insights for application monitoring, Azure web application monitoring, Diagnostics logs. 08
Hours

Laboratory Component:
1) Download and install Jenkins CI on GCP.
2) Configuration. Change language interface and Create the first Jenkins job
3) Build Triggers, corn syntax, Artifacts.
4) Create and run Jenkins pipeline.
5) Create parameterized jobs in Jenkins.
6) Install and configure Docker.
 Course outcomes:
On completion of this course, the students are able to:
CO1: Understand the fundamentals of DevOps engineering and be fully proficient with Dev Ops
terminologies, concepts, benefits, and deployment options to meet your business requirements
CO2: Build jobs and configurations in Jenkins and Master in docker , Continuous Delivery and chef
Configuration Management.
CO3: Create tomcat container and work on Dockers and chef workstation.
CO4: Analyze, design and evaluate automation scripts & systems.
CO5: Use Azure application services and monitor the security issues in Jenkins and Microsoft Azure.

Text Books:
 Mitesh Soni: DevOps for Web Development,Packet
Publishing,ISBN:9781786465702,Released October 2016
 Mitesh Soni: DevOps Bootcamp-A fast-paced guide to implement DevOps with ease,
May2017(Chapters: 3,4,6,7,8),ISBN 978-1-78728-596-5.

Reference Books
 Len Bass, Ingo Weber, Liming Zhu, Devops Software Architect's perspective, firstedition,ISBN 978-0-
13-404984-7,2015 Pearson Education, Inc.
 Trevor Roberts, Jr.,Josh Atwell, Egle Sigler, Yvo van Doorn, Devops for VMware Administrator, First
Printing: April 2015, ISBN-10: 0-13-384647-4, ISBN-13: 978-0-13- 384647-8,Pearson Education, Inc.
 Sanjeev Sharma "The DevOps Adoption Playbook: A Guide to Adopting DevOps in a Multi- Speed IT
Enterprise"Published by John Wiley & Sons, Inc. ISBN: 978-1-119-30874-4, ISBN:978-1-119-31052-5
(eBook) ,ISBN: 978-1-119-31076-1 (eBook)

E-Recourses
 https://resources.collab.net/devops-101/what-is-devops.
 https://www.ibm.com/cloud/learn/devops-a-complete-guide.
 https://newrelic.com/devops/what-is-devops
 https://www.oreilly.com/library/view/devops-for-web/9781786465702/
 NATURAL LANGUAGE PROCESING
Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CIT661 3:0:0:0 3 CIE 50: SEE 50 3Hrs PEC

Module – 1
Overview and language modeling: Overview: Origins and challenges of NLP-LanguageandGrammar-
ProcessingIndianLanguages-NLPApplications-
InformationRetrieval.LanguageModeling:VariousGrammar-basedLanguageModels-
StatisticalLanguageModel.

Module -2
Word level and syntactic analysis: Word Level Analysis: Regular Expressions-Finite-State Automata-
Morphological Parsing-Spelling Error Detection and correction-Words andWordclasses-Part-
ofSpeechTagging.SyntacticAnalysis:Context-freeGrammar-Constituency-Parsing-Probabilistic Parsing.

Module -3
Extracting Relations from Text: From Word Sequences to Dependency
Paths:Introduction,SubsequenceKernelsforRelationExtraction,ADependency-
PathKernelforRelationExtraction and ExperimentalEvaluation.
MiningDiagnosticTextReportsbyLearningtoAnnotateKnowledgeRoles:Introduction, Domain
Knowledge and Knowledge Roles, Frame Semantics and SemanticRoleLabeling,
LearningtoAnnotateCases withKnowledgeRoles andEvaluations.
ACaseStudyinNaturalLanguageBasedWebSearch:InFactSystemOverview,TheGlobalSecurity.orgExpe
rience.

Module -4
Evaluating Self-Explanations in iSTART: Word Matching, Latent Semantic Analysis,and Topic
Models: Introduction, iSTART: Feedback Systems, iSTART: Evaluation ofFeedbackSystems,
TextualSignatures:IdentifyingText-
TypesUsingLatentSemanticAnalysistoMeasuretheCohesionofTextStructures:Introduction,Cohesion,C
oh-Metrix,ApproachestoAnalyzingTexts,LatentSemanticAnalysis,Predictions,ResultsofExperiments.
Automatic Document Separation: A Combination of Probabilistic Classification andFinite-
StateSequenceModeling:Introduction,RelatedWork,DataPreparation,Document Separationas aSequence
MappingProblem, Results.
EvolvingExplanatoryNovelPatternsforSemantically-
BasedTextMining:RelatedWork,ASemanticallyGuided Modelfor EffectiveTextMining.

Module -5
INFORMATIONRETRIEVALANDLEXICALRESOURCES:InformationRetrieval:
DesignfeaturesofInformationRetrievalSystems-Classical,Nonclassical,AlternativeModels of Information
Retrieval – valuation Lexical Resources: World Net-Frame Net-Stemmers-POSTagger-Research Corpora.

Text Book
1. TanveerSiddiqui,U.S.Tiwary,―NaturalLanguageProcessingandInformationRetrieval‖,OxfordUniversityPre ss,
2008.
2. AnneKaoandStephenR.Poteet(Eds),―NaturalLanguageProcessingandTextMining‖,Springer-VerlagLondon
Limited 2007.
Reference
1. Daniel Jurafsky andJamesH Martin, ―Speechand LanguageProcessing:Anintroduction toNatural Language
Processing, Computational Linguistics and SpeechRecognition‖, 2nd Edition,PrenticeHall, 2008.
2. James Allen, ―Natural Language Understanding‖, 2nd edition, Benjamin/Cummingspublishingcompany,
1995.
3. Gerald J. Kowalski and Mark.T. Maybury, ―Information Storage and Retrieval systems‖,
KluweracademicPublishers, 2000.
 BLOCK CHAIN TECHNOLOGY

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CIT662 3:0:0:0 3 CIE:50 SEE:50 3hrs PEC

Prerequisite: Network Security and Information Security

Course Objectives:
□ Understand about Symmetric and Asymmetric Encryption, block chain and Bit coin concepts
□ Analyze the Working of Block Chain System.
□ Design, build, and deploy smart contracts and distributed applications
□ Evaluate security, privacy, and efficiency of a given block chain system.
□ Cognize about ‗digital‘ currency, Storage and Currency Exchange Services.
Syllabus
Module – I
Introduction to Block chain: Back story of Block chain, what is Block chain? Centralized vs.
Decentralized Systems, Layers of Block chain, why is Block Chain Important? Limitations of Centralized
Systems, Block chain Adoption So Far, Block chain Uses and Use Cases How Block chain Works-1:
Laying the Block Chain Foundation, Cryptography, Symmetric Key Cryptography, Cryptographic Hash
Functions. 08 Hours
Module – II
Cryptography and Transactions: Asymmetric Key Cryptography, Diffie-Hellman Key Exchange,
Symmetric vs. Asymmetric Key Cryptography, Merkle Trees, Putting It All Together, Properties of Block
Chain Solutions, Block chain Transactions, Distributed Consensus Mechanisms, Block chain
Applications, Scaling Block chain, Off-Chain Computation, Sharding Block Chain State. 08 Hours
Module-III
Bitcoin Works: The History of Money, Dawn of Bitcoin, What Is Bitcoin? Working with Bitcoins, The
Bitcoin Blockchain, Block Structure, The Genesis Block, The Bitcoin Network, Network Discovery for a
New Node, Bitcoin Transactions, Consensus and Block Mining, Block Propagation, Bitcoin Scripts,
Bitcoin Transactions Revisited, Scripts. 08 Hours

Module – IV
Ethereum and Crypto Currencies: Ethereum Introduction, Ethereum Blockchain, Elements of Ethereum
Blockchain and Smart Contracts, The Turing Completeness of Smart Contract Languages and verification
challenges, Cryptographic Hash Functions, Hash Pointers and Data Structures, Digital Signatures, Public
Keys as Identities, A Simple Crypto currency. 08 Hours

Module – V
How to Store and Use Bitcoins: Simple Local Storage, Hot and Cold Storage, Splitting and Sharing
Keys, Online Wallets and Exchanges, Payment Services, Transaction Fees, Currency Exchange Markets.
08 Hours

Course Outcomes
After the completion of this course, student will be able to
□ Gain Knowledge in Symmetric Encryption, Asymmetric Encryption, Block Chain System andCrypto
currencies.
□ Analyze the working of Block Chain System, Ledger Transaction and Mining mechanism.
□ Design and Implement Ethereum block chain contract.
□ Pertain to ethical and legal usage of Block chain applications.
□ Use of Bitcoins, online wallets, Currency Exchanges and payment services.
 Text Books:

1. Beginning Block chain: A Beginner‘s Guide to Building Block Chain Solutions by Bikramaditya Singhal,
Gautam Dhameja and Priyansu Sekhar Panda

2. Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller and Steven Goldfeder, Bit coin and
Crypto-currency Technologies: A Comprehensive Introduction, Princeton University Press (July 19,
2016).

Reference Books:
1. Mastering Bit coin by Andreas M. Antonopoulos
2. Block chain Technology: Crypto-currency and Applications by S. Shukla, M. Dhawan, S.Sharma, S.
Venkatesan, Oxford University Press 2019.
3. Imran Bashir, Mastering Blockchain: Deeper Insights into Decentralization, Cryptography,Bitcoin,
and Popular Blockchain Frameworks, Packt Publishing, 1st Edition, 2017.

E-Resources:
1. NPTEL online course: https://nptel.ac.in/courses/106/104/106104220/#
2. Udemy: https://www.udemy.com/course/build-your-blockchain-az/
3. EDUXLABS Online training: https://eduxlabs.com/courses/blockchain technology-
training/?tab=tab-curriculum
 FULL STACK DEVELOPMENT

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CIT663 3:0:0:0 3 CIE:50 SEE:50 3 Hours PEC

Course Objectives:
This course will enable students to,
• Use HTML, CSS and Javascript in web pagedesign.
• Access the DOM objects, filters, forms inJavascriptsquery.
• WriteprogramsusingHooks, components and Events in ReactJS.
• Create basic web applications with Node.js, Express JS.
• Understand with the database connectivity and reactive forms usingJavaScript‘s

Syllabus
Module – I
Javascript: Basics: Variables, Operator , DOM, Arrays, Functions, Arrow Functions, Classes, Objects,
Event Handling, Map,Babbel JS, React Introduction, React Installation.
Simple React programs and CSS styling. 08 Hours

Module – II
React JS: Functional Component, Class Component, Event Based Component, Props, States, Setstate,
Event Handling, Binding Event Handler , Life Cycle Methods, Lists&Keys,Forms and user inputs,
Rendering:Conditional Rendering, List Rendering.08Hours

Module – III
Hooks:useState, useMenu, useEffect,Axios Package,useRef,useContext,
useReducer,useCallbackuseInput,React Router,APIs, Practical React: icons, video player, credit card,
model, chart, count up.08Hours

Module – IV
Introduction to Node.js: What is Node.js?, Features of Node.js, Setup Development Environment-
Installing,Node.js, Working with REPL, Node.js Console, Node.js Module, Node Package Manager,
Node.jsBasics,FileSystem,HTTPandHTTPs,CreatingWebServer-Handlinghttprequest,Node.js
Callbacks,Node.jsEvents.08Hours

Module – V
Database Connectivity and Reactive Forms: Promises, Express.js, Database Connectivity – Connecting
to RDBMS and NoSQL database, Performing CRUD operations, What is Reactive Forms, Syncing of
HTML and Form, Form Control Arrays, Relative Forms, Value changes and Reacting to status, Create
Reactive form through code, Adding Validation, Adding Validation, Grouping, Custom Validators.
08Hours
Course Outcomes:
On completion of this course, the students will be able to,
• Develop programs in HTML, JavaScript.
• Design programs using ReactJS components.
• Test and deploy web pages using React Hooks .
• Develop programs in Node JS, Express JS.
• Design programs using React JS with databaseconnectivity.
 Text Book:
1. Brad Dayley, ―Node.js, MongoDB, and AngularJS Web Development, 2018, ISBN- 13: 9789352865505.

Reference Book:
1. Adam Freeman, ―Pro Angular JS‖, Apress Publications, 2nd Edition, 2017, ISBN-13: 9781484223062.
2.Learning React Functional Web Development with React and Redux
By Alex Banks, Eve Porcello · 2017

E-Resources:
1. https://reactjs.org/docs/getting-started.html
2. https://www.mongodb.com/resources
3.https://youtube.com/playlist?list=PLC3y8-rFHvwgg3vaYJgHGnModB54rxOk3

.
 SEVENTH SEMESTER

BIG DATA ANALYTICS

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CII71 3:0:2:0 4 CIE: 50 SEE: 50 3 hours PCC

Course Objectives:
This course will enable students to
 Understand Big – Data, Hadoop Distributed File system and Map Reduce.
 Explore Hadoop tools and manage Hadoop Administration.
 Appraise the role of Business intelligence and its applications across industries.
 Assess core data mining techniques for data analytics.
 Learn various Text Mining techniques.

Prerequisite:
Good knowledge skill on Database and Data Structures

Syllabus

Module – I
Introduction to Big Data: Big Data and its importance, Four Vs, Big data applications. Introduction to
Hadoop: Hadoop Distributed File System Basics, Hadoop components, Hadoop Eco-System, Hadoop
Map Reduce Framework.
08 Hours

Module – II
Essential Hadoop Tools – Yarn, Hive, Oozie, Pig, Flume, Hadoop YARN Applications, Managing
Hadoop with Apache Ambari, Basic Hadoop Administration Procedures.
08 Hours

Module – III
Business Intelligence Concepts and Application – BI – Tools, Skills, Applications, Data Warehousing
– Approaches and Architecture, Data Mining – CRISP – DM, Techniques, Tools, Myths, Mistakes,
Data Visualization – Types of charts.
08 Hours

Module – IV
Decision Trees- Pseudo code, Regression – Logistic, Advantages and Disadvantages, Artificial Neural
Networks – Design principles, steps in developing ANN, Advantages and Disadvantages, Cluster
Analysis - K-means algorithm, Association Rule Mining - Apriori algorithm.
08 Hours

Module – V
Text Mining – Architecture, TDM, Applications, Naïve-Bayes Analysis - Model, Advantages and
Disadvantages, Support Vector Machines - Model, Advantages and Disadvantages, Web Mining –
Content, Structure, Usage, Social Network Analysis - Techniques and Algorithm, Page Rank, Practical
Considerations.
08 Hours
 Course Outcomes
On completion of this course, the students are able to:
CO1: Master the concepts of Big Data, HDFS and Map Reduce framework
CO2: Investigate Hadoop related tools for Big Data Analytics and perform basic Hadoop
Administration
CO3: Recognize the role of Business Intelligence, Data warehousing and Visualization in decision
making
CO4: Demonstrate the importance of core data mining techniques for data analytics
CO5: Illustrate and analyze Text Mining Techniques

Text Books:
1) Douglas Eadline,"Hadoop 2 Quick-Start Guide: Learn the Essentials of Big Data Computing in
the Apache Hadoop 2 Ecosystem", 1stEdition, Pearson Education, 2016. ISBN-13: 978-
9332570351
2) Anil Maheshwari, ―Data Analytics‖, 1st Edition, McGraw Hill Education, 2017. ISBN-13: 978-
9352604180

Reference Books:
1) Tom White, ―Hadoop: The Definitive Guide‖,4 Edition, O‗Reilly Media,
2) Boris Lublin sky, Kevin T. Smith, Alexey Yakubovich, ―Professional Hadoop Solutions",1st
Edition, Wrox Press, 2014ISBN-13: 978-8126551071
3) Eric Sammer, ―Hadoop Operations: A Guide for Developers and Administrators",1st Edition,
O'Reilly Media, 2012.ISBN-13: 978-9350239261

E-Resources:
1) https://www.tutorialspoint.com/big_data_tutorials.htm
2) https://nptel.ac.in/courses/106/104/10610418
 AI AND ROBOTICS
Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CII72 3:0:2:0 4 CIE: 50 SEE: 50 3 hours PCC

Course Objectives:
To study the Robot Locomotion and types of robots.
2. To explore the kinematic models and constraints
3. To Learn sensors of robots and image processing for robotics.
4. To understand the methods for mobile robot Localization
5. To study the Path planning and Navigation of Robots.

Syllabus
UNIT I ROBOT LOCOMOTION 9 Introduction to AI and Robotics – robot locomotion – legged mobile robots –
wheeled mobile robots – aerial mobile robots.
UNIT II MOBILE ROBOT KINEMATICS 9 Kinematic models and constraints – mobile robot maneuverability –
mobile robot workspace – advanced kinematics – motion control.
UNIT III ROBOT PERCEPTION 9 Sensors for mobile robots – computer vision for robots – image processing for
robotics – place recognition – range data.
UNIT IV MOBILE ROBOT LOCALIZATION 9 Introduction to localization – noise and aliasing – localization-
based navigation – belief representation – map representation – probabilistic map-based localization – autonomous
map building.
UNIT V ROBOT PLANNING AND NAVIGATION 9 Planning and navigation – planning and reacting – path
planning – obstacle avoidance – navigation architectures.
Lab syllabus
Implement the following Data structures in Java
1. Linked Lists
a. Stacks
b. Queues
c. Set
d. Map
e. Perform setting up and Installing Hadoop in its three operating modes: Standalone,
Pseudodistributed, Fully distributed.
2. Implement the following file management tasks in Hadoop:
a. Adding files and directories
b. Retrieving files
 c. Deleting files Hint: A typical Hadoop workflow creates data files (such as log files) elsewhere and
copies them into HDFS using one of the above command line utilities.
3. Run a basic Word Count Map Reduce program to understand Map Reduce Paradigm.
4. Write a Map Reduce program that mines weather data. Weather sensors collecting data everyhour at many
locations across the globe gather a large volume of log data, which is a goodcandidate for analysis with
MapReduce, since it is semi structured and record-oriented.
5. Implement Matrix Multiplication with Hadoop Map Reduce
6. Install and Run Pig then write Pig Latin scripts to sort, group, join, project, and filter your data.
7. Install and Run Hive then use Hive to create, alter, and drop databases, tables, views, functions, and indexes.
8. Solve some real life big data problems.
Course Outcomes:
After the completion of this course, students will be able to:
1: Explain the types of Robots
2: Narrate the kinematics of Robots
3: Implement image processing algorithms
4: Devise Localization algorithms
5: Devise Path planning methods for navigation
LIST OF EXPERIMENTS:
1. Line tracing bot
2. Gesture controlled bot
3. 4(Four) DOF Robotic Arm
4. Home Security System using NodeMCU
5. RF Controlled or WiFi controlled Navigation bot
6. Pick and place bot with Object Detetction 7. Wall Following bot
8. Maze solving Robot
9. Forward and reverse kinematics based experiment using open source platforms
10. Computer Vision based robotic tasks execution
TEXT BOOKS:
1. R. Siegwart, I. R. Nourbaksh, and D. Scarramuzza, ―Introduction to Autonomous Mobile Robots‖, Second
Edition, MIT Press, 2011.
2. Stuart Russel and Peter Norvig, ―Artificial Intelligence: A Modern Approach‖, Fourth Edition, Pearson
Education,
 ETHICAL HACKING

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CIT731 3:0:0:0 3 CIE: 50 SEE: 50 3 hours PEC

Pre-Requisites: Nil
Course objectives:
The Student will:
1. Recognize cybercrimes and how they areplanned
2. Identify the vulnerabilities of mobile and wirelessdevices
3. Examine the crimes in mobile and wireless devices andActs.
4. Understand about ComputerForensics
5. Explored to Cyber Security- OrganizationalImplications

Module 1:
Introduction to Cyber Security: Basic Cyber Security Concepts, layers of security,
Vulnerability, threat, Harmful acts, Internet Governance – Challenges and Constraints,
Computer Criminals, CIA Triad, Assets and Threat, motive of attackers, active attacks, passive
attacks, Software attacks, hardware attacks, Spectrum of attacks, Taxonomy of various attacks,
IP spoofing, Methods of defense, Security Models, risk management, Cyber Threats-Cyber
Warfare, Cyber Crime, Cyber terrorism, Cyber Espionage, etc., Comprehensive Cyber Security
Policy.
Module 2
Cyberspace and the Law & Cyber Forensics: Introduction, Cyber Security Regulations,
Roles of International Law. The INDIAN Cyberspace, National Cyber SecurityPolicy.
Introduction, Historical background of Cyber forensics, Digital Forensics Science, The Need
for Computer Forensics, Cyber Forensics and Digital evidence, Forensics Analysis of Email,
Digital Forensics Lifecycle, Forensics Investigation, Challenges in Computer Forensics,
Special Techniques for Forensics Auditing.
Module 3:
Cybercrime: Mobile and Wireless Devices: Introduction, Proliferation of Mobile and
Wireless Devices, Trends in Mobility, Credit card Frauds in Mobile and Wireless Computing
Era, Security Challenges Posed by Mobile Devices, Registry Settings for Mobile Devices,
Authentication service Security, Attacks on Mobile/Cell Phones, Mobile Devices: Security
Implications for Organizations, Organizational Measures for
 Handling Mobile, Organizational Security Policies and Measures in Mobile Computing Era,
Laptops.
Module 4:
Cyber Security: Organizational Implications: Introduction cost of cybercrimes and IPR
issues, web threats for organizations, security and privacy implications, social media
marketing: security risks and perils for organizations, social computing and the associated
challenges for organizations.
Cybercrime and Cyber terrorism: Introduction, intellectual property in the cyberspace, the
ethical dimension of cybercrimes the psychology, mindset and skills of hackers and other
cyber criminals.
Module 5:
Privacy Issues: Basic Data Privacy Concepts: Fundamental Concepts, Data Privacy Attacks,
Data linking and profiling, privacy policies and their specifications, privacy policy languages,
privacy in different domains- medical, financial, etc.
Cybercrime: Examples and Mini-Cases
Examples: Official Website of Maharashtra Government Hacked, Indian Banks Lose Millions
of Rupees, Parliament Attack, Pune City Police Bust Nigerian Racket, e-mail spoofing
instances.
Mini-Cases: The Indian Case of online Gambling, An Indian Case of Intellectual Property
Crime, Financial Frauds in Cyber Domain.
Text books:
1. Nina Godbole and SunitBelpure, Cyber Security Understanding Cyber Crimes, Computer
Forensics and Legal Perspectives,Wiley
2. B. B. Gupta, D. P. Agrawal, Haoxiang Wang, Computer and Cyber Security: Principles,
Algorithm, Applications, and Perspectives, CRC Press, ISBN 9780815371335, 2018.
Reference Books:
1. Cyber Security Essentials, James Graham, Richard Howard and Ryan Otson, CRC Press.
2. Introduction to Cyber Security, Chwan-Hwa(john) Wu,J. David Irwin, CRC Press T&FGroup.
E-Resources:
1. https://lecturenotes.in/subject/611/cyber-security.
2. https://www.slideshare.net/AvaniPatel61/ppt-on-cyber-security.
3. https://onlinecourses.swayam2.ac.in/ugc19_hs25/preview
Course outcomes:
The Student will be able to:
1. Demonstrate cybercrimes and how they areplanned
2. Develop a framework to secure Mobile and wirelessdevices
3. Interpret crimes and Acts related to mobile and wireless devices
4. Memorize Computer Forensics and its relatedmatters
5. Identify Cyber Security-Organizational Implications
 GREEN COMPUTING

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CIT732 3:0:0:0 3 CIE: 50 SEE: 50 3 hours PEC

OBJECTIVES:
• To learn the fundamentals of Green Computing.
• To analyze the Green computing Grid Framework.
• To understand the issues related with Green compliance.
• To study and develop various case studies.

UNIT
FUNDAMENTALS
I
Green IT Fundamentals: Business, IT, and the Environment – Green computing: carbon foot print, scoop on
power – Green IT Strategies: Drivers, Dimensions, and Goals – Environmentally Responsible Business:
Policies, Practices, and Metrics.

UNIT
GREEN ASSETS AND MODELING
II
Green Assets: Buildings, Data Centers, Networks, and Devices – Green Business Process Management:
Modeling, Optimization, and Collaboration – Green Enterprise Architecture – Environmental Intelligence –
Green Supply Chains – Green Information Systems: Design and Development Models.

UNIT
GRID FRAMEWORK
III
Virtualization of IT systems – Role of electric utilities, Telecommuting, teleconferencing and teleporting –
Materials recycling – Best ways for Green PC – Green Data center – Green Grid framework.

UNIT
GREEN COMPLIANCE
IV
Socio-cultural aspects of Green IT – Green Enterprise Transformation Roadmap – Green Compliance:
Protocols, Standards, and Audits – Emergent Carbon Issues: Technologies and Future.

UNIT
CASE STUDIES
V
The Environmentally Responsible Business Strategies (ERBS) – Case Study Scenarios for Trial Runs – Case
Studies – Applying Green IT Strategies and Applications to a Home, Hospital, Packaging Industry and Telecom
Sector.
OUTCOMES:Upon completion of the course, the students will be able to:
• Acquire knowledge to adopt green computing practices to minimize negative impacts on the environment.
• Enhance the skill in energy saving practices in their use of hardware.
• Evaluate technology tools that can reduce paper waste and carbon footprint by the stakeholders.
•Understand the ways to minimize equipment disposal requirements .

TEXT BOOKS:
1. Bhuvan Unhelkar, ―Green IT Strategies and Applications-Using Environmental Intelligence‖, CRC Press,
June 2014.
2. Woody Leonhard, Katherine Murray, ―Green Home computing for dummies‖, August 2012.

REFERENCES
1. Alin Gales, Michael Schaefer, Mike Ebbers, ―Green Data Center: steps for the Journey‖, Shroff/IBM
rebook, 2011.
2. John Lamb, ―The Greening of IT‖, Pearson Education, 2009.
3. Jason Harris, ―Green Computing and Green IT- Best Practices on regulations & industry‖, Lulu.com, 2008
4. Carl speshocky, ―Empowering Green Initiatives with IT‖, John Wiley & Sons, 2010.
5. Wu Chun Feng (editor), ―Green computing: Large Scale energy efficiency‖,
 QUANTUM COMPUTING

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CIT733 3:0:0:0 3 CIE: 50 SEE: 50 3 hours PEC

Pre-Requisites:
1. Knowledge on ―MachineLearning‖.
2. Knowledge on ―Probability andStatistics‖.

Course objectives:
The Student will:
1. Interpret the fundamentals of quantum computing.
2. Know the how quantum Mechanics is applied in quantumcomputing.
3. Illustrate the Quantum information with architecture andalgorithms.
4. Develop the quantum programminglanguages.
5. Explain the current status of quantumcomputing.

Module 1:
Introduction to Basic quantum Mathematics
Complex numbers and its geometrical representations, Complex vector spaces, inner products and
Hilbert spaces, Hermitian and unitary matrices, Tensor products of vector spaces.

Module 2:
Basic Quantum Mechanics
Deterministic Systems, Probabilistic descriptions and Quantum systems, Basics of Quantum theory,
Schrodinger‘s time dependent equation, Wave nature of Particles, state vector, operators, postulates of
quantum mechanics, Dirac formalism, Stern-Gerlach experiment, electron spin, superposition of states,
entanglement.

Module 3:
Quantum Information
Bits and Qubits, Classical gates versus quantum gates, Deutsch‘s Algorithm, Deutsch- Jozsa
Algorithm, Simon‘s periodicity algorithm, Grover‘s search algorithm, Shor‘s Factoring algorithm.
 Module 4:
Quantum Programming
Quantum programming languages, Probabilistic and Quantum computations, introduction to quantum
cryptography and quantum information theory.

Module 5:
Current Status of Quantum Computing
Multi Qubit Systems, why are qubits superior, Quantum computing and Security, Sycamore
processors, IBM Quantum Computer, Quantum Simulations.

Text Books:
1. Quantum computing for computer scientists, Noson S. Yanofsky, Mirco A. Mannucci, Cambridge University
Press 2008.

Reference Books:
1. Quantum computing explained, David McMahon, Wiley-interscience, John Wiley & Sons, Inc.
Publication2008.
2. Quantum computation and quantum information, Michael A. Nielsen and Isaac L. Chuang, Cambridge
University Press2010.
3. Introduction to Quantum Mechanics, 2nd Edition, David J. Griffiths, Prentice Hall New Jersey1995.

E - Resources:
1. http://patrickjmt.com/
2. https://homepages.cwi.nl/~rdewolf/qcnotes.pdf
3. https://homes.cs.washington.edu/~oskin/quantum-notes.pdf
4.https://nptel.ac.in/courses/104/104/104104082/

Course outcomes:
The Student will be able to:
1. Understand the Basics of complex vectorspaces.
2. Analyze Quantum mechanics as applied in Quantum computing.
3. Analyze the quantum information with Architecture andalgorithms.
4. Apply the quantum programminglanguages.
5. Understand the current status of quantum computing
 CYBER FORENSICS

Course Code L : T : P : S Credits Exam Marks Exam Duration Course Type

20CIT741 3:0:0:0 3 CIE: 50 SEE: 50 3 hours PEC

Pre-Requisites: Nil

Course objectives:
The Student will:
1. Learn the fundamentals of computerforensics
2. Differentiate the rules of evidence and methods of collecting
3. Know what forensic data to collect andanalyse
4. Understand the usage of computers in forensic, and how to use various forensic tools for a wide variety
ofinvestigations.
5. Learn e-mail investigations and mobile deviceforensics.

Module 1:
Computer Forensics Fundamentals: What is Computer Forensics? Use of Computer Forensics in Law
Enforcement, Computer Forensics in Law Enforcement, Computer Forensics Assistance to Human
Resources/Employment Proceedings, Computer Forensics Services, Benefits of professional Forensics
Methodology, Steps taken by computer Forensics Specialists. Types of Computer Forensics Technology:
Types of Military Computer Forensics Technology, Types of Law Enforcement – Computer Forensic
Technology – Types of Business Computer Forensics Technology. Computer Forensics Evidence and
Capture: Data Recovery Defined- Data Back-up and Recovery the Role of Back-up in Data Recovery- The
Data RecoverySolution.

Module 2:
Evidence Collection and Data Seizure: Why Collection Evidence? Collection Options – Obstacles –
Types of Evidence – The Rules of Evidence- Volatile Evidence- General Procedure – Collection and
Archiving – Methods of Collection – Artifacts – Collection Steps – Controlling Contamination: The chain
of Custody. Duplication and preservation of Digital Evidence: Preserving the Digital Crime Scene –
Computer Evidence Processing Steps – Legal Aspects of Collecting Preserving Computer Forensics
Evidence. Computer Image Verification and Authentication: Special Needs of Evidential Authentication –
Practical Consideration – Practical Implementation.
 Module 3:
Computer Forensics analysis and validation: Determining what data to collect and analyze, validating
forensic data, addressing data – hiding techniques, performing remote acquisitions. Network Forensics:
Network Forensics overview, performing live acquisitions, developing standard procedures for network
forensics, using network tools, examining the honeynetproject

Module 4:
Processing crime and incident scenes: Identifying digital evidence, collecting evidence in private-sector
incident scenes, processing law enforcement crime scenes, preparing for a search, securing a computer
incident or crime scene, seizing digital evidence at the scene, storing digital evidence, obtaining a digital
hash, reviewing a case. Current computer forensic tools: evaluating computer forensic tool needs, computer
forensics software tools, computer forensics hardware tools, validating and testing forensics software.

Module 5:
E-Mail investigations: Exploring the role of E-mail in investigation, exploring the role of the client and
server in E-mail, investigating e-mail crimes and violations, understanding e-mail servers, using
specialized e-mail forensic tools. Cell phone and mobile device forensics: Understanding mobile device
forensics, understanding acquisition procedures for cell phones and mobile devices. Working with
windows and DOS Systems: Understanding file systems, exploring Microsoft File Structures, Examining
NTFS Disks, Understanding whole disk encryption, windows registry, Microsoft startup tasks, MS-DOS
Startup tasks, virtualmachines.
Text Books:
1. Computer forensics, computer crime investigation by John R.Vacca, Firewall Media, New Delhi.
2. Computer forensics and investigations by Nelson, Phillips EnfingerSteuart, CENGAGE Learning
References Books:
1. Real Digital Forensics by Keith J.Jones, RechardBejtlich, Curtis W.Rose, Addison-Wesley
PearsonEducation.
2. Forensic compiling, A Tractitioneris Guide By Tony Sammes and Brain Jenkinson, Springer International
Edition.
3. Computer Evidence Collection & Presentation by Christopher L.T.Brown, FirewallMedia.
 E – Resources:
1. https://www.smartzworld.com/downloads/download/cf-complete-pdf-notes/
2. https://www.cs.nmt.edu/~df/lectures.html
3. https://www.youtube.com/watch?v=2ESqwX3qb94

Course outcomes:
The Student will be able to:
1. Identify the fundamentals of computerforensics
2. Classify the rules of evidence and methods ofcollecting
3. Describe what forensic data to collect and analyse
4. Appraise the usage of computers in forensic, and how to use various forensic tools for a wide variety
ofinvestigations
5. Summarize e-mail investigations and mobile deviceforensics.
 PRECISION AGRICULTURE

Course Code L : T : P :S Credits Exam Marks Exam Duration Course Type

20CIT742 3:0:0:0 3 CIE:50 3 Hours PEC
SEE:50

Prerequisites:
Basic Computer Knowledge Linear Algebra Statistics and Probability Calculus Graph Theory
Programming Skills – Language such as Python, R, MATLAB, C + + or Octave Data, Hardware.

Descriptions:
This course is aimed toprovide an interdisciplinary, integrative overview of latest development in the
domain of smart farming.

Course Objectives:
This course will enable students to:
 Detailed description of latest tools and technologies available for the Agriculture 5.0.
 Describe different type of hardware, platforms and techniques for use in smart farming.
 Learn different modeling techniques in precision agriculture.
 Make data driven based decision making & support systems.
 Learn policies and regulations for adopting AI & ML techniques in Agriculture.

Syllabus

Module 1
Introduction to Precision Agriculture:
History of Precision Agriculture and its Global, Precision Agriculture – Introduction, Need and Scope
of Precision Agriculture, Components of Precision Agriculture, Tools and Techniques, Site-Specific
Crop Management (SSCM, Variable Rate Application (VRA) and Variable Rate Technology (VRT,
Adoption of Smart Precision Agriculture, Some Misconceptions about Precision Agriculture, Smart
Intelligent Precision Agriculture: Modern Day Agriculture, Digitization of Agriculture-Digital
Farming, Transition to Smart Intelligent Precision Agriculture, Benefits of Smart Intelligent Precision
Agriculture.
Module II
Adoption of Wireless Sensor Network (WSN) in Smart Precision Agriculture: Sensors and
Wireless Sensor Network, Evolution of Wireless Sensor Networks, Introduction of WSN in
Agriculture, Features of Agriculturally Based Sensors, Types of Sensors Used for WSN Agricultural
System, Intelligent Sensors Versus Smart Sensors, Impact of the Wireless Sensors on Traditional
Agriculture, Sensor Based Variable Rate Application,, Applications of WSN in Precision Agriculture,
Security Issues and Challenges for WSN Implementation. IoT (Internet of Things) Based
Agricultural Systems: Introduction, Architecture of IoT, Brief Overview of IoT Network,
Characteristics of Internet of Things, Inter-Operability Challenges, Applications of IoT in Smart
Agriculture, Challenges for the Implementation of IoT in Smart Farming, Security and Privacy Issues
of an IoT, Fusion of Cloud Platform with IoT.
Module III
AI (Artificial Intelligence) Driven Smart Agriculture: Artificial Intelligence (AI) – Introduction,
Categories of AI, Subsets of AI,Life Cycle of an Artificial Intelligence-Based, Prerequisites for
Building an ML/AI-Based Agricultural Model, Advantages of A.I in Agriculture. Machine Learning
(ML) Driven Agriculture: Cognitive Technologies, Introduction to Machine Learning, Types of ML,
Artificial Neural Networks and Deep Learning, General Applications of Machine Learning, Scope of
Artificial Intelligence and Machine Learning in Agriculture, Applications of A.I and M.L in
Agriculture.
 Module IV
Data-Driven Smart Farming: Introduction, Collection and Management of Real-Time Agricultural
Big Data, Transforming Field Data into Meaningful Insights, Processing and Predictive Analysis of
Agricultural Data, Predictive Modeling. Decision-Making and Decision-Support Systems:
Introduction, Intelligent Agricultural Decision Support Systems (ADSS), Features and Workings of an
Intelligent Agricultural Decision Support System (ADSS), Intelligent Decision-Making using AI, ML,
and IoT for Farmers.
Module V
Agriculture 5.0 – The Future: Introduction to Agriculture 4.0, Nanotechnology and Smart Farming,
Block chain -Securing the Agriculture Value Chain, Edge-Fog Computing for Smart Farming, Role of
Big Data in Agriculture, Transition to Agriculture. Social and Economic Impacts: Societal and
Economic Impact of AI, ML, and IoT in Intelligent Precision Farming, Existence of Forums for
Innovation and Commercialization of Intelligent Precision Farming Technology (IPFT).
Environmental Impact and Regulations: Potential Impact on the Environment with Different IPFT,
Policy Making and Governance.

Course Outcomes:
On completion of the course, students will be able to:
 Describe about Artificial Intelligence in precision agriculture
 Analyze the WSN and IoT based Agricultural systems
 Design AI and ML Driven system for agriculture
 Describe the key aspects of data driven and decision making & support systems.
 Discuss AI, its current scope and limitations, and societal implications.

Text books:
 Latief Ahmad and FirasathNabi:Agriculture 5.0, Artificial intelligence, IoT and machine
learning, Taylor & Francis,1st edition,2021.
 Rajesh Singh, Anita Gehlot, Mahesh Kumar Prajapat, Bhupendra Singh, Artificial
Intelligence In Agriculture, 2021.

Reference books:
 K.C. Ting, S. Panigrahi : Artificial Intelligence for Biology and Agriculture, 1998.
 GurjitKaur, PradeepTomar : Artificial Intelligence and IoT-Based Technologies for
Sustainable Farming and Smart Agriculture, 2019.
 BUSINESS INTELLIGENCE

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CIT743 3:0:0:0 3 CIE:50 SEE:50 3 hours PEC

Prerequisite: Excel, Database, charts and visualization

Module 1

An Overview of Business intelligence, Analytics and Decision Support: Changing

Business Environments and Computerized Decision Support; Framework for
Business intelligence (BI); Intelligence Creation, Use, and BI Governance;
Transaction Processing versus Analytic Processing; Successful BI
Implementation; Analytics Overview; and Introduction to Big Data Analytics.

Module 2

Data Warehousing: Data Ware Housing (DW) Definitions and Concepts;DW

Process Overview, Architectures; Data Integration, and the Extraction,
Transformation and Load (ETL) Processes;DW Development;DW
Implementation Issues; Real Time DW; and DW Administration, Security Issues
and Future Trends. Business Reporting, Visual Analytics and Business Performance
Management Business Reporting Definitions and Concepts: Data and Information
Visualization; Different Types of Charts and Graphs; Emergence of Data
Visualization and Visual Analytics; Performance Dash Boards; Business
Performance Management; Performance Measurement; Balanced Score Boards;
and Six Sigma as a Performance Measurement System
Module 3
Datamining: Data Mining (DM) Concepts and Applications; DM Processed
Methods Software Tools; and DM Privacy Issues, Myths and Blunders.

Module 4
Text and Web Analytics: Text Analytics (TA) and Text Mining (TM) Overview;
Natural Language Processing; TM Applications‘ Process; Sentiment Analysis;
Web Mining (WM) Overview; Search Engines; Web Usage Mining (Web
Analytics); and Social Analytics

Module 5

Big Data Analytics: Definition of Big Data; Fundamentals of Big Data Analytics;
Big Data Technologies; Data Scientist; Big Data and Warehousing; Big Data
Vendors; Big Data and Stream Analytics; and Applications of Stream Analytics.
Business Analytics (BA) – Emerging trends and Future Impacts:Location-Based Analytics
for Organizations; Analytics Applications for Consumers; Recommendation
Engines; Web 2.0 Revolution and Online Social Networking; Cloud Computing
and BI; Impacts of Analytics in Organizations –An Overview; Issues of Legality,
Privacy and Ethics; and an overview of Analytics Ecosystem
Textbooks:
1. RameshSharda,DursunDelen,EfraimTurban,etal,‚BusinessIntelligence:A
Managerial Perspective on Analytics‛, 3rd Ed, Pearson India EducationInc,
IndianSubcontinentReprint2018(ISBN978-93-528-6271-9)
ReferenceBooks:
1. Jiawei Han and Michelinekambe, Jian Pei, ‚Data Mining: Concepts and
Techniques ‚, 3rd ed. The Morgan KaufmannPublishers.
2. Michael Steinbach, Pang-Ning Tan, and Vipin Kumar, ‚Introduction To Data
Mining‛, Pearson International Edition,2006.
3. James Allen,‛ Natural Language Understanding‛, 2nd Ed., The
Benjamin/Cummings Publishing CompanyInc.
nd
4. DanielJurafsky,James.H.Martin,‚SpeechandLanguageProcessing‛, 2 Edition,
Pearson EducationInc.
Course Objectives:
The Course Objectives are to:
1. Introduce a managerial perspective of Business Intelligence (BI), and Analytics
and DecisionSupport,
2. Provide introduction to three levels of analytics: descriptive, predictive and
prescriptive,
3. Provide exposure to analytics techniques and theirapplications,
4. Introduce to specific software tools that can be used for
developingapplications, and
5. Provide introduction to emerging technologies that are likely to impact on the
development and use BIapplications.

Course Outcomes:
Upon the successful completion of the course, learners will be able to

CO
Nos. Course Outcomes

CO1 Outline of Business intelligence, Analytics and

Decision Support
CO2 Summarize the concepts of warehousing and
descriptive level of analyticsas business
CO3 Explain the predictive level of analytics through
datamining
 DIGITAL MARKETING

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CIT751 3:0:0:0 3 CIE:50 SEE:50 3 hours IEC

Course Objectives:
This course will enable students to:
• Comprehend business advantages of digital marketing and its importance for marketing
success and to develop a digital marketingplan.
• Learn Website and SEO optimization techniques and also, to outline Google Ad Words
campaigns.
• Acquire knowledge of Google Analytics for measuring effects of digital marketing and to get
insights of future trends that will affect the development of digitalmarketing.
• Learn to use various social media platforms in order to create, manage and evaluate digital
marketing efficiently.
• Cognize strategies used for email marketing, resource planning and budgeting.

Syllabus
Module - I
Introduction to digital marketing, Digital vs. Real Marketing, Digital Marketing Channels, Creating
initial digital marketing plan, Content management, SWOT analysis, Target group analysis, Web
design, Optimization of Web sites. 08 Hours
Module - II
SEO Optimization, Writing the SEO content, Web design, Optimization of Web sites, Google
AdWords- creating accounts, Google AdWords- types, Introduction to CRM, CRM platform, CRM
models, Introduction to Web analytics, Web analytics - levels. 08 Hours
Module - III
Introduction of Social Media Marketing, Creating a Facebook page, Visual identity of a Facebook page
Types of publications, Business opportunities and Instagram options, Optimizationof Instagram profiles,
Integrating Instagram with a Web Site and other social networks, Keeping up with posts.
08 Hours
Module - IV
Business tools on LinkedIn, Creating campaigns on LinkedIn, Analyzing visitation on LinkedIn,
Creating business accounts on YouTube, YouTube Advertising, YouTube Analytics, Facebook Ads,
Creating Facebook Ads, Ads Visibility. 08 Hours
Module - V
E-mail marketing, E-mail marketing plan, E-mail marketing campaign analysis, Keeping up with
conversions, Digital Marketing Budgeting- resource planning - cost estimating - cost budgeting - cost
control. 08 Hours

Course Outcomes:
On completion of this course, the students are able to:
• Examine the importance of digital marketing and create suitable plans for marketingsuccess.
• Assess customer relationships across all digital channels and build better customer
relationships.
• Create a digital marketing plan, starting from SWOT analysis and there by defining a targetgroup.
• Use social media channels to achieve maximum benefit for the business, by using web
analytics.
• Develop different ways for the integration of marketing plans taking into consideration the
available resources and budget.
Text Book:
1. Damian Ryan & Calvin Jones, "Understanding Digital Marketing: Marketing Strategies for
Engaging the Digital Generation", Kogan Page Limited, 1st Edition, 2009, ISBN-978-
0749453893.
Reference Books:
2. Joe Pulizzi, "Epic Content Marketing", McGraw-Hill Education, 1st
Edition 2013, ISBN-978-0071819893.
3. The Beginner's Guide to Digital Marketing (2015), Digital Marketer. (PDF)
E-Resources: 1. https://www.digitalmarketer.com/digital-marketing/ 2.
https://www.tutorialspoint.com/digital_marketing/index.htm
3. https://www.javatpoint.com/digital-marketing
 ENTERPRISE RESOURCE PLANNING (ERP)

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CIT752 3:0:0:0 3 CIE:50 SEE:50 3 hours IEC

Course Objectives:
This course will enable students to:
• Know contemporary and forward-looking on the theory and practice of Enterprise Resource
Planning Technology.
• Focus on a strong emphasis upon practice of theory in Applications and Practical oriented
approach.
• Train to learn the basic understanding of how ERP enriches the business organizations in
achieving a multidimensional growth.
• Aim at preparing technological competitive and make them ready to self-upgrade with the
higher technical skills.
• Gain the knowledge of existing modules of ERP systems.

Syllabus
Module–I
Introduction to ERP: Common ERP myths, Evolution of ERP, Advantages, Characteristics, Process
integration with ERP system, Implementation costs, Roadmap for successful ERP implementation.
ERP Market and Vendors: ERP market, ERP vendors, Service oriented architecture, ERP package
features. 08 Hours
Module–II
Extended ERP services: Defining Extended ERP, Supply chain Management (SCM) and ERP, ERP and
Business Intelligence(BI), ERP and E-commerce.
Business Process Re-engineering (BPR) and ERP: Defining BPR, BPR Vs TQM, BPR and change
management, approaches in BPR implementation, Methodologies for BPR implementation, BPR
success/failure factors. 08 Hours
Module–III
Planning for ERP: Planning for ERP implementation, understanding organizational requirement,
Economic and strategic justification, Project scope, determining resources, organizational commitment to
change, budget for ERP, select right ERP package.
Implementation of ERP: Designs of ERP system, ERP implementation approach, ERP implementation
life cycle, different phases ofERP implementation. 08 Hours
Module–IV
Managing ERP projects: Risk/Failure factors in ERP implementation, Example of ERP failure, Critical
success factors, Complexities of ERP projects, Evaluating ERP projects.
ERP: Going Live and post implementation: Preparing to go live, Strategies for migration to new ERP
system, Managing ERP after Go Live, Maintenance of ERP system. 08 Hours
Module–V
ERP, Internet and WWW – ERP II: The internet explosion, ERP, Internet and WWW, ERP to ERP II,
Best practices of ERP II.
Future directions and Trends in ERP: New markets, New channels, Easier communication tools,
Business models, Need based applications, Expenditures, Reduction in implementation time, Market
snap shots, Shifting revenue models. 08 Hours
Course Outcomes
On completion of this course, the students will be able to:
• Compare the concepts and importance of ERP system.
• Design ERP market and vendors.
• Differentiate the relationship of ERP and SCM.
• Evaluate the concept ERP implementation.
• Deign the concepts of internet with respect to WWW.
Text Books:
1. Enterprise Resource Planning, Ashim Raj Singla, Cengage Learning India Pvt. Ltd., Second
edition (1 July 2016) New Delhi, 2008. ISBN-No:8131532046.
2. Enterprise Resource Planning, Alexis Leon, 2nd edition, Tata Mcgraw Hill Education Pvt. Ltd.,
New Delhi, 2008. ISBN-No: 1259005917.
Reference Books:
1. E-Business and ERP: Transforming the Enterprise, Grant Norris, James R. Hurley, Kenneth M.
Hartley, John R. Dunleavy, John D. Balls, John Wiley and Sons publications, 2000. ISBN-10:
0471392081.
2. Enterprise Resource Planning: Concepts and Practice, V.K. Garg. Second edition, PHI Learning
Pvt. Ltd.,Publications 2003 ISBN 8120322541,
E-Resources:
1. http://8thinktank.com/erp/erp-implementation-life-cycle/#:~:text=ERP%20Implementation
%20Life%20Cycle%20is,%2C%20implementation% 2C%20transition%20and%20operations.
2. https://en.wikipedia.org/wiki/Enterprise_resource_planning
3. https://www.cio.com/article/2439502/what-is-erp-key-features-of-top-enterprise-resourceplanning-systems.html
 SUPPLY CHAINMANAGEMENT

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
20CIT753 3:0:0:0 3 CIE:50 SEE:50 3 hours IEC

Course Objectives:
The objectives of this course are
 To provide Knowledge on logistics and supply chain management
 To enable them in designing the distribution network
 To train the students in knowing the supply chain Analysis
 Impart knowledge on Dimensions of logistic
 To know the recent trends in supply chain management

Syllabus

Module 1

Introduction to Supply Chain Management: Supply chain - objectives - importance - decision

phases - process view competitive and supply chain strategies - achieving strategic fit – supply chain
drivers - obstacles – framework – facilities -inventory-transportation-information-sourcing-pricing.

Module 2

Designing the distribution network: Role of distribution - factors influencing distribution - design
options - e-business and its impact distribution networks in practice –network design in the supply
chain - role of network -factors affecting the network design decisions modeling for supply chain. Role
of transportation - modes and their performance – transportation infrastructure and policies - design
options and their trade-offs tailored transportation.
Module 3

Supply Chain Analysis: Sourcing - In-house or Outsource - 3rd and 4th PLs - supplier scoring and
assessment, selection - design collaboration - Procurement process - Sourcing planning and analysis.
Pricing and revenue management for multiple customers, perishable products, seasonal demand, bulk
and spot contracts.

Module 4

Dimensions of Logistics: A macro and micro dimension - logistics interfaces with other areas -
approach to analyzing logistics systems - logistics and systems analysis - techniques of logistics
system analysis - factors affecting the cost and importance of logistics. Demand Management and
Customer Service Outbound to customer logistics systems - Demand Management –Traditional
Forecasting CPFRP - customer service - expected cost of stock outs - channels of distribution.

Module 5
Recent Trends in Supply Chain Management-Introduction, New Developments in Supply Chain
Management, Outsourcing Supply Chain Operations, Co-Maker ship, The Role of E- Commerce in
Supply Chain Management, Green Supply Chain Management, Distribution Resource Planning, World
Class Supply Chain Management
 Course Outcomes:

At the end of the course, students will be able to

□ Understand the strategic role of logistic and supply chain management in the cost
reduction and offering best service to the customer
□ Understand Advantages of SCM in business
□ Apply the knowledge of supply chain Analysis
□ Analyze reengineered business processes for successful SCM implementation
□ Evaluate Recent trend in supply chain management

TEXT BOOKS:
□ Sunil Chopra and Peter Meindl, Supply Chain Management –
―Strategy, Planning andOperation‖, 3rd Edition, Pearson/PHI,2007.
□ Supply Chain Management by Janat Shah Pearson Publication2008.

REFERENCE BOOKS:
□ A Logistic approach to Supply Chain Management – Coyle, Bardi,
Longley, CengageLearning,1/e
□ Donald J Bowersox, Dand J Closs, M Bixby Coluper, ―Supply Chain
Logistics Management‖,2nd edition, TMH,2008.
□ Wisner, Keong Leong and Keah-Choon Tan, ―Principles of Supply
Chain Management ABalanced Approach‖, Cengage Learning,1/e
□ David Simchi-Levi et al, ―Designing and Managing the Supply Chain‖ –Concepts