Proposed M.

TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

CURRICULUM AND SYLLABI

For proposed

MASTER OF TECHNOLOGY

In

COMPUTER SYSTEMS AND TECHNOLOGY

At

Dr. B. C. Roy Engineering College

(BCREC)
Jemua Road, Fuljhore,
Durgapur – 713206

Page 1
 Proposed M. TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

BASIC INFORMATION ABOUT THE PROPOSED COURSE

1. SCOPE
Dr. B. C. Roy Engineering College (BCREC), Durgapur, a private
Engineering College affiliated to West Bengal University of Technology
(WBUT), proposes to offer a Master of Technology (M.Tech) course in
Computer Systems & Technology. The course is designed to provide a
balanced mixture of theoretical and professional training in Computer
Systems and Information technology. It is hoped that students, on
successful completion of the M Tech programme, may take up either a
professional career in software industry or an academic career in an
engineering college.

0 DURATION
The duration of the course is two years inclusive of the period of
course work during the first year and project work during the second
year with the objective to submit a dissertation at the end of the
second year.

1 ELIGIBILITY
A candidate seeking admission to this course should have
Either
• A Bachelor’s degree in Engineering/Technology
(BE/B Tech) in CSE/IT/ECE.
Or
0 A Masters degree: M. Sc. in Computer Science/ M.
Sc. in Software Engineering/ Master of Computer
Applications (MCA).

2 SELECTION
Selection of candidates for admission to the programme will be made
from time to time as per the current norms, standards and guidelines
of AICTE and WBUT.

3 DEVELOPMENT PLAN
The programme is expected to encourage development of R&D
activity in the college. Students may take up research oriented one-
year project work and extend the work further after completion of the
programme as part of their Ph D work. Further there is enough scope
for the students to take up software development work as their M
Tech project, which may lead to entrepreneurship, industry-institute
partnership or consultancy.

Page 2
Proposed M. TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

COURSE STRUCTURE
FIRST YEAR FIRST SEMESTER

A. Theory
S Code Subject Contact Cr
N Periods
L T P To
1. CST 1101 Advanced Operating System 4 0 - 4 4
2. CST 1102 Advanced Computer 0 - 4 4
Architecture 4 0 -
3. CST 1103 Elective-I 3 0 - 3 3
4. CST 1103 Elective-II 3 0 - 3 3
5. CST 1103 Elective-III 3 3 3
6. CST 1104 Discrete Mathematics 3 0 - 3 3

Total Theory 2 20
0
B. Practical
1. CST 1191 Advanced OS Lab 0 0 3 3 2
Total Practical 3 2

C. Sessional
1. CST 1181 Technical Report Writing 0 0 3 3 2
Total of Sessional 3 2
Total of Semester 26 24

CST 1103: Electives I—III

(Select any three from Group A)

Group A Electives:
Foundations of Computing

A1. Coding and Information Theory

A2. Logic and Logic Programming
A3. Computer Graphics
A4. Soft Computing
A5. Advanced Compiler
A6. Graph Theory and Combinatories
A7. Algorithm and Complexity

Page 3
Proposed M. TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

COURSE STRUCTURE
FIRST YEAR SECOND SEMESTER

A. Theory
SN Code Subject Contact Cr
Periods
L T P To
1. CST 1201 Distributed systems 4 0 - 4 4
2. CST 1202 Elective-IV 3 0 - 3 3
3. CST 1202 Elective-V 3 0 - 3 3
4. CST 1202 Elective-VI 3 0 - 3 3
5.. CST 1202 Elective-VII 3 0 - 3 3
6. CST 1203 Management for advanced 3 0 - 3 3
technologists
Total Theory 1 19
9
B. Practical
2. CST 1291 Distributed Systems Lab 0 0 3 3 2
Total Practical 3 2
C. Sessional
1. CST 1281 Group Discussion 0 0 3 3 2
2. CST 1282 Comprehensive Viva Voce 0 0 0 0 2
Total of Sessional 3 4
Total of Semester 25 25

CST 1202: Electives IV - VII

(Select any four from Group B / Group C

taking at least one from each group)
Group B Electives: Group C Electives:
Computer Systems Information Technology

B1. Pattern Recognition and C1. Data Warehousing and

Machine Learning Data Mining
B2. Image Processing and C2. Multimedia Technology
Computer Vision C3. Mobile Computing
B3. Parallel Algorithms C4. Software Quality Management
B4. Artificial Intelligence C5 Object Oriented System
B5. Cryptography and Design
Network Security C6. Web Technology
B6. VLSI System Design C7. E-Commerce
B7. Embedded Systems C8. Internetworking

Page 4
Proposed M. TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

Page 5
Proposed M. TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

COURSE STRUCTURE
SECOND YEAR FIRST SEMESTER

A. Project
1. CST 2191 Detailed Design of a two 0 0 18 18 12
Semester Project with
Documentation.
Total Practical 18 12

B. Sessional
1. CST 2181 A Critical Review and a 0 0 6 6 4
Seminar on a topic other
than Project topic.
Total of Sessional 6 4
Total of Semester 24 16

COURSE STRUCTURE
SECOND YEAR SECOND SEMESTER

A. Project
1. CST 2291 Implementation of the 0 0 18 18 12
Project
Total Practical 18 12

B. Sessional
1. CST 2281 A Report and a Seminar on 0 0 6 6 4
Recent Developments in an
area other than Project
area.
Total of Sessional 6 4
Total of Semester 24 16

Page 6
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

DETAILED SYLLABI

FIRST YEAR FIRST SEMESTER

COMPULSORY COURSES

CST 1101: Advanced Operating Systems (4-0-0) Credit 4

Introduction
Basic concepts, design issues, types of advanced OS, case studies of
contemporary operating systems.
Process Synchronization
Concepts, critical section problems and solutions, some standard critical
section problems and their solutions using semaphore, distributed
mutual exclusion, algorithms to solve distributed mutual exclusion
problem.
Deadlock Handling
Concepts, different models of deadlock, handling strategies centralized
and decentralized deadlock detection algorithms, comparative studies of
different detection algorithms.
Resource Management
File systems, shared memory, scheduling for CPU.
Fault Tolerance
Introduction, atomic actions and committing, different voting protocols,
dynamic vote reassignment processes, failure resilient processes, case
studies.
Protection and Security
Introduction, access matrix model, advanced models of protection, case
studies on protection, cryptography concept, symmetric and asymmetric
cryptography, public key and private key cryptography algorithms,
implementation issues of RSA algorithm.
Some Other Issues
OS issues related to the Internet, intranets, pervasive computing,
embedded systems, mobile systems and wireless networks.

References:
1. M.Singhal, N.Shivaratri: Advanced concepts in operating systems,
McGraw Hill, 1994.
2. Distributed Systems Concepts and Design, Coulor is et al., Addison-
Weley Publishing Company 2000
3. Distributed Systems: Principles and Paradigms, A. S. Tannenbaum,
Prentice Hall 1999

Page 7
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

CST 1102: Advanced Computer Architecture (4-0-0) Credit 4

Introduction to Computer Architecture:

