M.Sc. IT syllabus Admission criterion for MSc. Part I by papers: For admission to MSc.

IT, the following conditions will apply: 1. There will be 20 seats per batch. All the admissions will be on merit (i.e., percentage of aggregate marks secured for the qualifying examination). Reservation criterion should be followed as prescribed by government at the time of admission. 2. Students securing minimum 45 percent marks at the three year BSc degree in Information Technology of Mumbai University or any recognized un for theory and 50 marks for practical/case study/seminars. a) For MSc part I all the papers will be compulsory. b) MSc. Part II will have two subjects compulsory and two elective subjects Each paper will have minimum 4 Theory lectures per week each lecture is of 1 hr duration. The lectures should be organized in such a way that each paper will have minimum 100 hrs contact sessions for the year. Standard of passing: For MSc part I: To pass examination a candidate will have to secure 1) Minimum 20% marks in each theory paper and minimum 40% marks in aggregate for all the subjects. For MSc part II: To pass examination a candidate will have to secure 1) Minimum 20% marks in each theory paper and minimum 40% marks in aggregate including dissertation work on the project.. 2) The submission of dissertation work is compulsory and student should appear for viva for the same. The candidate is allowed to keep terms for maximum of all the subjects for the Part I but can take admission Part II. However the result of such student for part II examination will not be declared till candidate successfully completes part I examination. Award of class: As per the prevailing norms for other science subjects. M Sc – IT First Year Paper Prac Total Subjects Lect/ Pract/ t Week Week Hours Marks I Year – I Term 1 Computer Simulation and Modeling 4 4 3 100 50 150 I Year – II Term Programming with Components 4 4 3 100 50 150 I Year – I Term 2 Mobile Computing 4 4 3 100 50 150 I Year – II Term Advanced Computer Networks 4 4 3 100 50 150 I Year – I Term 3 Image Processing 4 4 3 100 50 150 I Year – II Term Speech Recognition 4 4 3 100 50 150

Page of 48

1

I Year – I Term 4 Data Warehousing and Mining I Year – II Term Advanced Database Systems Total , I Year – I Term Total , I Year – II Term 4 4 16 16 4 4 16 16 3 3 100 100 400 400 50 50 200 200 150 150 600 600

Page of 48

2

Subjects II Year – I Term 1 Software Testing II Year – II Term Information Security II Year – I Term 2 Artificial Intelligence II Year – II Term Robotics II Year – I Term 3 Elective I I Term II Term 4 Elective II I Term II Term 5 Project, I Term Project, II Term Total , II Year – I Term Total , II Year – II Term 1 2 3

M Sc – IT Second Year Lect/ Pract/ Week 4 4 4 4 4 4 4 4 16 16 1 2 3 Week 4 4 4 4 4 4 4 4 16 16

Paper Hours 3 3 3 3 Marks 100 100 100 100 100 100 100 100 400 400

Prac t ----50 50 50 50 100 100 200 200

Total

100 100 100 100 150 150 150 150 100 100 600 600

-

Elective-I Parallel Processing, (I Term) Distributed Computing, (II Term) Intelligent Systems, (I Term) Neural Networks and Fuzzy Systems (II Term) Digital Signal Processing, (I Term) Enterprise Networking (II Term)

Elective-II Pattern Recognition, (I Term) Computer Vision, (II Term) System Security, (I Term) Virtual Reality and Virtual Environment Multimedia systems and convergence of technologies Java Technology, (II Term)

Page of 48

3

M Sc – Information Technology Year I M Sc – Information Technology Year I, Paper I, Term I SUBJECT: COMPUTER SIMULATION AND MODELING Lectures: 4 Hrs per week Theory: 100 Marks Practical: 4 Hrs per week Term Work / Practical: 50 Marks Objective: In the last five decades digital computer simulation has developed from infancy to a full-fledged discipline. The field of modeling and simulation is as diverse as of man. The application of simulation continues to expand, both in terms of extent to which simulation is used and the range of applications. This course gives a comprehensive and state of art treatment of all the important aspects of a simulation study, including modeling, simulation software, model verification and validation, input modeling. DETAILED SYLLABUS 1. Introduction to Simulation: System and System environment, Components of system, Type of systems, Type of models, Steps in simulation study, Advantages and Disadvantages of simulation. 2. Simulation Examples: Simulation of Queueing systems, Other examples of simulation. 3. General Principles: Concepts of discrete event simulation, List processing, 4. Simulation Software: History of simulation software, Desirable software features, General-purpose simulation packages, Object oriented simulation, Trends in simulation software. 5. Statistical Models in Simulation: Useful statistical model, Discrete distribution, Continuous distribution, Poisson process, Empirical distribution. 6. Queueing Models: Characteristics of Queueing systems, Queueing notations, Long run measures of performance of Queueing systems, Steady state behavior of infinite population Markovian models, Steady state behavior finite population model, Network of Queues. 7. Random Number Generation: Properties of random numbers, Generation of pseudo random numbers, Techniques for generating random numbers, Tests for random numbers. 8. Random Variate Generation: Inverse transform technique, Convolution method, Acceptance rejection techniques 9. Input Modeling: Data Collection, Identifying the Distribution of data, Parameter estimation, Goodness of fit tests, Selection input model without data, Multivariate and Time series input models. 10. Verification and Validation of Simulation Model: Model building, Verification, and Validation, Verification of simulation models, Calibration and Validation of models. 11. Output Analysis for a Single Model: Types of simulations with respect to output analysis, Stochastic nature of output data, Measure of performance and their estimation, Output analysis of terminating simulators, Output analysis for steady state simulation 12. Comparison and Evaluation of Alternative System Design: Comparison of two system design, Comparison of several system design, Meta modeling, Optimization via simulation. 13. Case Studies: Simulation of manufacturing systems, Simulation of computer systems,

Page of 48

4

Page of 48 5 . Geffery Gordon. Academic Press 3. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. “Simulation Modeling and Analysis”. David Nicol. “Simulation with Arena”. W David Kelton. Donald W.Simulation of super market. Academic Press Harcourt India 5. Body. “System Analysis and Modeling”. Herbert Praehofer. Term work should consist of at least 10 practical experiments/Assignments covering the topics of the syllabus. “Discrete Event System Simulation” 2. TERM WORK 1. Tag Gon Kim. “System Simulation with Digital Computer”. “Theory of Modeling and Simulation”. John Carson. McGRAW-HILL References: 1. “System Simulation”. Jerry Banks. PHI 2. PHI 4. Randall Sadowski. Narsing Deo. McGRAW-HILL. Simulation of pert network BOOKS Text Books: 1. W. David Kelton. Averill Law. Deborah Sadowski. Bernard Zeigler. Barry Nelson.

Aim of this subject to study and learn COM and use COM to deploy such systems successfully. Overview of COM/DCOM and of an open doc. Introduction to DCOM. Interface and IDL. 2. Introduction to object oriented systems: Preview of Object-orientation. Concept of distributed object systems. OOAD DETAILED SYLLABUS 1. 4. 9. Term II SUBJECT: PROGRAMMING WITH COMPONENTS Lectures: 4 Hrs per week Theory: 100 Marks Practical: 4 Hrs per week Term work/ Practical: 50 Marks Objectives of the course: COM addresses software design in a very pragmatic way. 6. Overview of CORBA. multi tier system architectures. Code sharing and reuse. method invocations static and dynamic: IDL (Interface Definition Language) models and interfaces. Apartments: Cross-apartments access. 3. Interface in COM-DCOM: Introduction to interfaces. Component Object Model (COM) introduction: Com as better C++ software distribution. Class emulation. Query interface types and properties. Event. CORBA components. Enterprise Java Beans 10. persistent object service and CORBA security service. 7. Instead of providing a solution based on almost religious academic dogma of object oriented programming. Pre-requisites: C++. JAVA Interface: JNI interface with C++. Transaction service features. VC++. Mapping objects to locations. Object services and dynamic composition. CORBA’s self-describing data. concurrency control services. COM’s design takes into account both human nature and capitalism. Classes and IDL. Design of object oriented system architecture and component technology compound document. Enterprise java beans. client-server system architecture.M Sc – Information Technology Year I. lifecycle management. CORBA: Introduction and concepts. Overview of java. architectural features. Interface definition language (IDL). Run time polymorphism. Overview of Object Web. Paper I. Structure of CORBA IDL. Object Web: web technologies interfacing with distributed objects over client server and distribute architecture. Reasons to distribute for centralized objects. Optimizations. Object oriented system architecture. 11. Dynamic linking. Classes and Objects in COM-DCOM: Introduction. Object lifecycle. Using COM interface pointers. Separating interface and COM implementation. Page of 48 6 . COM is mostly widely used object model for developing distributed and concurrent systems. OMG. CORBA Services: Services for object naming. Java Programming. Classes and servers. CORBA interface repository. 5. Optimizing query interface. Introduction to distributed objects: Computing standards. distributed objects in CORBA. 8.

