This action might not be possible to undo. Are you sure you want to continue?
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
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
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
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
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
John Carson. “Simulation with Arena”. Page of 48 5 . Academic Press Harcourt India 5. Tag Gon Kim. PHI 4. Bernard Zeigler. Barry Nelson. “Discrete Event System Simulation” 2. Averill Law. W David Kelton. Randall Sadowski. “System Simulation with Digital Computer”. PHI 2. W. Term work should consist of at least 10 practical experiments/Assignments covering the topics of the syllabus. Donald W. McGRAW-HILL. McGRAW-HILL References: 1. “System Analysis and Modeling”. Herbert Praehofer. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. Body. Geffery Gordon. Deborah Sadowski. Jerry Banks. “System Simulation”. Simulation of pert network BOOKS Text Books: 1. David Nicol. “Theory of Modeling and Simulation”. TERM WORK 1. Narsing Deo. David Kelton.Simulation of super market. Academic Press 3. “Simulation Modeling and Analysis”.
CORBA components. Object lifecycle. concurrency control services. Classes and Objects in COM-DCOM: Introduction. Mapping objects to locations. Optimizations. 7. 8. Query interface types and properties. method invocations static and dynamic: IDL (Interface Definition Language) models and interfaces. lifecycle management. Using COM interface pointers. Class emulation. CORBA interface repository. Structure of CORBA IDL. Reasons to distribute for centralized objects. Apartments: Cross-apartments access. Interface in COM-DCOM: Introduction to interfaces. Overview of Object Web. Java Programming. Paper I.M Sc – Information Technology Year I. COM is mostly widely used object model for developing distributed and concurrent systems. Introduction to DCOM. Event. COM’s design takes into account both human nature and capitalism. 9. Overview of java. Object oriented system architecture. Pre-requisites: C++. client-server system architecture. Code sharing and reuse. Aim of this subject to study and learn COM and use COM to deploy such systems successfully. Optimizing query interface. 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. Concept of distributed object systems. OOAD DETAILED SYLLABUS 1. Transaction service features. Run time polymorphism. Overview of CORBA. OMG. 6. Classes and servers. multi tier system architectures. JAVA Interface: JNI interface with C++. Design of object oriented system architecture and component technology compound document. 11. 2. Interface and IDL. 3. VC++. Enterprise java beans. Introduction to object oriented systems: Preview of Object-orientation. CORBA’s self-describing data. persistent object service and CORBA security service. Object Web: web technologies interfacing with distributed objects over client server and distribute architecture. Instead of providing a solution based on almost religious academic dogma of object oriented programming. CORBA Services: Services for object naming. Page of 48 6 . CORBA: Introduction and concepts. Classes and IDL. architectural features. distributed objects in CORBA. 4. Introduction to distributed objects: Computing standards. 5. Overview of COM/DCOM and of an open doc. Separating interface and COM implementation. Component Object Model (COM) introduction: Com as better C++ software distribution. Dynamic linking. Object services and dynamic composition. Enterprise Java Beans 10. Interface definition language (IDL).
3. Rambug. Don Box. 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. Jason Pritchard. Pearson Education. Pearson Education TERM WORK 1. Page of 48 7 .BOOKS Text Books: 1. Booch. References: 1. Pearson Education. Jacobson. “Essential COM”. “Essential COM”. “COM and CORBA side by side”. “Enterprise Java Beans”. Pearson Education 2.
Networking. Physical layer. Medium Access Control: Motivation for a specialized MAC: Hidden and Exposed terminals. Multiplexing. SDMA. Handover requirements. Medium access control layer. Antennas. Backward handover. Medium access control Sublayer. it is widely predicted that within the next few years’ access to Internet services will be primarily from wireless devices. Slotted Aloha. Radio access layer: Requirements. Handover: Handover reference model. Such predictions are based on the huge growth in the wireless phone market and the success of wireless data services. 8. Addressing. Radio interface. PRMA packet reservation multiple access. Indeed.M Sc – Information Technology Year I. DECT: System architecture. System architecture. Information bases And Networking. Classical Aloha. Pre-requisites: Computer Networks. UTRA FDD mode. Introduction: Applications. Handover scenarios. This course will help in understanding fundamental concepts. Signals. Wireless ATM working group. Satellite Systems: History. Reservation TDMA. Bluetooth: User scenarios. Examples 6. Security. Reference model: Example configurations. Handover. Channel access control. FDMA. BRAN. MAC layer. Signal propagation. New data services. Localization And Calling. Routing. Radio transmission. Physical layer. Wireless ATM: Motivation for WATM. Physical layer. WATM services. UTRA TDD mode 5. ubiquitous wireless networks has made mobile computing a reality. Multiple access with collision avoidance. Demand assigned multiple access. Protocols. DETAILED SYLLABUS 1.11: System architecture. Localization. HIPERLAN: Protocol architecture. Spread spectrum. LEO. Location management: Requirements for location management. Polling. IEEE 802. Applications. Carrier sense multiple access. Mobile quality of service. Functions: Wireless mobile terminal side. Protocol architecture. A short history of wireless communication 2. CDMA: Spread Aloha multiple access. Basics: GEO. Infrastructure and Ad hoc Networks. UMTS and IMT-2000: UMTS Basic architecture. Telecommunication Systems: GSM: Mobile services. with desktop browsing the exception. Types of handover. TDMA: Fixed TDM. 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. current developments in mobile communication systems and wireless computer networks. Near and Far terminals. Sublayer. Protocol architecture. Access point control protocol Page of 48 8 . Handover. Mobility supporting network side. Link management. Digital video broadcasting 7. Wireless LAN: Infrared vs. MAC management. Future development. Cellular systems. Security. Wireless Transmission: Frequency for radio transmission. 3. Digital audio broadcasting: Multimedia object transfer protocol. Procedures and Entities. TETRA. Broadcast Systems: Overview. MEO. Modulation. Forward handover. Paper II. Generic reference model. Inhibit sense multiple access. 4. Cyclic repetition of data.
Transmission/time-out freezing. Mobile agents BOOKS Text Books: 1. P. Hypertext markup language. John Wiley 3. Richharia . Implications on mobility. Selective retransmission. “Mobile Satellite Communication: Principles and Trends”. “Wireless and Mobile Network Architectures”. Nicopolitidis . Optimizations. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. Dynamic host configuration protocol. Entities and Terminology. Wiiliam Stallings. Mobile TCP. “Mobile communications”. “Wireless Networks”. “Principles of Wireless Networks” 5. Mobile Network Layer: Mobile IP: Goals. Ipv6. Destination sequence distance vector. Examples Stacks with Wap. Indirect TCP. Mobile databases. Pearson Education 2. Dynamic source routing. Addison wisely . WML script. IP packet delivery. M. Mobile Transport Layer: Traditional TCP: Congestion control. Krishnamurthy . Wireless markup language. P. Reverse tunneling. “Wireless Communications Principals and Practices” 2. Registration. Some approaches that might help wireless access.9. Wireless telephony application. Fast retransmit/fast recovery. Examples. Jochen Schiller. Page of 48 9 . Pearson Education TERM WORK 2. Wireless application environment. Rappaort. “Wireless Communications and Networks” References : 1. Snooping TCP. Fast retransmit/fast recovery. Tunneling and Encapsulation . Support for Mobility: File systems: Consistency. assumptions and requirements. John Wiley 4. YI Bing Lin . Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. World Wide Web: Hypertext transfer protocol. K Pahlavan. Agent advertisement and discovery. Wireless session protocol. Alternative metrics 10. Wireless datagram protocol. Wireless transaction protocol. Wireless application protocol: Architecture. Slow start. Hierarchical algorithms. Wireless transport layer security. Transaction oriented TCP 11. Ad hoc networks: Routing. System architectures.
25. User connectivity. B-ISDN protocol reference model. Management plane. Network layer functions. 5. 6. Paper II. 3. Physical Layer Protocols and Access Technologies: Physical Layer Protocols and Interfaces. 2. ATM layer (Protocol model). For example he should able to consider different constraints and assume suitable data and solve the problems. Token Bus and FDDI.M Sc – Information Technology Year I. We expect natural thinking from student. Subscriber Interface and Access protocol. Introduction to Transmission Technologies: Hardware selection in the design process. Theory of operations. User plane overview. Sub-DS3 ATM. Protocols designs and analysis considering deterministic and non-deterministic approach. 10. Accessing the Network. Drivers. ATM networking basics. Network layer (Internetwork layer). Data Communications: Business Drivers and Networking Directions : Data communication Past and future. Traffic and Congestion control defined. Application layer. Control plane AAL. TCP/IP suite. Advantages and disadvantages of FR. X. Current forums. VoFR: Performance and Design considerations. In third part we should study Network Design. 9. Traffic contract and QoS. Advanced technologies like High speed Devices etc. Token Ring. Page of 48 10 . Frame Relay: FR specification and design. LLC and MAC sub layer protocol. PHY layer. 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. Performance and Design considerations. Mature Packet Switched Protocol: ITU Recommendation X. 8. Common Protocols and Interfaces in the LAN environment: Data link layers protocols. Common Protocols and Interfaces in the Upper Layers(TCP/IP): Background (Routing protocols). are to be considered. Layered reference models: The OSIRM. Copper access technologies. Optical Networking: SONET/SDH standards. Standard protocols. Air Access Technologies. Dense wavelength division multiplexing (DWDM). Switching in the LAN environment. Bridge protocols. AAL Protocol model. Addressing and routing design. Cable Access Technologies. Understanding the standards and their maker: Creating standards: players and Process. Ethernet. 7. Pre-requisites: Computer networks DETAILED SYLLABUS 1. Standard computer architectures. ATM layer and cell (Definition). Traffic descriptors and parameters. Common WAN Protocol: ATM: Many faces of ATM. 4. Transport layer. SMDS and IEEE 802. Simulation Programming. Not just SOCKETS but also protocols. Fiber Access Technologies. Addressing and Traffic control.6. switched multimegabit data service (SMDS). ATM public services. Second part Network programming is to be studied.75 Internetworking protocol. Theory of Operation. ATM protocol operation (ATM cell and Transmission).
Technology Comparisons: Circuits-message-packet and cell switching methods. 12. Types of design projects. Components of design projects. “Data Networks”. TERM WORK 3. Requirements Definition: User requirements. Classes of design tool. Bertsekas. Gallager. “High Performance Communication Networks”. Varaiya. Access Network Design: Network design layers. Tanenbaum. completing the access network design. R. 13. Harcourt Asia. Application performance needs. TMH 2.R. network topology and hardware. “Practical Computer Analysis and Design”. “Networks for Computer Scientists and Engineers”. Akhtar. P. A. BOOKS Text Books: 1. Capacity planning and Network vision. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. e traffic matrix. Business aspects of Packet-Frame and cell switching services. James D. Categories of tools. J. Design tool. Darren L Spohn. “Computer Networks”. Topologies strategies. PHI References: 1. “Unix Network Programming”. Term work should consist of at least 10 practical experiments and two assignments covering all the topics of the syllabus. Generic packet switching network characteristics. Network capacities. Page of 48 11 . Backbone Network Design: Backbone requirements.Walrand. Tuning the network. 6. Peterson & Davie. High speed LAN protocols comparisons. Access network capacity. Oxford 4. W. Private verses public networking.S. S. Public network service selection. Topologies. “Computer Networks” 5. Zheng.1. “Data Network Design”. Harcourt Asia. Packet switching service aspects. Stevens. D. Morgan Kaufmann 3. Y. Vol.11. McCabe . Access layer design. Pearson Education 2. 14.
Erosion. Arithmetic and logic operations. Image processing holds the possibility of developing the ultimate machine that could perform the visual functions of all living beings. Paper III. Introduction to Computer Graphics: Geometry and line generation. Discrete cosine transform. Graphics primitives. FFT. 4. Wavelet functions. Fidelity criteria. Image Enhancement in the Spatial Domain: Gray level transformations. Image formation in the human eye. There is an abundance of image processing applications that can serve mankind with the available and anticipated technology in the near future. Scaling functions. Interpixel. Region based segmentation 10. Dilation. Hit-or-Miss transformation. Wavelets and Multiresolution Processing: Image pyramids. Closing. Image Representation and Description: Representation schemes. Series expansion. 8. Walsh transform. Morphological Image Processing: Introduction. Brightness adaptation and discrimination. Communication. Processing. Image Data Compression: Fundamentals. Digital Image Processing Systems: Introduction. Morphological algorithm operations on gray-scale images 9.Loeve (Hotelling) transform. Regional descriptors Page of 48 12 . Lossy compression. Basic relationships between pixels 3. Morphological algorithm operations on binary images. Optimum transform: Karhunen . Image compression models. DFT and 2-D DFT. Transformations 2. Image compression standards: Binary image and Continuous tone still image compression standards. Redundancies: Coding. Video compression standards. Edge linking and Boundary detection. Display. Spatial filtering: Introduction. Image Segmentation: Detection of discontinuities. Discrete wavelet transforms in one dimensions. IFFT.M Sc – Information Technology Year I. Slant transform. Thresholding. DETAILED SYLLABUS 1. Image sensing and acquisition. Image sampling and quantization. Haar transform. Storage. Hadamard transform. Subband coding. Image Enhancement in the Frequency Domain: Frequency domain filters: Smoothing and Sharpening filters. Opening. Image Transforms (Implementation): Introduction to Fourier transform. Psychovisual. 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. Histogram processing. Properties of 2-D DFT. Homomorphic filtering 6. Error free compression. Smoothing and sharpening filters 5. Structure of human eye. Wavelet transforms in two dimensions 7. Fast wavelet transform.
R. Milan Sonka. “Computer Graphics”.C. R. Page of 48 13 . Analysis. “Digital Image Processing”. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. William Pratt. and Machine Vision” Thomson Learning 3.Woods. “Digital Image Processing”. PHI References: 1. B. D. Roger Boyle. “Image Processing. “Orthogonal Transforms for Digital Signal Processing” Springer 4. S. McGraw Hill 3. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus.Gonsales R.E. Chanda. “Fundamentals of Image Processing”. Dutta Majumder. Second Edition.Vaclav Hlavac. Rao. N Ahmed & K. Pearson Education 2. PHI TERM WORK 4.BOOKS Text Books: 1. Harrrington. John Wiley 2. “Digital Image Processing and Analysis”. Jain. Anil K.
Implement speech analysis and speech synthesis modules using object-oriented software programs. Types of HMMs. Approaches to automatic speech recognition by machine. Segmental K-Means training procedure. The one pass algorithm. Linear predictive model for speech recognition. HMM system for isolated word recognition 7. Incorporation of spectral dynamic features into distortion measures. Distortion Measures-Mathematical Considerations. Page of 48 14 . “Fundamentals of Speech Recognition”. Speech Sounds and features. Template adoption to new talkers. DETAILED SYLLABUS 1. 6. Pattern Comparison Techniques: Speech detection. Discriminative methods in speech recognition. Paper III. Large Vocabulary Continuous Speech Recognition. Representing speech in time and frequency domains. L. The level building algorithm. Grammar networks for connected digit recognition. Multiple candidate strings. Auditory based Spectral analysis model. 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. Rabiner and B. the use of software objects as components in a larger software system. Use a spectrum analyzer to relate the acoustic speech signal to acoustical processes. 5. Theory And Implementation Of Hidden Markov Models: Discrete time Markov processes. Template training methods. 4. Spectral-Distortion Measures. 3. 2. Pearson Education. Speech Recognition System Design And Implementation Issues: Application of source coding techniques to recognition. The two level dynamic programming algorithm. Distortion Measures-Perceptual Considerations. Brief history of speech recognition research. and Acoustic-phonetic characterization: The speech production system. using techniques such as class derivation. Speech Recognition Based On Connected Words Models: General notations for the connected Word-Recognition problem. The three basic problems for HMMs. 9. reception. Performance analysis and recognition enhancements. Signal Processing And Analysis Methods For Speech Recognition: The bank-of-filters front-end processor. Time Alignment and Normalization. Vector quantization. Implementation issues for HMMs. out line. The paradigm for speech Recognition. Speech recognition in adverse environment. Design and implement digital filters to synthesize speech and code speech at a low bit rate. Task Oriented Applications Of Automatic Speech Recognition BOOKS Text Books: 1.M Sc – Information Technology Year I. The Speech Signal: Production. Juang. Connected digit recognition implementation. Fundamentals Of Speech Recognition: Introduction. 8. Extensions to hidden Markov Models.
D. “Speech and Language Processing”. Page of 48 15 . B. Jurafsky and J. “Digital Processing of Speech Signals”. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. John Wiley. Morgan. L R Rabiner and RW Schafer.H. TERM WORK 5. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. Pearson Education. “Speech and Audio Signal Processing”. Martin. 2. References: 1. Gold and N. Pearson Education.2.
M Sc – Information Technology Year I. to motivate. Mining descriptive statistical measures in large databases 7. Dimensional modeling advanced topics. Clustering. related concepts. Web Usage mining. Infrastructure and metadata. conceptual design methodologies. growth and maintenance. 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. Association rules. Trends in data warehousing. and storage techniques. Architecture And Infrastructure: Architectural components. query language. Visualisation : Data generalization and summarization-based characterization. Systems products and Page of 48 16 . 3. OLAP in data warehouse. Basic elements of data warehousing. Web Mining: Web Content Mining. Data Mining Algorithms: Classification. data quality. Paper IV. Data mining part of the model aims to motivate. Data warehousing and the web. 2. Pre-requisites: DBMS DETAILED SYLLABUS Data Warehousing: 1. 5. data extraction. in terms of data models. 5. Collecting the requirements. Knowledge Discovery : KDD Process 4. 6. and System Architectures: Data mining primitives. Information Access And Delivery: Matching information to classes of users. Application and Trends in Data Mining: Applications. Languages. Designing GUI based on a data mining query language. Introduction: Basics of data mining. Data Mining Primitives. 6. define and characterize data mining applications. data warehouse deployment. Architectures of data mining systems 8. Implementation And Maintenance: Physical design process. Data mining techniques. 2. transformation and loading. 4. Temporal mining. Mining class comparisons: Discriminating between different classes. define and characterize data mining as process. Planning And Requirements: Project planning and management. Data Mining: 1. Advanced Topics: Spatial mining. Web Structure Mining. Overview And Concepts: Need for data warehousing. 3. Analytical characterization: analysis of attribute relevance. Query language. Data Design And Data Representation: Principles of dimensional modeling.
Kamber.research prototypes. 2. Wiley Dreamtech. M Berry and G. Paulraj Ponnian. John Wiley.H. “Data Mining Introductory and Advanced Topics”. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. “Data Mining Concepts and Techniques”. Dunham. “Decision Support and Data Warehouse systems”. Kimpall. TERM WORK 6. John Wiley. R. “Mastering Data Mining”. “Building the Data Warehouses”. 2. Han. “The Data Warehouse Lifecycle toolkit”. Pearson Education.H. Page of 48 17 . “Data Warehousing Fundamentals”. Inmon.G. 4. 3. TMH. John Wiley. Trends in data mining BOOKS Text Books: 1. Morgan Kaufmann References: 1. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. John Wiley. Linoff. 3. Mallach. W. Ralph Kimball. E. M. 5. “The Data Warehouse Toolkit”. Additional themes in data mining.
Databases on the Web and Semi Structured Data: Web interfaces to the Web. Systems comparison of RDBMS. Indexes for text data 6. and type constructors. Storage of XML data. Replication. 2. Deductive databases and Page of 48 18 . Transactions and Concurrency control.Nested relations and collections. Methods. Overview of XML. ORDBMS 4. apply the knowledge acquired to solve simple problems Pre-requisites: Database Systems. 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. Parallel query evaluation. and allocation techniques for distributed database design. Parallelizing individual operations. Super classes. Paper IV. Spatial databases. Persistent programming languages. Joins. Object structure. Implementation issues. Complex objects. learn about the Web-DBMS integration technology and XML for Internet database applications. Parallel and Distributed Databases and Client-Server Architecture: Architectures for parallel databases. Type hierarchies and Inheritance. Example of ODBMS 3. Structure of XML data. Object identity. Concurrency control and Recovery in distributed databases. At the end of the course students should be able to: gain an awareness of the basic issues in objected oriented data models. An overview of Client-Server architecture 5. and Persistence.. Document schema. OODBMS architecture and storage issues. Distributed database concepts. OODBMS. Inheritance. Query processing and Optimization. Sorting. Type extents and queries. familiarize with the data-warehousing and data-mining techniques and other advanced topics. Enhanced Data Models for Advanced Applications: Active database concepts. Relationship types of degree higher than two. Specialization and Generalization. Motivation for complex data types. OQL. and thus to acquaint the students with some relatively advanced issues. Storage and access methods. An overview of SQL3.M Sc – Information Technology Year I. Querying XML data. Data fragmentation. The semi structured data model. XML applications. Object-Oriented Databases: Overview of Object-Oriented concepts. Temporal database concepts. Object Relational and Extended Relational Databases: Database design for an ORDBMS . Database schema design for OODBMS. Query processing in distributed databases. Subclasses. Concepts and architecture. Implementation issues for extended type. Encapsulation of operations. User defined abstract data types and structured types. DETAILED SYLLABUS 1. The Extended Entity Relationship Model and Object Model: The ER model revisited. OOAD. Constraints and characteristics of specialization and Generalization.
Longman. Design. C. BOOKS Text Books: 1. Pearson Education TERM WORK 7. Geographic information systems. 2. “Fundamentals of Database Systems”. “Database System Concepts”. McGraw-Hill. Pearson Education 2. Korth.J. “Introduction To Database Systems”. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. Implementation and Management”. Raghu Ramakrishnan.Query processing.Date. Peter Rob and Coronel. Thomson Learning. 3. Silberchatz. Page of 48 19 . Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. “Database Systems. “Database Management Systems”. Johannes Gehrke. McGraw-Hill References: 1. Elmasri and Navathe. Sudarshan . Mobile databases.
Responsibility. Verification and validation. Security. Software testing process.an organizational issue. 2. John Wiley. Storage. Process problems and defect rates. Test plan documentation. Perry. Report Test Result. To learn standard terminology. Establishing a Software Testing Methodology: Introduction. Defect Vs failures. Considerations in developing testing methodologies 4. Acceptance Test. Multi platform environment.M Sc – Information Technology Year II M Sc – Information Technology Year II. Program Phase Testing. OOAD DETAILED SYLLABUS 1. “Effective Methods for Software Testing”. Verification and validation in the software development process. Evaluate Test Effectiveness 8. Requirements Phase Testing. Boris Beizer. Dreamtech 2. Louise Tamres. Discover good sources of information. Determining Software Testing Techniques: Testing techniques/tool selection process. Page of 48 20 . RAD. Unit testing techniques. To provide a professional qualification widely recognized by employers. References : 1.E. Execute Test and Record Results. Paper I. Term I SUBJECT: SOFTWARE TESTING Lectures: 4 Hrs per week Theory: 100 Marks Objectives To improve your understanding of software testing . Test Software Change. Economics of SDLC testing. Design Phase Testing. Testing methodology 3. Pre-requisites: Software Engineering. “Software Testing Techniques”.. Selecting and using the test tools. Falk J. The business perspective for testing 2. Appointing managers for testing tools 6. “Testing Computer Software”. Software Testing Process: Cost of computer testing. System documentation. Selecting and Installing Software Testing Tools: Testing tools-Hammers of testing. Off-the-self software. Kaner C. Structural system testing techniques.. Establishing a testing policy. Building a Software Testing Strategy: Computer system strategic risk. Nguyen H. W. customers and peers. To provide a complete picture of the test activities and processes from requirements review to system implementation. Workbench concept. Functional system testing techniques.its purpose and nature and raise your awareness of issues and constraints around testing. Economics of testing. Introduction: Defect. Types. Web based systems. Functional and structural testing. Building Test Document: Uses. “Introducing Software Testing”. Test Plan.. Test analysis report documentation Books Text Books: 1. Selecting techniques/tools. Functional testing and analysis 5. Life cycle testing concept. Testing Specialized Systems and Applications: Client/Server systems. Testing. Testing Software Installation. Pearson Education. Data Warehouse 9. John Wiley. Software Testing Process: Access Project Management Development Estimate and Status. Common computer problems. Structured approach to testing. Workbench skills 7. Test strategy.
Assignments: 10 assignments covering the syllabus has to be submitted Page of 48 21 .
and Ethical Issues in Computer Security: Protecting programs and data. P. Network security control. Risk analysis. IPsec 6. Rights of employees and employers. C. Proposals for multilevel security 5. “Computer Security: Art and Science”. Legal. Password. Secure e-mail. Whitman. Thomson Assignments: 10 assignments covering the syllabus has to be submitted Page of 48 22 . Security in Networks: Threats in networks. Ethical issues in computer society. Introduction: Security. Administrating Security: Security planning. Networks and cryptography. File protection mechanism. SSL. Pearson Education. Viruses and other malicious code. Controlling a risk is not eliminating the risk but to bring it to a tolerable level. Pfleeger. Controls against program threats 3. Control of access to general objects. Pfleeger. Term II SUBJECT: INFORMATION SECURITY Lectures: 4 Hrs per week Theory: 100 Marks Objectives of the course: Learn about the threats in computer security. Sensitive data. TMH 4. Computer criminals. Authentication: Authentication basics. Firewalls. Interface. “Principles of information security”. “Java Network Security “. Pearson Education 5. “Security in Computing”. Non-malicious program errors. Memory address protection. Mattord. 7. L. Biometrics. Privacy. Database Security: Security requirements. Stallings. 2. Matt Bishop. References : 1. Pre-requisites: Computer Networks. Operating System Security: Protected objects and methods of protection. DETAILED SYLLABUS 1. Speciner. Organizational security policies. Reliability and integrity.M Sc – Information Technology Year II. Multilevel database. Privacy. Understand what puts you at a risk and how to control it. Paper I. Targeted malicious code. Perlman. Physical security. Attacks. Macro Pistoia. Information and law. Operating system. Case studies of ethics Books Text Books: 1. Intrusion detection systems. Eric Maiwald. “Network Security” 3. Kaufman. Challenge-response. “Network Security : A Beginner’s Guide”. Method of defense 2. and S. 4. Computer crime. “Cryptography And Network Security: Principles and practice” 2. Pearson Education. Example protocols: PEM. Program Security: Secure programs. Software failures.
Fuzziness as Multivalence. Neural and fuzzy systems as function Estimators. Client server and data warehousing. Scope of Variables. Genetic Algorithms A simple genetic algorithm. Input/Output. Expert system Knowledge as rule trees. Improvement in basic techniques. Intelligent Behavior as Adaptive Model free Estimation. Cell Notation and the Internals (Almost) of Lisp. Fuzzy systems and applications. signal monotonicity. Pointers. Paper II. More on Predicates. Fuzzy systems as Structured Numerical estimators. Basic Debugging. Typing at Lisp. The Isa Hierarchy. Defining Programs.Recursion. Properties of Internal Representation. designing decision support systems. Pointers and Alternative Notations. De Jong and Function Optimization. Representation in AI. Frame Notation 2 Lisps Lisps. similarity templates(Schemata). Machine learning and methodology of science. Other Kinds of Inference Indexing. Properties. Neurons as functions. Destructive Modification of Lists. Symbol vs Numbers. The brain as a dynamical system. Basic Flow of Control in Lisp. Cross over and Mutation. Pulse-Coded Signal functions 2.armed and k-armed Bandit Problem. Generalization and creativity. Building Up List Structure. The for Function . Knowledge Discovery Process. Neural Networks and Fuzzy systems Neural and fuzzy machine Intelligence. Rules vs Principles. The Dynamical Systems approach to Machine Intelligence. Fuzzy Systems as Parallel associators. Symbolic vs Numeric Processing. The two. Lisp Style. Atoms and Lists. Fitness scaling Applications of genetic algorithm. Computer systems that can learn. Schema Processing at work. The building block hypothesis. Connectives Variables and Quantification. Neuron Fields. The Predicate Calculus.M Sc – Information Technology Year II. Mathematical foundations. Common signal functions. A simulation by hands. applications of genetic based machine leaning 3. Neural Networks as trainable Dynamical system. Data Structures. The minimal Deceptive Problem Computer implementation of Genetic algorithm. Learning as change. How to Use the Predicate Calculus. Introduction to Genetics based machine learning. Neural Network Theory Neuronal Dynamics: Activations and signals. Indexing. Slot-Assertion Notation. Generating Fuzzy rules with product space Clustering. Predicates and Arguments. Neuron Dynamical Systems. Time to reproduce and time to Cross Mapping objective function to fitness form. Term I SUBJECT: Artificial Intelligence Lectures: 4 Hrs per week Theory: 100 Marks 1 AI and Internal Representation Artificial Intelligence and the World. Data ware house. Fuzzy systems as Principle based Systems 1. Data Mining Introduction to Data Mining. Concept learning. Macros 3. Reproduction . Visualization Page of 48 23 . Biological Activations and signals.
Discovering foreign key relationships Assignments 10 assignments covering the syllabus has to be submitted Text book 1. Data Mining by Pieter Adriaans and Dolf Zantinge – Pearson Education Asia 5. Drew McDermottAddison Wesley 2. Introduction to Artificial Intelligence By Eugene Charniak. Genetic algorithm.PHI 3. Decision trees. Real life applications.nearest neighbor. Genetic Algorithms in search. Optimization & Machine Learning by David E Goldberg-Addison wesley 4. Addison –Wesley Page of 48 24 . OLAP tools. K. Customer profiling. Setting up a KDD environment. Neural Networks and fuzzy systems A dynamical systems approach to machine Intelligence by Bart Kosko. Neural networks.Techniques. Data Warehousing in the Real World by Sam Anahory and Dennis Murray.
Task planner simulation. 8. Three-Four axis. Homogeneous. Gonzales and Lee. 7. “Introduction to Robotics”. Walfram Stdder. McGraw Hill 3. 2. Oderey. Fine-motion Planning. Staughard. Fu. Klafter. Chmielewski. TMH. Rotations. Interpolated motion. and incorporate robots in engineering systems. Camera calibration). 4. Moments of Inertia. “Robotics and Control”. “Industrial Robotics”. Segmentation (Thresholding. Link co-ordination arm equation. Nagrath. Mittal. Space. Swell operators. Robot Vision: Image representation. Exposure to programming in a high level language DETAILED SYLLABUS 1. Application. “Robot Engineering”. Classification. (Five-axis robot. Grover. 3. Pearson Education References: 1. BOOKS Text Books: 1. PHI. J. Simulation of Planer motion. enough to evaluate. Structured Illumination. Perspective transformation. Configuration. region labeling. Robotic Manipulation: Automation and Robots.J. 2. “Robotics”. 6. “Robotics and Mecatronics”. TMH Page of 48 25 . 2. Shane analysis. Four axis robot. Six axis robot). Task Planning: Task level programming. Source and goal scenes. Negin. 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. Pearson Education 5. PHI 6. Co-ordinates. “Fundamentals of Robotics-Analysis and control”. Template matching. Wiess. “Robotics and AI”. Straight-line motion. Continuous path motion. Uncertainty. Planning. Shrink operators. Nagel. Direct Kinematics: Dot and cross products. Pre-requisite: Exposure to linear algebra and matrix operations. Specification. Notations. PHI. Six axis robot (Inverse kinematics). chose. Paper II. Craig. Robert Shilling. Polyhedral objects.M Sc – Information Technology Year II. McGraw Hill 3. Inverse Kinematics: General properties of solutions tool configuration Five axis robots. Gross motion. Workspace analysis and trajectory planning work envelop and examples. Niku. workspace fixtures. “Introduction to Robotics”. Co-ordinate frames. Grasp planning. Principles of NC and CNC Machines. 4. 5. Euler numbers. Pick and place operations.
Assignments: 10 assignments covering the syllabus has to be submitted Page of 48 26 .
recognize problems and limitations to parallel systems. Quadrature problem. Functional and logic paradigms. Distributed shared memory 11. Message Passing Programming: Introduction. Amdahl’s law. Isoefficiency metric BOOKS Text Books: 1. Other Parallelism Paradigms: Data flow computing. “Computer Architecture and Parallel Processing”. Benchmarking parallel performance 7. A. Jorden H. Abstract model of parallel computer. Occam. 2. Model. Performance of Parallel Processors: Speedup and efficiency. Memory and I/O Subsystems: Hierarchical memory structure. Shasikumar M. Debugging Parallel Programs: Debugging techniques. “Parallel Programming”. “Introduction to Parallel Processing”. Programmability Issues: An overview. Parallel sorting algorithms. Operating system support.. Input output subsystems 10. Introduction: Parallel Processing Architectures: Parallelism in sequential machines. 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. Circuit satisfiability.J. Cache memories and management. Solving diophantine equations. McGraw Hill 2. Data Dependency Analysis: Types of dependencies loop and array dependences. Algorithms for Parallel Machines: Speedup. Shared Memory Programming: General model of shared memory programming. Memory allocation and management. Multiprocessor architecture. Introducing collective. “Fundamentals of Parallel Processing” 3. TMH References: 1. C-Linda 8.. F. as well as possible solutions Pre-requisite: Computer architecture. Parallel Programming languages: Fortran90. nCUBE C. Debugging message passing parallel programs. Array processors. Quinn. Data structures DETAILED SYLLABUS 1. Software tools 3. Debugging shared memory parallel programs 9. Process model under UNIX 5. Types of operating systems.M Sc – Information Technology Year II. Interface. Virtual memory system.. Complexity and cost. Karf-Flatt metric. PHI Page of 48 27 . Elective I. M. GustafsonBarsis’s law. Systolic architectures. Cache allocation and management. and Alaghaband G. Loop dependence analysis. Solving linear systems. Pipelining. Matrix multiplication. Hawang Kai and Briggs F. Parallel programming models. Parallel reduction. Program transformations 4. Histogram computation. Probabilistic algorithms 6.
E. A. Culler.P. Page of 48 28 . Wilson G.. Morgan Kaufman TERM WORK 8. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. Singh. J. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. “Parallel Computer Architecture”. D.V.2. Gupta. PHI 3. “Practical Parallel Programming”.
Client centric consistency models. and Globe. 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. Distribution protocols. Software concepts. 9. M. Security management. Mutual exclusion. Communication: Layered protocols. Clients.M Sc – Information Technology Year II. Removing un-referenced entities. Process resilience. 6. TMH TERM WORK 9. G. Distributed transactions. A. Servers. Hardware concepts. Globe. Elective I. 3. Examples of distributed systems. Coulouris. Pearson Education References: 1. N. Election algorithms. 10. Stream-oriented communication. Secure channels. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. and Client-Server model. Software agent. Kindberg. 8. Message-oriented communication. Consistency and Replication: Introduction. Logical clocks. Data centric consistency models. 2. Page of 48 29 . Introduction to Distributed System: Goals. Synchronization: Clock synchronization. Case Study: CORBA. 5. “Advanced Concepts in Operating Systems”. Consistency protocols. Pre-requisites: Operating Systems and Computer Networks DETAILED SYLLABUS 1. Dollimore. BOOKS Text Books: 1. 4. Distributed commit. “Distributed Systems: Principles and Paradigms” 2. Remote object invocation. “Distributed Systems: Concepts and Design”. Singhal. Fault Tolerance: Introduction. Locating mobile entities. Security: Introduction. Reliable client server communication. Global state. Naming: Naming entities. Processes: Threads. DCOM. Reliable group communication. Remote procedures call. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. Distributed File System: Sun network file system. Recovery. Code Migration. Taunenbaum. The design issues and distributed operating system concepts are covered. 7. Access control. and T. Comparison of CORBA. Shivaratri. J. Distributed COM. CODA files system.
The wumpus world environment.M Sc – Information Technology Year II. Types of communicating agents. Agents that Communicate: Communication as action. Completeness 7. Artificial Intelligence: An overview. Expert system: Introduction to expert system. Applications: Natural language processing. Environments 3. Representing knowledge in an uncertain domain. Robotics BOOKS Text Books: 1. Inductive learning. Perception. 2. Application of ANN. Problem Solving: Solving problems by searching. Nillson. Practical planning: Practical planners. Inference in belief networks 9. Pearson Education References: 1. Hierarchical decomposition.Luger. Harcourt Asia Page of 48 30 . Uncertain Knowledge and Reasoning: Uncertainty. Conditional planning 8. Multilayer feed-forward network. Game playing 4. Intelligent Systems: Evolution of the concept. Perceptrons. First order logic: Syntax and Semantics. Prerequisite: Data Structures. Knowledge acquisition 12. Informed search methods. Extensions and Notational variation. learning decision trees. Knowledge engineering. General ontology 6. Elective I. “Artificial Intelligence: Structures and Strategies for Complex Problem Solving”. Knowledge and Reasoning: A knowledge based agent. Learning: Learning from observations: General model of learning agents. An example proof. Logic. Proportional logic. George F. Nils J. The semantics of belief networks. and Algorithms DETAILED SYLLABUS 1. Struart Russell and Peter Norvig. Structure of intelligent agents. Genetic algorithms 10. Generalization in reinforcement learning. “Artificial Intelligence: A New Synthesis”. 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. Representation. Reinforcement learning: Passive learning in a known environment. Using first order logic 5. Forward and backward chaining. Programming Languages. Expert system shells. “Artificial Intelligence: A Modern Approach” 2. Acting Logically: Planning. methodologies and techniques in design and implementation of intelligent system. A formal grammar for a subset of English 11. Building a Knowledge Base: Properties of good and bad knowledge base. Interfacing First Order Logic: Interface rules involving quantifiers. Reasoning. Intelligent Agents: How agent should act. Explanation. Representing and using domain knowledge. Learning in neural and belief networks: Introduction to neural networks.
“Artificial Intelligence”. 4. Sasikumar and Others. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. Page of 48 31 . Elaine Rich and Kevin Knight. TMH Patrick Winston. Vikas Publishing House TERM WORK 10. 3.2. “Artificial Intelligence : Theory and Practice” Proceedings of the International Conference KBCS-2002. 6.Aronson. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. “Decision Support Systems and Intelligent Systems” Ed. “Artificial Intelligence”. Pearson Education Efraim Turban Jay E. “Prolog Programming for Artificial Intelligence”. M. Pearson Education Ivan Brakto. 5.
2. Jaico publishers 3. Types of activation function. algorithm formulation and ways to apply these techniques to solve real world problems. Learning Factors. RBF learning strategies. and Trubatch S. Thimothy J. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. “Fuzzy Logic with Engineering Applications”.. 6. and basic probability and statistics are required. Bidirectional Associative Memory.. Fuzzy measures. PHI 2.. Network architectures. Ross. PHI References: 1. Learning Rules. K-means and LMS algorithms. Method of steepest descent least mean square algorithms. Driankov D. Membership functions. “Fuzzy Systems Design Principles”. 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. C. Pearson Education 2. error performance .C. & Reinfrank M. Berkan R. Properties. MathCad. Elective I. 3. McGraw Hill 4. theorem and the reparability of patterns.. Programming skills in one of the following would be desirable: Matlab. Radial Basis and Recurrent Neural Networks: RBF network structure. Simulated Annealing: The Boltzmann machine. Single Layer Perceptron: Perceptron convergence theorem.. The extension principle. Multilayer Perceptron: Derivation of the back-propagation algorithm. Yegnanarayana B. Page of 48 32 . McCulloch and Pitts models of neuron. Zurada J. “Introduction to Artificial Neural Systems. Ahmad Ibrahim.L..M Sc – Information Technology Year II. “Neural Network a . Norosa Publishing House 3. Fuzzy logic: Fuzzy sets. fuzzy logic systems and their applications. BOOKS Text Books: 1.M. Unsupervised learning. Learning process: Error-correction learning. Fuzzy relations. spurious states. Operations on fuzzy relations. Operations on fuzzy sets. Fuzzification and defuzzification methods. 4. Pre-requisite: Knowledge of calculus. 5.Comprehensive Foundation”. Its focus will be on the introduction of basic theory. Fuzzy controllers. C++ DETAILED SYLLABUS 1. Hopfield networks: energy function. “Introduction to Applied Fuzzy Electronics”. “Artificial Neural Networks”. Hellendoorn H. Supervised learning. Introduction: Biological neurons. “An Introduction to Fuzzy Control”. Simon Haykin. Java. comparison of RBF and MLP networks. Background in the following subjects desirable: numerical analysis (including optimization). IEEE Press TERM WORK 11. Boltzmann learning rule. Knowledge representation.
Page of 48 33 .ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus.
“Discrete Time Signal Processing” References: 1. Design of digital filters based on least-squares method digital filters from analogue filters. 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. T. Analysis of discrete-time LTI systems. Properties of the Fourier transform for discrete-time signals. Telecommunication BOOKS Text Books: 1. Jervis. frequency transformations. S. Control.G. Inverse Ztransform. “Digital Signal Processing”. Z-Transform: Definition and Properties of Z-transform. Speech. Implementation of discrete-time systems. E. quantization of filter coefficients. 4. “Digital Signal Processing”. Inverse systems and deconvolution 4. FFT algorithm. Goertzel algorithm.” Fundamentals Of Digital Signal Processing”. Pearson Education. Mitra. L. and Linear phase filters. Applications of FFT. Quantisation effects in the computation of DFT 5. Elective I. Design of IIR filters from analog filters. Properties of DFT. 2. “Digital Signal Processing”. PHI 2. Discrete–time systems. Design of FIR filters using windows. Frequency domain characteristics of LTI systems. Page of 48 34 . System Transforms and Filters. J. Discrete-time systems described by differential equations. Correlation of discrete-time systems 2. geophysical exploration. Introduction to DSP co-processors: TMS 320C40/50. 3.M Sc – Information Technology Year II. and noninvasive medical imaging. Discrete Time Signals & System: Discrete–time signals. Audio. Applications : Image processing. B. Discrete Fourier Transform: Frequency domain sampling. Oppenhiem and Schaffer. Comparison of IIR and FIR filters. Speech Recognition. Implementation of Discrete Time Systems: Structure of FIR systems. Design of Digital Filters: Design of FIR filters. Structure of IIR systems.C. Ludeman. echo cancellations in communication systems.C. “Introduction to Digital Signal Processing”. Properties of FIR digital filters. Ifeachor. one-sided Z-transform. or magnetic resonance imaging) and encompass applications such as Compact Disc player. Cavicchi. Analysis of LTI systems in Z-domain 3.J. Frequency analysis of signals using DFT. John Wiley.W. Proakis. Linear filtering method based on DFT. This course aims to build concepts regarding the fundamental principles and applications of Signals. TMH. round-off effects in digital filters 6.K. Rational Z-transforms. 7. image Enhancement. John Wiley. 8. Analog Devices. Pre-requisites: Nil DETAILED SYLLABUS 1. Frequency Analysis of Signals and Systems: Frequency analysis: Continuous time signals and Discrete-time signals. LTI system as a frequency selective filter.
5. TERM WORK 12. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. “Analog and Digital Signal Processing”. Ashok Ambardar. 6. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. S Sallivahanan. TMH. “Digital Signal Processing”. Thompson Learning. Page of 48 35 .
Optical. Combining Building Blocks. 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. Hardware Bandwidth and the Transmission of Bits. Mathematics And Error Detection. Spread Spectrum. Satellites. Modulation and Modems) Sending Signals across Long Distances. Probability. Base band And Broadband Technologies Wave Division Multiplexing. Multicast Addressing. Infrared. Framing. Wireless LANs And CSMA/CA. Significance of LANs and Locality of Reference. Low Earth Orbit Satellites. Complexity in Network Systems. Elective I. Bus Network: Ethernet Carrier Sense on Multi-Access Networks (CSMA). Transmission Errors. Shared Communication Channels. And Dialup Modems. Growth of the Internet. Detecting Errors With Cyclic Redundancy Checks. Radio Frequency. Interpreting A Ping Response PART I DATA TRANSMISSION Transmission Media Copper Wires. and Errors. Probing the Internet. Low Earth Orbit Satellite Arrays. Modem Hardware Used for Modulation and Demodulation. Burst Errors. Parity Bits and Parity Checking. Geosynchronous Satellites.M Sc – Information Technology Year II. Leased Analog Data Circuits. Bus Network: Local Talk Hardware Addressing and Frame Type Identification Specifying a Recipient. Microwave. Using Electric Current to Send Bits. Mastering the Complexity. Glass Fibers. Significance for Data Networking Long-Distance Communication (Carriers. Baud Rate. Carrier Frequencies and Multiplexing. How LAN Hardware Uses Addresses to Filter Packets Format of a Physical Address. Limitations of Real Hardware. Light Form a Laser Local Asynchronous Communication The Need for Asynchronous Communication. Packets and Hardware Frames. Full Duplex Asynchronous Communication. Detecting Errors With Checksums. Frame format And Error Detection Mechanisms LAN Technologies and Network Topology Direct Point-To-Point Communication. Identifying Packet Contents. Using Networks That Do Not Have SelfIdentifying Frames. Standards for Communication. Time Division Multiplexing PART II PACKET TRANSMISSION Packets. Multicasting. Radio. Frame Headers And Frame Format. Byte Stuffing. Collision Detection and Back off With CSMA/CD. Broadcasting. The Effect of Noise On Communication. LAN Topologies. Packets and Time-Division Multiplexing. Frames and Error Detection The Concept of Packets. Resource Sharing. Network Analyzers Page of 48 36 .
Forming A WAN. the Scientific Basis for Layering. the Topology Paradox. Multiple. Next-Hop Forwarding. Bridges and Switches Distance Limitation and LAN Design. Digital Circuits and DSU. Extending LANs: Fiber Modems. Bridging Across Longer Distances. Protocol Suites. Source Independence. A Plan for Protocol Design. REFERENCE Computer Network. PHI Computer Networks and Internets. Network Performance Characteristics Protocols and Layering The Need for Protocols. Nested Headers. and Interface Hardware Speeds of LANs and Computers. Data Networking.LAN Wiring. Optical Carrier Standards. Original Thick Ethernet Wiring. How Layered Software Works. Service Paradigm. Network Interface Hardware. Distributed Spanning Tree. Repeaters. Lower Capacity Circuits. Planning a Bridged Network. Synchronous Optical Network (SONET). Upstream Communication. Intermediate Capacity Digital Circuits Highest Capacity Circuits. and Performance Network Ownership. Switching. Shortest Path Computation in a Graph. the C Suffix. Network Interface Cards and Wiring Schemes. Thin Ethernet Wiring Twisted Pair Ethernet. Hybrid Fiber Coax Wan Technologies and Routing Large Networks and Wide Areas. TERM WORK Term work should consist of at least 10 assignments from the aforementioned topics. PHI Networking Technology. Addresses and Connection Identifiers. Douglas E. Stacks: Layered Software. Packet Switches. Synchronous Communication. Distance Vector Routing Network Ownership. Store and Forward Physical Addressing In A WAN. Bridging Between Buildings. Repeaters. Physical Topology. Comer Pearson Education Asia Page of 48 37 . Jaiswal. Routing Table Computation. Examples of Service Paradigms. Cable Modem Technology. Connection Multiplexing. A Seminar to be presented by each student as part of term works carrying 15 marks. Use of Defaults Routes. the Seven Layers. Galgotia. Bridges. Frame Filtering Startup and Steady State Behavior of Bridged Networks. Connection Duration and Persistence. Routing In A WAN. the Connection between A NIC and A Network. Tuekeun. Virtual Private Networks. Combining Switches And Hubs. Telephone Standards DS Terminology and Data Rates. ISDN. Bridging And Switching With Other Technologies Long-Distance Digital Connection Technologies Digital Telephony. Distributed Route Computation. A Cycle Of Bridges. Service Paradigm. Fiber Optic Extensions. Asymmetric Digital Subscriber Line Technology Other DSL Technologies. Bertsekas. the Local Subscriber Loop. Relationship of Hierarchical Addresses to Routing.
Relaxation procedure. Pattern recognition systems. ID3. classification. C4. Non-separable behavior. “Pattern Classification”. economics. Minimising the Perceptron criterion function.5. Combining classifiers 8. Classifiers. to be utilized for problem-solving in a wide variety of applications. Normal density. Design cycle. Applications of Pattern Recognition BOOKS Text Books: 1. such as engineering system design. 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. Prolems of dimentionality. Hidden Markov Model 1. Bayesian estimation. Nonparametric Techniques: Density estimation. Multicategory generalizations 6. Probability and Statistics DETAILED SYLLABUS 1. kn-Nearest-Neighbor estimation. Introduction: Machine perception. Nearest-Neighbor rule. CART. Gramatical methods. Discriminant functions and Decision surfaces. image processing. Bayes Decision theory: discrete features 3. Bias and Variance. technical and medical diagnostics. Unsupervised Learning and Clustering: Mixture densities and Identifiability. Learning and Adaptation 2. Application to normal mixtures. manufacturing. “Pattern Recognition and Image analysis”. Elective II. Hart. Duda. Estimating and comparing classifiers. Hierarchical clustering 9. Algorithm Independent Machine Learning: Lack of inherent superiority of any classifier. Resampling for estimating statistic. 2-Category linearly separable case. Pre-requisite: Linear Algebra. Bayesian parameter estimation: Gaussian caseand General theory. Maximum-Likelihood and Bayesian Parameter Estimation: Maximum likelihood estimation. Gramatical interfaces 7. MaximumLikelihood estimations. Minimumerror rate classification. Linear Discriminants Functions: Linear discriminant functions and decision surfaces. Bayesian Decision Theory: Bayesian decision theory: Continuous features. and Stock. Parzen windows. Unsupervised Bayesian learning. 2. Resampling for classifier design. Ho-Kashyap procedures. Data description and clustering criterion function for clustering. Minimum squared error procedure. John Wiley and Sons. Gose. PHI Lectures: 4 Hrs per week Practical: 2 Hrs per week Page of 48 38 . Discriminant functions for normal density. Matrics and Nearest-Neighbor classification 5. psychology.M Sc – Information Technology Year II. Nonmetric Methods: Decision tree. Johnsonbaugh and Jost. Generalised linear discriminant functions.
Page of 48 39 .TERM WORK 13. 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.
Morphological operators. 14. Understanding line drawings. Segmentation. Split & merge. Data-structures. Facet Model Recognition: Labeling lines. Line-Linking. Region growing. View class matching. Boundary analysis: Signature properties. Spatial operators for edge detection. Labeling. Matching of 2D image. Schunk. Area Extraction: Concepts. region shrinking. Extracting. 15. Line fitting. Analysis. Backtracking.M Sc – Information Technology Year II. McGraw-Hill. Motion-based segmentation. Knowledge Based Vision: Knowledge representation. Region Analysis: Region properties. and Machine Vision” Thomson Learning 2. Binary Machine Vision: Thresholding. 12. Connected component labeling. Vol I. Gradient based operators. Shape numbers. and B. External points. Ordered –Structural matching. 1993. Recognition of shapes. BOOKS Text Books: 1. G. R. Thinning. References: 1. 16. Edge. Image matching : Intensity matching of ID signals. Inverse perspective Projection. 13. “Computer and Robot Vision”. General Frame Works: Distance –relational approach. 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. 10. Models database organization. Recognition Methodology: Conditioning. Spatial clustering. II. Milan Sonka. Forsyth. Edge detection. R. 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. Spatial moments. Photogrammetry – from 2D to 3D. Curve fitting (Least-square fitting). Hough transform. Hierarchal segmentation. Perspective Projective geometry. Kasturi. Consisting labeling problem. David A. Roger Boyle. Mixed spatial gray-level moments. 11. Page of 48 40 . 17. Control-strategies. Local features. “Image Processing.structural matching. “Computer Vision: A Modern Approach” 2. DETAILED SYLLABUS 9. AddisonWesley. Classification of shapes by labeling of edges. Matching. Global vs.Vaclav Hlavac. Grouping. Jean Ponce. Labeling of connected components. Rule-based Segmentation. Models database organization. Elective II. Ordered. Hierarchical image matching. Object Models And Matching: 2D representation. Jain. Robert Haralick and Linda Shapiro. General Frame Works For Matching: Distance relational approach. View class matching. “Machine Vision”. Information integration.
ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus.TERM WORK 14. Page of 48 41 . Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus.
Authentication: Authentication basics. 10. Pearson Education. Whitman. Introduction: Security. “Cryptography And Network Security: Principles and practice” 4. Elective II. Cryptographic key infrastructure. Reliability and integrity. SSL. Controlling a risk is not eliminating the risk but to bring it to a tolerable level. Computer criminals. Sensitive data. 12. L. Speciner. Computer crime. Cryptography: Basic Cryptography: Classical Cryptosystems. Example protocols: PEM. “Computer Security: Art and Science”. “Network Security : A Beginner’s Guide”. Program Security: Secure programs. Perlman. Networks and cryptography. Organizational security policies. References : 6. Thomson Page of 48 42 . Storing and revoking keys. Key Management: Key exchange. IPsec 14. Bruce Schneier. 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. Proposals for multilevel security 13. Privacy. Operating System Security: Protected objects and methods of protection. Pfleeger. Memory address protection. Legal. DES. 15. P. “Principles of information security”. Software failures. RC4. Case studies of ethics Books Text Books: 3. Privacy. Cipher Techniques: Problems. Ethical issues in computer society. Security in Networks: Threats in networks. “Network Security” 7. Digital signature. Method of defense 9. Rights of employees and employers. Kaufman. Matt Bishop. Understand what puts you at a risk and how to control it. Pfleeger. DETAILED SYLLABUS 8. Eric Maiwald. Biometrics. 9. “Java network security “. File protection mechanism. Multilevel database. Stream and block ciphers: AES. Public key Cryptography. C. Challenge-response. Administrating Security: Security planning. “Security in Computing”. 5. Firewalls. John Wiley. Non-malicious program errors. and Ethical Issues in Computer Security: Protecting programs and data. TMH 8. Risk analysis. Network security control. Stallings. Viruses and other malicious code. Operating system. Secure e-mail.M Sc – Information Technology Year II. “Applied Cryptography”. Cryptographic checksum. Key generation. and S. Intrusion detection systems. Hash algorithm. Information and law. Database Security: Security requirements. Targeted malicious code. Physical security. Pearson Education 10. Control of access to general objects. Pre-requisites: Computer Networks. Controls against program threats 11. Macro Pistoia. Pearson Education. Password. Interface. Mattord. Attacks.
Page of 48 43 . Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus.TERM WORK 15. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus.
Modes of Interaction Text Books Virtual Reality Systems John Vince. Head-coupled displays. Equilibrium Virtual Reality Hardware Sensor hardware. science. Entertainment. The ear. Modes of Interaction. Elastic collisions. 3D boundary representation. 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. Scaling the VE. simple pendulums. the animation of objects. Geometrical Transformations Frames of reference. rotating wheels. Benefits of virtual reality. virtual environment.Pearson Education Asia Page of 48 44 . shading algorithms. positioning the virtual observer. Projectiles. Stereo perspective projection. the perspective projection. scientific land marks 3D Computer graphics The virtual world space. shape and object inbetweening. Modelling transformations. free-form deformation. simple 3D modelling. illumination models. realism. VR Technology. particle systems Physical Simulation Objects falling in a gravitational field. Education. radiosity.M Sc – Information Technology Year II. the somatic senses. Flight simulation. stereographic images Geometric modelling From 2D to 3D. VR systems Animating the Virtual Environment Dynamics of numbers. 3D space curves. Integrated VR Systems Virtual Reality Software Modelling Virtual worlds. The computer environment. 3D clipping. picking flying. flight dynamics of an aircraft Human factors The eye. Historical perspective. Acoustic hardware. instances. VR tool kits Virtual Reality Applications Engineering. training Future Virtual Environment. hiddensurface removal. Evolution of Virtual Reality. springs. Elective II. Collision detection A generic VR Systems The virtual Environment. Physical simulation. colour theory. Human vision.
Data models for multimedia and Hypermedia information. Digital representation of sound. Net work services. A frame work for Multimedia systems Digital Audio Representation and processing Uses of Audio in Computer Applications. Experiments Using Real Time Mach Middleware System Services Architecture Goals of Multimedia System services. video equipments. Analog video Artifacts. applications Multimedia Interchange Page of 48 45 . research trends Multimedia Services over the Public Networks Requirements. Communications.M Sc – Information Technology Year II.based Retrieval of Unstructured Data Multimedia presentation and Authoring Design paradigms and User interface. Hybrid Devices. Multimedia on the map. toolkits. digital audio and the computers Video Technology Raster Scanning Principles. Content. regulatory. barriers to wide spread use. Multimedia and personalised computing. and entertainment products The technology trends. World wide television standards Digital Video and Image Compression Video compression techniques. Video performance Measurements. The EPEG Motion Video Compression Standard. hyperapplications Multimedia File systems and Information Models The case for multimedia information systems. Synchronization. The challenges The convergence of computers. Technical. Multimedia system services Architecture. Key challenges ahead. Colour Fundamentals. The JPEG Image Compression Standard. Designers perspective. and QOS Architecture. Device control. industry perspective of the future. Architecture. New OS support. standardization of Algorithm. Presentation Services. Multimedia appliances. transmission of digital sound. Media stream protocol Multimedia Devices. Colour Video. DVI Technology Operating System Support for Continuous Media Applications Limitation of Work station Operating system. The file system support for continuous Media. ITU-T Recommendations. Hypertext and Collaborative research. Speech recognition and generation. Emerging applications. and protocols. The role of Standards. Elective III. 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. Psychoacoustics. Digital music making. Social Architectures and issues for Distributed Multimedia systems Distributed Multimedia systems. Temporal coordination and composition. and the User Interface Client control of continuous multimedia. Sensors for TV Cameras. Digital Audio signal processing.
Knowledge based Multimedia systems. Requirements of Multimedia Communications. Anatomy of an Intelligent Multimedia system Text Book Multimedia Systems by John F. MHEG (Multimedia and Hypermedia Information Encoding Expert Group). Koegel Buford. Track model and Object model. Multimedia Conferencing Architecture Multimedia Groupware Computer and Video fusion approach to open shared wok place.Pearson Education Page of 48 46 .Quick time Movie File Format. QMFI. HDTV standards. Shared Application Architecture and embedded Distributed objects. High Definition Television and desktop computing. Real Time Interchange Multimedia conferencing Teleconferencing Systems. Format Function and representation.
Aaron Walsh. swing.JSP Java Server Pages. IDG Books India(p) Ltd Java2. Barry Burd. JDBC & JAVA Beans Programming Black Book Steven Holzner dreamtech press Page of 48 48 . servlets. IDG Books India(p) Ltd Java2 Programming Bible.
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue reading from where you left off, or restart the preview.