Mtech Syllabus Final

8/11/2019 Mtech Syllabus Final

1/10

CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY, HYDERABAD75

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

SYLLABUS FOR AUTONOMOUS M.TECH (CSE), 2013-14

SEMESTERI SEMESTER - II

S.NO Subjects ( 4 Core + 2 Electives) S.No Subjects ( 2 Core + 4 Electives)

1. Advanced Algorithms 1. Network Security and Cryptography

2.

Advanced Operating Systems 2.

Data Mining

3. Advanced Database Systems 3. ElectiveIII

4. OOSE 4. ElectiveIV

5. ElectiveI 5. ElectiveV

6. ElectiveII 6. ElectiveVI

7. Advance Algorithms Lab 7. Networks Lab

8. OOSE Lab 8. Seminars

9. Communications Skills Lab

ElectiveI &II

Mobile Computing

Business Intelligence

Distributed Computing

Real Time Systems

Artificial Intelligence

Pattern recognition & Image Processing

Embedded Systems

Internetworking Technologies

III Semester and IV Semester: Project Work

ElectiveV &VI

Neural Networks

Software Architecture & Design Patterns

Middleware Systems

Parallel Algorithms

Reliability & Fault Tolerance

Human computer Interaction

Pervasive ComputingSemantic Web

Information Security Audit & Assurance

Research Methodologies in Computer

Science

ElectiveIII &IV

Soft Computing

Machine Learning

Software Quality Assurance & Testing

Cloud Computing

Wireless and Mobile Networks

Distributed Algorithms

Pattern Recognition & Computer Vision

Adhoc Sensor Networks

Intelligent Agents

Information Retrieval


2/10

SCHEME OF INSTRUCTION AND EXAMINATION

M.Tech-I YEAR (REGULAR)COMPUTER SCIENCE & ENGINEERING

SEMESTER I

Sl.

No

Syllabus

Ref. No.Subject

Scheme of

InstructionScheme of Examination

Periods Per

WeekDurati

on in

Hrs

Maximum

Marks

L/T D/PUniv.

Exam

Sessio

nals

Credits

THEORY

1 Advanced Algorithms 4 - 3 75 25 3

2Advanced Operating

Systems4 -

375 25

3

3Advanced Database

Systems4 -

375 25

3

4 OOSE 4 - 3 75 25 3

Mobile Computing

(ELECTIVE-I)4 -

375 25

3

5 Distributed Computing-(ELECTIVE-II)

4 -3

75 253

PRACTICALS

1 ADB + OOSE Lab - 3 3 50 25 2

2Communications Skills

Lab- 3 3 50 25

2

Total

ElectiveI ,II,III,IV,V,VI

Mobile Computing Pattern Recognition & Computer VisionBusiness Intelligence Adhoc Sensor Networks

Distributed Computing Intelligent Agents

Real Time Systems Information Retrieval

Artificial Intelligence Neural Networks

Pattern recognition & Image Processing Software Architecture & Design Patterns

Embedded Systems Middleware Systems

Internetworking Technologies Parallel Algorithms

Soft Computing Reliability & Fault Tolerance

Machine Learning Human computer Interaction

Software Quality Assurance & Testing Pervasive ComputingCloud Computing Semantic Web

Wireless and Mobile Networks Information Security Audit & Assurance

Distributed Algorithms Research Methodologies in Computer Science


3/10

SCHEME OF INSTRUCTION AND EXAMINATION

M.Tech-I YEAR (REGULAR)COMPUTER SCIENCE & ENGINEERING

SEMESTER II

Sl.

No

Syllabus

Ref. No. Subject

Scheme of

InstructionScheme of Examination

Periods Per

Week Duration in

Hrs

Maximum

Marks

L/T D/PUniv.

Exam

Sessio

nals

Credits

THEORY

1Network Security and

Cryptography4 - 3 75 25 3

2 Data Mining 4 - 3 75 25 3

3 ElectiveIII 4 - 3 75 25 3

4 ElectiveIV 4 - 3 75 25 3

Elective

V 4 - 3

75 25 35 ElectiveVI 4 - 3 75 25 3

PRACTICALS

1Network Security and

Cryptography Lab-

33 50

25 2

2 Seminars - 3 3 50 25 2

Total

ElectiveI ,II,III,IV,V,VI

Mobile Computing Pattern Recognition & Computer Vision

Business Intelligence Adhoc Sensor NetworksDistributed Computing Intelligent Agents

Real Time Systems Information Retrieval

Artificial Intelligence Neural Networks

Pattern recognition & Image Processing Software Architecture & Design Patterns

Embedded Systems Middleware Systems

Internetworking Technologies Parallel Algorithms

Soft Computing Reliability & Fault Tolerance

Machine Learning Human computer Interaction

Software Quality Assurance & Testing Pervasive Computing

Cloud Computing Semantic Web

Wireless and Mobile Networks Information Security Audit & Assurance

Distributed Algorithms Research Methodologies in Computer Science

III Semester and IV Semester: Project Work

Sd/-

