P. 1
M.tech Syllabus

M.tech Syllabus

|Views: 87|Likes:
Published by durgathapa

More info:

Published by: durgathapa on Nov 20, 2010
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

11/20/2010

pdf

text

original

OEPARTMENT OF INFORMATION TECHNOLOGY

FACULTY OF COMPUTER SCIENCE ANO ENGINEERING

FIRST SEMESTER

Course Code Theory

SECOND SEMESTER

Course Code Theory

M.TECH INFORMATION TECHNOLOGY CURRICULUM (FOR BATCH 2010 ONWARDS)

Course Title

Advanced Data Structures and Algorithms Network Protocols

Advanced Database Technologies Foundations of Computer Engineering Information Retrieval Techniques

Network Design and Programming Lab

Course Title

Soft Computing

Advanced lnternel Technologies Mobile and Pervasive Computing Electlve-I

Elective-II

Internet Programming Lab

M.Tech (INFORMATION TECHNOLOGY)

2010 SYLLABUS

DEPARTMENT OF INFORMATION TECHNOLOGY

THIRD SEMESTER

Course Code

FOURTH SEMESTER

Course Code

Course Title

Network Infrastructure and Cyber Computing

Web Services

Search Engines and Optimization

Elective "I

Elective IV

Network Security and Web Services Lab

Project Work and Viva Voce

List of Electives

Course Title

Data Mining and Warehousing

C# and .Net

J2EE

Enterprise Resource Planning

Ecommerce Technologies

Component Based Technologies

Bio-Informatics

TCPIIP and Socket Programming

Satellite Communication

Network Management System

Information Coding Techniques

Ad Hoc Networks M.Tech (INFORMATION TECHNOLOGY)

" FACULTY OF COMPUTER SCIENCE AND EN~INEERING

If

2010 SYLLABUS

, r

DEPARTMENT OF INFORMA nON TECHNOLOGY

FACULTY OF COMPUTER SCIENCE AND ENGINEERING

Agent Based Intelligent Systems Grid Computing

Real Time Computing Embedded Architecture Software Engineering Advanced Networks Digital Image Processing Cloud Computing

Service Oriented Architectures Software Architectures

2010 SYLLABUS

M.Tech ~NFORMATION TECHNOLOGY)

DEPARTMENT OF INFORMATION TECHNOLOGY

~ FACULTY OF COMPUTER SCIENCE AND ENGINEERING

ADVANCED DATA STRUCTURES AND ALGORITHMS

(Common to CSE & IT)

UNITA : INTRODUCTION TO ALGORITHMS

--

12HRS

Role of Algorithms in computing- analyzing algorithm- Designing algorithm- Asymptotic Notations- Summations -Formulas and

properties- Recurrences. r: 0" h"~ ,I"" j, ,t'_]

. D • ~""n/~es, '7"'C<..bSc....+ A - c- D i

b";cI-\ei- 50'(1-. Ao,.,Lu s: c' ._ I r' '-'I',J,(I;(, cl<:;/l-; J'\(A,('/f'l! ~Qy}-J

