1

COURSE STRUCTURE & SYLLABUS

FOR

2-YEAR M.TECH

IN

COMPUTER SCIENCE AND

ENGINEERING WITH

SPECIALIZATION IN

INFORMATION SECURITY

Effective from (2017-2018) Academic

Sessions

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

INDIAN INSTITUTE OF TECHNOLOGY (INDIAN SCHOOL OF MINES)

DHANBAD- 826 004, JHARKHAND

2

I SEMESTER M.TECH - CSEIS

Course No. Name of the Courses L T P Credit

Hours

CSC51105 Mathematical Foundations of Computer

Science 3 1 0 7

CSC51108 Advanced Algorithms 3 1 0 7

CSC51109 Cryptography 3 1 0 7

CSE511xx Elective − I 3 1 0 7

CSE511xx Elective − II 3 1 0 7

CSC51210 Algorithms Lab 0 0 2 2

CSC51211 Computing Lab 0 0 2 2

Total 39

Contact

Hrs.

15 05 04 24

LIST OF SUBJECTS FOR ELECTIVE – I OF I SEMESTER M.TECH – CSEIS

Course No. Name L T P Credit

Hours

CSE51110 Information Security Management 3 1 0 7

CSE51130 Information Theory & Coding 3 1 0 7

CSE51131 Hardware Security 3 1 0 7

CSE51132 Quantum Information Processing 3 1 0 7

LIST OF SUBJECTS FOR ELECTIVE – II OF I SEMESTER M.TECH – CSEIS

Course No. Name L T P Credit

Hours

CSE51114 Data Mining 3 1 0 7

CSE51120 Pattern Recognition 3 1 0 7

CSE51121 Image and Video Processing 3 1 0 7

CSE51122 Internet of Things 3 1 0 7

CSE51123 VLSI Design 3 1 0 7

CSE51125 Information Retrieval 3 1 0 7

CSE51126 Algorithms for Bioinformatics 3 1 0 7

CSE51127 Modelling & Simulation 3 1 0 7

CSE51128 Data Analytics 3 1 0 7

CSE51129 Computational Number Theory 3 1 0 7

3

II SEMESTER M.TECH – CSEIS

Course No. Name of the Courses L T P Credit

Hours

CSC52104 Mobile and Wireless Network Security 3 1 0 7

CSC52107 High Performance Computer

Architecture

3 1 0 7

CSE521xx Elective − III 3 1 0 7

CSE521xx Elective − IV 3 1 0 7

CSE521xx Elective − V 3 1 0 7

CSC52204 Mobile and Wireless Network Security

Lab 0 0 2 2

CSC52501 Comprehensive Viva-voce 0 0 0 4

CSC52401 Seminar 0 0 0 2

Total 43

Contact Hrs. 15 05 02 22

LIST OF SUBJECTS FOR ELECTIVE – III OF II SEMESTER M.TECH – CSEIS

Course No. Name L T P Credit

Hours

CSE52116 Secure Web Services and e-Commerce 3 1 0 7

CSE52129 Multimedia Systems & Security 3 1 0 7

CSE52131 Cyber Security & Digital Forensics 3 1 0 7

CSE52132 Network Security 3 1 0 7

LIST OF SUBJECTS FOR ELECTIVE – IV & V OF II SEMESTER M.TECH – CSEIS

Course No. Name L T P Credit

Hours

CSE52101 Algorithmic Graph Theory 3 1 0 7

CSE52106 Interactive Computer Graphics 3 1 0 7

CSE52108 Soft Computing 3 1 0 7

CSE52110 Data Compression 3 1 0 7

CSE52111 Cloud Computing 3 1 0 7

CSE52121 Optimization Techniques 3 1 0 7

CSE52122 Software Testing 3 1 0 7

CSE52123 Machine Learning 3 1 0 7

CSE52124 Advanced DBMS 3 1 0 7

CSE52125 Natural Language Processing 3 1 0 7

CSE52126 CAD for VLSI 3 1 0 7

CSE52127 VLSI Testing & Verification 3 1 0 7

CSE52130 Distributed Operating Systems 3 1 0 7

4

III SEMESTER M.TECH – CSEIS

Course No. Name of the Courses L T P

Credit

Hours

CSC53901 Industrial Training/Minor Project 0 0 0 5

CSC53401 Seminar and Viva-voce on Industrial

Training/Minor Project

0 0 0 5

CSC53801 Dissertation (Interim) 0 0 0 15

CSC53402 Seminar and Viva-voce on

Dissertation

0 0 0 10

CSC53001 Teaching Assignment

Evaluation/Lab Development Works,

etc.

0 0 0 5

Total 40

IV SEMESTER M.TECH – CSEIS

Course No. Name of the Courses L T P

Credit

Hours

CSC54801 Dissertation 0 0 0 20

CSC54401 Seminar on Dissertation 0 0 0 5

CSC54501 Viva-voce on Dissertation 0 0 0 10

CSC54001 Teaching Assignment

Evaluation/Lab Development Works,

etc.

0 0 0 5

Total 40

5

COURSE DETAILS OF I SEMESTER M.TECH (CSE)

CSC51105 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 3-1-0

Linear and non-linear recurrence relations, Counting, Algebraic Structures: Group, Ring, Galois

Field, Primitive roots, Vector Space, Inner product space, Linear transformation: Matrices and

Determinants, Eigen values and eigen vectors, Canonical Form, Diagonalization, normal, unitary,

hermitian and skew-hermitian operators, quadratic forms, Spectral Decomposition theorem;

