FOR
IN
MCSIS 105-1 Natural Language Processing MCS* 106-1 Data Warehousing and Data Mining
MCSIS 105-2 Bio Informatics MCSIS 106-2 Software Structure and UML
MCSIS 105-4 Information Theory And Coding MCSIS 106-4 Software Project Management
1
SEMESTER - II
MCSIS 205-2 Genetic Algorithms and Applications MCSIS 206-2 Software Architecture
MCSIS 205-3 Agent based Intelligent Systems MCSIS 206-3 Image Processing
2
SEMESTER - III
* 50% of the marks to be awarded by the Industrial Training and mini project guide and the
remaining 50% to be awarded by a panel of examiners, including project guide, constituted by the
department.
** Industrial Training and Mini project evaluation will be conducted at end of the third semester by a
panel of examiners, with at least one external examiner, constituted by the university.
*** The marks will be awarded by a panel of examiners constituted by the concerned institute.
Note:
Students may choose their mini project preferably in the same area as that of their project.
Students are encouraged to publish their thesis work in National and International journals and
conferences. This may have an additional weightage in the evaluation process.
Any paper ready for publication, the students should discuss with the guide and take necessary action to
publish the paper along with the guide in due course of the semester.
3
SEMESTER - IV
Total 300 15
* 50% of the marks to be awarded by the Project Guide and the remaining 50% to be awarded by a panel
of examiners, including the Project Guide, constituted by the Department
** Thesis evaluation and Viva-voce will be conducted at the end of the fourth semester by a panel of
examiners, with at least one external examiner, constituted by the University.
4
MCS* 101 MATHEMATICAL FOUNDATIONS FOR L T P C
COMPUTER SCIENCE 3 1 0 4
Module 1: Fuzzy Mathematics
Crisp sets and Fuzzy sets-, α-cuts, Convex fuzzy sets, Fuzzy cardinality, Algebra of fuzzy sets,
Standard fuzzy set operations-(complement, union and intersection), Yager and Sugeno classes.
Crisp relations and Fuzzy relations, Operations on Fuzzy relations. Fuzzy Cartesian product.
Fuzzy Equivalence relations and similarity relations.
References:
1. R. P. Grimaldi, "Discrete and Combinatorial Mathematics: An Applied Introduction",
Addison Wesley, 1994.
2. George J Clir and Tina A Foldger “Fuzzy sets –Uncertainty and Information” Prentice Hall of
India,1988.
3. George J Klir and Bo Yuan, ”Fuzzy sets and Fuzzy logic” Prentice-Hall of India,1995.
4. Timothy J. Ross, “Fuzzy logic with Engineering applications”- Wiley-India.
5. Robertazzi T.G,”Computer Networks and systems-Queuing Theory and Performance
Evaluation”-Springer third edition.
6. Ross S.M., “Probability Models for Computer Science”-Academic Press, 2002.
5
MCS* 102 DISTRIBUTED OPERATING SYSTEMS L T P C
3 1 0 4
References:
1. Pradeep Sinha K., “Distributed Operating Systems Concepts and Design”, PHI Learning
Private Ltd.
2. Mukesh Singhal, Niranjan G Shivarathri, “Advanced Concepts in Operating Systems”, Tata
Mc-Graw Hill Ltd.
3. Coulouris.G, Dollimore J & Kindberg T, “Distributed Systems concepts and design”, 4th
edition, Pearson Education.
4. Tanenbaum A S, “ Modern Operating System”, PHI learning private limited, 3rd edition.
6
MCS* 103 ADVANCED DATA STRUCTURES AND ALGORITHMS L T P C
3 1 0 4
Module 1
Amortized Complexity Analysis. Advanced Structures for Dictionary ADT: Red-Black Trees,
Splay Trees. Multidimensional Search Trees: k-d Trees, Point Quadtrees. Advanced Structures
for Priority Queues: Leftist Trees, Binomial Heaps, Symmetric Min-Max Heaps.
Module 2
Searches in Graphs: DFS, BFS, Connected Components, Bi-connected Components. Activity on
Vertex and Activity on Edge Networks. Maximum Flows, Bipartite Matching.
Module 3
Solution of recurrence equations: Substitution Method, Recursion Tree, and Master Method.
Divide and Conquer: Selection, Convex Hull, Maximum-subarray problem. Greedy Methods:
Container Loading, Continuous Knapsack Problem. Dynamic Programming: 0/1 Knapsack,
Traveling Salesperson Problem, Flow Shop Scheduling.
Module 4
Approximation Algorithms: Vertex-Cover Problem, Traveling-Salesman Problem, Set-Covering
Problem, Subset-Sum Problem. Introduction to Probabilistic Analysis and Randomized
Algorithms.
References:
1. E. Horowitz, S. Sahni, and D. Mehta, “Fundamentals of Data Structures in C++”, Second
Edition, University Press, 2007.
2. E. Horowitz, S. Sahni, and S. Rajasekharan, “Fundamentals of Computer Alllgorithms”,
Second Edition, University Press, 2007.
3. T. H. Cormen, C. E. Leiserson, R. Rivest, and C Stein,” Introduction to Algorithms”, Third
Edition, Prentice Hall of India, 2009.
4. V. S. Subrahmanian, Morgan Kaufman, “Principles of Multimedia Database Systems” 1998.
5. S. Baase, and A. V. Gelder, “Computer Algorithms – Introduction to Design and Analysis”,
Third Edition, Pearson Education, 2000.
7
MCS* 104 PARALLEL COMPUTER ARCHITECTURE L T P C
3 1 0 4
Module 1: Introduction
Basics of Computer Design & Performance Evaluation:-Defining Computer Architecture,
Dependability, Quantitative Principles of Computer Design, CPU Performance & its factors,
SPEC Benchmarks. Computational model:- Basic computational models, von-Neumann
Computation Model.
References:
1. John L.Hennessy and David A.Patterson, “Computer Architecture-A Quantitative
Approach” 4th Edition.
2. John L.Hennessy and David A.Patterson, ”Computer Architecture-Hardware &
Software Approach”.
3. Sima, Fauntain, Kscucle, “Advanced Computer Architecture a design space approach.”
Pearson Edition.
4. Kai Hwang, “Advanced Computer Architecture”.
5. David Culler and J. Palsingh, Morgan Kaufmann, ” Parallel Computer Architecture”.
6. M.Sasikumar, Dinesh Shikhare, P. Ravi Prakash “Introduction to Parallel Processing” PHI.
7. Salim Hariri, Manesh Parashar, “Tools & Environments for Parallel and Distributed
8
Computing”, A John Wiley & Sons INC., Publication.
8. http://www.intel.com/technology/itj/2006/volume10issue02/art01_Intro_to_Core_Duo/
p02_intro.htm
9
MCSIS 105-1 NATURAL LANGUAGE PROCESSING L T P C
3 0 0 3
Module 1: Introduction
Knowledge in speech and language processing - Ambiguity - Models and Algorithms - Language,
Thought and Understanding. Regular Expressions and automata: Regular expressions - Finite-
State automata. Morphology and Finite-State Transducers: Survey of English morphology -
Finite-State Morphological parsing - Combining FST lexicon and rules - Lexicon-Free FSTs: The
porter stammer - Human morphological processing
Module 2: Syntax
Word classes and part-of-speech tagging: English word classes - Tagsets for English - Part-of-
speech tagging - Rule-based part-of-speech tagging - Stochastic part-of-speech tagging -
Transformation-based tagging - Other issues. Context-Free Grammars for English: Constituency -
Context-Free rules and trees - Sentence-level constructions - The noun phrase - Coordination -
Agreement - The verb phase and sub categorization - Auxiliaries - Spoken language syntax -
Grammars equivalence and normal form - Finite-State and Context-Free grammars - Grammars
and human processing. Parsing with Context-Free Grammars: Parsing as search - A Basic Top-
Down parser - Problems with the basic Top-Down parser - The early algorithm - Finite-State
parsing methods.
10
Attachments for a fragment of English - Integrating semantic analysis into the early parser -
Idioms and compositionality - Robust semantic analysis. Lexical semantics: relational among
lexemes and their senses - WordNet: A database of lexical relations - The Internal structure of
words - Creativity and the lexicon. Application: Word sense Disambiguation.
References:
1. Daniel Jurafsky & James H.Martin, “Speech and Language Processing”, Pearson
Education (Singapore) Pte. Ltd., 2002.
2. James Allen, “Natural Language Understanding”, Pearson Education, 2003.
3. Gerald J. Kowalski and Mark.T. Maybury, “Information Storage and Retrieval Systems”,
Kluwer academic Publishers, 2000.
4. Tomek Strzalkowski “Natural Language Information Retrieval“, Kluwer academic
Publishers, 1999.
5. Christopher D. Manning and Hinrich Schutze, “Foundations of Statistical Natural
Language Processing “, MIT Press, 1999.
11
MCSIS 105-2 BIOINFORMATICS L T P C
3 0 0 3
Module 3: Genomics
Functional Genomics: Gene expression analysis by cDNA micro arrays, SAGE, Strategies for
generating ESTs and full length inserts; EST clustering and assembly; EST databases- DBEST,
UNIGENE. Gene/Protein function prediction using Machine learning tools: supervised /
unsupervised learning, Neural network, SVM.
Module 4: Proteomics
Protein and RNA structure prediction, secondary and tertiary structure, polypeptic composition,
computational methods for identification of polypeptides from mass spectrometry, algorithms for
modeling protein folding, protein classification.
Protein-Protein Interaction: Experimental identification of protein-protein interactions, PPI
databases: STRINGS, DIP, PPI server. Protein-protein quaternary structure modeling- Protein-
protein docking algorithms, Homology modeling, Monte Carlo docking simulation.
References:
1. David W. Mount “Bioinformatics Sequence and Genome Analysis”, Cold Spring Harbor
laboratory Press, 2001.
12
2. C. Rastogi, Namita Mendiratta, Parag Rastogi. ”Bioinformatics-Concepts, Skills,
Applications”.
3. Andreqas D. Baxevanis, B. F. Francis Ouellette., "Bioinformatics: A Practical Guide to the
Analysis of Genes and Proteins “, John Wiley and Sons, New York 1998.
4. Andrew, R. Leach, “Molecular modelling: Principles and applications”, Prentice Hall
Publications.
5. Richard Durbin, S. Eddy, A. Krogh, G. Mitchison,”Biological Sequence Analysis:
Probabilistic models of protein and Nucleic acids” Cambridge University Press 2007.
6. Thomas E. Creighton, “Proteins: structures and molecular properties”.
13
MCSIS 105-3 AUTOMATA THEORY L T P C
3 0 0 3
References:
1. Bernard Moret, “The Theory of Computation”, AW, 1998.
2. John E Hopcroft, “Introduction to Automata Theory, Languages and Computation”,
AW, 2001.
14
3. J. Glenn Brookshear, “Theory of Computation, Formal Languages, Automata and
Complexity”, AW.
4. John Savage, “Models of Computation, Exploring the power of Computing”.
15
MCSIS 105-4 INFORMATION THEORY AND CODING L T P C
3 0 0 3
Module 1: Introduction
Information – Entropy, Information rate, classification of codes, Kraft McMillan inequality,
Source coding theorem, Shannon-Fano coding, Huffman coding, Extended Huffman coding -
Joint and conditional entropies, Mutual information - Discrete memory-less channels – BSC,
BEC – Channel capacity, Shannon limit.
References:
1. K Sayood, “Introduction to Data Compression” , Elsevier 2006.
2. S Gravano, “Introduction to Error Control Codes”, Oxford University Press 2007.
3. Amitabha Bhattacharya, “Digital Communication”, TMH 2006.
4. R Bose, “Information Theory, Coding and Cryptography”, TMH 2007.
5. Fred Halsall, “Multimedia Communications: Applications, Networks, Protocols and
Standards”, Pearson Education Asia, 2002.
16
MCS* 106-1 DATA WAREHOUSING AND DATA MINING L T P C
3 0 0 3
References:
1. Jiawei Han and Micheline Kamber “Data Mining Concepts and Techniques” Second Edition,
Elsevier, Reprinted 2008.
17
2. Alex Berson and Stephen J. Smith “Data Warehousing, Data Mining & OLAP”, Tata McGraw
– Hill Edition, Tenth Reprint 2007.
3 K.P. Soman, Shyam Diwakar and V. Ajay “Insight into Data mining Theory and Practice”,
Easter Economy Edition, Prentice Hall of India, 2006.
4. G. K. Gupta “Introduction to Data Mining with Case Studies”, Easter Economy Edition,
Prentice Hall of India, 2006.
5. Pang-Ning Tan, Michael Steinbach and Vipin Kumar “Introduction to Data Mining”, Pearson
Education, 2007.
18
MCSIS 106-2 SOFTWARE STRUCTURES AND UML L T P C
3 0 0 3
References:
1. Grady Booch, James Rumbaugh, Ivar Jacobson., ‘The Unified Modeling Language User
Guide”, Second Edition, Pearson Education 2005.
2. Hans-Erik Eriksson, Magnus Penker, Brian Lyons, David Fado, “UML 2 Toolkit”,
WILEY-Dreamtech India Pvt. Ltd.
3. Meilir Page-Jones, “ Fundamentals of Object Oriented Design in UML”, Addison Wesley,
2000.
4. Pascal Roques, ”Modeling Software Systems Using UML2”, WILEY-Dreamtech India
Pvt. Ltd.
19
MCSIS 106-3 SOFTWARE QUALITY ASSURANCE L T P C
3 0 0 3
References:
1. Galin Daniel, “Software Quality Assurance: From theory to implementation”, Pearson
Education Ltd, 2004. ISBN 978-81-317-2395-1.
20
2. Kan Stephen H, “Metrics and Models in Software Quality Engineering”, Second Edition.
Pearson Education Inc., 2003. ISBN 0-201-72915-6.
3. Pankaj Jalote, “An Integrated Approach to Software Engineering”.
4. Pankaj Jalote, “Software Project Management in Practice”, Pearson Education Ltd., 2005,
ISBN 81-7808-664-6.
5. Nina S. Godbole, “Software Quality Assurance: Principles and Practices”, Narosa
Publishing.
21
MCSIS 106-4 SOFTWARE PROJECT MANAGEMENT L T P C
3 0 0 3
Module 1: Introduction
Projects and Project Characteristics, Project Constraints, Software Projects vs. Other Projects,
Problems with Software Projects, Software Project Failures & Major Reasons, What is Project
Management?, Need for Software Project Management, Project Management Framework –
Project Stakeholders, PM Competencies, Project Environment, Project Organisation Types,
Project Management Life Cycle, Business Case, Cost Benefit Analysis, Project Charter.
22
References:
1. Bob Huges & Mike Cotterell, “Software Project Management”, Tata McGraw Hill, New
Delhi, 2002.
2. Pankaj Jalote, “Software Project Management in Practice”, Pearson Education Ltd, 2005.
3. Gopalaswamy Ramesh, “Managing Global Software Projects”, Tata McGraw Hill, New
Delhi, 2006.
4. Roger S Pressman, “Software Engineering: A Practitioner’s Approach”, Tata
McGraw Hill, New Delhi, 2001.
5. Pankaj Jalote, “An Integrated Approach to Software Engineering”.
23
MCS* 107 OPERATING SYSTEMS LAB L T P C
0 0 3 2
List of Experiments:
24
MCSIS 108 SEMINAR – I L T P C
0 0 2 1
Each student shall present a seminar on any topic of interest related to the core / elective courses
offered in the first semester of the M. Tech. Programme. He / she shall select the topic based on
the References: from international journals of repute, preferably IEEE journals. They should get
the paper approved by the Programme Co-ordinator / Faculty member in charge of the seminar
and shall present it in the class. Every student shall participate in the seminar. The students should
undertake a detailed study on the topic and submit a report at the end of the semester. Marks will
be awarded based on the topic, presentation, participation in the seminar and the report submitted.
25
MCS* 201 MODERN COMPUTER NETWORKS L T P C
3 1 0 4
Module 1: Physical Layer and Data link layer
Physical Layer: Data Transmission- Analog and Digital Transmission, Transmission
Impairments, Channel Capacity. Transmission Media- Wired Transmission, Wireless
Transmission, Wireless Propagation, Line-of Sight Transmission, Signal Encoding Techniques.
Data link layer: TCP/IP Protocol Architecture, Framing, Reliable Transmission, Ethernet (802.3)
and Token Ring (802.5).
References:
1. William Stallings, “Data and Computer Communications”, Pearson Education.
2. Behrouz A Forouzan, “TCP/IP Protocol Suite”, Tata McGraw-Hill.
3. Peterson and Davie, “Computer Networks -A systems approach”, Elsevier.
4. Kurose and Ross, “Computer Networks A systems approach”, Pearson Education.
5. Behurouz A Forouzan, “Data Communications & Networking”, 4th edition, McGraw-Hill.
26
MCS* 202 ADVANCED DATABASE SYSTEMS L T P C
3 1 0 4
References:
1. R. Elmasri, S.B. Navathe, “Fundamentals of Database Systems”, Fifth Edition, Pearson
Education/Addison Wesley, 2007.
27
2. Thomas Cannolly and Carolyn Begg, “Database Systems, A Practical Approach to
Design, Implementation and Management”, Third Edition, Pearson Education, 2007.
3. Vijay Kumar,” Mobile Database Systems”, A John Wiley & Sons, Inc., Publication.
4. Henry F Korth, Abraham Silberschatz, S. Sudharshan, “Database System Concepts”, Fifth
Edition, McGraw Hill, 2006.
5. C.J. Date, A.Kannan and S.Swamynathan,”An Introduction to Database Systems”, Eighth
Edition, Pearson Education, 2006.
6. Raghu Ramakrishnan, Johannes Gehrke, “Database Management Systems”, McGraw Hill,
Third Edition 2004.
28
MCS* 203 COMPUTER SECURITY AND APPLIED L T P C
CRYPTOGRAPHY 3 1 0 4
Module 2
Introduction to Number Theory, Elliptic curve arithmetic. Symmetric Key cryptography: Block
cipher design principles and criteria, DES, IDEA, AES, RCS, Blowfish, Differential and linear
cryptanalysis. Asymmetric key cryptography: Principles of public key crypto systems, RSA
algorithm, key management, Diffie-Hellman key exchange, elliptic curve cryptography.
Module 4
Network Security: Introduction, IP Security-Overview, Architecture, AH, ESP, Combining
Security Associations, Key Management. System Security- Intrusion Detection, Password
Management, Viruses and related threats, Virus Counter measures, Firewalls-Design Principles,
Trusted Systems, Web Security:- Web Security consideration, Secure Socket Layer, Transport
Layer Security, Secure Electronic Transaction.
References:
1. William Stallings, “Cryptography and network security- principles and practice”, 3 rd
Edition, Pearson Prentice Hall.
2. Charlie Kaufman, Radia Perl man, Mike Speciner, “Network Security private
communication in a practice”, 2nd Edition Pearson Prentice Hall.
3. Atul Kahate, “Cryptography and network security“, TMGH.
29
MCS* 204 COMPILER DESIGN L T P C
3 1 0 4
Module 1
Principles Of Compiler – Compiler Structure – Properties of a Compiler – Optimization –
Importance of Code optimization – Structure of Optimizing compilers – placement of
optimizations in optimizing compilers – ICAN – Introduction and Overview – Symbol table
structure – Local and Global Symbol table management. Intermediate representation – Issues –
High level, medium level, low level intermediate languages – MIR, HIR, LIR – ICAN for
Intermediate code
Module 2
Run-time support – Register usage – local stack frame – run-time stack – Code sharing –
position–independent code – Symbolic and polymorphic language support - Optimization – Early
optimization – Constant folding – scalar replacement of aggregates Simplification – value
numbering – constant propagation – redundancy elimination – loop optimization. Procedure
optimization – in-line expansion – leaf routine optimization and shrink wrapping
Module 3
Register allocation and assignment – graph coloring – control flow and low level optimizations -
Inter-procedural analysis and optimization – call graph – data flow analysis – constant
propagation – alias analysis – register allocation – global References: – Optimization for memory
hierarchy. Code Scheduling – Instruction scheduling – Speculative scheduling – Software
pipelining – trace scheduling – percolation scheduling
Module 4
Case Studies – Sun Compilers for SPARC – IBM XL Compilers – Alpha compilers – PA –RISC
assembly language – COOL – ( Classroom Object oriented language) - Compiler testing tools –
SPIM
References:
1. Steven S. Muchnick, Koffman, “Advanced Compiler Design & Implementation”, Elsevier
Science, Indian Reprint 2003.
30
2. Keith D Cooper and Linda Torczon, “Engineering a Compiler”, Elsevier Science, India.
3. Sivarama P. Dandamudi,” Introduction to Assembly language programming: for Pentium and
RISC processors”.
4. Allen Holub “Compiler Design in C”, Prentice Hall of India, 1990.
5. Alfred Aho, V. Ravi Sethi, D. Jeffery Ullman, “Compilers Principles Techniques and Tools”,
Addison Wesley, 1988.
6. Charles N. Fischer, Richard J. Leblanc, “Crafting a compiler with C”, Benjamin-Cummings
Publishing Co., Inc. Redwood City, CA, USA.
31
MCS* 205-1 NEURAL NETWORKS L T P C
3 0 0 3
Module 4: ART
Noise saturation dilemma – solution. ART-Outstar- Instar-ART1- Applications. The new
generation- pulsed neuron model- Integrate and fire neurons- conductance based models.
References:
1. Satish Kumar “Neural Networks A classroom Approach”, The McGraw-Hill
Companies.
2. James A ,“An introduction to neural Networks “, Anderson PHI.
3. Simon Haykin, “Neural Networks :A comprehensive foundation “, Pearson Education.
32
MCSIS 205-2 GENETIC ALGORITHMS AND APPLICATIONS L T P C
3 0 0 3
Module 4: Application
Applications of Genetic based machine learning-Genetic Algorithm and parallel processors,
constraint optimization, uses of GA in solving NP hard problems, multilevel optimization, real
life problem.
References:
1. Melanie Mitchell, “An introduction to Genetic Algorithm”, Prentice-Hall of India, New
Delhi, Edition: 2004.
2. David.E.Golberg, “Genetic algorithms in search, optimization and machine learning”,
Addition-Wesley-1999.
3. S.Rajasekaran G.A Vijayalakshmi Pai, ”Neural Networks, Fuzzy logic and Genetic
Algorithms Synthesis and Applications”, Prentice Hall of India, New Delhi-2003.
4. Nils.J.Nilsson, ”Artificial Intelligence- A new synthesis”, Original edition-1999.
5. Tutorial sessions: Latest research papers in GA.
33
MCSIS 205-3 AGENT BASED INTELLIGENT SYSTEMS L T P C
3 0 0 3
Module 1: Introduction
Definitions - Foundations - History - Intelligent Agents-Problem Solving-Searching –
Uninformed Search strategies-BFS,DFS- Heuristics – Greedy best- first, A*- Local search-
Constraint Satisfaction Problems – Backtracking search for CSPs , Local search for CSP-
Adversarial Search-Game playing, Minmax algorithm, Alpha-Beta pruning.
References:
1. Stuart Russell and Peter Norvig, “Artificial Intelligence - A Modern Approach”, 2 nd
Edition, Prentice Hall, 2002.
2. Michael Wooldridge, “An Introduction to Multi Agent System”, John Wiley, 2002.
3. Patrick Henry Winston, ” Artificial Intelligence” , III Edition, AW, 1999.
4. Nils J. Nilsson,” Principles of Artificial Intelligence”, Narosa Publishing House, 1992.
34
MCSIS 205-4 FUZZY LOGIC L T P C
3 0 0 3
Module 1: Fuzzy Logic
Crisp sets & fuzzy sets: introduction, concepts, fuzzy operations general aggregation of operation.
Fuzzy relation, Binary relation, Equivalence & similarity relation. Fuzzy relation equation.
Application: Natural Engineering, Management & decision making & computer science.
35
References:
1. William Siler and James J Buckley, “Fuzzy Expert Systems and Fuzzy Reasoning”, Wiley
Inter- science, 2004.
2. Timothy J Ross, “Fuzzy Logic with Engineering Applications”, Wiley, 2004.
3. George Klir, “Fuzzy Sets Uncertainty & Information”, Prentice Hall.
4. George J.Klir, Tina A.Folger, “Fuzzy Sets, Uncertainty and Information“, PHI, 2005 Edition.
36
MCSIS 206-1 PATTERN RECOGNITION L T P C
3 0 0 3
References:
1. Robert J.Schalkoff, ”Pattern Recognition : Statistical, Structural and Neural Approaches” ,
John Wiley&Sons Inc., New York, 1992.
2. Tou and Gonzales,” Pattern Recognition Principles”, Wesley Publication Company, London,
1974.
3. Duda R.O., and Hart.P.E., “Pattern Classification and Scene Analysis” , Wiley, New York,
1973.
37
MCSIS 206-2 SOFTWARE ARCHITECTURE L T P C
3 0 0 3
Module 1: Introduction
Introduction To Software Architecture An Engineering Discipline for Software, Architecture
Business Cycle, Where do Architectures Come from, Software Processes and the Architecture
Business Cycle, Features of Good Architecture.
References:
1. Mary Shaw, David Garlan, “Software Architecture”, Prentice Hall India, 2000.
2. Len Bass, Paul Clements, Rick Kazman, “Software architectures in practice”, Addison-
Wesley, 2003.
38
MCSIS 206-3 IMAGE PROCESSING L T P C
3 0 0 3
References:
1. Rafael C. Gonzalez and Richard E. Wood, “Digital Image Processing”, 3rd Edition,
Prentice Hall, 2008.
2. Anil K Jain, “Fundamentals of Digital Image Processing”, Prentice Hall, 1989.
3. William K. Pratt, “Digital Image Processing”, 3 rd edition, John Wiley, 2001.
4. Rafael C.Gonzalez, Richard E.Woods and Steven L. Eddins, “Digital Image Processing
Using MATLAB”, 1st Edition, Pearson Education, 2004.
39
MCSIS 206-4 FAULT TOLERANT SYSTEMS L T P C
3 0 0 3
Module 1: Introduction
Fault Classification, Types of Redundancy, Basic Measures of Fault Tolerance, Hardware Fault
Tolerance, The Rate of Hardware Failures, Failure Rate, Reliability, and Mean Time to Failure,
Canonical and Resilient Structures , Other Reliability Evaluation Techniques.
Module 4: Checkpointing
Introduction, Checkpoint Level, Optimal Checkpointing-An Analytical Model, Cache-Aided
Rollback Error Recovery (CARER), Checkpointing in Distributed Systems, Checkpointing in
Shared-Memory Systems, Checkpointing in Real-Time Systems, Case Studies: NonStop Systems,
Stratus Systems, Cassini Command and Data Subsystem, IBM G5, IBM Sysplex, Itanium.
References:
1. Israel Koren, Mani Krishna, ”Fault Tolerant Systems”, Elsevier Science & Technology, 2007.
2. Parag K. Lala “Fault Tolerant and Fault testable hardware design”, Prentice-Hall International,
1985.
3. Martin L Shooman, Willey, “Reliablity of Computer systems and networks : Fault Tolerance,
analysis and Design”.
40
4. DK Pradhan “FaultTolerant computer system Design”, PHI, 1996.
5. LL Pullam, ”Software Fault tolerance Techniques and implementation”, Artech House
Computer Security Series , 2001.
6. Siewiorek, Daniel P,“Reliable computer systems: Design and evaluation”, AK Peters, Ltd., 3rd
edition, 1998.
7. John Wiley, “Probability and statistics with reliability queuing and computer science
applications”, 2 nd Edition.
8. Ebeling, Charles “An Introduction to reliability and maintainability Engineering”, McGraw-
Hill Science. 1996.
41
MCS* 207 NETWORK SIMULATION LAB L T P C
0 0 3 2
Experiment list:
1. A thorough study of packet capturing tool called WireShark.
2. Familiarizing Network Simulator – 2 (NS2) with suitable examples.
3. Simulate a wired network consisting of TCP and UDP Traffic using NS2 and then
calculate their respective throughput using AWK script.
4. Performance evaluation of different routing protocols in wired network environment
using NS2.
5. Performance evaluation of different queues and effect of queues and buffers in wired
network environment using NS2.
6. Compare the behavior of different variants of TCP (Tahoe, Reno, Vegas….) in wired
network using NS2. Comparison can be done on the congestion window behavior by
plotting graph.
7. Simulation of wireless Ad hoc networks using NS2.
8. Simulate a wireless network consisting of TCP and UDP Traffic using NS2 and then
calculate their respective throughput using AWK script.
9. Performance evaluation of different ad-hoc wireless routing protocols (DSDV, DSR,
AODV …) using NS2.
10. Create different Wired-cum-Wireless networks and MobileIP Simulations using NS2.
42
MCSIS 208 SEMINAR – II L T P C
0 0 2 1
Each student shall present a seminar on any topic of interest related to the core / elective courses
offered in the second semester of the M. Tech. Programme. He / she shall select the topic based
on the References: from international journals of repute, preferably IEEE journals. They should
get the paper approved by the Programme Co-ordinator / Faculty member in charge of the
seminar and shall present it in the class. Every student shall participate in the seminar. The
students should undertake a detailed study on the topic and submit a report at the end of the
semester. Marks will be awarded based on the topic, presentation, participation in the seminar and
the report submitted.
43
MCSIS 301 INDUSTRIAL TRAINING AND MINIPROJECT L T P C
0 0 20 10
The student shall undergo Industrial training of one month duration and a Mini Project of two
month duration. Industrial training should be carried out in an industry / company approved by the
institution and under the guidance of a staff member in the concerned field. At the end of the
training he / she has to submit a report on the work being carried out.
Projects can be developed either from a student’s own idea or it can be assigned by the
faculty. Students doing application projects should demonstrate a working design to meet the
specifications of the assigned project.
The students can do the mini project externally only if they are guided by a faculty with
minimum M.E/M.TECH qualification. A detailed report of project work consisting of the design,
development and implementation work that the candidate has executed should be submitted.
Evaluation of the Mini Project will be based on the talk delivered by the candidate
(presentation), the report submitted and demonstration of the work done. Presenting the work in a
National Conference with the consent of the guide a will carry an added weightage to the review
process.
44
MCSIS 302 MASTER’S THESIS PHASE - I L T P C
0 0 10 5
In master’s thesis Phase-I, the students are expected to select an emerging research area
in Computer Science or related fields, After conducting a detailed literature survey, they should
compare and analyze research work done and review recent developments in the area and
prepare an initial design of the work to be carried out as Master’s Thesis. It is expected that the
students should refer National and International Journals and proceedings of National and
International conferences while selecting a topic for their thesis. He/She should select a recent
topic from a reputed International Journal, preferably IEEE/ACM. Emphasis should be given for
introduction to the topic, literature survey, and scope of the proposed work along with some
preliminary work carried out on the thesis topic.
Students should submit a copy of Phase-I thesis report covering the content discussed
above and highlighting the features of work to be carried out in Phase-II of the thesis. Students
should follow standard practice of thesis writing. Presenting the work, carried out by the students
in a National/International Conference is encouraged.
The candidate should present the current status of the thesis work and the assessment will
be made on the basis of the work and the presentation, by a panel of internal examiners in which
one will be the internal guide. The examiners should give their suggestions in writing to the
students so that it should be incorporated in the Phase–II of the thesis.
45
MCSIS 401 MASTER’S THESIS L T P C
0 0 30 15
In the fourth semester, the student has to continue the thesis work and after successfully finishing
the work, he / she have to submit a detailed thesis report. The work carried out should lead to a
publication in a National / International Conference. They should have submitted the paper before
M. Tech. evaluation and specific weightage should be given to accepted papers in reputed
conferences.
A comprehensive viva-voce examination will be conducted at the end of the fourth semester by
an internal examiner and external examiners appointed by the university to assess the candidate’s
overall knowledge in the respective field of specialization.
46