Course Curriculum

M.Tech.(CSE) Course Code: 8150

Batch : 2011

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATION

Institute of Engineering & Technology

Department of Computer Engineering & Application (Batch 2011)

M.Tech.(CSE)

ABOUT THE PROGRAM

The Department of Computer Engineering & Application at GLA University provides cutting edge research and imparts state of the art education in M Tech (CSE) course. The Department provides an outstanding research environment complemented by excellent pedagogy. The Department is committed to equip the M Tech(CSE) students with the skills to analyze, design and develop various applications of computer system with a constant focus on strengthening analytical thinking, problem solving, research, teamwork, communication skills and readiness for lifelong learning. The Institute initiated its undergraduate program in Computer Science and Engineering in 1998. Since then the activities of the Department of Computer Engineering & Application have proliferated in various directions. A postgraduate course in Computer Science and Engineering leading to an M Tech (CSE) degree was introduced in the 2010-2011 Session. The M Tech(CSE) course offered by the department gives a plethora of options to the desired students through its various full time and part time courses. The Department offers a Full-Time 2 year programme, comprising of 4 semesters and a Part-Time 3 year programme comprising of 6 semesters. The Faculty and the research infrastructure of the department are committed to impart a high level of learning. This fact is quite evidently reverberated by looking into the combination of subjects the department is offering. For core courses, the department offers subjects likeTheory of Computation, Distributed Database Systems, Advanced Data Structures & Algorithms, Computer System Software, Parallel Computing, Image Processing & Computer Vision, Embedded Systems, Mobile Adhoc Networks, Intelligent Systems and Advanced Optimization Techniques. To provide enough flexibility, a student can opt for a subject of his/her choice from a wide range of subjects like-Cluster and Grid Computing, Client Server & Middleware Technologies, Network Performance& Evaluation, Research Methodologies, Computer Security& Forensics and Data Mining & Warehousing. To take M Tech (CSE) course to a new level of excellence and to exemplify the quality of technical education, various seminars and conferences are organized throughout the year. This ensures that a proper platform is provided to a student and assignments will ensure that a student is on his\her toes as far as course is concerned.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATION, Institute of Engineering & Technology

Department of Computer Engineering & Application (Batch 2011)

M.Tech.(CSE)

COURSE STRUCTURE

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATION, Institute of Engineering & Technology

Department of Computer Engineering & Application (Batch 2011)

M.Tech.(CSE)

First Semester
S. NO. 1. 2. 3. 4. 5. 6. 7. CODE MCS111 MCS112 MCS113 MCS116 MCS115 MCS181 MCS183 SUBJECT Theory of Computation Distributed Database Systems Advanced Data Structures & Algorithms Software Engineering Methodologies Parallel Computing Seminar-I A D S Lab. TOTAL LECTURE 4 4 4 4 4 0 0 20 TEACHING SCHEME TUTORIALS PRACTICALS 0 0 0 0 0 0 0 0 0 0 0 0 0 2 2 4 CREDITS 4 4 4 4 4 1 1 22

Second Semester
S. NO. 1. 2. 3. 4. 5. 6. 7. CODE MCS121 MCS122 MCS123 MCS124 MCS126 MCS191 MCS193 SUBJECT Image Processing & Computer Vision Embedded Systems Mobile Ad-hoc Networks Intelligent Systems Information Retrieval IPCV Lab. Seminar-II TOTAL LECTURE 4 4 4 4 4 0 0 20 TEACHING SCHEME TUTORIALS PRACTICALS 0 0 0 0 0 0 0 0 0 0 0 0 0 2 2 4 CREDITS 4 4 4 4 4 1 1 22

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATION, Institute of Engineering & Technology

Department of Computer Engineering & Application (Batch 2011)

M.Tech.(CSE)

Third Semester
S. NO. 1. 2. 3. 4. 5. CODE SUBJECT Elective-I Elective - II Colloquium Thesis Part I Total LECTURE 4 4 0 0 8 TEACHING SCHEME TUTORIALS PRACTICALS 0 0 0 0 0 4 0 8 0 12 CREDITS 4 4 2 4 14

MCS282 MCS281

ELECTIVE-1 - Third Semester

S. NO. 1. 2. 3. CODE MCS 231 MCS232 MCS233 SUBJECT Cluster and Grid Computing Client Server & Middleware Technologies Information Security LECTURE 4 4 4 TEACHING SCHEME TUTORIALS PRACTICALS 0 0 0 0 0 0 CREDITS 4 4 4

