School of Physics

Course Structure for M.Tech.(Computational Techniques in Physics)

M.Tech.(CT) is a four semester programme with course work in the first two semesters and
project work in the next two semesters. The course work in I and II semesters comprises
following courses:

Semester I No. of Credits : 24

Course No. Title of the course Contact Credits Participating
Hours School
CT700 Mathematical Techniques – I 4 4 PHY
CT701 Mathematical Techniques – II 4 4 PHY
CT702 Numerical Techniques 4 4 PHY
CT703 Computing Laboratory 4 4 PHY
(including lab. Equivalent of 1 credit)
CS411 Programming Methodology 4 4 DCIS
CS412 Computer Organization 4 4 DCIS

Semester II No. of Credits : 24

Course No. Title of the course Contact Credits Participating
Hours School
Data and File Structures 4 4 DCIS
Design and Analysis of Algorithms 4 4 DCIS

Elective Courses : (Three from Group I and One from Group II)

Group I – Physics Group - II Computer Science

(Each carrying 4 credits) (Each carrying minimum 4 credits)
Course Name of the course Course Name of the course
No. No.
CT726 Quantum Computing Image Processing
CT727 Wavelet Transforms Speech Recognition
CT728 Evolutionary Computing Pattern Recognition
CT729 Dynamical Systems and Chaos Computer Graphics
CT730 Monte Carlo Techniques and Molecular Machine Learning
Dynamics
CT731 Bioinformatics Parallel Computing
CT732 Cryptography (Classical and Quantum) Cryptography
CT733 Direct Discrete Methods Grid Computing
CT734 Introduction to Disorder Colour Image Processing
Computer Networks

Project Work III and IV Semesters : (Total No. of Credits = 24 + 24 = 48)

Grand Total of Credits in 4 Semesters = 96

Note : The DCIS is revising the course numbers. These will be inserted once we receive the
information from them.
 School of Physics
Course Structure for M.Tech.(Computational Techniques in Physics)

M.Tech.(CT) is a four semester programme with course work in the first two semesters and
project work in the next two semesters. The course work in I and II semesters comprises
following courses:

Semester I No. of Credits : 24

Course No. Title of the course Contact Credits Participating
Hours School
CT601 Mathematical Techniques – I 4 4 PHY
CT602 Mathematical Techniques – II 4 4 PHY
CT603 Numerical Techniques 4 4 PHY
CT604 Computing Laboratory 4 4 PHY
(including lab. Equivalent of 1 credit)
CS411 Programming Methodology 4 4 DCIS
CS412 Computer Organization 4 4 DCIS

Semester II No. of Credits : 24

Course No. Title of the course Contact Credits Participating
Hours School
Data and File Structures 4 4 DCIS
Design and Analysis of Algorithms 4 4 DCIS

Elective Courses : (Three from Group I and One from Group II)

Group I – Physics Group - II Computer Science

(Each carrying 4 credits) (Each carrying minimum 4 credits)
Course Name of the course Course Name of the course
No. No.
CT611 Quantum Computing Image Processing
CT612 Wavelet Transforms Speech Recognition
CT613 Evolutionary Computing Pattern Recognition
CT614 Dynamical Systems and Chaos Computer Graphics
CT615 Monte Carlo Techniques and Molecular Machine Learning
Dynamics
CT616 Bioinformatics Parallel Computing
CT617 Cryptography (Classical and Quantum) Cryptography
CT618 Direct Discrete Methods Grid Computing
CT619 Introduction to Disorder Colour Image Processing
Computer Networks

Project Work III and IV Semesters : (Total No. of Credits = 24 + 24 = 48)

Grand Total of Credits in 4 Semesters = 96

Note : The DCIS is revising the course numbers. These will be inserted once we receive the
information from them.
 M.Tech.(Computational Techniques in Physics)

List of proposed changes in the course-structure of the programme:

The changes pertaining to the courses in physics and computer science have been discussed
and approved respectively in the faculty meetings of School of Physics and Department of
Computer and Information Sciences.

Changes in physics courses:

(1) A new 4 credit core course entitled, Mathematical Techniques-II, has been introduced
in the first semester.
(2) The course, earlier known as Advanced Mathematical Techniques has been renamed
as Mathematical Techniques-I. This will run concurrently with Mathematical
Techniques-II in the first semester.
(3) Monte Carlo Techniques and Molecular Dynamics, which was a core course in the
second semester, has been made an elective course in the Group-1.
(4) The elective course called Cellular Automata from Group-1 has been dropped.
(5) The first semester core course, Advanced Scientific Computing [Lab course] has
been renamed as Computing Laboratory.

