Scheme of Study &syllabi: Be Cse

SCHEME OF STUDY
&SYLLABI
BE CSE
Batch 2016 – 2020 & 2017-2020 LEET
(With Specializations)
SCHEME (2016-2020) B.E. CSE
7th semester/4th year
Hours Per Marks Credits

S.NO SUBJECT CODE SUBJECT NAME Week
L T P INT EXT Total
1 **O-4** Open Elective-II 3 0 0 40 60 100 3
2 CS*-4** ELECTIVE-I 3 0 0 40 60 100 3
3 CS*-4** ELECTIVE-II 3 0 0 40 60 100 3
4 CS*-4** ELECTIVE-I LAB 0 0 2 60 40 100 1
5 CS*-4** ELECTIVE-II LAB 0 0 2 60 40 100 1
6 CST-434 Technical Training 0 2 0 40 60 100 1
7 CSR-435 Project 0 0 1 60 40 100 3
Industrial Summer
8 CSI-436
Training*
0 0 0 60 40 100 2
Total 9 2 5 17
For 7th Semester
Subject Code Open Elective-II
CSO-445 Cryptography & Network Security
CSO-446 Network Operating System
CSO-447 Ethical Hacking
CSO-448 Natural Language Processing

ELECTIVES-Computational Intelligence
Electives Subject Code Subject Name
CSA-401 Machine Learning
CSA-402 Soft Computing
CSA-403 Artificial Neural Network
CSA-404 Fuzzy Logic

Elective I-II
CSA-405 Machine Learning Lab
CSA-406 Soft Computing Lab
CSA-407 Artificial Neural Network Lab
CSA-408 Fuzzy Logic Lab
CSA -461 Real Time Systems
CSA -462 Genetic Algorithm
CSA -463 Information Retrieval
CSA -464 High Performance Computing Architecture

Elective III-IV
CSA-465 Real Time Systems Lab
CSA-466 Genetic Algorithm Lab
CSA-467 Information Retrieval Lab
CSA-468 High Performance Computing Architecture Lab

ELECTIVES-Image Processing
Electives Subject Code Subject Name
CSB-411 Machine Learning
CSB -412 Digital Image Processing
CSB -413 Pattern Recognition
CSB -414 Steganography

Elective I-II
CSB -415 Machine Learning Lab
CSB -416 Digital Image Processing Lab
CSB -417 Pattern Recognition Lab
CSB -418 Steganography Lab
CSB-471 Bioinformatics
CSB -472 Medical imaging Processing
CSB -473 Data Compression
CSB -474 Text Mining

Elective III-IV
CSB-475 Bioinformatics Lab
CSB-476 Medical imaging Processing Lab
CSB-477 Data Compression lab
CSB-478 Text Mining Lab

ELECTIVES-Information Security
Subject
Electives Code Subject Name
CSC-421 Introduction to Information Security
CSC -422 Applied Cryptography
CSC -423 Network Programming
CSC -424 Secured Network Protocols

Elective I-II
CSC -425 Introduction to Information Security Lab
CSC -426 Applied Cryptography Lab
CSC -427 Network Programming Lab
CSC -428 Secured Network Protocols Lab
CSC- 481 Web Service Security
CSC -482 Mobile Application & Security
CSC-483 Securing Windows and Linux
CSC-484 Big Data

Elective III-IV
CSC-485 Web Service Security Lab
CSC-486 Mobile Application & Security Lab
CSC-487 Securing Windows and Linux Lab
CSC-488 Big Data Lab

Chandigarh University, Gharuan
Cryptography & Network Security L T P C
Total Contact Hours : 45Hours

Subject Code
Common to all Specializations of CSE 4th 3 0 0 3
CSO-445
Year
Prerequisite: Knowledge of Security concepts
Marks-100
Internal-60 External-40
Course Objectives
 Study attacks and security trends

 Study DES and RSA
 Understanding concepts for authentication and system security
Unit Course Outcome
Get the knowledge of network security tools, applications, concepts of public key
I encryption, number theory, authentication and Hash functions.
II Understand the principles of encryption algorithms; conventional and public key

cryptography
Understand the structure of a security analysis/ security proof of a cryptographic
III primitive and network security protocol.
Contents of the Syllabus
UNIT-I [15h]
Security trends – Attacks and services – Classical crypto systems – Different types of ciphers –
LFSR sequences – Basic Number theory – Congruences – Chinese Remainder theorem –
Modular exponentiation – Fermat and Euler's theorem – Legendre and Jacobi symbols – Finite
fields – continued fractions.
Simple DES – Differential cryptoanalysis – DES – Modes of operation – Triple DES – AES –
RC4 – RSA – Attacks – Primality test – factoring.
UNIT-II [15h]
Discrete Logarithms – Computing discrete logs – Diffie-Hellman key exchange – ElGamal

Public key cryptosystems – Hash functions – Secure Hash – Birthday attacks - MD5 – Digital
signatures – RSA – ElGamal – DSA.
UNIT-III [16h]
Authentication applications – Kerberos, X.509, PKI – Electronic Mail security – PGP,

S/MIME IP security – Web Security – SSL, TLS, SET.
System security – Intruders – Malicious software – viruses – Firewalls – Security Standards.
Text Books:
1. Wade Trappe, Lawrence C Washington, “ Introduction to Cryptography with coding
theory”, 2nd ed, Pearson, 2007.
2. William Stallings, “Crpyptography and Network security Principles and Practices”,
Pearson/PHI, 4th ed, 2006.
Reference Material:
1. W. Mao, “Modern Cryptography – Theory and Practice”, Pearson Education
2. Charles P. Pfleeger, Shari Lawrence Pfleeger – Security in computing Third Edition –

Prentice Hall of India
Instructions for the paper-setter
Please go through these instructions thoroughly and follow the same pattern while setting the paper as the
students have been prepared according to this format.
Maximum Marks = 60 Time: 3 Hrs
The syllabus has been divided into three equal units. The paper setter is required to set ten questions in
all, three questions from each unit and a compulsory question consisting of five sub parts and based on
the whole syllabus. The candidate will be required to attempt six questions including the compulsory
question number no 1 and not more than two questions from each unit.
Course Code-CSO-445 Cryptography & Network Security
Department Teaching
Department of Computer Science & Engineering
the Subject
Program Outcome a b c d E f g h i j k
Mapping of Course
I,II,
outcome with Program
III
outcome
BS ES PD PC PE OE Project/Training
Category

Approval Date of meeting of the Board of Studies
Network Operating System L T P C

Subject Code
CSO-446
Year
Prerequisite: Knowledge of various types of operating systems
Marks-100
Course Objectives
 This course is intended for students to experience on the technologies included in Network
Operating System.
 Gain in-depth knowledge of Windows Server 2008.
Unit Course Outcome
I Understanding the concept of networks
II Understand the concept of operating System

III Configuring Windows 2008 Server
UNIT-I [15h]
Data Communications Concepts: Digital and Analog signals, Parallel and Serial signals
Synchronous and Asynchronous, Simplex/Half/Pull Duplex and Multiplexing.
Introduction of Computer Networks: Description of LAN, WAN, MAN, PAN and Wireless
networks.
Basic terminology of Computer Networks: - Physical and Logical networks, Bridge, Switch,
Hub, Gateway, Routers, Repeaters, Modem, Network Interface Card, Physical Address/MAC
Address and Logical Address and IP Addressing and Subnet Mask.
Communication Channels: Telephone lines, Coaxial Cables, and Optical Fiber Transmission
Network Topologies: Bus Topology, Ring Topology, Star Topology, Hybrid Topology and
Mesh Topology
Reference Model:OSI Reference Model,TCP/IP reference model, Core protocols of TCP/IP,IP

routing,IP routers,Routing Tables.
UNIT-II [15h]
Introduction to DNS:DNS Architecture, Understanding the DNS Domain Namespace,DNS

domain name hierarchy, DNS and Internet domains,DNS delegation
Introduction to DHCP:Introduction to DHCP,DHCP Architecture, Benefits to DHCP,DHCP

Terminologies and DHCP Server Responsibility.
Introduction to RPC: Introduction to RPC,RPC Dependencies and Interaction,RPC

Architecture,RPC Component and RPC Processes and Interaction.
Introduction to operating System:Introduction to operating system,Types of operating

System:Mainframe,Desktop,Multiprocessor,Distributed,Clustered,Multiprogramming,Real
time,Embedded and Time Sharing
Operating System Components:Process Management Component,Memory Management