ELECTIVE-2 - Third Semester

S. NO. 1. 2. 3. CODE MCS234 MCS235 MCS236 SUBJECT Research Methodologies Pattern Recognition Data Warehousing & Mining LECTURE 4 4 4 TEACHING SCHEME TUTORIALS PRACTICALS 0 0 0 0 0 0 CREDITS 4 4 4

Fourth Semester
S. NO. 1. 2. CODE MCS291 SUBJECT Thesis Part II Total LECTURE 0 0 TEACHING SCHEME TUTORIALS PRACTICALS 0 28 0 28 CREDITS 14 14

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATION, Institute of Engineering & Technology

Department of Computer Engineering & Application (Batch 2011)

M.Tech.(CSE)

MCS 111: THEORY OF COMPUTATION

Credits: 04
Module No.

Semester I
Contents

LTP : 400
Teaching Hours

Automata & Languages Chomsky Hierarchy of Grammars and the corresponding acceptors, Turing Machines, Recursive and Recursively Enumerable Languages; Operations on Languages, closures with respect to the operations. Computability Theory Decidability Decidable languages, The Halting Problem, Undecidable Problems about Turing Machines, Posts Correspondence Problem, Reducibility. Complexity Theory Time Complexity - Measuring Complexity, The class P, The class NP, NPCompleteness, Reduction, co-NP, Polynomial Hierarchy Space Complexity -- Savich's Theorem, The class PSPACE, PSPACE Completeness. Intractability.

13

II

14

III

13

References: Michael Sipser - Introduction to The Theory of Computation, CENGAGE Learing John E. Hopcroft, Rajeev Motwani, Jeffery D. Ullman Automata Theory, Languages, and Computation, Pearson Education John C. Martin Introduction to Languages and the Theory of Computation, McGraw Hill Harry R. Lewis, Christos H. Papadimitriou Elements of the Theory of Computation

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATION, Institute of Engineering & Technology

Department of Computer Engineering & Application (Batch 2011)

M.Tech.(CSE)

MCS112: Distributed Database Systems

Credits: 04
Module No.

Semester I
Contents

LTP : 400
Teaching Hours

Introduction: Introduction to distributed databases, Overview of Relational DBMS, Relational Database concepts, Normalization, Integrity rules, comparison of distributed and centralized database systems, Levels of Distributed Transparency: Reference Architecture for Distributed Database, Type of Database Fragmentation, Distributed Transparency, Integrity Constraints, Distributed Database Design: Framework for Distributed Database, Design of Database Fragmentation Distributed Query Processing: Representation of database operation in form of a query, operation in form of a query, operations on a query, unary and binary tree in a query, converting a global query into fragment query, join and union operations involving a query, aggregate functions, parametric queries. Query optimization: Introduction to query optimization, estimation of profiles of algebraic operations, optimization graphs, reduction of relation using semi-join and join operation. Transactions Management in Distributed Database: Properties and goals of transaction management, distributed transactions, recovery mechanism in case of transaction failures, log based recovery, check pointing, communication and site failures, Concurrency Control in Distributed Database: Serializability and timestamp in distributed databases. Introduction to distributed deadlocks, local and global wait for graphs, deadlock detection, prevention of deadlocks.

13

II

13

III

14

References: Stefano Ceri and Giuseppe Palgatti, Distributed Database, McGraw Hill Publications, 1985. Korth, Silbertz, Sudarshan, Database Concepts, McGraw Hill Publications Data C J, An Introduction to Database System, Addison Wesley A.Silberchatz Database System Concepts 3rd Edn. McGraw Hill Inc., 1997. Majumdar & Bhattacharya, Database Management System, TMH

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATION, Institute of Engineering & Technology

Department of Computer Engineering & Application (Batch 2011)

M.Tech.(CSE)

MCS113: ADVANCED DATA STRUCTURES & ALGORITHMS

Credits: 04
Module No. I

Semester I
Contents

LTP : 402
Teaching Hours 13