Rambug. Page of 48 7 . Pearson Education 2. Pearson Education TERM WORK 1.BOOKS Text Books: 1. 3. “Essential COM”. Jason Pritchard. Don Box. Booch. Pearson Education. References: 1. “Enterprise Java Beans”. “COM and CORBA side by side”. “Essential COM”. Pearson Education. Jacobson. Tom Valesky. Term work should consist of at least 10 practical experiments covering the topics of the syllabus using COM/ EJB Technologies ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus.

Radio access layer: Requirements. Multiple access with collision avoidance. Radio interface. Access point control protocol Page of 48 8 . HIPERLAN: Protocol architecture. Paper II. Medium access control layer. it is widely predicted that within the next few years’ access to Internet services will be primarily from wireless devices.11: System architecture. Multiplexing. FDMA. Security. Infrastructure and Ad hoc Networks. Pre-requisites: Computer Networks. Physical layer. with desktop browsing the exception. LEO. UMTS and IMT-2000: UMTS Basic architecture. 3. Wireless ATM working group. TDMA: Fixed TDM. Handover. Antennas. Inhibit sense multiple access. Mobility supporting network side. Localization And Calling. Slotted Aloha. 4. Location management: Requirements for location management. Examples 6. Medium Access Control: Motivation for a specialized MAC: Hidden and Exposed terminals. Link management. Bluetooth: User scenarios. Mobile quality of service. PRMA packet reservation multiple access. Near and Far terminals.M Sc – Information Technology Year I. Backward handover. Future development. Procedures and Entities. UTRA TDD mode 5. Introduction: Applications. Sublayer. New data services. Cellular systems. Polling. 8. Generic reference model. IEEE 802. Reservation TDMA. Term I SUBJECT: MOBILE COMPUTING Lectures: 4 Hrs per week Theory: 100 Marks Practical: 4 Hrs per week Term work / Practical: 50 Marks Objective: Recent developments in portable devices and high-bandwidth. Carrier sense multiple access. Handover: Handover reference model. Handover scenarios. System architecture. Channel access control. MAC layer. SDMA. Routing. Handover requirements. ubiquitous wireless networks has made mobile computing a reality. Signals. Spread spectrum. Digital audio broadcasting: Multimedia object transfer protocol. This course will help in understanding fundamental concepts. DETAILED SYLLABUS 1. Classical Aloha. Protocol architecture. Information bases And Networking. Protocol architecture. Wireless Transmission: Frequency for radio transmission. Networking. CDMA: Spread Aloha multiple access. WATM services. Handover. Digital video broadcasting 7. Applications. Telecommunication Systems: GSM: Mobile services. MEO. Radio transmission. TETRA. Types of handover. DECT: System architecture. Indeed. Demand assigned multiple access. Wireless ATM: Motivation for WATM. Forward handover. UTRA FDD mode. MAC management. Medium access control Sublayer. Basics: GEO. Satellite Systems: History. Wireless LAN: Infrared vs. Cyclic repetition of data. current developments in mobile communication systems and wireless computer networks. Addressing. Reference model: Example configurations. Physical layer. Modulation. Such predictions are based on the huge growth in the wireless phone market and the success of wireless data services. Localization. BRAN. Broadcast Systems: Overview. Physical layer. A short history of wireless communication 2. Security. Protocols. Signal propagation. Functions: Wireless mobile terminal side.

John Wiley 3. Optimizations. Krishnamurthy . WML script. P. Transmission/time-out freezing. Examples Stacks with Wap. Some approaches that might help wireless access. Wireless transport layer security. Fast retransmit/fast recovery. Entities and Terminology. Pearson Education 2. “Wireless and Mobile Network Architectures”. “Wireless Networks”. Ad hoc networks: Routing. World Wide Web: Hypertext transfer protocol. Hierarchical algorithms. Mobile Network Layer: Mobile IP: Goals. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. Addison wisely . Implications on mobility. Wireless telephony application. P. Wireless transaction protocol. Pearson Education TERM WORK 2. Support for Mobility: File systems: Consistency. Agent advertisement and discovery. Indirect TCP. Fast retransmit/fast recovery. Mobile TCP. Mobile Transport Layer: Traditional TCP: Congestion control. Jochen Schiller. Examples. Wiiliam Stallings. Richharia . Wireless markup language. Page of 48 9 .9. Hypertext markup language. Wireless datagram protocol. John Wiley 4. Dynamic host configuration protocol. Alternative metrics 10. Ipv6. Tunneling and Encapsulation . ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. Snooping TCP. “Wireless Communications Principals and Practices” 2. “Principles of Wireless Networks” 5. Dynamic source routing. M. “Wireless Communications and Networks” References : 1. Mobile databases. Wireless application environment. Transaction oriented TCP 11. K Pahlavan. Slow start. Registration. Mobile agents BOOKS Text Books: 1. assumptions and requirements. Wireless application protocol: Architecture. IP packet delivery. System architectures. Destination sequence distance vector. Rappaort. Nicopolitidis . Reverse tunneling. “Mobile communications”. Selective retransmission. “Mobile Satellite Communication: Principles and Trends”. YI Bing Lin . Wireless session protocol.

8. Term II SUBJECT: ADVANCED COMPUTER NETWORKS Lectures: 4 Hrs per week Theory: 100 Marks Practical: 4 Hrs per week Term work / Practical: 50 Marks Objectives: In first part. Switching in the LAN environment. 3. We expect natural thinking from student. Introduction to Transmission Technologies: Hardware selection in the design process. User connectivity. Protocols designs and analysis considering deterministic and non-deterministic approach. 6. Cable Access Technologies. Standard computer architectures. Air Access Technologies. ATM layer (Protocol model). Data Communications: Business Drivers and Networking Directions : Data communication Past and future. Drivers. switched multimegabit data service (SMDS).75 Internetworking protocol. Network layer (Internetwork layer). In third part we should study Network Design. Current forums. Common Protocols and Interfaces in the Upper Layers(TCP/IP): Background (Routing protocols). Transport layer. Paper II. Mature Packet Switched Protocol: ITU Recommendation X. Simulation Programming. Ethernet. AAL Protocol model. ATM layer and cell (Definition). X. Frame Relay: FR specification and design. Network layer functions. Traffic contract and QoS. 7.6. Accessing the Network. Layered reference models: The OSIRM. Bridge protocols. Fiber Access Technologies. Management plane. Not just SOCKETS but also protocols. ATM networking basics. SMDS and IEEE 802. Traffic descriptors and parameters. User plane overview. Theory of operations. Application layer.M Sc – Information Technology Year I. Standard protocols. Pre-requisites: Computer networks DETAILED SYLLABUS 1. 10. Addressing and routing design. are to be considered. LLC and MAC sub layer protocol. Addressing and Traffic control. Optical Networking: SONET/SDH standards. Common Protocols and Interfaces in the LAN environment: Data link layers protocols. Traffic and Congestion control defined. Control plane AAL. Second part Network programming is to be studied.25. Dense wavelength division multiplexing (DWDM). VoFR: Performance and Design considerations. PHY layer. TCP/IP suite. 9. Common WAN Protocol: ATM: Many faces of ATM. Subscriber Interface and Access protocol. Advantages and disadvantages of FR. Advanced technologies like High speed Devices etc. ATM public services. ATM protocol operation (ATM cell and Transmission). Copper access technologies. 4. Page of 48 10 . Token Ring. Token Bus and FDDI. Performance and Design considerations. Understanding the standards and their maker: Creating standards: players and Process. Sub-DS3 ATM. 2. Physical Layer Protocols and Access Technologies: Physical Layer Protocols and Interfaces. For example he should able to consider different constraints and assume suitable data and solve the problems. B-ISDN protocol reference model. 5. Theory of Operation.

R. P.1. Harcourt Asia. Topologies strategies. Harcourt Asia. Gallager. S. Pearson Education 2. Access layer design. “Practical Computer Analysis and Design”. “Networks for Computer Scientists and Engineers”. Backbone Network Design: Backbone requirements. Y. Types of design projects. James D.11. Morgan Kaufmann 3. Business aspects of Packet-Frame and cell switching services. Network capacities.Walrand. TERM WORK 3. Stevens. Page of 48 11 . Public network service selection. 13. Akhtar. Generic packet switching network characteristics. Components of design projects. Tanenbaum. Categories of tools. TMH 2. 6. Peterson & Davie. Tuning the network. Darren L Spohn. Packet switching service aspects. High speed LAN protocols comparisons. Varaiya. completing the access network design. BOOKS Text Books: 1. W. J. Oxford 4. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. “Computer Networks”. Access network capacity. Capacity planning and Network vision. Technology Comparisons: Circuits-message-packet and cell switching methods.S. A. Zheng. network topology and hardware. McCabe . “Unix Network Programming”. “High Performance Communication Networks”. Design tool. Bertsekas. e traffic matrix. Vol. “Computer Networks” 5. Classes of design tool. “Data Networks”. PHI References: 1. Term work should consist of at least 10 practical experiments and two assignments covering all the topics of the syllabus. Access Network Design: Network design layers. Requirements Definition: User requirements. R. D. “Data Network Design”. 12. 14. Application performance needs. Private verses public networking. Topologies.

