SCHEME OF EXAMINATION

B. Tech- 3rd Year Semester: 5th

Branch: Computer Science and Engineering
Periods per
Scheme of Exam Credit
Subject week Total
S.N. Subject Name L+(T+
Code Theory/Practical Marks
L T P P)/2
ESE CT TA
1 Theory of Computation CS102501 2 1 - 100 20 30 150 3

2 Computer Network CS102502 3 0 - 100 20 30 150 3

Introduction To Data
3 CS102503 2 1 - 100 20 30 150 3
Science
4 Internet of Things CS102504 3 0 - 100 20 30 150 3

5 Professional Elective -1 Refer Table -1 3 0 - 100 20 30 150 3

6 Computer Network Lab CS102591 - - 2 25 - 25 50 1

7 Data Science Lab CS102592 - -- 2 25 - 25 50 1

8 Internet of Things Lab CS102593 - - 2 25 - 25 50 1

9 Minor Project – I CS102594 - - 2 25 - 25 50 1

10 Internship Assessment CS102595 - - 2 - - 25 25 1

11 Constitution of India CS100596 - - - - - 25 25 -

Total 13 2 10 600 100 300 1000 20

Professional Elective -1
Sr. No. Subject Code Name of Subject
1. CS102521 Statistical Foundation for Data Science
2. CS102522 Biometrics
3. CS102523 Object Oriented Modeling and Design
4 CS102524 Cryptography and Network Security

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 Subject Code
Theory Of Computation L=3 T=0 P=0 Credits = 3
CS102501
ESE CT TA Total ESE Duration
Examination 100 20 30 150 3 Hours
Scheme
Minimum number of class tests to be
Minimum Assignments=02
conducted=02

Course Objectives Course Outcomes

Formal languages and automata theory deals

with the concepts of automata, formal On successful completion of the course, the student
languages, Grammar, computability and will be able to:
decidability. The reasons to study Formal
Languages and Automata Theory are Automata CO1.Design finite automata to accept a set of
Theory provides a simple, elegant view of the strings of a language.
complex machine that we call a computer .More
precisely, the objectives are: CO2.Determine whether the given language is
regular or not.
• To give an overview of the theoretical
foundations of computer science from the CO3.Design context free grammars to generate
perspective of formal languages.
• To illustrate finite state machines to solve strings of context free language.
problems in computing.
CO4.Design push down automata and the
• To explain the hierarchy of problems
arising in the computer sciences. equivalent context free grammars and Design
• To familiarize Regular grammars, context Turing machine.
frees grammar.
• To solve various problems of applying CO5.Distinguish between computability and non-
normal form techniques, push down computability, Decidability and un-decidability.
automata and Turing Machines

UNIT – I: The Theory Of Automata CO1

Introduction to automata theory, Examples of automata machine, Finite automata as a language

acceptor and translator, Deterministic finite automata. Non-deterministic finite automata, finite
automata with output (Mealy Machine. Moore machine), Finite automata with Epsilon moves,
Minimizing number of states of a DFA, My hill Nerode theorem, Properties and limitation of FSM,
Application of finite automata. [8Hrs.]
εmove

UNIT – II: Regular Expressions CO2

Alphabet, String and Languages, Regular expression, Properties of Regular Expression, Finite
automata and Regular expressions, Arden’s Theorem, Regular Expression to DFA conversion &
vice versa. Pumping lemma for regular sets, Application of pumping lemma, Regular sets and
Regular grammar, Closure properties of regular sets. Decision algorithm for regular sets and regular
grammar. [7Hrs.]

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 UNIT – III: Grammars CO3

Definition and types of grammar, Chomsky hierarchy of grammar, Relation between types of
grammars, Context free grammar, Left most & right most derivation trees, Ambiguity in grammar,
Simplification of context free grammar, Chomsky Normal From, Greibach Normal From, properties
of context free language, Pumping lemma for context free language, Decision algorithm for context
tree language. [7Hrs.]

UNIT – IV: Push Down Automata And Turing Machine CO4