Advanced Data Structures: Data structures, Algorithms, Asymptotic Notations, Recurrence Relations, 2-3 trees, Red-black trees, R-Tree, Splay trees, Skip lists.. Algorithm Design Techniques: Dynamic Programming: Knapsack problem, Chain matrix multiplication, OBST, Greedy algorithms: Knapsack problem, shortest paths problem, Divide-and-Conquer Approach: Matrix Multiplication, Convex Hull, Branch and Bound: Knapsack problem, Assignment Problems, Backtracking: Knapsack problem, sum subset problem. Advanced Algorithms: Sorting Networks, Polynomials and the FFT, Probabilistic Algorithms: Numerical Probabilistic Algorithms, Monte Carlo Algorithms, Computational Complexity: NP-Completeness, Approximation Algorithms: Vertex Cover Problem, TSP Problem, Set Covering Problem. Randomized Algorithms.

II

13

III

14

References: Thomas H. Coreman, Charles E. Leiserson and Ronald L. Rivest - Introduction to Algorithms, Prentice Hall of India. Gilles Brassard Paul Bratley - Fundamentals of Algorithms, Prentice Hall. RCT Lee, SS Tseng, RC Chang and Y T Tsai - Introduction to the Design and Analysis, Mc Graw Hill, 2005. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran - Fundamentals of Computer Algorithms , OrientLongman.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATION, Institute of Engineering & Technology

Department of Computer Engineering & Application (Batch 2011)

M.Tech.(CSE)

MCS126: SOFTWARE ENGINEERING METHODOLOGIES

Credits: 04
Module No.

Semester I
Contents

LTP : 400
Teaching Hours

Introduction: Motivation Software Attributes Complexity - Software Metrics- Software Process, Requirement Engineering, Formal requirement specification, requirement modeling and specification Design Metrics and Configuration Management. Formal Specification and program verification, introduction to formal methods, Software Process, Requirement Engineering, Formal requirement specification, requirement modeling and specification Software Design Patterns Issues in software design: modularity based cohesion & coupling Function oriented analysis & design. Software Architecture description languages Product-line architectures; Component based development Software Quality Engineering Testing Techniques Test Case Generation, Software Maintenance schemes Software testing: strategies and assessment, COTS, Software reliability metrics & modeling, Software quality: models and assurance framework, Software Maintenance, Software Metrics - COTS Integration - Distributed, Internet-scale and Webbased Software Engineering Empirical Studies of Software Tools And Methods Software Reengineering - Software Reuse - Software Safety - Enterprise Architectures, Zachman's Framework; Architectural Styles. Formal specifications Techniques Verification and Validation Theorem Provers - Model checking Temporal logics CTL & LTL and model checking

13

II

14

III

13

References: Ghezzi, Jazayeri, Mandrioli, Fundamentals of Software Engineering, 2/E,Pearson ducation,2002 Sommerville, Software Engineering, 6/E,Pearson Education, 2006 Roger S Pressman, Software Engineering A Practitioners Approach , 6/E,MGH, 2005 Schmidt, Stal, Rohnert, and Buschmann, Pattern-Oriented Software Architecture Volume 2: Patterns for Concurrent and Network ed Objects, Wiley, 2000 Len Bass, Paul Clements, Rick Katzman, Ken Bass, Software Architecture in Practice, 2/E, Addiwon Wesley Professional, 2003.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATION, Institute of Engineering & Technology

Department of Computer Engineering & Application (Batch 2011)

M.Tech.(CSE)

MCS115: PARALLEL COMPUTING

Credits: 04
Module No.

Semester I
Contents

LTP : 400
Teaching Hours

Parallel Computing: Introduction: Need of high speed computing, Techniques to achieve high speed computing memory inter leaving cache applications & problems performances laws & matrices, Pipeline Computers & Parallel Computers, RISC & CISC Systems. Distributed & Parallel Processors: Flynns & other Computer classification Interconnection Networks Static & Dynamic networks various design parameters, - Advantages & limitation, various multiprocessor organizations, and their comparison, Mapping & scheduling concept. Parallel Programming: Abstract Machine Models RAM& PRAM, various parallel algorithms on them: Practical Models for parallel Computation BSP & Log P Models: Cost Optimal Algorithms: Parallel programming Environments: parallel programming Languages.

13

II

14

III

13

Reference Books: M.J Quinn- Parallel Computing: Theory and Practice, McGraw Hill KaiHwarg: Parallel Computer Architecture Tata McGraw Hill Edition

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATION, Institute of Engineering & Technology

Department of Computer Engineering & Application (Batch 2011)

M.Tech.(CSE)

MCS121: IMAGE PROCESSING AND COMPUTER VISION