Storage. Wavelet functions. Homomorphic filtering 6. IFFT. Fast wavelet transform. Discrete cosine transform. Wavelet transforms in two dimensions 7. Dilation. Image formation in the human eye. Display. Arithmetic and logic operations. Closing. Image Transforms (Implementation): Introduction to Fourier transform. Psychovisual. Histogram processing. Haar transform. Regional descriptors Page of 48 12 . Properties of 2-D DFT. 4. Discrete wavelet transforms in one dimensions. Morphological algorithm operations on gray-scale images 9. Spatial filtering: Introduction. Morphological algorithm operations on binary images. Image Representation and Description: Representation schemes. Thresholding. Communication. Hadamard transform. Edge linking and Boundary detection. Image sensing and acquisition. Fidelity criteria. Region based segmentation 10. Lossy compression. Subband coding. Image Segmentation: Detection of discontinuities. Hit-or-Miss transformation. Image processing holds the possibility of developing the ultimate machine that could perform the visual functions of all living beings. Image compression models. Basic relationships between pixels 3. DFT and 2-D DFT. Image Enhancement in the Spatial Domain: Gray level transformations. Redundancies: Coding. Morphological Image Processing: Introduction. Erosion. There is an abundance of image processing applications that can serve mankind with the available and anticipated technology in the near future. Digital Image Processing Systems: Introduction. Slant transform. Optimum transform: Karhunen . Video compression standards. Brightness adaptation and discrimination. FFT. Opening. Smoothing and sharpening filters 5. Image compression standards: Binary image and Continuous tone still image compression standards. Error free compression. 8. Wavelets and Multiresolution Processing: Image pyramids. Boundary descriptors. Term I SUBJECT: IMAGE PROCESSING Lectures: 4 Hrs per week Theory: 100 Marks Practical: 2 Hrs per week Term Work / Practical: 25 Marks Objective: Digital Image Processing is a rapidly evolving field with growing applications in science and engineering.Loeve (Hotelling) transform. Paper III. DETAILED SYLLABUS 1. Graphics primitives.M Sc – Information Technology Year I. Interpixel. Structure of human eye. Image Enhancement in the Frequency Domain: Frequency domain filters: Smoothing and Sharpening filters. Introduction to Computer Graphics: Geometry and line generation. Scaling functions. Walsh transform. Processing. Transformations 2. Image Data Compression: Fundamentals. Image sampling and quantization. Series expansion.

“Digital Image Processing”. Dutta Majumder. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. “Orthogonal Transforms for Digital Signal Processing” Springer 4. Anil K. Page of 48 13 . N Ahmed & K. “Fundamentals of Image Processing”. “Computer Graphics”. Roger Boyle. PHI References: 1. Jain. PHI TERM WORK 4. “Digital Image Processing and Analysis”. Analysis. William Pratt. Pearson Education 2. Second Edition. R. John Wiley 2. S. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus.BOOKS Text Books: 1. McGraw Hill 3. Rao.Woods. Chanda. B. “Digital Image Processing”.Gonsales R. and Machine Vision” Thomson Learning 3.C.R. Harrrington. Milan Sonka. D. “Image Processing.Vaclav Hlavac.E.

Speech recognition in adverse environment. 4. The level building algorithm. Large Vocabulary Continuous Speech Recognition. Speech Recognition Based On Connected Words Models: General notations for the connected Word-Recognition problem. Signal Processing And Analysis Methods For Speech Recognition: The bank-of-filters front-end processor. Theory And Implementation Of Hidden Markov Models: Discrete time Markov processes. Speech Recognition System Design And Implementation Issues: Application of source coding techniques to recognition. Fundamentals Of Speech Recognition: Introduction. and Acoustic-phonetic characterization: The speech production system. Connected digit recognition implementation. Linear predictive model for speech recognition. Implement speech analysis and speech synthesis modules using object-oriented software programs. Performance analysis and recognition enhancements. Term II SUBJECT: SPEECH RECOGNITION Lectures: 4 Hrs per week Practical: 4 Hrs per week Theory: 100 Marks Term work / Practical: 25 Marks Objectives: Develop an understanding of the relationship of vocal tract shapes and physical acoustics to the acoustic speech signal. 2. Grammar networks for connected digit recognition. Approaches to automatic speech recognition by machine. Template training methods. Auditory based Spectral analysis model. Task Oriented Applications Of Automatic Speech Recognition BOOKS Text Books: 1. Template adoption to new talkers. DETAILED SYLLABUS 1. HMM system for isolated word recognition 7. Types of HMMs. Segmental K-Means training procedure. reception. the use of software objects as components in a larger software system. Distortion Measures-Perceptual Considerations. out line. Implementation issues for HMMs. Pearson Education. Incorporation of spectral dynamic features into distortion measures. Brief history of speech recognition research. 5. Use a spectrum analyzer to relate the acoustic speech signal to acoustical processes. Time Alignment and Normalization. Multiple candidate strings. The Speech Signal: Production. Speech Sounds and features. The two level dynamic programming algorithm. 8. Page of 48 14 . L. Juang. using techniques such as class derivation. Pattern Comparison Techniques: Speech detection. Distortion Measures-Mathematical Considerations. Discriminative methods in speech recognition. Representing speech in time and frequency domains. Vector quantization. Rabiner and B. 3. Extensions to hidden Markov Models. “Fundamentals of Speech Recognition”. 6. Design and implement digital filters to synthesize speech and code speech at a low bit rate. 9. The paradigm for speech Recognition.M Sc – Information Technology Year I. Spectral-Distortion Measures. Paper III. The one pass algorithm. The three basic problems for HMMs.

L R Rabiner and RW Schafer.2. Page of 48 15 . Pearson Education. B. 2. Morgan. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. “Digital Processing of Speech Signals”. TERM WORK 5. “Speech and Audio Signal Processing”. References: 1. Martin.H. D. John Wiley. Pearson Education. “Speech and Language Processing”. Gold and N. Jurafsky and J.

Languages. Planning And Requirements: Project planning and management. Introduction: Basics of data mining. 2. Clustering. transformation and loading. define and characterize data mining applications. Data Design And Data Representation: Principles of dimensional modeling. 3. Dimensional modeling advanced topics. Systems products and Page of 48 16 . Information Access And Delivery: Matching information to classes of users. data extraction. and System Architectures: Data mining primitives. Overview And Concepts: Need for data warehousing. Infrastructure and metadata. Advanced Topics: Spatial mining. Analytical characterization: analysis of attribute relevance.M Sc – Information Technology Year I. define and characterize data mining as process. Data Mining Algorithms: Classification. Query language. 2. OLAP in data warehouse. Basic elements of data warehousing. Data warehousing and the web. Association rules. query language. Web Usage mining. data warehouse deployment. Application and Trends in Data Mining: Applications. Architectures of data mining systems 8. Web Mining: Web Content Mining. 4. Data mining part of the model aims to motivate. Data mining techniques. Paper IV. Architecture And Infrastructure: Architectural components. in terms of data models. Data Mining: 1. Mining class comparisons: Discriminating between different classes. Mining descriptive statistical measures in large databases 7. Web Structure Mining. 6. Knowledge Discovery : KDD Process 4. Term I SUBJECT: DATA WAREHOUSING AND MINING Lectures: 4 Hrs per week Practical: 4 Hrs per week Theory: 100 Marks Term work/Practical: 50 Marks Objectives of the course: The data warehousing part of module aims to give students a good overview of the ideas and techniques which are behind recent development in the data warehousing and online analytical processing (OLAP) fields. Trends in data warehousing. 5. Implementation And Maintenance: Physical design process. 3. Pre-requisites: DBMS DETAILED SYLLABUS Data Warehousing: 1. and storage techniques. Temporal mining. Collecting the requirements. Visualisation : Data generalization and summarization-based characterization. related concepts. conceptual design methodologies. 5. data quality. Designing GUI based on a data mining query language. Data Mining Primitives. 6. growth and maintenance. to motivate.

Wiley Dreamtech. M.research prototypes. Inmon. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. Paulraj Ponnian. W. 2. M Berry and G.G. “Data Mining Concepts and Techniques”. R. “Decision Support and Data Warehouse systems”. E. Page of 48 17 . Linoff. Morgan Kaufmann References: 1. TERM WORK 6. John Wiley. “Building the Data Warehouses”. Dunham. 4. Mallach. Kamber. 5. 3. “Mastering Data Mining”.H. “The Data Warehouse Toolkit”. Ralph Kimball. Additional themes in data mining. Pearson Education. Trends in data mining BOOKS Text Books: 1. TMH. 2. John Wiley. 3. John Wiley. Han. Kimpall.H. “The Data Warehouse Lifecycle toolkit”. “Data Warehousing Fundamentals”. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. “Data Mining Introductory and Advanced Topics”. John Wiley.