Changes in computer science courses:

(1) The Group-2 elective course, File Structures, has been removed and merged with the
first semester core course, Data Structures. The new course Data and File Structures,
will now be a 4 credit core course in the second semester.
(2) Algorithmics (renamed Design and Analysis of Algorithms) has been reintroduced as
a 3 credit core course in the second semester.
(3) Four courses have been added to the list of Group-2 elective courses. These are: Grid
computing, Cryptography, Computer Networks and Colour Image Processing; each
will carry a minimum of 3 credits.

Dr Vipin Srivastava
and

Dr S Bapi Raju

M.Tech.(CT) Course Coordinators

 M.Tech. (Computational Techniques in Physics)

SYLLABI

Core Courses (Physics)

CT601 : Mathematical Techniques - I

Statistical methods: Measurements, parametric and non-parametric estimators, Point

estimators of parameters; Distribution of estimators, Test of hypothesis; Linear regression.

Stochastic theory: Random variables and processes, Special classes – Markov sequences and
processes, and Poisson processes; Correlation functions and spectral decomposition;
Sampling and quantization of random signals.

Integral transforms: Generalized Fourier series, Fourier transform, Discrete Fourier

transform, Fast Fourier transform; Laplace transform, causality and stability in the s-domain;
z-Transform, Relation to Fourier and Laplace transforms.

Signal processing: Linear systems, Continuous-time and discrete-time systems, Frequency

response, convolution and impuse response of a LTI system; Differential and difference
equations and frequency response in terms of ‘State Variables’.

CT602 : Mathematical Techniques – II

2. Finite dimensional vector spaces; linear independence; basis; subspaces; sum and direct
sum; quotient space; dual of a vector space; linear operators; scalar product; self adjoint,
unitary and positive projection operators and their properties; tensor product of vector
spaces; connection with quantum mechanics.

3. Basic notions about finite groups and finite fields; elements of coding theory; linear
codes; cyclic codes; applications of fields and groups to error correction and
cryptography.

Books:

1. Finite dimensional vector spaces

P.R.Halmos (Springer)

2. Applied abstract algebra

Rudolf, Lidl and Günter Pilz (Springer)

3. Theory of finite groups: Applications in physics

L. Jansen and M. Boon (North Holland)
CT603 : Numerical Techniques

Integration and Differentiation: Numerical integration, Simpsons’ rule, Gaussian quadrature,

Monte Carlo integration, multidimensional integrals, numerical differentiation.
Interpolation and Extrapolation: Polynomial interpolation, Use of rational functions,
Continued fraction methods, Application of Fourier transform; Extrapolation and inverse
interpolation, Cubic spline.

Matrices: System of linear equations, Inversion and LU-decomposition; Eigenvalues and

eigenvectors; Complex matrices and generalized eigenvalue problem.
Methods of least squares: Statistical description of data, uncertainities and their propagation;
Method of maximum likelihood and method of least squares; Linear least squares fit to data,
Nonlinear fit to data.
Differential equations: Basic methods of solution, Runge-Kutta methods; Adaptive methods.

CT604 : Advanced Scientific Computing

This is a laboratory course, to carry out numerical exercises using Mathematics/ MATLAB,
on the following topics:
Roots of algebraic and transcendental equations (bisection, Newton-Raphson and inverse
interpolation methods); Solution of simultaneous linear equations by matrix inversion
methods; Numerical integration; Ordinary differential equations; Numerical interpolation
techniques; Non-linear boundary value problems; Solitons.

Elective Courses (Group-1)

CT611 : Quantum Computing

Computability (concept of computing machines; Turning-Church machine, von Neuman

architecture)
Complexity – Classification of complexity of problems in terms of computation time.
Postulates and Foundations of Quantum Mechanics; Theory of linear vector spaces and
Hilbert space; Quantum Parallelism; Entanglement; Spin; Qubits; Non-separability of EPR
pairs; Bell inequalities; Decoherence problem; Quantum logic gates and networks.
Some quantum algorithms – Shor’s factorization algorithm; Grover’s search algorithm; etc.,
Experimental realizations: Ion trap; Nuclear magnetic resonance; Josephson junction arrays;
etc.
CT612 : Wavelet Transforms