Credits: 04
Module No.

Semester II
Contents

LTP : 400
Teaching Hours

Digital Image Fundamentals: Image sampling & quantization; Basic relationships between pixels, Some mathematical tools used in digital image processing. Image perception: Light, luminance, brightness and contrast, Human Visual System, Colour representation, Chromaticity diagram, Colour Coordinate Systems. Intensity Transformations and Spatial Filtering: Basic intensity Transformation functions, Histogram processing, Spatial filters, Using Fuzzy Techniques for intensity transformations and spatial filtering. Object Representation: Chain Codes, Polygonal approximations Using Minimum-Perimeter, Boundary Descriptors: Some Simple descriptor (Boundary straightness, Bending energy), Shape Numbers, Statistical Moments, Regional Descriptors: Some Simple Descriptors (Eccentricity, Elongatedness, Rectangularity, Compactness), Topological Descriptors, Texture, Moment Invariants Object Recognition: Knowledge Representation, patterns and Pattern Classes, Recognition based on decision theoretic Methods, Minimum distance classifier Introduction to Image Coding Algorithms: Coding Redundancy, Spatial and Temporal Redundancy, Irrelevant Information, Measuring Image Information, Fidelity Criteria, Lossless compression, Lossy Compression 3D vision, geometry and radiometry: 3D vision tasks, Geometry for 3D vision, Radiometry and 3D vision. Use of 3D vision: Shape from X, Full 3D objects, 3D model based vision, 2D view based representations of a 3D scene. Object Recognition: Patterns and pattern classes, Recognition based on decision-theoretic methods, structural methods.

13

II

14

III

13

References: Digital Image Processing, 3rd Edition, by R.C.Gonzalez and R.E.Woods, Prentice Hall Fundamentals of Digital Image Processing, by Anil K. Jain, Prentice-Hall, 1989 Digital image processing and analysis, Bhabatosh Chanda, D. Dutta Majumder, Prentice-Hall Computer Vision: A Modern Approach, by D. A. Forsyth and J. Ponce, Prentice Hall, Image Processing, Analysis and Machine Vision-Milan Sonka,Vaclav Hlavae, Roger Boyle, Thomson Digital Image Processing: An Algorithmic Approach, Madhuri A. Joshi, EEE.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATION, Institute of Engineering & Technology

Department of Computer Engineering & Application (Batch 2011)

M.Tech.(CSE)

MCS122: EMBEDDED SYSTEM

Credits: 04
Module No.

Semester II
Contents

LTP : 402
Teaching Hours

II

III

Introduction to embedded systems, categories of Embedded Systems; architecture of Embedded Systems; Implementation of Embedded System, Hardware Evolution; Challenges in designing of Embedded System. Skill required for an Embedded System Designer. Programmable Processor Architecture: Instruction set architecture; memory organization, operand location and memory addressing. 8051 architecture in brief. Enhancing processor performance; Introduction to advanced processor, case studies for selection of processor in hardware design and memory for software design Programming in assembly language (ALP) vs. High Level Language - Concepts of EMBEDDED PROGRAMMING in C++ - Objected Oriented Programming Embedded Programming in C++, C Program, compilers, Cross compiler Optimization of memory codes. Definitions of process, tasks and threads Clear cut distinction between functions ISRs and tasks by their characteristics Operating System Services- Goals Structures- Kernel - Process Management Memory Management Device Management File System Organization and Implementation I/O Subsystems Interrupt Routines Handling in RTOS, REAL TIME OPERATING SYSTEMS : Task scheduling models, Inter process communication and synchronization, ,Priority Inversion Problem and Deadlock Situations, Inter Process communications. Study of Micro C/OS-II or Vx Works or Any other popular RTOS RTOS System Level Functions Task Service Functions Time Delay Functions Memory Allocation Related Functions Semaphore Related Functions Mailbox Related Functions Queue Related Functions Case Studies of Programming with RTOS Understanding Case Definition Multiple Tasks and their functions Creating a list of tasks Functions and IPCs Exemplary Coding Steps

13

14

13

References: Rajkamal, Embedded Systems Architecture, Programming and Design, TATA McGraw-Hill, First reprint Oct. 2003 David E.Simon, An Embedded Software Primer, Pearson Education Asia, First Indian Reprint 2000. Steve Heath, Embedded Systems Design, Second Edition-2003, Newnes; Wayne Wolf, Computers as Components; Principles of Embedded Computing System Design Harcourt India, Morgan Kaufman Publishers, First Indian Reprint 2001 Frank Vahid and Tony Givargis, Embedded Systems Design A unified Hardware /Software Introduction, John Wiley, 2002

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATION, Institute of Engineering & Technology

