1
COURSE STRUCTURE AND SYLLABUS
F
OR
2

YEAR M
. TECH.
(
COMPUTER SCIENCE & ENGINEERING
)
Approved by 83
rd
Academic Council Meeting held on
26 May, 2012
(YEAR 2012 ONWARDS)
INDIAN SCHOOL OF MINES
DHANBAD

826 004, JHARKHAN
D
2
2

YEAR
M.TECH (C
SE) COURS
E STRUCTURE
M. Tech (CSE)
I Semester
Course No.
Name of the Courses
L
T
P
Credit
Hrs
CSC51101
High Performance Computer Architecture
3
1
0
7
CSC51102
Advanced Data Structures and Algorithms
4
0
0
8
CSC51103
Discrete and Analytical Mathemat
ics
3
1
0
7
CSE51
1xx
Elective
I
3
0
0
6
CSE51
1xx
Elective
II
3
0
0
6
CSC51201
High Performance Computer Architecture
Laboratory
0
0
3
3
CSC51202
Advanced Data Structures and Algorithms
Laboratory
0
0
3
3
TOTAL
16
2
6
40
Contact
Hours
24
Li
st of Elective Subjects
Course No.
Elective
I & II
L
T
P
Credit Hrs
CSE51101
Topics in Cryptography and Network
Security
3
0
0
6
CSE51102
Public Key Infrastructure and Network
Security
3
0
0
6
CSE51103
Web Technology
3
0
0
6
CSE51104
Information Retr
ieval Techniques and
Evaluation
3
0
0
6
CSE51105
Advanced DBMS
3
0
0
6
CSE51106
Bioinformatics Algorithms
3
0
0
6
CSE51107
Computational Intelligence
3
0
0
6
CSE51108
Grid Computing
3
0
0
6
3
M. Tech (CSE)
II Semester
Course No.
Name of the Cour
ses
L
T
P
Credit
Hrs
CSC52101
VLSI Design and Testing
3
1
0
7
CSC52102
Advanced Computer Networks
3
1
0
7
CSE52
1xx
Elective
–
III
3
0
0
6
CSE5
2
1xx
Elective
–
IV
3
0
0
6
CSE5
2
1xx
Elective
–
V
3
0
0
6
CSC52201
VLSI Design and Testing Lab
oratory
0
0
3
3
CSC5
2202
Advanced Computer Networks
Laboratory
0
0
3
3
TOTAL
15
2
6
38
Contact
Hours
23
Course No.
Elective
III, IV & V
L
T
P
Credit Hrs
CSE52101
Algorithmic Graph Theory
3
0
0
6
CSE52102
Object Oriented Software Engineering
3
0
0
6
CSE52103
Nat
ural Language Processing
3
0
0
6
CSE52104
Advances in Compiler Construction
3
0
0
6
CSE52105
Advanced Operating Systems
3
0
0
6
CSE52106
Interactive Computer Graphics
3
0
0
6
CSE52107
Quantum Computing
3
0
0
6
CSE52108
Soft Computing
3
0
0
6
CSE5210
9
Technical Foundations for E

commerce
3
0
0
6
CSE52110
Data Compression
3
0
0
6
CSE52111
Cloud Computing
3
0
0
6
CSE52112
Wavelet Analysis
3
0
0
6
CSE52113
Embedded Systems
3
0
0
6
4
M. Tech (CSE)
III Semester
Course No.
Name of the courses
L
T
P
Credit
Hours
CSC53901
Industrial Training/Minor Project
0
0
0
4
CSC53401
Seminar/Viva

voce on Industrial/Minor
Project
0
0
0
2
CSC53501
Comprehensive Viva Voce
0
0
0
4
CSC53801
Dissertation (Interim)
0
0
0
15
CSC53402
Seminar and Viva

voce on Disser
tation
0
0
0
10
CSC53001
Teaching Assignment Evaluation/Lab
Development works, etc.
0
0
0
5
TOTAL
40
M. Tech (CSE)
IV Semester
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)
CSC51101
HIGH PERFORMANCE COMPUTER ARCHITECTURE
3

1

0
Instruction Level Parallelism (ILP)
:
Fundamentals
of Computer Design
,
Instruction Level
Parallelism and Its Exploitat
ion,
Concepts and Challenges
,
Overcoming Data
Hazards
with Dynamic Scheduling,
Dynamic
Branch Prediction, Speculation,
Multiple Issu
e
Processors
,
Case Studies
;
Advanced Techniques for Exploiting ILP
:
Compiler
Techniques for Exposing ILP, Limitations on ILP
;
Multithreading: Using ILP Support to
Exploit Thread level Parallelism, Performance and Efficiency in Advanced Multiple
Issue Proce
ssors, Case Studies
;
Thread Level Parallelism
:
Multiprocessors: Introduction
Symmetric and distributed shared memory architectures, Cache coherence issues,
Performance Issues, Synchronization issues, Models of Memory Consistency,
Interconnection networks:
Buses, crossbar and multi