Congruence, Chinese Remainder theorem, Quadratic Residue, Legendre Symbol, Jacobi symbol;

Integer factorization, Discrete logarithms-Pohlig-Hellman method; Primality testing- Fermat test,

Euler test; Miller-Rabin test.

CSC51108 ADVANCED ALGORITHMS 3-1-0

Amortized Analysis, Dynamic programming: Assembly Line Scheduling, Graph Algorithms:

Topological Sorting, Strongly Connected Components, Single Source Shortest path in DAG, All

Pair Shortest Path Algorithm: Floyd Warshell, Johnson’s algorithm, Geometric algorithms:

Segment intersections using sweep line, Polynomials and FFT: Representation, DFT,

FFT(Recursive & Iterative), Parallel FFT Circuit Design, Number-theoretic algorithms: Euclid’s

algorithm, Modular arithmetic, Powers of an element using repeated squaring; String matching

algorithms: Naïve and Finite Automata approach, Rabin-Karp and Knuth-Morispratt algorithm,

Matrix operations: Linear equations solver, Approximation algorithms: Vertex Cover Problem

,Local Search Heuristics, Randomized Algorithms: Randomized quicksort, Parallel Algorithms,

kd-trees, Binomial and Fibonacci Heaps.

CSC51109 CRYPTOGRAPHY 3-1-0 Foundations and applications of modern cryptography, Secret-key and Public key cryptography,

One-way and trapdoor one-way functions, Block ciphers: Modes of operation, DES and its

variants, IDEA, SAFER, FEAL, Blowfish, AES, Linear and Differential Cryptanalysis; Stream

ciphers: stream ciphers based on linear feedback shift registers, SEAL; Message digest:

Properties of hash functions, MD2, MD5 and SHA-1 keyed hash functions, attacks on hash

functions; Public-key parameters: Modular arithmetic, GCD, Primality testing, Chinese remainder

theorem, modular square roots, finite fields, Elliptic Curve Cryptography, Intractable problems:

Integer factorization problem, Diffie-Hellman problem, Known algorithms for solving the

intractable problems; Public-key encryption: RSA, Rabin and El Gamal; Key exchange: Diffie-

Hellman and MQV algorithms; Digital signatures: RSA, DSA and NR signature schemes, Blind

and Undeniable signatures; Entity authentication: Passwords, challenge-response algorithms;

Zero-knowledge protocols.

CSC51210 ALGORITHMS LAB 0-0-2 Implementation of algorithms for Assembly line scheduling, Graph algorithms, String matching

algorithms, FFT algorithms, Geometric algorithms: Number-theoretic algorithms, Approximation

algorithms and implementation of Binomial heaps, Fibonacci heaps based on the course

“Advanced Algorithms”.

CSC51211 COMPUTING LAB 0-0-2 The practical classes is based on the problems related to all subjects (other than Advanced

Algorithms) covered during the semester.

6

LIST OF SUBJECTS FOR ELECTIVE-I OF I SEMESTER M.TECH – CSEIS

CSE51110 INFORMATION SECURITY MANAGEMENT 3-1-0 Introduction to security risk management, Reactive and proactive approaches, Risk assessment,

quantitative and qualitative approaches and asset classification; OCTAVE and COBIT security

assurance approaches; Network Security management, Firewalls, IDS and IPS configuration

management, Web and wireless security management; Information Security Management:

Information classification, Access control models, Role-based and lattice models; Technical

controls for authentication and confidentiality, Password management and key management for

users, Key Management in Organizations for different applications; Management of IT Security

Infrastructure; Computer security log management, Malware handling and Vulnerability

management, Specifying and enforcing security policies; Auditing and Business continuity

Planning: Introduction to information security audit and principles of audit. Business continuity

planning and disaster recovery; Backup and recovery techniques; Computer forensics: techniques

and tools. Audit Tools: NESSUS and NMAP; Information Security Standards and Compliance.

CSE51130 INFORMATION THEORY & CODING 3-1-0 Information Theory: Introduction, measure of Information, Mutual information, Joint and

coditional Entropy, Discrete memoryless Source(DMS), Channel capacity, Huffman encoding,

Arithmetic encoding, Lempel-Ziv encoding Coding Theory: Introduction, Error detection and

Correction, Binary Symmetric Channel(BSC), Linear block codes: Encoding and Decoding,

Parity and Generator matrices, Hamming Code, Tanner Graph, Low Density Parity Check Code

and its types, Cylic code: Generation and Decoding, Burst error detection and correction,

Syndrome calculation, Bose-Chaudhuri Hoeqenghem (BCH) codes and Reed-Solomon codes,

Convolution code, Code tree and state diagram, Turbo coding.

CSE51131 HARDWARE SECURITY 3-1-0 Overview of Different Issues of Hardware Security Preliminaries: Algebra of Finite Fields,

Basics of the Mathematical Theory of Public Key Cryptography, Basics of Digital Design on

Field-programmable Gate Array (FPGA), Classification using Support Vector Machines (SVMs)

Useful Hardware Security Primitives: Cryptographic Hardware and their Implementation,

Optimization of Cryptographic Hardware on FPGA, Physically Unclonable Functions (PUFs),

PUF Implementations, PUF Quality Evaluation, Design Techniques to Increase PUF Response

Quality Side-channel Attacks on Cryptographic Hardware: Basic Idea, Current-measurement

based Side-channel Attacks (Case Study: Kocher’s Attack on DES), Design Techniques to

Prevent Side-channel Attacks, Improved Side-channel Attack Algorithms (Template Attack, etc.),