and thus to acquaint the students with some relatively advanced issues.Nested relations and collections. Query processing in distributed databases. Specialization and Generalization. Encapsulation of operations. and Persistence. Concurrency control and Recovery in distributed databases. OODBMS architecture and storage issues. Concepts and architecture.M Sc – Information Technology Year I. OQL. Term II SUBJECT: ADVANCED DATABASE SYSTEMS Lectures: 4 Hrs per week Theory: 100 Marks Practical: 4 Hrs per week Term work/ Practical: 50 Marks Objectives: To study the further database techniques beyond which covered in the second year. Systems comparison of RDBMS. DETAILED SYLLABUS 1.. Subclasses. Parallel query evaluation. Paper IV. apply the knowledge acquired to solve simple problems Pre-requisites: Database Systems. Query processing and Optimization. Relationship types of degree higher than two. Spatial databases. An overview of Client-Server architecture 5. and type constructors. familiarize with the data-warehousing and data-mining techniques and other advanced topics. XML applications. Implementation issues. Super classes. Replication. Database schema design for OODBMS. Deductive databases and Page of 48 18 . Document schema. An overview of SQL3. and allocation techniques for distributed database design. Transactions and Concurrency control. Distributed database concepts. Storage of XML data. Indexes for text data 6. ORDBMS 4. Databases on the Web and Semi Structured Data: Web interfaces to the Web. Joins. Persistent programming languages. Object Relational and Extended Relational Databases: Database design for an ORDBMS . The semi structured data model. Enhanced Data Models for Advanced Applications: Active database concepts. Sorting. Parallel and Distributed Databases and Client-Server Architecture: Architectures for parallel databases. Motivation for complex data types. Constraints and characteristics of specialization and Generalization. Implementation issues for extended type. OOAD. OODBMS. At the end of the course students should be able to: gain an awareness of the basic issues in objected oriented data models. Inheritance. learn about the Web-DBMS integration technology and XML for Internet database applications. Methods. 2. User defined abstract data types and structured types. Data fragmentation. Parallelizing individual operations. Type extents and queries. Object identity. Storage and access methods. Object structure. Object-Oriented Databases: Overview of Object-Oriented concepts. Example of ODBMS 3. Structure of XML data. Overview of XML. Type hierarchies and Inheritance. Complex objects. Querying XML data. Temporal database concepts. The Extended Entity Relationship Model and Object Model: The ER model revisited.

Implementation and Management”. McGraw-Hill. Design. “Fundamentals of Database Systems”. McGraw-Hill References: 1. Pearson Education TERM WORK 7. Silberchatz. Peter Rob and Coronel. Page of 48 19 . 2. Johannes Gehrke. “Introduction To Database Systems”. BOOKS Text Books: 1. Elmasri and Navathe. Raghu Ramakrishnan. C. Sudarshan . “Database System Concepts”. Thomson Learning. Mobile databases. Pearson Education 2.J. “Database Systems. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. 3. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. Korth. Longman.Date. Geographic information systems.Query processing. “Database Management Systems”.

Process problems and defect rates. Establishing a testing policy. Common computer problems.. Economics of testing. Dreamtech 2. Page of 48 20 . Life cycle testing concept. John Wiley. “Software Testing Techniques”. Functional testing and analysis 5. Design Phase Testing. Multi platform environment. Determining Software Testing Techniques: Testing techniques/tool selection process. Data Warehouse 9. “Introducing Software Testing”. Test analysis report documentation Books Text Books: 1.E. Software Testing Process: Access Project Management Development Estimate and Status. Boris Beizer. Falk J. Web based systems. Paper I. Perry. To provide a complete picture of the test activities and processes from requirements review to system implementation. Software testing process. Security. Off-the-self software. Selecting and using the test tools. Test Plan. Structural system testing techniques. John Wiley. System documentation. Building Test Document: Uses. Selecting and Installing Software Testing Tools: Testing tools-Hammers of testing. Verification and validation. Acceptance Test. The business perspective for testing 2. “Testing Computer Software”.M Sc – Information Technology Year II M Sc – Information Technology Year II. Workbench skills 7. Requirements Phase Testing. Workbench concept. Appointing managers for testing tools 6. RAD. Unit testing techniques. Structured approach to testing. Test strategy. Types. Functional system testing techniques. Discover good sources of information. Kaner C. “Effective Methods for Software Testing”. Pre-requisites: Software Engineering.. Introduction: Defect. References : 1. Nguyen H. Testing.its purpose and nature and raise your awareness of issues and constraints around testing. To provide a professional qualification widely recognized by employers. Storage. Pearson Education. Establishing a Software Testing Methodology: Introduction. Program Phase Testing. Functional and structural testing. Execute Test and Record Results. customers and peers. Testing methodology 3. Economics of SDLC testing. Louise Tamres. Report Test Result. Software Testing Process: Cost of computer testing. Responsibility. Test plan documentation.an organizational issue. 2. Defect Vs failures. To learn standard terminology. Selecting techniques/tools. Verification and validation in the software development process. Evaluate Test Effectiveness 8.. Test Software Change. W. Testing Specialized Systems and Applications: Client/Server systems. Term I SUBJECT: SOFTWARE TESTING Lectures: 4 Hrs per week Theory: 100 Marks Objectives To improve your understanding of software testing . OOAD DETAILED SYLLABUS 1. Building a Software Testing Strategy: Computer system strategic risk. Considerations in developing testing methodologies 4. Testing Software Installation.

Assignments: 10 assignments covering the syllabus has to be submitted Page of 48 21 .

References : 1. Authentication: Authentication basics. Risk analysis. “Security in Computing”. DETAILED SYLLABUS 1. 2. L. Pearson Education. Multilevel database. Speciner. “Network Security : A Beginner’s Guide”. Physical security. Software failures. Computer crime. Information and law. Example protocols: PEM. SSL. Program Security: Secure programs. Method of defense 2. Reliability and integrity. Attacks. P. “Cryptography And Network Security: Principles and practice” 2. Organizational security policies. Biometrics. Mattord. Operating System Security: Protected objects and methods of protection. Viruses and other malicious code. Pfleeger. “Network Security” 3. Macro Pistoia. Non-malicious program errors. Proposals for multilevel security 5.M Sc – Information Technology Year II. Challenge-response. Administrating Security: Security planning. TMH 4. Database Security: Security requirements. 7. Targeted malicious code. Kaufman. “Java Network Security “. C. Memory address protection. Networks and cryptography. Whitman. Network security control. Perlman. Firewalls. Pfleeger. Pearson Education 5. Thomson Assignments: 10 assignments covering the syllabus has to be submitted Page of 48 22 . Eric Maiwald. Privacy. Sensitive data. and Ethical Issues in Computer Security: Protecting programs and data. Paper I. Password. IPsec 6. Interface. Understand what puts you at a risk and how to control it. Control of access to general objects. Legal. Rights of employees and employers. Pre-requisites: Computer Networks. Case studies of ethics Books Text Books: 1. Stallings. Computer criminals. Matt Bishop. Operating system. Pearson Education. Security in Networks: Threats in networks. Controlling a risk is not eliminating the risk but to bring it to a tolerable level. Intrusion detection systems. “Principles of information security”. “Computer Security: Art and Science”. Term II SUBJECT: INFORMATION SECURITY Lectures: 4 Hrs per week Theory: 100 Marks Objectives of the course: Learn about the threats in computer security. Controls against program threats 3. Privacy. File protection mechanism. 4. Introduction: Security. Secure e-mail. and S. Ethical issues in computer society.

Cell Notation and the Internals (Almost) of Lisp. Pulse-Coded Signal functions 2. Concept learning. Defining Programs. Data Structures. The Isa Hierarchy. Machine learning and methodology of science. The brain as a dynamical system. Typing at Lisp. Fuzzy systems and applications. Pointers and Alternative Notations. Basic Flow of Control in Lisp. Visualization Page of 48 23 . Pointers. Input/Output. Reproduction . Paper II. Fuzzy systems as Structured Numerical estimators. Intelligent Behavior as Adaptive Model free Estimation. The two. Fitness scaling Applications of genetic algorithm. Atoms and Lists. More on Predicates. Frame Notation 2 Lisps Lisps. Properties. Neurons as functions. Basic Debugging. Symbolic vs Numeric Processing. Generalization and creativity. designing decision support systems. The building block hypothesis. Client server and data warehousing. Scope of Variables. Data Mining Introduction to Data Mining. Lisp Style. The Dynamical Systems approach to Machine Intelligence. Expert system Knowledge as rule trees. Introduction to Genetics based machine learning. The minimal Deceptive Problem Computer implementation of Genetic algorithm. Rules vs Principles. Other Kinds of Inference Indexing. Properties of Internal Representation. Data ware house. applications of genetic based machine leaning 3. Building Up List Structure. Neural and fuzzy systems as function Estimators. The Predicate Calculus. Computer systems that can learn. Knowledge Discovery Process. Neural Networks as trainable Dynamical system. Generating Fuzzy rules with product space Clustering. Cross over and Mutation. Representation in AI. Neural Network Theory Neuronal Dynamics: Activations and signals. Improvement in basic techniques. Predicates and Arguments. Learning as change. Time to reproduce and time to Cross Mapping objective function to fitness form. Slot-Assertion Notation.Recursion. similarity templates(Schemata). Macros 3. Biological Activations and signals. Mathematical foundations.armed and k-armed Bandit Problem. signal monotonicity. Fuzzy systems as Principle based Systems 1. Neuron Fields. De Jong and Function Optimization. Common signal functions. Schema Processing at work. How to Use the Predicate Calculus. Connectives Variables and Quantification. Neuron Dynamical Systems. Genetic Algorithms A simple genetic algorithm. Neural Networks and Fuzzy systems Neural and fuzzy machine Intelligence. Term I SUBJECT: Artificial Intelligence Lectures: 4 Hrs per week Theory: 100 Marks 1 AI and Internal Representation Artificial Intelligence and the World. Indexing. A simulation by hands. The for Function .M Sc – Information Technology Year II. Destructive Modification of Lists. Symbol vs Numbers. Fuzziness as Multivalence. Fuzzy Systems as Parallel associators.