Design rules for computer architecture – Register Files, ALU, Control unit.
Parallel computer models:
State of computing, Classification of parallel computers, Multiprocessors
and multicomputers, Multivector and SIMD computers
Program and network properties:
Conditions of parallelism, Data and resource Dependences, Hardware
and software parallelism, Program partitioning and scheduling, Grain
Size and latency, Program flow mechanisms, Control flow versus data
flow, Data flow Architecture, Demand driven mechanisms, Comparisons
of flow mechanisms
System Interconnect Architectures:
Network properties and routing, Static interconnection Networks,
Dynamic interconnection Networks, Multiprocessor system
Interconnects, Hierarchical bus systems, Crossbar switch and multi-port
memory, Multistage and combining network.
Advanced processors:
Advanced processor technology, Instruction-set Architectures, CISC
Scalar Processors, RISC Scalar Processors, Superscalar Processors, VLIW
Architectures, Vector and Symbolic processors
Pipelining:
Linear pipeline processor, nonlinear pipeline processor, Instruction
pipeline Design, Mechanisms for instruction pipelining, Dynamic
instruction scheduling, Branch Handling techniques, branch prediction,
Arithmetic Pipeline Design, Computer arithmetic principles, Static
Arithmetic pipeline, Multifunctional arithmetic pipelines
Memory Hierarchy Design:
Cache basics & cache performance, reducing miss rate and miss penalty,
multilevel cache hierarchies, main memory organizations, design of
memory hierarchies.
Multiprocessor architectures:
Symmetric shared memory architectures, distributed shared memory
architectures, models of memory consistency, cache coherence
protocols (MSI, MESI, MOESI), scalable cache coherence, overview of
directory based approaches.

References:
1. Kai Hwang, “Advanced computer architecture”; TMH 2003.
2. D. A. Patterson and J. L. Hennessey, “Computer organization
and design,” Morgan Kaufmann, 2nd Ed. 2000
3. J.P.Hayes, “computer Architecture and organization”; MGH..

Page 8
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

4. Hwan and Briggs, “Computer Architecture and Parallel

Processing”; MGH 1999.

FIRST YEAR FIRST SEMESTER

GROUP A ELECTIVES I - III: FOUNDATIONS OF COMPUTING

CST 1103 A1: Coding and information Theory (3-0-0) Credit 3

Introduction:
Information, channel capacity, The concept of amount of information,
entropy, Information rate, Conditional and joint entropies.

Foundations: probability, uncertainty, information: How concepts

of randomness, redundancy, compressibility, noise, bandwidth, and
uncertainty are related to information. Ensembles, random variables,
marginal and conditional probabilities. How the metrics of information
are grounded in the rules of probability.

Entropies defined, and why they are measures of information:

Marginal entropy, joint entropy, conditional entropy, and the Chain Rule
for entropy. Mutual information between ensembles of random variables.
Why entropy is the fundamental measure of information content.

Source coding : Noise less coding, Shannon’s first fundamental

theorem, Discrete memory less channel, Mutual information, Sources
with finite memory, Markov sources, Shannon’s second fundamental
theorem on coding, Huffman coding, Lempel – Ziv algorithm, Shannon-
Fano algorithm.

Channel coding: Error detecting codes, Hamming distance, Error

correcting codes, Repitition codes, Linear block codes, binary cyclic
codes, BCH codes, Reed-Soleman codes, Golay codes.

Convolution Coding: Code tree, state diagram, Trellis diagram,

Maximum-Likelihood decoding – Viterbi’s algorithm, sequential decoding.
Network information theory, introduction to Cryptography

References:

1. T M Gover, J M Thomos, “Elements of Information Theory”, Wiley,

1991
2. Haykins S, “Digital Communications”, Wiley 2000
3. J.G.Proakis, “Digital Communications”, Mc Graw Hill 2002

Page 9
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

Page 10
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

CST 1103 A2: Logic and Logic Programming (3-0-0) Credit 3

Introduction:
Basic set theory, Induction, Structural induction, Recursion, Recursive
definition.

Propositional logic:
Syntax, Formation trees, Semantics of propositional logic, Evaluation of
formulas with trees, Satisfiability and tautology, Truth-table method,
Compactness, Soundness, Completeness, Consistency.

First order Predicate logic:

Syntax, Terms, Formulas, Closed formulas, Semantics of Predicate logic,
Valid formulas, Prenex and Skolem normal forms, Satisfiability of set of
formulas, Herbrand structures, Lowenheim-Skolem theorem,
Compactness, Consistency, Henkin’s theorem, Godel’s completeness
theorem.

Automated theorem proving:

Clausal form, Unification, Semantic tableaux and resolution in
propositional and predicate logic.

Logic Programming:
Basic concepts, Execution of a query in logic program, Interpreter for
logic program, Prolog program, Prolog control strategy.

Programming in Prolog:
Recursion, Iterative programming, List manipulation, Binary trees in
Prolog, CUT and its use.

References:
1. Bratko I., Prolog programming for Artificial Intelligence, 2nd ed.,
Massachusetts, Addison-Wesley, 1990.
2. Clark K.L., Logic programming, New York, Academic Press, 1982.
3. Enderton H.B., A mathematical introduction to logic, 2nd ed., San
Diego, Academic Press, 2001.
4. Kelly John, The essence of logic, Prentice Hall of India, 1997.
5. Mendelson E., Introduction to mathematical logic, 4th ed., London,
Chapman and Hall, 1997.
6. Singh A., Logics for Computer Science, Prentice Hall of India, 2005.

Page 11
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

CST 1103 A3: Computer Graphics (3-0-0) Credit 3

Introduction: Basic raster graphics algorithms for drawing 2 D

Primitives liner, circles, ellipses, arcs, clipping, clipping circles, ellipses &
polygon.
Polygon Meshes in 3D, curves, cubic & surfaces, Solid modeling.
Two- Dimensional Geometric transformation:
Basic transformation: Translation, Rotation, Scaling, Matrix
representation and Homogeneous coordinate system, composite
transformation, reflection transformation, shear, transformation between
Coordinate systems, Affine transformation.
Two Dimensional viewing:
Viewing coordinate reference frame, window to view port coordinate
transformation; Clipping operations: Line clipping, Cohen-Sutherland line
clipping algorithm, splitting concave polygons; Polygon Clipping:
Sutherland-Hodgeman algorithm.
Three dimensional object representation:
Polygon surfaces, plane equations, Curved line and surfaces, Bezier
curve and surfaces, Constructive Solid-Geometry Methods, Octrees, BSP
trees.
Visible surface detection methods:
Back face detection, depth-buffer method, A-buffer method, scan-line
method, BSP tree method, Ray-casting method, Wire frame method,
Visibility-Detection functions.
Models: Procedural models, fractals, grammar-based models, multi-
particle system, volume rendering.
Illumination models and Surface rendering:
Basic illumination Models, Ambient light, Diffuse reflection, specular
reflection, phong model reflection with multiple light sources, Halftone
pattern and dithering techniques, gouraud shading, phong shading.
Color Models:
Intuitive color concepts, RGB Color model, CMY, HSV color model,
conversion between HSV and RGB color model, color selection and
application.

References:
1. Foley et. al., “Computer Graphics Principles & practice”, AWL. 2000
2. R.H. Bartels, J.C. Beatty and B.A. Barsky, “An Introduction to
Splines for use in Computer Graphics and Geometric Modeling”,
Morgan Kaufmann Publishers Inc.,1999.
3. D. Hearn and P. Baker, “Computer Graphics”, Prentice Hall, 2000
4. C.E. Leiserson, T.H. Cormen and R.L. Rivest, “Introduction to
Algorithms”, McGraw-Hill Book Company, 1990.
5. W. Newman and R. Sproul, “Principles of Interactive Computer
Graphics, McGraw-Hill, 1999

Page 12
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

6. D. Rogers and J. Adams, “Mathematical Elements for Computer

Graphics”, McGraw-Hill International Edition, 1989.

CST 1103 A4: Soft Computing (3-0-0) Credit 3

Neural Network: History, overview of biological Neuro-system,