component,i/o Management component,File Management component,Protection System,and
Networking management component.
UNIT-III [15h]
Comparison of OS(Desktop,Server and Client), Hardware Requirement for OS(Desktop,Server

and client), Workgroups and Domains.
Installing windows server 2008: Plan for a server roles and installing windows server
core,configure server core,Add and configure server roles,add backup feature and migrate roles
from previous versions of windows server.
Configuring Windows Server 2008: Windows server registry,Control Panel,Delegate

administration,Add and removes feature in window server,initial configuration tasks,server
manager console,server manager wizards and windows power shell.
Text Books:
1. Windows Server 2008 Certifications – Death to the MCSE, Scott Skinger

2. MCITP: 5-in-1 Study System, Windows Server 2008 Enterprise Administrator, Mitch
Tullochwith the Windows Server Team at Microsoft
3. Introducing Windows Server 2008, Mitch Tulloch, ISBN-13: 978-0735624214
Reference Books:
1. MCTS Self Paced Training Kit (Exam 70 - 640): Configuring Windows Server 2008 Active
Directory, by Holme Dan.
Course Code-CSO-446 Network Operating System
Department Teaching
the Subject
Mapping of Course
I,II,
III
outcome
Category

Ethical Hacking L T P C

Subject Code
CSO-447 Year
Prerequisite: Knowledge about the network security and basic understanding of

hacking concepts
Marks-100
Course Objectives
 To understand how intruders escalate privileges.

 To understand Intrusion Detection, Policy Creation, Social Engineering, Buffer
Overflows and different types of Attacks and their protection mechanisms
 To learn about ethical laws and tests
Unit Course Outcome
Get the knowledge of network security tools, applications, concepts of public key
I encryption, number theory, authentication and Hash functions.
II Understand the concepts of data security
III Understand the laws for ethical hacking.
UNIT-I [14h]
ETHICAL HACKING : Types of Data Stolen From the Organizations, Elements of

Information Security, Authenticity and Non-Repudiation, Security Challenges, Effects of
Hacking, Hacker – Types of Hacker, Ethical Hacker, Hacktivism - Role of Security and
Penetration Tester, Penetration Testing Methodology, Networking & Computer Attacks –
Malicious Software (Malware), Protection Against Malware, Intruder Attacks on Networks and
Computers, Addressing Physical Security – Key Loggers and Back Doors.
FOOT PRINTING AND SOCIAL ENGINEERING : Web Tools for Foot Printing,
Conducting Competitive Intelligence, Google Hacking, Scanning, Enumeration, Trojans &
Backdoors, Virus & Worms, Proxy & Packet Filtering, Denial of Service, Sniffer, Social
Engineering – shoulder surfing, Dumpster Diving, Piggybacking.
UNIT-II [15h]
DATA SECURITY: Physical Security – Attacks and Protection, Steganography – Methods,

Attacks and Measures, Cryptography – Methods and Types of Attacks, Wireless Hacking,
Windows Hacking, Linux Hacking.
NETWORK PROTECTION SYSTEM & HACKING WEB SERVERS : Routers, Firewall

& Honeypots, IDS & IPS, Web Filtering, Vulnerability, Penetration Testing, Session Hijacking,
Web Server, SQL Injection, Cross Site Scripting, Exploit Writing, Buffer Overflow, Reverse
Engineering, Email Hacking, Incident Handling & Response, Bluetooth Hacking, Mobiles
Phone Hacking.
UNIT-III [16h]
ETHICAL HACKING LAWS AND TESTS: An introduction to the particular legal,

professional and ethical issues likely to face the domain of ethical hacking, ethical
responsibilities, professional integrity and making appropriate use of the tools and techniques
associated with ethical hacking – Social Engineering, Host Reconnaissance, Session Hijacking,
Hacking - Web Server, Database, Password Cracking, Network and Wireless, Trojan, Backdoor,
UNIX, LINUX, Microsoft, NOVEL Server, Buffer Overflow, Denial of Service Attack,
Methodical Penetration Testing.
Text Book:
1. Michael T. Simpson, Kent Backman, James E. “Corley, Hands‐On Ethical Hacking and
Network Defense”, Second Edition, CENGAGE Learning, 2010.
References Books:
1. Steven DeFino, Barry Kaufman, Nick Valenteen, “Official Certified Ethical Hacker Review
Guide”, CENGAGE Learning, 2009-11-01.
2. Patrick Engebretson, “The Basics of Hacking and Penetration Testing: Ethical Hacking and
Penetration Testing Made Easy”, Syngress Basics Series Elsevier, August 4, 2011.
3. Whitaker & Newman, “ Penetration Testing and Network Defense” , Cisco Press,
Indianapolis, IN, 2006
Course Code-CSO-447 Ethical Hacking
Department Teaching
the Subject
Mapping of Course
I,II,
III
outcome
Category

Natural Language Processing L T P C

Subject Code
CSO-448
Year
Prerequisite: Knowledge of fundamental algorithms and mathematical models
Marks-100
Course Objectives
 To provide the student with knowledge of various levels of analysis involved in NLP
 To understand language modeling
 To gain knowledge in automated natural language generation and machine translation
Unit Course Outcome
Knowledge of fundamental algorithms and mathematical models for processing natural

I language and how these can be used to solve practical problems.
II Understanding of language modeling

III Understanding in automated natural language generation and machine translation
UNIT-I [15h]
OVERVIEW AND LANGUAGE MODELING: Origins and challenges of NLP-Language and

Grammar-Processing Indian Languages-NLP Applications-Information Retrieval.
LANGUAGE MODELING: Introduction-Various Grammar-based Language Models-

Statistical Language Model.
WORD LEVEL AND SYNTACTIC ANALYSIS: Introduction- Regular Expressions-Finite-

State Automata-Morphological Parsing-Spelling Error Detection and correction-Words and
Word classes-Part-of Speech Tagging.
SYNTACTIC ANALYSIS: Introduction-Context-free Grammar-Constituency Parsing-
Probabilistic Parsing.
UNIT-II [14h]
SEMANTIC ANALYSIS: Introduction- Meaning Representation-Lexical Semantics

Ambiguity-Word Sense Disambiguation.
DISCOURSE PROCESSING: Introduction- cohesion-Reference Resolution Discourse

Coherence and Structure.
NATURAL LANGUAGE GENERATION: Introduction-Architecture of NLG Systems Tasks

and Representations-Application of NLG.
UNIT-III [16h]
MACHINE TRANSLATION: Introduction-Problems in Machine Translation Characteristics

of Indian Languages- Machine Translation Approaches-Translation involving Indian Languages.
INFORMATION RETRIEVAL: Introduction-Design features of Information Retrieval

Systems-Classical, Non-classical, Alternative Models of Information Retrieval Evaluation.
LEXICAL RESOURCES: Introduction-WordNet-FrameNet-Stemmers-POS Tagger Research

Corpora.
Text Book:
1. TanveerSiddiqui, U.S. Tiwary, “Natural Language Processing and Information Retrieval”,

Oxford University Press, 2008.
Reference Books:
1. Daniel Jurafsky and James H Martin, ”Speech and Language Processing: An introduction to
Natural Language Processing, Computational Linguistics and Speech Recognition”, Prentice
Hall, 2nd Edition, 2008.
2. James Allen, Bejamin/cummings, “Natural Language Understanding”, 2nd edition, 1995.

Course Code-CST-448 Natural Language Processing
Department Teaching
the Subject
Mapping of Course
I,II,
III
outcome
Category

Machine Learning L T P C

Subject Code
CSA-401 Year
Prerequisite:
 Familiarity with the basic probability theory
 Familiarity with the basic linear algebra
Marks-100
Course Objectives
 To formulate machine learning problems corresponding to different applications.

 To understand a range of machine learning algorithms along with their strengths and
weaknesses.
 To understand the basic theory underlying machine learning.
 To apply machine learning algorithms to solve problems of moderate complexity.
Unit Course Outcomes
I Understand different techniques like task oriented studies, cognitive studies
II Understand the contemporary techniques in machine learning
III Understand machine learning algorithms to solve various problems
UNIT-I [14h]
Machine Learning: Introduction and Concepts, Types of Machine learning, Introduction to Data
Analysis: The need for Data Analysis, Reign of Data Analysis, What we are going to achieve and Real
life examples , Exploratory Data Analysis.
Boolean Functions: Representation of Boolean algebra, Classes of Boolean Functions, DNF Functions,
CNF Functions, Decision Lists, Symmetric and Voting Functions, Linearly Separable Functions
Descriptive Statistics: Introduction to the Descriptive Statistics and inferential Statistics.
Supervised Learning with Regression and Classification techniques -1
Bias-Variance Dichotomy, Model Validation Approaches, and Classification: logistic regression,