Basic definitions, Deterministic push down automata and non-deterministic push down automata,
Acceptance of push down automata, Push down automata and context free language, Turing
machine model, Representation of Turing Machine, Construction of Turing Machine for simple
problem’s, Universal Turing machine and other modifications .Church’s Hypothesis, , Halting
problem of Turing Machine. [7Hrs.]

UNIT – V: Computability CO5

Introduction and Basic concepts, Recursive function, Partial recursive function, Initial functions,
Composition of functions, Ackerman’s function, Recursively Enumerable and Recursive languages,
Decidable and decidable problem, Post correspondence problem, Space and time complexity [7Hrs.]

Text Books:

S. No. Title Author(s) Publisher

Theory of Computer Science K.L.P. Mishra and N.
1 PHI
(Automata Language & Computation) Chandrasekran
Introduction to Automata theory. John E. Hopcropt & Narosa, Publishing
2
Language and Computation Jeffery D. Ullman House

Reference Books:

S. No. Title Author(s) Publisher

Introduction to Languages and the
1 John Martin, Tata McGraw Hill.
Theory of Computation
Introduction to Formal Languages Kamala Krithivasan, 2nd Edition, Pearson
2
Automata Theory and Computation Rama R Education.

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 Subject Code
Computer Network L=3 T= P=0 Credits = 3
CS102502
ESE CT TA Total ESE Duration
Examination
100 20 30 150 3 Hours
Scheme
Minimum number of class tests to be conducted=02 Minimum Assignments=02

Course Objectives Course Outcomes

On completion of this course the student will be able

To Provide students with an enhanced to:
knowledge in Computer Networking. CO1: Describe the basis and structure of an abstract
layered Network protocol model.
CO2: understand the working of network protocols.
 Understanding concept of local area
CO3: Students will have deep understanding of
networks, their topologies, protocols and various protocols used at Data Link Layer and will
applications. be able to analyze the advantages and
 Understanding the different protocols, and disadvantages of various available protocols for
network architectures. flow and error control.
 To make students understand the basic CO4: Students will be able to analyze various
Ethernet standards and will be able to choose an
model of data communication and various
appropriate standard according to requirement of
concepts of networking. LAN.
CO5: Students will be able to use various network
based applications.

UNIT – I: Introduction: History of Computer Network, Examples of Networks: Novell Networks,

Arpanet, Internet, Network Topologies WAN, LAN, MAN, PAN,. Applications, networks
architecture requirements, ISO-OSI, TCP/IP, XNS, IPX/SPX,
Physical Layer: Transmission media, signal and encoding, asynchronous communications; Narrow
band, broad band ISDN and ATM. Bandwidth calculation

UNIT – II: Data link layer : Design issues, framing, error detection and correction techniques with
numerical, CRC, Elementary Protocol : stop and wait, Sliding Window, Slip, Data link layer in
HDLC, ATM. Multiple Access Protocols, Link Layer Addressing, ARP, DHCP, Ethernet devices –
Hubs, Bridges, and Switches.
Medium Access sub layer: ALOHA, MAC addresses, CSMA, CSMA/CD. IEEE 802.X Standard
Ethernet, wireless LAN.

UNIT – III: Network Layer : Forwarding and Routing, Network Service Models, Virtual Circuit
and Datagram Networks, Router, Routing Table, Internet Protocol (IP) – IPv4 and IPv6 , ICMP,
Link State Routing , Distance Vector Routing, Hierarchical Routing , RIP, OSPF, BGP, Broadcast
and Multicast Routing , MPLS, Mobile IP, IP sec. IPv4 : Classes, Classless, Subneting, Super
netting and its numerical

UNIT – IV: Transport Layer: Transport Layer Services – Multiplexing and Demultiplexing, UDP

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 –Go Back-N and Selective Repeat. Connection-Oriented Transport: TCP, Segment Structure,
RTT estimation, Flow Control, Connection Management, Congestion Control, TCP Delay
Modeling, SSL and TLS. QoS architecture models: IntServ vs DiffServ