Mathematical Models of Neurons, ANN architecture, Learning rules,
Learning Paradigms-Supervised, Unsupervised and reinforcement
Learning, ANN training Algorithms-perceptions, Training rules, Delta,
Back Propagation Algorithm, Multilayer Perception Model, Hopfield
Networks, Associative Memories, Applications of Artificial Neural
Networks.

Fuzzy Sets: Introduction to Fuzzy Logic, Classical and Fuzzy Sets:

Overview of Classical Sets, Membership Function, Fuzzy rule generation.

Operations on Fuzzy Sets: Compliment, Intersections, Unions,

Combinations of Operations, Aggregation Operations.

Fuzzy Arithmetic: Fuzzy Numbers, Linguistic Variables, Arithmetic

Operations on Intervals & Numbers, Lattice of Fuzzy Numbers, Fuzzy
Equations.

Fuzzy Logic: Classical Logic, Multivalued Logic, Fuzzy Propositions,

Fuzzy Qualifiers, Linguistic Hedges.

Uncertainty based Information: Information & Uncertainty,

Nonspecificity of Fuzzy & Crisp Sets, and Fuzziness of Fuzzy Sets.

Introduction of Neuro-Fuzzy Systems: Architecture of Neuro Fuzzy

Networks. Application of Fuzzy Logic in Medicine, Economics etc.

Genetic Algorithm: An Overview, GA in problem solving,

Implementation of Genetic Algorithm.

Reference:

1. “An Introduction to Neural Networks”, Anderson J.A., PHI, 1999.

2. “Introduction to the Theory of Neural Computation”, Hertz J. Krogh,
R.G. Palmer, Addison-Wesley, California, 1991.
3. “Fuzzy Sets & Fuzzy Logic”, G.J. Klir & B. Yuan, PHI, 1995.
4. “An Introduction to Genetic Algorithm”, Melanie Mitchell, PHI, 1998.
5. “Neural Networks-A Comprehensive Foundation”, Prentice-Hall
International, New Jersey, 1999.

Page 13
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

6. “Neural Networks: Algorithms, Applications and Programming

Techniques”, Freeman J.A. & D.M. Skapura, Addison Wesley,
Reading, Mass, (1992).

CST 1103 A5: Advanced Compiler Design (3-0-0) Credit 3

Introduction: An overview of Different Phases of Compiler.

Lexical Analysis: Introduction, Regular expression, NFA, pattern
matching, Lex generator.
Syntax Analysis: Introduction, Context-free grammar, Parse tree
concept, Top- Down Parsing: Top–Down parsing by Recursive–Descent,
LL(1) parsing, First & Follow sets, Error – Recovery in Top-Down Parsers.
Bottom–Up Parsing: Overview of Bottom–Up parsing, Finite Automata
of LR(0) Items & LR(0) Parsing, SLR(1) Parsing, General LR(1) and
LALR(1) parsing,
YACC: An LALR (1) Parser Generator, Error Recovery in Bottom-Up
Parser
Semantic Analysis: Attributes and Attribute Grammars, Algorithms for
Attribute Computation, The Symbol Table, Data Types checking
Intermediate Code Generation: Intermediate Languages,
Intermediate Code & Data Structures for code generation, Basic code
generation techniques, code generation of data structure references,
code generation of control statements & logical expressions, code
generation of procedures & function calls. Efficient code generation for
expressions, Code generator generators (CGGs), Code generation for
pipelined machines, Register allocation techniques, Concurrentisation
and vectorisation of programs.
Run Time Environment: Memory organization During Program
Execution, Fully Static Run Time Environments, Stack-Based Runtime
Environments, Dynamic memory, Parameter Passing Mechanisms
Code Optimization: Introduction to code optimization, Classical theory
of data flow analysis, Peep-hole optimization, Bi-directional data flows,
Unified algorithms for data flow analysis, A generalized theory of data
flow analysis, Program representation for optimization - SSA form.

References:
1. Compiler Construction Principles & Practice By Kenneth C. Louden,
International Student Edition, 2003, Vikas Publishing.
2. Compilers Principles Techniques & Tools By A. V. Aho, Ravi Sethi &
J. D. Ullman Addison Wesley 4th Edition, 2000
3. Engineering a compiler by Keith, D. Cooper & Linda Torezon,
Margan Kafmann publishers, first Indian reprint 2004.

Page 14
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

4. The essence of compilers by Robin Hunter, Pearson education, First

Indian Reprint 2004.
5. Advanced Compiler Design and Implementation by Steven
Muchnick , Harcourt Books, Indian Reprint 2004

CST 1103 A6: Graph Theory & Combinatorics (3-0-0) Credit 3

Combinational Principles: Pigeonhole Principle, Inclusion Exclusion

Principle, Sieve methods, Addition principle and multiplication principle;
Ramsey theorem, Permutation with restricted positions.
Permutation and Combinations: Permutation of sets and multisets,
Combination of sets and multisets, Permutation statistics, Cycle
structure, inverses, decants, and tree representation of permutation.
Binomial coefficients, q-binomial coefficients, binomial identities and
Twelve-fold way.
Generating Functions: Recurrence relations, ordinary generating
functions and exponential generating functions. Catalan numbers,
Differential sequences and Stirling numbers, Partition numbers.
Partially Ordered Sets: Basic concepts of posets, chains, lattices,
direct product of posets. Distributive lattices, modular lattices
Basic Definitions, Concepts and Theorems: Graphs, directed graphs,
degrees of vertices, paths, cycles, connectivity, trees, forests, bipartite
graphs, contractions, minors, Euler tours.
Flows in Graphs: Network flows, the max flow-min cut theorem and
algorithm, group-valued flows, k-flows, Tutte’s flow conjectures.
Matrix Representation of Graph: incidence matrix, sub-matrices of
A(G), circuit matrix. Fundamental circuit matrix and Rank of B, An
application to a switching Network, cut set Matrix, path Matrix,
Adjacency matrix.
Graph Theoretic Algorithms and Computer Programs: Some basic
algorithm - Connectedness and components, A spanning tree, Shortest
path, Depth first search on a graph, Planarity testing, Isomorphism.
Graphs in Switching and Coding Theory: contact networks, analysis
of contact networks, synthesis of contact networks, unit cube and its
graph, graphs in coding theory.
Electrical Network Anatysis by Graph Theory: Electrical network,
Kirchhof’s current and voltage laws, loop currents and node voltages,
RLC networks with independent sources - loop analysis.
Graph Theory in Operations Research: Transport networks,
extensions of Max-Flow Min cut theorem, Minimal cost flows, Multi-
commodity flow, Further Applications,

Page 15
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

References:
1. Introductory Combinatorics, third edition, Richard A. Brualdi,
Prentice Hall, Inc., 1999.
2. Cohen, D. Basic Techniques of Combinatorial Theory. New York:
Wiley, 1978.
3. Introduction to graph theory: Robin J. Wilson, 2000
4. An introduction to graph theory Douglas B. west, (EEE)
5. Graph theory V.K. Balakrishnan (schaum’s outlines)
6. Graph theory Frank Harry (Narosa publishing house) 2001

Page 16
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

CST 1103 A7: Algorithm and Complexity (3-0-0) Credit 3

Introduction: Algorithm Specification, Asymptotic Notation, Proof of