stage switches
;
MultiCore
Architectures:
Software and hardware multithreading, SMT and CMP architectures,
Design issues, Case studies: Intel Multi

core architecture, SUN CMP architecture, IBM
cell Architecture, hp architecture
;
Da
ta level of parallelism: Systolic Architectures,
SIMD’s, Vector Architecture
;
Memory Hierarchy Design:
Advanced Optimizations of
Cache Performance, Memory Technology and Optimizations, Protection: Virtual
Memory and Virtual Machines, Design of Memory Hiera
rchies, Case Studies.
Book
s:
1.
Hennessey and Patterson, "Computer Architecture: A quantitative Approach"
,
Morgan Kaufman.
2.
Kai Hwang
and
Faye A. Briggs, “Computer Architecture and Parallel
Processing”
,
McGraw Hill.
CSC51102
ADVANCED DATA STRUCTURES AND AL
GORITHMS
4

0

0
Asymptotic complexity, Amo
rtized analysis, d
ynamic data structures and their
applications, kd

trees, binomial heaps, Fibonacci heaps, da
ta structures for disjoint sets
;
data structures for memory optimization, dynamic graphs, data structure
s for m
aintaining
ranges and intervals;
Dynamic programming: matrix chain multiplication,
Convex
polygon triangulation,
a
ssembly line scheduling, Graph algorithms:
Strongly connected
components, s
hortest paths problems; Geometric algo
rithms: Segment inters
ections,
c
losest pairs;
Number

theoretic algorithms: b
asic arithmetic, Modular arithmetic, Powers
of an element;
Matrix oper
ations: Linear equations solver
; Polynomials and FFT;
Internet algorithms;
String matching algorithms: Naïve approach, Rabin

Karp a
lgorithm,
Knuth

Morispratt algorithm, Approximation algorithms; Local search heuristics;
Randomized algorithms
.
6
Books:
1.
T H Cormen, C E Leiserson, R L Rivest and C Stein,
“
Introduction to
Algorithms
”
,
MIT Press
.
2.
Ellis Horowitz
,
Sartaj Sahni
and Rajasekaran
“
Fundamental
s
of
A
lgorithms
”
,
Galgotia publications
.
3.
Jon Kleinberg an
d
Tremblay and
Eva Tardos,
“
Algorithm Design
”
,
Addison
Wesley
.
4.
Jean

Paul Tremblay and Paul

G Sorenson, An introduction to data structures with
applications, Mc Graw Hill.
CSC51103
DISCRETE AND ANALYTICAL
MATHEMATICS
3

0

0
V
ector spaces, Norm linear space, Linear transformations, Eigen values and eigen
vectors, Diagonalization, Singular value decomposition, Condition number, F
actor
analy
si
s;
S
elected probability distribution
s, Test of significance, A
nalys
i
s of variance,
R
andom process, Markov's inequality, Chebyshev and Chernoff bounds,
Division
algorithm, Prime numbers, Primality testing; C
ongruence, Euclid's algorithm, Chinese
remainder theorem;
Integral transforms, I
ntegral equations.
;
Algebraic graph
theory:
E
igen

values and walks,
E
igen values and
l
abeling of graphs,
B
i

clique partition of
graphs,
C
hordal graphs,
T
ournament problem.,
Matching, C
olourability,
P
lanarit
y, Caley
graphs;
Computability and uncomputability.
Books:
1.
John B. Fraleigh
,
Raymond A. Beauregar
d
,
Victor J. Katz
, Discrete Mathematics
: Linear Algebra, Pearson Publisher.
2.
Lowell W Beineke et al.,
Topics in Algebraic Graph Theory
, Cambridge
University Press, 2005
3.
I. N. Herstein
(Author),
David J. Winter
,
Matrix Theory and Linear Algebra,
Macmillan Pub Co (January 1988).
4.
C. L Liu
,
Introduction to combina
torial mathematics,
Mcgraw

Hill.
5.
Athanasios Papouli
s,
Probability, Random Variables and Stochastic Processes
,
McGraw

Hill.
6.
Richard A. Brualdi,
Introductory Combinatorics,
Prentice Hall, 2004
.
7.
Martin J. Erickson, Introduction to Combinotorics, Wiely

Interscience Series in
Discrete Mathematics and Optimization, 1996.
7
CSC51201
HIGH PERFORMANCE COMPUTER AR
CHITECTURE
LABORATORY
0

0

3
It is based on the course “
High Performance Computer Architecture
”
with the
emphasi
s
on ILP, Static & Dynamic Scheduling, MPI

based programming, and use of simulators
(like SimpleScal
a
r) for cache

oriented design, blocking etc
.
CSC5120
2
ADVANCED DATA STRUCTURES AND ALGORITHMS
LAB
ORATORY
0

0

3
It is based on the
course “Advanced Data Stru
ctures And Algorithms
”
:
Implementation of
kd