Integral wavelet transform, Time-frequency analysis; Inversion and duals; Classification of

wavelets; Multi-resolution analysis, splines and wavelets; wavelet decompositions and
reconstructions.

Gabor transform, Short-time Fourier transforms and uncertainty principle; dyadic wavelets
and invesrsions, Frames, Wavelet series.

Cardinal spline spaces, Two-scale relation, Interpolatroy displacy algorithm, Computation of

cardinal splines; Spline approximate formulae, Spline interpolation formulae.

Scaling functions and Wavelets: Multiresolution analysis, Direct-sum decompositions,

Linear-phase filtering, Compactly supported wavelets.

Orthogonal wavelets and examples; Orthogonal two-scale symbols; Wavelets packets,

Orthogonal decomposition of wavelet series.

Application to signal and image processing; Use in pattern recognition and neural networks.

CT613 : Evolutionary Computing

Brief introduction of biological neural network; structure and dynamics of neurons and
synapses.

Definition of neurons: McCulloch and Pitts’ model; Perceptron model; Perceptrons to

perform logical functions (NOT, AND, OR, etc.); Hidden layers and XOR; Cognitron.

Learning algorighms – supervised and unsupervised learning; Energy functions; Principal

componets; Oja’s algorithm; Back-propagation algorithm.

Associative networks; Hebbian learning; Pseudoinverse; Hopfield model.

Fuzzy logic: Brief introduction to Genetic algorithms and Kohonen network.

CT614 : Dynamical Systems and Chaos

Review of Hamiltonian Dynamics: Special Emphasis on the Hamilton Jacobi Theory and
Angle variables. Solutions of Hamilton’s equations etc., canonical Transformations, Phase
Space Dynamics.
Integrable Models: Definition of Integrability for Hamiltonian System, KAM theorem,
Classical Perturbation theory.

Cahos in Hamiltonian Systems and Maps: Simple chaotic Hamiltonian Systems, Lyapunov
Exponets, Poincare Sections, Power Spectra, Kolmogorov Entropy and other systems, noise
analysis in electrical circuits.
Measures of Chaos in Hamiltonian Systems: Simple Maps, area preserving maps, Fixed point
and Poincare Birkhoff theorems.
Dynamics of Dissipative Systems: Dissipative systems and turbulence. Strange Attractors
Lorenz and Rossler attractors.
Non-Linear Evolution Equations and Solitons: KDV equations, Inverse Scattering,
application in Particles and Condensed Matter Physics.
Brief Introduction to Semi-Classical and Quantum Chaos Examples from Particle Physics
and Condensed Matter Physics.
Numerical Simulation of Chaotic systems.

CT615 : Monte Carlo Technique and Molecular Dynamics

Generation of random numbers, uniform distribution, linear congruence method; Tests for
randomness; Frequency and run tests; Random numbers with a given distribution, Rejection
technique, Metropolis algorithm. Data simulation and hypothesis testing, Estimate of
confidence region with Monte Carlo methods.
Application of MC technique: Molecular diffusion, Brownian motion; Percolation; Critical
phenomena and Ising model; Path integrals in quantum mechanics.
Molecular Dynamics: Newtonian and Hamiltonian dynamics; Phase-space trajectories;
Periodic boundary conditions; Conservation principles.
Kinematics of collisions; Collision times, Simulation algorithm, Phase diagrams,
Unpredictability, Finite-difference methods, Euler’s method, Leap-Frog Algorithm;
Algorithm for molecular dynamics.

CT616 : Bioinformatics

Introduction to proteomics. Introduction to genomics and gene-expression.

Algorithms in Bioinformatics: local and global similarity algorithms; BLAST, PAM and
PAM-250 matrices; Computation of an alignment of two sequences; Scores of insertion,
deletion and replacements; Search algorithms.
Image analysis, cluster analysis and pattern recognition – applications in biology; Patterns in
proteins and nucleic acid sequences: Sequence comparison; Comparison of amino acid
sequences; Alignment of sequences; DNA sequence patterns; Matrix patterns in multiple
alignments.

CT617 : Cryptography (Classical and Quantum)

Introduction to information Theory: Uncertainty, information and entropy; Shanon’s measure

of information.

Concept of cryptography – classical and modern.