correctness of the algorithm.
Fundamental Algorithms: Red black tree, AVL Tree, Dictionary (Binary
Search Tree), Set UNION, & FIND operation, Graph, Depth First, Breadth
First, Best First search in graphs.
Network Flow and Matching: flow network, method, Maximum
bipartite matchng, perfect matching, Hopcroft-Karp algorithm.
Divide and Conquer: Recurrence relation and its applications, Binary
search, Merge sort, Quick sort, Selection Sort, Heap sort, Strassen
Algorithm, and its complexity analysis with proof.
Greedy Method: Knapsack Problem, Tree vertex Splitting, Job
Sequencing with Deadlines, Minimum cost spanning tree (prim’s &
kruskal algorithms.), Single source shortest path problem, Its complexity
analysis, & proof of the optimality.
Dynamic Programming: Introduction, All pair shortest path, 0/1-
Knapsack problem, and the traveling sales man problem, Optimality
proof and complexity analysis.
Backtracking: N-Queens, Graph coloring, & Hamiltonian Circuit
problem.
Branch & Bound: 15- puzzle problem, 0/1 knapsack problem.
Lower bound Theory: Comparison Tree, Oracle & Adversary
Arguments.
NP-complete & NP-hard: Meaning of Non deterministic algorithm,
Cook’s theorem, Some Proof of NP-hard graph problem (Ex: CDP, CNDP,
DHC, TSP etc), & Scheduling Problem (Ex. Flow shop Scheduling, Job
shop Scheduling)
Approximation Algorithm: Absolute approximation, ε-approximation,
Approximate TSP solution.
Randomized Algorithms:
Primality testing, Miller-Rabin Algorithm, Las-Vegas Algorithm, Monte-
Carlo Algorithm.

References:
1. Horowitz, Sahni, Rajasekaran, Fundamentals of computer
algorithms (Galgotia pub.) 2000
2. Baase and Van Gelder, Computer Algorithms 3rd ed. (3rd
printing preferred). 2001
3. Cormen, Leiserson, and Rivest, Introduction to Algorithms (2001,
2nd ed.)
4. Aho, Hopcroft, and Ullman, Design and Analysis of Computer
Algorithms, 1979.
5. Gehani, Narain, C: An Advanced Introduction, ANSI C Ed., 1989.

Page 17
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

CST 1104 Discrete Mathematics (3-0-0) Credit 3

Set, Relation, Function, Group, Ring & Field Theory

Recurrence Relation & Generating Function
Graph Theory: Basic Terminology, Matrix Representation of Graphs,
Operations on Graph, Graphs Isomorphism, Walk, Path, Circuits,
Eulerian & Hermitian Graphs, Graph coloring, covering and
partitioning, Dijkstra’s shortest path algorithm with applications,
Planar graph, Euler’s formula, Dual of a Graph, Tree, Spanning tree,
Kruskal’s and Prim’s algorithms, Network Analysis- Ford-Fulkerson
algorithm with applications.

References:

0 Graph Theory—N.Deo

1 Discrete Mathematics—T.Veerarajan

Page 18
 Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

CST 1191 Advanced Operating System Lab (0-0-3) Credit 2

1. 1PC
Inter process communication
a) a program which will be able to communicate bet” the process of
LINUX environment with the process of widows environment
(Microsoft)
b) using the system call generate a trap (interrupt)
c) Generate a new process P1 and P2, and implement a semaphore
for Mutual exclusion.
2. Shell Script
a) Using shell script create a command, identical with “ifconfig”
b) Write a shell script which can able to access I/O operations,
(initially Read/write operation).
3. Memory
a) Reserve a specific memory location for executing your own
application.
(Before that specific Memory location has to access).
b) Create a ‘bootable’ disk in LINUX/Windows environment
4. Security
0 Write a program after execution of which, the users can be able to
access the resources of the system. (Say some specific I/O).
1 Write a program which can be able to verify, if there exists some
unwanted program in presenting the external device or not (N.B.-just
same as Scan)
5. Fault tolerance
a) Write a program by which the CPU utilization in LINUX environment
can be calculated
b) Increase the virtual memory size of the OS.

Page 19
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

FIRST YEAR SECOND SEMESTER

COMPULSORY COURSES

CST 1201: Distributed Systems (4-0-0) Credit 4

Fundamentals:
Introduction, Concept of parallel and distributed computing, Multi-
computers Models and Features.
Introduction to networks:
Issues in design of distributed operating systems. Introduction, ISO/OSI
model, Networking and internetworking
Message Passing:
Good message passing system, IPC, Synchronization, Buffering, Multi
datagram messages, Encoding & decoding techniques, Process
addressing, Failure handling, Group communication; Remote procedure
calls (RPC) - Models, Communication protocols, RPC, Lightweight RPC.
Distributed Shared Memory:
Architecture, Thrashing, Granularity, Advantages.
Synchronization:
Introduction, Clock Synchronization, Event handling, Mutual Exclusion,
Deadlock Conditions, detection algorithms, Avoidance, Prevention,
Recovery.
Coordination and Agreement
Distributed Mutual Exclusion, Ricart and Agrawala’s algorithm,
Maekawa’s Algorithm, Leader Election, Bully Algorithm.
Resource & process Management:
Features of a good scheduling algorithm, Task assignment approach,
Load balancing & load sharing approach, Introduction to process
management, Process migration, Threads.
Distributed Files Systems:
Introduction, Features, Models, Accessing models; sharing Semantics &
caching schemes, replication, Fault Tolerance, Atomic transactions.

References:
0 Distributed operating Systems, Concepts & design - Sinha Pradeep
K.; PHI 2000
1 Distributed Operating System- Tanenbaum Andrews S.– Pearson
1999
2 Distributed Systems, Concepts & design - Coulouris George,
Dollimore Jean, Kindberg Tim; Pearson 1998
3 Operating System Concepts - Silberschatz Galvin; John Wiley, 5th
Edition 2001.

Page 20
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

FIRST YEAR SECOND SEMESTER

GROUP B ELECTIVES: COMPUTER SYSTEMS

CST 1202 B1: Pattern Recognition & Machine Learning (3-0-0)

Credit 3

Introduction:
Machine perception, Pattern recognition systems, Supervised and
unsupervised learning, Reinforcement learning.
Bayesian decision theory:
Two category classification, Minimum error rate classification, Classifiers,
Discriminants, Decision surfaces, Discriminant function for the normal
density.
Maximum Likelihood and Bayesian estimation:
The general principle of maximum likelihood estimation, MLE for
Gaussian case, General theory of Bayesian parameter estimation,
Gaussian, Univariate, and Multivariate case, Difference between MLE and
Bayesian methods.
Nonparametric techniques:
Density estimation, Parzen windows, KN nearest neighbour estimation,
Estimation of a-posteriori probabilities.
Linear Discriminant Functions:
Linear discriminant functions and decision surfaces, Two-category, Multi-
category case, Generalized linear discriminant functions, Two-category
linearly separable case, Perceptron convergence proof, Minimum-
squared error procedures.
Multilayer neural networks:
Feedforward operation nad classification, Backpropagation algorithm,
Practical techniques for backpropagation.
Nonmetric methods:
Decision trees, Recognition with strings, Grammatical methods.
Advanced topics:
Support vector machines, PAC learning, VC-dimension.

References:

1. Richard O. Duda, Peter E. Hart and David G. Stork, “Pattern

Classification” 2nd Edition, Wiley Interscience.
2. John Hertz, Andres Krogh & Richard G. Palmer, “Introduction to the
theory of Neural Computation”, Addison Wesley.
3. Tom Mitchell, Machine learning, McGraw Hill, 1997.

Page 21
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

CST 1202 B2: Image Processing & Computer Vision (3-0-0) Credit
3

Introduction and Digital Image Fundamentals:

The origins of Digital Image Processing, Examples of Fields that Use
Digital Image Processing, Fundamentals Steps in Image Processing,
Elements of Digital Image Processing Systems, Image Sampling and
Quantization, Some basic relationships like Neighbours, Connectivity,
Distance Measures between pixels, Linear and Non Linear Operations.
Image Enhancement in the Spatial Domain:
Some basic Gray Level Transformations, Histogram Processing,
Enhancement Using Arithmetic and Logic operations, Basics of Spatial
Filters, Smoothening and Sharpening Spatial Filters, Combining Spatial
Enhancement Methods.
Image Enhancement in the Frequency Domain:
Introduction to Fourier Transform and the frequency Domain, Smoothing
and Sharpening Frequency Domain Filters, Homomorphic Filtering.
Image Restoration:
A model of Image Degradation / Restoration Process, Noise Models,
Restoration in the presence of Noise Only Spatial Filtering, Periodic Noise
Reduction by Frequency Domain Filtering, Linear Position-Invariant
Degradations, Estimation of Degradation Function, Inverse filtering,
Wiener filtering, Constrained Least Square Filtering, Geometric Mean
Filter, Geometric Transformations.
Image Compression:
Coding, Inter-pixel and Psycho-visual Redundancy, Image Compression
models, Elements of Information Theory, Error free comparison, Lossy
compression, Image compression standards.
Image Segmentation:
Detection of Discontinuities, Edge linking and boundary detection,
Thresholding, Region Oriented Segmentation, Motion based
segmentation.
Representation and Description:
Representation, Boundary Descriptors, Regional Descriptors, Use of
Principal Components for Description, Introduction to Morphology, Some
basic Morphological Algorithms.
Object Recognition:
Patterns and Pattern Classes, Decision-Theoretic Methods, Structural
Methods.

References:
1. Rafael C. Gonzalez & Richard E. Woods, “Digital Image Processing”,
2nd edition, Pearson Education.
2. A.K. Jain, “Fundamental of Digital Image Processing”, PHI.
3. Rosefield Kak, “Digital Picture Processing”,

Page 22
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

CST 1202 B3: Parallel Algorithms (3-0-0) Credit 3

Introduction:
Parallelisms on different architectures- uniprocessor, PRAM models, P
and NP Complete Problems, Lower bounds on Parallel Computation.
Mapping Techniques:
Process to mapping parallel algorithms on different PRAM machines.
Arithmetic Computation:
Addition, Multiplication, FFT, DFT, Polynomial Multiplication, Convolution,
Evaluation & Interpolation.
Matrix Operations:
Transposition, Multiplication, Inversion, Eigen value computation.
Numerical Application:
Solving Systems of linear equations, finding roots of non-linear
equations,
Solving partial differential equations.
Sorting:
Theoretical bound, Sorting networks, Batcher’s odd even & bitonic
sorting algorithm, sorting on hypercube network, mesh and mesh like
architectures,
parallel quick sort.
Searching:
Parallel searching, finding k-th smallest element, searching in sorted list.
Graph Algorithms:
All pairs shortest path algorithms (APSP), finding connected components
of a graph and di-graph, minimum spanning tree.
Computational Geometry:
Inclusion Problem, Intersection Problem, proximity Problem, Construction
Problem.

References:

1. S.G.AKL. “Design & Analysis of Parallel Algorithms” , Prentice Hall,

Englewood Cliffs, 1989.
2. M.J.Quinn: “Design of Efficient Algorithms for Parallel Computers”,
McGraw Hill, New York, 1988.
3. S.Lakshmivaran & S.K.Dhall: “Design of Parallel Algorithms”, McGraw
Hill
New York, 1990.

Page 23
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

CST 1202 B4: Artificial Intelligence (3-0-0) Credit 3

Introduction:
Introduction to intelligent agents.

Problem solving:
Solving problems by searching, state space formulation, depth first and
breadth first search, iterative deepening.

Intelligent search methods:

A* and its memory restricted variants.

Production systems:
Design, implementation and limitations; case studies.

Game Playing:
Minimax, alpha-beta pruning.

Knowledge and reasoning:

Propositional and first order logic, semantic networks, building a
knowledge base, inference in first order logic, logical reasoning systems.

Planning:
STRIPS partial order planning, uncertain knowledge and reasoning,
probabilistic reasoning systems, Baysian networks.

Learning from observations:

Inductive learning, learning decision trees, computational learning
theory, Explanation based learning

Applications:
Environmental Science, Robotics, Aerospace, Medical Scioence etc.

References:

1. "AI, a modern approach" by Russel and Norvig, Pearson

Education, 2000.
2. "AI" by Rich and Knight, Tata McGraw Hill Publications, 2003.
3. "Neural Networks in Computer Intelligence" by KM Fu, McGraw Hill
Edition, 1999.

Page 24
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

CST 1202 B5: Cryptography & Network Security (3-0-0) Credit 3

Introduction:
The need of security, security approaches, Principles of Security,
Different types of attacks in security.
Cryptography Techniques:
Introduction, Plain text & Cipher text, Shannon’s Perfect
Secrecy,Substitution & transposition techniques, Encryption and
Decryption, Symmetric key and asymmetric key cryptography, Concept
of steganography, Key ranges.
Cryptographic Hash Functions:
Basics of Hash function, Cryptographic properties of Hash function, One-
way functions and inevitability, MD5, SHA, WHIRLPOOL.
Symmetric Key Cryptographic Algorithm:
Introduction, stream and block ciphers, Algorithm types and modes, an
overview of symmetric key cryptography, Data encryption standard
(DES), International data encryption algorithm (IDEA), RC5, Blowfish,
Advanced encryption standards (AES).
Asymmetric Key Cryptographic Algorithm:
Introduction, an overview of asymmetric key cryptography algorithm,
The RSA ,ElGamal and Paillier algorithm, symmetric key and asymmetric
key cryptography together, Digital signatures.
Public key infrastructure:
Introduction, digital certificates, private key management, The PKIX
model, public key cryptography standards (PKCS), XML, PKI and Security.
Internet security protocols:
Introduction, secure socket layer (SSL), secure hyper text transfer
protocol (SHTTP), Time stamping protocol (TSP), secure electronic
transaction (SET).
User Authentication Mechanism:
Authentications basics, passwords, tokens, certificate based
authentication.
Network security:
TCP/IP, Firewalls, IP security, Virtual private network.
Case studies on cryptography & security:
Cryptographic solution, single sign on (SSO), denial of service attacks
(DOS).

References:

1. ATUL KAHATE -“Cryptography and network security” Tata McGraw

Hill Publishing company limited, 2003.
2. William Stalling- “Cryptography and network security” Pearson
Education, 3rd edition.

Page 25
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

3. Douglas R. Stinson – “An introduction to Cryptography” Morgan

Kroffman, 7th edition

Page 26
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

CST 1202 B6: VLSI System Design (3-0-0) Credit 3

Introduction:
Different Integration techniques, Need of VLSI.
Logic Design:
MOSFET as switches, Basic gates in CMOS, Complex Logic gates and
combination circuit design in CMOS, Transmission Gate Circuits, Clocking
and Dataflow control., Physical Structure of CMOS Integrated circuits,
Fabrication Structure of CMOS Integrated Circuits, Elements of Physical
Design: Layout of basic structures, Cell concepts, FET sizing and the unit
transistor, Physical design of Logic gates.
Electrical Characteristics of MOSFET:
FET RC Model, Modeling of Small MOSFETs, Electronic analysis of CMOS
Logic gates: DC characteristics of the CMOS inverter, inverter switching
characteristics, power dissipation, dc characteristics: AND and NOR
gates, NAND and NOR transient response, Analysis of Complex Logic
gates, gate design for transient performance, transmission gates and
pass transistors, gate delays, driving large capacitive loads.
System-level physical design:
Large scale physical design, Interconnect delay modeling, crosstalk,
interconnect scaling, Floor planning and Routing, Input and Output
Circuits, Power distribution and consumption.
VLSI Clocking and System Design:
Clocked Flip-flops, CMOS clocking styles, pipelined systems, clock
generation and distribution and distribution.
CAD TOOLS: Introduction to VHDL, Verilog to design CMOS circuits.