Regression and Classification Trees, Support Vector Machines, Naive bay's, k-nearest neighbor
Regression: Linear regression, Ordinary Least Squares, Ridge Regression, Lasso Regression ,
confusion matrix, Roc Curve.
UNIT-II [15h]
Supervised Learning with Regression and Classification techniques -2: Ensemble Methods: Random
Forest, Neural Network, Deep learning
Decision Trees - Definitions - Representing concepts as decision trees. Recursive induction of decision
trees Supervised Learning of Univariate Decision Trees – Networks Equivalent to Decision Trees – Over
fitting and Evaluation - The Problem of Replicated Sub-trees..Picking the best splitting attribute: entropy
and information gain. Searching for simple trees and computational complexity. Occam’s razor. Over
fitting, noisy data, and pruning.
UNIT-III [16h]
Statistical Learning: Using Statistical Decision Theory, Background and General Method, Gaussian (or
Normal) Distributions, Conditionally Independent Binary Components.
Unsupervised Learning: Clustering Methods: K-means, Mean Shift Clustering, Density-Based Spatial
Clustering of Applications with Noise (DBSCAN), and Agglomerative Hierarchical Clustering.
Dimensionality Reduction Algorithm: Principal Component Analysis (PCA) ,Principal Component

Regression (PCR) , Partial Least Squares Regression (PLSR) , Linear Discriminant Analysis (LDA)
,Mixture Discriminant Analysis (MDA) ,Quadratic Discriminant Analysis (QDA) .
Association rule Learning: Apriori Algorithm

Text Books:
1. EthemAlpaydın, Introduction to Machine Learning (Adaptive Computation and Machine

Learning), MIT Press, 2004.
2. Mitchell. T, Machine Learning, McGraw Hill, 1997.
3. Nilsson, Nils J. "Introduction to machine learning: An early draft of a proposed textbook."
(1996).
Reference Material:
1. Christopher M. Bishop, Pattern Recognition and Machine Learning, Springer, 2006.

2. Ryszard S. Michalski, Jaime G. Carbonell, Tom M. Mitchell, MachineLearning: An Artificial
Intelligence Approach, Tioga Publishing Company, 1983.

Please go through these instructions thoroughly and follow the same pattern while setting the
paper as the students have been prepared according to this format.
The syllabus has been divided into three equal units. The paper setter is required to set ten
questions in all, three questions from each unit and a compulsory question consisting of five sub
parts and based on the whole syllabus. The candidate will be required to attempt six questions
including the compulsory question number no 1 and not more than two questions from each unit.
Course Code-CSA-
Machine Learning
401
Department
Teaching the Subject
Mapping of Course
I,II,
III
outcome
Category

Machine Learning Lab L T P C

Subject Code 0 0 2 1
Common to all Specializations of CSE 4th
CSA-405 Year
Prerequisite:
 Knowledge of basic computer science principles and skills, at a level
sufficient to write a reasonably non-trivial computer program.
Marks-100
Course Objectives

weaknesses.
Unit Course Outcome
I  To introduce students to the basic concepts and techniques of Machine Learning.
II  To develop skills of using recent machine learning software for solving practical
problems.
III To gain experience of doing independent study and research.
List of Experiments
UNIT-I
1. Implement Exploratory Data Analysis on any data set.

2. Implement Linear Regression on any data set.
3. Program to implement confusion Matrix and roc Curve
4. Implement Support Vector Machine on any data set and analyze the accuracy with
Logistic regression.
UNIT-II
5. Implement K-Nearest Neighbor on any data set

6. Implement Random Forest on any data set.
UNIT-III
7. Implement K-means clustering algorithm (cluster some sample data set into disjoint
clusters using K-means).
8. Implement Principle Component Analysis on any data set.
Course Code-CSA-405 Machine learning Lab
Department Teaching
Department of Computer Science and Engineering
the Subject
Mapping of Course
outcome
Category

SOFT COMPUTING L T P C
Subject Code Common to all Specializations of CSE 4th

Year
CSA-402 3 0 0 3
Prerequisite:
Knowledge of basic concepts of Fuzzy logic
and genetic algorithms
Marks-100
Course Objectives
 To understand soft computing concepts and techniques

 To understand GA
 To study the concepts of neural networks and fuzzy system
Unit Course Outcome
Get the knowledge of Soft Computing as Networks, Fuzzy Logic and Genetic
I
Algorithms and its Hybrid Applications
Understand hybrid nature of Soft Computing techniques to real world problems by

II extending the capabilities of existing technologies in more effective and efficient
manner
III Understand the Fuzzy logic and basic concept of Swarm intelligence
UNIT-I [15h]
Artificial Neural Network Introduction – Fundamental concept – Evolution of Neural Networks

– Basic Models of Artificial Neural Networks – Important Terminologies of ANNs –
McCulloch-Pitts Neuron –Linear Separability – Hebb Network. Supervised Learning Network:
Perceptron Networks –Adaline – Multiple Adaptive Linear Neurons – Back-Propagation
Network – Radial Basis Function Network. Associative Memory Networks: Training Algorithms
for Pattern Association – Autoassociative Memory Network – Heteroassociative Memory
Network – Bidirectional Associative Memory – Hopfield Networks – Iterative
AutoassociativeMemory Networks – Temporal AssociativeMemory Network. Unsupervised
Learning Networks: Fixed weight Competitive Nets –Kohonen Self-Organizing Feature Maps –
Learning Vector Quantization – Counter propagation Networks – Adaptive Resonance Theory
Networks – Special Networks.
UNIT-II [16h]
Fuzzy Set Theory: Introduction to Classical Sets and Fuzzy sets – Classical Relations and Fuzzy
Relations – Tolerance and Equivalence Relations – Non interactive Fuzzy sets – Membership
Functions: Fuzzification – Methods of Membership Value Assignments – Defuzzification –
Lambda-Cutsfor Fuzzy sets and Fuzzy Relations – Defuzzification Methods.
Fuzzy Arithmetic and Fuzzy Measures: Fuzzy Rule Base and Approximate Reasoning: Truth
values and Tables in Fuzzy logic – Fuzzy Propositions – Formation of Rules – Decomposition
and Aggregation of rules – Fuzzy Reasoning – Fuzzy Inference Systems (FIS) – Fuzzy Decision
Making – Fuzzy Logic Control Systems.
UNIT-II [16h]
Genetic Algorithm: Introduction – Basic Operators and Terminologies in GAs – Traditional

Algorithm vs. Genetic Algorithm – Simple GA – General Genetic Algorithm – The Scheme
Theorem – Classification of Genetic Algorithm – Holland Classifier Systems – Genetic
Programming. Applications of Soft Computing: A Fusion Approach of Multispectral Images
with SAR Image for Flood Area Analysis – Optimization of Travelling Salesman Problem using
Genetic Algorithm Approach.
Text Books:
1. S.N. Shivanandam, Principle of soft computing, Wiley. ISBN13: 9788126527410 (2011)
2. Jyh-Shing Roger Jang, Chuen-Tsai Sun, EijiMizutani, “Neuro-Fuzzy and Soft Computing”,
PrenticeHall of India, 2003.
3. George J. Klir and Bo Yuan, “Fuzzy Sets and Fuzzy Logic-Theory and Applications”, Prentice
Hall, 1995.
Reference Material
1. James A. Freeman and David M. Skapura, “Neural Networks Algorithms, Applications, and
Programming Techniques”, Pearson Edn., 2003.
2. Mitchell Melanie, “An Introduction to Genetic Algorithm”, Prentice Hall, 1998.
3. David E. Goldberg, Genetic Algorithms in Search, Optimization & Machine Learning, Addison
Wesley, 1997.

The syllabus has been divided into three equal units. The paper setter is required to set Ten
Course Code-CSA-402 SOFT COMPUTING
Department Teaching
the Subject
Mapping of Course
outcome
Category

Soft Computing Lab L T P C

CSA-406 Year
Prerequisite:
Marks-100
Course Objectives

