8/12/2019 Sathyabama Univ ME CSC syllabus
1/41
SATHYABAMA UNIVERSITY(Established under section 3 of UGC Act, 1956)
Jeppiaar Nagar, Rajiv Gandhi Salai, Chennai - 119.
SYLLABUS
MASTER OF TECHNOLOGY PROGRAMME
IN
INFORMATION TECHNOLOGY
(4 SEMESTERS)
REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
2/41
SATHYABAMA UNIVERSITY
REGULATIONS 2010
Effective from the academic year 2010-2011 and applicable to the students admitted to the Master of Engineering
/ Technology / Architecture /Science (Four Semesters)
1. Structure of Programme
1.1 Every Programme will have a curriculum with syllabi consisting of theory and practical such as:
(i) General core courses like Mathematics
(ii) Core course of Engineering / Technology/Architecture / Science
(iii) Elective course for specialization in related fields
(iv) Workshop practice, Computer Practice, laboratory Work, Industrial Training, SeminarPresentation, Project Work, Educational Tours, Camps etc.
1.2 Each semester curriculum shall normally have a blend of lecture course not exceeding 7 and practical
course not exceeding 4.1.3 The medium of instruction, examinations and project report will be English.
2. Duration of the Programme
A student is normally expected to complete the M.E/M.Tech./M.Arch/M.Sc Programme in 4 semesters but inany case not more than 8 consecutive semesters from the time of commencement of the course. TheHead of the Department shall ensure that every teacher imparts instruction as per the number of hours specifiedin the syllabus and that the teacher teaches the full content of the specified syllabus for the course being
taught.
3. Requirements for Completion of a Semester
A candidate who has fulfilled the following conditions shall be deemed to have satisfied the requirement for
completion of a semester.
3.1 He/She secures not less than 90% of overall attendance in that semester.
3.2 Candidates who do not have the requisite attendance for the semester will not be permitted towrite the University Exams.
4. Examinations
The examinations shall normally be conducted between October and December during the odd semesters and
between March and May in the even semesters. The maximum marks for each theory and practical course(including the project work and Viva Voce examination in the Fourth Semester) shall be 100 with the followingbreakup.
(i) Theory Courses
Internal Assessment : 20 Marks
University Exams : 80 Marks
(ii) Practical courses
Internal Assessment : - -
University Exams : 100 Marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) i REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
3/41
5. Passing requirements
(i) A candidate who secures not less than 50% of total marks prescribed for the course (For all coursesincluding Theory, Practicals and Project work) with a minimum of 40 marks out of 80 in the UniversityTheory Examinations, shall be declared to have passed in the Examination.
(ii) If a candidate fails to secure a Pass in a particular course, it is mandatory that he/she shall reappear
for the examination in that course during the next semester when examination is conducted in thatcourse. However the Internal Assessment marks obtained by the candidate in the first attempt shallbe retained and considered valid for all subsequent attempts.
6. Eligibility for the Award of Degree
A student shall be declared to be eligible for the award of the M.E/M.Tech./M.Arch./M.Sc degree provided thestudent has successfully completed the course requirements and has passed all the prescribed examinations in
all the 4 semesters within the maximum period specified in clause 2.
7. Award of Credits and Grades
All assessments of a course will be done on absolute marks basis. However, for the purpose of reporting the
performance of a candidate, Letter Grades will be awarded as per the range of total marks (out of 100) obtainedby the candidate as given below:
RANGE OF MARKS FOR GRADES
Range of Marks Grade Grade Points (GP)
90-100 A++ 10
80-89 A+ 9
70-79 B++ 8
60-69 B+ 750-59 C 6
00-49 F 0
ABSENT W 0
CUMULATIVE GRADE POINT AVERAGE CALCULATION
The CGPA calculation on a 10 scale basis is used to describe the overall performance of a student inall courses from first semester to the last semester. F and W grades will be excluded for calculating GPAand CGPA.
CGPA =iCiGP i
iCi
where Ci - Credits for the subject
GP i - Grade Point for the subject
i - Sum of all subjects successfully cleared during all the semesters
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) ii REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
4/41
8. Classification of the Degree Awarded
1 A candidate who qualifies for the award of the Degree having passed the examination in all the
courses of all the semesters in his/her first appearance within a maximum period of 4 consecutivesemesters after commencement of study securing a CGPA not less than 9.0 shall be declared tohave passed the examination in First Class Exemplary.
2. A candidate who qualifies for the award of the Degree having passed the examination in all thecourses of all the semesters in his/her first appearance within a maximum period of 4 consecutivesemesters after commencement of study, securing a CGPA not less than 7.5 shall be declared tohave passed the examination in First Class with Distinction.
3. A candidate who qualifies for the award of the Degree having passed the examination in all the
courses of all the semesters within a maximum period of 4 consecutive semesters aftercommencement of study securing a CGPA not less than 6.0 shall be declared to have passedthe examination in First Class.
4 All other candidates who qualify for the award of the Degree having passed the examination in allthe courses of all the 4 semesters within a maximum period of 8 consecutive semesters after his/hercommencement of study securing a CGPA not less than 5.0 shall be declared to have passedthe examination in Second Class.
5 A candidate who is absent in semester examination in a course/project work after having registered
for the same, shall be considered to have appeared in that examination for the purpose ofclassification of degree. For all the above mentioned classification of Degree, the break of studyduring the programme, will be counted for the purpose of classification of degree.
6 A candidate can apply for revaluation of his/her semester examination answer paper in a theorycourse, within 1 week from the declaration of results, on payment of a prescribed fee along withprescribed application to the Controller of Examinations through the Head of Department. The
Controller of Examination will arrange for the revaluation and the result will be intimated to thecandidate concerned through the Head of the Department. Revaluation is not permitted for practical
courses and for project work.
Final Degree is awarded based on the following :
CGPA 9.0 - First Class - Exemplary
CGPA 7.50 < 9.0 - First Class with Distinction
CGPA 6.00 < 7.50 - First Class
CGPA 5.00 < 6.00 - Second Class
Minimum CGPA requirements for award of Degree is 5.0 CGPA.
9. Discipline
Every student is required to observe disciplined and decorous behaviour both inside and outside the University
and not to indulge in any activity which will tend to bring down the prestige of the University. If a studentindulges in malpractice in any of the University theory / practical examination, he/she shall be liable for punitive
action as prescribed by the University from time to time.
10. Revision of Regulations and Curriculum
The University may revise, amend or change the regulations, scheme of examinations and syllabi from time totime, if found necessary.
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) iii REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
5/41
M.Tech - INFORMATION TECHNOLOGY
REGULATIONS 2010 - CURRICULUM
SEMESTER I
Sl.No. SUBJECT CODE SUBJECT TITLE L T P C Page No.THEORY
1. SCSX5001 Advanced Data Structures and Algorithms 3 1 0 4 1
2. SITX5001 Network Protocols 3 0 0 3 2
3. SITX5002 Advanced Database Technologies 3 0 0 3 3
4. SITX5003 Foundations of Computer Engineering 3 0 0 3 4
5. SITX5004 Information Retrieval Techniques 3 1 0 4 5
PRACTICAL
6. SITX6501 Network Design and Programming Lab 0 0 4 2 12
TOTAL CREDITS : 19
SEMESTER II
Sl.No. SUBJECT CODE SUBJECT TITLE L T P C Page No.
THEORY
1. SITX5006 Advanced Internet Technologies 3 0 0 3 6
2. SITX5008 Web Services 3 1 0 4 7
3. SCSX5026 Mobile and Pervasive Computing 3 0 0 3 8
4. Elective - I 3 0 0 3
5. Elective - II 3 0 0 3PRACTICAL
6. SITX6502 Internet Programming Lab 0 0 4 2 12
TOTAL CREDITS : 18
SEMESTER III
Sl.No. SUBJECT CODE SUBJECT TITLE L T P C Page No.
THEORY
1. SITX5007 Network Infrastructure and Cyber Computing 3 0 0 3 9
2. SCSX5018 Grid Computing 3 0 0 3 103. SITX5009 Search Engines and Optimization 3 1 0 4 11
4. Elective - III 3 0 0 3
5. Elective - IV 3 0 0 3
PRACTICAL
6. SITX6503 Network Security and Web Services Lab 0 0 4 2 12
TOTAL CREDITS : 18
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) iv REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
6/41
SEMESTER IV
1. S83XPROJ Project & Viva voce 0 0 30 15
TOTAL CREDITS FOR THE COURSE : 70
LIST OF ELECTIVES
Sl.No. SUBJECT CODE SUBJECT TITLE L T P C Page No.
1. SCSX5008 Data Mining and Warehousing 3 0 0 3 13
2. SITX5010 C# and .Net 3 0 0 3 14
3. SITX5011 J2EE 3 0 0 3 15
4. SITX5012 Enterprise Resource Planning 3 0 0 3 16
5. SITX5013 Ecommerce Technologies 3 0 0 3 17
6. SITX5014 Component Based Technologies 3 0 0 3 18
7. SBIX5001 Introduction to Bio-Informatics 3 0 0 3 19
8. SITX5015 TCP/IP and Socket Programming 3 0 0 3 20
9. SITX5016 Satellite Communication 3 0 0 3 21
10. SCSX5014 Network Management System 3 0 0 3 22
11. SITX5017 Information Coding Techniques 3 0 0 3 23
12. SITX5018 Ad Hoc Networks 3 0 0 3 24
13. SCSX5015 Agent Based Intelligent Systems 3 0 0 3 25
14. SITX5005 Soft Computing 3 0 0 3 26
15. SITX5019 Real Time Computing 3 0 0 3 27
16. SITX5020 Embedded Architecture 3 0 0 3 28
17. SITX5021 Software Engineering 3 0 0 3 29
18. SITX5022 Advanced Networks 3 0 0 3 30
19. SCSX5021 Digital Image Processing 3 0 0 3 31
20. SCSX5024 Cloud Computing 3 0 0 3 32
21. SCSX5023 Service Oriented Architectures 3 0 0 3 33
22. SCSX5012 Software Architectures 3 0 0 3 34
23. SCSX5009 Computational Intelligence tools 3 0 0 3 35
L Lecture hours; T Tutorial hours; P Practical hours; C Credits
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) v REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
7/41
SCSX5001ADVANCED DATA STRUCTURES AND
ALGORITHMS
L T P Credits Total Marks
3 1 0 4 100
UNIT I INTRODUCTION TO ALGORITHMS 10 hrs.
Role of Algorithms in computing - analyzing algorithms - Designing algorithms - Asymptotic Notations- Summations-Formulas and properties - Recurrences.
SORTING TECHNIQUES
Heap sort, quick sort, radix sort, bucket sort, Analysis of sorting algorithms
UNIT II TREE STRUCTURES 10 hrs.
Binary Search Trees AVL Trees Red-Black trees-B-Trees Splay Trees
HEAP STRUCTURES
Min/Max heaps - Leftist Heaps Binomial Heaps Fibonacci Heaps
UNIT III MULTIMEDIA STRUCTURES 10 hrs.
Segment Trees k-d Trees Point Quad Trees MX-Quad Trees R-Trees TV-Trees.
UNIT IV PROBLEM SOLVING TECHNIQUES 10 hrs.
Branch & Bound -NP hard and NP complete problems- Huffman Coding - Activity Networks -Flow Shop Scheduling-Randomized Algorithms.
ALGORITHMS
Greedy algorithms , Back tracking , Dynamic programming, Divide and Conquer
UNIT V GRAPH ALGORITHMS 10 hrs.
Graphic Representation BFS DFS Topological Sort Connnected Components Minimum Spanning trees
Kruskals Algorithm Prims Algorithm dijkstras Algorithm floyds Algorithm Bellman Ford Algorithm
REFERENCE BOOKS:
1. Thomas H Coreman, Charles E.Leiserson, Ronald L.Rivest, Introduction to Algorithms, PHI, 2002.
2. Sara Baase, Allen ran Gelda, Computer Algorithms and Introduction to Design and Analysis, Pearson, 2000.
3. Sahni, Data Structures algorithm and application in C++, PHI, 2000
4. Mark Allen Weiss, Data Structures and Algorithms in C++ Addison wesley, 3rd Edition.
5. Aho A.V, Hopcroft J.E. and Ullman J.D, Design and analysis of Computer algorithms, Addison Wesley, 1974.6. Subramanian. V.S, Morgan Kaufman, Principles of Multimedia Database systems, 1998.
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART A : 6 questions of 5 marks each without choice 30 marks
PART B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
M.TECH (INFORMATION TECHNOLOGY) 1 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
8/41
8/12/2019 Sathyabama Univ ME CSC syllabus
9/41
SITX5002 ADVANCED DATABASE TECHNOLOGIESL T P Credits Total Marks
3 0 0 3 100
UNIT I INTRODUCTION 10 hrs.
Data base system Architecture single and multi user systems - Storage and File Structure - Query OptimizationTechniques - Transaction Management: Transaction Processing Concepts - Concurrency Control - Recovery Techniques-Database Security.
UNIT II PARALLEL DBMS 10 hrs.
Architecture- Query evaluation - Query optimization - parallelizing Individual operations. Distributed DBMS:Architecture - storing data - Cataloguing - Query processing -Transactions Concurrency and Recovery.
UNIT III DATA WAREHOUSING 10 hrs.
Architecture of a data warehouse; Differences between Online Transaction Processing (OLTP) and Online
Analytical Processing (OLAP); Multi-dimensional data modeling; Data cubes; OLAP operations; Algorithms for datacube computation- Implementation techniques for OLAP.
UNIT IV DATABASE CONCEPTS 10 hrs.
Active Database Concepts and Triggers -Temporal Databases - Spatial Databases - Deductive Databases - XMLDatabases: XML Data Model - Geographic Information Systems - Genome Data Management.
UNIT V 10 hrs.
MOBILE DATABASES: Mobile computing architecture-Mobile environment characteristics-Data managementissues.
MULTIMEDIA DATABASES: Nature of Multimedia data and applications Data management issues Multimediadatabase applications
OBJECT DATABASE SYSTEM: Abstract data types Objects identity and reference types-Inheritance Databasedesign for ORDBMS ODMG data model and ODL OQL.
TEXT BOOKS:
1. Raghu Ramakrishnan and Johannes Gehrke, Database Management Systems, 3rd Edition McGraw Hill Publications.
2. Korth . H.Fand A.Silberschatz, Database system concepts, 3 rd Edition, McGraw Hill Publications.
REFERENCE BOOKS:
1. Ramez Elmasri & B.Navathe: Fundamentals of Database Systems, V Ed., AddisonWesley, 2008.
2. Stenfno Ceri and Gieusppe pelagatti, Distributed database- principles and systems,Third Edition
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 3 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
10/41
SITX5003 FOUNDATIONS OF COMPUTER ENGINEERINGL T P Credits Total Marks
3 0 0 3 100
UNIT I COMPUTER ARCHITECTURE - AN INTRODUCTION 10 hrs.
Overview of Computer Architecture Instruction Formats Addressing Modes Arithmetic and Logical Unit Computer Arithmetic.
UNIT II MEMORY MANAGEMENT AND PARALLEL PROCESSING 10 hrs.
CPU Design Memory System Cache Memory Virtual Memory Types of processing Pipelining Basic
Concepts, Hazards, Implementation, Multi Cycle Operation - Parallel Processing
UNIT III COMPILER DESIGN - AN INTRODUCTION 10 hrs.
Phases of Compiler Lexical analyzer: Role of lexical analyzer-input Buffering Specification and Recognition of
tokens Language for specifying Lexical analyzer-Finite Automata- Regular expression to NFA-Optimization of DFA.Syntax Analyzer Context free grammar, Derivations and Parse trees , Parser top down parsing - Predictive Parser,
Bottom up- Shift Reduce Parser, Operator Precedence parser , LR Parsing - Intermediate Code Generation
UNIT IV CODE GENERATION AND CODE OPTIMIZATION 10 hrs.
Code generation design issues Register Allocation and Assignment Representation of basic blocks flow
Graph Code Optimization Basic Blocks Loops Flow Graphs.
UNIT V OPERATING SYSTEM 10 hrs.
Overview Functions of Operating System Types of Advanced Operating System Concept of Process -
Process Management Synchronization - Deadlocks Necessary and sufficient condition for Deadlock - Recovery from
Dead Lock - Memory Management CPU scheduling Files
REFERENCE BOOKS:
1. John P Hayes, Computer Architecture and Organization, 3rd Edition, Mc Graw Hill, 1998.
2. Morris Mano, Computer System Architecture, Prentice Hall, 1994.
3. Alfred V. Aho, Ravi Sethi, Jeffrey D.Ullman Compilers, Principles, Techniques and Tools Addison-wesley Publishing Company,
1986.
4. Beck. L, System Software, Addison Wesley, 1985
5. Silberschatz and Galvin, Operating System Concepts, Addison Wesley, 1995
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 markss
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 4 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
11/41
SITX5004 INFORMATION RETRIEVAL TECHNIQUESL T P Credits Total Marks
3 1 0 4 100
UNIT I INTRODUCTION 10 hrs.
Basic Concepts Retrieval Process Modeling Classic Information Retrieval Set Theoretic, Algebraic andProbabilistic Models Structured Text Retrieval Models Retrieval Evaluation Word Sense Disambiguation
UNIT II QUERYING 10 hrs
Languages Key Word based Querying Pattern Matching Structural Queries Query Operations User
Relevance Feedback Local and Global Analysis Text and Multimedia languages
UNIT III TEXT OPERATIONS AND USER INTERFACE 10 hrs.
Document Preprocessing Clustering Text Compression - Indexing and Searching Inverted files BooleanQueries Sequential searching Pattern matching User Interface and Visualization Human Computer Interaction
Access Process Starting Points Query Specification - Context User relevance Judgment Interface for Search
UNIT IV MULTIMEDIA INFORMATION RETRIEVAL 10 hrs.
Data Models Query Languages Spatial Access Models Generic Approach One Dimensional Time Series
Two Dimensional Color Images Feature Extraction
UNIT V APPLICATIONS 10 hrs.
Searching the Web Challenges Characterizing the Web Search Engines Browsing Meta-searchers
Online IR systems Online Public Access Catalogs Digital Libraries Architectural Issues Document Models,
Representations and Access Prototypes and Standards
REFERENCE BOOKS:
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
5. Charles T. Meadow, Bert R. Boyce, Donald H. Kraft, Text Information Retrieval Systems, Academic Press, 2000
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 5 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
12/41
SITX5006 ADVANCED INTERNET TECHNOLOGIESL T P Credits Total Marks
3 0 0 3 100
UNIT I INTRODUCTION 10 hrs.
Web architecture - Tiers - Concepts of tiers Web pages Static and Dynamic pages Comparison of Technologies
- Review aspects of XHTML, DHTML, CSS, JavaScript
UNIT II MIDDLEWARE AND COMPONENT BASED E-COMMERCE ARCHITECTURE
10 hrs.
CORBA - Java Remote Method Invocation- Component Object Model (COM) - Distributed Component Object
Model (DCOM)
UNIT III EXTENSIBLE MARKUP LANGUAGE 10 hrs.
XML Benefits-Well-Formed XML -Valid XML -Document Type Definition (DTD) - XML Parsers - XML
Namespaces - Schema
UNIT IV XML TRANSFORMATION LANGUAGES 10 hrs.
XML style sheets and transformation languages - CSS - XSL - XSLT XLINK XPATH Xquery Introduction
to AJAX
Unit V JAVA SERVER FACES 10 hrs.
Introduction to Java Server Faces- Building a Java Server Face application The Java Server faces Request
Processing Life Cycle-Managed Beans and JSF Expression Languages- JSF Event Model
REFERENCE BOOKS:
1. Achyut S Godbode & Atul Kahate, Web Technologies, Tata McGraw Hill, 1 st Edition
2. Michael Morrision, XML unleashed, Sams Publication, 1999
3. Schalk Burns, The Complete Reference Java Server Faces, Tata McGraw Hill, 1st
Edition
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 6 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
13/41
SITX5008 WEB SERVICESL T P Credits Total Marks
3 1 0 4 100
UNIT I INTRODUCTION TO SERVICES 10 hrs.
Evolution of SOA, SOA characteristics, Basic SOA architecture, Infrastructure services, Enterprise Service Bus(ESB), Stages of the SOA Lifecycle, Tools used in various stages, CaaS, IaaS, MaaS, PaaS, SaaS
UNIT II WEB SERVICE ARCHITECTURE 10 hrs.
Distributed application development The web architecture - Evolution of web services Business andtechnological motivations Limitations of CORBA and DCOM Web service architecture: Implementation (Web serviceprotocol stack), logical, deployment and process view Web service industry landscape.
UNIT III WEB SERVICES BUILDING BLOCKS 10 hrs.
Transport protocols for web services: XML-RPC: Header Data types Request and response message format,SOAP: Specification Message format SOAP header (Attributes) and Returning Errors Data types Remotemethod call. Describing web services - Requirements for describing web services WSDL goals Anatomy of WSDL
- Web service policy. Discovering web services The process of discovery in Context Anatomy of UDDI
UNIT IV .NET 10 hrs.
Creating web services using ASP.NET Building servers - Creating clients XML Serialization Case Study:
Developing and deploying a simple web service
UNIT V WEB SERVICE SECURITY 10 hrs.
Security Overview: e-commerce based security (public key cryptography) Private Key encryption Public keyencryption Security issues in XML document SOAP security issue XML Security framework: XML Digital Signature
(Enveloped, enveloping and detached) Signature validation - XML Encryption Types Canonicalization - XML Keymanagement
REFERENCE BOOKS:
1. Thomas Erl, Service-Oriented Architecture: Concepts, Technology and Design, Prentice Hall Publication, 2005
2. John W. Rittinghouse, James F.Ransome, Cloud Computing Implementation, Management and Security, CRC Press, 2009
3. Keith Ballinger, ASP.NET and web services, Microsoft .NET development series, Addison-Wesley publications, 2003
4. Frank. P. Coyle, XML, Web Services And The Data Revolution, Pearson Education, 2002.
5. Ramesh Nagappan, Robert Skoczylas and Rima Patel Sriganesh, Developing Java Web Services, Wiley Publishing Inc., 2004.
6. Sandeep Chatterjee, James Webber, Developing Enterprise Web Services, Pearson Education, 2004.
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 7 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
14/41
SCSX5026 MOBILE AND PERVASIVE COMPUTINGL T P Credits Total Marks
3 0 0 3 100
UNIT I INTRODUCTION 10 hrs.
Wireless networks- emerging technologies- Blue tooth, WiFi, WiMAX, 3G ,WATM.-Mobile IP protocols -WAP pusharchitecture-Wml scripts and applications.
UNIT II MOBILE COMPUTING ENVIRONMENT 10 hrs.
Functions-architecture-design considerations, content architecture -CC/PP exchange protocol, context manager.
Data management in WAE-Coda file system- caching schemes- Mobility QOS. Security in mobile computing.
UNIT III WIRELESS MOBILE NETWORKS 10 hrs.
Handoff in wireless mobile networks-reference model-handoff schemes. Location management in cellular networks
- Mobility models- location and tracking management schemes- time, movement, profile and distance based updatestrategies.
UNIT IV PERVASIVE COMPUTING 10 hrs.
Pervasive Computing- Principles, Characteristics- interaction transparency, context aware, automated experience
capture. Architecture for pervasive computing- Pervasive devices-embedded controls. - Smart sensors and actuators
-Context communication and access services
UNIT V OPEN PROTOCOLS 10 hrs.
Service discovery technologies- SDP, Jini, SLP, UpnP protocolsdata synchronization- SyncML framework -Context aware mobile services -Context aware sensor networks, addressing and communications. Context aware
security.
REFERENCE BOOKS:
1. Ivan Stojmenovic, Handbook of Wireless Networks and Mobile Computing, John Wiley & sons Inc, Canada, 2002.
2. Asoke K Taukder, Roopa R Yavagal, Mobile Computing, Tata McGraw Hill Pub Co. , New Delhi, 2005.
3. Seng Loke, Context-Aware Computing Pervasive Systems, Auerbach Pub., New York, 2007.
4. Uwe Hansmann etl, Pervasive Computing, Springer, 2001
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 8 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
15/41
SITX5007NETWORK INFRASTRUCTURE AND CYBER
COMPUTING
L T P Credits Total Marks
3 0 0 3 100
UNIT I INTRODUCTION AND ROUTER ARCHITECTURE 10 hrs.
Introduction: Networks, architecture, applications, ISO model. Routers: Function of Router Types Elements
Packet flow Packet Processing Algorithms and Data Structures (packet buffer allocation) Packet processing functions(Bridge Algorithm, Table Lookup and Hashing) Protocol Software (threads, Interrupts) Hardware Architectures For ProtocolProcessing Classification and Forwarding Switching Fabrics.
UNIT II NETWORK PROCESSORS 10 hrs.
Scalability with Parallelism and Pipelining Complexity of Network Processor Design (Packet processing, ingress
& egress processing, Macroscopic Data Pipelining and Heterogeneity) Network Processor Architectures: architecturalvariety, Primary Architectural characteristics, Packet Flow, Clock Rates, software architecture, Assigning Functionality to
the Processor Hierarchy. Examples of Commercial Network Processors: Multi-Chip Pipeline, Augmented RISC Processor,Embedded Processor Plus Coprocessors.
UNIT III CYBER COMPUTING 10 hrs.
Computer Forensics Fundamentals Types of Computer Forensics Technology Types of Vendor and ComputerForensics Services - Fighting against Macro Threats Information Warfare Arsenal Tactics of the Military Tacticsof Terrorist and Rogues Tactics of Private Companies
UNIT IV RECOVERY AND EVIDENCES 10 hrs.
Data Recovery Evidence Collection and Data Seizure Duplication and Preservation of Digital Evidence ComputerImage Verification and Authentication Discover of Electronic Evidence Identification of Data Reconstructing Past Events.
UNIT V ETHICAL HACKING 10 hrs.Hacking windows Network hacking Web hacking Password hacking. A study on various attacks: Input
validation attacks SQL injection attacks Buffer overflow attacks - Privacy attacks Fundamentals of Computer
Fraud Threat concepts Framework for predicting inside attacks Managing the threat Architecture strategiesfor computer fraud prevention Protection of Web sites Intrusion detection system.
TEXT BOOKS:
1. Douglas E. Comer Network System Design using Network Processors Prentice Hall, 2006.
2. Deepankar Medhi, Karthikeyan Ramasamy, Network Routing: Algorithms, Protocols, and Architecture, Elsevier, 2007.
3. John R. Vacca, Computer Forensics, Firewall Media, 2004.
4. Kenneth C.Brancik Insider Computer Fraud Auerbach Publications Taylor & Francis Group2008.
5. Ankit Fadia Ethical Hacking second edition Macmillan India Ltd, 2006.
REFERENCE BOOKS:
1. Chad Steel, Windows Forensics, Wiley India, 2006.
2. Majid Yar, Cybercrime and Society, Sage Publications, 2006.
3. Robert M Slade, Software Forensics, Tata McGraw Hill, 2004.
UNIVERSITY EXAM QUESTION PAPER PATTERNMax. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 9 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
16/41
SCSX5018 GRID COMPUTINGL T P Credits Total Marks
3 0 0 3 100
UNIT I INTRODUCTION 10 hrs.
High Performance Computing- Cluster Computing-Grid Computing- Grid Computing Models- Types of Grids
An overview of Grid Business Areas- Grid Applications Grid Protocols
UNIT II GRID COMPUTING SYSTEMS AND ARCHITECTURES 10 hrs.
Grid architecture Grid architecture and relationship to other Distributed Technologies Concept of virtual
organizations- Grid Computing road map
UNIT III THE NEW GENERATION OF GRID COMPUTING APPLICATIONS 10 hrs.
Merging the Grid services Architecture with the Web Services Architecture
UNIT IV OPEN GRID SERVICES ARCHITECTURE AND INFRASTRUCTURE 10 hrs.
OGSA Sample use cases OGSA platform components - OGSA Basic Services.
Technical details of OSGI- OGSI/OGSA service elements and layered model
UNIT V GRID COMPUTING TOOL KITS 10 hrs.
Globus Toolkit Architecture, Programming model, High level services OGSI .Net middleware Solutions
REFERENCE BOOKS:
1. Joshy Joseph & Craig Fellenstein, Grid Computing, PHI, PTR-2003.
2. Ahmar Abbas, Grid Computing: A Practical Guide to technology and Applications, Charles River media 2003.
3. Ian Foster, Carl Kesselman, The Grid2: Blueprint for a New Computing Infrastructure. Morgan Kaufman, New Delhi, 2004
4. Fran Bermn, Geoffrey Fox, Anthony Hey J.G., Grid Computing: Making the Global Infrastructure a Reality, Wiley, USA, 2003
5. Maozhen Li, Mark Baker, The Grid: Core Technologies, John Wiley & Sons, 2005.
WEBSITE:
1. www.globus.org
2. glite.web.cern.ch (Unit 5)
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 10 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
17/41
SITX5009 SEARCH ENGINES & OPTIMIZATIONL T P Credits Total Marks
3 1 0 4 100
UNIT I INTRODUCTION TO WEB SEARCH ENGINES 10 hrs.
Roadmap- Architecture Overview of crawlers
Design Working Principles Engineering the large scale crawlers: DNS caching, Prefetching Link extraction
and normalization Robot exclusion Avoiding repetitions etc.
UNIT II INDEXING 10 hrs.
The indexing process Methodologies Various Indexing Algorithms - Index compression techniques - steaming
- Retrieval : Relevance ranking - Retrieval techniques -Various retrieval algorithms Similarity search.
UNIT III LINK ANALYSIS 10 hrs.
Need & Importance Techniques Clustering: Clustering of web search results : Formation and approaches
collaborative filtering techniques Dynamic clustering Query Optimization techniques.
UNIT IV SOCIAL NETWORK ANALYSIS 10 hrs.
Page Rank - HIOTS Resource discovery on web, multimedia Retrieval in search engines Semantic Web
engines Focused crawling Vertical search engines, Making your Page visible to search engines Search marketing
techniques.
UNIT V APPLICATIONS 10 hrs.
Recent Trends in search engine domain - case studies - implementation of search engine using appropriate
technologies.
REFERENCE BOOKS:
1. Soumen Chakrabarti, Mining the Web: Discovering Knowledge from Hypertext Data (Hardcover), 2002
2. Michael W.berry, Murray Browne, Understanding search engines: Mathematical modeling and text retrieval, 2005.
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 11 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
18/41
SITX6501 NETWORK DESIGN AND PROGRAMMING LABL T P Credits Total Marks
0 0 4 2 100
1. Creation of Date Server, and also print the clients address on the Server.
2. Creation of UDP Server
3. Creation of Simple Chat Program
4. Sending and Receiving OOB Signals 5. Calculation of Checksum for packet data and file
6. Creation of Simple Mail Client
7. Creation of simple Web Reaper
8. Creation of Simple Web Server
9. Creation of Simple Object Based Server
10. Creation of Distributed Application using RMI
11. Creation of Simple Cookie Protocol
12. Creation of Simple Telnet Protocol
SITX6502 INTERNET PROGRAMMING LABL T P Credits Total Marks
0 0 4 2 100
1. Client and Server side image mapping
2. Designing of scientific calculator using scripting languages
3. Creating dynamic page with database and server side scripting
(i) Quiz Application (ii) Banking system
4. Using ActiveX components in Server side Scripting
5. Creating XML web pages
6. Formatting XML document using cascaded Style sheets
7. Formatting XML document using Extended style language.
8. Extracting contents of the XML document using DOM parser
9. Connecting XML web pages to any database engine
10. Server Side Application Using JSP.
11. Write a ASP program using the components.
12. Write a Servlet, bean program to access information from databases
13. Creating webpage includes usage of AJAX.
14. Web page creation using DHTML
SITX6503 NETWORK SECURITY AND WEB SERVICES LABL T P Credits Total Marks
0 0 4 2 100
NETWORK SECURITY
1. Study of Data Encryption & Decryption (Cryptography) and Network Security
2. Implementing Stream Cipher technique.
3. Implementing Block Cipher Algorithms.
4. Key Generation using Diffie Hellman Exchange.
5. Implementation of RSA algorithm
6. Implementation of Simple DES algorithm
WEB SERVICES LAB
1. Creating a web service a. Using Java b. Using .NET platform
2. Consuming a web service through an application
3. Connecting a web service with database
4. Web services Interaction
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 12 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
19/41
8/12/2019 Sathyabama Univ ME CSC syllabus
20/41
SITX5010 C# and .NETL T P Credits Total Marks
3 0 0 3 100
UNIT I OVERVIEW OF .NET 10 hrs.
Advantages of .NET over the other languages, overview of .NET binaries, Intermediate Language, metadata, .NETNamespaces, Common Language runtime, common type system, common Language Specification.
C# fundamentals C# class, object, string formatting, Types, scope, constants, C# iteration, control flow,
operators, array, string, Enumerations, structures, custom Namespaces.
UNIT II OBJECT ORIENTED PROGRAMMING WITH C# 10 hrs.
Class, encapsulation, inheritance, polymorphic, casting, Exception Handling, Garbage Collector.
Interfaces and Collections - Enumerator, Cloneable objects, Comparable objects, Collections, Indexes, overloadingoperators, delegates, Events, XML Documentation
UNIT III BUILDING WINDOW 10 hrs.
Namespaces, Windows Forms Types, Application Class, Form, Component Class, Control class, Control Events,
Scrollable Control, Container Control, Menu, Status Bars, Tool Bar, Windows Forms Application, System Registry,Event Viewer.
Programming with Windows form controls - Windows form control Hierarchy, Adding controls, TextBox,CheckBoxes, RadioButtons, GroupBoxes, ListBoxes, ComboBoxes, TrackBar, Calender, Spin Control, Panel, ToolTips,ErrorProvider, Dialog Boxes.
UNIT IV INPUT - OUTPUT AND ADO .NET 10 hrs.
Introduction to System. IO .namespace, File and folder operations and stream class
Building Data Table, Data View, Data Set, Data Relations, ADO.NET managed Providers, OLEDB managed
Provider, SQL.
UNIT V WEB DEVELOPMENT AND ASP.NET 10 hrs.Web applications and web servers, HTML form Development, Client side Scripting, GET and POST, ASP.NET
application, ASP.NET namespaces, creating sample C# web Applications, architecture, Debugging and Tracing of
ASP.NET, Introduction to web Form controls. Building Web Services- web service namespaces, building simple webService, WSDL, web service wire protocols, WSDL into C#.
REFERENCE BOOKS:
1. Andrew Trolesen C# and the .NET Platform, Dreamtech Press, Second Edition
2. Bradley L Jones, Sams Teach Yourself the C# Language in 21 Days, Sams, 1st edition, 2001
3. Andy Harris, Microsoft C# Programming for the Absolute Beginner, PTR publications, 2002.
WEBSITES:
1. http://C-sharpcorner.com/tutorials .asp
2. http://www.programmingtutorials.com/csharp.aspx
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 14 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
21/41
SITX5011 J2EEL T P Credits Total Marks
3 0 0 3 100
UNIT I J2EE PLATFORM AND DATA BASE PROGRAMMING WITH JDBC 10 hrs.
Programming for the Enterprise The Enterprise today Enterprise Architecture Styles J2EE Run Times J2EE API J2EE Architecture Containers Introduction to J2EE Technologies Naming and Directory Services.
JDBC/ODBC Bridge Establishing a connection Creating and Executing SQL statements Querying Reportstatements Scrollable and Updatable Result Sets - javax.sql packages JDBC Data Sources Connection Pooling
UNIT II INTRODUCTION TO WEB CONTAINERS AND SERVLET PROGRAMMING 10 hrs.
HTTP Protocols Web Containers and Web Applications A simple Web Application
Introduction to Servlet Programming - Servlet Implementations Servlet Configuration - Servlet Exceptions
Servlet Life Cycle Servlet Request Interfaces Servlet Response Interface Servlet Programming Servlet Security Servlet Communication Servlet to Servlet Communication Servlet to Applet Communication
UNIT III ADVANCED SERVLETS 10 hrs.
Approach to Session Tracking HTTP Session Interface Demonstrating Session - Lifecycle with cookies Asimple Shopping cart using Sessions Servlet Context Interface Servlet Context Lifecycle Event Handling ServletCollaboration Servlet Chaining Request Dispatching
UNIT IV JAVA SERVER PAGES AND JAVA MAIL API 10 hrs.
Introduction to JSP JSP Directives Scripting elements Standard Auctions - Implicit objects Scope JSPpages as XML documents JSP Sample Program Design Strategies -JSP tag Extensions A simple TAG WritingTAG Extensions
Introduction to JavaMail Mail Protocols JavaMail Overview Installation and Configuration Quick, Sendme a Email ( An example program)
UNIT V ENTERPRISE JAVA BEANS 10 hrs.Overview of EJB EJB Middleware Architecture EJB Architecture EJB Containers and its services Design
of EJB Tier Session Java Beans - Stateless and Stateful Beans, Entity Beans and Persistence - Container Vs Bean
Managed Persistence, Message Driven Bean - Relationships, EJB Container Services.
Introduction to Web Service Technologies - Java Message Service J2EE and Web Services SOAP WSDL UDDI JAXP JAXB
REFERENCE BOOKS:
1. Subrahmanyam Allamaraju and Cedric Buest ,Professional Java Server Programming, J2EE 1.3 Edition, APress,
2. Jim Keogh, Complete Reference, J2EE, Tata McGraw Hill, 2004
WEBSITE:
1. http://www.java.sun.com/tutorial
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 15 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
22/41
8/12/2019 Sathyabama Univ ME CSC syllabus
23/41
SITX5013 ECOMMERCE TECHNOLOGIESL T P Credits Total Marks
3 0 0 3 100
UNIT I INTRODUCTION 10 hrs.
Infrastructure for Electronic commerce Networks value added network, Electronic commerce over Internet.Packet switched network/ TCP/IP Internet protocol. ISO model- X.400 message handling system, email security, Internet
e-mail, Light weight directory access protocol, web client and servers. Internet, Intranet & Extranets, VPN.
UNIT II EDI & CORE TECHNOLOGY 10 hrs.
EDI introduction, Components of EDI, Implementation issues. E-Commerce Model, Internet marking, Shopping
cart Technology. EDI FACT standard- Message Interchange structure Message directories, EDI over Internet,
Commerce over extranets. Identification and tracking tools for E-Commerce.
UNIT III SECURITY ISSUES 10 hrs.
Threads to network security, guidelines for cryptography policy. Security issues security concerns security
solutions Electronic cash over Internet - security- firewalls.
UNIT IV ELECTRONIC PAYMENT SYSTEM AND REENGINEERING 10 hrs.
Digital Token based electronic payment system, smart card & Electronic payment systems. Credit card based
Electronic payment system. Business process reengineering, approach for BRR strategic alignment model BRR
methodology. Change management in public administrations.
UNIT V CASE STUDIES 10 hrs.
EDI Indian customs, US Electronic procurement, Banks, Automotive Industry, SNS, E-Commerce in India,
UNCITRAL model law on Electronic commerce, Model Interchange- Agreement for International Commercial use of
EDI.
REFERENCE BOOKS:
1. Kamlesh K.Bajaj, E-commerce, Tata Mc Graw Hill, 2000.
2. Ravi KalaKota and Andrew B Whinsten, Frontiers of Electronic Commerce, Addision Wesley, 1996.
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 17 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
24/41
SITX5014 COMPONENT BASED TECHNOLOGIESL T P Credits Total Marks
3 0 0 3 100
UNIT I COMPONENT CONCEPTS 10 hrs.
Basic Components: Software Components COM/DCOM Java Beans Enterprise java Beans CORBA Distributed object request and response remote reference IDL interface Proxy marshalling.
UNIT II BASIC CONCEPTS 10 hrs.
Basic Patterns and Inherent issues: Factory Broker Garbage Collection on client and server Persistence
of remote references Transactions Concurrency in server objects Applying client/server relation recursively
Event driven programming
UNIT III CORBA OVERVIEW 10 hrs.Benefits of java programming with CORBA, CORBA overview - OMG, OMA, object model, ORB structure, OMG,
IDL, ORB and object interface, POA , Language mapping, mapping ORB run time system Discovering services
(Naming, Trading) Advanced features (DSI, DII Interoperability, DII and DSI, IR. Overview of java ORBs First
Java ORB application OMG IDL to Java, Interface repository) CORBA Events Practical applications
UNIT IV DISTRIBUTED OBJECT DATABASE MANAGEMENT - OBJECT MODEL FEATURES 10 hrs.
Fundamental object management issues DOM architectures Object caching Object clustering Object
migration Query processing in distributed object DBMS Transaction management in distributed object DBMS
UNIT V COM OVERVIEW 10 hrs.
COM Distributed COM COM Facilities and Services Applying COM Objects COM Interface - Query
Interface, Reference Counting - Dynamic linking class factory Component issue
REFERENCE BOOKS:
1. An Architectural view of Distributed Objects and Components in CORBA, Java RMI and COM/DCOM (A paper submitted by Plasil,
Michael Stal)
2. Andreas Vogel and Keith Duddy, Java Programming with CORBA John Wiley & Sons. 1998,
3. Dale Rogerson, Inside COM, Microsoft Press, P. Education 2000.
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 18 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
25/41
SBIX5001 INTRODUCTION TO BIOINFORMATICSL T P Credits Total Marks
3 0 0 3 100
UNIT I HISTORY OF BIOINFORMATICS 10 hrs.
History of Bioinformatics-role of Bioinformatics in biological sciences- scope of bioinformatics -introduction to
internet-WWW, network basics, LAN & WAN standards-network topologies and protocols- ftp, http - division ofBioinformatics- Bioinformatics and internet-challenges in Bioinformatics.
UNIT II DATABASES IN BIOINFORMATICS 10 hrs.
Databases in Bioinformatics- Genbank, NCBI, EMBL, DDBJ, UniGene, SGD, EMI Genomes, -protein
databases-PIR, SWISSPROT, TrEMBL, Prosite, PRINTS -structural databases-PDB, SCOP, CATH, PDB_SELECT,
PDBSUM, DSSP, FSSP, DALI, PRODOM, protein families & pattern databases, Pfam, KEGG sequence storage-
sequence accuracy-EST,STS- sequence retrieval systems- Entrez-SRS- sequence query refinement using Boolean
operators, limits, preview, history and index.
UNIT III SEQUENCE SUBMISSION 10 hrs.
Sequence submission tools-bankit-sequin-webin-sakura-literature databases-PubMed and medline. Data mining andits techniques- data warehousing- Sequence annotation: principles of genome annotation- annotation tools & resources
UNIT IV APPLICATIONS OF BIOINFORMATICS 10 hrs.
Applications of Bioinformatics-phylogenetic analysis-steps in phylogenetic analysis-microarrays-DNA and protein
microarrays- Bioinformatics in pharmaceutical industry: informatics & drug- discovery; pharmainformatics resources- drug
discovery and designing-SNP.
UNIT V FILE FORMATS 10 hrs.
File formats-raw/plain format-NCBI, Genbank flat file format-ASN.1, GCG, FASTA, EMBL, NBRF, PIR, swissprot
sequence format, PDB format, etc. introduction to structure prediction methods.
REFERENCE BOOKS:
1. Attwood. T.K. and Parry-Smith, Introduction to Bioinformatics, Prentice Hall, 1999.
2. Genetic databases-how to view them, Bishop.
3. David W. Mount. Cold Spring, Bioinformatics: Sequences and genome analyses, Harbor Laboratory press, 2000.
4. Arun Jagota, Data analysis and classification for Bioinformatics, Bay Press, 2000.
5. Des Higgins and Willie Taylor, Bioinformatics sequence, structures and databanks, Oxford University Press, 2000.
WEBSITES:
1. www.bioinformatics.org/
2. www.biomedcentral.com/bmcbioinformatics/
3. www.ebi.ac.uk/
4. http://www.ncbi.nlm.nih.gov/
5. www.ucmp.berkeley.edu/exhibit/introphylo.html
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 19 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
26/41
SITX5015 TCP/IP AND SOCKET PROGRAMMINGL T P Credits Total Marks
3 0 0 4 100
Unit I INTERNETWORKING CONCEPT AND ARCHITECTURAL MODEL 10 hrs.
Classful Internet Addresses - Mapping Internet Addresses to Physical Addresses (ARP) - Determining and Internet
Address at startup(RARP) - Internet Protocol: connectionless Datagram Delivery Internet Protocol: Routing IP
Datagram.
Unit II INTERNET PROTOCOL 10 hrs.
Error and Control Messages (ICMP) - Classless and Subnet Address Extensions (CIDR) Protocol Layering
UDP Reliable Stream Transport Service(TCP)
Unit III ROUTING 10 hrs.
Cores, Peers and Algorithms Internet Multicasting TCP/IP over ATM networks - Mobile IP Private Network
Interconnection (NAT, VPN)
Unit IV CLIENT-SERVER MODEL OF INTERACTION 10 hrs.
Socket Interface: Creating socket, sending and receiving data, obtaining local and Remote socket Addresses,
host names, internal host domain set socket options- socket Library calls Obtaining Information about Hosts,
networks, Protocols, network services.
Unit V APPLICATIONS OF SOCKET PROGRAMMING 10 hrs.
FTP, SMTP, POP, HTTP, SNMP, RTP - Internet Security and Firewall Design (IPsec) - Future of TCP/IP (IPv6).
10 hrs.
REFERENCE BOOKS:
1. Douglas E. Comer, Internetworking with TCP/IP, Principles, Protocols and Architectures, 4th Edition, Prentice Hall India
2. Richard Stevens.W, UNIX network programming, Vol. 1, PHI, 1998.
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 20 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
27/41
SITX5016 SATELLITE COMMUNICATIONL T P Credits Total Marks
3 0 0 3 100
UNIT I COMMUNICATION SATELLITE: ORBIT AND DESCRIPTIONS 10 hrs.
Orbital Period and velocity, effects of orbital inclination, coverage angle and slant range, Placement of satellitein a geo-stationary orbit. Satellite description - Communication subsystem, telemetry, command and ranging subsystem,
attitude control and electrical power.
UNIT II EARTH STATION 10 hrs.
Earth Station Antenna types, gain and radiated power, Pointing loss, noise temperature, G/T ratio, High power
amplifiers, redundancy configurations, carrier and power combining. Low noise amplifiers - redundancy configuration
and non-linearity Up converter and down converter - conversion process, Hopping and redundancy configurations.
UNIT III SATELLITE LINK ANALYSIS AND DESIGN 10 hrs.Basic link analysis - Interference analysis, carrier to noise plus interference ratio, Terrestrial interface, cross
polarization interference, adjustment channel and inter symbol interference. Rain induced attenuation, path diversity,
up link power control, rain induced cross polarization interference. Satellite link design - link without frequency reuse,
link design with frequency reuse.
UNIT IV MULITPLE ACCESS TECHNIQUES 10 hrs.
Frequency Division Multiple Access (FDMA), Time Division Multiple Access (TDMA) and Code Division Multiple
Access (CDMA). Demand assignment multiple access (DADMA) - SC PC & SPADE. Performance comparison of
various multiple access schemes.
UNIT V APPLICATION AND SERVICES 10 hrs.
Satellite packet communications - ALOHA, slotted ALOHA and packet reservation. very small aperture terminal
(VSAT) networks - technologies and configurations. Mobile satellite (MSAT) networks - operating environment, low
orbital satellites. Iridium.
REFERENCE BOOKS:
1. RODY.D, Satellite Communication, PHI, 1989
2. Bhargava et al, Digital Communication by Satellite. PHI, 19923. T.Ha, Satellite Communication, McGraw Hill, 1996
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 21 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
28/41
SCSX5014 NETWORK MANAGEMENT SYSTEML T P Credits Total Marks
3 0 0 3 100
UNIT I DATA COMMUNICATIONS AND NETWORK MANAGEMENT OVERVIEW 10 hrs.
Analogy of Telephone Network Management- Distributed Computing Environments- Communications Protocols &Standards- Case Histories of Networking and Management- Challenges of Information Technology Managers- Network
Management Goals, Organization, and Functions - Network & System Management- Network Management System
Platform- Current status and Future of Network Management.
UNIT II SNMP, BROADBAND, AND TMN MANAGEMENT: STANDARDS 10 hrs.
Models and Language- SNMPv1 Network Management: Organization, Information, Communication and Functional
Model- SNMPv2: System Architecture Structure of Management Information- SNMPv2 Protocol- SNMPv3-
Documentation Architecture- Applications.
UNIT III SNMP MANAGEMENT 10 hrs.
RMON- Remote Monitoring RMON SMI & MIB-RMON1- RMON2- ATM Remote Monitoring- A Case Study
of Internet Traffic Using RMON
UNIT IV BROADBAND NETWORK MANAGEMENT 10 hrs.
Broadband Access Networks and Technologies- HFC technology- HFC Management- DSL Technology
Asymmetric Digital Subscriber Line technology- Telecommunication Management Network : Why TMN- TMN conceptual
Model TMN standards TMN Architecture- TMN Management Service Architecture- Implementation Issues.
UNIT V NETWORK MANAGEMENT TOOLS AND SYSTEMS 10 hrs.
Network Management Tools- Network Statistics Measurement Systems History of Enterprise Management
Network Management systems Commercial Network Management Systems- System Management- Network
Management Applications : Fault Management- Performance Management Security Management.
REFERENCE BOOKS:
1. Network Management Principles and Practice by Mani Subramanian- Pearson Education, Fourth Indian Reprint,2003.
2. Salah Aiidarous, Thomas Plevayk, "Telecommunications Network Management Technologies and Implementations ", eastern Economy
Edition IEEE press, New Delhi, 1998.
3. Lakshmi G. Raman, " Fundamentals of Telecommunication Network Management ", Eastern Economy Edition IEEE Press, NewDelhi, 1999.
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 22 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
29/41
SITX5017 INFORMATION CODING TECHNIQUESL T P Credits Total Marks
3 0 0 3 100
UNIT I INFORMATION ENTROPY FUNDAMENTAL 10 hrs.
Relation between information and probability, mutual and self information, information entropy, shannons theorem,code design, Shannon Fano Cording, Huffman Coding, Implementation of Huffman code
UNIT II DATA AND VOICE CODING 10 hrs.
Context dependent coding, arithmetic codes, overall efficiency consideration, voice coding, delta modulation and
adaptive delta modulation, linear redictive coding, silence coding, sub-band coding
UNIT III IMAGE AND VIDEO COMPRESSION 10 hrs.
Direct cosine Transform, quantization loss, loss estimation, JPEG components and standards, Inter frame coding,Motion Compensation Technique, MPEG-2 standards, introduction to MPEG-4
UNIT IV ERROR CONTROL CODING 10 hrs.
Backward error correction, linear block codes, BCH codes, GOLAY codes, Efficiency of LBC, Performance of
simple ARQ, Go back n and selective repeat schemes. Forward correction codes convolution coding, decoding
algorithm, viteribi decoding, Optimum decoding, Performance measures
UNIT V ENCRYPTION CODING 10 hrs.Transposition and substitution coding, data encryption standards (DES), Key distribution problem, public key
encryption, and public key decryption and MIT algorithm, Direct sequence CDMA based encryption, Orthogonal
sequences, R-S codes
REFERENCE BOOKS:
1. Viterbi, Information Theory and coding, McGraw Hill, 1982
2. Proakis, Digital Communication, McGraw Hill, 1994
3. Data Compression Book, BPB publication, 1992
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 23 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
30/41
SITX5018 AD HOC NETWORKSL T P Credits Total Marks
3 0 0 3 100
UNIT I INTRODUCTION 10 hrs.
Introduction-Fundamentals of Wireless Communication Technology - The Electromagnetic Spectrum - RadioPropagation Mechanisms - Characteristics of the Wireless Channel - IEEE 802.11a,b Standard Origin Of Ad hoc:
Packet Radio Networks - Technical Challenges - Architecture of PRNETs - Components of Packet Radios Ad hocWireless Networks -an Ad Hoc Network? Heterogeneity in Mobile Devices - Wireless Sensor Networks - Traffic Profiles
- Types of Ad hoc Mobile Communications - Types ofun Mobile Host Movements - Challenges Facing Ad Hoc MobileNetworks-Ad hoc wireless Internet
UNIT II AD HOC ROUTING PROTOCOLS 10 hrs.
Introduction - Issues in Designing a Routing Protocol for Ad Hoc Wireless Networks - Classifications of RoutingProtocols -Table-Driven Routing Protocols - Destination Sequenced Distance Vector (DSDV) - Wireless Routing Protocol(WRP) - Cluster Switch Gateway Routing (CSGR) - Source-Initiated On-Demand Approaches - Ad Hoc On-Demand Distance
Vector Routing (AODV) - Dynamic Source Routing (DSR) -Temporally Ordered Routing Algorithm (TORA) - Signal StabilityRouting (SSR) -Location-Aided Routing (LAR) - Power-Aware Routing (PAR) - Zone Routing Protocol (ZRP)
UNIT III MULTICASTROUTING IN AD HOC NETWORKS 10 hrs.
Introduction - Issues in Designing a Multicast Routing Protocol - Operation of Multicast Routing Protocols - AnArchitecture Reference Model for Multicast Routing Protocols -Classifications of Multicast Routing Protocols - Tree-BasedMulticast Routing Protocols- Mesh-Based Multicast Routing Protocols - Summary of Tree-and Mesh-Based Protocols- Energy-Efficient Multicasting - Multicasting with Quality of Service Guarantees - Application-Dependent Multicast
Routing - Comparisons of Multicast Routing Protocols
UNIT IV TRANSPORT LAYER, SECURITY PROTOCOLS 10 hrs.
Introduction - Issues in Designing a Transport Layer Protocol for Ad Hoc Wireless Networks - Design Goals of
a Transport Layer Protocol for Ad Hoc Wireless Networks -Classification of Transport Layer Solutions - TCP Over AdHoc Wireless Networks -Other Transport Layer Protocols for Ad Hoc Wireless Networks - Security in Ad Hoc WirelessNetworks - Network Security Requirements - Issues and Challenges in Security Provisioning - Network Security Attacks
- Key Management - Secure Routing in Ad Hoc Wireless Networks
UNIT V QoS AND ENERGY MANAGEMENT 10 hrs.
Introduction - Issues and Challenges in Providing QoS in Ad Hoc Wireless Networks -Classifications of QoSSolutions - MAC Layer Solutions - Network Layer Solutions - QoS Frameworks for Ad Hoc Wireless Networks Energy
Management in Ad Hoc Wireless Networks Introduction - Need for Energy Management in Ad Hoc Wireless Networks- Classification of Energy Management Schemes - Battery Management Schemes - Transmission Power ManagementSchemes - System Power Management Schemes
REFERENCE BOOKS:
1. Siva Ram Murthy.C and Manoj . B.SAd Hoc Wireless Networks: Architectures and Protocols, Prentice Hall PTR,2004
2. C.K. Toh, Ad Hoc Mobile Wireless Networks: Protocols and Systems, Prentice Hall PTR ,2001
3. Charles E. Perkins, Ad Hoc Networking, Addison Wesley, 2000
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 24 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
31/41
SCSX5015 AGENT BASED INTELLIGENT SYSTEMSL T P Credits Total Marks
3 0 0 3 100
UNIT I INTRODUCTION 10 hrs.
Definitions - Foundations - History - Intelligent Agents-Problem Solving-Searching - Heuristics -ConstraintSatisfaction Problems - Game playing.
UNIT II KNOWLEDGE REPRESENTATION AND REASONING 10 hrs.
Logical Agents-First order logic-First Order Inference-Unification-Chaining- Resolution Strategies-Knowledge
Representation-Objects-Actions-Events
UNIT III PLANNING AGENTS 10 hrs.
Planning Problem-State Space Search-Partial Order Planning-Graphs-Nondeterministic Domains-Conditional
Planning-Continuous Planning-MultiAgent Planning.
UNIT IV AGENTS AND UNCERTAINITY 10 hrs.
Acting under uncertainty Probability Notation-Bayes Rule and use - Bayesian Networks-Other Approaches-Time
and Uncertainty-Temporal Models- Utility Theory - Decision Network Complex Decisions.
UNIT V HIGHER LEVEL AGENTS 10 hrs.
Knowledge in Learning-Relevance Information-Statistical Learning Methods-Reinforcement Learning -
Communication-Formal Grammar-Augmented Grammars- Future of AI.
REFERENCE BOOKS:
1. Stuart Russell and Peter Norvig, Artificial Intelligence - A Modern Approach, 2nd 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.
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 25 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
32/41
SITX5005 SOFT COMPUTINGL T P Credits Total Marks
3 0 0 3 100
UNIT I ARTIFICIAL NEURAL NETWORKS 10 hrs.
Basic Concepts-Single layer Perceptron - Multilayer Perceptron - Supervised and Unsupervised learning - Back
propagation networks - Counter propagation networks - Hopfield network.
UNIT II FUZZY SYSTEMS 10 hrs.
Fuzzy sets and Fuzzy reasoning - Fuzzy matrices - Fuzzy functions - Decomposition - Fuzzy automata and
languages - Fuzzy control methods - Fuzzy decision making
UNIT III NEURO-FUZZY MODELING 10 hrs.
Adaptive Networks based Fuzzy Inference Systems - Classification and Regression Trees - Data Clustering
algorithms - Rule based structure identification - Neuro-fuzzy controls - Simulated annealing - Evolutionary Computation.
10 hrs.
UNIT IV GENETIC ALGORITHMS 10 hrs.
Survival of the fittest - Fitness Computations -Cross over - Mutation- Reproduction -Rank method - Rank space
method.
UNIT V CONVENTIONAL AI 10 hrs.
AI search algorithm - Predicate calculus - Rules of Inference - Semantic networks - Frames - objects - Hybrid
Models - Applications.
REFERENCE BOOKS:
1. Jang J.S.R, sun C.T and Mizutani E, Neuro-Fuzzy and soft computing, Prentice Hall 1998.
2. Timothy J.Ross, Fuzzy logic with Engineering Applications; McGraw Hill 1997.
3. Laurence Fausett; Fundamentals of Neural Networks, Prentice Hall 1994.
4. George J. Klir and BO Yuan; Fuzzy sets and Fuzzy logic, Prentice Hall 1995.
5. D.E. Goldberg, Genetic Algorithms: search, Optimization and Machine Learning. Addison Wealeym, 1989.
6. Zimmerman H.J. Fuzzy set theory - and its Applications, Kluwer Academic Publishers, 1994.
7. Nih J. Nelsson. Artificial Intelligence- A new Synthesis, Harcourt Asia Ltd., 1998.
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 mark
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 26 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
33/41
SITX5019 REAL TIME COMPUTINGL T P Credits Total Marks
3 0 0 3 100
UNIT I INTRODUCTION 10 hrs.
Introduction Issues in Real time computing, structure of a real time system. Task Classes, Performancemeasures for real time systems, Estimating program run times task Assignment and Scheduling Classical Uniprocessor
Scheduling Algorithms. Uni Processor Scheduling of IRIS Tasks, Task Assignment, Mode Changing, Fault tolerant
Scheduling
UNIT II PROGRAMMING LANGUAGES AND TOOLS 10 hrs.
Programming Language and Tools Desired Language Characteristics, Data Typing, Control Structures,
Facilitating Hierarchial Decomposition , Package, Run-Time Error handling Overloading and Generics, Mulittasking,
Low level Programming, Task Scheduling, Timing Specifications, Programming Environments, Run-Time support
UNIT III REAL TIME DATABASES 10 hrs.
Real Time Databases basic definition, Real time Vs General purpose databases, Main Memory Databases,
Transaction Priorities, Transaction Aborts, Concurrency Control Issues, Disk Scheduling Algorithms. Two phase Approach
to improve predictability. Maintaining Serialization Consistency, Databases for Hard Real Time Systems
UNIT IV COMMUNICATION 10 hrs.
Real-Time Communication Communications Media , Network Topologies Protocols, Fault Tolerance Techniques
Fault Types. Fault Detection. Fault Error Containment Redundancy, Data Diversity, Reversal Checks, Integrated
Failure Handling
UNIT V EVALUATION TECHNIQUES 10 hrs.
Reliability Evaluation Techniques Obtaining parameter values, Reliability models for hardware Redundancy,
Software Error Models, Clock Synchronization Clock, A non fault Tolerant Synchronization Algorithm impact of Faults,
Fault Tolerant Synchronization in Hardware, Software
REFERENCE BOOKS:
1. C.M.Krishna, Kang G Shin, Real Time Systems, McGraw Hill International Edition, 1997
2. Stuart Bennett, Real Time Computer Control An introduction PHI, 1988
3. Peter D Lawrence, Real Time Micro Computer System Design An introduction, McGraw Hill, 19884. S.T.Allworth and R.N.Zobel, Introduction to real time software design, Macmillan, II edition, 1987
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 27 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
34/41
8/12/2019 Sathyabama Univ ME CSC syllabus
35/41
SITX5021 SOFTWARE ENGINEERINGL T P Credits Total Marks
3 0 0 3 100
UNIT I INTRODUCTION AND MODELS 10 hrs.
Introduction - The software process Software Life Cycle Models Water Fall Model Rapid Prototype Model Incremental Model Spiral Model Object Oriented life Cycle Models.
UNIT II CMM AND SOFTWARE DESIGN 10 hrs.
Capability Maturity Model for software the five levels of software process maturity ISO how ISO compares
with the CMM. Broad techniques of software design Structural approach versus object approach - Issues in structural
approach, DFD , Cohesion and Coupling. Object oriented approach C and Y CRC techniques.
UNIT III PROJECT MANAGEMENT 10 hrs.Software Project Management- Software cost estimation Estimation of size, efforts. Function point approach
cost estimation Basic COCOMO model.
UNIT IV TESTING 10 hrs.
Testing Quality issues nonexecution based testing execution based testing Module testing Black box
white box testing. Integration testing adequacy criteria test cases designing test cases OO testing issues.
UNIT V MAINTENANCE 10 hrs.
Maintenance - its importance Management of Maintenance. Software Architecture an overview. Case Studies:
Inventory Control system, Reservation System and Office automation.
REFERENCE BOOKS:
1. Stephen R Schanch, Classical and Object Oriented Software Engineering with UML and Java, McGraw-Hill International Edition 1999.
2. Pankaj Jalote, An Integrated approach to software Engineering 2nd Edition, Narosa Publishing house.
3. Pressman R.S, Software Engineering , 2nd Edition, McGraw Hill
4. Ian Sommerville, Software Engineering, 5th Edition, Addison Wesley
5. Peter Coad and Edward Yourdon, Object Oriented Analysis, Yourdon Press, 1991.
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 29 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
36/41
SITX5022 ADVANCED NETWORKSL T P Credits Total Marks
3 0 0 3 100
UNIT I CIRCUIT SWITCHED NETWORKS 10 hrs.SONET-DWDM Fiber to the Home DSL CATV ISDN BISDN
UNIT II ATM 10 hrs.
Addressing Signaling & Routing Header Structure ATM adaptation layer Management Control
UNIT III INTERNETWORKING WITH ATM 10 hrs.LAN IP power ATM Multiprotocol over ATM Frame Relay over ATM
UNIT IV WIRELESS NETWORKS 10 hrs.
The wireless channel Link level Design Channel Access Network design Standards
UNIT V MODERN NETWORKS 10 hrs.
Optical Networks Cross Connects LANS Voice Over IP Multimedia
REFERENCE BOOKS:
1. Walrand . J. Variya, High Performance Communication Network, Morgam Kauffman Harcourt Asia Pvt. Ltd. 2 nd Edition, 2000
2. William Stallings, ISDN & Broadband ISDN with frame relay & ATM, PHI 4th Edition, 2000
3. Bates & Donald W Gregory Voice & Data Communication Handbook, McGraw Hill Edition, 3rd Edition, 2000
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 30 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
37/41
SCSX5021 DIGITAL IMAGE PROCESSINGL T P Credits Total Marks
3 0 0 3 100
UNIT I INTRODUCTION 10 hrs.
Digital Image Representation- Fundamental steps in Image Processing- Elements of Digital Image ProcessingSystem.
Digital Image Fundamentals - Elements of Visual perception- A simple Image Model- Sampling & Quantization-
Neighbors of a Pixel Connectivity, Relations, Equivalence & Transitive Closure.
UNIT II IMAGE TRANSFORMS 10 hrs.
Basic Transformation Perspective Transformation Photographic film structure, Exposure & Film Characteristics.
Introduction to Fourier Transform-Discrete Fourier Transform-Fast Fourier Transform-Discrete Cosine Transform
UNIT III IMAGE ENHANCEMENT AND RESTORATION 10 hrs.
Background Enhancement by Point Processing Spatial filtering Enhancement in Frequency Domain
Colour Image Processing : Color Models RGB color model CMY color model YIQ color model- HIS color model
Pseudo Color Image Processing Fundamentals- Filtering model of pseudo-color image processing
Algebraic approach to restoration Inverse filtering, LMS filter Geometric transformation Spatial & Gray-level
Interpolation
UNIT IV IMAGE COMPRESSION 10 hrs.
Fundamentals Image Compression Models Elements of Information Theory Error Free Compression Variable Length Coding Constant area Coding Lossless Predictive Coding Transform Coding Image Compression
Standards.
UNIT V IMAGE SEGMENTATION, REPRESENTATION AND DESCRIPTION 10 hrs.
Edge linking & Boundary Detection Thresholding Region Segmentation Representation Oriented & description
schemes of Images Boundary Extraction Morphology Applications Elements of Image Analysis.
REFERENCE BOOKS:
1. Rafel C. Gonzalez & Richard E. Woods, Digital Image Processing, Addison Wesley, 2008.2. M.A. SID Ahamed, Image Processing theory, Algorithm & Architecture, McGraw Hill 1991.
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART - A : 6 questions of 5 marks each without choice 30 marks
PART - B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 31 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
38/41
SCSX5024 CLOUD COMPUTINGL T P Credits Total Marks
3 0 0 3 100
UNIT I UNDERSTANDING CLOUD COMPUTING 10 hrs.
Cloud Computing History of Cloud Computing Cloud Architecture Cloud Storage Why Cloud ComputingMatters Advantages of Cloud Computing Disadvantages of Cloud Computing Companies in the Cloud Today
Cloud Services
UNIT II DEVELOPING CLOUD SERVICES 10 hrs.
Web-Based Application Pros and Cons of Cloud Service Development Types of Cloud Service Development
Software as a Service Platform as a Service Web Services On-Demand Computing Discovering Cloud
Services Development Services and Tools Amazon Ec2 Google App Engine IBM Clouds
UNIT III CLOUD COMPUTING FOR EVERYONE 10 hrs.
Centralizing Email Communications Collaborating on Schedules Collaborating on To-Do Lists Collaborating
Contact Lists Cloud Computing for the Community Collaborating on Group Projects and Events Cloud Computing
for the Corporation
UNIT IV USING CLOUD SERVICES 10 hrs.
Collaborating on Calendars, Schedules and Task Management Exploring Online Scheduling Applications
Exploring Online Planning and Task Management Collaborating on Event Management Collaborating on Contact
Management Collaborating on Project Management Collaborating on Word Processing - Collaborating on Databases
Storing and Sharing Files
UNIT V OTHER WAYS TO COLLABORATE ONLINE 10 hrs.
Collaborating via Web-Based Communication Tools Evaluating Web Mail Services Evaluating Web Conference
Tools Collaborating via Social Networks and Groupware Collaborating via Blogs and Wikis
REFERENCE BOOKS:
1. Michael Miller, Cloud Computing: Web-Based Applications That Change the Way You Work and Collaborate Online, Que Publishing,
August 2008.
2. Haley Beard, Cloud Computing Best Practices for Managing and Measuring Processes for On-demand Computing, Applications andData Centers in the Cloud with SLAs, Emereo Pty Limited, July 2008.
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART A : 6 questions of 5 marks each without choice 30 marks
PART B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 32 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
39/41
SCSX5023 SERVICE ORIENTED ARCHITECTUREL T P Credits Total Marks
3 0 0 3 100
UNIT I SOFTWARE ARCHITECTURE 10 hrs.
Types of IT Architecture SOA Evolution Key components perspective of SOA Enterprise-wide SOA
Architecture Enterprise Applications Solution Architecture for enterprise application Software platforms for
enterprise Applications Patterns for SOA SOA programming models
UNIT II SERVICE-ORIENTED ANALYSIS AND DESIGN 10 hrs.
Design of Activity, Data, Client and business process services Technologies of SOA SOAP WSDL JAX
WS XML WS for .NET Service integration with ESB Scenario Business case for SOA stakeholder
objectives benefits of SPA Cost Savings
UNIT III SOA IMPLEMENTATION AND GOVERNANCE 10 hrs.
Strategy SOA development SOA governance trends in SOA event-driven architecture software s a
service SOA technologies proof-of-concept process orchestration SOA best practices
UNIT IV META DATA MANAGEMENT 10 hrs.
XML security XML signature XML Encryption SAML XACML XKMS WS-Security Security in
web service framework - advanced messaging
UNIT V TRANSACTION PROCESSING 10 hrs.
Paradigm protocols and coordination transaction specifications SOA in mobile research issues
REFERENCE BOOKS :
1. Shankar Kambhampaly, Service Oriented Architecture for Enterprise Applications, Wiley India Pvt Ltd, 2008.
2. Eric Newcomer, Greg Lomow, Understanding SOA with Web Services, Addison-Wesley, 2005.
3. Mark O Neill, et al. , Web Services Security, Tata McGraw Hill, 2003.
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART A : 6 questions of 5 marks each without choice 30 marks
PART B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 33 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
40/41
SCSX5012 SOFTWARE ARCHITECTUREL T P Credits Total Marks
3 0 0 3 100
UNIT I SOFTWARE PROCESS AND THE ROLE OF MODELING AND ANALYSIS 10 hrs.
Analysis modeling and best practices, process, process modeling; process notations traditional best practicediagrams such as DFDs and ERDs.
UNIT II ARCHITECTURAL MODELING 10 hrs.
UML diagrams, Structural static modeling, behavioral modeling interactions use cases use case, interaction
& Activity diagrams. Component and deployment diagrams analysis case studies, analysis patterns.
UNIT III SOFTWARE ARCHITECTURE DESIGN 10 hrs.
Design best practices, Design patterns Creational patterns structural patterns behavioral patterns,
Component technology, object oriented frameworks, distributed objects, interoperability standards, case studies.
UNIT IV SOFTWARE ARCHITECTURE 10 hrs.
Architectural styles, architectural patterns, patterns and software architecture, analysis of architectures, formal
descriptions of software architectures.
UNIT V ARCHITECTURAL DESCRIPTION LANGUAGES ADL AND TOOLS 10 hrs.
Requirements of Architecture Description languages, Tools for Architectural design, scalability and interoperability
issues, Web application architectures, case studies.
REFERENCE BOOKS:
1. Grady Booch, James Rumbaugh, Ivar Jacobson, The Unified Modeling Language User Guide, Addison Wesley, 1999.
2. Erich Gamma, Richard Helm, Ralph Johnson and John Vlissides, Design Patterns, Elements of reusable Object Oriented Software,
Addison Wesley, 1995.
3. Frank Buschmann et al, Pattern Oriented Software Architecture, Volume 1: A system of patterns, John Wiley and Sons, 1996.
4. Len Bass, Paul Clements, Rick Kazman, Software Architecture in Practice second edition, Addison Wesley, 1998.
5. Mary Shaw and David Garlan, Software Architecture Perspectives on an emerging Discipline:, Prentice Hall, 1996.
6 Eric J.Braude, Software Design, J.Wiley Publications, 2004.
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART A : 6 questions of 5 marks each without choice 30 marks
PART B : 2 questions from each unit of internal choice, each carrying 10 marks 50 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING
M.TECH (INFORMATION TECHNOLOGY) 34 REGULATIONS 2010
8/12/2019 Sathyabama Univ ME CSC syllabus
41/41
SCSX5009 COMPUTATIONAL INTELLIGENCE TOOLSL T P Credits Total Marks
3 1 0 4 100
UNIT I ARTIFICIAL NEURAL NETWORKS 10 hrs.
The Artificial Neuron - Supervised Learning -Unsupervised Learning - Reinforcement Learning - Performance
Issues
UNIT II EVOLUTIONARY COMPUTATION 10 hrs.
Introduction - Genetic Algorithms - Genetic Programming - Evolutionary Programming - Evolution Strategies
Differential Evolution - Cultural Algorithms - Coevolution
UNIT III SWARM INTELLIGENCE 10 hrs.
Particle Swarm Optimization - Ant Colony Optimization Artificial Bee Colony Sheepflock Optimization
UNIT IV ARTIFICIAL IMMUNE SYSTEMS 10 hrs.
Natural Immune System - Learning the Antigen Structure - The Network Theory - The Danger Theory
Artificial Immune Models
UNIT V FUZZY SYSTEMS 10 hrs.
Fuzzy Sets - Fuzzy Logic and Reasoning - Fuzzy Inferencing - Fuzzy Controllers - Mamdani Fuzzy Controller
Takagi-Sugeno Controller - Rough Sets
REFERENCE BOOKS:
1. Andries. P. Engelbrecht, Computational Intelligence , Wiley Publications Second Edition
UNIVERSITY EXAM QUESTION PAPER PATTERN
Max. Marks : 80 Exam Duration : 3 hrs.
PART A : 6 questions of 5 marks each without choice 30 marks
SATHYABAMA UNIVERSITY FACULTY OF COMPUTER SCIENCE AND ENGINEERING