Public key cryptography – RSA algorithm (implementation in Matlab and C ++; Deffe-
Hellman key Exchange; Elliptica curve cryptography.

Message authentication – Introduction to Coding Theory and Coding procedures; Shanon-

Fano and Huffman encodingl; Codes with redundancy; Hash algorithms; MD5 message
digest algorithms.

Applications – Digital signatures (implementation in Matlab); Digital certificates; and EPR

non-separability; Quantum dense coding; Key distribution and protocol; No-cloning;
Quantum Error Correction; Teleportation; Eavesdropping.

Simulation of a quantum crypto system in C++.

Experimental realizations of quantum cryptography.

CT618 : Direct Discrete Methods

Diakoptics: Topological and algebraic structures, Underlying physics; Need of diakoptics for
computational considerations; Tearing and partitioning of topological and algebraic
structures.

Isolation of subdivisions: Tieless subdivisions, Intersection network, Diakoptics of nonlinear

structures and for optimization problems. Topological models of elastic field.

Electric circuit models of partial differential equations: Combined diffusion and wave terms;
Pyramiding super-system solutions; diakoptics for eigen value problems and time varying
problems.

Integer programming: Matrix games; Games of strategy and chance; Triadic games and
coalitions, Iterated games, Prisoner’s dilemma models.
Artificial neural networks as learning circuits: Network architecture, Back-propagation
algorithms; Associative learning; Hebb --, Kohonen -- , and elman learners; Self-organization
in neural networks; Hopfield model.

CT619 : Introduction to Disorder

Perfect spatial order and lattice symmetries; Positional and topological disorder, Self-
similarity and dialatory symmetry;
Fractals – meaning and types; fractial dimensions;
Percolation – meaning and definitions; bond and site percolation; critical parameters;
ultrametric structure of percolation; fractal nature of percolation cluster;
Synergetics – meaning and examples; stochastic city and predictability – statistical
mechanics, quantum fluctuations.

Chaos – limit cycles; bifurcation; attractors; Lyapunov exponents; discrete maps; Self
organization.

Core Courses (Computer Science)

CS411 : Programming Methodology

Problem Analysis, flow Charts, decision tables. Pseudo codes and Algorithms, High level
language and Programmer’s Model of Computer System. Algorithmic Programming
Language. Representation of Integers, reals, characters, constants and variables, arithmetic
expressions and their evaluation using rules of hierarchy Assignment statements, Logical
constants variables and expression Control structures – sequencing alteration, iteration.
Arrays, Manipulating vectors and matrices. Subroutines overhead cost, interpretation of the
variances. Introduction to computerized accounting system: Coding logic and codes
required, master files, transaction files, introduction to documents used for data collection
Processing of different files and output obtained.

CS412 : Computer Organization

Representation of Information, Number systems, integer and floating point representation,

character codes (ASCII, EBCDIC). Error detection, Correction codes. Basic Building blocks:
 Boolean Algebra, Combinational logic design, flip-flops, registers, ALU; Arithmetic and
Logic Operations Organization of Control Units. Memory: types and organization, Peripheral
Devices. I/O devices (Video terminals and printers) and controllers. Storage Devices (Tape
and disks). Programmed interrupt control mechanisms. I/O controllers, Bus bandwidths.
Assembly Language Programming, Programmers model of a machine.
Example of a typical 16 to 32 bin processor. Registers, Addressing modes, Instruction set, use
of an assembly language for specific programs for typical problems like: Table Search,
subroutines, Symbolic and numeric manipulations and I/O.

Data and File Structures

Prerequisite: A basic course in programming (Programming

Methodology)
Aim: This is a first level course that describes various structuring
methods of data, their practical use and introduces the concepts of
external data storage schemes.
Course Content:
Module I: Fundamental Notations: Primitive and Composite Data types,
Time and Space Complexity of Algorithms, Sorting Algorithms. Data
Structures: Stacks, Queues, Arrays, Linked Lists, Trees and Graphs.
Module II: Fundamental File Structure Concepts; Organizing Files for
Performance; Keysorting; Indexing; Consequential Processing and the
Sorting of Large Files; B-Trees and Other Tree-structured File
Organizations; The B+ Tree Family and Indexed Sequential File Access;
Hashing; Extendible Hashing.
Course format: Lectures, Tutorials and Programming assignments.
Books:
1. Wirth, Nicolaus: Algorithms + Data structures = Programs. Prentice-
Hall International, 1975.
2. Horowitz, E., and Sahni.S: Fundamentals of Data structures.
Computer Science Press, 1978.
3. Knuth, D.: The Art of Computer Programming, Vols. 1-2. Addison-
Wesley, 1970-80.
4. Aho, A. V., Hopcroft, and Ullman, J.E.: Data Structures with Pascal,
Prentice-Hall International, 1985.
5. Tanenbaum, A.M., and Augenstein, M.J.: Data Structures with Pascal,
Prentice-Hall International, 1985.
6. Stubbas, D.: Data Structures with Abstract Data Types and Modula2,
Brooks & Cole Pub. Co. 1987.
7. Trembley & Sorenson: An Introduction to Data Structures with
Applications; Tata McGraw Hill.
8. Kruse, R. L., Leung, B. P., and Tondo, C. L.: Data Structures and
Program Design in C; Prentice-Hall of India, 1999.
9. Weiss, M. A.: Data Structures and Algorithm Analysis in C++;
Addison-Wesley, 1994.
10. Michael J. Folk and Bill Zoellick, “File Structures” (Second Edition).

Design and Analysis of Algorithms

Prerequisite: Data Structures

Aim: This course builds on Data Structures and emphasizes algorithm designs and analysis.

Course Content: Efficiency of algorithms; Asymptotic Notation; Analysis of Algorithms;

Solving recurrences; Application of data structures; Greedy Algorithms, Spanning trees,
shortest paths, knapsack problem, scheduling problem; Divide-and-conquer, binary search,
sorting; Dynamic programming principle of optimality; Graph Algorithms, BFS, DFS, Back
tracking, Branch and Bound; Computation Complexity, reductions and introduction to NP-
completeness; Examples and brief overview of heuristic, probablistic and parallel algorithms,
String Matching methods.

Books:

1. Fundamentals of Algorithms, G.Brassard and P.Bratley, PH India 1997.

2. Fundamentals of Computer Algorithms, E.Horowitz and S.Sahani, Galgotia Publications.
3. Introduction to Algorithms, T.H.Cormen, CE Leigerson, R.Rivest, PH India 1998.

Elective Courses (Group-2)

Image Processing

Digital image processing : problems and applications, image representation and models,
image enhancement, image restoration and analysis, image reconstruction from projections
and image coding, data compression.

2-d systems and related mathematical preliminaries : linear systems and shift invariance,
Fourier Transform (FT) correlation, optimal modulation transfer function (MTF), random
processes, stationary, statistical independence, orthogonality.
Image perception : light and related quantities, MTF of visual system and visibility function,
monochrome vision models, image fidelity, color difference measures, colour vision model
and temporal properties of vision, image quality evaluation.
Image sampling and quantization : image scanning and TV standards, image display and
recording, 1-d and 2-d sampling theory, reconstruction from samples, practical limitations of
sampling and reconstruction, image quantization, optimum quantizers, visual quantization.
Image transforms : 2-d orthogonal and unitary transforms, 1-d and 2-d discrete FT (DFT), the
Hadamad transform, the KL transform, singular value decomposition (SVD) transform.

Image enhancement : point operators, histogram modeling, spatial operators, transform

domain operators, multi-spectral image enhancement, colour image enhancement.
Image filtering and restoration : image observation/degradation models, inverse and Wiener
filtering, Fourier domain filters, filtering based on image transforms, interpolation and
smoothing splines, generalized inverses, digital processing of speckle images, maximum
entropy and Bayesian methods.
Image analysis and computer vision: spatial feature extraction, transform features, edge
detection, boundary extraction, boundary representation, region representation, moment
based representation, structure, shape features, texture, scene matching and detection, image
segmentation, image understanding.
Image data compression : motivation, pixel coding, predictive coding techniques, transform
coding of images, theory and algorithms, hybrid coding and vector DPCM, video coding,
inter-frame coding, coding of 2 tone images, image coding standards, JBIG, JPEG and
MPEG-I and II.
Advanced topics : image representation and models, scale space, pyramids, sub-bands,
wavelets, image processing, software, hardware.

Speech Recognition

Digital models for the speech signal, time-domain models for speech processing, linear
predictive coding of speech, man-machine communication by voice, hypothesizing and
verifying words for speech recognition.

Prosodic aids to speech recognition syntax, semantics and pragmatics, the HWIM speech
understanding system, the Harpy speech understanding system, the Hearsay-II speech
understanding system.

Pattern Recognition

Statistical pattern recognition:

Introduction, Gaussian model, discriminant functions, classifier performance, risk and errors.
Supervised learning using parametric and non-parametric approaches, ML estimation,
Bayesian parameter estimation approach, Parzen windows, k-n estimation. Unsupervised
learning and clustering, the clustering concept, c-means algorithm, learning vector
quantization, clustering strategies, a hierarchical clustering procedure.

Syntactic pattern recognition:

Introduction to formal language, string languages for pattern recognition, selection of pattern

primitives, pattern grammars. PDL, transition network grammar for pattern description,
automated transition nets (ATNs).

Higher dimensional grammars, Web and graph grammars, tree grammars, grammar
describing 3-d objects.

Syntax analysis as a recognition procedure, parsing top-down parsing, bottom-up parsing,

Cocke-Younger-Kasami (CKY) parsing algorithm, Earley’s parsing algorithms, LL(k) and
LR(k) grammars.

Stochastic languages for syntactic pattern recognition, basic formulation, probability

measures associated with linear and context-free grammars, languages accepted by stochastic
automata, stochastic programmed and indexed grammars.
Structural pattern recognition:
Imaging model, radiometric models, geometric models, sampling and quantization,
tessellation, image models.
Graphs and grid, fundamentals of graph theory, basic algorithms for graphs, fundamental
discrete geometry, connectivity and topology, segmentation: edge, region and texture.
Boundary representation projection, Fourier descriptors, region representation, shape
descriptors, mask and moments, thining MAT, scene analysis method.

Computer Graphics
Introduction: History, Advantages, Application, I/O Devices Graphic Packages, Languages.
2D Graphics: Drawing Elementary figures, Polygon Filling, Transformations, Windowing
and clipping, Display file segmentation. Interactive Graphics: Interactive input techniques,
Event handling, Input functions; 3D Graphics and Realism: Mathematical Preliminaries,
Curves and Surfaces, Clipping, Hidden line and surface removal, rendering, real-time
graphics; Interactive, Procedural elements for Computer Graphics, McGraw Hill Book
Company, 2nd Edition, 1985. Introduction to Visualization, Tools for Visualization,
Applications etc.

Machine Learning

Prerequisite: Basic computer science background or instructor's permission.

Aim: First course introducing various techniques of machine learning.

Course Content: Review Basic Tasks, Methods and underlying problems of Machine
Learning. Learning methods such as role, analogical, EBG, EBL, Chunking. Learning by
examples - Version space algorithm and ID3 algorithm . Important systems and applications
to the problem of knowledge acquisition for expert system.

Books:
1. Michalsky, Mitchel T.J.Corbonell, Springer: Machine Learning - Verlag.
2. Mitchel T. Machine Learning: A Guide to Current Research.

Parallel Computing

Introduction to Parallel Computing: Why Parallel Computing & Scope of Parallel

Computing, Sieve of Eratosthenes, Control and Data Approach, PRAM model of parallel
computation, Relative strength of the models, Design paradigms of Parallel Computing,
examples. Classification: Taxonomies: MPP, SMP, CC-NUMA, cluster: dedicated high
performance (HP), high availability (HA), CoPs, PoPs, CoWs; distributed, on-demand, high-
throughput, collaborative, data-intensive computing, Interconnection networks, Flynn’s
Taxonomy

An overview of Parallel Programming Paradigms: Programmability Issues, Programming

Models: Message passing, client-server, peer-to-peer, broker computing, code shipping,
proxy computing, mobile agents.

Storage and file problems: Network RAM, RAID and software RAID. Distributed File
systems: NFS, AFS, OSF-DSF, RSF

Message passing standards: PVM (Parallel Virtual Machine), MPI (Message Passing
Interface) Message Passing Interface (MPI) and its routines, Advanced Features of MPI: MPI
advanced point-to-point communication MPI Communication modes; MPI Collective
Communication and Computations; MPI Derived Datatypes;

Performance Metrics & Speed Up: Types of Performance requirements, Basic Performance
metrics; Workload Speed Metrics; Performance of Parallel Computers-Parallelism and
interaction overheads; Overhead Quantification and measurement methods; Performance of
parallel programs; Performance metrics; Scalability and Speed-up Analysis

Overview of Programming with Shared Memory: OpenMP (History, Overview,

Programming Model, OpenMP Constructs, Performance Issues and examples, Explicit
Parallelism: Advanced Features of OpenMP), Cluster Computing: Clustering of Computers,
Beowulf Supercomputer, Use of MPI in Cluster Computing. Debugging, Evaluating and
tuning of Cluster Programs, Partitioning and Divide and Conquer Strategies. Applications:
Cluster Based algorithms and applications for Sorting, Numerical Algorithms like Matrix
Addition, Matrix Multiplication, Solving linear system, Image Processing Algorithms.
Shared Memory Programming –

References:
1. Quinn, M. J., Parallel Computing: Theory and Practice (McGraw-Hill Inc.)
2. Bary Wilkinson and Michael Allen: Parallel Programming Techniques using Networked
of workstations and Parallel Computers, Prentice Hall, 1999.
3. R. Buyya (ed.) High Performance Cluster Computing: Programming and Applications,
Prentice Hall, 1999.

Cryptography

Basics of Number theory; Basics of Algebra; Classical cryptography; Introduction to

Information Theory; DES; Differential Cryptanalysis; Primality; RSA Crypto System
Discrete log problem, ElGamal Crypto System; Elliptic Curve System; Knapsack System
with Shamir’s attack; Attacks on RSA; ElGamal

Signature Schemes; Signature and Hash functions; Secret sharing schemes; Pseudo Random
Number generation; Zero Knowledge proofs; Topics of Interest

Text Books
Douglas Stinson, “Cryptography: Theory and Practice”
Buchmann Johannes “Introduction to Cryptography”
Alfred J Menezes “Hand Book of Applied Cryptography”
Lawrence C Washington “Elliptic Curves Number Theory and Cryptography”

Grid Computing

Prerequisite: Knowledge of Introductory Algorithms, Networks, Java/C/C++, and

Unix/Linux.

Course Outline: Here is a preliminary and non-exhaustive list of topics we will be or might
be covering. This is subject to change with advanced notice, partly based on the
understanding of the students.

Introduction to High Performance Computing: Why Parallel Computing, Control and Data
Approach, PRAM model of parallel computation, Classification: Taxonomies: An overview
of Parallel Programming Paradigms: Programmability Issues, Programming Models:
Message passing MPI (Message Passing Interface) Message Passing Interface (MPI) and its
routines Overview of Programming with Shared Memory Open MP

Client-Server Architecture: Definitions, Basic Mechanics of Client-Server, Issues,

concurrency Protocol, Error Checking, Logging, Stateful vs Stateless services, Distributed
Objects, Basics RMI Introduction, RMI Configuration, Remote Object Activation.

Web Services: Extensible Mark-up Language XML Introduction, some key aspects of XML–
Document-centric XML Data-centric XML, XML-based Web Services, Simple Object
Access Protocol (SOAP), Web Service Definition Language (WSDL), UDDI (Universal
Description Discovery and Integration) The topics covered include: Web software
architectures; languages and standards for data and applications on the World Wide Web;
protocols for data exchange, program invocation, self-description, and discovery that form a
basis for Web Services. Technologies include HTML, HTTP, XML, SOAP, and WSDL. The
development platform will be Java Web Services platform. The use of these technologies for
creating simple/advanced client-server and distributed applications will also be discussed.

Grid Services: Introduction to Grid Computing with Globus Toolkit, Overview of Grid
Middleware Distributed Object Technology for Grid computing (OGSA, WSRF) Grid
Middleware: JavaCoG, GSI etc. Developing Grid Services.

Applications: Deployment of web and Grid based services for Geo Applications using Geon
Portal, design of framework for grid services, design of Grid Portals.
Web sites: (Not Exhaustive)
http://www.w3.org/TR/soap/
http://www.w3schools.com/xml/xml_whatis.asp
http://gdp.globus.org/gt4-tutorial/multiplehtml/v
http://www3.niu.edu/mpi/
http://www.pankaj-k.net/axis4tag/
http://www.ammai.com/webservices

Colour Image Processing

Prerequisite: Image Processing

Today, almost all images are in colour and a majority are only in a digital form. However,
understanding their representation on the computer and processing them are almost
completely neglected in our curricula. Image processing courses deal exclusively with
grayscale images and students are often given the impression that colour image processing is
only an extension of grayscale image processing.
The truth is that colour image processing is almost entirely different from grayscale image
processing. From representation to enhancement, restoration to compression, primitive
operations to feature extraction, colour image processing presents different challenges and
poses questions that grayscale image processing cannot handle.
This course is designed to provide M.Tech Students, who have already done a course on
image processing at B.Tech level, with understanding of the basic concepts of digital colour
and how it differs from the physics of colour; colour models and spaces; challenges and
difficulties in processing colour information; a new set of tools, algorithms and techniques to
process colour images; and practical applications. It is an advanced course for which there is
no available textbook, and necessary material is collected from papers, reference books and
WWW.

Syllabus:
1. Introduction to colour:
The physical basis of colour, the human vision system, and the concepts of colour and
intensity of light
2. Colour representation:
Tristimulus responses, colour models and colour spaces, CIE chromaticity diagram,
Munsell’s colour chart, and description by primary colours and combinations
3. Digital representation of colour:
 Different colour representations such as RGB, CMY, CMYK, HSV, etc., their origins,
strengths and weakness
4. Quantization and dithering:
The need to reduce colour information, quantization and dithering algorithms, and their
uses in reduced colour images, photocopiers, colour faxes, etc.
5. Colour image enhancement and restoration:
Why mere extensions from grayscale processing such as histogram stretching and
equalization are unsuitable, new operations such as colour polarization, saturation and hue
corrections, colour noise removal, etc.
6. Spatial colour filters:
Extensions of smoothing, sharpening and edge-detecting filters, and new operations
specific to colour images
7. Colour similarity:
How meaning similarities and differences between colours is much more complex than
measuring differences in intensities, MacAdam ellipses, perceptual uniformity and
perceptually uniform colour spaces, various colour distance measures
8. Interesting colour image processing examples:
Colour image processing filter that mimics a physical filter, transforming a colour image
into a cartoontype colouring sheme, newsprint/teletype filter, day-time to nigtime filter,
and others
9. Applications of colour image processing:
Colour similarity measures in Content Based Image Retrieval, forensic analysis of
documents, watermarking and steganography, and others

Computer Networks

Pre-requisites: Computer Organisation, Data Structures, Operating Systems although not

essential algorithms background would be beneficial.

Aims and Objectives: This is a first course in computer networks introducing all the essential
concepts and builds a basis for further courses such as Internet Technologies, Electronic
Commerce and Multimedia. This course should be (ideally) run with a course on Network
Programming where the programming and systems aspects of the network concepts are
consolidated in a practical sense. (The network programming course could also follow this in
a subsequent semester.)

Syllabus:
Communications Model: Communications model, data communications tasks; networking,
layering and design issues, ISO-OSI model, protocols, services, standards, network goals and
applications.
 Data Communication: Physical layer; transmission media, encoding, interfaces,
switching and signaling methods, multiplexing and medium access control.
 Data Link Layer: Framing, error control, flow control, data link protocols,
retransmission strategies and their performance.
 Network Layer: Routing and congestion control algorithms, inter-networking
principles, Internet Protocol, bridges etc. devices.
  Transport Layer: Transport services, connection management, TCP, UDP, quality of
service parameters, TCP/IP over ATM networks.
 Network Security: Data encryption strategies, authentication protocols, firewalls.
 Basic applications: telnet, rlogin, FTP. TFTP, NFS, DNS, SMTP, MIME, SNMP,
HTTP etc.
 Network Infrastructure for advanced applications: E-commerce, multimedia, mobile
and wireless computing.

Books and References:

1. Bertsekas, D and Gallager, B.: Data Networks, Prentice Hall of India 1992. (2nd Edition)
2. Black, U.D.: TCP/IP and Related Protocols, MacGraw Hill New York 1995.
3. Black, U.D.: Computer Networks, Protocols Standards and Interfaces, Prentice Hall
International
4. Comer (includes Comer and Stevens, D.L. three Volumes): Internetworking with TCP/IP
Principles protocols and architecture, Prentice Hall of India, 1995.
5. Goralski, W.J.: Introduction to ATM networking, McGraw Hill New York, 1995.
6. Keshav, S.: Computer Networks: an Engineering Approach, Addison-Wesley, Reading,
1997.
7. Stallings, W.: Network and Internetwork security, Prentice Hall International 1995.
8. Stallings, W. Data and Computer Communication 5th Edition, Prentice Hall of India,
1997.
9. Stevens, W.R: TCP/IP Illustrated ( Three Volumes), Addison-Wesley, Reading, Mass.
1995
10. Tanenbaum, A.S.: Computer Networks Third Edition, Prentice Hall of India, 1997.