References:

1. Introduction to VLSI Circuits and Systems by J.P. Uyemura, John Wiley

& Sons, Inc. 2001
2. Principles of CMOS VLSI Design – A System Perspective by Neil
H.E. Weste and Kamran Eshraghian; Addison Wesley Pub 2000
3. Modern VLSI Design: system on silicon by Wayne Wolf; Addison
Wesley Longman Publisher 2001
4. Basic VLSI Design by Douglas A. Pucknell & Kamran
Eshranghian; PHI 2000.
5. Semiconductor device modelling with SPICE by P Antognetti, G
Massobrio, McGraw-Hill 2000.

Page 27
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

CST 1202 B7: Embedded Systems (3-0-0) Credit 3

Introduction to an embedded systems design:

Introduction to Embedded system, Embedded System Project
Management, ESD and Co-design issues in System development Process,
Design cycle in the development phase for an embedded system, Use of
target system or its emulator and In-circuit emulator, Use of software
tools for development of an ES.

Processes and Operating Systems:

The Processes abstraction, switching contexts between programs, Real-
time operating systems, Intercrosses communication, Performance
analysis and power consumption.

Microcontroller:
Role of processor selection in Embedded System (Microprocessor V/s
Micro-controller), 8051 Microcontroller: Architecture, basic assembly
language programming concepts, Instruction set, Addressing Modes,
Logical Operation, Arithmetic Operations, Subroutine, Interrupt handling,
Timing subroutines, Serial data transmission, Serial data communication

Networks for Embedded Systems:

The I2C Bus, The CAN bus, SHARC link Ports, Ethernet, Myrinet, Internet,
Introduction to Bluetooth: Specification, Core Protocol, Cable
replacement protocol. IEEE 1149.1 (JTAG) Testability: Boundary Scan
Architecture.

Applications: Brief explanations of different application domains of

Embedded Systems.

References:

1. Embedded Systems by Raj Kamal, TMH 2000

2. The 8051 Microcontroller by K.J. Ayala, Penram International 1999

3. J B Peatman, Design with PIC Microcontrollers, Prentice Hall 1999

4. An Embedded Software Primer by David E. Simon, Pearson

Education 2001
5. Programming and Customizing the AVR Microcontroller by
Dhananjay Gadre, MGH 2000

Page 28
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

FIRST YEAR SECOND SEMESTER

GROUP C ELECTIVES: INFORMATION TECHNOLOGY

CST 1202 C1: Data Warehousing and Data Mining (3-0-0) Credit 3

Data Warehousing:
Introduction to Data Warehousing: Evolution of Data Warehousing, Data
Warehousing concepts, Benefits of Data Warehousing, Comparison of
OLTP and Data Warehousing, Problems of Data Warehousing.

Data Warehousing Architecture:

Architecture: Operational Data and Data store, Load Manager,
Warehouse Manager, Query Manager, Detailed Data, Lightly and Highly
summarized Data, Archive/Backup Data, Meta-Data, architecture model,
2-tier, 3-tier and 4-tier data warehouse, end user Access tools.

Data Warehousing Tools and Technology:

Tools and Technologies: Extraction, cleaning and Transformation tools,
Data Warehouse DBMS, Data Warehouse Meta-Data, Administration and
management tolls, operational vs. information systems. OLAP and DSS
support in data warehouse.

Distributed Data Warehouse:

Types of Distributed Data Warehouse, Nature of development efforts,
Distributed Data Warehouse Development, Building Warehouse at
multiple levels

Types of Data Warehouses:

Host based, single stage, LAN based, Multistage, stationary distributed &
virtual data-warehouses.

Data warehousing Design:

Designing Data warehouse Database, Database Design Methodology for
Data Warehouses, Data Warehousing design Using Oracle.

Reference:
1. Building the Data Warehouse, W.H.Inmon, 3rd Edition, John Wiley
2000.
2. Developing the Data Warehouse, W.H.Inmon, C.Kelly, John Wiley
1999
3. W.H.Inmon, C.L.Gassey, “Managing the Data Warehouse”, John
Wiley 2001.
4. Fayyad, Usama M. et. al., “Advances in knowledge discovery &
Data mining”, MIT Press 2000.

Page 29
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

CST 1202 C2: Multimedia Technology (3-0-0) Credit 3

Introduction:
Concept of Multimedia, Multimedia Applications, Hardware Software
requirements, Multimedia products & its evaluation.

Components of multimedia:
Medium: Text, Audio, Video, image & Graphics, combined audio/video.

Audio: Digital representation, Transmission and signal processing;

Digital music making, Elements of speech recognition and generation.
Video: Raster scanning principles, sensors for TV cameras, Color
fundamentals and colour video, Performance measurements.
Image & Graphics: Image compression system, Redundancy and
Visibility, JPEG & MPEG standard.

Multimedia Presentation:
Multimedia system services, Media stream protocol, Multimedia services
and the windows system, Client control, Device control, temporal
coordination and composition. Design & Authoring Tools, Categories of
Authority Tools, Types of products.

Animation:
Introduction, Basic Terminology techniques, Motion Graphics 2D & 3D
animation.
Animating Tool:
Introduction to MAYA, Fundamentals.
Modeling:
NURBS, Polygon, Organic, animation, paths & boxes, deformers.
Working with MEL:
Basics & Programming
Rendering & Special Effects:
Shading & Texturing Surfaces, Lighting, Special effects.

References:
1. John F. Koegel Buford, “Multimedia Systems”, Pearson Education,
2003.
2. David Hillman, “Multimedia Technology & Applications”, Galgotia
Publications 2001.
3. Rajneesh Agrawal, “Multimedia Systems”, Excel Books 2002.
4. Nigel Chapman & Jenny Chapman, “Digital Multimedia”, Wiley
Publications 1999.

Page 30
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

Page 31
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

CST 1202 C3: Mobile Computing (3-0-0) Credit 3

Introduction to mobile computing:

Mobility of bits and bytes, Wireless, Dialog control, Familiar with mobile
computing & its functions, Mobile computing devices, Ad-hock networks,
Communication Gateways, New mobile applications.
Mobile Computing Architecture:
Architecture of mobile computing, three tier architecture, message
oriented middle wore, transaction processing middleware,
communication middleware, distributed and object components, trans-
coding middleware, ICAP, web services, database middleware, SYNC ML,
design consideration for mobile computing, client context manager,
composite capabilities / preference profiles (CC/PP), security manager,
policy manager, P3P (platform for privacy preference project), content
rating and filtering, seamless communication, autonomous
computing , context aware system, GPS, mobile computing through
intranet.
Emerging technologies of mobile computing:
Telephony application programming, Bluetooth, protocol, Bluetooth
protocol stack, Bluetooth security, Bluetooth application models,
radio frequency identification (RFID), areas of application for RFID,
wireless broadband (WIMAX), 802.16 medium access control , mobile IP,
how it works, registration, tunneling, cellular IP, IPv6 and introduction,
mobile IP vs IPv6, GSM architecture , GSM entities, mobile stations,
message centre, call routing in GSM, GSM address and identifiers,
network aspects in GSM, mobility management, routing, GSM frequency
allocation , authentication and security.
Latest ventures of mobile computing:
SMS, SMS architecture, GPRS network architecture, GPRS backbone,
GPRS handset, WAP, networks for WAP, MMS, MMS architecture, handoff
and roaming, UMTS/WCDMA, application on 3G, WLAN, WLAN
application, IEEE 802.11 architecture, authentication in WLAN, SSID,
TINA, familiar with simtrian, architecture, windows CE2 with
communicator, 3GPP security.