UNIT II -- J of Sc;.1h~J aJJ,,-d (hm . 12 HRS

(jRE6

S~CH STRUCTURES

Binary Search Trees - AVL Trees - Red-Black trees-B- Trees - Splay Trees

HEAP STRUCTURES

MinIMax heaps Leftist Heaps - Binomial Heaps - Fibonacci Heaps

UNIT III : MULTIMEDIA STRUCTURES

12HRS

Segment Trees - k-d Trees - Point Quad Trees - MX-Quad Trees - R-Trees - TV-Trees.

UNIT IV: PROBLEM SOLVING TECHNIQUES

12 HRS

Branch & Bound -NP hard and NP complete problems- Huffman Coding - Activity Networks -Flow Shop Scheduling -Randomized Algorithms.

A J-i;,1 o>lli '" r<'I"> .

GlYeedy A is v'l"; (h~,,., 13 CIC j~ q Tack; ~ J i>ynqr<li c. froJfQ rnMi'1 + J); y.ele unJ La r<r(Y •

UNIT V : GRAPH ALGORITHMS

12HRS

Graphic Representation - BFS - DFS - Topological Sort - Connnected Components - Minimum Spanning trees - Kruskal's Algorithm - Prims Algorithm - dijkstra's Algorithm - floyd's Algorithm - Bellman Ford Algorithm

Reference Books

1. Introduction to Algorithms Thomas H Coreman, Charles E.Leiserson, ronals L.Rivest 2002, PHI

2. Computer Algorithms and Introduction to De~ign and Analysis - Sara Baase, Allen ran Gelda, 2000 Pearson

3. Data Structures algorithm and application in C++ - Shani 2000

4. Mark Allen Weiss, "Data Structures and Algorithms in C++" Addison wesley

5. A.V. Aho, J.E.Hopcroft and J.,D.Ullman, Design and analysis of Computer algorithms, 1974, Addison Wesli

6. V.S. Subramanian, Principles of Multimedia Database systems, Morgan Kaufman, 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 : 5 questions from each of the FIVE units of internal choice, each carrying 10 marks - 50 marks

M.Tech (INFORMATION TECHNOLOGY)

2010 SYLLABUS

, ,

DEPARTME~H OF INFORMATION TECHNOLOGY

FACULTY OF COMPUTER SCIENCE AND ENGINEERING

NETWORK PROTOCOLS

UNIT· I

12 HRS

Communication Architecture and Protocols - Internetwork Protocols - Internetwork Operations - Transport Protocols - Network Security - Distributed Applications.

UNIT· II

12 HRS

Circuit Switched Networks - Dynamic Alternative Routing - Routing in ATM Networks - Packet Switched Networks- Inter Domain Routing - EGP, BGP and IDRP Protocols - Apple Talk Routing.

UNIT·III

12 HRS

High Speed Networks - Routing in Optical Networks - Single Hop - Multi Hop -Hybrid Optical Networks - Routing in planet Network - Deflection Routing.

UNIT·IV

12 HRS

Mobile Networks - Routing in cellular Mobile Radio Communication Networks - Packet Radio Routing - Routing in small and large sized packet radio networks - Large Network Routing Algorithms.

UNIT-V

12 HRS

Internet Applications - Electronic Mail and Network Management - Internet Directory Service and World Wide Web - Multimedia - VOIP - SIP -RTP.

TEXT BOOKS

1. William Stallings, "Data & Computer Communication" ,8th Edition PHI 2004 .'\

2. M. Steen Strub, "Routing in Communication Networks", Prentice Hall International, New York, 1995.

REFERENCE BOOKS

1. A.S. Tanenbaum, "Computer Networks", PHI, New Delhi, 2003.

2. Othmar Kyas, "ATM Networks" 2nd Edition, International Thomson Computer Press, 1998.

3. Nalin K Sharda, 'Multimedia Information Networking', Prentice Hall of India, 1999.

UNIVERSITY EXAM QUESTION PAPER PATTERN'

Exam Duration: 3 hrs.

Max Marks: 80

PART - A : 6 questions of 5 marks each without choice - 30 marks PART - B : 5 questions from each of the FIVE units of internal choice, each carrying 10 marks - 50 marks

M.Tech (INFORMATION TECHNOLOGY)

2010 SYLLABUS

DEPARTMENT OF INFORMATION TECHNOLOGY

FACULTY OF COMPUTER SCIENCE AND ENGINEERING

ADVANCED DATABASE TECHNOLOGIES

UNIT ·1

12HRS

Data base system Architecture - single and multi user systems - Storage and File Structure - Query Optimization Techniques - Transaction Management: Transaction Processing Concepts - Concurrency Control - Recovery Techniques -Database Security.

UNIT -II

12 HRS

Parallel DBMS: Architecture- Query evaluation - Query optimization - parallelizing Individual operations. Distributed DBMS:

Architecture - storing data - Cataloguing - Query processing -Transactions Concurrency and Recovery.

UNIT -III

12 HRS

DATA WAREHOUSING: Architecture of a data warehouse; Differences between Online Transaction Processing (Ol TP) and Online Analytical Processing (OlAP); Multi-dimensional data modeling; Data cubes; OLAP operations; Algorithms for data cube computation- Implementaion techniques for OLAP.

UNIT -IV

12HRS

Active Database Concepts and Triggers -Temporal Databases - Spatial Databases - Deductive Databases - XMl Databases:

XMl Data Model - Geographic Information Systems - Genome Data Management.

UNIT - V

12 HRS

MOBILE OAT ABASES: Mobile computing architecture-Mobile environment characteristics-Data management issues. MULTIMEDIA OAT ABASES: Nature of Multimedia data and applications Data management issues Multimedia database applications

OBJECT DATABASE SYSTEM: Abstract data types Objects identity and reference types-Inheritance Database design for ORDBMS ODMG data model and ODl OQL.

TEXT BOOKS

1. Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems, III Ed. McGraw Hill Publications.

2. H.F. Korth and A.Silberschatz: Database system concepts, III Ed., McGraw HiliPublications.

REFERENCE BOOKS

1. Ramez Elmasri & B.Navathe: Fundamentals of Database Systems, V Ed., AddisonWesley, 2008.

2. Stenfno Ceri and Gieusppe pelagatti, " Distributed databse- principles and systems"

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 : 5 questions from each of the FIVE units of internal choice, each carrying 10 marks - 50 marks

M.Tech (INFORMATION TECHNOLOGY)

2010 SYLLABUS

"

DEPARTMHjT OF INFORMATION TECHNOLOGY

FACULTY OF COMPUTER SCIENCE AND ENGINEERING

FOUNDATIONS OF COMPUTER ENGINEERING

UNIT I : COMPUTER ARCHITECTURE

12 HRS

Overview of Computer Architecture - Instruction Formats - Addressing Modes -Arithmetic and Logical Unit - Computer Arithmetic.

UNIT II :

12HRS

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

12HRS

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

12HRS

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

12HRS

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 - Third Edition, 1998, Mc Graw Hili .•

2. Morris Mano - Digital Design - Prentice Hall, 1994 ·h

3. Alfred V. Aho, Ravi Sethi, Jeffrey D.Ullman - Compilers, Principles, Techniques and Tool~ - Addison-wesley Publishing Company, 1986

4. L.Beck - 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 : 5 questions from each of the FIVE units of internal choice, each carrying 10 marks - 50.marks

M.Tech (INFORMATION TECHNOLOGY)

2010 SYLLABUS

DEPARTMENT OF INFORMATION TECHNOLOGY

l

FACULTY OF COMPUTER SCIENCE AND ENGINEj:RING

INFORMATION RETRIEVAL TECHNIQUES

UNIT I : INTRODUCTION

12 HRS

Basic Concepts - Retrieval Process - Modeling - Classic Information Retrieval - Set Theoretic, Algebraic and Probabilistic Models - Structured Text Retrieval Models - Retrieval Evaluation -Word Sense Disambiguation

UNIT II : QUERYING

12 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

12HRS

Document Preprocessing - Clustering - Text Compression - Indexing and Searching - Inverted files - Boolean Queries - Sequential searching - Pattern matching - User Interface and Visualization - Human Computer Interaction - Access Process - Starting Points -Query Speciflcaflon - Context - User relevance Judgment - Interface for Search

UNIT IV: MULTIMEDIA INFORMATION RETRIEVAL

12HRS

Data Models - Query Languages - Spatial Access Models - Generic Approach - One Dimensional Time Series - Two Dimensional Color Images - Feature Extraction

UNIT V: APPLICATIONS

12 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. G.G. Chowdhury, "Introduction to Modern Information Retrieval", Neal-Schuman Publishers; 2nd edition, 200J

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 : 5 questions from each of the FIVE units of internal choice, each carrying 10 marks - 50 marks

M.Tech (INFORMATION TECHNOLOGY)

2010 SYLLABUS

·1 _ ..

DEPARTME~T OF INFORMATION TECHNOLOGY

FACULTY OF COMPUTER SCIENCE AND ENGINEERING

NETWORK DESIGN AND PROGRAMMING LAB

1. Creation of Date Server, and also print the client's 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

M.Tech (INFORMATION TECHNOLOGY)

2010 SYLLABUS

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->