Cache Attacks Testability and Verification of Cryptographic Hardware: Fault-tolerance of

Cryptographic Hardware, Fault Attacks, Verification of Finite-field Arithmetic Circuits Modern

IC Design and Manufacturing Practices and Their Implications: Hardware Intellectual Property

(IP) Piracy and IC Piracy, Design Techniques to Prevent IP and IC Piracy, Using PUFs to prevent

Hardware Piracy, Model Building Attacks on PUFs (Case Study: SVM Modeling of Arbiter

PUFs, Genetic Programming based Modeling of Ring Oscillator PUF) Hardware Trojans:

Hardware Trojan Nomenclature and Operating Modes, Countermeasures Such as Design and

Manufacturing Techniques to Prevent/Detect Hardware Trojans, Logic Testing and Side-channel

Analysis based Techniques for Trojan Detection, Techniques to Increase Testing Sensitivity

Infrastructure Security: Impact of Hardware Security Compromise on Public Infrastructure,

Defense Techniques (Case Study: Smart-Grid Security).

7

CSE51132 QUANTUM INFORMATION PROCESSING 3-1-0 Basic principles of classical and quantum mechanics, Quantum gates and circuits, Classical

computation versus quantum computation, Classical and quantum information theory,

teleportation, Dense coding, Wave functions and probabilities, Matrix representations,

Heisenberg Uncertainty Principle, Bell’s Inequality and non-locality, Qubits, Pure and mixed

states, Partial trace, Density matrix representation of quantum states, Von-Neumann entropy,

Quantum entanglement, Preparation of entangled states, Measures of entanglement, No-Go

theorems, Teleportation, Controlled teleportation, Fidelity, Dense coding, Quantum key

distribution, Quantum secret sharing, factoring and discrete logarithm.

LIST OF SUBJECTS FOR ELECTIVE-II OF I SEMESTER M.TECH – CSEIS

CSE51114 DATA MINING 3-1-0 Introduction: Data mining functionalities, classification and integration of a data mining system

with data warehouse system; Data preprocessing: data summarization, data cleaning, data

integration and transformation and data reduction; Data warehouse and OLAP Technology: a

multidimensional data model, data warehouse architecture, Data warehouse implementation, from

data warehousing to data mining; Mining Frequent Patterns; Associations and correlations:

efficient and scalable frequent item-set mining methods, mining various kinds of association

rules, constraints based association mining; Classification: Basic concepts and advanced

Methods, Clustering: Basic Concepts and advanced methods, Outlier Detection, Data mining

Trends and Research Frontiers: Mining Complex Data Types and Data Mining Applications, Data

mining and society.

CSE51120 PATTERN RECOGNITION 3-1-0 Introduction, probability distribution, linear models for regression, linear models for

classification, classifiers based on Bayes decision theory, linear and nonlinear classifiers, feature

selection, generation, dimensionality reduction, template matching, context dependent

classification, system evaluation, clustering, cluster validity, kernel methods, sparse kernel

methods, graphical methods, mixture model and EM.

CSE51121 IMAGE AND VIDEO PROCESSING 3-1-0 Introduction to Image Processing, Image Formats, Image Enhancement techniques in Spatial and

Spectral domain: Contrast Enhancement, Histogram Processing, Noise Smoothing, Sharpening,

Background Correction, Color Enhancement, Image Restoration, Motion Blur Removal,

Geometric Corrections, Image Segmentation. Multi-resolution techniques in image processing.

Feature and shape specific measurements and representation. Techniques for image compression

and coding. Introduction to document image processing, preparing document images, features in

document images, recognizing components of text documents and graphics documents, overview

of page segmentation techniques.

Introduction to Video Processing, Video Formats, Motion Detection and Estimation, Video

Enhancement and Restoration, Video Segmentation, Video Compression techniques and

standards.

CSE51122 INTERNET OF THINGS 3-1-0 Introduction to the Internet of Things: Elements of an IoT ecosystem, Technology drivers,

Business drivers, Typical IoT applications, Trends and implications; Sensors Nodes: Sensing

devices, Sensor modules, nodes and systems; Connectivity and Networks: Wireless technologies

8

for the IoT, Edge connectivity and protocols, Wireless Sensor Networks; Analytics and

Applications: Signal processing, real-time and local analytics, Databases, Cloud Analytics and

Applications; Industry Perspective: Business considerations, Legal challenges.

CSE51123 VLSI DESIGN 3-1-0 VLSI Design: Introduction to VLSI Design, MOS logic: nMOS, pMOS and CMOS, Electrical

characteristics, operation of MOS transistors as a switch and an amplifier, MOS inverter, stick

diagram, design rules and layout, delay analysis, different type of MOS circuits: Dynamic logic,

BiCMOS, pass transistors etc. CMOS process, Combinational logic cells, Sequential logic cells,

Datapath logic cells, I/O cells. ASIC Library Design: Transistors as Resistors and parasitic

Capacitance, Logical effort, gate array, standard cell and data path cell design. Introduction to

hardware description language (HDL) Verilog/VHDL. A logic synthesis example; Physical

design algorithms.

CSE51125 INFORMATION RETRIEVAL 3-1-0

Introduction: Basic IR system structure; Retreival techniques: Boolean retrieval, term-

vocabulary, postings-lists, Dictionaries; Inverted indices: Preprocessing steps, tokenization,

stemming, stopword removal, term weighting; Index Compression: Data Compression

Techniques, Huffman Coding, Arithmetic Coding, compressing posting lists; Models: vector

space model, probabilistic model, language models; Evaluation: standard test collection, concept