trees, binomial heaps, Fibonacci heaps
.
Implementation of
matrix chain
multiplication,
Convex
polygon triangulation,
Assembly line scheduling
.
Program for
Geometric algorithms: Segment intersections, Closest pairs
.
Program for
l
inear equa
tions
solver
;
Polynomials and FFT
.
Implementation of st
ring matching algorithms,
Program for
Approximation
and r
andomized algorithms.
COURSE DETAILS OF ELECTIVE SUBJECTS
OF I SEMESTER
CSE5
1
10
1
TOPICS IN CRYPTOGRAPHY AND NETWORK
SECURITY
3

0

0
Mathematics of Cryptography: Modular Arithmetic, Linear congruence, Algebraic
structures, GF(2
n
) Fields, Number theory;
Symmetric encryption techniques: Feistel
cipher, DES, Triple DES, AES, IDEA, CAST, RC4, RC5, Blowfish, Mode of operations;
Public

key encryption techniques: RSA, ElGamel, Elliptic Curve Cryptography, Key
management; Cryptographic hash functions: MD5, SHA

512, RIPEMD, HMAC,
Message authentication; Digital signatures, Certificates and Authentication: DSA and
DSS, Kerberos, X.509 authentication; Network and web security: E

mail security,
SSL/TLS, IPSec, Virtual private networks; E

commerce security: SET, Digi
cash,
Books:
1.
William Stallings, “Cryptography and Netrork security”, Pearson Education,
2004.
2.
W. Mao, “Modern Cryptography”, Prentice Hall, 2004.
3.
B. A. Forouzan, “Cryptography and Network Security”, Tata McGraw Hill, 2007.
4.
Bruce Schneier, “Applied Crypt
ography”, John Wiley & Sons, 2002.
8
5.
J. Katz and Y. Lindell, “Introduction to Modern Cryptography”, CRC Press,
2007.
CSE5
1
10
2
PUBLIC KEY INFRASTRUCTURE AND NETWORK
SECURITY
3

0

0
Digital certificates and PKIs; Different PKIs: PGP(Pretty Good Privacy)

Web
of Trust,
applications,X.509:X.500, Certification Authority(CA), Registration Authority(RA),
Root

CA, X.509 Protocols, Hierarchy of Trust, Simple PKI(SPKI), Simple Distributed
Security Infrastructure(SDSI); Access Control Mechanisms including Role based
access
control; Issues of revocation, Anonymity and Privacy issues; Smartcard integration with
PKIs, Trust Management Systems; Risks; Impact on E

Commerce and E

Business.
Books:
1.
William Stallings, “Cryptography and Netrork Security”, Pearson Education,
2004.
2.
C.E.Veni Madhavan and Abhijit Das, “Public

Key Cryptography: Theory and
Practice”, Pearson Education.
3.
Forozan, “Cryptography and Netrork Security”, Tata Mc Graw

Hill.
CSE5
1
10
3
WEB TECHNOLOGY
3

0