K. Introduction to Artificial Intelligence By Eugene Charniak. OLAP tools. Optimization & Machine Learning by David E Goldberg-Addison wesley 4. Real life applications. Data Warehousing in the Real World by Sam Anahory and Dennis Murray. Neural networks.Techniques. Customer profiling. Setting up a KDD environment. Genetic Algorithms in search. Discovering foreign key relationships Assignments 10 assignments covering the syllabus has to be submitted Text book 1. Neural Networks and fuzzy systems A dynamical systems approach to machine Intelligence by Bart Kosko. Decision trees.PHI 3. Drew McDermottAddison Wesley 2. Data Mining by Pieter Adriaans and Dolf Zantinge – Pearson Education Asia 5. Addison –Wesley Page of 48 24 . Genetic algorithm.nearest neighbor.

chose. “Robotics and Control”. Negin. Co-ordinate frames. PHI. Fine-motion Planning. TMH Page of 48 25 . Pick and place operations. Continuous path motion. Space. McGraw Hill 3. Inverse Kinematics: General properties of solutions tool configuration Five axis robots. Principles of NC and CNC Machines. Pearson Education References: 1. Task planner simulation. 2. Four axis robot. Source and goal scenes. Homogeneous. 7. Rotations. 4. 2. 6. Perspective transformation. Configuration. Task Planning: Task level programming. 4. Notations. Swell operators. TMH. Six axis robot (Inverse kinematics). Interpolated motion. “Industrial Robotics”. Polyhedral objects. and incorporate robots in engineering systems. Structured Illumination. 5. Chmielewski. Klafter. Three-Four axis. Gross motion. BOOKS Text Books: 1. J. Craig.J. Robert Shilling. Straight-line motion. “Introduction to Robotics”.M Sc – Information Technology Year II. McGraw Hill 3. Walfram Stdder. Mittal. Exposure to programming in a high level language DETAILED SYLLABUS 1. Staughard. Pearson Education 5. Camera calibration). Workspace analysis and trajectory planning work envelop and examples. Robotic Manipulation: Automation and Robots. Nagel. “Robotics and Mecatronics”. Application. Moments of Inertia. Shrink operators. Grasp planning. Six axis robot). 2. Gonzales and Lee. Term II SUBJECT: ROBOTICS Lectures: 4 Hrs per week Theory: 100 Marks Objective: The goal of the course is to familiarize the students with the concepts and techniques in robot manipulator control. Niku. Nagrath. Co-ordinates. Fu. Planning. Template matching. 8. Direct Kinematics: Dot and cross products. Segmentation (Thresholding. enough to evaluate. region labeling. workspace fixtures. “Robotics”. Wiess. Specification. “Robotics and AI”. Link co-ordination arm equation. Simulation of Planer motion. (Five-axis robot. Pre-requisite: Exposure to linear algebra and matrix operations. PHI. “Fundamentals of Robotics-Analysis and control”. Euler numbers. Paper II. “Robot Engineering”. PHI 6. Robot Vision: Image representation. “Introduction to Robotics”. Oderey. Grover. Shane analysis. 3. Classification. Uncertainty.

Assignments: 10 assignments covering the syllabus has to be submitted Page of 48 26 .

Introduction: Parallel Processing Architectures: Parallelism in sequential machines. Elective I. “Introduction to Parallel Processing”. C-Linda 8.J. TMH References: 1. Memory allocation and management. 2. Data Dependency Analysis: Types of dependencies loop and array dependences. Programmability Issues: An overview. Types of operating systems. Interface. Operating system support. Debugging message passing parallel programs. Pipelining. Parallel programming models. Jorden H. Multiprocessor architecture. M. A. Probabilistic algorithms 6. Input output subsystems 10. Quadrature problem.. Parallel Programming languages: Fortran90. “Fundamentals of Parallel Processing” 3. Matrix multiplication.M Sc – Information Technology Year II. nCUBE C. Occam. Model. “Computer Architecture and Parallel Processing”. recognize problems and limitations to parallel systems. GustafsonBarsis’s law. Message Passing Programming: Introduction. Shared Memory Programming: General model of shared memory programming. Process model under UNIX 5. Parallel reduction. Shasikumar M. Array processors. Histogram computation. and Alaghaband G. Cache memories and management. F. Benchmarking parallel performance 7. Data structures DETAILED SYLLABUS 1. Memory and I/O Subsystems: Hierarchical memory structure. Term I SUBJECT: PARALLEL PROCESSING Lectures: 4 Hrs per week Theory: 100 Marks Practical: 4 Hrs per week Term Work / Practical: 50 Marks Objective: Upon completion of this course students will be able to understand and employ the fundamental concepts and mechanisms which form the basis of the design of parallel computation models and algorithms. Cache allocation and management. Other Parallelism Paradigms: Data flow computing. Loop dependence analysis. Karf-Flatt metric.. Complexity and cost. Parallel sorting algorithms. Functional and logic paradigms. Introducing collective.. Amdahl’s law. Isoefficiency metric BOOKS Text Books: 1. as well as possible solutions Pre-requisite: Computer architecture. McGraw Hill 2. Performance of Parallel Processors: Speedup and efficiency. Distributed shared memory 11. Systolic architectures. Circuit satisfiability. Abstract model of parallel computer. “Parallel Programming”. Solving linear systems. Solving diophantine equations. Hawang Kai and Briggs F. Quinn. Software tools 3. Program transformations 4. Virtual memory system. Debugging Parallel Programs: Debugging techniques. Debugging shared memory parallel programs 9. PHI Page of 48 27 . Algorithms for Parallel Machines: Speedup.

Singh.2. Morgan Kaufman TERM WORK 8.. E. D. Page of 48 28 .P.V. “Practical Parallel Programming”. A. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. J. Culler. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. Wilson G. “Parallel Computer Architecture”. Gupta. PHI 3.

BOOKS Text Books: 1. Consistency protocols. DCOM. Software agent. 7. Distributed File System: Sun network file system. Servers. 3. and T. 10. Communication: Layered protocols. N. Examples of distributed systems. Security management. Processes: Threads. “Distributed Systems: Principles and Paradigms” 2. 5. Introduction to Distributed System: Goals. Elective I. Distributed COM. Shivaratri. 2. 9. “Distributed Systems: Concepts and Design”. Consistency and Replication: Introduction. J. and Client-Server model. Comparison of CORBA. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. Singhal. Security: Introduction. Distributed transactions. Secure channels. Remote procedures call. Process resilience. Pearson Education References: 1. 8.M Sc – Information Technology Year II. Reliable client server communication. Client centric consistency models. Case Study: CORBA. Synchronization: Clock synchronization. Locating mobile entities. 6. Recovery. Data centric consistency models. Removing un-referenced entities. TMH TERM WORK 9. Pre-requisites: Operating Systems and Computer Networks DETAILED SYLLABUS 1. Page of 48 29 . Coulouris. Code Migration. “Advanced Concepts in Operating Systems”. Election algorithms. Message-oriented communication. Kindberg. Taunenbaum. Dollimore. Hardware concepts. Reliable group communication. Access control. and Globe. Stream-oriented communication. Clients. The design issues and distributed operating system concepts are covered. G. CODA files system. Term II SUBJECT: DISTRIBUTED COMPUTING Lectures: 4 Hrs per week Practical: 4 Hrs per week Theory: 100 Marks Term work / Practical: 50 Marks Objective: This course aims to build concepts regarding the fundamental principles of distributed systems. Global state. Logical clocks. Naming: Naming entities. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. Fault Tolerance: Introduction. Globe. Remote object invocation. Distributed commit. Software concepts. Mutual exclusion. Distribution protocols. 4. M. A.

Forward and backward chaining. and Algorithms DETAILED SYLLABUS 1. Harcourt Asia Page of 48 30 . Intelligent Agents: How agent should act. Struart Russell and Peter Norvig. “Artificial Intelligence: A New Synthesis”. Representing and using domain knowledge. Representing knowledge in an uncertain domain. Nils J. Game playing 4. Programming Languages. Inference in belief networks 9. Application of ANN. Types of communicating agents. Proportional logic. Interfacing First Order Logic: Interface rules involving quantifiers. Genetic algorithms 10. An example proof. 2. methodologies and techniques in design and implementation of intelligent system. Perception. Informed search methods. Structure of intelligent agents. Completeness 7. Generalization in reinforcement learning.Luger. Knowledge and Reasoning: A knowledge based agent. Pearson Education References: 1. Reinforcement learning: Passive learning in a known environment. First order logic: Syntax and Semantics. Reasoning. Expert system: Introduction to expert system. Multilayer feed-forward network. Expert system shells. Hierarchical decomposition. Intelligent Systems: Evolution of the concept. Building a Knowledge Base: Properties of good and bad knowledge base. Explanation. Nillson. Extensions and Notational variation. “Artificial Intelligence: Structures and Strategies for Complex Problem Solving”. General ontology 6. A formal grammar for a subset of English 11. Perceptrons. Uncertain Knowledge and Reasoning: Uncertainty. Learning in neural and belief networks: Introduction to neural networks. Using first order logic 5. Knowledge engineering. Agents that Communicate: Communication as action. Learning: Learning from observations: General model of learning agents. Representation. The wumpus world environment. Conditional planning 8. Inductive learning. Environments 3. Prerequisite: Data Structures.M Sc – Information Technology Year II. Problem Solving: Solving problems by searching. Knowledge acquisition 12. “Artificial Intelligence: A Modern Approach” 2. Robotics BOOKS Text Books: 1. Practical planning: Practical planners. Elective I. George F. Artificial Intelligence: An overview. Applications: Natural language processing. Acting Logically: Planning. Logic. Term I SUBJECT: INTELLIGENT SYSTEMS Theory: 100 Marks Lectures: 4 Hrs per week Practical: 4 Hrs per week Term Work/ Practical: 50 Marks Objectives: To understand and apply principles. The semantics of belief networks. learning decision trees.

5.2. Sasikumar and Others. “Decision Support Systems and Intelligent Systems” Ed. 3. “Artificial Intelligence : Theory and Practice” Proceedings of the International Conference KBCS-2002. Pearson Education Efraim Turban Jay E. “Artificial Intelligence”. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. 4. M. 6. Vikas Publishing House TERM WORK 10. “Prolog Programming for Artificial Intelligence”. Elaine Rich and Kevin Knight. Page of 48 31 . “Artificial Intelligence”. TMH Patrick Winston.Aronson. Pearson Education Ivan Brakto.

. fuzzy logic systems and their applications. PHI 2.M. Multilayer Perceptron: Derivation of the back-propagation algorithm.M Sc – Information Technology Year II. C++ DETAILED SYLLABUS 1... Learning process: Error-correction learning.. Learning Factors. Jaico publishers 3. Membership functions. Thimothy J.C. 6. BOOKS Text Books: 1. McGraw Hill 4. 3. Introduction: Biological neurons. 4. “Introduction to Artificial Neural Systems. theorem and the reparability of patterns. spurious states. 5. Yegnanarayana B. Hellendoorn H. “Fuzzy Logic with Engineering Applications”. Term II SUBJECT: NEURAL NETWORKS & FUZZY SYSTEMS Lectures: 4 Hrs per week Theory: 100 Marks Practical: 4 Hrs per week Term Work/Practical: 50 Marks Objective: This course covers basic concepts of artificial neural networks. Fuzzy logic: Fuzzy sets. Page of 48 32 . Java. Bidirectional Associative Memory. Elective I.L. Hopfield networks: energy function. Pearson Education 2. Fuzzy measures. 2. McCulloch and Pitts models of neuron. Fuzzy controllers. Properties. Operations on fuzzy sets.. IEEE Press TERM WORK 11. error performance . RBF learning strategies. “Fuzzy Systems Design Principles”. Boltzmann learning rule. “Neural Network a . Method of steepest descent least mean square algorithms. Its focus will be on the introduction of basic theory. Learning Rules. & Reinfrank M. The extension principle.. Fuzzification and defuzzification methods. “An Introduction to Fuzzy Control”. algorithm formulation and ways to apply these techniques to solve real world problems. and basic probability and statistics are required. Supervised learning. Types of activation function. Operations on fuzzy relations. Simon Haykin. Ross. Radial Basis and Recurrent Neural Networks: RBF network structure. and Trubatch S. K-means and LMS algorithms. MathCad. PHI References: 1. Unsupervised learning. Ahmad Ibrahim. Fuzzy relations. Programming skills in one of the following would be desirable: Matlab. Network architectures. Simulated Annealing: The Boltzmann machine. Berkan R. Knowledge representation. comparison of RBF and MLP networks. C. Driankov D. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. Pre-requisite: Knowledge of calculus. Single Layer Perceptron: Perceptron convergence theorem. Background in the following subjects desirable: numerical analysis (including optimization).Comprehensive Foundation”. Norosa Publishing House 3. “Introduction to Applied Fuzzy Electronics”. Zurada J. “Artificial Neural Networks”.

Page of 48 33 .ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus.

Inverse Ztransform. Discrete Fourier Transform: Frequency domain sampling. Linear filtering method based on DFT. 8. Z-Transform: Definition and Properties of Z-transform. Structure of IIR systems.M Sc – Information Technology Year II. 3. “Digital Signal Processing”. frequency transformations. image Enhancement. L.” Fundamentals Of Digital Signal Processing”.W. B. 2. and noninvasive medical imaging. Discrete-time systems described by differential equations. “Discrete Time Signal Processing” References: 1. S. T. Correlation of discrete-time systems 2. Properties of DFT.J. Properties of FIR digital filters. 7. Frequency domain characteristics of LTI systems. Rational Z-transforms. Ifeachor.K. one-sided Z-transform. Quantisation effects in the computation of DFT 5. Frequency analysis of signals using DFT. Term I SUBJECT: DIGITAL SIGNAL PROCESSING Lectures: 4 Hrs per week Theory: 100 Marks Practical: 4 Hrs per week Term Work/Practical: 25 Marks Objective: Digital Signal Processing continues to play an increasingly important role in the fields that range literally from A (astronomy) to Z (zeugmatography. Jervis. Inverse systems and deconvolution 4. Goertzel algorithm. “Introduction to Digital Signal Processing”. Frequency Analysis of Signals and Systems: Frequency analysis: Continuous time signals and Discrete-time signals. 4. Analysis of LTI systems in Z-domain 3. LTI system as a frequency selective filter. geophysical exploration. Design of Digital Filters: Design of FIR filters. Speech Recognition. Applications : Image processing.C. FFT algorithm. Design of IIR filters from analog filters. Speech. Oppenhiem and Schaffer. Telecommunication BOOKS Text Books: 1. “Digital Signal Processing”. Cavicchi. TMH. PHI 2.G. Pre-requisites: Nil DETAILED SYLLABUS 1. Design of FIR filters using windows. Control. and Linear phase filters. echo cancellations in communication systems. E. Introduction to DSP co-processors: TMS 320C40/50. Comparison of IIR and FIR filters. John Wiley. Elective I. or magnetic resonance imaging) and encompass applications such as Compact Disc player. Analysis of discrete-time LTI systems. round-off effects in digital filters 6. Audio. Discrete Time Signals & System: Discrete–time signals. Discrete–time systems. System Transforms and Filters. Ludeman. This course aims to build concepts regarding the fundamental principles and applications of Signals. Pearson Education. Proakis. Properties of the Fourier transform for discrete-time signals. Mitra. Implementation of discrete-time systems. J. quantization of filter coefficients. Implementation of Discrete Time Systems: Structure of FIR systems. Page of 48 34 . John Wiley.C. Analog Devices. Design of digital filters based on least-squares method digital filters from analogue filters. Applications of FFT. “Digital Signal Processing”.

Thompson Learning. TERM WORK 12. Page of 48 35 . Ashok Ambardar. 6. S Sallivahanan. “Analog and Digital Signal Processing”. TMH. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. “Digital Signal Processing”.5. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus.

Detecting Errors With Checksums. Limitations of Real Hardware. LAN Topologies. Multicast Addressing. Geosynchronous Satellites. Interpreting A Ping Response PART I DATA TRANSMISSION Transmission Media Copper Wires. Complexity in Network Systems. Microwave. Identifying Packet Contents. Probing the Internet. Radio Frequency. Glass Fibers. Frame format And Error Detection Mechanisms LAN Technologies and Network Topology Direct Point-To-Point Communication. Collision Detection and Back off With CSMA/CD. Growth of the Internet. Packets and Hardware Frames. Radio. Combining Building Blocks. Low Earth Orbit Satellite Arrays. Bus Network: Ethernet Carrier Sense on Multi-Access Networks (CSMA). Probability. Term I SUBJECT: Enterprise Networking Lectures: 4 Hrs per week Theory: 100 Marks Practical: 4 Hrs per week Term Work/Practical: 25 Marks Introduction Growth of Computer Networking. Time Division Multiplexing PART II PACKET TRANSMISSION Packets. Mastering the Complexity. Broadcasting. Light Form a Laser Local Asynchronous Communication The Need for Asynchronous Communication. Network Analyzers Page of 48 36 . Detecting Errors With Cyclic Redundancy Checks. Hardware Bandwidth and the Transmission of Bits. Significance of LANs and Locality of Reference. Using Electric Current to Send Bits. Using Networks That Do Not Have SelfIdentifying Frames. Mathematics And Error Detection. Shared Communication Channels. Full Duplex Asynchronous Communication. Bus Network: Local Talk Hardware Addressing and Frame Type Identification Specifying a Recipient. Packets and Time-Division Multiplexing. Significance for Data Networking Long-Distance Communication (Carriers. Transmission Errors. and Errors. Burst Errors. Standards for Communication. Carrier Frequencies and Multiplexing. Leased Analog Data Circuits. Infrared. Byte Stuffing. And Dialup Modems. Framing. The Effect of Noise On Communication. Spread Spectrum. Frames and Error Detection The Concept of Packets. Satellites. Parity Bits and Parity Checking. Baud Rate. Wireless LANs And CSMA/CA. Base band And Broadband Technologies Wave Division Multiplexing. Optical. Elective I. Modulation and Modems) Sending Signals across Long Distances. Resource Sharing. Modem Hardware Used for Modulation and Demodulation.M Sc – Information Technology Year II. How LAN Hardware Uses Addresses to Filter Packets Format of a Physical Address. Frame Headers And Frame Format. Low Earth Orbit Satellites. Multicasting.

Combining Switches And Hubs. the Connection between A NIC and A Network. Extending LANs: Fiber Modems. and Interface Hardware Speeds of LANs and Computers. Repeaters. PHI Networking Technology. Use of Defaults Routes. Intermediate Capacity Digital Circuits Highest Capacity Circuits. Planning a Bridged Network. Douglas E. Protocol Suites. Bridging Between Buildings. Thin Ethernet Wiring Twisted Pair Ethernet. ISDN. Upstream Communication. and Performance Network Ownership. Service Paradigm. Virtual Private Networks. Cable Modem Technology. Optical Carrier Standards. Stacks: Layered Software. Addresses and Connection Identifiers. REFERENCE Computer Network. Repeaters. Synchronous Communication. the C Suffix. Shortest Path Computation in a Graph. Multiple. Telephone Standards DS Terminology and Data Rates. Store and Forward Physical Addressing In A WAN. the Local Subscriber Loop. Network Interface Hardware. Fiber Optic Extensions. the Topology Paradox. Physical Topology. How Layered Software Works. TERM WORK Term work should consist of at least 10 assignments from the aforementioned topics. Nested Headers. Bertsekas. Source Independence. A Seminar to be presented by each student as part of term works carrying 15 marks. PHI Computer Networks and Internets. the Seven Layers. Service Paradigm. Comer Pearson Education Asia Page of 48 37 . Tuekeun. Jaiswal. Connection Duration and Persistence. Routing Table Computation. Synchronous Optical Network (SONET). Asymmetric Digital Subscriber Line Technology Other DSL Technologies. A Plan for Protocol Design.LAN Wiring. Bridges and Switches Distance Limitation and LAN Design. Forming A WAN. Lower Capacity Circuits. Frame Filtering Startup and Steady State Behavior of Bridged Networks. A Cycle Of Bridges. Examples of Service Paradigms. Distance Vector Routing Network Ownership. Bridging Across Longer Distances. Routing In A WAN. Switching. Packet Switches. Hybrid Fiber Coax Wan Technologies and Routing Large Networks and Wide Areas. Galgotia. Connection Multiplexing. Network Performance Characteristics Protocols and Layering The Need for Protocols. Bridges. Digital Circuits and DSU. Next-Hop Forwarding. Bridging And Switching With Other Technologies Long-Distance Digital Connection Technologies Digital Telephony. Relationship of Hierarchical Addresses to Routing. Distributed Spanning Tree. the Scientific Basis for Layering. Data Networking. Original Thick Ethernet Wiring. Network Interface Cards and Wiring Schemes. Distributed Route Computation.

kn-Nearest-Neighbor estimation. Probability and Statistics DETAILED SYLLABUS 1. Unsupervised Learning and Clustering: Mixture densities and Identifiability. Unsupervised Bayesian learning. Gramatical methods. ID3. Term I SUBJECT: PATTERN RECOGNITION Theory: 100 Marks Term Work: 25 Marks Oral: 25 Marks Objective: This course teaches the fundamentals of techniques for classifying multidimensional data. Design cycle. Discriminant functions for normal density. image processing. and Stock.M Sc – Information Technology Year II. Minimumerror rate classification. Ho-Kashyap procedures. Algorithm Independent Machine Learning: Lack of inherent superiority of any classifier. Introduction: Machine perception. Nearest-Neighbor rule. 2. such as engineering system design. Hart. Duda. Nonmetric Methods: Decision tree. Application to normal mixtures. Bayesian Decision Theory: Bayesian decision theory: Continuous features. C4. Hierarchical clustering 9. Prolems of dimentionality. Resampling for estimating statistic. Gose. Matrics and Nearest-Neighbor classification 5. Combining classifiers 8. Pre-requisite: Linear Algebra. Johnsonbaugh and Jost. Bayes Decision theory: discrete features 3. Nonparametric Techniques: Density estimation. Relaxation procedure. MaximumLikelihood estimations. Pattern recognition systems.5. Learning and Adaptation 2. Estimating and comparing classifiers. manufacturing. PHI Lectures: 4 Hrs per week Practical: 2 Hrs per week Page of 48 38 . Generalised linear discriminant functions. Parzen windows. technical and medical diagnostics. Gramatical interfaces 7. “Pattern Recognition and Image analysis”. Bayesian parameter estimation: Gaussian caseand General theory. Hidden Markov Model 1. classification. Non-separable behavior. Resampling for classifier design. CART. psychology. John Wiley and Sons. Multicategory generalizations 6. Linear Discriminants Functions: Linear discriminant functions and decision surfaces. Minimising the Perceptron criterion function. Applications of Pattern Recognition BOOKS Text Books: 1. Bayesian estimation. Elective II. 2-Category linearly separable case. Classifiers. Maximum-Likelihood and Bayesian Parameter Estimation: Maximum likelihood estimation. to be utilized for problem-solving in a wide variety of applications. economics. Normal density. Discriminant functions and Decision surfaces. “Pattern Classification”. Bias and Variance. Data description and clustering criterion function for clustering. Minimum squared error procedure.

TERM WORK 13. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. Page of 48 39 . Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus.

17. Curve fitting (Least-square fitting). Schunk. View class matching. 16. Inverse perspective Projection. Segmentation.structural matching. “Image Processing.M Sc – Information Technology Year II. Forsyth. Perspective Projective geometry. Ordered. Control-strategies. Recognition Methodology: Conditioning. Models database organization. Labeling. Local features. Region Analysis: Region properties. Line-Linking. Edge. Classification of shapes by labeling of edges. Shape numbers. 13. and Machine Vision” Thomson Learning 2. Analysis. Spatial moments. Jain. Grouping. and B. Matching of 2D image. Edge detection. 10. Region growing. “Computer Vision: A Modern Approach” 2. Understanding line drawings. Models database organization. Line fitting. Thinning. Robert Haralick and Linda Shapiro. 1993. methods and concepts which will enable the student to implement computer vision systems with emphasis on applications and problem solving Pre-requisite: Introduction to Image Processing. Facet Model Recognition: Labeling lines. Global vs. 14. Consisting labeling problem. “Computer and Robot Vision”. “Machine Vision”. Labeling of connected components. David A. 12. Term II SUBJECT: COMPUTER VISION Lectures: 4 Hrs per week Theory: 100 Marks Practical: 4 Hrs per week Term Work/Practical: 50 Marks Objective: To introduce the student to computer vision algorithms. II. Hough transform. McGraw-Hill. BOOKS Text Books: 1. R. Object Models And Matching: 2D representation. General Frame Works For Matching: Distance relational approach. Jean Ponce. region shrinking. AddisonWesley. References: 1. Recognition of shapes. Split & merge. Area Extraction: Concepts. Vol I. Rule-based Segmentation. Extracting. Connected component labeling. Elective II. Boundary analysis: Signature properties. Image matching : Intensity matching of ID signals. General Frame Works: Distance –relational approach. Milan Sonka. Hierarchal segmentation. Hierarchical image matching. Page of 48 40 . Spatial clustering. Ordered –Structural matching. DETAILED SYLLABUS 9. Motion-based segmentation. Gradient based operators. View class matching. Binary Machine Vision: Thresholding. Mixed spatial gray-level moments. 11. Roger Boyle. Data-structures. Photogrammetry – from 2D to 3D. Morphological operators.Vaclav Hlavac. 15. Kasturi. Matching. External points. Knowledge Based Vision: Knowledge representation. Spatial operators for edge detection. Information integration. Backtracking. R. G.

TERM WORK 14. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. Page of 48 41 . Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus.

Matt Bishop. Operating system. Database Security: Security requirements. Understand what puts you at a risk and how to control it. “Java network security “. Elective II. John Wiley. Operating System Security: Protected objects and methods of protection. Intrusion detection systems. Kaufman. Key Management: Key exchange. 9. Security in Networks: Threats in networks. 12. Organizational security policies. L. Pre-requisites: Computer Networks. DES. Administrating Security: Security planning. Challenge-response. Password. Example protocols: PEM. Pfleeger. Stream and block ciphers: AES. “Applied Cryptography”. Interface. Speciner. Pearson Education 10. Software failures. Secure e-mail. Bruce Schneier. 15. Thomson Page of 48 42 . Pearson Education. Macro Pistoia. Pfleeger. Information and law. Method of defense 9. RC4. Public key Cryptography. Pearson Education. File protection mechanism. Storing and revoking keys. Targeted malicious code. “Computer Security: Art and Science”. Program Security: Secure programs. 10. Key generation. Proposals for multilevel security 13. Stallings. Privacy. Controlling a risk is not eliminating the risk but to bring it to a tolerable level. SSL. Networks and cryptography. Perlman. C. TMH 8. “Cryptography And Network Security: Principles and practice” 4. Authentication: Authentication basics. Controls against program threats 11. Eric Maiwald. Biometrics. Reliability and integrity. “Security in Computing”. Cryptography: Basic Cryptography: Classical Cryptosystems.M Sc – Information Technology Year II. Mattord. Cipher Techniques: Problems. IPsec 14. Firewalls. Digital signature. 5. Computer criminals. “Principles of information security”. Sensitive data. Whitman. Control of access to general objects. Privacy. Physical security. Multilevel database. Network security control. and Ethical Issues in Computer Security: Protecting programs and data. Memory address protection. Attacks. Cryptographic key infrastructure. “Network Security” 7. Cryptographic checksum. Ethical issues in computer society. Hash algorithm. P. Term I SUBJECT: SYSTEM SECURITY Lectures: 4 Hrs per week Theory: 100 Marks Practical: 4 Hrs per week Term work/Practical: 50 Marks Objectives of the course: Learn about the threats in computer security. “Network Security : A Beginner’s Guide”. Viruses and other malicious code. Legal. References : 6. Risk analysis. Case studies of ethics Books Text Books: 3. and S. DETAILED SYLLABUS 8. Introduction: Security. Non-malicious program errors. Rights of employees and employers. Computer crime.

ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus.TERM WORK 15. Page of 48 43 .

flight dynamics of an aircraft Human factors The eye. shading algorithms. science. shape and object inbetweening. colour theory. Education. training Future Virtual Environment. Modelling transformations. Head-coupled displays. realism. Collision detection A generic VR Systems The virtual Environment.Pearson Education Asia Page of 48 44 . Human vision. Integrated VR Systems Virtual Reality Software Modelling Virtual worlds. 3D space curves. simple pendulums. scientific land marks 3D Computer graphics The virtual world space. VR systems Animating the Virtual Environment Dynamics of numbers. Benefits of virtual reality. VR tool kits Virtual Reality Applications Engineering. positioning the virtual observer. Acoustic hardware. Entertainment. Historical perspective. simple 3D modelling. Term II Subject: Virtual Reality and Virtual Environment Lectures: 4 Hrs per week Theory: 100 Marks Practical: 4 Hrs per week Term work/Practical: 50 Marks Real time computer graphics.M Sc – Information Technology Year II. Projectiles. rotating wheels. the animation of objects. springs. Modes of Interaction Text Books Virtual Reality Systems John Vince. 3D clipping. radiosity. 3D boundary representation. picking flying. the somatic senses. Modes of Interaction. Geometrical Transformations Frames of reference. free-form deformation. virtual environment. Evolution of Virtual Reality. The ear. the perspective projection. hiddensurface removal. Stereo perspective projection. Equilibrium Virtual Reality Hardware Sensor hardware. instances. particle systems Physical Simulation Objects falling in a gravitational field. Elastic collisions. Elective II. The computer environment. Flight simulation. Physical simulation. illumination models. Scaling the VE. VR Technology. stereographic images Geometric modelling From 2D to 3D.

The challenges The convergence of computers. industry perspective of the future. Designers perspective. New OS support. and the User Interface Client control of continuous multimedia. ITU-T Recommendations. Net work services. and protocols.based Retrieval of Unstructured Data Multimedia presentation and Authoring Design paradigms and User interface. regulatory. research trends Multimedia Services over the Public Networks Requirements. The role of Standards. Device control.M Sc – Information Technology Year II. DVI Technology Operating System Support for Continuous Media Applications Limitation of Work station Operating system. Digital Audio signal processing. Video performance Measurements. Emerging applications. toolkits. hyperapplications Multimedia File systems and Information Models The case for multimedia information systems. Psychoacoustics. Technical. barriers to wide spread use. Digital representation of sound. The EPEG Motion Video Compression Standard. video equipments. digital audio and the computers Video Technology Raster Scanning Principles. The file system support for continuous Media. Elective III. Media stream protocol Multimedia Devices. Hybrid Devices. Speech recognition and generation. Temporal coordination and composition. World wide television standards Digital Video and Image Compression Video compression techniques. Data models for multimedia and Hypermedia information. Analog video Artifacts. Multimedia system services Architecture. transmission of digital sound. standardization of Algorithm. Colour Fundamentals. Architecture. Multimedia and personalised computing. and QOS Architecture. Communications. Experiments Using Real Time Mach Middleware System Services Architecture Goals of Multimedia System services. A frame work for Multimedia systems Digital Audio Representation and processing Uses of Audio in Computer Applications. Digital music making. The JPEG Image Compression Standard. Sensors for TV Cameras. Hypertext and Collaborative research. Key challenges ahead. Multimedia appliances. Presentation Services. Multimedia on the map. Term I Subject: Multimedia systems and convergence of technologies Theory: 100 Marks Lectures: 4 Hrs per week Practical: 4 Hrs per week Term work/Practical: 50 Marks Multimedia systems and convergence of technologies Defining the scope of multimedia. Colour Video. Synchronization. and entertainment products The technology trends. Social Architectures and issues for Distributed Multimedia systems Distributed Multimedia systems. applications Multimedia Interchange Page of 48 45 . Content.

MHEG (Multimedia and Hypermedia Information Encoding Expert Group). Knowledge based Multimedia systems. Requirements of Multimedia Communications. Track model and Object model. Format Function and representation. Shared Application Architecture and embedded Distributed objects. High Definition Television and desktop computing. QMFI. Anatomy of an Intelligent Multimedia system Text Book Multimedia Systems by John F.Quick time Movie File Format. Real Time Interchange Multimedia conferencing Teleconferencing Systems. Multimedia Conferencing Architecture Multimedia Groupware Computer and Video fusion approach to open shared wok place. Koegel Buford. HDTV standards.Pearson Education Page of 48 46 .

Java Virtual machine-Platform independentportability-scalability Operators and expressions-decision making. Example of Interaction with a Browser RPC and Middleware Programming Clients and Servers. The MIP and Object Names. JDK. T M H Computing concepts With JAVA2. images. internationalization. Managing files and streams Java Technology for Active Web Documents An Early Form of Continuous Update. java 2d graphics. JavaScript. Patrick Naughton. Invoking an Applet. UDP Sockets. Elective II. Middleware and Object-Oriented Middleware Network Management (SNMP) Managing an Internet. java security. commerce and java wallet. BPB Java2 The complete Reference. Network Management Software. RPC Paradigm. Term I SUBJECT: Java Technology Lectures: 4 Hrs per week Theory: 100 Marks Practical: 4 Hrs per week Term work/Practical: 50 Marks Java Programming Object oriented programming revisited. Remote Procedure Call Paradigm. PHI JAVA 2 complete. Remote method serialization. JDBC: Java Data Base Connectivity. Java beans. Java interface to CORBA. Objects and methods. Cay Horstmann. Servelets TERM WORK Term work should consist of at least 06 assignments including debugged java source code for the applications from the aforementioned topics. Fetch-Store Paradigm. Arrays Strings and Vectors. Data structures and java utilities. java. Using Java Graphics on a Particular Computer. JAVA. Active Document Representation and Translation. Communication Stubs. Simple Network Management Protocol. Sybex. REFERENCE Using JAVA 2. Active Documents and Server Overhead. TCP Sockets. JFC-JAVA foundation classes. Java Media Framework. Interfaces. The Variety of MIB Variables. WILEY Page of 48 47 . The Danger of Hidden Features. Managers and Agents.M Sc – Information Technology Year II. A Seminar to be presented by each student as part of term work carrying 15 marks.net. Communication and Networking. The Java Library A Graphics Toolkit. Classes.COM Integration. Applet programming. MIB variables that correspond to arrays Java technologies Graphics. Clients. Packages. Servers. External Data Representation. branching. the Java Run-Time Environment. managing errors and exceptions. MultiThreading. Java Interpreters and Browsers Compiling a Java Program. swing. Java Technology. Object serialization. looping. Joseph L weber.

JSP Java Server Pages. servlets. swing. Aaron Walsh. IDG Books India(p) Ltd Java2. Barry Burd. IDG Books India(p) Ltd Java2 Programming Bible. JDBC & JAVA Beans Programming Black Book Steven Holzner dreamtech press Page of 48 48 .

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master Your Semester with a Special Offer from Scribd & The New York Times

Cancel anytime.