UNIT – V: Presentation Layer protocols: AFP, ICA, LPP, NCP, NDR, Telnet
Session Layer protocols: PAP, PPTP, RPC, SCP
Application Layer: Principles of Network Applications , The Web and HTTP, HTTPS, FTP,
Electronic Mail, SMTP, IRC, Video Conferencing, MIME, DNS, Socket Programming with TCP
and UDP.
Network Security: Principles of Cryptography, Firewalls, Application Gateway, Attacks and
Countermeasures.

Text Books:
S.No. Title Author(s) Publisher
Data Communications and
1 Behrouz A. Forouzan Third Edition TMH
Networking
Computer Networking: A Top-Down James F. Kurose and Pearson Education, Third
2
Approach Featuring the Internet Keith W. Ross edition, 2006

Reference Books:
S. No. Title Author(s) Publisher
4th Edition. Pearson
1 Computer Networks Andrew S Tanenbaum
Education/PHI
An Engineering Approach to 2nd Edition, Pearson
2 S. Keshav
Computer Networks Education

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 Subject Code
Introduction to Data Science L=2 T=1 P=0 Credits = 3
CS102503
ESE CT TA Total ESE Duration
Examination
100 20 30 150 3 Hours
Scheme
Minimum number of class tests to be conducted=02 Minimum Assignments=02

Course Objectives Course Outcomes

The objective of the course is aimed to

Provide knowledge, insight into methods and On successful completion of the course, the student
tools for Preparation and Visualization of the will be able to:
data generated by modern information CO1 Basic Concepts of Data Science
CO2 Understanding of reading data and manipulation
systems and also to impart necessary CO3 understand data cleaning , dimentionality
knowledge of the mathematical foundations reduction
needed for data science and develop CO4 understand and analyse data
programming skills required to build data CO5 use visualization of data to capture data
insight and build model
science applications.

UNIT-1: Introduction Introduction to data science, Evolution of Data science, Stages in Data science
project, Facets of data, Data Science Project’s Lifecycle, Web APIs, Open Data sources, Data APIs,
Web Scrapping, Relational Databases access to process/access data.

UNIT-2 Introduction to Programming : Basic programming in python: list, string, dictionary, array
and tuples. Indexing, slicing, iterating and other basic operations. Data Science Toolkits using Python:
Matplotlib, NumPy, Scikit-learn, NLTK Numpy: creating arrays, arrays manipulation, reshape,
dimension, broadcasting, reading and writing array data on files. Pandas: Series and Data frames.
Reading files(.xlsx,.csv,.txt) in data frame. Row and index objects, function by elements, function by
rows and columns, statistical functions, sorting and ranking, correlation and covariance

UNIT-3: Data cleaning and preprocessing Data Collection strategies: web scrapping tools, handling
missing values; Data imputation techniques, data transformation techniques: Data Smoothing,
Attribution Construction, Data Generalization ,Data Aggregation, Data Discretization, Data
Normalization. Data Reduction techniques: Dimensionality reduction, Numerosity reduction, data
cube aggregation, data compression, discretization operation

UNIT-4: Exploratory data analysis Exploratory Analysis: Introduction to statistics used in data
science, Central tendencies and distributions, Variance Descriptive-Mean, Standard Deviation,
Skewness and Kurtosis, statistical summary of categorical and numerical data, data dispersion: range ,
interquartile range ,variance, standard deviation, coefficient of variation. data distribution: Continuous
and Normal distributions. Frequency table: two-way table with joint, conditional and marginal
probability. Pearson correlation.

UNIT-5 Data Visualization and model building: Introduction, Types of data visualization, A Simple
Interactive Chart, Set the Properties of the Plot, matplotlib, Bar chart, scatter chart histogram, pie chart

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
Working with Multiple Figures and Axes, Adding Text, adding a Grid, adding a Legend, Saving the
Charts. Seaborn library: Box and Whiskers plot for numerical and categorical variables, grouped
plotting. Pairwise plot. Overview of Machine learning concepts – Over fitting and train/test splits,
Types of Machine learning – Supervised, Unsupervised, Reinforced learning. Building a
basic model with supervised machine learning algorithm: linear regression, logistic regression, support
vector. (7Hrs)