of relevance, precision-recall based metrics, reciprocal rank, DCG; Relevance feedback and

query expansion: Rocchio algorithm; Text classification: Naïve Bayes; Text clustering: Flat

Clustering, Hierarchical Clustering; XML Retrieval: Basic concepts, Challenges, Evaluation;

Web search: Structure of Web, web graph, Hidden Web, User intent, Web crawl. Link Analysis:

Web as a graph, PageRank, Hubs and Authorities; Social search: Community-based search

activities, Question Answering, Collaborative Searching.

CSE51126 ALGORITHMS FOR BIOINFORMATICS 3-1-0

Introduction to bioinformatics, biological sequence/structure, Genome Projects, Pattern

recognition and prediction, Folding problem, Sequence Analysis, Homology and analogy,

classical algorithms, exact matching problem, suffix trees, dynamic programming, fundamental

preprocessing , Boyer-Moore and Knuth-Morris-Pratt, keyword trees, linear-time construction of

suffix trees, Pairwise alignment, scoring model, dynamic programming algorithms, Hidden

Markov Models, Multiple sequence alignment, Motif finding, Secondary database searching,

Advanced topics in phylogenetic tree, Biological databases, Primary sequence databases, Protein

classification databases. DNA databases, Specialized Genomic Resources, Importance of DNA

analysis, Gene structure and DNA sequences, protein sequence and structure, gene expression

analysis using microarray data, EST searches.

CSE51127 MODELLING & SIMULATION 3-1-0

Systems, models, deterministic and stochastic systems, static and dynamic systems, discrete event

simulation, continuous simulation, Monte Carlo simulation, Time-advance mechanisms, event

modeling of discrete dynamic systems, event graphs, process oriented and event oriented

approaches, single-server single queue model, Program model, entities and transactions, blocks in

GPSS, user defined functions, SNA, logic switches, save locations, user chains, tabulation of

result, programming examples, Congruence generators, long period generators, statistical quality

measures of generators, uniformity and independence testing, chi-square and other hypotheses

9

testing, runs testing, random variable, probability density and distribution functions, Location,

scale and shape parameters, discrete and continuous probability distributions; Inverse transform

method, composition and acceptance-rejection methods, efficiency and quality measures of

generators; Input Modelling, selection of distribution for a random source, fitting distributions to

data, constructing empirical distributions from data, random process, discrete/continuous time

processes, Markovian property, Markov chain, state transition diagrams, birth-death process,

Little’s theorem, steady state analysis of M/M/1 model; multi-server models, M/G/1 and other

queuing models, Burke’s theorem, network of queues, Jackson theorem, SimEvent tool box in

MATLAB, general features of network simulation packages, case study of OMNET++/NetSim/

NS2/NS3.

CSE51128 DATA ANALYTICS 3-1-0 Introduction, Big Data, Overview of DBMS, R and RStudio, Regression Modeling, Multivariate

Analysis, Bayesian Modeling, Inference and Bayesian Networks, Support Vector and Kernel

Methods, Analysis of Time Series: Linear Systems Analysis, Nonlinear Dynamics, Decision

trees, Market Based Model, Apriori Algorithm, Handling Large Data Sets, Limited Pass

Algorithm, Clustering High Dimensional Data, Hadoop and HDFS, MapReduce, Hive, MapR,

Sharding, NoSQL Databases, Visualizations, Visual Data Analysis Techniques.

CSE51129 COMPUTATIONAL NUMBER THEORY 3-1-0 Divisibility and factorization: Properties, Division algorithm, Greatest integer function, Hensel

lifting, orders and primitive roots, integer and modular square roots, Prime Number Theorem,

Goldbach and Twin Primes conjectures, Fermat primes, Mersenne primes, Euler primes, Miller-

Robinson primes, GCD, Euclid's algorithm, LCM, Theorem of arithmetic, Euclid's Lemma,

Canonical prime factorization, Trial division, Baby-step-giant-step method, Pohlig-Hellman

method, index calculus methods, linear sieve method, Coppersmith's algorithm, Pollard rho

method, p-1 method, CFRAC method, quadratic sieve method, Fermat test, Miller-Rabin test,

Solovay-Strassen test, AKS test, Dirichlet's Theorem on primes in arithmetic progressions,

Modular arithmetic, Algebraic Structure-Groups, Ring, Field, Prime and extension fields,

representation of extension fields, polynomial basis, normal basis, optimal normal basis,

irreducible polynomials, GF(2n) polynomials, Generators; Congruence: Linear congruence in one

variable, Simultaneous linear congruence, CRT, Wilson theorem, Fermat’s theorem,

Pseudoprimes, Carmichael numbers; Arithmetic functions: Multiplicative functions, Moebius

function, Euler phi function, Perfect numbers, Legendre symbol, Jacobi symbol; Quadratic

residue: Quadratic congruence with primes and composites, Exponentiation and Logarithm;

Elliptic Curves: Curve over real numbers and GF(2n), Schoof's point counting algorithm,

Applications.

10

COURSE DETAILS OF II SEMESTER M.TECH (CSE)

CSC52104 MOBILE AND WIRELESS NETWORK SECURITY 3-1-0 Mobile and Wireless Communications: Overview, 1G -4G Cellular Systems, Radio Propagation

and Path-Loss, Cellular Communication Fundamentals, Multiple Access Techniques- FDD, TDD,

FDMA, TDMA, DS-CDMA, Spread Spectrum and CDMA, CSMA/CA, Network Routing

Protocols- DSDV, AODV, DSR, CGSR, Cellular Communication standards- GSM, IS-95