References:
1. Yi Bing Lin, “Wireless and Mobile Networks Architecture”, John Wiley
2000.
2. Tomasz Imielinski et.al, Mobile Computing, Kluwer Academic P 1996.
3. Uwe Hansmann, Pervasive Computing Handbook. The Mobile World,
IEEE
publication 2002
4. Jochen Burkhardt, et.al. Pervasive Computing, Technology and
Architecture of Mobile Internet Applications, Addison Wesley, 2002

Page 32
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

CST 1202 C4: Software Quality Management (3-0-0) Credit 3

Concepts and Overview:

Concepts of Software Quality, Quality Attributes, Software Quality
Control and Software Quality Assurance, Evolution of SQA, Major SQA
activities, Major SQA issues, Zero defect Software
Software Quality Assurance:
The Philosophy of Assurance, The Meaning of Quality, The Relationship of
Assurance to the Software Life cycle, SQA Techniques. Tailoring the
Software Quality Assurance Program - Reviews, Walkthrough, Inspection,
and Configuration Audits.
Evaluation:
Software Requirements, Preliminary design, Detailed design, Coding and
Unit Test, Integration and Testing, System Testing, types of Evaluations.
Configuration Management:
Maintaining Product Integrity, Change Management, Version Control,
Metrics, Configuration Management Planning
Error Reporting:
Identification of Defect, Analysis of Defect, Correction of Defect,
Implementation of Correction, Regression Testing, Categorization of
Defect, Relationship of Development Phases.
Trend Analysis:
Error Quality, Error Frequency, Program Unit Complexity, Compilation
Frequency
Corrective Actions:
Identifying the Requirement for Corrective Action, Determining the
Action to be Taken, Implementing the Correcting the corrective Action,
Periodic Review of Actions Taken.
Traceability:
Traceability, Records, Software Quality Program Planning, Social Factors
- Accuracy, Authority, Benefit, Communication, Consistency, and
Retaliation.

References:
1. Robert Dunn, “Software Quality Concepts and Plans”, PH, 1990.
2. Alan Gillies, “Software Quality, Theory and Management”, Chapman
and Hall, 1992.
3. Michael Dyer, “The Cleanroom approach to Quality Software
Engineering”, Wiley & Sons, 1992.
4. Tom Gilb, “Principles of Software Engineering Management”, Addison-
Wesley, 1988.
5. Watts Humphrey, “A Discipline for Software Engineering”, Addison-
Wesley, 1995.

Page 33
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

CST 1202 C5: Object Oriented System Design (3-0-0) Credit 3

Introduction to Object: Object Orientation, Development and

Modeling, Object Modeling technique.
Modeling: Object modeling: Objects and classes, Links and Association,
Generalization and inheritance, Grouping constructs, Aggregation,
Abstract Classes, Generalization as extension and restriction, Multiple
inheritance, Meta data, Candidate keys, Constraints. Dynamic modeling:
Events and states, Nesting, Concurrency, Advanced Dynamic Modeling
concepts. Functional modeling: Functional Models, Data flow diagrams,
Specifying operations, Constraints, Relation of Functional model to
Object and Dynamic Models.
Design Methodology, Analysis: Object modeling, Dynamic modeling,
Functional modeling, Adding operations and Iterating Analysis. System
design: Subsystems Concurrency, Allocation to processor and tasks,
Management of data stores, Handling Global Resources, Handling
boundary Conditions, Setting Trade-off priorities. Object Design:
Overview, Combining the three models, Designing Algorithms, Design
Optimization, Implementation of Control, Adjustment of Inheritance,
Design of Associations, Object Representation, Physical Packaging,
Document Design Decision. Comparison of methodologies: Structured
Analysis / Structured Design, Jackson Structured Development.
Implementation: Using Programming Language, Database System,
outside Computer.
Programming Style: Object Oriented Style, Reusability, Extensibility,
Robustness, Programming-in-the-large.
UML: Basics, Emergence of UML, Types of Diagrams.
Use Case: Actors, Use Case Diagram, Relationships between Use Cases.
Classes: Class Diagram, Classes, Objects, Attributes, Operations,
Methods, Interfaces, Constraints, Generalization, Specialization,
Association, Aggregation.
Behavioral Diagrams: Activity Diagram, Collaboration Diagram,
Sequence Diagram and State Chart Diagram.
Implementation Diagrams: Component Diagram, Deployment
Diagram
References:
0 Rambough, “Object Oriented Modeling and Design”, Pearson
Education, 2002
1 Bernd Oestereich, “Developing Software with UML”, Pearson
Education.
2 BOOCH, “Object Oriented Analysis and Design”, Addison Wesley
3 Pierre-Alain Muller, “Instant UML”, Shroff Publishers, 2000
4 Booch, Rumbaugh, Jacobson, “The Unified Modeling Language User
Guide”, Addison Wesley, 1999

Page 34
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

5 Booch, Rumbaugh, Jacobson, “The Unified Modeling Language

Reference Manual”, Addison Wesley, 1999

CST 1202 C6: Web Technology (3-0-0) Credit 3

Overview of Internet & Web:

Basics of Internet, Networking and Web concepts, Internet and Web
protocols like TCP/IP, ARP, RARP, PPP, Telnet, ftp etc, Subnets & Hosts,
WWW, Domain Names, Hardware and Software requirements for Internet
and Web based applications, Overview of various Internet and Web
technologies.

Structure of a Web Page:

Introduction to HTML, Content layout and presentation, Various HTML
Tags, Table Handling, Frames, Forms.

Dynamic Web Page:

Need of Dynamic Web pages, Cascading Style Sheet, Comparative
studies of different technologies of dynamic Web page.

Client side scripting:

Variables, Constants and Default Objects.

Server side scripting:

Overview of various server side scripting technologies such as Servlet,
ASP, JSP, PHP.

Interactivity and Security:

Client Server Model, Creating interactive dynamic HTML Forms, Role of
databases in interactive applications, Server issues and Security
methods, Concept of various methods of Internet security like firewalls
etc.

References:
1. Web Technology by Godbole, Kahate, TMH 2001
2. Web Technologies by C. Xavier, New Age Publication 1999
3. Web publishing by Monica D’Souza, TMH. 2002
4. Web Design by David Crowder and Rhonda Crowder, IDG Books
India 1999
5. Principles of Web Design by Joel Sklar, Web Warrior series 1998.

Page 35
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

CST 1202 C7: E-commerce (3-0-0) Credit 3