Text Books:

S.No. Title Author(s) Publisher

Ian Goodfellow, Yoshua Bengio

1 Deep Learning MIT Press
and Aaron Courville
Data Science from Scratch: First
2 Joel Grus O'Reilly Media
Principles with Python
Doing Data Science, Straight Talk Cathy O’ Neil and
3 O’Reilly
From The Frontline Rachel Schutt
Jure Leskovek, Anand
4 Mining of Massive Datasets Cambridge University Press
Rajaraman and Jeffrey Ullman

Reference Books:

S. No. Title Author(s) Publisher

1 Machine Learning Jeeva Jose Khanna Publishers

2 Data Sciences Jain V.K Khanna Publishers

3 Big Data and Hadoop Jain V.K Khanna Publishers

4 Machine Learning Chopra Rajiv Khanna Publishers

Practical Statistics for Data Peter Bruce, Andrew
5 O’Reilly
Scientists Bruce, Peter Gedeck

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 Subject Code
Internet of Things L=3 T=0 P=2 Credits = 3
CS102504
ESE CT TA Total ESE Duration
Examination
100 20 30 150 3 Hours
Scheme
Minimum number of class tests to be conducted = 02 Minimum Assignments = 02

Course Objectives
Course Outcomes

On successful completion of the course, the student

The objective of this course is will be able to:

 To understand Concepts, design and CO1. Students will familiar with the concepts of
characteristics of IoT. Internet of Things.
 To understand Architecture of IoT. CO2. Students will familiar with IoT Architecture
 To understand basic protocols of IoTs. CO3. Students will ready to Analyze basic
 To understand challenges and protocols in wireless sensor network
applications of IoTs. CO4. Students will be capable to design IoT
 To develop IoT applications using applications in different domain and be able
Tools. to analyze their performance
CO5. Capable to implement basic IoT
applications on embedded platform

Unit 1: Introduction to Internet of Things: Origin of Terminology IoT, Applications of IoT,

Characteristics, Implementation Issues, IoT Architecture, IoT Levels, Connectivity Layers,
Interoperability in IoT, associated technologies with IoT (M2M, Telemedicine, Big Data, Cloud,
Smart Grid, IoV, MANET, VANET, CPS, SDN, 3G/4G/5G), Challenges in IoT, IoT vs WoT,
IoT vs M2M, IoT Network Configurations.

Unit 2: Connectivity: IoT Network Configurations , Gateway Prefix Allotment, Gateways ,

Multi-homing , IPv4, IPv6, IPv4 versus IPv6, RPL Data Protocol: MQTT, CoAP, AMQP, DDS,
XMPP.
Communication Protocols: IEEE Standards 802.3, 802.11 and 802.15 and their versions, Z
Wave, Bluetooth, ZigBee, 6LowPAN, HART and Wireless HART, NFC, RFID, Software-
Defined Networking
Unit 3: Sensors: Definition, Property of Sensors, Types of sensors:- Transducers, Temperature
Sensors, Humidity Sensors. Pressure Sensors. Proximity Sensors. Level Sensors. Accelerometers.
Gyroscope. Gas Sensors. etc., Sensors Classes
Actuation: Actuator, Actuator Types :- Hydraulic Pneumatic, Electrical, Thermal/ Magnetic,
Mechanical, Soft Actuators, Shape memory polymer (SMP)
Types of Motor Actuators and their working- Servo motor, Stepper motor, Hydraulic motor,
Solenoid Relay, AC motor
Unit 4: Introduction to Arduino Programming – : Operators in Arduino, Control

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
Statement, Loops, Arrays, String, Math Library, Random Number, Interrupts, Integration and
calibration of Sensors and Actuators with Arduino:
Implementation of IoT: Introduction to Arduino and NodeMCU (ESP8266) board, Programming
NodeMCU using Arduino, Connectivity of Sensors and Actuators with NodeMCU, Introduction to
Python programming, Introduction to Raspberry PI.