CDMA, 3G Systems. Wireless Security: Security and Privacy needs of Wireless System,

Challenges of Broadcast Communication and Security Requirements, TESLA Broadcast

Authentication, Instant Key Disclosure, Time Synchronization, Denial-of-Service Protection,

BiBa Signature Algorithm and Broadcast Authentication, Merkle Hash Trees for Ball

Authentication, Efficient Multicast Stream Signature (EMSS), MESS, HTSS, Wireless

Transmission Media, WLAN Standards, 802.11 Security, WEP Protocols, WAP Security

Architecture, Comparison of TCP/IP, OSI and WAP models, Security Aspects of Mobile

communications.

CSC52107 HIGH PERFORMANCE COMPUTER ARCHITECTURE 3-1-0

Introduction: Fundamental of Quantitative Design, Measuring Performance, Benchmark

Programs Instruction Level Parallelism (ILP): Pipelining, Pipeline Hazards, Advanced ILP:

Advanced Compiler and Hardware Techniques for ILP, Branch Prediction Techniques, Loop

Unrolling, Scoreboarding, Tomasula’s Algorithm, Hardware-Based Speculation, Multi-Issue

Processors: VLIW, Global Code Scheduling, Compiler Speculation, Classifying ILP Machines,

Superscalar and Superpiplined Architectures, and Limits on ILP. Data Level Parallelism: SIMD

Vector Architecture, Graphics Processing Units, Systolic Arrays. Interconnection networks,

Thread Level Parallelism: Multiprocessors: Introduction Symmetric and Distributed Shared

Memory Architectures, Cache Coherence Issues, Performance Issues, Synchronization Issues,

Models of Memory Consistency, Memory Hierarchy Design: Advanced Optimizations of Cache

Performance, Memory Technology and Optimizations, Protection: Virtual Memory and Virtual

Machines, Design of Memory Hierarchies, Case Studies.

CSC52204 MOBILE AND WIRELESS NETWORK SECURITY LAB 0-0-2

Estimation of path-loss based on different models and conditions, Estimation of frequency-reuse,

user-capacity, Co-channel-interference, etc of cellular system, Estimation of GSM speed based on

different logical and physical frame-format, Cost estimation of location management and paging

in mobile communication; Simulation of the protocols like FDD, TDD, FDMA, TDMA, DS-

CDMA, FH-CDMA, CSMA/CA, Routing protocols for ad hoc networks, WAP, WML, Wireless

security schemes.

11

LIST OF SUBJECTS FOR ELECTIVE-III OF II SEMESTER M.TECH – CSEIS

CSE52116 SECURE WEB SERVICES AND E-COMMERCE 3-1-0

Introduction to XHTML and Javascript, XML Elements and Attributes, XML Document

Structure and Syntax, XML Namespaces, XML Data Validation, XML 1.1 new features, XML

Namespaces, XML parsers for data validation, Document Type Definitions, W3C XML Schemas,

Parsing XML with Document Object Model (DOM), Parsing XML and with Simple API for

XML(SAX), XSLT concepts and transformations, Storing and Binding data in HTML,

Navigation from record to record, Extracting data from DSO, Binding XML data into HTML

tables, Reading XML and Extracting data from it, Creating a DOM Document Object, Getting a

Document’s Document Element, Searching for XML Elements by name, Extracting Data from

XML attributes, Xquery and its usage, Design of Information system, Architecture of an

Information system, Understanding Middleware, RPC and related Middleware, TP Monitors,

object Brokers, Message Oriented Middleware, Web Service concept, SOAP, WSDL, UDDI,

Creating and Deploying, Accessing and Building .NET Web Services, Authentication and

Security for Web Services; Major components of e-Commerce, e-Commerce framework, Media

Convergence, Anatomy of e-Commerce application, Types of e-Commerce: Interorganizational,

intra organizational, C2B, Communication Security goals; E commerce privacy policy, Network

security policy, Firewall security policy, Requirements of transaction security, E commerce

encryption, Digital Money Security Payment Transaction, Electronic Security basics, Limitation

of e-Commerce, Security measures.

CSE52129 MULTIMEDIA SYSTEMS & SECURITY 3-1-0 Fundamentals of Multimedia Systems: Multimedia data representation; Classification of

Multimedia Systems (Text, Audio, Still Image, Video, Graphics, Animation); Multimedia

Fundamentals and Coding Techniques: Audio Coding and Standard; Image/Video Coding: JPEG

and MPEG; Digital Rights Management (DRM) System; Security attacks; Multimedia

Technologies and Applications: Media Object Production; Media Integration and Presentation;

Media Protection; Media Retrieval; Media Distribution Across Internet; Media Communication -

IP Telephony & Teleconference; Mobile Multimedia Service over Wireless Networks;

Multimedia Encryption: Conventional Encryption Algorithms; Streaming media encryption;

Challenges of streaming media encryption; Visual Cryptography; Multimedia Authentication:

Digital Signature; Public Key Cryptography; Message Digest Standard (MD5); Multimedia

Forensics and Applications: Video Tape Enhancement; Audio Tape Enhancement; Face

Recognition; Handwriting Comparison; Speaker Recognition / Identification; Image / Art

Authentication; Digital Image Watermarking; Digital Audio Watermarking.

CSE52131 CYBER SECURITY & DIGITAL FORENSICS 3-1-0 Introduction to Cyber Security, Implementing Hardware Based Security, Software Based

Firewalls, Security Standards, Assessing Threat Levels, Forming an Incident Response Team,