Department of Computer Engineering & Application (Batch 2011)

M.Tech.(CSE)

MCS123: MOBILE ADHOC-NETWORK

Credits: 04
Module No.

Semester II
Contents

LTP : 400
Teaching Hours

Ad Hoc Wireless Networks: Issues in Ad Hoc Wireless Networks, Ad Hoc Wireless Internet; MAC Protocols for Ad Hoc Wireless Networks: Issues in Designing a MAC Protocol for Ad Hoc Wireless Networks, Classifications of MAC Protocols; Routing Protocols for Ad Hoc Wireless Networks: Issues in Designing a Routing Protocol for Ad Hoc Wireless Networks, Classifications of Routing Protocols, Power Aware Routing Protocols. Multi cast routing in Ad Hoc Wireless Networks: Issues in Designing a Multicast Routing Protocol, Classifications of Multicast Routing Protocols, Energy Efficient Multicasting, Multicasting with Quality of Service Guarantees, Application Dependent Multicast Routing; Security Protocols for Ad Hoc Wireless Networks: Security in Ad Hoc Wireless Networks. Network Security Requirements. Issues and Challenges in Security Provisioning. Network Security Attacks. Key Management. Secure Routing in Ad Hoc Wireless Networks; Energy Management in Ad Hoc Wireless Networks: Classification of Energy Management Schemes, Transmission Power Management Schemes, System Power Management Schemes.

13

II

14

III

13

References: C S. Ram Murthy, B. S. Manoj, Ad Hoc Wireless Networks: Architectures and Protocols, Prentice Hall of India, 2nd ed. 2005. R. Hekmat, Ad hoc Networks: Fundamental Properties and Network Topologies, Springer, 1st ed. 2006. B. Tavli and W. Heinzelman, Mobile Ad Hoc Networks: Energy Efficient Real Time Data Communications, Springer, 1st ed. 2006. G. Anastasi, E. Ancillotti, R. Bernasconi, and E. S. Biagioni, Multi Hop Ad Hoc Newtorks from Theory to Reality, Nova Science Publishers, 2008

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATION, Institute of Engineering & Technology

Department of Computer Engineering & Application (Batch 2011)

M.Tech.(CSE)

MCS124: INTELLIGENT SYSTEM

Credits: 04
Module No.

Semester II
Contents

LTP : 400
Teaching Hours

Introduction to Artificial Intelligence: Introduction to AI, Knowledge Representation: Reasoning, Issues and acquisition. Heuristic Search: Problem Solving, Techniques for heuristic search, heuristic classification, intelligent agent, Model of an intelligent system. Knowledge representations: issues, predicate logic, statistical reasoning, Representation and reasoning in logic. Semantic representations: semantic networks, frames; Frame/script systems; Conceptual dependency. Intelligent Systems: Artificial Neural Networks: Introduction, Neuron Physiology, Artificial Neurons, Learning, Feed forward, feedback networks, features of ANN, Training algorithms: Delta rule, Perceptron learning rules, Back propagation, RBFN, Recurrent networks, Chebi-chev neural network, Connectionist model. Intelligent Systems: Expert Systems & Genetic Algorithm: Introduction, Expert system: features, characteristics, development, activities, difference with conventional methods, stages in ES development, Probability based ES, Expert System tools and applications. Introduction to GA, Procedures: representation, initialization and selection, operators, mutation. Introduction to Evolutionary programming, Introduction to Fuzzy logic.

13

II

14

III

13

References: Elaine Rich & Kevin Knight, Artificial Intelligence, TMH, 2nd Edition Dan W Patterson, Introduction to Artificial Intelligence & Expert Systems, PHI NP Padhy, Artificial Intelligence & Intelligent System, Oxford ZM Zurada, Artificial Neural Network Charnick, Introduction to Artificial Intelligence

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATION, Institute of Engineering & Technology

Department of Computer Engineering & Application (Batch 2011)

M.Tech.(CSE)

MCS126: Information Retrieval

Credits: 04
Module No.

Semester II
Contents

LTP : 400
Teaching Hours