Introduction to E-Commerce:
Introduction to E-Commerce, Principles of E-Commerce, Threats of E-
Commerce, E-Business & E-Commerce, E-Commerce drivers & factors,
Rules of E-Business.
E-Commerce Infrastructure:
E-Commerce Infrastructure, Internet Communications, Internet
Computing and Architecture.
E-Commerce Business Models:
E-Business Models, Business Model Perspectives, Market place
Perspective, Revenue Generation Consideration, Commercial
Arrangement Considerations.
E-Business Strategy:
E-Business Strategy, Strategy Definition, Strategy Context, Strategic
Objectives, Strategic Analysis, Strategy Implementation.
Supply Chain Models:
Supply Chain Management, Definition of SCM, Supply Chain Execution,
Value Chain Analysis, Current SCM requirements.
Customer Relationship Management:
CRM Definitions, CRM Objectives & Stages, CRM Business Focus &
Technology, CRM – Web site issues.
E-Commerce - Social & Legal Issues:
Legal & Regulatory Framework- Electronic Commerce, Legal issues,
Protecting Privacy, The Role of Third Parties, Public Key Infrastructure.
Marketing & Advertising:
Marketing Concepts, Marketing objectives, marketing and the Internet,
Advertising.
E-Commerce Security:
Internet & Security, E-Business & Security, Security Risk Management,
Security Threats, Encryption, E-Payment Systems.
E-Commerce Design Issues:
Analysis & Design, Constraints, Elements, Analysis & Design for E-
Business, E-Business Application Design.

Reference:
1. E-Commerce strategy, Technologies and Applications by David
Whitley, TMH 2000
2. E-Commerce- The Cutting Edge of business by Bajaj, Nag, TMH
1999
3. E-Commerce and Managerial Perspective by P. T. Joseph, PHI 2001
4. Frontiers of E-Commerce by Kalakotia, Whinston, Pearson
Education 2002.
5. E-Commerce: strategy technologies and application, TMH 1999

Page 36
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

CST 1202 C8: Internetworking (3-0-0) Credit 3

Introduction and Overview:

The need of Internet, TCP/IP Internet, Internet services, History & scope,
Protocol standardization.
Review of Underlying Technologies:
LAN, WAN, MAN, Ethernet Topology, Token Ring, ARPANET, PRO net
technology, FDDI. Internetworking concepts and architectural model,
application level Internet connection, Interconnection through IP
gateway, users view.
Internet Addresses:
Universal Identifiers, Three Primary Classes of IP Addresses, Structure of
IP packets, network and broadcast addresses, class less addressing,
supernet / subnet addressing, Addressing Conventions, Mapping Internet
Addresses to Physical Addresses (ARP/ RARP), Determining Internet
Addresses at Startup (DHCP, Bootp).
Internetworking:
Internet as a virtual network, Internetworking devices (routers, bridges,
gateways), Protocol layering, routing algorithms, congestion control
techniques, ICMP, IP fragmentation, difference between X.25 and
Internet layering, Gateway to Gateway Protocol (GGP), OSPF, Exterior
Gateway Protocol (EGP). Managing Internet.
Security Issues:
Reliable Transactions and Security on Internet, Data encryption, IPsec,
SSL, Concept of Firewalls, Intrusion Detection Systems, Denial of Service
Attacks.

Reference:

1. Internetworking with TCP/IP vol-1 by Comer, PHI 2000

2. TCP/IP Illustrated by Stevan; Pearson 1999.

3. TCP/IP Suite by Forouzan; TMH 2001

Page 37
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

CST- 1203 Management for Advanced Technologists (3-0-0) Credit 3

Basics of Management:
Definition and objectives of Management, Functions of management, Evolution and
Development of Management Thought, Overview of the Functional Areas of Management,
Nature, significance and scope of Planning,Organizing,Staffing,Directing,Controlling.

HRM : Human Resource Planning,Selection,Recruitment,Collective Bargaining, Performance

Appraisal,Trade Union,Industrial Dispute,E-HRM.

Marketing Management : Concept, Difference between Marketing and Selling, Market

Research,Marketing Mix, Product Development, Sales Management.

Quality Management : Statistical Quality Control(SQC),TQM-Philosophy and Key

features,Qualty Circle,Kaizen,Qualty Function Deployment(QFD),Six Sigma.

MIS :
Information system for competitive advantage,DSS,EIS,ES,TPS,ERP System,GIS,System
Development Life Cycle(SDLC), Computer Aided Software Engineering (CASE)Tools,
Data Base Management Systems (DBMS) and their components; Concept of entity and
relationships; Data dictionary, SQL and other related concepts in DBMS; Normalization
process.

Quantitative Analysis for Business Applications:

Operation Research :
LPP- Basic Concepts, Model formulation, Graphical Solutions, Simplex Method, Duality.
Transportation Problems- Problem Statement, Testing Optimality, Modi Method and
Improving the Solution.
Network Diagram & Analysis-CPM and PERT, Critical Path Analysis, Probability of
Completing the Project, Crashing the Projects with Cost Consideration.
Simulation- Simulation Process, Monte Carlo Simulation Process, Simulation of Queuing
System.
Dynamic Programming- Recursive nature of computations in DP, Forward and Backward
Recursion, Selected DP Applications.
Statistics-
Measures of Dispersion – absolute and relative measures of dispersion – Range,(definition
and properties) – Lorenz curve – moments – measures of skewness and kurtosis – Beeta and
Gamma Co-efficient
Random Variables: Discrete and continuous random variables,Probability mass function
and probability density function, distribution function –definition and properties, charge of
variables (univariate case only), Bivariate distribution and density of functions, marginal
and conditioned distributions,independence of two random variables.
Correlation and Regression- Karl Pearson’s correlation coefficient –definition and
properties, Scatter diagram, Rank Correlation coefficient, Principle of least squares, fitting
of linear, quadratic, exponential and power curve. Linear regression and regression
coefficients, Multiple and Partial Correlation Coefficients.

Page 38
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

Suggested Reading :
1.Essentials of Management-Harold Koontz,Heinz Weihrich
2.Management Information System-Effy Oz
3 Operations Research-Kanti Swarup,P.K.Gupta,Man Mohan
4.Fundamental of Mathematical Statistics-S.C.Gupta,V.K.Kapoor

Page 39
Proposed M.TECH in COMPUTER SYSTEMS AND TECHNOLOGY at BCREC

CST 1291 Distributed Systems Lab (0-0-3) Credit 2

Assignment 1: Construct a bulletin board system using Ensemble. The task is to create a
bulletin board system on the top of an existing distributed system infrastructure called
Ensemble. The bulletin board supports posting and reading.

Assignment 2: Implementing a reliable and ordered multicast protocol.

Assignment 3: Implement a DNS client (RFC 1034, RFC 1035) or both direct and reverse
lookups that interacts with real DNS servers.

Assignment 4: Implement a DHCP server and a client (RFC2131) in Linux.

Assignment 5: Implementing Remote Procedure Call.

Assignment 6: You should write a tool that provide reliable and ordered broadcast between
at least three machines. The network protocols you may use are TCP and/or UDP. The
number of machines which use your program can be fixed. You DO NOT need to consider
the failure of computer. Your protocol needs to satisfy the following requirements:
a) Broadcast: A message which is received by any machine should also be received by all
other machines.
b) Reliable: Integrity, Validity, and Agreement.
c) Ordered: All machines should agree on the order of all received messages.

Assignment 7: Electronic Postcard Application with Servlets and Sockets. The purpose of
this lab is to implement a part of a distributed application using servlets that execute on a
web server and use sockets for inter-process communication.

Assignment 8: Distributed Mutual Exclusion using the (second) Ricart-Agrawala

algorithm. The purpose of this lab is to implement distributed mutual exclusion, resulting in
a safe postcard application.

Assignment 9: Electronic Postcard Application with CGI and Sockets. The purpose of this
lab is to implement a part of a distributed application using CGI to execute the program
through the web server and sockets for inter-process communication.

Assignment 10: Design a message-passing concurrency system by which a concurrent

entity sends a message to another one. it is the execution environment’s responsibility to
deliver the message from the sender to the receipient(s), and only there.

Page 40