Reporting Cyber crime, Operating System Attacks, Application Attacks, Reverse Engineering &

Cracking Techniques and Financial Frauds, Introduction to Digital Forensics, Challenges of

Computer Forensics, Forensic Software and Hardware, Analysis and Advanced Tools, Forensic

Technology and Practices, Legal Definitions, Incident Handling Process, Hashing and integrity

issues, imaging choices, the role of virtualization in forensics, What to do in identifying and

containing an incident on Windows, Linux, and Apple computers, basic registry analysis, MRUs

and history file analysis, network analyzer basics, packet capturing, span ports, upstream tools,

memory layouts, possible end point agents, file systems, encryptions issues, SSD challenges,

slack space, partitions, malware analysis, magic numbers, digital steganography, browser

12

forensics, PST and OST files, eDiscovery solutions, IOS and Droid, acquisition challenges,

encryption on the devices, rooting, reviewing logs and APIs.

CSE52132 NETWORK SECURITY 3-1-0

Introduction: Network concepts, Threats in networks, Network security controls, Importance of

security, Threat models, Security concepts, Common mitigation methods, Overview of

authentication, Security Handshake pitfalls, Strong password protocols, Kerberos, Public key

infrastructure, IP security Overview, Architecture, Authentication Header, Encapsulating Security

Payload, Key management, Web security: Web security considerations, Secure Socket Layer and

Transport Layer Security, Virtual private networks, Secure electronic transaction, Digicash, Web

issues, E-mail security: Store and forward, Security services for e-mail, Establishing keys,

Privacy, Authentication of the Source, Message Integrity, Non-repudiation, Proof of submission

and delivery, Pretty Good Privacy, Secure/Multipurpose Internet Mail Extension, System

security: Intruders, Intrusion detection, Password management, Malicious software: Viruses and

related threats, virus countermeasures, Firewalls: Firewall design principles, Firewall

configurations, Trusted systems.

LIST OF SUBJECTS FOR ELECTIVE-IV & V OF II SEMESTER M.TECH – CSEIS

CSE52101 ALGORITHMIC GRAPH THEORY 3-1-0

Basics of graphs, undirected graphs, weighted graphs, directed graphs, planar graphs, connected

graphs, bipartite graphs, edge graph, representation, adjacency matrix, incidence matrix, path

matrix, parameters of graphs (degree, diameter, girth etc.), techniques and algorithms for studying

the basic parameters and properties of graphs, trees, connectivities, blocks, cycles and tours,

Eulerian and Hamiltonian graphs, closure of graphs, components of graphs, matching, covering,

independent set, cliques, vertex and edge coloring, planar graphs, dual graphs, directed graphs.

applications of graphs in various fields like telecommunications, networking, image processing,

pattern recognition, graph cut algorithms, graph traversals (DFS and BFS), topological sorting,

planarity testing, finding strongly connected components, applications to searching in massive

graphs (e.g. page ranking), use of structural properties and algebraic properties.

CSE52106 INTERACTIVE COMPUTER GRAPHICS 3-1-0 Introduction to computer graphics, Setting up OpenGL programming environment. Graphics

devices: display, object, model, image, primitive, graphics library, Hardware: raster display

system and some basic terminologies. OpenGL related libraries (glut, glu, etc.), double buffering,

Scan-conversion, characters, clipping. Attributes: Primitive attributes, antialiasing, animation,

circle subdivision. 2D transform: 2D translation, scaling, rotation homogeneous coordinates,

composition of transformation, affine transforms, transforming normals, 3D models: OpenGL

primitives, hidden-surface removal, back-face culling, cone, cylinder, sphere, collision detection.

3D modeling transforms, Rodrigues formula, change of basis, Vertex array, viewing transforms,

Projection and projection transforms, compositing and the alpha channel, Scenegraph; Lighting

and reflection, Phong illumination model; Shading, History of 3D graphics, programmable

shaders, Vertex-buffer object and vertex-array object, Application-shader interfacing, Light and

color, Color spaces, Texture mapping: texture coordinates, perspective-correct interpolation,

texture sampler, Skinning, modeling with CSG, polygonal mesh and LOD, Quaternion,

procedural modeling, Introduction to physically-based and behavioral animations, Pixel-buffer

object and texture filtering: mip mapping, sum-area table, anisotropic filtering, procedural

13

textures, Introduction to global illumination and ray tracing, Environment mapping, radiance

map, Interactive shadows: shadow map, shadow volume, ambient occlusion, Introduction to

animation, key-frame animation, forward kinematics, motion capture, Parametric curves and

splines; cubic splines: Hermite, Bezier, cardinal, Catmull-Rom. Blending: transparency, anti-

aliasing, fog. Image: OpenGL images, frame buffer access.

CSE52108 SOFT COMPUTING 3-1-0 Artificial Neural Networks (ANN): Basics Characteristics of artificial neural networks,

Comparison with biological neural networks, Advantages and disadvantages of ANNs, Synaptic

dynamics, Applications of ANNs, Basic Models: Mc-Culloch Pitt’s model, Single Layer and

Multilayer Perceptron model of neural networks, Hebb’s model, Learning Laws; Learning:

Supervised, unsupervised, Reinforcement Law of learning; Differences among learning laws;

LMS and Delta Learning, Gradient descent method, Multilayer Perceptron Model (MLP), Back

propagation algorithm for weight updates, classification problem using MLP; Architecture for

complex pattern recognition tasks; Hopfield model; Fuzzy Logic: Fuzzy sets, basic operations,