Introduction: Basic Concepts, Retrieval Process Modeling A Formal Characterization of IR Models, Classic Information Retrieval (Boolean model, Vector Model, Probabilistic Model), Alterative Set Theoretic Models, Alternative Algebraic Models (Generalized Vector Space Model, Latent Semantic Indexing Model) Query Languages and Operations: Keyword based Querying, pattern Matching, Structural Queries, User Relevance Feedback Text Operations: Document Preprocessing, Document Clustering, Text Compression Evaluation in Information Retrieval: Retrieval Performance Evaluation (Recall and Precision) Searching the Web: Characterizing the web, Search Engines, Centralized and Distributed Architecture, Ranking, Crawling the Web, Browsing, Metaseaches, Searching IR Applications: summarization and question answering

14

II

13

III

13

References:

1. Ricardo Baeza-Yate, Berthier Ribeiro-Neto, Modern Information Retrieval, Pearson Education Asia,
2005. 2. Chowdhury. G.G., Introduction to Modern Information Retrieval, Neal-Schuman Publishers; 2nd edition, 2003. 3. Daniel Jurafsky and James H. Martin, Speech and Language Processing, Pearson Education, 2000 4. David A. Grossman, Ophir Frieder, Information Retrieval: Algorithms, and Heuristics, Academic Press, 2000

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATION, Institute of Engineering & Technology

Department of Computer Engineering & Application (Batch 2011)

M.Tech.(CSE)

MCS231: CL USTER AND GRID COMPUTING

Credits: 04
Module No.

Semester III
Contents

LTP : 400
Teaching Hours

II

III

Introduction: High Performance Computing (HPC), Grand Challenge Problems, Computational and communication intensive, Parallel Architectures Classifications SMP, MPP, NUMA, Clusters and Components of a Parallel Machine, Conventional, Supercomputers and its limitations, Multi processor and Multi Computer based Distributed, Systems. Characteristics of Cluster: Cluster Components Processor/machine, High Speed Interconnections goals, topology, latency, bandwidth, Example Interconnect: Myrinet, Inifiniband, QsNet, Fast Ethernet, Gigabit Ethernet, Light weight Messaging system/Light weight communication Protocols, Cluster Middleware Job/Resource Management System, Load balancing, Scheduling of parallel processes, Enforcing policies, GUI, Introduction to programming tools such as PVM, MPI, Cluster Operating Systems Examples: Linux, MOSIX, CONDOR Characteristics of Grid: Computational services, Computational Grids, Data grids/Storage grids, management and applications, Different components of Grid Grid fabric, Grid middleware, Grid applications and portal, Globus toolkit Ver.2.4, web services, MDS,GRAM, Grid Security Cryptography, Authentication, Integrity, Digital Signature, Digital Certificates, Certificate Authority, MD 5, RSA, GSI,GSSAPI, Directory Service, LDAP,GRID FTP,GASS Fault Tolerance: Fault detection and diagnosis of Clusters and Grids. Recent advances in cluster and grid computing.

13

14

13

References: D. Janakiram, Grid Computing, Tata Mcgraw Hill R. K. Buyya, High Performance Cluster Computing: Programming and Applications, Vol 2, PHI, P. Jalote, Fault Tolerance in Distributed Systems, Prentice Hall, 1994. J. J. Jos & R. K. Buyya, High Performance Cluster Computing: Architecture and Systems, Vol 1, PHI, 1999. R. K. Buyya & C. Szyperski, Cluster Computing, Nova Science, New York, USA, 2001. R. K. Buyya & K. Bubendorfer, Market oriented Grid and Utility Computing, Wiley, 2008. J. Jaseph & C. Fellenstein, Grid Computing, Pearson

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATION, Institute of Engineering & Technology

Department of Computer Engineering & Application (Batch 2011)

M.Tech.(CSE)

MCS232: CLIENT SERVER & MIDDLEWARE TECHNOLOGIES

Credits: 04
Module No.

Semester III
Contents

LTP : 400
Teaching Hours