weaknesses.
Unit Course Outcome
I  To introduce students to the basic concepts and techniques of soft computing
II  To develop skills of using fuzzy set theory
III To gain info about genetic theory.
List of Experiments
1)
a) Write a Matlab program (m.file) to calculate union, intersection, complement and difference
of two fuzzy sets.
b) Write a Matlab program (m.file) to calculate the Demorgan’s Law.
2) Find whether the given matrix is
(a) reflexive (b) tolerance and (c) transitivity matrix or not.
R=11000
11001
00100
00010
01001
by writing an M-file.
3) Find whether the given matrix is symmetry or not
R = 1 0.5 0.3 0.6 0
0.5 1 0.7 0.5 0.9
0.3 0.7 1 0.6 0
0.6 0.5 0.6 1 0.5
0 0.9 0 0.5 1
by a Matlab program.
4) Find the fuzzy relation between two vectors R and S
R = 0.7 0.5
0.8 0.4
S = 0.9 0.6 0.2
0.1 0.7 0.5
Using max–product and max-min method by a Matlab program
5)
(a) Use Matlab command line commands to display the Gaussian membership function. Given x
= 0–10 with increment of 0.1 and Gaussian function is defined between 0.5 and −5.
(b) Use Matlab command line commands to display the triangular membership function. Given
x = 0–10 with increment of 0.2 triangular membership function is defined between [3 4 5]
6) Illustrate different types of generalized bell membership functions using Matlab program
(7) Using Matlab program find the crisp lambda cut set relations for λ = 0.2, the fuzzy matrix is
given by R= 0.2 0.7 0.8 1
1 0.9 0.5 0.1
0 0.8 1 0.6
0 0.4 1 0.3
Course Code-CSA-406 Soft Computing Lab
Department Teaching
the Subject
Mapping of Course
outcome
Category

Artificial Neural Networks L T P C

Subject Code
CSA-403 Year
Prerequisite:
 Familiarity with the basic artificial modules.
 Familiarity with the basic neural network.
Marks-100
Course Objectives
1. To study basics of biological Neural Network.

2. To study basics of artificial Neural Network
3. To study applications of ANN
4. To study different pattern recognition task using ANN.
I Understand the basic concept of neural network, artificial neural network.
II Understand the different types of neural network.
III Understand the various application of ANN.
UNIT-I [14h]
Introduction to ANN- Features , structure and working of Biological Neural Network
Trends in Computing Comparison of BNN and ANN
Basics of Artificial Neural Networks - History of neural network research, characteristics of

neural networks terminology, models of neuron McCulloch – Pitts model, Perceptron, Adaline
model, Basic learning laws, Topology of neural network architecture
Backpropagation networks : (BPN) :Architecture of feed forward network, single layer ANN,
multilayer perceptron, back propagation learning, input - hidden and output layer computation,
backpropagation algorithm, applications, selection of tuning parameters in BPN, Numbers of
hidden nodes, learning.
UNIT-II [15h]
Activation & Synaptic Dynamics : Introduction, Activation Dynamics models, synaptic

Dynamics models, stability and convergence, recall in neural networks.
Basic functional units of ANN for pattern recognition tasks: Basic feedforward, Basic feed
back and basic competitive learning neural network. Pattern association, pattern classification
and pattern mapping tasks.
a) Feedforward neural networks –
- Linear responsibility X-OR problem and solution.
- Analysis of pattern mapping networks summary of basic gradient search methods.
b) Feed back neural networks Pattern storage networks, stochastic networks and simulated
annealing, Boltzmann machine and Boltzmann learning
UNIT-III [16h]
Competitive learning neural networks : Components of CL network pattern clustering and

feature mapping network, ART networks, Features of ART models, character recognition using
ART network.
Applications of ANN : Pattern classification – Recognition of Olympic games symbols,

Recognition of printed Characters. Neocognitron – Recognition of handwritten characters.
NET Talk: to convert English text to speech. Recognition of consonant vowel (CV) segments,
texture classification and segmentation
Text Books:
Sr. Title Author Publication Edition

No.
1 Artificial neural B. Yegnanarayana PHI --

Networks
2 Neural networks, Fuzzy S. Raj PHI --

logic and Genetic sekaran,VijayalakshmiPari
Algorithms
3 Neural Networks Satish Kumar -- --

Course Code-
Artificial Neural Network
CSA-403
Department
Mapping of Course
I,II,
III
outcome
Category

Artificial Neural Network Lab L T P C

CSA-407 Year
Prerequisite:
Marks-100
Course Objectives
 To formulate Artificial neural network

 To understand a range of neural network
Unit Course Outcome
I Understand the basic concept of neural network, artificial neural network.
II Understand the different types of neural network.
III Understand the various application of ANN.
List of Experiments
UNIT-I
Write a MATLAB program to plot a few activation functions that are being
1.
used in neural networks.
Generate ANDNOT function using McCulloch-Pitts neural net by a
2.
MATLAB program.
3. Generate XOR function using McCulloch-Pitts neuron.
Write a MATLAB program for perceptron net for an AND function with
4.
bipolar inputs and targets.
UNIT-II
With a suitable example simulate the perceptron learning network and

5. separate the boundaries. Plot the points assumed in the respective
quadrants using different symbols for identification.
With a suitable example demonstrate the perceptron learning law with its
6.
decision regions using MATLAB. Give the output in graphical form.
Write a MATLAB program to show Back Propagation Network for XOR
7.
function with Binary Input and Output.
Write a MATLAB program to show Back Propagation Network for XOR
8.
function with Bipolar Input and Output.
UNIT-III
Write a MATLAB program to recognize the number 0, 1, 2, 39. A 5 * 3

matrix forms the numbers. For any valid point it is taken as 1 and invalid
9. point it is taken as 0. The net has to be trained to recognize all the
numbers and when the test data is given, the network has to recognize the
particular numbers.
10. Write a MATLAB program to illustrate ART neural network.
Course Code-CSA-407 Artificial Neural Network Lab
Department Teaching
the Subject
Mapping of Course
outcome
Category

Fuzzy Logic L T P C

Subject Code
CSA-404 Year
Prerequisite:
 Familiarity with the basic fuzzy logic.
 Familiarity with the basic crisp logic.
Marks-100
Course Objectives
1) Understanding of the basic mathematical elements of the theory of fuzzy sets.

2) Provide an emphasis on the differences and similarities between fuzzy sets and classical
sets theories
3) Cover fuzzy logic inference with emphasis on their use in the design of intelligent or
humanistic systems.
4) Provide a brief introduction to fuzzy arithmetic concepts.
5) Provide an insight into fuzzy inference applications in the area of control and robotics.
I Understand the basic concept of Fuzzy logic.
II Understand the fuzzy set and classical set theories
III Understand the various application area of fuzziness.
UNIT-I [14h]
Introduction, Classical Sets and Fuzzy Sets: Background, Uncertainty and Imprecision,
Statistics and Random Processes, Uncertainty in Information, Fuzzy Sets and Membership,
Chance versus Ambiguity. Classical Sets - Operations on Classical Sets, Properties of Classical
(Crisp) Sets, Mapping of Classical Sets to Functions Fuzzy Sets - Fuzzy Set operations,
Properties of Fuzzy Sets. Sets as Points in Hypercubes
Classical Relations and Fuzzy Relations: Cartesian Product, Crisp Relations- Cardinality of
Crisp Relations, Operations on Crisp Relations, Properties of Crisp Relations, Composition.
Fuzzy Relations - Cardinality of Fuzzy Relations, Operations on Fuzzy Relations, Properties of
Fuzzy Relations, Fuzzy Cartesian Product and Composition, Non-interactive Fuzzy Sets.
Tolerance and Equivalence Relations - Crisp Equivalence Relation, Crisp Tolerance Relation,
Fuzzy Tolerance and Equivalence Relations. Value Assignments - Cosine Amplitude, Max-min
Method, Other Similarity methods.
Membership Functions: Features of the Membership Function, Standard Forms and

Boundaries, Fuzzification, Membership Value Assignments – Intuition, Inference, Rank
Ordering, Angular Fuzzy Sets, Neural Networks, Genetic Algorithms, Inductive Reasoning.
UNIT-II [15h]
Fuzzy-to-Crisp Conversions, Fuzzy Arithmetic: Lambda-Cuts for Fuzzy Sets, Lambda-Cuts