HEAD, DEPT. OF CSE


4/10

CS 511 (With effect from academic year 2013-2014)

ADVANCED ALGORITHMS

Instruction 3periods per week

Duration of University Examination 3 Hours

University Examination 80 Marks

Sessional 20 Marks

UNIT- IAlgorithm Analysis: Asymptotic Notation, Amortization

Basic Data Structure: Stacks and Queues, Vectors, Lists and Sequences, Trees, Priority

Queues, Heaps, Dictionaries and Hash Tables

Search Trees and Skip Lists: Ordered Dictionaries and binary Search Trees, AVL trees,

Bounded-Depth Search Trees.

UNIT-II

Fundamental Techniques: The Greedy Method, Divide and Conquer, Dynamic

Programming

Graphs: The Grpah abstract data Type, Data Structures for Graphs, Graph Traversal,

Directed Graphs.

UNIT-III

Weighted Graphs: Single Source Shortest Paths, All pairs Shortest Paths, Minimum

Spanning Trees

Network Flow and Matching: Flows and Cuts, Maximum Flow, Maximum Bipartite

Matching, Minimum Cost Flow

UNIT-IVText processing: Strings and Pattern Matching algorithms, Tries, Text Compression, Text

Similarity testing.

Number Theory and Cryptography: Fundamental Algorithms involving numbers,

Cryptographic Computations, Information Security Algorithms and Protocols.

UNIT-VComputational Geometry: Range Trees, Prority Search Trees, Quadtrees and k-d Trees,

Convex Hulls, N-P Complete.

Suggested Reading

1.

M.T.Goodrich, R.Tomassia, Algorithm design Foundations, Analysis, and Internet

Algorithms, John Wiley, 20022.

E Horrowitz, S salmi, S Rajasekaran, Fundamentals of Computer Algorithms,

Second Edition, University Press, 2007

3.

Aho, A V Hopcraft Ullman JD, The Design and analysis of computer Algorithms,

Pearson Education, 2007

4.

Hari Mohan Pandy, Design analysis amd Algorithms, University Science Press,

2009

5.

Cormen, Lieserson, Rivest, Introduction to Algorithms, 2nd Edition, PHI, 2003


5/10


6/10


ADVANCED DATABASES



University Examination 80 MarksSessional 20 Marks

UNIT- IObject Based Databases: Overview, complex Data Types, Structured Types and Inheritance

in SL, table Inheritance, Array and Multiset Types in SQL, Object Identity and Reference

Types in SQL, Implementing O-R features, Persistent Programming Languages, Object-

Relational Mapping, ObjectOriented versus Object- Relational.

UNIT-II

XML: Motivation, Structure of XML data, XML Document schema, Querying and

Transformation, Application Program Interface to XML, Storage of XML data, XMLapplications.

UNIT-III

Query processing:Overview, Measures of Query Cost, Selection operating, sorting, Join Operation, Other

Operations, Evaluation of Expressions.

Query Optimization: Overview, Transformation of Relational Expressions, Estimating

Statistics of Expressing Results, Choice of Evaluation plans, Materialized Views.

UNIT-IV

Parallel Databases: Introduction, I/O Parallelism, Interquery Parallelism,IntraqueryParallelism, Interoperation ParallelismQuery Optimization, Design of Parallel

Systems.

Distributed Databases: Homogenous and Heterogeneous Databases, distributed data

storage, Distributed Transactions, Commit Protocols, concurrency Control in Distributed

Databases, Availability, Distributed

Query Processing, Heterogeneous Distributed

Databases, cloud Based Databases, Directory systems.

UNIT-VAdvanced Application development: Performance Tuning, Performance Benchmarks Other

Issues in Application Development, Standardization

Spatial and Temporal Data and Mobility:Motivation, Time in Databases, spatial and

Geographical |Data, Multimedia Databases, Mobility and Personal databases

Suggested Reading1. Abraham Silbershatz, Henry F Korth, S Sudharshan, Database System Concepts,

McGrawHill International Edition, Sixth Edition, 2010

2. ElmasriNavathe, Somayajulu, Gupta, Fundamentals of Database Systems, Pearson

Education, Fourth Edition, 2006.

3.

CJ Date, A Kannan, S Swamynathan, An Introduction to database Systems, PearsonEducation, Eight Edition, 2006

4. Ramakrishna, Gehrke, Database Management, International Edition, Third Edition,

2003


7/10


OBJECT ORIENTED SOFTWARE ENGINEERING




Sessional 20 Marks

UNIT- IInformation System: Problems in Information Systems, development, Project Life Cycles,

Managing Information Systems Development, User Involvement and Methodological

approaches, Basic Concepts and Origins of Object Orientation Modeling concepts.

UNIT-IIRequirement Capture,Requirement Analysis, Refining the Requirement Models, Objects

Interaction

UNIT-IIIOperations, Control, Design, System Design.

UNIT-IVObject Design, Design patterns, Human Computer Interaction, Designing Boundary Classes.

UNIT-VData Management Design, Implementation, Reusable Components, Managing Object