0
History of the Web
, WWW, Client/Server Architectu
re of Internet, html, intermediate
html, javascript, control structures, functions ,arrays, objects, cascading style sheets
(css),event model, cgi and perl, xml (extensible markup language, extensible style
language (xsl).
mysql, php, python, , web 2.0, in
ternet business and
social
networking
resource centers, including affiliate programs, alert services, attention
economy, building web communities, community generated content, google adsense,
google analytics, google base, google services, google video, in
ternet advertising,
Website Graphics Tools, Flash, Dreamweaver, ColdFusion, Web Multimedia Tools and
Web Accessibility.
Books:
1.
Harvey M. Deitel and Paul J. Deitel, Internet & World Wide Web How to
Program, 4/e,.
2.
Lars Klander,
“Core Visual C++ 6”, Pearso
n Education, PHI
3.
Herbert Schildt,”java 2:The Cmplete Reference”,5
th
Edition,TMH,2002.
4.
Thomas Boutel:”CGI Programming In C and Perl”, Addison

Wesley,1996.
5.
Shishir Gundavaram: CGI Programming on the world wide web”, O’Relly and
Associates’. 1996.
9
CSE5
1
10
4
I
NFORMATION RETRIEVAL TECHNIQUES AND
EVALUATION
3

0

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

vocabulary, postings

lists, Dictionaries; Inverted indices: Preprocessing steps,
tokenization, stemming, stopwor
d 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 re
levance, 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, Challeng
es, 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.
Bo
oks:
1.
Christopher D. Manning, Prabhakar Raghavan and Hinrich Schütze,
Introduction
to Information Retrieval
, Cambridge University Press. 2008.
2.
Baeza

Yates and Ribeiro

Neto, Modern Information Retrieval, Addison Wesley,
1999.
3.
W. Bruce Croft, D. Metzler, T.
Strohman, Search Engines Information Retrieval
in Practice ,Pearson, 2009.
4.
Stefan Büttcher, Charles L. A. Clarke and Gordon V. Cormack, Information
Retrieval
Implementing and Evaluating Search Engines,
MIT Press, 2010.
5.
A comprehensive survey by Ed Greengr
ass, available at
(http://www.csee.umbc.edu/cadip/readings/IR.report.120600.book.pdf.
CSE5
1
10
5
ADVANCED DBMS
3

0

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 F
ragment 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
10
Levels of Consistency, Transaction Work Flows, Transaction Processing Monitors;
Expert Databases: Use of rules of deduction in data bases, recursive r
ules; Fuzzy
Databases: Fuzzy set & fuzzy logic, Use of fuzzy techniques to define inexact and
incomplete data bases.
Books:
1.
Avi Silberschatz
,
Henry F. K
orth
&
S. Sudarshan
, “Database System Concepts”,
Tata Mc

Graw

Hill.
2.
W. Kim, “
Modern Database Systems”,
Addison Wesley.
3.
W. Kim, “
Introduction to Object Oriented Databases
”, MIT Press.
4.
J. D. Ullman, “
Pri
nciples of Database and Knowledge Base Systems
”, Computer
Science Press.
5.
R. Elmasri & S. B. Navathe, “
Fundamentals of Database Systems”, Addition
Wesley.
CSE5
1
10
6
BIOINFORMATICS ALGORITHMS
3

0

0
Introduction to bioinformatics, biological sequence/struct
ure, 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

Pr
att, 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.
Books:
1.
An Introduction to Bioinformatics Algorithms, Neil C.Jones And Pavel
A.Pevezner.
2.
Dan Gusfield, “Algorithms on Strings, Trees, and Sequences: Computer Science
and Computational Biology”, Cambridge University Pre
ss, 1997.
3.
M Lesk, “Introduction to Bioinformatics”, Oxford Publishers (India Edition).
4.
T. K. Attwood and D. J. Parry

smith, “Introduction to Bioinformatics,” Addison
Wesley Longman.
5.
Jean

Michel Claveriw and Cerdric Notredame, “Bioinformatics

A beginners
G
uide”, WILEY DreamTech India Pvt Ltd.
11
CSE5
1
10
7
COMPUTATIONAL INTELLIGENCE
3

0

0
Artificial Intelligence: History and Applications, Production Systems, Structures and
Strategies for state space search

Data driven and goal driven search, Depth First
and
Breadth First Search, DFS with Iterative Deepening, Heuristic Search

Best First Search,
A* Algorithm, AO* Algorithm, Constraint Satisfaction, Using heuristics in games

Minimax Search, Alpha Beta Procedure. Knowledge representation

Propositional
cal
culus, Predicate Calculus, Theorem proving by Resolution, Answer Extraction, AI
Representational Schemes

Semantic Nets, Conceptual Dependency, Scripts, Frames,
Introduction to Agent based problem solving. Machine Learning

Symbol based and
Connectionist,
Social and Emergent models of learning, The Genetic Algorithm

Genetic
Programming, Overview of Expert System Technology

Rule based Expert Systems,
Introduction to Natural Language Processing.
Languages and Programming Techniques for AI

Introduction to P
ROLOG and LISP,
Search strategies and Logic Programming in LISP, Production System examples in
PROLOG.
Books:
1.
George.F.Luger, “
Artificial Intelligence

Structures and Strategies for Complex
Problem Solving”
, 4/e, 2002, Pearson Education.
2.
E. Rich and K. K
night, “
Artificial Intelligence”
, 2/e, Tata McGraw Hill
3.
Winston. P. H, “LISP”, Addison Wesley.
4.
Ivan Bratko, “
Prolog Programming for Artificial Intelligence”
, 3/e, Addison
Wesley, 2000.
CSE5
1
10
8
GRID COMPUTING
3

0

0
Overview and motivation, Basic Buildin
g Blocks, Evolution of Grid models, Resource
management issues of various Grid models: Remote execution, Scheduling, Resource
reservation and Quality of Service (QoS), Security issues for Environment:
Authentication, Authorization and Access Control, Middl
eware for building Grid
computing environments, Language support for Grid Computing: MPI

G/MPI

G2,
Information and Data Management, Performance measurement, Open Grid service
Architectures, Applications.
Books:
1.
Jankiram D., “Grid Computing Models: A Resea
rch Monograph”, Tata McGraw

Hill.
2.
Joshy Joseph and Craig Fellenstein, “Grid Computing”, Pearson Education.
3.
Ahmar Abbas, “Grid Computing: A Practical Guide to Technology and
Applications”, Charles River media.
12
COURSE DETAILS OF II SEMESTER M. TECH (CSE)
CSC52101
VLSI DESIGN & TESTING
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, de
lay 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 Capacit
ance, Logical effort, gate
array, standard cell and datapath cell design. Introduction to hardware description
language (HDL) Verilog/V
HDL. A logic synthesis example
; Physical design algorithms.
Testing: Physical faults and their modeling. Fault equivalenc
e 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 g
eneration techniques. Test pattern
generation for sequential circuits: ad

hoc and structures techniques, scan path and LSSD,
boundary scan. Built

in self

test techniques.
Books:
1)
Douglas A. Pucknell and Kamran Eshraghian, “Basic VLSI Design Systems and
Ci
rcuits”, Prentice Hall of India, 1993.
2)
N. Weste, D. Harris and A. Banerjee, “ CMOS VLSI Design”, Pearson Education,
2008.
3)
D. A. Hodges, H. G. Jackson and R. A. Saleh, “ Analysis and Design of Digital
Integrated Circuits”, Tata Mcgraw