membership functions, Fuzzy Relations, Fuzzification, Fuzzy Inference, Fuzzy Rule Based

System, Defuzzification; Genetic Algorithm: working Principle, Cross over mutation, roulette

wheel selection, tournament selection, population, binary encoding and decoding for any

optimization problem, Multi objective Gas, Concepts on Non-domination, tournament selection,

crowding distance operator, ranking, Rough Sets: basic operations, lower and upper

approximations, discernibility matrix, distinction table; Accuracy of Approximations.

Hybridization of Soft Computing tools like Neuro-fuzzy, Rough fuzzy, Rough-Fuzzy-GA etc.

CSE52110 DATA COMPRESSION 3-1-0 Introduction, Types of Compression, Measures of performance, Description of various Models:

Physical, Probability, Markov, and composite source model, Information Theory concepts for

Data Compression: Discrete Memoryless model and Entropy, Huffman and Arithmetic Encoding,

Unique decodable codes, Kraft-McMillan ineqality, Text Compression algorithms: Diagram

Coding, Lempel-Ziv coding: LZ77, LZ78, LZW, Speech and Audio Compression, Still Image

Compression, Video Compression, Quantization: Scalar Quantization, Vector Quantization,

Differential encoding.

CSE52111 CLOUD COMPUTING 3-1-0 Introduction to Cloud Computing: Overview of distributed computing, Cloud introduction and

overview, Different types of cloud services, cloud deployment models, Advantages and

Disadvantages of Cloud Computing, and Companies in the Cloud today; nfrastructure as a

Service (IaaS): Introduction to Infrastructure as a Service (IaaS), CPU Virtualization –

Hypervisors, Storage Virtualization - SAN, ISCSI, Network Virtualization – VLAN; Platform/

Software as a Service (PaaS/ SaaS): From IaaS to PaaS, What is PaaS, PaaS properties and

characteristics, PaaS Techniques: File System - GFS, HDFS, Programming Model-MapReduce,

Storage System for Structured Data - BigTable, Hbase. SaaS: web service, web based

applications, web portal; Security in Cloud computing environments: Cloud Computing threats,

Security for Cloud Computing; Case studies: Amazon EC2, Google App Engine, IBM Clouds,

Microsoft’s Windows Azure etc.

CSE52121 OPTIMIZATION TECHNIQUES 3-1-0

Introduction: General statement of optimization problem, Classification of optimization

Problems. Classical Optimization Techniques: single-variable and multi-variable

optimization, constrained optimization problems. Linear and Non Linear Programming

14

Programming, geometric Programming, Dynamic Programming, Multi-oobjective

optimization, Genetic algorithms: representation of design variables, objective function and

constraints; Particle Swarm Optimization, Main algorithm, basic components, issues and

variations, Central force optimization (CFO): Main algorithm, basic components, issues and

variations, Chemical reaction optimization (CRO): Main algorithm, basic components, issues,

Simulated Annealing; Neural network based optimization and most recent optimization

techniques such as Gravitational Search, CRO and many others. Practical and computational

aspects of optimization. Few applications based on nature inspired optimization techniques.

CSE52122 SOFTWARE TESTING 3-1-0 Introduction to Software Testing: Fundamentals of Verification and Testing, Review of software

development models, Test Metrics, Software Testing Principles, Testing and Debugging,

Software Quality, Requirement Behavior and Correctness, Fundamentals of Test Process, The

Tester’s Role in a Software Development Organization, Static Testing: Structured examination,

Control flow & Data flow, Determining Metrics; Dynamic Testing: Black Box Testing, Black

Box Testing, Gray Box Testing, Intuitive and Experience Based Testing; Test Management: Test

Organization, Test Planning, Test Strategies, Levels of Testing, Testing Tools Automation of Test

Execution: Types of test Tools, Selection and Introduction of Test Tools, Testing Object Oriented

Software: Introduction to Object Oriented testing concepts, Differences in Object Oriented

testing, testing Object Oriented systems.

CSE52123 MACHINE LEARNING 3-1-0 Introduction: Well Defined Learning Problems, Designing A Learning System, Issues In Machine

Learning. Learning Tasks: General-To-Specific Ordering Of Hypotheses, Candidate Elimination

Algorithm, Inductive Bias. Decision Tree Learning: Decision Tree Learning Algorithm-Inductive

Bias- Issues In Decision Tree Learning. Evaluating Hypotheses – Estimating Hypotheses

Accuracy Basics Of Sampling Theory, Comparing Learning Algorithms, Bayesian Learning –

Bayes Theorem, Concept Learning, Bayes Optimal Classifier, Naïve Bayes Classifier, Bayesian

Belief Networks, EM Algorithm, Computational Learning Theory – Sample Complexity For

Finite Hypothesis Spaces.

Artificial Neural Networks: Perceptrons, Gradient Descent And The Delta Rule, Adaline,

Multilayer Networks, Derivation Of Backpropagation Rule backpropagation Algorithm-

Convergence, Generalization. Genetic Algorithms – An Illustrative Example, Hypothesis Space

Search, Genetic Programming, Models Of Evolution And Learning; Learning First Order Rules-

Sequential Covering Algorithms-General To Specific Beam Search-Foil; Reinforcement Learning

- The Learning Task, Q Learning, Instance-Based Learning – K-Nearest Neighbor Learning,

Locally Weighted Regression, Radial Basis Function Networks, Case-Based Learning.

CSE52124 ADVANCED DBMS 3-1-0 Relational Databases: Integrity Constraints, Functional Dependency, Multi-valued Dependency;