for Fuzzy Relations, Defuzzification Methods Extension Principle - Crisp Functions, Mapping
and Relations, Functions of fuzzy Sets – Extension Principle, Fuzzy Transform (Mapping),
Practical Considerations, Fuzzy Numbers Interval Analysis in Arithmetic, Approximate Methods
of Extension - Vertex method, DSW Algorithm, Restricted DSW Algorithm, Comparisons,
Fuzzy Vectors
Classical Logic and Fuzzy Logic: Classical Predicate Logic – Tautologies, Contradictions,
Equivalence, Exclusive OR and Exclusive NOR, Logical Proofs, Deductive Inferences. Fuzzy
Logic, Approximate Reasoning, Fuzzy Tautologies, Contradictions, Equivalence and Logical
Proofs, Other forms of the Implication Operation, Other forms of the Composition Operation
Fuzzy Rule- Based Systems: Natural Language, Linguistic Hedges, Rule-Based Systems -
Canonical Rule Forms, Decomposition of Compound Rules, Likelihood and Truth Qualification,
Aggregation of Fuzzy Rules, Graphical Techniques of Inference
UNIT-III [16h]
Fuzzy Decision Making: Fuzzy Synthetic Evaluation, Fuzzy Ordering, Preference and
consensus, Multiobjective Decision Making, Fuzzy Bayesian Decision Method, Decision
Making under Fuzzy States and Fuzzy Actions.
Fuzzy Classification: Classification by Equivalence Relations - Crisp Relations, Fuzzy

Relations. Cluster Analysis, Cluster Validity, c-Means Clustering - Hard c-Means (HCM), Fuzzy
c-Means (FCM). Classification Metric, Hardening the Fuzzy c-Partition, Similarity Relations
from Clustering
Text Books:
1. An Introduction to Fuzzy Control- D. Diankar, H. Hellendoom and M. Reinfrank-

Narosa Publishers India, 1996.
2. Fuzzy Sets Uncertainty and Information- G. J. Klir and T. A. Folger- PHI IEEE, 1995.
Reference Material:
1. Essentials of Fuzzy Modeling and Control- R. R. Yaser and D. P. Filer -John Wiley,
1994.
2. Fuzzy Logic With Engineering Applications- Timoty Ross,- McGraw Hill.
3. Fuzzy Logic Intelligence Control And Information- Yen- Pearson education.
Course Code-
Fuzzy Logic
CSA-404
Department
Mapping of Course
I,II,
III
outcome
Category

Fuzzy Logic Lab L T P C

CSA-408 Year
Prerequisite:
Marks-100
Course Objectives
1) Understanding of the basic mathematical elements of the theory of fuzzy sets.

2) Provide an emphasis on the differences and similarities between fuzzy sets and classical
sets theories
3) Cover fuzzy logic inference with emphasis on their use in the design of intelligent or
humanistic systems.
4) Provide a brief introduction to fuzzy arithmetic concepts.
 5) Provide an insight into fuzzy inference applications in the area of control and robotics.
Unit Course Outcome
I Understand the basic concept of Fuzzy logic.
II Understand the fuzzy set and classical set theories
III Understand the various application area of fuzziness.
List of Experiments
As per the theory syllabus per unit.
Course Code-CSA-408 Fuzzy Logic Lab
Department Teaching Department of Computer Science and Engineering

the Subject
Mapping of Course
outcome
Category

Digital Image Processing L T P C

Subject Code
Year
CSB-412
Prerequisite:
Knowledge of digital images and some of the basic operations (their basis,
implementation and consequences) in image processing and computer
vision.
Marks-100
Course Objectives
 To understand the basic concepts of image processing.

 To enhance knowledge about fundamental steps in image processing.
 To apply different image processing concepts to solve research problems.
Unit Course Outcome
Understand image formation and the role human visual system plays in perception of
I
gray and color image data
II Get broad exposure and understanding of various applications of image processing
III Get knowledge about signal processing algorithms and techniques in image
enhancement and image restoration
UNIT-I [17h]
Introduction: - Basic concept and origin, Examples of fields that use Digital Image Processing,
Fundamental steps in Digital Image Processing, Components of Image Processing System.
Digital Image Fundamentals:- Image Sensing and acquisition, digital image representation,
Image Sampling and Quantization, Some basic relationships between pixels.
Image Enhancement: - Introduction, Enhancement in spatial domain: Some basic gray level
transformations, Histogram processing, Basics of spatial filtering, Smoothing and sharpening
spatial filters. Enhancement in frequency domain: Fourier transform and filtering in frequency
domain, smoothing and sharpening frequency domain filters.
UNIT-II [14h]
Image Restoration:- Introduction, a model of the image degradation/ Restoration process.
Color Image Processing:- Color fundamentals, Color Models, Color Transformation.
Image Compression:- Redundancy and types of redundancy, Image compression models, Error
free compression, Lossy compression.
UNIT-III [13h]
Morphological Image Processing: - Introduction, Dilation and erosion, Opening and closing,
Some basic morphological algorithms.
Image Segmentation and Representation:- Introduction, Detection of discontinuities: point

detection, Line detection, edge detection. Edge linking and boundary detection, Thresholding,
region based segmentation. Boundary representation, Boundary and Regional Descriptors,
Relational Descriptors.
Text Books:
1. Gonzalez,R. C., Woods R. E. “Digital Image Processing”, Pearson Prentice Hall.

2. Jain, Kasturi and Schunk, “Machine Vision”, Tata McGraw Hill.
3. Gonzalez, R. C., Woods R. E., Eddins, S. L., “Digital Image Processing using MATLAB”,
Pearson Prentice Hall.
Reference Material:
1. Sonka, Hlavac and Boyle, “Image-processing, Analysis and Machine Vision”, Cengage
Learning.
2. Low,“Introductory Computer Vision and Image Processing”,Tata McGraw Hill.

Course Code-CSB-412 Digital Image Processing
Department Teaching
the Subject
Mapping of Course
I,II,
III
outcome
Category

Digital Image Processing Lab L T P C

Subject Code
CSB-416 Year
Prerequisite:
The labwork does entail programming in Matlab
Marks-100
Course Objectives
 To understand the basics of Digital Image Processing

 To understand the MATLAB tool
 To understand how to work with images
Unit Course Outcome
Acquire an appreciation for the image processing issues and techniques and be able to
I apply these techniques to real world problems. Be able to conduct independent study
and analysis of image processing problems and techniques
Get broad exposure and understanding of various applications of image processing in

II
industry, medicine, and defense.
Learn the signal processing algorithms and techniques in image enhancement and image
III
restoration
List of Experiments
UNIT-I
1. Write program to read and display digital image using MATLAB
 Become familiar with MATLAB Basic commands

 Read and display image in MATLAB
 Resize given image
 Convert given color image into gray-scale image
 Convert given color/gray-scale image into black & white image
 Draw image profile
 Separate color image in three R G & B planes
 Create color image using R, G and B three separate planes
 Write given 2-D data in image file
2. To write and execute image processing programs using pointprocessing method
 Obtain Negative image

 Obtain Flip image
 Thresholding
 Contrast stretching
3. To write and execute programs for image arithmetic operations
 Addition of two images

 Subtract one image from other image
 Calculate mean value of image
 Different Brightness by changing mean value
4. To write and execute programs for image logical operations
 AND operation between two images

 OR operation between two images
 Calculate intersection of two images
 Water Marking using EX-OR operation
 NOT operation (Negative image)
UNIT-II
5. To write a program for histogram calculation and equalization
 Standard MATLAB function

 Program without using standard MATLAB functions
 C Program
 Use Simulink to plot histogram of colour image
 6. To write and execute program for geometric transformation of image
 Translation
 Scaling
 Rotation
 Shrinking
 Zooming
7. To understand various image noise models and to write programs forimage restoration
 Remove Salt and Pepper Noise

 Minimize Gaussian noise
 Median filter and Weiner filter
8. Write and execute programs to remove noise using spatial filters
 Understand 1-D and 2-D convolution process

 Use 3x3 Mask for low pass filter and high pass filter
UNIT-III
9. Write and execute programs for image frequency domain filtering
 Apply FFT on given image

 Perform low pass and high pass filtering in frequency domain
 Apply IFFT to reconstruct image
10. Write a program in C and MATLAB for edge detection using different edge detection mask
11. Write and execute program for image morphological operations erosion and dilation.
12. To write and execute program for wavelet transform on given image and perform inverse
wavelet transform to reconstruct image.

Course Code-CSB-416 Digital Image Processing Lab
Department Teaching
the Subject
Mapping of Course
outcome
Category

Pattern Recognition L T P C

CSB-413 Year
Prerequisite:
 Basic understanding of differential and integral calculus, linear algebra
and probability theory
Marks-100
Course Objectives
 The various pattern recognition techniques and their applications

 Pattern features and Statistical techniques
 Cluster analysis and synthetic pattern recognition
 Feature extraction techniques and advances in the field