Hill, 2005.
4)
Amar Mukhe
rjee, “Introduction to NMOS and CMOS VLSI System Design”,
Prentice Hall, 1986.
5)
Wayne Wolf, “Modern VLSI design”, Pearson Education, 2003.
6)
M Abramivici and A. Friedman, “Digital System testing and Testable design”,
IEEE Press, 1990.
7)
M. Bushnell and V.
Agrawal, “Essential of Electronic Testing for Digital,
Memory and Mixed

Signal VLSI Circuits”, Kluwer Publishers , 2000.
8)
J. Bhasker, “Verilog HDL Primer”, BS Publication, 2001.
CSC52102
ADVANCED COMPUTER NETWORKS
3

1

0
Introduction: Challenges in
mobile computing, coping with uncertainties, resource
poorness, bandwidth, etc. Evolution of mobile system: CDMA, FDMA, TDMA, GSM;
13
Mobility Management: Cellular Architecture, Co

channel interference, Handoffs,
Location Management, HLR

VLR Scheme, Hierarch
ical Scheme, Mobile IP; Publishing
& Accessing Data in Air: Pull and push based data delivery models, Data Dissemination
by broadcast, Broadcast Disks, Directory Service in air, Energy Efficient Indexing
Scheme for push based data delivery; File System Sup
port for Mobility: Distributed file
sharing for mobility support, Coda and other storage manager for mobility support; Ad
hoc Network Routing Protocols: DSDV, DSR, CGSR, AODV; Mobile Transaction and
Commerce: Models for mobile transaction, Kangaroo and Joe
y transactions, Team
Transaction. Recovery model for Mobile Transactions. Electronic Payment
and protocols
for mobile commerce
.
Books:
1.
Ivan Stojmenovic, “Handbook of Wireless Networks and Mobile Computing”,
Wiley

Interscience Publication
2.
Asoke K. Talukde
r & Roopa R. Yavagal, “Mobile Computing
–
Technology,
Applications and Service Creation”, Tata McGraw

Hill
3.
Jochen Schiller, “Mobile Communication”, Pearson Education
4.
Tomasz Imieliński
,
Henry F. Korth
, “Mobile Computing”, Kluwer Academic
Publishers (Elsevier).
5.
Reza B'Far, “Mobile Computing Principles: Designing and Develo
ping Mobile
Applications with UML and XML”, Cambridge University Press.
CSC52201
VLSI DESIGN & TESTING
LABORATORY
0

0

3
This Lab will be
based on
Combinational and Sequential MOS logic synthesis,
Minimization techniques, Circuit design and simulation,
Layout synthesis, Placement and
routing, Combination APTG

D

Algorithm etc, Sequential ATPG, Testability measure,
Boundary Scan, DFT and BIST design techniques, Fault and Fault simulation.
CSC52202
ADVANCED COMPUTER NETWORKS
LABORATORY
0

0

3
This L
ab is based on the
following:
Configuration of networking in Linux using ifconfig,
route, bind, etc.; configuration of firewall and masquerading in Linux; network trouble

shooting and performance monitoring using netstat, ping, tcpdump, etc.Simulation of
wired
and wireless routing protocols, Routing configurations, DHCP design.
Configuration and
performance measurement of commonly

used Linux servers such as E

Mail (sendmail,
pop3/imap) and Web (Apache).
Socket programming

TCP and UDP, peer

to

peer
applic
ations; reliable communications using unreliable datagrams; client

server using RPC;
concurrent servers using threads or processes.
14
COURSE DETAILS OF ELECTIVE SUBJECTS
OF II SEMESTER
CSE5
2
10
1
ALGORITHMIC GRAPH THEORY
3

0

0
Basics of graphs, undirec
ted 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 f
or 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, p
lanar 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.
Books:
1.
Béla Bollobás, “Modern Graph Theory”,
Springer Verlag, New York
2.
A. Bondy and U.S.R. Murt
y, “Graph Theory with Applications”, Elsevier.
3.
D. West, “Introduction to Graph Theory”, Prentice Hall.
4.
Shimon Even, “Graph Algorithms”,
Cambridge University Press
.
5.
A. Gibbons, “Algorithmic Graph Theory”, Cambridge Univer
sity Press.
6.
G. Chartrand & O. Oellermann, “Applied and Algorithmic Graph Theory”,
McGraw Hill.
CSE5
2
10
2
OBJECT ORIENTED SOFTWARE ENGINEERING
3

0

0
Introduction to Software Engineering: Life cycle models, Requirements Analysis and
Specification, For
mal
Requirements Specification;
Fundamental issues in software
design: Goodness of design, C
ohesion, and Coupling;
Function