Query Processing and Optimization: Evaluation of Relational Operations, Transformation of

Relational Expressions, Indexing and Query Optimization, Limitations of Relational Data Model;

Objected Oriented and Object Relational Databases: Modeling Complex Data Semantics,

Specialization, Generalization, Aggregation and Association, Objects, Object Identity, Equality

and Object Reference, Architecture of Object Oriented and Object Relational Databases; Parallel

and Distributed Databases: Distributed Data Storage, Fragmentation & Replication, Location and

Fragment Transparency, Distributed Query Processing and Optimization, Distributed Transaction

Modeling and Concurrency Control, Distributed Deadlock, Commit Protocols, Design of Parallel

Databases, Parallel Query Evaluation; Advanced Transaction Processing: Nested and Multilevel

Transactions, Compensating Transactions and Saga, Long Duration Transactions, Weak Levels of

15

Consistency, Transaction Work Flows, Transaction Processing Monitors; Expert Databases: Use

of rules of deduction in data bases, recursive rules; Fuzzy Databases: Fuzzy set & fuzzy logic,

Use of fuzzy techniques to define inexact and incomplete data bases.

CSE52125 NATURAL LANGUAGE PROCESSING 3-1-0 Introduction to Natural Language Understanding: The study of Language, Applications of NLP,

Evaluating Language Understanding Systems, Different levels of Language Analysis,

Representations and Understanding, Organization of Natural language Understanding Systems;

Linguistic Background: An outline of English Syntax. Grammars and Parsing: Grammars and

sentence Structure, Top-Down and Bottom-Up Parsers, Transition Network Grammars, Top-

Down Chart Parsing. Features and Augmented Grammars: Feature system and Augmented

Grammars, Basic Feature system for English, Morphological Analysis and the Lexicon, Parsing

with Features, Augmented Transition Networks. Grammars for Natural Language: Auxiliary

Verbs and Verb Phrases, Movement Phenomenon in Language, Handling questions in Context-

Free Grammars, Hold mechanisms in ATNs. Efficient Parsing: Human preferences in Parsing,

Encoding uncertainty, Deterministic Parser. Ambiguity Resolution- Statistical Methods:

Probability Theory, Estimating Probabilities, Part-of-Speech tagging, Obtaining Lexical

Probabilities, Probabilistic Context-Free Grammars, Best First Parsing; Semantics and Logical

Form: Word senses and Ambiguity, Encoding Ambiguity in Logical Form. Ambiguity

Resolution: Selectional Restriction, Word Sense Disambiguation.

CSE52126 CAD FOR VLSI 3-1-0 Introduction: VLSI design flow, challenges. Verilog/VHDL: introduction and use in synthesis,

modeling combinational and sequential logic, writing test benches. Logic synthesis: two-level and

multilevel gate-level optimization tools, state assignment of finite state machines. Basic concepts

of high-level synthesis: partitioning, scheduling, allocation and binding. Technology mapping.

Testability issues: fault modeling and simulation, test generation, design for testability, built-in

self-test. Testing SoC s. Basic concepts of verification. Physical design automation. Review of

MOS/CMOS fabrication technology. VLSI design styles: full-custom, standard-cell, gate-array

and FPGA. Physical design automation algorithms: floor-planning, placement, routing,

compaction, design rule check, power and delay estimation, clock and power routing, etc. Special

considerations for analog and mixed-signal designs.

CSE52127 VLSI TESTING & VERIFICATION 3-1-0 Physical faults and their modeling. Fault equivalence and dominance; fault collapsing. Fault

simulation: parallel, deductive and concurrent techniques; critical path tracing. Test generation

for combinational circuits: Boolean difference, D-algorithm, Podem, etc. Exhaustive, random and

weighted test pattern generation; aliasing and its effect on fault coverage. PLA testing: cross-

point fault model, test generation, easily testable designs. Memory testing: permanent,

intermittent and pattern-sensitive faults; test generate on. Delay faults and hazards; test generation

techniques. Test pattern generation for sequential circuits: ad-hoc and structures techniques, scan

path and LSSD, boundary scan. Built-in self-test techniques.

CSE52130 DISTRIBUTED OPERATING SYSTEMS 3-1-0

Introduction to Distributed Systems: Introduction to Distributed Computing System Models,

Distributed Operating System, Difference between Network and Distributed System, Goals of

Distributed System, Hardware Concept; Message Passing: Desirable features, Issues in IPC,

Synchronization, Buffering, Encoding and Decoding, Process Addressing, Failure Handling,

Group Communication; Remote Procedure Calls: RPC Model, Transparency of RPC,

16

Implementation of RPC Mechanism, RPC Messages, Marshalling, Server Management (Stateful

and Stateless Server), Parameter-Passing Semantics (Call-by-Value, Call-by-Reference), Call-

Semantics, Communication Protocols for RPCs, Client-Server Binding, Special Types of RPCs;

Distributed Shared Memory: General Architecture of DSM Systems, Design and Implementation

Issues of DSM, Structure of Shared-Memory Space, Consistency Models, Replacement Strategy,

Thrashing, Advantages of DSM; Synchronization: Clock Synchronization, Event Ordering,

Mutual Exclusion, Deadlock, Election Algorithms; Resource Management: Task Assignment

Approach, Load-Balancing Approach, Load-Sharing Approach; Process Management: Process

Migration, Threads; Distributed File Systems: File Models, File-Accessing Models, File-Sharing

Semantics, File-Caching Schemes, File Replication; Security: Potential Attacks to Computer

Systems, Cryptography, Authentication, Access Control, Digital Signatures.