Unit Course Outcome
Understanding what is a pattern and various approaches to find it.

I
Statistical pattern recognition.
II Cluster analysis and syntactic pattern recognition
Feature extraction through NN and GA
III
Applications of Pattern recognition and its applications
UNIT-I [14h]
Introduction: Pattern and features – Training and learning in pattern recognition systems –
Pattern recognition approaches – Statistical pattern recognition – Syntactic pattern recognition –
Neural pattern recognition – Reasoning driven pattern recognition – Discriminant functions –
Linear and Fisher’s discriminant functions.
Statistical Pattern Recognition: Gaussian model – Supervised learning – Parametric estimation
– Maximum likelihood estimation – Bayesian parameter estimation – Perceptron algorithm –
LMSE algorithm – Problems with Bayes approach – Pattern classification by distance functions
– Maximum distance pattern classifier.
UNIT-II [15h]
Cluster Analysis: Unsupervised learning – Clustering for unsupervised learning and

classification – C-means algorithm – Hierarchical clustering procedures – Graph theoretic
approach to pattern clustering – Validity of clustering solutions.
Syntactic Pattern Recognition: Elements of formal grammar – String generation as
pattern description – Recognition of syntactic description – Parsing – Stochastic grammar and
applications – Graph based structural representation.
UNIT-III [8h]
Features Extraction and Recent Advances: Entropy minimization – Karhunen –Loeve

transformation – Neural network structures for pattern recognition –Unsupervised learning – Self
organizing networks – Fuzzy pattern classifiers – Genetic algorithms.
Application to pattern recognition.
Text Books:
1. Robert J, Schalkoff, “Pattern Recognition: Statistical, Structural and Neural Approaches”, John
Wiley & Sons Inc., New York.
Reference Material:
1. Duda R.O. and Hart P.E., “Pattern Classification and Scene Analysis”, John Wiley, New York.
2. Morton Nadler and Eric Smith P., “Pattern Recognition Engineering”, John Wiley and Sons,
New York.
3. Touand , Gonzalez R. “Patten Recognition Principles”Addision Wesley.
4. Earl Gose, Richard Johnsonbaugh, Steve Jost, “Pattern Recognition and Image Analysis”,
Prentice Hall of India Private Ltd., New Delhi
5. Duda R.O, Hart .P.E., D.G. Stal, “Pattern Classification”,John Wiley
6. SergiousTheodoridis, KonstantinosKoutroumbus, “Pattern Recognition”, Elsevier

Course Code-CSB-413 Pattern Recognition
Department Teaching
the Subject
Mapping of Course
I,II,
III
outcome
Category

Pattern Recognition Lab L T P C

Subject Code
CSB-417
Year
Prerequisite:
 Knowledge of Programming concepts or Matlab
Marks-100
Course Objectives
 To understand the basics of Pattern recognition

 To know how to extract features
 To work with different patterns
Unit Course Outcome
I
Design and implement certain important pattern recognition techniques.
II Design systems and algorithms for pattern recognition (signal classification), with focus
on sequences of patterns.
III Analyze classification problems probabilistically and estimate classifier performance.
List of Experiments
UNIT-I
1. Feature Representation
2. Mean and Covariance
3. Edge detection
UNIT-II
4. Linear Perceptron Learning

5. Generation of Random Variables
6. Bayesian Classification
UNIT-III
7. MLE: Learning the classifier from data

8. From 2-class to multiclass
9. Data Clustering: K-Means, MST-based
Course Code-CSB-417 Pattern Recognition Lab

Department Teaching
the Subject
Mapping of Course
outcome
Category

Steganography L T P C

Subject Code
CSB-414
Year
Prerequisite:
Basic knowledge of Information hiding concepts
Marks-100
Course Objectives
 To learn the basics of information hiding

 To learn various techniques of steganographic
 To learn how to extract the hidden information
 To study the various transformations.
Unit Course Outcome
I Need and techniques of information hiding

II Different stenographic techniques
Watermarking techniques and information protection.
III
Various kinds of transforms
UNIT-I [14h]
Introduction to Information Hiding: Technical Steganography, Linguistic Steganography,

Copy Right Enforcement, Wisdom from Cryptography Principles of Steganography: Framework
for Secret Communication, Security of Steganography System, Information Hiding in Noisy
Data , Adaptive versus non-Adaptive Algorithms, Active and Malicious Attackers, Information
hiding in Written Text.
A Survey of Steganographic Techniques: Substitution systems and Bit Plane Tools, Transform
Domain Techniques: - Spread Spectrum and Information hiding, Statistical Steganography,
Distortion Techniques, Cover Generation Techniques.
UNIT-II [15h]
Steganalysis: Looking for Signatures: - Extracting hidden Information, Disabling Hidden

Information.
Watermarking and Copyright Protection: Basic Watermarking, Watermarking Applications,

Requirements and Algorithmic Design Issues, Evaluation and Benchmarking of Watermarking
system.
UNIT-III [16h]
Transform Methods: Fourier Transformation, Fast Fourier Transformation, Discrete Cosine

Transformation, Mellin-Fourier Transformation, Wavelets, and Split Images in Perceptual
Bands.
Applications of Transformation in Steganography.
Text Books:
1. Katzendbisser, Petitcolas, " Information Hiding Techniques for Steganography and

Digital Watermarking", Artech House.
2. Peter Wayner, "Disappearing Cryptography: Information Hiding, Steganography and
Watermarking 2/e", Elsevier
Reference Material:
1. Bolle, Connell et. al., "Guide to Biometrics", Springer
The syllabus has been divided into three equal units. The paper setter is required to set Ten
Course Code-CSB-414 Steganography
Department Teaching
the Subject
Mapping of Course
I,II,
III
outcome
Category

Steganography Lab L T P C

CSB-418 Year
Prerequisite:
Knowledge of stegnographic techniques
Marks-100
Course Objectives
 To understand the basics of Stego images and cover images

 To work with different images and text files
 To learn how to hide the secret information behind the images.
Unit Course Outcome
I Techniques of information hiding

II Implementation of different stenographic techniques
III
Various kinds of transforms
List of Experiments
UNIT-I
10. Feature Representation

11. Mean and Covariance
12. Edge detection
UNIT-II
13. Linear Perceptron Learning

14. Generation of Random Variables
15. Bayesian Classification
UNIT-III
16. MLE: Learning the classifier from data

17. From 2-class to multiclass
18. Data Clustering: K-Means, MST-based
Course Code-CSB-418 Steganography Lab
Department Teaching
the Subject
Mapping of Course
outcome
Category

Introduction to Information Security L T P C

Subject Code
CSC-421 Year
Prerequisite: Knowledge of threats and various types of attacks to secure the

information
Marks-100
Course Objectives
 To study the basics of information security.

 To gain the knowledge about security threats and attacks.
Unit Course Outcome
Discuss the security issues network layer and transport layer

I
Apply security principles in the application layer
II Explain computer forensics and Use forensics tools
III Analyze and validate forensics data
UNIT-I [16h]
Essential terminology, Hardware, Software, Malware, Defining security, Need for security,
Cyber crime vs Computer based crime, Information Security statistics, Three pillars of Security,
Security myths, Identity of a Web Site, http vs https, Operating System fingerprinting, Hardening
operating system, updates, patches, CAN and CVEs, Host based firewall vs Network based
firewall, deploying firewall, sniffing network traffic.
UNIT-II [12h]
Recognizing Security Threats and attacks, Phishing and its countermeasures, Virus, Trojan
Horse, Worms, Spyware, Adware, Key logger, Social engineering, Denial of Service,
Spamming, Port Scanning, Password cracking, Security measures.
UNIT-III [17h]
Creating isolated network presence using virtualization, hosting different operating systems
virtually and networking amongst these, Identify website’s identity, Finding and understanding
CVEs, deploying firewall, Understanding phishing, using NMAP, netcat, using tcp
dump and wire shark, generating digital certificates, understanding CAs.
Text Books:
1. Atul Kahate, “Cryptography and Network Security” , Second Edition, McGrawHill, 2010.
Reference Material:
Course Code-CSC-421 Introduction to Information Security
Department Teaching
the Subject
Mapping of Course
I,II,
III
outcome
Category

Introduction to Information Security Lab L T P C
Subject Code Total Contact Hours : 45Hours

0 0 2 1
CSC-425 Common to all Specializations of CSE 4th Year
Prerequisite: Knowledge of Information security concepts and hacking
Marks-100
Course Objectives
 To understand the basic concept of security and their threats.

 To make students aware of the insecurity of default passwords, printed passwords and password