Unit 5: Cloud Computing Fundamentals: Recent Trends in Computing, Evolution of Cloud

Computing, Evolution of Cloud Computing, Business Advantages, Components
Service Models: Software-as-a-Service(SaaS), Platform-as-a-Service (PaaS), Infrastructure-as-a-
Service (IaaS), Multi-cloud, Inter-cloud, Cloud Computing Service Management and Security,
Case studies: Open stack, Microsoft Azure, Amazon Elastic Compute Cloud (EC2)

Text Books:

S. No. Title Author(s) Publisher

Internet of Things: A Hands-On Vijay Madisetti, Orient Blackswan Private

1
Approach Arshdeep Bahga Limited - New Delhi
Fundamentals of Wireless Sensor Waltenegus Dargie,
2 Willey Publication
Networks: Theory and Practice Christian Poellabauer
Internet of Things with Arduino
3 Macro Schwar Packet Publishing Ltd
Cookbook

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 Subject Code
Computer Network L= T= P=2 Credits = 1
CS102591
ESE CT TA Total ESE Duration
Examination
100 20 30 150 3 Hours
Scheme
Minimum number of class tests to be conducted=02 Minimum Assignments=02

Course Objectives Course Outcomes

On completion of this course the student will be able to
To Provide students the basic knowledge of
setup and configure various networking hardware and
Computer Networking, tools used, their purpose
software. They will also be able to identify the basic
and their connectivity based on requirements.
faults and can resolve.

List of experiments to be conducted in Computer Network Lab.

Prerequisite
1. Introduction to cables, connectors and topologies.
2. Demonstration of Switch, Hub, Router and their uses and types.
3. Installation of UTP, Co-axial cable, Cross cable, parallel cable.
4. Case Study of Ethernet (10base5, 10base2, 10 base T)
5. Case Study of various Wireless technologies available.
Experiments
1. Basic network command and Network configuration commands like ping, netstat, hostname,
nslookup, route, arp, tracert, ipconfig, ARP etc.
2. To enable secured / unsecured file sharing, device sharing over network.
3. Installation and working of Remote Desktop and other third party related software’s.
4. To setup IP and other values avoiding DHCP.
5. Use of Subnet mask to create two or more different logical network in same lab.
6. Installation and working with IIS Server.
7. Basic Configuration of Home Router/Modem
8. Introduction to Server administration.
9. Basic Chat Program in Java using TCP.
10. Basic Chat Program in Java using UDP.

Text Books:

S.No. Title Author(s) Publisher

1 Data Communications and Networking Behrouz A. Forouzan Third Edition TMH

Computer Networking: A Top-Down James F. Kurose and Pearson Education, Third

2
Approach Featuring the Internet Keith W. Ross edition, 2006

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 Subject Code
Internet of Things Lab L= T= P= Credits =
CS102593
ESE CT TA Total ESE Duration
Examination
25 - 25 50
Scheme
Minimum number of class tests to be conducted = Minimum Assignments =

Course Objectives Course Outcomes

On successful completion of the course, the student

The objective of this course is will be able to:

 To understand Concepts, design and CO1. Students will familiar with the concepts of
characteristics of IoT. Internet of Things.
 To understand Architecture of IoT. CO2. Students will familiar with IoT Architecture
 To understand basic protocols of IoTs. CO3. Students will ready to Analyze basic
 To understand challenges and protocols in wireless sensor network
applications of IoTs. CO4. Students will be capable to design IoT
 To develop IoT applications using applications in different domain and be able
Tools. to analyze their performance
CO5. Capable to implement basic IoT
applications on embedded platform

Note: Students need to perform at least 10 experiments. Use of sensors and actuators are not
restricted as provided. Student may use any other components also.