Oriented Design
Methodology:
Structured Analysis and Design;
Object

Oriented Modeling Concepts:
Object Modeling, Dynamic Mo
deling, and F
unctional Modeling;
Object

Oriented Design
Methodology:
Unified Modeling Language, (UML), Use Case Modeling, Methodologies
for Object

Oriented Analysis and Design (OOAD), Design patterns, CASE tool support
for OOAD and automatic code generation. Object Imp
lementation, Verification, and
Testing.
Books:
1.
Roger S. Pressman, “Software Engineering
–
A Practitioner’s Approach
”,
(6/e),
Mc Graw Hill
.
15
2.
Brahma Dathan, Sarnath Ramnath, “Object

Oriented Analysis, Design and
Implementation
–
An Integrated Approach”
,
Uni
versities Press
.
3.
James Rumbaugh et al., “Object

Oriented Modeling and Design”
,
Pearson
Education
.
4.
Pankaj Jalote, “An Integrated Approach to Software Engineering
”,
(3/e), Narosa
5.
Martin Fowler, “UML Distilled: A Brief Guide to the Standard Object Modeling
La
nguage
”,
(3/e), Addison Wesley
.
CSE5
2
1
03
NATURAL LANGUAGE PROCESSING
3

0

0
Introduction to Natural Language Understanding: The study of Language, Applications
of NLP, Evaluating Language Understanding Systems, Different levels of Language
Analysis, Repr
esentations 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

Stat
istical 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 Lo
gical Form.
Ambiguity Resolution: Selectional Restriction, Word Sense Disambiguation.
Books:
1.
James Allen, “
Natural Language Understanding”
, 2/e, Pearson Education, 2003.
2.
D. Jurafsky, and J. H. Martin, “
Speech and Language Processing”
, Pearson
Education,
2002.
3.
Christopher D. Manning and Hinrich Schütze, “Foundations of Statistical Natural
Language Processing”, The MIT Press, Cambridge, Massachusetts.1999.
CSE5
2
10
4
ADVANCES IN COMPILER CONSTRUCTION
3

0

0
Review of compiler fundamentals

lexical analys
is, parsing, semantic analysis, error
recovery and intermediate code generation; Runtime storage management; Code
generation; Code improvement

peephole optimization, dependence analysis and
redundancy elimination, loop optimization, procedural and inter

procedural optimization,
instruction scheduling, optimization for memory hierarchy; Compilation for high
performance architecture; Portability and retargetability; Selected topics from compilers
16
for imperative, object

oriented and mark

up languages, parall
el and distributed
programming and concurrency.
Books:
1.
Alfred V. Aho,
Monica S. Lam,
Ravi
,
Jeffrey D. Ullman
, “
Compilers: Principles,
Techniques, and Tools”, Pearson, Addison Wesley, 2007.
CSE5
2
10
5
ADVANCED OPERATING SYSTEMS
3

0

0
Device Drivers; Message Passing: Interprocess communication, group communicati
on,
broadcasting algorithms; Remote Procedure Call: RPC Model, stub generation, server
management, parameter passing, call semantics, communication protocols, client

Server
binding, exception handling, security, optimization; Distributed Shared Memory:
Arc
hitecture, consistency model, replacement strategy, thrashing, coherence;
Synchronization: Clock synchronization, event ordering, mutual exclusion, deadlock,
election algorithms; Resource Management: Scheduling algorithm, task assignment, load
balancing, l
oad sharing; Process Management: Process migration, threads; File Systems;
Protection and Security; Fault Tolerance; Real time OS: pSOS, VxWorks; Naming in
distributed systems, directory services, DNS; Case studies of some distributed OS:
Hydra, Mach and A
moeba.
Books:
1.
Silberschatz, P. Galvin, and G. Gagne, “Operating System Concepts”, 7
th
Edition,
Wiley.
2.
A. S. Tanenbaum, “Distributed Operating Systems”, Prentice Hall of India, New
Delhi, 1996.
3.
G .F. Colouris, J. Dollimore and T. Kindberg, “Distributed Sy
stems: Concepts
and Design”, 2nd ed., Addison

Wesley, Reading, Mass., 1994.
4.
S. J. Mullender (Ed.), “Distributed Systems: An Advanced Course”, 2
nd
ed.,
Addison

Wesley,Reading, Mass., 1993.
5.
P. K. Sinha, “Distributed Operating Systems”, IEEE Press, Los Alamos
,
California, 1997.
CSE5
2
10
6
INTERACTIVE COMPUTER GRAPHICS
3

0

0
Introduction, motivation, uses, history, graphics systems and models, graphics hardware
and display devices, sampling theory, graphics programming: getting started with
OpenGL, input and
interaction in OpenGL, vectors, matrices, basic analytical geometry
e.g. points, lines, segments, planes, triangles, intersections, 2D and 3D transformations,
rasterization, camera models, projection, orthogonal and projective views, hidden surface
remov
al, light, basic shading and materials navigation, screen space and model space
interpolation, texture mapping, projective texture mapping, shadow mapping,
17
environment mapping, antialising, GPU programming, ray tracing, hierarchical modeling,
parametric c
urves, procedural models, particle systems, subdivision curves, parametric
surfaces, subdivision surfaces, perception and color, scientific visualization: CT/MRI
datasets, color composting, transfer functions.
Books:
1. Edward Angel, Dave Shreiner, “Inte
ractive Computer Graphics, A Top