transmitted in plain text.
Unit Course Outcome
I Familiarization with network traffic and firewall
II Knowledge to simulate hacking and cracking methods

III Understand phishing concept using NMAP, NETCAP, using TCP dump and wire shark.
List of Experiments
UNIT I
1. Familiarization with information Security & write specifications of latest information

related security threats.
2. Installation Process of various operating systems.
3. Study of Host based firewall vs Network based firewall and deploying firewall.
4. Explain steps for sniffing network traffic.
UNIT-II
5. Implement and simulate Password cracking method.

6. Creation and explanation of Denial of Service.
UNIT III
7. List various step to identify website’s identity.

8. Understand phishing using NMAP, NETCAP, using TCP dump and wire shark.
9. Generating digital certificates and understanding CAs.
Course Code-CSC-425 Introduction to Information Security Lab
Department Teaching
the Subject
Mapping of Course
outcome
Category

Applied Cryptography L T P C

Subject Code
CSC-422
Year
Prerequisite: Knowledge of data hiding concepts
Marks-100
Course Objectives
 To study the basics of information security.

 To gain the knowledge about security threats and attacks.
Unit Course Outcome
I Compare various Cryptographic Techniques
II Design Secure applications
III Inject secure coding in the developed applications
UNIT-I [14h]
Foundations – Protocol Building Blocks - Basic Protocols - Intermediate Protocols – Advanced

Protocols - Zero-Knowledge Proofs - Zero-Knowledge Proofs of Identity -Blind Signatures -
Identity-Based Public-Key Cryptography - Oblivious Transfer - Oblivious Signatures – Esoteric
Protocols.
Key Length - Key Management - Electronic Codebook Mode - Block Replay - Cipher Block
Chaining Mode - Stream Ciphers - Self-Synchronizing Stream Ciphers - Cipher-Feedback Mode
- Synchronous Stream Ciphers - Output-Feedback Mode - Counter Mode - Choosing a Cipher
Mode - Interleaving - Block Ciphers versus Stream Ciphers - Choosing an Algorithm - Public-
Key Cryptography versus Symmetric Cryptography - Encrypting Communications Channels -
Encrypting Data for Storage - Hardware Encryption versus Software Encryption - Compression,
Encoding, and Encryption - Detecting Encryption – Hiding and Destroying Information.
UNIT-II [15h]
Information Theory - Complexity Theory - Number Theory - Factoring - Prime Number
Generation - Discrete Logarithms in a Finite Field - Data Encryption Standard (DES) – Lucifer -
Madryga - NewDES - GOST – 3 Way – Crab – RC5 - Double Encryption - Triple Encryption -
CDMF Key Shortening - Whitening.
Pseudo-Random-Sequence Generators and Stream Ciphers – RC4 - SEAL - Feedback with

Carry Shift Registers - Stream Ciphers Using FCSRs - Nonlinear-Feedback Shift Registers -
System-Theoretic Approach to Stream-Cipher Design - Complexity-Theoretic Approach to
Stream-Cipher Design - N- Hash - MD4 - MD5 - MD2.
UNIT-III [16h]
Secure Hash Algorithm (SHA) - One- Way Hash Functions Using Symmetric Block
Algorithms - Using Public-Key Algorithms - Message Authentication Codes.
RSA -Pohlig-Hellman - McEliece - Elliptic Curve Cryptosystems -Digital Signature Algorithm

(DSA) - Gost Digital Signature Algorithm - Discrete Logarithm Signature Schemes - Ongchnorr-
Shamir -Cellular Automata - Feige-Fiat-Shamir -Guillou-Quisquater - Diffie-Hellman - Station-
to-Station Protocol -Shamir’s Three-Pass Protocol - IBM Secret-Key Management Protocol -
MITRENET - Kerberos - IBM Common Cryptographic Architecture.
Text Books:
1. Bruce Schneier, “Applied Cryptography: Protocols, Algorithms, and Source Code in C” John Wiley &
Sons.
2. Wenbo Mao, “Modern Cryptography Theory and Practice”, Pearson Education.
Reference Material:
1. AtulKahate, “Cryptography and Network Security”, Tata McGraw Hill.
2. William Stallings, “Cryptography and Network Security”, 3rd Edition, Pearson Education,

Course Code-CSC-422 Applied Cryptography
Department Teaching
the Subject
Mapping of Course
I,II,
III
outcome
Category

Applied Cryptography Lab L T P C

0 0 2 1
Prerequisite: Understanding of cryptography and network security concepts
Marks-100
Course Objectives
 To have a fundamental understanding of the objectives of cryptography and network security.

 To become familiar with the cryptographic techniques those provide information and network
security.
 To be able to evaluate the security of communication systems, networks and protocols based on a
multitude of security metrics.
 To gain insights on the use of cryptography to build security and privacy properties into real-world
applications
 To gain expository and presentational skills to prepare and deliver technical reports.
Unit Course Outcome
Understand the security of communication systems, networks and protocols based on a multitude of
I security metrics.
II Understand the use of cryptography to build security and privacy properties into real world
applications
III Implementaion of various cryptographic techniques
List of Experiments
UNIT-I
1. Implementation of symmetric cipher algorithm (AES and RC4)

2. Random number generation using a subset of digits and alphabets.
3. Implementation of RSA based signature system
4. Implementation of Subset sum
UNIT-II
5. Authenticating the given signature using MD5 hash algorithm.
6. Implementation of Diffie-Hellman algorithm
7. Implementation EIGAMAL cryptosystem.
8. Implementation of Goldwasser-Micali probabilistic public key system
9. Implementation of Rabin Cryptosystem.
10. Implementation of Kerberos cryptosystem
11. Firewall implementation and testing.
UNIT-III
12. Implementation of a trusted secure web transaction.
13. Cryptographic Libraries-Sun JCE/Open SSL/Bouncy Castle JCE.
14. Digital Certificates and Hybrid (ASSY/SY) encryption, PKI.
15. Message Authentication Codes.
16. Elliptic Curve cryptosystems (Optional)
17. PKCS Standards (PKCS1, 5, 11, 12), Cipher modes.
Course Code-CSC-426 Applied Cryptography Lab
Department Teaching
the Subject
Mapping of Course
outcome
Category

Network Programming L T P C

Subject Code
CSC-423
Year
Prerequisite: Knowledge of programming
Marks-100
Course Objectives
 To gain knowledge about the ActiveX controls.

 To have the basic understanding of networks using TCP/IP.
 To understand the design considerations in building network applications.
Unit Course Outcome
I Different types of scripting
II ActiveX Documents
III Visual Basic 5 and 6 features of network programming
UNIT-I [16h]
Overview of ActiveX Scripting: Java Scripting- Stand-Alone Scripts- ActiveX Controls-

Creating ActiveX Controls.
ActiveX Documents: ActiveX Document Architecture- Creating ActiveX Documents.
UNIT-II [19h]
URL Monikers: Hyper linking- Hyperlink Interface- Working with URL Monikers- Overview
of ISAPI- ISAPI Extension- ISAPI Filter.
Designing IIS Applications: Building IIS Applications- Building Data Driven DHTML
Applications.
UNIT-III [10h]
ActiveX documents-technology-migration wizard-modifying code-launching and testing

document-testing the DLL.
Text Books:
1. John Paul Muller,” Visual C++ 5 from the GroundUp”, Tata McGraw Hill Edition.
2. Noel Jerke,” Visual Basic 6 (The Complete Reference)”, Tata McGraw Hill Edition.
Course Code-CSC-423 Network Programming
Department Teaching
the Subject
Mapping of Course
I,II,
III
outcome
Category

Network Programming Lab L T P C

0 0 2 1
Prerequisite: Knowledge of programming or any other tool
Marks-100
Course Objectives
 To impart a solid foundation of the state of the art trends in computer networking
 To provide a hands on experience of the same.
 To give an overarching insight to all arenas of networking.
 The simulation experiments are included to have familiarization of the architecture and internal
working of the tool and to equip the students with a free to use mindset afterwards.
Unit Course Outcome
I Understand the Active X controls
II Understand the design considerations in building network applications.

III Active X documents
List of Experiments
UNIT-I
1. Write a program using ActiveX Controls.