1. Introduction to various sensors and actuators.

a) PIR Motion Sensor. g) RFID Sensor.
b) Rain Drop Sensor. h) Ultrasonic Sensor.
c) Moisture Sensor. i) Bluetooth Module.
d) Temperature Sensor. j) Wi-Fi Module.
e) Touch Sensor. k) LED/OLED
f) Infrared Sensor. l) Servo Motor.
2. Acquaintance with NodeMCU and perform essential programming establishment.
3. Connect LED/Buzzer with NodeMCU and compose a program to turn ON LED for 1 sec later
at regular intervals.
4. Perform Experiment to use NodeMCU ESP8266 as HTTP Server using WiFi Access Point
(AP) mode .
5. Perform Experiment for Controlling LED through an HTTP page Using NodeMCU Station

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 Mode (STA).
6. Interact with DHT11 sensor with NodeMCU and compose a program to print temperature and
humidity readings on screen.
7. Communicate OLED with NodeMCU and compose a program to print temperature and
moisture readings on it.
8. Communicate Bluetooth with Arduino/ NodeMCU and compose a program to send sensor
information to cell phone utilizing Bluetooth.
9. Connect Bluetooth with Arduino/ NodeMCU and compose a program to turn LED ON/OFF
when '1'/'0' is sent from cell phone utilizing Bluetooth.
10. Compose a program on NodeMCU to transfer temperature and stickiness information to
thingspeak,Blynk or any other free cloud.
11. Compose a program on NodeMCU to fetch temperature and moistness information from
thingspeak cloud and display it using OLED.
12. Creating a webpage and display the values received from sensors through NodeMCU.
13. Study of other IoT Boards and components available. (Student Activity).

Text Books:

S. No. Title Author(s) Publisher

Internet of Things: A Hands-On Vijay Madisetti, Orient Blackswan

1
Approach Arshdeep Bahga Private Limited - Delhi
Fundamentals of Wireless Sensor Waltenegus Dargie,
2 Willey Publication
Networks: Theory and Practice Christian Poellabauer
Internet of Things with Arduino
3 Macro Schwar Packet Publishing Ltd
Cookbook

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 Subject Code Statistical Foundation for Data
L=3 T= P=0 Credits = 2
CS102521 Science
ESE CT TA Total ESE Duration
Examination
100 20 30 150 3 Hours
Scheme
Minimum number of class tests to be conducted=02 Minimum Assignments=02

Course Objectives Course Outcomes

On successful completion of the course, the

The objective of the course is aimed learn the student will be able to:
probability distributions and density
CO1: Implement statistical analysis techniques for
estimations to perform analysis of various
solving practical problems.
kinds of data. Also to explore the statistical
analysis techniques using Python and R CO2: Apply statistical analysis on variety of data.
programming languages. CO3: Perform multi-dimensional scaling.
CO4: Perform appropriate statistical tests using R.
CO5: Analyze data using python

UNIT I [CO1]
Probability Theory: Sample Spaces-Events-Axioms–Counting–Conditional Probability and Bayes’
Theorem, The Binomial Theorem – Random variable and distributions : Mean and Variance of a
Random variable, Binomial-Poisson-Exponential and Normal distributions. Curve Fitting and
Principles of Least Squares Regression and correlation. (7Hrs)

UNIT II [CO2]
Sampling Distributions & Descriptive Statistics: The Central Limit Theorem, distributions of the
sample mean and the sample variance for a normal population, Sampling distributions (Chi Square, t,
F, z).Test of Hypothesis-Testing for Attributes. (7Hr)

UNIT III [CO3]

Statistical Tests: Mean of Normal Population – One-tailed and two-tailed tests, F-test and Chi-square
test Analysis of variance ANOVA–One way and two way classifications. Tabular data- Power and the
computation of sample size- Advanced data handling-Multiple regression Linear models- Logistic
regression-Rates and Poisson regression-Nonlinear curve fitting. (7Hrs)