Introduction to client server computing, Evolution of corporate computing models from centralized to distributed computing, Client server models and their benefits. Client-Server File server Database server Group server Object server Web server Middleware General middleware Service specific middleware Client / server building blocks RPC Messaging Peer-to-Peer. Object oriented programming with java. Introduction to Distributed Objects Computing standards, OMG, Overview of RMI/CORBA, Review of java concepts and distributed object programming. COM to Distributed COM OLE - ActiveX ATL DCOM COM COM threading models - COM services Service Oriented architecture (SOA) SOA characteristics, Concept of a service, Basic & Enterprise Software Models. Web Services Technologies :, Web Services and SOA., XML Technologies Java Bean Component Model: Events , Properties , Methods EJB EJB Architecture Overview of EJB Software Architecture Building and Deploying EJBs EJB Session Beans EJB Entity Beans EJB Clients EJB Deployment RMI Interfaces Proxy and Stub Marshalling/Unmarshalling Object Creation, Invocation, Destruction Comparison of COM/DCOM with RMI/ CORBA CORBA Distributed Systems Purpose Architecture Overview CORBA and Networking Model CORBA Object Model Building an Application with RMI/CORBA

13

II

14

III

13

References: 1. 2. 3. 4. 5. 6. 7. 8. Robert Orfali, Dan Harkey, Jeri Edwards, 'The Essential Client/Server Survival Guide', Galgotia Publication Pvt. Ltd., 2002. Tom Valesky, 'Enterprise JAVA Beans', Pearson Education, 2002. Jeremy Rosenberger, 'Teach Yourself CORBA in 14 days', Techmedia, 2000. Jason Pritchard, 'COM and CORBA side by side', Addison Wesley, 2000. Sudha Sadasivam Distributed Component Architecture, Wiley India edition. Thomas Erl Service Oriented Architecture: Concepts , Technology & Design, Prentice Hall Brose, A Vogel and K. Duddy, Java programming with CORBA, 3rd Edition, Wiley-dreamtech, India John Wiley and sons Mowbray, 'Inside CORBA', Pearson Education, 2002.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATION, Institute of Engineering & Technology

Department of Computer Engineering & Application (Batch 2011)

M.Tech.(CSE)

MCS233: INFORMATION SECURITY

Credits: 04
Module No.

Semester III
Contents

LTP : 400
Teaching Hours

II

Introduction- Computer Security, Threats to security, History of Computer security, Computer System Security and Access Controls (System access and data access). Threats - Viruses ,worms , Trojan horse, bombs, trap doors, spoofs, email virus, macro viruses, remedies, Intruders, Malicious software, Firewalls, vulnerabilities & threats, Network Denial of service attack. . Communication Security- Encryption, classical encryption techniques, data encryptions standards, advance encryption techniques Network Security- Kerberos,X.509, some network security projects- SDNS, DISNet , Project MAX, Secure NFS Security- E-Mail Security, IP security, Web security Server Security- security for network server, web servers, mobile technologies (java and java script etc) Intrusion Detection Techniques Techniques to provide privacy in Internet Application and protecting digital contents(music, video, software) from unintended use, authentication. System and Application Security- mail security (PGP etc) file System security, program and security, memory security, Sandboxing. Security threads protection intruders- Viruses-trusted system. Secure programming languages- concepts structured multiprogramming, shared classes, cooperating sequential processes, structure of te multiprogramming system RC-4000 software.

13

13

III

14

References: Computer Security, Dicter gouman, John Wiley & Sons Computer Security: Art and Science, Mathew Bishop, Addison-Wisley Introduction to computer Security, Mathew Bishop, Addison-Wisley Network security, Kaufman, Perlman and Speciner, Pearson Education

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATION, Institute of Engineering & Technology

Department of Computer Engineering & Application (Batch 2011)

M.Tech.(CSE)

MCS234: RESEARCH METHODOLOGIES

Credits: 04
Module No. I

Semester III
Contents

LTP : 400
Teaching Hours 13

II

III

Basic principles of design of experiment, Error analysis in experiments. Classification of experimental designs, Design and analysis of one factor experiments -Completely randomized and randomized complete block designs, Analysis of variance. . Estimation of parameters, Residual analysis and model checking, Sample size problem. Design with two blocking variables, Latin squares, Analysis of data from a Latin square. Experiment with two factors- Introduction, Main effects and interactions, Twofactor analysis of variance, Graphic analysis, Choice of sample size. Design of Experiments with the help of orthogonal arrays, Taguchis Robust parameter design, Analysis, Noise factors, Tolerance on control factors. Research Methodology Nature and objective of research, Research topic, Literature review, Formulation of problem, Research design, Sampling techniques, Data collection, Statistical and sensitive analysis of data, Interpretation of result and report writing.

14

13

References:

Probability and Statistics for Engineers and scientists, Walpole, Myers, Myers and Ye, 7th ed, 2002, Pearson Education. Statistics in Research, Bernand Ostle and Richard N.Mensing 3rd ed, 1975, Oxford & IBH Pub Co. Probability and Statistics in Engineering, Hines, Montgomery, Goldsman and Borror, 4th ed, 2003, John Wiley & Sons. Experimental design, Theory & application, Federer, 1955, Oxford & IBH pub Co

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATION, Institute of Engineering & Technology

Department of Computer Engineering & Application (Batch 2011)

M.Tech.(CSE)

MCS235: Pattern Recognition

Credits: 04
Module No.

Semester II
Contents

LTP : 400
Teaching Hours

Introduction: Basics of pattern recognition, Design principles of pattern recognition system, Learning and adaptation, Pattern recognition approaches, Mathematical foundations Linear algebra, Probability Theory, Expectation, mean and covariance, Normal distribution, multivariate normal densities, Chi squared test. Statistical Patten Recognition: Bayesian Decision Theory, Classifiers, Normal density and discriminant functions, Parameter estimation methods: Maximum-Likelihood estimation, Bayesian Parameter estimation, Dimension reduction methods Principal Component Analysis (PCA), Fisher Linear discriminant analysis, Expectation-maximization (EM), Hidden Markov Models (HMM), Gaussian mixture models. Nonparametric Techniques: Density Estimation, Parzen Windows, KNearest Neighbor Estimation, Nearest Neighbor Rule, Fuzzy classification. Unsupervised Learning & Clustering: Criterion functions for clustering, Clustering Techniques: Iterative square - error partitional clustering K means, agglomerative hierarchical clustering, Cluster validation.

14

II

13

III

13

References: 1. Richard O. Duda, Peter E. Hart and David G. Stork, Pattern Classification, 2nd Edition, John Wiley, 2006. 2. C. M. Bishop, Pattern Recognition and Machine Learning, Springer, 2009. 3. S. Theodoridis and K. Koutroumbas, Pattern Recognition, 4th Edition, Academic Press, 2009.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATION, Institute of Engineering & Technology

Department of Computer Engineering & Application (Batch 2011)

M.Tech.(CSE)

MCS236: DATA WAREHOUSING AND MINING

Credits: 04
Module No.

Semester III
Contents

LTP : 400
Teaching Hours

II

Data Warehouse - Introduction: Differences between Operational Database Systems and Data Warehouses, From Tables and Spreadsheets to Data Cubes, Stars, Snowflakes, and Fact Constellations: Schemas for Multidimensional Databases, Data Warehouse and OLAP Technology for Data Mining Data Warehouse, Multidimensional Data Model, Data Warehouse Architecture, Data Warehouse Implementation, Further Development of Data Cube Technology, Data Preprocessing: Needs Preprocessing the Data, Data Cleaning, Data Integration and Transformation, Data Reduction, Discretization and Concept Hierarchy Generation, Online Data Storage. . Data Mining Techniques: Fundamentals of data mining, Data Mining Functionalities, Classification of Data Mining systems, Major issues in Data Mining, Data Mining Primitives, From Data Warehousing to Data Mining, Mining Association Rules in Large Databases: Association Rule Mining, Apriori algorithm, FP Growth, Classification and Prediction: Issues Regarding Classification and Prediction, Classification by Decision Tree Induction, Bayesian Classification, Rule based Classification, Prediction: Linear Regression, Nonlinear Regression Cluster Analysis: Types of Data in Cluster Analysis, A Categorization of Major Clustering Methods, Partition algorithms, K-Mean, CLARA, CLARANS; Hierarchical clustering, DBSCAN, BIRCH, CURE; Outlier Analysis. Mining Complex Types of Data: Multidimensional Analysis and Descriptive Mining of Complex Data Objects, Temporal Mining, Temporal Association Rules, Mining Spatial Databases, Spatial Clustering, Mining Multimedia Databases, Mining Time-Series and Sequence Data, Web Mining, Text Mining.

13

14

III

13

References: Data Mining Concepts and Techniques - Jiawei Han and. Micheline Kamber. Data Mining Techniques Arun K Pujari, University Press Building the DataWarehouse- W. H. Inmon, Wiley Dreamtech India Pvt. Ltd.. Data Mining Introductory and advanced topics Margaret Pearson Education

Dunham,

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATION, Institute of Engineering & Technology