2. Program to illustrate use of OLE Server.
3. Program to illustrate use of OLE Container.
UNIT-II
4. Write a program to illustrate the working with URL Monikers.
5. Program to illustrate creation of an ISAPI Extension.
6. Program to illustrate creation of an ISAPI Filter.
UNIT-III
7. Building IIS Application.
8. Data- Driven DHTML Application.
9. ActiveX Documents.
Course Code-CSC-427 Network Programming Lab
Department Teaching
the Subject
Mapping of Course
outcome
Category

Secured Network Protocols L T P C

Subject Code
CSC-424
Year
Prerequisite: Basic knowledge of computer networks , OSI and TCP/IP.
Marks-100
Course Objectives
 To identify and explain the concepts, policies, and technologies associated with a layered
and diversified defense-in-depth strategy.
 To discuss the objectives of access control methods and describe how the available
methods are implemented in the defense of a network.
Unit Course Outcome
I Knowledge of different protocols and security loopholes.
II Network Security technologies and protocols
III Security of wireless networks
UNIT-I [16h]
OSI: ISO Layer Protocols:-Application Layer Protocols-TCP/IP, HTTP, SHTTP, LDAP, MIME,
POP & POP3-RMON-SNTP-SNMP. Presentation
Layer Protocols: Light Weight Presentation Protocol Session layer protocols –RPC protocols-
transport layer protocols- TOT, RDP, RUDP, TALI, TCP/UDP, compressed TCP.
Network layer
Protocols: routing protocols-border gateway protocol-exterior gateway protocol-internet
protocol IPv4- IPv6- Internet Message Control Protocol- IRDP- Transport Layer Security-TSL-
SSL-DTLS.
UNIT-II [15h]
Data Link layer Protocol: ARP – IPCP – IPv6CP – RARP – SLIP .Wide Area Network
Protocols- ATM protocols – Broadband Protocols – Point to Point Protocols – Other WAN
Protocols- security issues. Local
Area Network and LAN Protocols: ETHERNET Protocols – VLAN protocols – Wireless LAN
Protocols – Metropolitan Area Network Protocol – Storage Area Network and SAN Protocols -
FDMA, WIFI and WIMAX Protocols- security issues. Mobile IP – Mobile Support Protocol for
IPv4 and IPv6 – Resource Reservation Protocol.
Multi-casting Protocol: VGMP – IGMP – MSDP.
UNIT-III [14h]
Network Security and Technologies and Protocols: AAA Protocols – Tunneling Protocols –
Secured Routing Protocols – GRE- Generic Routing Encapsulation – IPSEC – Security
architecture for IP – IPSECAH – Authentication Header – ESP – IKE – ISAKMP and Key
management Protocol. IEEE 802.11 - Structure of 802.11 MAC – WEP- Problems with WEP –
Attacks and Risk- Station security – Access point Security – Gate way Security – Authentication
and Encryption.
IEEE 802.15 and Bluetooth: WPAN Communication Protocols – IEEE 802.16- IEEE
802.16A.WCDMA – Services – WCDMA Products – Networks- device addressing – System
Addressing – Radio Signaling Protocol – Multimedia Signaling Protocol.
Text Books:
1. Jawin, “Networks Protocols Handbook”, Jawin Technologies Inc., 2005.
2. Bruce Potter and Bob Fleck, “802.11 Security”, O’Reilly Publications, 2002.
3. Lawrence Harte, “Introduction to WCDMA”, Althos Publishing, 2004.
Reference Material:
1. Ralph Oppliger “SSL and TSL: Theory and Practice”, Arttech House, 2009.
2. Lawrence Harte, “Introduction to CDMA- Network services Technologies and Operations”, Althos
Publishing, 2004.
3. Lawrence Harte, “Introduction to WIMAX”, Althos Publishing, 2005.

Course Code-CSC-424 Secured Network Protocols

Department Teaching
the Subject
Mapping of Course
I,II,
III
outcome
Category

Secured Network ProtocolsLab L T P C

0 0 2 1
Prerequisite: Knowledge of OSI and TCP/IP and its protocols
Marks-100
Course Objectives
 To identify and explain the concepts, policies, and technologies associated with a layered and
diversified defense-in-depth strategy.
 To discuss the objectives of access control methods and describe how the available methods
are implemented in the defense of a network.
Unit Course Outcome
I Knowledge about implementation of various protocols
II Knowledge of network measurements

III Understanding of Zig Bee network
List of Experiments
UNIT-I
1. Experiment to get hands on experience on OPENLDAP

2. Configuration of FTP and Authentication in FTP
3. Installing SMTP server
4. Securing IIS
UNIT-II
5. Simulation of ARP / RARP.

6. Simulating a Wi-Fi Network
7. Measuring Network Performance
UNIT-III
8. Introduction to IEEE 802.15.4 and ZigBee

9. Nodes Configuration in ZigBee network.
10. Network Topologies used inZigBee network.
Course Code-CSC-428 Secured Network ProtocolsLab
Department Teaching
the Subject
Mapping of Course
outcome
Category

Project Lab L T P C
Subject Code Total Contact Hours : 45Hours th
0 0 1 3
CSR-435 Common to all Specializations of CSE 4 Year
Prerequisite: Knowledge of Software engineering and Databases
Marks-100
Course Objectives
The objective of the project is to enable the students to work on a project of latest topic /
research area / industrial applications preferably using the tool or language learnt in previous or
current semester. Each student shall have a guide who is a faculty member.

Implementation of Software development process on a particular real life
NA application.
Expertise and practice on latest tools and technologies.
CSP-435 Project Lab

Department Teaching
the Subject
a b c d e f g h i j k
Program Outcome
Mapping of Course
outcome
Project/
BS ES PD PC PE OE
Category Training
X
Approval Date of meeting of the Board of Studies……..

Scheme of Study &syllabi: Be Cse

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Scheme of Study &syllabi: Be Cse

Hochgeladen von

Copyright:

Verfügbare Formate

SCHEME OF STUDY

Hours Per Marks Credits

2 CS*-4** ELECTIVE-I 3 0 0 40 60 100 3

3 CS*-4** ELECTIVE-II 3 0 0 40 60 100 3

4 CS*-4** ELECTIVE-I LAB 0 0 2 60 40 100 1

5 CS*-4** ELECTIVE-II LAB 0 0 2 60 40 100 1

6 CST-434 Technical Training 0 2 0 40 60 100 1

7 CSR-435 Project 0 0 1 60 40 100 3

Subject Code Open Elective-II

CSO-445 Cryptography & Network Security

CSO-446 Network Operating System

CSO-447 Ethical Hacking

CSO-448 Natural Language Processing

CSA-401 Machine Learning

CSA-402 Soft Computing

CSA-403 Artificial Neural Network

CSA-404 Fuzzy Logic

CSA-406 Soft Computing Lab

CSA-407 Artificial Neural Network Lab

CSA-408 Fuzzy Logic Lab

CSA -461 Real Time Systems

CSA -462 Genetic Algorithm

CSA -463 Information Retrieval

CSA -464 High Performance Computing Architecture

CSA-466 Genetic Algorithm Lab

CSA-467 Information Retrieval Lab

CSA-468 High Performance Computing Architecture Lab

CSB-411 Machine Learning

CSB -412 Digital Image Processing

CSB -413 Pattern Recognition

CSB -414 Steganography

CSB -416 Digital Image Processing Lab

CSB -417 Pattern Recognition Lab

CSB -418 Steganography Lab

CSB -472 Medical imaging Processing

CSB -473 Data Compression

CSB -474 Text Mining

CSB-476 Medical imaging Processing Lab

CSB-477 Data Compression lab

CSB-478 Text Mining Lab

CSC-421 Introduction to Information Security

CSC -422 Applied Cryptography

CSC -423 Network Programming

CSC -424 Secured Network Protocols

CSC -426 Applied Cryptography Lab

CSC -427 Network Programming Lab

CSC -428 Secured Network Protocols Lab

CSC- 481 Web Service Security

CSC -482 Mobile Application & Security

CSC-483 Securing Windows and Linux

CSC-484 Big Data

CSC-486 Mobile Application & Security Lab

CSC-487 Securing Windows and Linux Lab

CSC-488 Big Data Lab

Total Contact Hours : 45Hours

Prerequisite: Knowledge of Security concepts

 Study attacks and security trends

Unit Course Outcome

II Understand the principles of encryption algorithms; conventional and public key

Contents of the Syllabus

Discrete Logarithms – Computing discrete logs – Diffie-Hellman key exchange – ElGamal

Authentication applications – Kerberos, X.509, PKI – Electronic Mail security – PGP,

System security – Intruders – Malicious software – viruses – Firewalls – Security Standards.