UNIT IV [CO4]
Density Estimation: Recursive Partitioning- Smoothers and Generalized Additive Models- Survivals
Analysis Analyzing Longitudinal Data- Simultaneous Inference and Multiple Comparisons Meta-
Analysis- Principal Component Analysis-Multi dimensional Scaling-Cluster Analysis. (7Hrs)

UNIT V [CO5]
Introduction to R: Packages- Scientific Calculator- Inspecting Variables- Vectors-Matrices and
Arrays- Lists and Data Frames- Functions- Strings and Factors- Flow Control and Loops- Advanced

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
Looping- Date and Times. Introduction to Python-Packages-Fundamentals of Python Inserting and
Exporting Data-Data Cleansing-Checking and Filling Missing Data-Merging Data-Operations-Joins.
(8Hrs)

Text Books:
S.No. Title Author(s) Publisher
Introduction to Probability and
Academic Press
1 Statistics for Engineers and Sheldon M. Ross
Scientists
Springer Media Science
2 Introductory statistics with R Dalgaard, Peter
& Business
A Handbook of Statistical Analysis Apple Academic Press
3 Brain S.Everitt
Using R
4 Mastering Python for Data Science Samir Madhavan Packt

Reference Books:
S. No. Title Author(s) Publisher

1 R Cook book Paul Teetor O’Reilly

2 Learning R Richard Cotton O’Reilly

3 Learning Python Mark Lutz O’Reilly

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 Subject Code
Biometrics L=3 T= P=0 Credits = 2
CS102522
ESE CT TA Total ESE Duration
Examination
100 20 30 150 3 Hours
Scheme
Minimum number of class tests to be conducted=02 Minimum Assignments=02

Course Objectives Course Outcomes

On successful completion of the course, the

student will be able to:

1. Understand the basic definition of ‘Biometric

Recognition’ and the distinctive of this form of
biometrics.
The basic objective in offering this course is to 2. Be able to state precisely what functions these
study the state-of-the-art in biometrics systems perform.
technology can explore the way to improve the 3. Be able to draw a system-level diagram for any
current technology. The students can learn and biometric system and discuss its components.
implement various biometrics technologies using 4. Be able to solve verification, identification, and
advanced algorithm. synthesis problems for a variety of biometrics such as
fingerprint, face, iris, hand gestures and cryptography.
5. Be able to use the biometrics ingredients of existing
system to obtain a given security goal.
6. Judge the appropriateness of proposal in research
papers for a given applications.
7. Be able to design a biometric solution for a given
application.

Unit I: Introduction of Biometrics Biometrics: definition, history, basic working architecture, types;
Performance measures of biometrics; applications and benefits of biometrics; design of biometrics; biometric
identification versus verification.

Unit II: Face and Iris Biometrics Background of face and iris recognition; Face recognition methods: Eigen
face methods, contractive transformation method; Challenges of face biometrics; Design of iris biometrics:
image segmentation, image preprocessing, determination of iris region; Advantages and disadvantages of face
and iris biometrics.

Unit III: Fingerprint and Sign Language BiometricsFingerprint matching: image acquisition, image
enhancement and segmentation, image binarization, minutiaeextraction and matching; Sign language
biometrics: Indian sign language (ISL) biometrics, SIFT algorithm, advantages and disadvantages of ISL and
fingerprint biometrics.

Unit IV: Biometric Cryptography and Privacy Enhancement Introduction to biometric cryptography;
general purpose cryptosystems; Cryptographic algorithms: DES and RSA; Privacy concerns and issues related
to biometrics; biometrics with privacy enhancement; soft biometrics; comparison of various biometrics; Identity

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
and privacy.

Unit V: Scope of Biometrics and Biometric Standards Multimodal biometrics: basic architecture and fusion
scheme, application, example of AADHAAR; scope and future market of biometrics; role of biometrics in
enterprise and border security; DNA biometrics; biometric standards; biometric APIs.