Down
Approach With Shader

Based OpenGL”, Addison

Wesley .
2. Edward Angel, “Open GL : A primer”, 2nd edition, Addison

Wesley, 2005 .
3. The OpenGL Programmer's Guide (the Redbook), Addison

Wesley
4. The OpenGL Reference M
anual (the Bluebook), Addison

Wesley
5. James D. Foley, Andries van Dam, Steven K. Feiner, and John F. Hughes,
“Computer Graphics : Principles & Practices”, Addison Wesley, 2nd edition in
C, 1995.
6. Donald Hearn and M. Pauline Baker, “Computer Graphic
s with OpenGL”, 3rd
edition, 2003, Prentice Hall.
7. Andrew S. Glassner, “
An Introduction to Ray Tracing”
, Academic Press.
CSE5
2
10
7
QUANTUM COMPUTING
3

0

0
Quantun basics: Introduction, Axioms of Quantum mechanics, quantum states and
notation, unitarie
s, quantum bit (qubit), measurements, quantum gates, classical
reversible circuits, quantum circuits, universality; Quantun algorithms: Teleportation,
Deutsch’s algorithm, Simon’s algorithm, Hidden subgroup problems, Quantum Fourier
transform, Shor’s algor
ithm for factoring, Grover’s algorithm; Quantum communication:
Definition of models, Equality, Disjointness with quantum communication, Simultaneous
message passing and finger prints, quantum communication complexity; Introduction to
Quantum error correcti
on and quantum cryptography
Books:
1.
M. A. Nielson and I. L. Chuang, “Quantum Computation and Quantum
Information”, Cambr. Univ. Press, 2000.
2.
A. Yu. Kitaev, A.H. Shen, M.N. Vyalyi, “Classical and Quantum Computation”,
Amer. Mathematical Society, 2002.
3.
R. d
e Wolf, “Quantum Communication and Complexity”, Theoretical Computer
Science, 2002.
4.
“Quantum Computing and Communication”, Edited by Michael Brooks,
Springer

Verlag, 1999.
5.
Jozef Gruska, “Quantum Computing”, McGraw Hill Publishing Company, 1999.
6.
D.Z. Albert
, “Quantum Mechanics and Experience”, Harvard Univ. Press, 1992.
7.
Other Science magazines and web sites.
8.
Julia Kempe, “Quantum Algorithms”, Lecture Notes.
18
CSE5
2
10
8
SOFT COMPUTING
3

0

0
Artificial Neural Networks (ANN): Basics of artificial neural n
etworks, Characteristics
and Comparison with biological neural networks. Advantages of ANNs, Synaptic
dynamics, Applications of ANNs, Basic Models of ANNs: Mc

Culloch Pitt’s model,
Single Layer Perceptron model of neural networks, Hebb’s model, Learning La
ws,
Learning: Supervised, unsupervised, and Reinforcement Law of learning. Comparison
and differences among learning laws. LMS and Delta Learning, Gradient descent method,
Multilayer Perceptron Model (MLP), Back propagation algorithm for weight updates,
cl
assification problem using MLP. Architecture for complex pattern recognition tasks,
Competitive Learning: Hopfield model, Self Organizing Feature Map, ART; Fuzzy
Logic: Fuzzy sets, application: basic operations, membership functions, Properties;
Fuzzy Re
lations, 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 pro
blem. Multi objective Gas, Concepts on Non

domination, tournament
selection, crowding distance operator, ranking, SPEA, Evolutionary strategies etc.;
Rough Sets: basic operations, lower and upper approximations, discernibility matrix,
distinction table etc
.; Hybridization of Soft Computing tools like Neuro

fuzzy, rough
fuzzy, Rough

Fuzzy

GA with applications.
Books:
1.
S. Rajasekaran and G.A. Vijayalaksmi Pai, "Neural Network, Fuzzy Logic, and
Genetic Algorithms

Synthesis and Applications", Prentice
Hall,
2005.
2.
Z
dzisław Pawlak, “Rough Sets: Theoretical Aspects of Reasoning about Data”,
Kluwer Academic Publisher.
3.
Kalyanmoy Deb
, "
Multi

Objective Optimization Using Evolutionary
Algorithms
”,
John Wiley & Sons (ASIA) Pte Ltd
.
4.
Simon S. Haykin, "Neural Networks: A Comprehensive Foundation", Prentice
Hall, 1999.
5.
Timothy Ross, "Fuzzy Logic with Engineering A
pplications", John Wiley & Sons
Inc, 2004.
6.
David E. Goldberg, "Genetic Algorithms in Search, Optimization, and Machine
Learning", Addison