Oriented Projects, System Development Methodologies.

Suggested Reading

1.

Simon Benett, Steve Mc Robb & ray Farmer, Object Oriented System Analysis ad

Design using UML, McGraw Hill, 2002

2. Grady Booch, James Rumbaugh, Ivor Jacobson, The Unified Modeling Language-

User Guide, Addison Wesley, 1999.

3. Ivor Jacobson, Grady Booch, James Rumbaugh, The Unified Software Development

Process, Addison Wesley, 1999


8/10


DISTRIBUTED COMPUTING

Instruction 3 Periods per Week



Sessional 20 Marks

UNIT -IIntroduction: Definition of Distributed Systems, Goals: Connecting Users and Resources,

Transparency, Openness, Scalability, Hardware Concepts: Multiprocessors, Homogeneous

Multicomputer systems, Heterogeneous Multicomputer systems, Software Concepts:

Distributed

Operating Systems, Network Operating Systems, Middleware, The client-server model:

Clients

and Servers, Application Layering, Client-Server Architectures.

UNIT-II

Communication: Layered Protocols, Lower-Level Protocols, Transport Protocols, Higher-

Level

Protocols.

Remote Procedure Call: Basic RPC Operation, Parameter Passing, Extended RPC

Models.

Remote Object Invocation: Distributed Objects, Binding a Client to an Object, Static

verses Dynamic Remote Method Invocations, Parameter Passing.

Message Oriented Communication: Persistence and synchronicity in Communication,

Message-Oriented Transient Communication, Message-Oriented Persistent

Communication.Stream Oriented Communication:Support for Continuous Media, Streamsand Quality of Service, Stream Synchronization.

UNIT-III

Process, Threads:Introduction to Threads, Threads in Distributed Systems.

Clients:user Interfaces, Client-Side Software for Distribution Transparency.

Servers:General Design Issues, Object Servers.

Software Agents:Software Agents in Distributed Systems, Agent Technology.

Naming: Naming, Entities: Names, Identifiers, and Address, Name Resolution, The

Implementation of a Name System.Locating Mobile Entities:Naming verses Locating Entities, Simple Solutions, Home-Based

and Hierarchical Approaches.

UNIT-IV

Distributed Object based Systems

CORBA: Overview of CORBA, Communication, Processes, Naming, Synchronization,

Caching and Replication, Fault Tolerance, Security.

Distributed COM: Overview of DCOM, Communication, Processes, Naming,

Synchronization, Replication, Fault Tolerance and Security.

GLOBE: Overview of GLOBE, Communication, Process, Naming, Synchronization,

Caching Replication, Fault Tolerance, Security, Comparison of CORBA, DCOM, and COM.


9/10


10/10

CS 551 (With effect from Academic Year 2013-2014)

MOBILE COMPUTING

Instruction 3 Periods per week



Sessional 20 Marks

UNIT-I

Introduction: Wireless transmission, Frequencies for Radio Transmission, Signals,

Antennas, Signal Propagation, Multiplexing, Modulations, Spread Spectrum, MAC SDMA,

FDMA, TDMA, CDMA, Cellular Wireless Networks.

UNIT-II

Telecommunication Systems: GSM, GPRS, RA, Satellite Networks, Basics, Parameters and

Configurations, Capacity Allocation, FAMA and DAMA, Broadcast Systems, DAB, DVB,

CDMA and 3G.UNIT-III

Wireless LAN: IEEE 802.11, Architecture, Services, MAC-Physical Layer, IEEE 802.11a-

802.11b Standards, Bluetooth.

UNIT-IV

Routing Adhoc Network Routing Protocols: Adhoc Network Routing Protocols,

Destination Sequenced Distance Vector Algorithm, Cluster Based Gateway Switch

Routing, fish-eye state routing, Dynamic Source Routing, Adhoc on-demand Routing,

Location Aided Routing, Zonal Routing Algorithm.

Mobile IP-Dynamic Host Configuration Protocol.

Traditional TCP-Classical TCP Improvements-WAP, WAP 2.0

UNIT-VPublishing & Accessing Data in Air:Pull and Push Based Data Delivery models, Data

Dissemination by Broadcast, Broadcast Disks, Directory Service in Air, Energy Efficient

Indexing Scheme for Push Based Data Delivery.

File System Support for Mobility: Distributed File sharing for Mobility Support, Coda

and other Storage Manager for Mobility Support.

Mobile Transaction and Commerce: Models for Mobile transaction, Kangaroo and

Joey Transactions, Team Transaction. Recovery Model for Mobile Transactions.

Electronic Payment and Protocols for Mobile Commerce.

Suggested Reading:1. Jochen, M Schiller, Mobile Communications, 2nd Edition Pearson Education, India,

2009.

2. Kurnkum Garg Mobile Computing,Pearson 2010

3.Asoke K Talukder,Roopa R Yavagal, Mobile Computing, TMH 2008

4.Raj Kamal,Mobile Computing, Oxford, 2009.

Documents

Mtech Syllabus Final