Text Books:
S.No. Title Author(s) Publisher
Dr G R Sinha and
1 Biometrics: concepts and applications Wiley India Publications
Sandeep B. Patil
Anil K Jain, Arun Ross
2 Introduction to biometrics Springer
and Karthik Nandakumar
Samir nanawati, Michael
Biometrics Identity verification in a
3 Thieme and Raj US edition of Wiley India
networked world
Nanawati

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
 Subject Code Cryptography & Network
L=2 T=1 P=0 Credits = 3
CS102524 Security
ESE CT TA Total ESE Duration
Examination
100 20 30 150 3 Hours
Scheme
Minimum number of class tests to be conducted=02 Minimum Assignments=02

Course Objectives Course Outcomes

 Explain the objectives of information

security, importance and application of
each of confidentiality, integrity,
authentication and availability. On successful completion of the course, the student
 Understand various cryptographic will be able to:
algorithms.  Student will be able to understand basic
 Understand the basic categories of cryptographic algorithms, message.
threats to computers and networks.  Student will be able to understand web
 Describe public-key cryptosystem and authentication and security issues.
enhancements made to IPv4 by IPSec.  Ability to identify information system
 Understand Intrusions and intrusion requirements for both of them such as client
detection. and server.
 Discuss the fundamental ideas of public-  Ability to understand the current legal
key cryptography and Web security and issues towards information security.
Firewalls.
 Generate and distribute a PGP key pair
and use the PGP package to send an
encrypted email message.

UNIT – I Security Concepts: Introduction, The need for security, Security approaches, Principles of
security, Types of Security attacks, Security services, Security Mechanisms.
Cryptography Concepts and Techniques: Introduction, plain text and cipher text, substitution
techniques, transposition techniques, encryption and decryption, symmetric and asymmetric key
cryptography, possible types of attacks.

UNIT – II Symmetric key Ciphers: Block Cipher principles, DES, AES, Blowfish, RC5, IDEA,
Block cipher operation, Stream ciphers, RC4.
Asymmetric key Ciphers: Principles of public key cryptosystems, RSA algorithm, Diffie-Hellman
Key Exchange, Knapsack Algorithm.

UNIT – III Cryptographic Hash Functions: Message Authentication, Secure Hash Algorithm
(SHA-512).
Message authentication codes: Authentication requirements, HMAC, CMAC, Digital signatures.
Key Management and Distribution: Symmetric Key Distribution Using Symmetric & Asymmetric
Encryption, Distribution of Public Keys, Kerberos, Public – Key Infrastructure.

UNIT – IV Transport-level Security: Web security considerations, Secure Socket Layer and
Transport Layer Security, HTTPS, Secure Shell (SSH).
Wireless Network Security: Wireless Security, Mobile Device Security, IEEE 802.11 Wireless LAN,

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards
IEEE 802.11i Wireless LAN Security.

UNIT – V E-Mail Security: Pretty Good Privacy, S/MIME, MIME

IP Security: IP Security overview, IP Security architecture, Authentication Header, combining
security associations, Internet Key Exchange
Web Security: TLS, SSL etc. , Secure Electronic Set (SET), Firewalls & its Types, Introduction to
IDPS; Risk Management; Security Planning.

Text Books:

S.No. Title Author(s) Publisher

Cryptography and Network

Pearson Education, 6th
1 Security - Principles and William Stallings
Edition
Practice
Cryptography and Network Mc Graw Hill, 3rd
2 Atul Kahate
Security Edition

Reference Books:

S. No. Title Author(s) Publisher

C K Shyamala, N
1 Cryptography and Network Security Harini, Dr T R Wiley India, 1st Edition.
Padmanabhan

Forouzan Mc Graw Hill, 3rd

2 Cryptography and Network Security
Mukhopadhyay Edition

Information Security Principles, and

3 Mark Stamp Wiley India
Practice

WM. Arthur Conklin,

4 Principles of Computer Security
Greg White

5 Introduction to Network Security Neal Krawetz CENGAGE Learning

6 Network Security and Cryptography Bernard Menezes CENGAGE Learning

1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2021-22 Onwards