Wesley, 1989.
CSE5
2
10
9
TECHNICAL FOUNDATIONS FOR E

COMMERCE
3

0

0
Introduction to E

commerce, E

commerce Business
Model and Concepts, Internet and
World Wide Web
,
Auctions and Trading mechanisms, Safe exchange, Payment
mechanisms and protocols, Searching hyperlinked structures, Data mining, Copyright
protection and security, Web software infrastructure, Personalizatio
n and tracking,
Integration of catalogs and other trading information.
19
Books:
1.
Kenneth C. Laudon & Carol Traver, E

Commerce: Business, Technology, Society
–
2
nd
edition, Addison Wesle.
2.
Efraim Turban, David King, Dennis Viehland, and, Jae Lee, Electronic
Commerce, A Managerial Perspective 2006, Prentice Hall.
3.
John Benamati
,William S.Davis, E

Commerce Basics
Technology Foundations
and E

Business Applications, Prentice Hall
CSE5
2
1
10
DATA COMPRESSION
3

0

0
Introduction, Types of Compression, Measures of performance, Description of various
Models: Physical, Probability, Markov, and composite source model, Inf
ormation 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
.
Books:
1.
K. Sayood, “Introduction to Data Compression”, Morgan Kaufmann.
2.
G. Held and T. R. Marshall, “Data Com
pression”, Wiley.
3.
Ray A. K. and T. Acharya, “Information Technology: Principles and
Applications”, Prentice Hall of India.
CSE5
2
1
11
CLOUD COMPUTING
3

0

0
Introduction to Cloud Computing: Overview of distributed computing, Cloud
introduction and overvie
w,
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 Mo
del

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
Ap
p Engine, IBM Clouds, Microsoft’s
Windows Azure etc.
Books:
1.
Raj Kumar Buyya, “
Cloud Computing: Principles and Paradigms”
,
Wiley Press.
2.
Barrie Sosinsky, “
Cloud Computing Bible”
,
Wiley India.
20
3.
Borko Furht and Armando Escalante,
“Hand Book of Cloud Computi
ng”
,
Springer.
CSE5
2
1
12
WAVELET ANALYSIS
3

0

0
Introduction: Vector Space, Basis, Dimension, Linear Transformation, Inner Product,
Orthonormal basis,
Orthogonal, Fourier transforms, Convolution and Delta function,
Wavelets transform: Gabor and Short

ti
me Transformations, Time

frequency analysis,
Cardinal spline analysis, Scaling functions and wavelets, Cardinal spline wavelets, bases
of compactly supported wavelets, Applications to signal analysis, Wavelet
Approximation.
Books:
1.
Mallat S., “A Wavelet T
our of Signal Processing”, Academic Press.
2.
Rao R. M., Bopardikar A. S., “Wavelet Transforms: Introduction to Theory &
Applications”, Pearson Education.
3.
Gopinath R. A. and Burrus C. S., “Introduction to Wavelets and Wavelet
Transforms”, Prentice Hall Inc.
4.
C
han Y. T., “Wavelet Basics”, Kluwer Publishers.
5.
Daubechies, “Ten Lectures on Wavelets”, SIAM.
CSE5
2
1
13
EMBEDDED SYSTEMS
3

0

0
Overview of microprocessor and microcontroller, Memory (RAM, ROM, EPROM,
FLASH), I/O Interface, Cross compilers, Host and ta
rget development.
Intel
Microcontroller 8051: Architecture, Addressing mode, Instruction Set, Assembly and C
programming; Other families of microcontrollers: Advanced Virtual RISC (AVR),
Peripheral Interface Controller (PIC).
Microprocessors 80386: Archite
cture, Addressing
mode, Instruction set, I/O interfacing for 8251, 8253/54, 8255, 8257, 8259, 8279;
Advanced RISC Machines (ARM) Processor.
Real Time Operating Systems (RTOS):
Introduction, Process management and Inter process communication, Memory
managem
ent, File system organization, Introduction to Embedded Operating System
(EOS), Real time scheduling, Performance metrics of RTOS, Linux and RTLinux
Internals and programming, Overview of other RTOS/EOS.
Embedded System
Programming: Design issues, Assemblers, Compilers, Linkers, Loaders; Utilities: make,
ranlib, obj copy/dump; Writing device drivers, Interrupt handling.
Microcontroller
Interfacing: LEDs, Switches, LCD, Motors, Relays, ADC/DAC, Sensors.
B
ooks:
1.
David E. Simon, “An Embedded software primer”, Pearson Education.
2.
Kenneth J. Ayala, “The 8051 Microcontroller”, Third Edition, Thomson.
3.
Wayne Wolf, “Computers and Components”, Elseveir.
21
4.
Labrosse, “Embedding system building blocks”, CMP publishers.
5.
Raj Kamal, “Embedded systems”, TMH.
6.
Frank Vahid and Tony Givargis, “Embedded System Design”, John Wiley.
7.
Raj Kamal, “Microcontrollers”, Pearson Education.
Comments 0
Log in to post a comment