This action might not be possible to undo. Are you sure you want to continue?
Computer Science - First Year
Paper & Section
Subject Principles of Compiler Design-I Principles of Compiler Design-II Digital Signal Processing-I Digital Signal Processing-II Mobile Computing Computer Simulation & Modeling Data Warehousing and Mining Advanced Database Systems
Lect / Pract / Theory Paper Week Week Hours Marks 4 4 4 4 4 4 4 4 16 16 4 4 4 4 4 4 4 4 16 16 3 3 3 3 --75 75 75 75 300
Practical Hours 4 4 4 4 -Marks 50 50 50 50 200
Total 125 125 125 125 500
1 2 3 4
I II I II I II I II
Total : I Year – I Term Total : I Year – II Term M. Sc. Computer Science - Second Year
Paper & Section
Subject Artificial Intelligence Image Processing Distributed Computing Embedded Systems Elective I (I Term) Elective I (II Term) Elective I (I Term) Elective I (II Term) Project (I Term)
Lect / Pract / Theory Paper Week Week Hours Marks 4 4 4 4 4 4 4 4 -16 16 4 4 4 4 4 4 4 4 6 16 16 3 3 3 3 ---75 75 75 75 -300
Practical Hours 4 4 4 4 --Marks 25 25 25 25 100 200
Total 100 100 100 100 100 500
1 2 3 4 5
I II I II I II I II
Total : II Year – I Term Total : II Year – II Term ELECTIVE - I 1 2 3 4 I II I II I II I II Parallel Processing Advanced Computer Networks System Security Internet security Enterprise Networking Satellite Communications Fuzzy Logic & Neural networks
ELECTIVE - II 1 2 3 4 I I I I Pattern Recognition Virtual Reality & Virtual Environment Bio Informatics Optimization Techniques II Computer Vision II Java Technology II Intelligent Systems II Customer Relations Management
Multimedia systems & convergence of technologies
1 | DEPARTMENT OF COMPUTER SCIENCE, UNIVERSITY OF MUMBAI
CLASS: M. Sc (Computer Science) SUBJECT: PRINCIPLES OF COMPILER DESIGN, Paper I, Term I Periods per week Lecture TW/Tutorial/Practical Hours 3 --
Year I 4 4 Marks 75 50
Theory Examination TW/Practical Term I
Introduction to Compilers o Compilers and translators o Why do we need translators? o The structure of a compiler o Lexical analysis o Syntax analysis o Intermediate code generation o Optimization o Code generation o Book keeping o Error handling o Compiler writing tools o Getting started Programming languages o High-level programming languages o Definitions of programming languages o The lexical and syntactic structure of a language o Data elements o Data structures o Operators o Assignment o Statements o Program units o Data environments o Parameter transmission o Storage management Finite automata and lexical analysis o The role of the lexical analyzer o A simple approach to the design of lexical analyzers o Regular expressions o Finite automata o From regular expressions to finite automata o Minimizing the number of states of a DFA o A language for specifying lexical analyzers o Implementation of a lexical analyzer o The scanner generator as Swiss army knife The syntactic specification of Programming Languages o Context-free grammars o Derivations and parse trees o Capabilities of context-free grammars Basic Parsing Techniques o Parsers o Shift-reduce parsing o Operator-precedence parsing o Top-down parsing o Predictive parsers Automatic Construction of Efficient Parsers
2 | DEPARTMENT OF COMPUTER SCIENCE, UNIVERSITY OF MUMBAI
and triples o Translation of assignment statements o Boolean expressions o Statements that alter the flow of control o Postfix translations o Translation with a top-down parser More about Translation o Array references in arithmetic expressions o Procedure calls o Declarations o Case statements o Record structures o PL/I-style structures Symbol Tables o The contents of a symbol table o Data structures for symbol tables o Representing scope information Symbol tables o Implementation of a simple stack allocation scheme o Implementation of block-structured languages o Storage allocation in FORTRAN o Storage allocation in block-structured languages Error detection and recovery o Errors o Lexical-phase errors o Syntactic-phase errors o Semantic errors Introduction to code optimization o The principle sources of optimization o Loop optimization o The DAG representation of basic blocks o Value numbers and algebraic laws o Global data-flow analysis More about loop optimization o Dominators o Reducible flow graphs o Depth-first search o Loop-invariant computations o Induction variable elimination o Some other loop optimizations More about data-flow analysis 3 | DEPARTMENT OF COMPUTER SCIENCE. Paper I. Term II Syntax-Directed Translation o Syntax-directed translation schemes o Implementation of syntax-directed translators o Intermediate code o Postfix notation o Parse trees and syntax trees o Three-address code.o o o o o o o o o LR parsers The canonical collection of LR(0) items Constructing SLR parsing tables Constructing canonical LR parsing tables Constructing LALR parsing tables Using ambiguous grammars An automatic parser generator Implementation of LR parsing tables Constructing LALR sets of items SUBJECT: PRINCIPLES OF COMPILER DESIGN. quadruples. UNIVERSITY OF MUMBAI .
o Reaching definitions again o Available expressions o Copy propagation o Backward flow problems o Very busy expressions and code hoisting o The four kinds of data-flow analysis problems o Handling pointers o Interprocedural data-flow analysis o Putting it all together Code generation o Object programs o Problems in code generation o A machine model o A simple code generator o Register allocation and assignment o Code generation from DAG’s o Peephole optimization Practical Debug C++ / JAVA Programs using debugger provided by different vendors along with IDE Make a comparative study of Different features of at least two Integrated Development Environment(IDE) and compilers Manipulation of IDE’s and restoring the original setting Year I Lecture TW/Tutorial/Practical Hours Evaluation System Theory Examination TW/Practical Paper II. Term I Periods per week 4 | DEPARTMENT OF COMPUTER SCIENCE. Sc (Computer Science) SUBJECT: Digital Signal Processing . The Theory and approximation of finite duration impulse response digital filters-issues in Filter designFIR filters Design techniques for Linear phase FIR filters-windowing-issues with windowing-frequency sampling-solution for optimization-linear programming-linear phase filters-Maximal ripple FIR Filters – Remez exchange algorithm. Term I Sequences-Representation of arbitrary sequences-Linear time variant systems-causality. Theory and approximation of infinite impulse response digital filters. stabilitydifference equations-frequency response-first order systems-second order systems-Discrete Fourier series-relation between continuous and discrete Systems. The z Transform-the Relation between the z Transform and the Fourier transform of a sequence-Solution of differences equation using one sided transform-geometric evaluation of the Fourier Transform-Digital Filter Realizations-structures for all zero filters-the discrete Fourier transform – convolution of sequences-linear convolution of finite duration sequences-the discrete Hilbert transform. UNIVERSITY OF MUMBAI .Multiple band optimal FIR Filters-Design of filters with simultaneous constrains on the time and frequency response. Types of quantization in digital filters-Dynamic range 3 -4 4 Marks 75 50 CLASS: M. Paper II.IIR filters-filter coefficient-Digital Filter Design –Mapping of differentials-Transformations-Direct design of digital filters-comparison between FIR filters and IIR filters Finite word length effects in digital filters-analog to digital conversions-digital to analog conversionstypes of Arithmetic in digital systems.
pitch detection and voiced unvoiced detections.Pipeline FFT. Introduction to Digital hardware-design procedure for Digital Signal Processing Hardware. Indeed.bit reversal and digit reversal for fixed radicesComparison of computations for radices. UNIVERSITY OF MUMBAI .commercial logic packages.FFT Computation using Fast Scratch Memory Radix 2 and Radix 4 Parallel structures using RAM’s.convolution and correlation using number theoretic transforms.Airborne Surveillance Radar for Air Traffic Control – Digital matched Filter for a high performance Radar.frequency transformations from one to two dimensions.special and general purpose computersinput output problems for real time processing. Paper III.Flip-Flops-arithmetic Units.Linear prediction of speech.gates.homomorphic processing of speech. Rabiner Bernard Gold.Z Transformsfinite sequences-Two dimensional DFT-Two dimensional windows-Frequency sampling filters.models of speech production-Short time spectrum analysis.Digital Touch Tone Receiver (TTR) Digital time Division Multiplexing (TDM) to Frequency Division Multiplexing (FDM) translator partitioning of digital filters for IC Realization. vocoder-formant Synthesis.LSP2 Application of Digital signal processing to speech.Hardware realization of a Digital Frequency Synthesizer Special purpose hardware for FFT.Computer Voice Response system Applications to radar.the major logic families.methods of improving computer speed – parallel operations of memories.dividers and floating point hardware.Radar principle and application radar systems and parameter. ubiquitous wireless networks has made mobile computing a reality.prentice hall of India Practical Hands on experience in using commercial software packages for digital signal processing Developing academic exercise programs for Filter design and FFT analysis for real time applications CLASS: M. Doing FFT in FDP.channel vocoderanalyzers-synthesizers.Constraints-Realizations-ordering and pairing in cascade realizations-round of noise-fixed point analysis-Coefficient quantization – Limit cycle oscillations Spectrum analysis and the fast fourier Trans form-introduction to Radix-2 FFT’s-data shuffling and bit reversal-FFT computer programming-Decimation –in-Frequency Algorithm –Computing an Inverse DFT by doing a Direct DFT-Radix2 Algorithm-Spectrum analysis at a single point in the z plane-spectrum analysis in FFT Analysis-Windows in spectrum Analysis-Bluestein’s Algorithm-The chirp z transform algorithm. Hardware for Radix 2 Algorithm. Sc (Computer Science) SUBJECT: MOBILE COMPUTING.Voiced –Unvoiced Detection. Term I Lectures: 4 Hrs per week Practical: 4 Hrs per week Theory: 75 Marks Term work / Practical: 50 Marks Objective: Recent developments in portable devices and high-bandwidth.Comparison of Pipe line FFT’soverlapped FFT with random access memory-real time convolution via FFT using a single Ram and one AE General Purpose hardware for signal Processing facilities.Voiced Fricative excitation network. control and instruction fetches.FFT indexing.Cascade FIR filters-IIR filters. Term II An introduction to the theory of two dimensional signal processing-Two-dimensional signals-systemscausality. Reference Theory and application of Digital signal processing Lawrence R.seperability -stability-difference equations-Frequency Domain Techniques. multiplexers and decoders. Paper II. Arithmetic.Signal design and ambiguity functions. Special purpose hardware for digital filtering and signal generation-direct form FIR hardwareparallelism for direct form FIR.speech analysis-synthesis System based on short time spectrum analysis.the Linco Laboratory Fast Digital Processor(FDP). it is widely predicted that within the next 5 | DEPARTMENT OF COMPUTER SCIENCE.introduction to quantization effects in FFT Algorithms.
Wireless Transmission: Frequency for radio transmission. System architecture. Telecommunication Systems: GSM: Mobile services. TETRA. UTRA TDD mode 5. Tunneling and Encapsulation . Carrier sense multiple access. DETAILED SYLLABUS 1. Physical layer. Procedures and Entities. MEO. Wireless datagram protocol. Medium access control Sublayer. Mobile databases. Alternative metrics 10. MAC layer. IEEE 802. This course will help in understanding fundamental concepts. Medium access control layer. Information bases And Networking. Krishnamurthy . Signals. Addressing. “Wireless Networks”. Wireless application environment. Localization. Fast retransmit/fast recovery. “Wireless and Mobile Network Architectures”. Mobile quality of service. Multiplexing. Wiiliam Stallings. Classical Aloha. WATM services. Handover scenarios.few years’ access to Internet services will be primarily from wireless devices. 4. Future development. Indirect TCP. Ad hoc networks: Routing. Wireless transaction protocol. Wireless LAN: Infrared vs. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. Wireless session protocol. Mobile TCP. HIPERLAN: Protocol architecture. Protocols. Examples Stacks with Wap. WML script. John Wiley 4. Reservation TDMA. New data services. Mobile Network Layer: Mobile IP: Goals. YI Bing Lin . Physical layer. Bluetooth: User scenarios. MAC management. Networking. Signal propagation. Nicopolitidis . P. TDMA: Fixed TDM. Physical layer. Slow start. Optimizations. Radio access layer: Requirements. Wireless markup language. Digital video broadcasting 7.11: System architecture. UMTS and IMT-2000: UMTS Basic architecture. Rappaort. Localization And Calling. Channel access control. “Mobile communications”. PRMA packet reservation multiple access. with desktop browsing the exception. 3. Reference model: Example configurations. Security. Cellular systems. Wireless transport layer security. Selective retransmission. Mobile Transport Layer: Traditional TCP: Congestion control. Mobility supporting network side. Protocol architecture. Protocol architecture. World Wide Web: Hypertext transfer protocol. IP packet delivery. Security. 8. Cyclic repetition of data. UNIVERSITY OF MUMBAI . Addison wisely . Such predictions are based on the huge growth in the wireless phone market and the success of wireless data services. current developments in mobile communication systems and wireless computer networks. Implications on mobility. CDMA: Spread Aloha multiple access. Broadcast Systems: Overview. Inhibit sense multiple access. Support for Mobility: File systems: Consistency. “Wireless Communications and Networks” References : 1. “Principles of Wireless Networks” 5. 6 | DEPARTMENT OF COMPUTER SCIENCE. Forward handover. Hypertext markup language. UTRA FDD mode. Wireless application protocol: Architecture. Pearson Education TERM WORK 1. M. P. John Wiley 3. Some approaches that might help wireless access. A short history of wireless communication 2. Near and Far terminals. Routing. Jochen Schiller. Radio interface. Digital audio broadcasting: Multimedia object transfer protocol. Dynamic source routing. System architectures. K Pahlavan. Multiple access with collision avoidance. Backward handover. Handover. Pearson Education 2. Wireless ATM working group. Mobile agents Text Books: 1. Examples 6. Spread spectrum. Medium Access Control: Motivation for a specialized MAC: Hidden and Exposed terminals. Transmission/time-out freezing. Destination sequence distance vector. Radio transmission. Entities and Terminology. Access point control protocol 9. Hierarchical algorithms. Basics: GEO. Satellite Systems: History. Ipv6. Link management. Types of handover. Modulation. Snooping TCP. Richharia . Sublayer. Registration. Location management: Requirements for location management. FDMA. Demand assigned multiple access. Applications. Dynamic host configuration protocol. BRAN. Functions: Wireless mobile terminal side. Handover. assumptions and requirements. Wireless telephony application. SDMA. Agent advertisement and discovery. LEO. Transaction oriented TCP 11. Slotted Aloha. Antennas. Wireless ATM: Motivation for WATM. Handover: Handover reference model. Introduction: Applications. Reverse tunneling. “Mobile Satellite Communication: Principles and Trends”. Examples. Polling. Generic reference model. DECT: System architecture. Handover requirements. Infrastructure and Ad hoc Networks. “Wireless Communications Principals and Practices” 2. Fast retransmit/fast recovery.
CLASS: M. Continuous distribution. 2. Network of Queues. including modeling. Measure of performance and their estimation. Components of system. Meta modeling. 5. Verification. Simulation of super market. Geffery Gordon. 8. David Kelton. 7 | DEPARTMENT OF COMPUTER SCIENCE. Jerry Banks. Paper III. 11. Verification of simulation models. Comparison of several system design. Comparison and Evaluation of Alternative System Design: Comparison of two system design. Simulation Examples: Simulation of Queueing systems. John Carson. Calibration and Validation of models. Tests for random numbers. Academic Press Harcourt India 5. UNIVERSITY OF MUMBAI . Herbert Praehofer. Simulation of computer systems. Generation of pseudo random numbers. Narsing Deo. Output analysis of terminating simulators. 3. Donald W. both in terms of extent to which simulation is used and the range of applications. Identifying the Distribution of data. Output Analysis for a Single Model: Types of simulations with respect to output analysis. Queueing notations. 6. Barry Nelson. Optimization via simulation. Techniques for generating random numbers. Output analysis for steady state simulation 12. “System Analysis and Modeling”. Sc (Computer Science) SUBJECT: COMPUTER SIMULATION AND MODELING. Case Studies: Simulation of manufacturing systems. Random Number Generation: Properties of random numbers. David Nicol. Input Modeling: Data Collection. “Simulation with Arena”. 10. Advantages and Disadvantages of simulation. Selection input model without data. Averill Law. Parameter estimation. Randall Sadowski. 7. Acceptance rejection techniques 9. Long run measures of performance of Queueing systems. PHI 4. 4. 13. This course gives a comprehensive and state of art treatment of all the important aspects of a simulation study. General Principles: Concepts of discrete event simulation. Random Variate Generation: Inverse transform technique. TERM WORK 1. Goodness of fit tests. Academic Press 3. Simulation Software: History of simulation software. Introduction to Simulation: System and System environment. Generalpurpose simulation packages. Tag Gon Kim. W David Kelton. Discrete distribution. Steps in simulation study. McGRAW-HILL. “Discrete Event System Simulation” 2. Bernard Zeigler. DETAILED SYLLABUS 1. Term II Lectures: 4 Hrs per week Practical: 4 Hrs per week Theory: 75 Marks Term work / Practical: 50 Marks Objective: In the last five decades digital computer simulation has developed from infancy to a full-fledged discipline. Type of models. Other examples of simulation. and Validation. Statistical Models in Simulation: Useful statistical model. Steady state behavior finite population model. W. Trends in simulation software. Object oriented simulation. input modeling. Type of systems. Empirical distribution. Stochastic nature of output data. The field of modeling and simulation is as diverse as of man. PHI 2. Deborah Sadowski. Steady state behavior of infinite population Markovian models. McGRAW-HILL References: 1. The application of simulation continues to expand. “Theory of Modeling and Simulation”. Queueing Models: Characteristics of Queueing systems. Multivariate and Time series input models. Convolution method. “Simulation Modeling and Analysis”. Poisson process. Term work should consist of at least 10 practical experiments/Assignments covering the topics of the syllabus. “System Simulation with Digital Computer”. simulation software. Verification and Validation of Simulation Model: Model building. “System Simulation”. List processing. Desirable software features. Body. Simulation of pert network Text Books: 1. model verification and validation.
Paper IV. E. 2. Application and Trends in Data Mining: Applications. Languages. Clustering. 2. R. 5. “Data Mining Concepts and Techniques”.H. “Data Mining Introductory and Advanced Topics”. Data warehousing and the web. Analytical characterization: analysis of attribute relevance. Data Mining Algorithms: Classification. “Building the Data Warehouses”. 4. Data mining techniques. John Wiley. in terms of data models. M Berry and G. Query language. 3. Information Access And Delivery: Matching information to classes of users. Planning And Requirements: Project planning and management. Temporal mining. TERM WORK 1. 3. Introduction: Basics of data mining. Basic elements of data warehousing. OLAP in data warehouse. Data mining part of the model aims to motivate. Ralph Kimball. query language. John Wiley. Morgan Kaufmann References: 1. to motivate. John Wiley. “The Data Warehouse Toolkit”.G. John Wiley. Han. W. Visualisation : Data generalization and summarization-based characterization. M. Architectures of data mining systems 8. conceptual design methodologies. Architecture And Infrastructure: Architectural components. Data Design And Data Representation: Principles of dimensional modeling.CLASS: M. 4. Web Usage mining. Mallach. Overview And Concepts: Need for data warehousing. 3. and storage techniques. Kamber. Additional themes in data mining. UNIVERSITY OF MUMBAI . data quality. 5. 3. Term I Lectures: 4 Hrs per week Practical: 4 Hrs per week Theory: 75 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. Infrastructure and metadata. Web Mining: Web Content Mining. 2. “The Data Warehouse Lifecycle toolkit”. Data Mining: 1. Association rules. 6. Designing GUI based on a data mining query language. Wiley Dreamtech. Kimpall. 6. data extraction. Mining class comparisons: Discriminating between different classes. Pearson Education. growth and maintenance. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. transformation and loading. related concepts. Implementation And Maintenance: Physical design process. 8 | DEPARTMENT OF COMPUTER SCIENCE. 2. Linoff. define and characterize data mining applications. “Decision Support and Data Warehouse systems”. TMH. Systems products and research prototypes.H. and System Architectures: Data mining primitives. 5. DETAILED SYLLABUS Data Warehousing: 1. Data Mining Primitives. Dimensional modeling advanced topics. Knowledge Discovery : KDD Process 4. Dunham. Mining descriptive statistical measures in large databases 7. Collecting the requirements. Advanced Topics: Spatial mining. “Data Warehousing Fundamentals”. define and characterize data mining as process. Web Structure Mining. data warehouse deployment. Inmon. Paulraj Ponnian. Sc (Computer Science) SUBJECT: DATA WAREHOUSING AND MINING. Trends in data mining Text Books: 1. Trends in data warehousing. “Mastering Data Mining”.
OODBMS architecture and storage issues. apply the knowledge acquired to solve simple problems DETAILED SYLLABUS 1. Sc (Computer Science) SUBJECT: ADVANCED DATABASE SYSTEMS. OQL. Implementation issues. Thomson Learning. Systems comparison of RDBMS. Silberchatz. and type constructors. Object identity. Implementation issues for extended type. Subclasses. Object Relational and Extended Relational Databases: Database design for an ORDBMS Nested relations and collections. Structure of XML data. The semi structured data model. OODBMS. Joins. Relationship types of degree higher than two. Persistent programming languages. Concepts and architecture.J. 2. XML applications. The Extended Entity Relationship Model and Object Model: The ER model revisited. Indexes for text data 6. Motivation for complex data types. and thus to acquaint the students with some relatively advanced issues. 9 | DEPARTMENT OF COMPUTER SCIENCE. Storage and access methods. User defined abstract data types and structured types. 3. Implementation and Management”. and allocation techniques for distributed database design. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. Johannes Gehrke. Replication. learn about the Web-DBMS integration technology and XML for Internet database applications.CLASS: M. familiarize with the data-warehousing and data-mining techniques and other advanced topics. Deductive databases and Query processing. Pearson Education TERM WORK 1. Example of ODBMS 3. An overview of SQL3. Raghu Ramakrishnan. An overview of Client-Server architecture 5. Specialization and Generalization. UNIVERSITY OF MUMBAI . Term II Lectures: 4 Hrs per week Practical: 4 Hrs per week Theory: 75 Marks Term work / Practical: 50 Marks Objectives: To study the further database techniques beyond which covered in the second year. “Database Management Systems”. At the end of the course students should be able to: gain an awareness of the basic issues in objected oriented data models. Constraints and characteristics of specialization and Generalization. Data fragmentation. Object-Oriented Databases: Overview of Object-Oriented concepts.. Paper IV. Parallelizing individual operations. Storage of XML data. Inheritance. Distributed database concepts. Super classes. Database schema design for OODBMS. Sorting. Transactions and Concurrency control. Temporal database concepts. Type extents and queries. Query processing and Optimization. Document schema. Overview of XML. 2. Query processing in distributed databases. Parallel and Distributed Databases and Client-Server Architecture: Architectures for parallel databases. Enhanced Data Models for Advanced Applications: Active database concepts. Sudarshan . Text Books: 1. “Fundamentals of Database Systems”. McGraw-Hill References: 1. Mobile databases. “Database Systems. Encapsulation of operations. Object structure. McGraw-Hill. Type hierarchies and Inheritance. Spatial databases. Geographic information systems. “Database System Concepts”. Concurrency control and Recovery in distributed databases. and Persistence. Complex objects. Databases on the Web and Semi Structured Data: Web interfaces to the Web. Elmasri and Navathe. Design. ORDBMS 4. Parallel query evaluation. Methods. C. Pearson Education 2. Peter Rob and Coronel.Date. Korth. Querying XML data. “Introduction To Database Systems”. Longman.
Cache memories and management.V. Types of operating systems. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. Parallel sorting algorithms. F. “Fundamentals of Parallel Processing” 3.. GustafsonBarsis’s law. Pipelining. M. Complexity and cost. Culler. “Computer Architecture and Parallel Processing”. Program transformations 4. Debugging Parallel Programs: Debugging techniques. Simulation Programming. Algorithms for Parallel Machines: Speedup. Protocols designs and analysis considering deterministic and non-deterministic approach. 10 | DEPARTMENT OF COMPUTER SCIENCE. Second part Network programming is to be studied. McGraw Hill 2. Software tools 3. Introducing collective. Virtual memory system. PHI 3. C-Linda 8. Histogram computation. Introduction: Parallel Processing Architectures: Parallelism in sequential machines. Jorden H. Isoefficiency metric Text Books: 1. Solving diophantine equations. J. 2. Functional and logic paradigms. Shasikumar M. Quadrature problem. CLASS: M. Quinn. Interface. Matrix multiplication.J. Solving linear systems. Occam. Memory and I/O Subsystems: Hierarchical memory structure. “Practical Parallel Programming”. Amdahl’s law. Distributed shared memory 11.. Morgan Kaufman TERM WORK 1. Sc (Computer Science) SUBJECT: PARALLEL PROCESSING (Elective-I) Lectures: 4 Hrs per week Practical: 4 Hrs per week Theory: 75 Marks Term work / Practical: 25 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. “Parallel Programming”. Parallel reduction. UNIVERSITY OF MUMBAI . Programmability Issues: An overview. In third part we should study Network Design. Karf-Flatt metric. Array processors. Input output subsystems 10. A.. Parallel Programming languages: Fortran90. Debugging shared memory parallel programs 9.P. Debugging message passing parallel programs. Circuit satisfiability. Gupta. Message Passing Programming: Introduction. Wilson G.. Other Parallelism Paradigms: Data flow computing. Singh. Performance of Parallel Processors: Speedup and efficiency. Multiprocessor architecture. Data Dependency Analysis: Types of dependencies loop and array dependences. are to be considered. Hawang Kai and Briggs F. Shared Memory Programming: General model of shared memory programming. Benchmarking parallel performance 7. “Parallel Computer Architecture”. D. Cache allocation and management. Model. PHI 2. E. Probabilistic algorithms 6. Loop dependence analysis. Operating system support. as well as possible solutions DETAILED SYLLABUS 1. “Introduction to Parallel Processing”. recognize problems and limitations to parallel systems. TMH References: 1. Memory allocation and management. We expect natural thinking from student. Advanced technologies like High speed Devices etc. Drivers. A. Process model under UNIX 5. Not just SOCKETS but also protocols. For example he should able to consider different constraints and assume suitable data and solve the problems. Parallel programming models. Sc (Computer Science) SUBJECT: ADVANCED COMPUTER NETWORKS (Elective-I) Lectures: 4 Hrs per week Practical: 4 Hrs per week Theory: 75 Marks Term work / Practical: 25 Marks Objectives: In first part. and Alaghaband G. Abstract model of parallel computer.CLASS: M. nCUBE C. Systolic architectures.
Design tool. Harcourt Asia. ATM layer (Protocol model). Network capacities. Understanding the standards and their maker: Creating standards: players and Process.6.. LLC and MAC sub layer protocol. Varaiya. Access layer design. ATM protocol operation (ATM cell and Transmission). 6. “Data Network Design”. Traditional Traffic engineering. Akhtar. Traffic descriptors and parameters. Tuning the network. “Computer Networks”. Ethernet. “Computer Networks” 5. Switching in the LAN environment.DETAILED SYLLABUS 1. Access network capacity. 15. Backbone Network Design: Backbone requirements. PHI References: 1. Transport layer. Reliability and Maintainability. Copper access technologies. Theory of operations. Subscriber Interface and Access protocol. 13. Peterson & Davie. McCabe . Dense wavelength division multiplexing (DWDM). Air Access Technologies. Common WAN Protocol: ATM: Many faces of ATM. Public network service selection. Addressing and routing design. Accessing the Network. D. PHY layer. SMDS and IEEE 802. Network performance modeling. Application layer. Network layer functions. completing the access network design. Advantages and disadvantages of FR. Traffic characteristics. TMH 2. Harcourt Asia. Common Protocols and Interfaces in the Upper Layers(TCP/IP): Background (Routing protocols). Generic packet switching network characteristics. 11. Budget constraints. Topologies strategies. Term work should consist of at least 10 practical experiments and two assignments covering all the topics of the syllabus. “Networks for Computer Scientists and Engineers”. High speed LAN protocols comparisons. P. “High Performance Communication Networks”. Traffic contract and QoS. B-ISDN protocol reference model. Optical Networking: SONET/SDH standards. 6. “Data Networks”. Traffic and Congestion control defined. Access Network Design: Network design layers. Time and Delay considerations. Protocols.25. Standard computer architectures. Traffic sizing. ATM public services. Theory of Operation. network topology and hardware. Designing for peaks. Types of design projects. Text Books: 1. W. Mature Packet Switched Protocol: ITU Recommendation X. Token Ring. Categories of tools. 4. Zheng. “Unix Network Programming”.75 Internetworking protocol. Private verses public networking. Cable Access Technologies. 3. Pearson Education 2. Creating the traffic matrix. Application performance needs. Tanenbaum. S. Standard protocols. Traffic engineering basics (Traffic characteristics). Data Communications: Business Drivers and Networking Directions : Data communication Past and future. R. Stevens. Business aspects of Packet-Frame and cell switching services. “Practical Computer Analysis and Design”. Management plane. TCP/IP suite. ATM networking basics. UNIVERSITY OF MUMBAI . Queued data and packet switched traffic modeling. Darren L Spohn. Classes of design tool. 8. Requirements Definition: User requirements. 9. 12. Frame Relay: FR specification and design.R. Sub-DS3 ATM. Network layer (Internetwork layer). Technology Comparisons: Circuits-message-packet and cell switching methods. AAL Protocol model. User connectivity. Connectivity. X. A. Traffic Engineering and Capacity planning: Background (Throughput calculations) . Capacity planning and Network vision. Components of design projects. 5. Topologies. VoFR: Performance and Design considerations. Y. Service aspects.1. Delay or Latency.Walrand. Common Protocols and Interfaces in the LAN environment: Data link layers protocols. Availability and reliability. ATM layer and cell (Definition). Bertsekas. TERM WORK 1. 7. Fiber Access Technologies. Performance and Design considerations. Token Bus and FDDI. Current forums. James D. Physical Layer Protocols and Access Technologies: Physical Layer Protocols and Interfaces. Introduction to Transmission Technologies: Hardware selection in the design process. Vol. Bridge protocols. Layered reference models: The OSIRM. User plane overview. 11 | DEPARTMENT OF COMPUTER SCIENCE. J. Control plane AAL. 10. 14. Gallager. Morgan Kaufmann 3. Addressing and Traffic control. 2. switched multimegabit data service (SMDS). Oxford 4. Packet switching service aspects.S. Availability.
Arguments for and against risk analysis. Interception of Sensitive Information. and Ethical Issues in Computer Security: Protecting programs and data. Computer crime. Salami Attack. P. 4. Interface. Organizational security policiesPurpose and goals of Organizational Security. Relocation. Privacy. Kinds of malicious code. Matt Bishop. Vulnerabilities. Interruption.The nature of risk. Program Security: Secure programs: Fixing Faults. Characteristics of a Good Security Policy. Authentication Process Challenge-response.Principles of Adequate protection. Prevention. Availability and Authorization. UNIVERSITY OF MUMBAI . Sc (Computer Science) SUBJECT: INFORMATION & SYSTEM SECURITY (Elective-I) Lectures: 4 Hrs per week Practical: 4 Hrs per week Theory: 75 Marks Term work / Practical: 25 Marks Objectives of the course: Learn about the threats in computer security.Security Policies for Operating Systems. “Cryptography And Network Security: Principles and practice” References : 1. Limitations of Security Systems. Computer Criminals: Amateurs. 6. Paging.Fence.Natural Disaster. Case studies of ethics Text Books: 1. Hardware Controls. Base/Bounds Registers. Password. 2. Incomplete Mediation. 3.Directory. Trusted Operating systems. Pearson Education. File protection mechanism. Ethical issues in computer society. Pearson Education. Access Security. How viruses attach. Government Agency IT security policy. Modification. Peer reviews. Database security. Pfleeger. Memory address protection. Sensitive data. Control of access to general objects. Stallings. Biometrics. Operating security. Confidentiality and Availablity. Integrity. Whitman. DETAILED SYLLABUS 1. Proposals for multilevel security 5. Models of Security. Pfleeger. Multilevel database. Risk analysis. Network Security (Notions Only). Relation between Security-Confidentiality. The kind of problems-Interception. Targeted malicious code. Effectiveness of Controls. Multilevel Security. Attacks: Threats. Access Control List. Physical security. 3. steps of risk analysis. Software failures. Program security. Nature of security Policies. Administrating Security: Security planning. The Internet Worm. Control Example: The Brain virus.Requirement of security systems. security features.Integrity of Database. Authentication: Authentication basics.Trapdoors. Web bugs. Crackers.Data sensitivity policy. system flaws and assurance methods. Controls against program threatsDevelopment Controls. Introduction: Notion of different types of securities : Information Security. “Security in Computing”. Single Permissions. Unexpected Behaviour. L. Database Security: Security requirements. Types of Flaws. Mattord. Information and law. Software Controls. commitment to a security plan. Privacy. Viruses and other malicious code: Why worry about Malicious Code.Elements. “Principles of information security”. Trusted Operating System Design. Vulnerabilities and controls. Human Vandals. Segmentation. “Computer Security: Art and Science”. Thomson CLASS: M. Hazard Analysis. Tagged Architecture. Computer Security: Security Goals. Career Criminals. Legal.CLASS: M. Operating System Security: Protected objects and methods of protection. Controlling a risk is not eliminating the risk but to bring it to a tolerable level. Non-malicious program errors: Buffer overflows.Basics forms of Protection. Sc (Computer Science) SUBJECT: NETWORK AND INTERNET SECURITY (Elective-I) Lectures: 4 Hrs per week Practical: 4 Hrs per week Theory: 75 Marks Term work / Practical: 25 Marks 12 | DEPARTMENT OF COMPUTER SCIENCE. assurance. Understand what puts you at a risk and how to control it. 2. How viruses gain control. Fabrication. Reliability and integrity. Business continuity Plans. Audience.Contents of a security Planning Team members. and S. C. Methods of Defense: Control. Rights of employees and employers.
Social Engineering. Web Security: Overview of Web Server Security. 3. Pfleeger. Understand what puts you at a risk and how to control it.Objectives of the course: Learn about the threats in Network and Internet security. Protocol overview. S/MIME functionality. IDS Strength and Limitation. Controlling a risk is not eliminating the risk but to bring it to a tolerable level. NTP. Hash Algorithms. Web site defacement. Concepts of Encryption and Decryption. The complete Reference Network Security by Bragg. Pfleeger. Practical Experience. Packet Filtering. 6. DNS Security: Unpatched Servers. John Wiley. Wireless Application Protocol Security (WAP): Privacy Enhanced Mail (PEM) How PEM works? Secure Socket Layer (SSL): The Position of SSL in TCP/IP Protocol Suite. Pearson Education. Kaufman. Rhodes-Ousley. 5. FTP (File Transfer Protocol) SMTP (Simple Mail Transfer Protocol). Authentication Failures. Dynamic Packet Filters. Aviel D. TMH 4. Bruce Schneier. Data corruption. Eric Maiwald. Goal for Intrusion Detection systems. Firewalls: Basic Concepts (for understanding the firewalls rules): TCP Segment format IP Datagram format. Message Authentication and Hash Function. Text Books: 2. Web Server Protection. Packet Filters. Matt Bishop. Data Theft. Demilitarized Zone (DMZ) Networks. Distributed Firewalls. Classical Encryption Technique: Symmetric and Asymmetric Encryption Systems. NTP (Network Time Protocol). Protocol Failure. Luring Users into a Crafted Site. “Applied Cryptography”. The Internet Key Exchange (IKE) Protocol. “Network Security : A Beginner’s Guide”. Encapsulating Security Payload (ESP). Intrusion detection systems: Types of IDSs. Wireless Application Protocol Security (WAP): The WAP Stack. Electronic Mail Security: Security for E-mail. 3. Circuit-Level Gateways. Macro Pistoia. “Java Network Security “. Stream and Block Ciphers. Hierarchal Structure. Web. and S. Contemporary Symmetric Ciphers. Perlman. Distributed Denial of Service Attack. Limitation of Firewalls. Digital Signatures and Authentication Protocols. Security Association (SA). Filtering Services: Reasonable Services to Filter (Filter Rules to be applied): DNS. Speciner. Atul Kahate. IP Security: Introduction and Overview: IPSec Protocols. The Record Protocol. Stealing Passwords. Trust worthy Encryption systems Data encryption standards (DES) and Advanced Encryption Standards (AES) Comparison of DES and AES. “Security in Computing”. “Network Security” 3. “Computer Security: Art and Science”. Steven M. 4. UNIVERSITY OF MUMBAI . Confidentiality using Symmetric Encryption. Elementary Cryptography: Terminology and Background. Substation Cipher. The Security Layer-Wireless Transport Layer Security (WTLS). 5. Goal of Server Attack. IPSec Key Management. C. DNS Cache Poisoning: Denial of Service Attack. 5. Firewall Configurations. Introduction: Kinds of Firewalls. Example of Secure E-mail Systems. P. DNS (Domain Name Server): DNS overview. Root Servers. Public Key Encryption and HASH Functions: Public Key Cryptography and RSA. Transpositions Good and Secure Encryption Algorithm. DETAILED SYLLABUS 1. FTP. Misconfigured Servers. References : 1. L. Firewalls and Internet Security by William R. Types of Attacks. “Cryptography and Network Security”. Authentication Header (AH). William Stallings-Third Edition. Designs. Bugs and Backdoors. Cheswick. 8. Pretty Good Privacy (PGP): How PGP works? S/MIME (Secure Multipurpose Mail Extension): MIME overview. 4. Pearson Education 2. Pearson Education Assignments: 10 assignments covering the syllabus has to be submitted 13 | DEPARTMENT OF COMPUTER SCIENCE. The Alert Protocol. Bellovin. Cryptography and network security. 2. Rubin 6. Cryptanalysis. 7. Security in Network: Model for Security: Threats in Networks. “Cryptography and Network Security: Principles and practices”. Application-Level Filtering. Information Leakage. How SSL Works? The Handshake Protocol.
Repeaters. Burst Errors. Connection Multiplexing. Frame Headers And Frame Format. Identifying Packet Contents. Network Analyzers LAN Wiring. Infrared. Bus Network: Ethernet Carrier Sense on Multi-Access Networks (CSMA). Baud Rate. Bridging And Switching With Other Technologies Long-Distance Digital Connection Technologies Digital Telephony. and Errors. Combining Building Blocks. Modulation and Modems) Sending Signals across Long Distances. Frame Filtering Startup and Steady State Behavior of Bridged Networks. How LAN Hardware Uses Addresses to Filter Packets Format of a Physical Address. Mastering the Complexity. Growth of the Internet. Network Interface Cards and Wiring Schemes. Digital Circuits and DSU. Parity Bits and Parity Checking. Transmission Errors. Broadcasting. Low Earth Orbit Satellites. Physical Topology. Geosynchronous Satellites. Spread Spectrum. Combining Switches And Hubs. Packets and Hardware Frames. Bridging Between Buildings. Leased Analog Data Circuits. Frame format And Error Detection Mechanisms LAN Technologies and Network Topology Direct Point-To-Point Communication. Glass Fibers. Original Thick Ethernet Wiring. Using Electric Current to Send Bits. Planning a Bridged Network. Limitations of Real Hardware. Multicasting. Byte Stuffing. Multicast Addressing. Synchronous Communication. Thin Ethernet Wiring Twisted Pair Ethernet. Time Division Multiplexing PART II PACKET TRANSMISSION Packets. Modem Hardware Used for Modulation and Demodulation. Base band And Broadband Technologies Wave Division Multiplexing. Detecting Errors With Cyclic Redundancy Checks. Satellites. Telephone Standards 14 | DEPARTMENT OF COMPUTER SCIENCE. And Dialup Modems. the Connection between A NIC and A Network. Collision Detection and Back off With CSMA/CD. and Interface Hardware Speeds of LANs and Computers. Wireless LANs And CSMA/CA. Radio Frequency. Extending LANs: Fiber Modems.CLASS: M. Hardware Bandwidth and the Transmission of Bits. Bridges and Switches Distance Limitation and LAN Design. Low Earth Orbit Satellite Arrays. The Effect of Noise On Communication. Mathematics And Error Detection. Significance of LANs and Locality of Reference. Full Duplex Asynchronous Communication. Microwave. Frames and Error Detection The Concept of Packets. Resource Sharing. Bridges. Framing. Bridging Across Longer Distances. UNIVERSITY OF MUMBAI . Light Form a Laser Local Asynchronous Communication The Need for Asynchronous Communication. Probing the Internet. Interpreting A Ping Response PART I DATA TRANSMISSION Transmission Media Copper Wires. Shared Communication Channels. Radio. Packets and Time-Division Multiplexing. Probability. Bus Network: Local Talk Hardware Addressing and Frame Type Identification Specifying a Recipient. A Cycle Of Bridges. Standards for Communication. Significance for Data Networking Long-Distance Communication (Carriers. Network Interface Hardware. Sc (Computer Science) SUBJECT: ENTERPRISE NETWORKING (Elective-I) Lectures: 4 Hrs per week Practical: 4 Hrs per week Theory: 75 Marks Term work / Practical: 25 Marks Introduction Growth of Computer Networking. Carrier Frequencies and Multiplexing. Complexity in Network Systems. Optical. Fiber Optic Extensions. Detecting Errors With Checksums. LAN Topologies. Switching. the Topology Paradox. Repeaters. Using Networks That Do Not Have Self-Identifying Frames. Distributed Spanning Tree.
Connection Duration and Persistence. Routing In A WAN. orbital parameters. sun-synchronous orbit. Examples of Service Paradigms. ionospheric depolarization. Service Paradigm. Galgotia. TERM WORK Term work should consist of at least 10 assignments from the aforementioned topics. REFERENCE Computer Network. link power budget equation. double relflector antennas. PHI Networking Technology. Satellite Orbits: Introduction. the C Suffix. How Layered Software Works. Cable Modem Technology. inclined orbits. antenna look angles. laws governing satellite motion. 3. frequency allocations for satellite services. Douglas E. UNIVERSITY OF MUMBAI . basic satellite system. A Plan for Protocol Design. Lower Capacity Circuits. Addresses and Connection Identifiers. Theory: 75 Marks Term work / Practical: 25 Marks Introduction: General background. Distributed Route Computation. Bertsekas. Sc (Computer Science) SUBJECT: SATELLITE COMMUNICATIONS (Elective-I) Lectures: 4 Hrs per week Practical: 4 Hrs per week 1. Shortest Path Computation in a Graph. parabolic reflectors. Optical Carrier Standards. cross polarization discrimination. Satellite Antenna: Antenna basics. system design considerations. Doppler effects.DS Terminology and Data Rates. ISDN. launching of geostationary satellites. Store and Forward Physical Addressing In A WAN. transmission losses. PHI Computer Networks and Internets. Wave Propagation and Polarization: Introduction. 5. offset feed. carrier to noise ratio for uplink and downlink. the Scientific Basis for Layering. Forming A WAN. ice depolarization. 4. Virtual Private Networks. sun transit outage. Hybrid Fiber Coax Wan Technologies and Routing Large Networks and Wide Areas. Synchronous Optical Network (SONET). the Seven Layers. Earth eclipse of satellite. Data Networking. applications. Service Paradigm. orbital perturbations. rain attenuation. Multiple. A Seminar to be presented by each student as part of term works carrying 15 marks. Next-Hop Forwarding. aperture antennas. system noise. Relationship of Hierarchical Addresses to Routing. rain depolarization. Network Performance Characteristics Protocols and Layering The Need for Protocols. shaped reflector systems. the Local Subscriber Loop. Nested Headers. atmospheric losses. Routing Table Computation. Intermediate Capacity Digital Circuits Highest Capacity Circuits. Stacks: Layered Software. Upstream Communication. Tuekeun. 15 | DEPARTMENT OF COMPUTER SCIENCE. inter modulation noise 2. Link Design: Introduction. Use of Defaults Routes. polarization of satellite signals. Packet Switches. geostationary orbit. other impairments. limits of visibility. antenna mount. ionospheric effects. Protocol Suites. antenna polarization. combined uplink and downlink carrier to noise ratio. Comer Pearson Education Asia CLASS: M. Asymmetric Digital Subscriber Line Technology Other DSL Technologies. Source Independence. and Performance Network Ownership. Jaiswal. Distance Vector Routing Network Ownership.
“Introduction to Artificial Neural Systems. reasons. Operations on fuzzy relations. UNIVERSITY OF MUMBAI . 4. K-means and LMS algorithms. Zurada J. error performance . “An Introduction to Fuzzy Control”. CDMA. “Introduction to Applied Fuzzy Electronics”. McGraw Hill 4. Richharia – 2nd edition Mc Millan publication. FDMA/TDMA. Ross. algorithm formulation and ways to apply these techniques to solve real world problems. design considerations. FDMA. “Artificial Neural Networks”. space segment cost estimates. Communication Satellites: Introduction. design considerations. Norosa Publishing House 3. Simulated Annealing: The Boltzmann machine. “Fuzzy Logic with Engineering Applications”. design considerations. comparison of RBF and MLP networks. & Reinfrank M. Boltzmann learning rule. Jaico publishers 3. theorem and the reparability of patterns. Network architectures. 3. 2. Fuzzy relations. Operations on fuzzy sets. Multilayer Perceptron: Derivation of the back-propagation algorithm. Bidirectional Associative Memory. case study.. Hellendoorn H. Method of steepest descent . 8. Radial Basis and Recurrent Neural Networks: RBF network structure. fuzzy logic systems and their applications. Learning Rules. Supervised learning. 9.C.least mean square algorithms. CLASS: M. Text Books: 1. 6. Fuzzification and defuzzification methods. Learning Factors. Earth Stations: Introduction. Fuzzy logic: Fuzzy sets. Satellite Communications – Dennis Roddy – 3rd edition.M. 7.. Fuzzy measures. operation in a multiple beam environment. lifetime and reliability. TDMA. Hopfield networks: energy function. Ahmad Ibrahim. Fuzzy controllers.6. general configuration and characteristics. Membership functions. Yegnanarayana B. The extension principle. “Fuzzy Systems Design Principles”. Types of activation function. PHI References: 1. Pearson Education 2. Single Layer Perceptron: Perceptron convergence theorem. spacecraft mass and power estimations. Simon Haykin.Comprehensive Foundation”. Satellite Communications systems – M. Properties. Unsupervised learning. RBF learning strategies. 16 | DEPARTMENT OF COMPUTER SCIENCE. “Neural Network a . PHI 2. Learning process: Error-correction learning. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. multiple access examples Non Geostationary Orbit Satellite Systems: Introduction. Driankov D. spurious states. Sc (Computer Science) SUBJECT: NEURAL NETWORKS & FUZZY SYSTEMS (Elective-I) Lectures: 4 Hrs per week Practical: 4 Hrs per week Theory: 75 Marks Term work / Practical: 25 Marks Objective: This course covers basic concepts of artificial neural networks. Introduction: Biological neurons.L. spacecraft sub systems.. and Trubatch S. Its focus will be on the introduction of basic theory. 5. Mc-Graw Hill publication 2. IEEE Press TERM WORK 1. Multiple Access Techniques: Introduction. Term Work: 1. McCulloch and Pitts models of neuron.. DETAILED SYLLABUS 1. Berkan R. example of systems. Knowledge representation. Assignments covering the entire syllabus Text Books: 1. Thimothy J...
Multimedia Conferencing Architecture Application Multimedia Groupware Computer and Video fusion approach to open shared wok place. Track model and Object model. and QOS Architecture. barriers to wide spread use. and the User Interface Client control of continuous multimedia. Key challenges ahead. video equipments. Digital representation of sound. Net work services. The JPEG Image Compression Standard. and protocols. DVI Technology Operating System Support for Continuous Media Applications Limitation of Work station Operating system. Analog video Artifacts. and entertainment products The technology trends. Emerging applications. Requirements of Multimedia Communications. Social Architectures and issues for Distributed Multimedia systems Distributed Multimedia systems. Digital music making. applications Multimedia Interchange Quick time Movie File Format. Content. Multimedia appliances. toolkits. A frame work for Multimedia systems Digital Audio Representation and processing Uses of Audio in Computer Applications. High Definition Television and desktop computing. Psychoacoustics. Sc (Computer Science) SUBJECT: MULTIMEDIA SYSTEMS AND CONVERGENCE OF TECHNOLOGIES (Elective-I) Lectures: 4 Hrs per week Practical: 4 Hrs per week Theory: 75 Marks Term work / Practical: 25 Marks Defining the scope of multimedia. Real Time Interchange Multimedia conferencing Teleconferencing Systems. World wide television standards Digital Video and Image Compression Video compression techniques. Colour Fundamentals. Media stream protocol Multimedia Devices. Shared Architecture and embedded Distributed objects. HDTV standards. The file system support for continuous Media. transmission of digital sound. hyper applications Multimedia File systems and Information Models The case for multimedia information systems. New OS support. digital audio and the computers Video Technology Raster Scanning Principles. Knowledge based Multimedia systems. regulatory. Hybrid Devices. The challenges The convergence of computers. The role of Standards. industry perspective of the future. Multimedia on the map. Speech recognition and generation.CLASS: M. Multimedia and personalised computing. Temporal coordination and composition. The EPEG Motion Video Compression Standard. Data models for multimedia and Hypermedia information. Colour Video. standardization of Algorithm. Anatomy of an Intelligent Multimedia system Text Book Multimedia Systems by John F. Koegel Buford. Designers perspective. research trends Multimedia Services over the Public Networks Requirements.based Retrieval of Unstructured Data Multimedia presentation and Authoring Design paradigms and User interface. Sensors for TV Cameras. Device control. Video performance Measurements. ITU-T Recommendations. Technical. Format Function and representation. QMFI. Hypertext and Collaborative research. Communications. Multimedia system services Architecture. UNIVERSITY OF MUMBAI . Synchronization. Presentation Services.Pearson Education 17 | DEPARTMENT OF COMPUTER SCIENCE. Digital Audio signal processing. Experiments Using Real Time Mach Middleware System Services Architecture Goals of Multimedia System services. MHEG (Multimedia and Hypermedia Information Encoding Expert Group). Architecture.
Decision trees. Improvement in basic techniques. Defining Programs. A simulation by hands.armed and k-armed Bandit Problem. The for Function . Rules vs Principles. designing decision support systems. Fuzzy systems and applications. Neural Networks and Fuzzy systems Neural and fuzzy machine Intelligence. Machine learning and methodology of science. OLAP tools. The Isa Hierarchy. PulseCoded Signal functions Genetic Algorithms A simple genetic algorithm. Neural networks. Drew McDermott. Predicates and Arguments. Generating Fuzzy rules with product space Clustering. signal monotonicity. Learning as change. Customer profiling. Introduction to Genetics based machine learning. Fuzzy systems as Principle based Systems Neural Network Theory Neuronal Dynamics: Activations and signals. More on Predicates. Building Up List Structure. Real life applications. Scope of Variables. similarity templates(Schemata). Sc (Computer Science) SUBJECT: ARTIFICIAL INTELLIGENCE. Term I Lectures: 4 Hrs per week Practical: 4 Hrs per week Theory: 75 Marks Term work / Practical: 25 Marks 1. Concept learning. AI and Internal Representation Artificial Intelligence and the World. Generalization and creativity. Fuzziness as Multivalence. Pointers and Alternative Notations. The two. Indexing. Reproduction . Knearest neighbor. Data Mining by Pieter Adriaans and Dolf Zantinge – Pearson Education Asia 5. Setting up a KDD environment. Properties. Neurons as functions. Intelligent Behavior as Adaptive Model free Estimation. Atoms and Lists. Data Mining : Introduction to Data Mining. Basic Flow of Control in Lisp. Fuzzy systems as Structured Numerical estimators. The minimal Deceptive Problem Computer implementation of Genetic algorithm. Typing at Lisp. Schema Processing at work. Addison –Wesley 18 | DEPARTMENT OF COMPUTER SCIENCE. Neural Networks as trainable Dynamical system. Pointers. Symbolic vs Numeric Processing. Data Warehousing in the Real World by Sam Anahory and Dennis Murray. Cross over and Mutation. applications of genetic based machine leaning 1. Destructive Modification of Lists. Computer systems that can learn. Optimization & Machine Learning by David E Goldberg-Addison wesley 4. Time to reproduce and time to Cross Mapping objective function to fitness form. Neuron Dynamical Systems. Lisps Lisps. Symbol vs Numbers. How to Use the Predicate Calculus. Lisp Style. Discovering foreign key relationships Assignments 10 assignments covering the syllabus has to be submitted Text book 1. Fitness scaling Applications of genetic algorithm. Expert system Knowledge as rule trees. Representation in AI. The Dynamical Systems approach to Machine Intelligence. Data ware house. Neural Networks and fuzzy systems A dynamical systems approach to machine Intelligence by Bart Kosko.CLASS: M. UNIVERSITY OF MUMBAI . Paper I. Introduction to Artificial Intelligence By Eugene Charniak. Slot-Assertion Notation. Fuzzy Systems as Parallel associators.Addison Wesley 2. The building block hypothesis. De Jong and Function Optimization. Biological Activations and signals.Recursion.PHI 3. Neuron Fields. Input/Output. Data Structures. Genetic Algorithms in search. Client server and data warehousing. Properties of Internal Representation. Neural and fuzzy systems as function Estimators. Visualization Techniques. Connectives Variables and Quantification. Basic Debugging. The brain as a dynamical system. Cell Notation and the Internals (Almost) of Lisp. Other Kinds of Inference Indexing. Mathematical foundations. Macros 3. Common signal functions. Knowledge Discovery Process. Frame Notation 2. Genetic algorithm. The Predicate Calculus.
John Wiley 2. Erosion. Image compression standards: Binary image and Continuous tone still image compression standards. There is an abundance of image processing applications that can serve mankind with the available and anticipated technology in the near future. Homomorphic filtering 5.C. Walsh transform. Video compression standards.Woods. Structure of human eye. Optimum transform: Karhunen . Processing. Slant transform. Morphological algorithm operations on binary images. Image sensing and acquisition. Anil K. Storage. Series expansion. Wavelet transforms in two dimensions 6. Morphological algorithm operations on gray-scale images 8. Hit-orMiss transformation. Roger Boyle. Basic relationships between pixels 2. Image processing holds the possibility of developing the ultimate machine that could perform the visual functions of all living beings. Image compression models.R. Region based segmentation 9.Vaclav Hlavac. Image Representation and Description: Representation schemes. Thresholding. “Fundamentals of Image Processing”. Image Enhancement in the Spatial Domain: Gray level transformations. Lossy compression. Communication. Morphological Image Processing: Introduction. Spatial filtering: Introduction. Smoothing and sharpening filters 4. Paper I. Regional descriptors Text Books: 1. Dutta Majumder. IFFT. William Pratt. Edge linking and Boundary detection. Chanda. “Digital Image Processing”. Haar transform.CLASS: M. Error free compression. Image Enhancement in the Frequency Domain: Frequency domain filters: Smoothing and Sharpening filters. PHI References: 1. Rao. Discrete wavelet transforms in one dimensions. FFT. “Orthogonal Transforms for Digital Signal Processing” Springer 4.Loeve (Hotelling) transform. N Ahmed & K. B. “Image Processing. Image Segmentation: Detection of discontinuities. UNIVERSITY OF MUMBAI . Fast wavelet transform. DETAILED SYLLABUS 1. TERM WORK 1. Brightness adaptation and discrimination. Dilation. Redundancies: Coding. PHI. Closing. Opening. 3. Term II Lectures: 4 Hrs per week Practical: 4 Hrs per week Theory: 75 Marks Term work / Practical: 25 Marks Objective: Digital Image Processing is a rapidly evolving field with growing applications in science and engineering. Histogram processing. Subband coding. Interpixel. Discrete cosine transform. Psycho-visual. and Machine Vision” Thomson Learning 3. Second Edition. “Digital Image Processing and Analysis”. Image sampling and quantization. Hadamard transform. DFT and 2-D DFT. Scaling functions. Display. 7. Image Transforms (Implementation): Introduction to Fourier transform. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. Wavelets and Multiresolution Processing: Image pyramids. Pearson Education 2. Boundary descriptors. Image formation in the human eye. Arithmetic and logic operations.Gonsales R. Digital Image Processing Systems: Introduction.Jain. Analysis. D. 19 | DEPARTMENT OF COMPUTER SCIENCE. Sc (Computer Science) SUBJECT: IMAGE PROCESSING. Fidelity criteria. Milan Sonka. R. Image Data Compression: Fundamentals. “Digital Image Processing”. Wavelet functions. Properties of 2-D DFT.E.
and Client-Server model. Software agent. Code Migration. Distributed File System: Sun network file system.CLASS: M. 8. This course deals with various approaches to building embedded systems. Reliable group communication. Embedded Software development: Concepts of concurrency. Software concepts. UNIVERSITY OF MUMBAI . 4. Standard I/O functions. Message-oriented communication. CODA files system. Term II Lectures: 4 Hrs per week Practical: 4 Hrs per week Theory: 75 Marks Term work / Practical: 25 Marks Objective: Embedded system tools and products are evolving rapidly. Distribution protocols. Singhal. 5. Kindberg. 9. The design issues and distributed operating system concepts are covered. 10. Servers. Stream-oriented communication. Logical clocks. J. Introduction to design technology 2. Processes: Threads. Naming: Naming entities. Mixing C and Assembly. Coulouris. Sc (Computer Science) SUBJECT: EMBEDDED SYSTEMS. Synchronization: Clock synchronization. N. Distributed COM. Election algorithms. Categories and requirements of embedded systems. Mutual exclusion. Recovery. DETAILED SYLLABUS 1. 6. Basic design using RTOS 3. Distributed commit. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. and T. Communication: Layered protocols. Security: Introduction. DCOM. Introduction to IC technology. Scheduling paradigms. Consistency protocols. “Distributed Systems: Principles and Paradigms” 2. Models and languages for embedded software. Paper II. threads. Term I Lectures: 4 Hrs per week Practical: 4 Hrs per week Theory: 75 Marks Term work / Practical: 25 Marks Objective: This course aims to build concepts regarding the fundamental principles of distributed systems. 7. DETAILED SYLLABUS 1. Remote object invocation. Secure channels. Shivaratri. Programming the target device 20 | DEPARTMENT OF COMPUTER SCIENCE. Remote procedures call. Synchronous approach to embedded system design. “Advanced Concepts in Operating Systems”. Dollimore. Text Books: 1. Fault Tolerance: Introduction. Locating mobile entities. Consistency and Replication: Introduction. Introduction to Distributed System: Goals. Hardware/Software co-design. Challenges and issues related to embedded software development. processes. Introduction to RTOS. Taunenbaum. M. Examples of distributed systems. TMH TERM WORK 1. Distributed transactions. Process resilience. CLASS: M. Reliable client server communication. A. Preprocessor directives. 2. mutual exclusion and inter-process communication. “Distributed Systems: Concepts and Design”. G. Client centric consistency models. Sc (Computer Science) SUBJECT: DISTRIBUTED COMPUTING. Scheduling algorithms. 3. Pearson Education References: 1.Case Study: CORBA. and Globe. It introduces unified view of hardware and software. Paper II. Security management. Access control. The aim of this course is to make the students aware of the various applications of embedded systems. Global state. An overview of embedded systems: Introduction to embedded systems. Hardware concepts. Study of C compilers and IDE. Globe. Clients. Comparison of CORBA. Removing un-referenced entities. Embedded C Language: Real time methods. Data centric consistency models.
kn-Nearest-Neighbor estimation. Classifiers. Two experiments using developments tools like logic analyzer. Barnett. “Embedded C Programming and the Atmel AVR ". UNIVERSITY OF MUMBAI . Analog interfaces. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. manufacturing. Four experiments using cross C compiler and Linux. Maximum-Likelihood and Bayesian Parameter Estimation: Maximum likelihood estimation. Hardware for embedded systems: Various interface standards. Cox. Multicategory generalizations 6. Parallel I/O ports. Interfacing of data acquisition systems. Study of ATMEL RISC Processor: Architecture. Tony Givargis. TMH TERM WORK 1. Memory and high speed interfacing. Reset and interrupt . CART. “Fundamentals of Embedded Software”. Thomson Learning 5. Network Router. Prolems of dimentionality. Four experiments on micro controller based systems. Case Studies of: Digital Camera. Linear Discriminants Functions: Linear discriminant functions and decision surfaces.II). David E. “Embedded Systems”. Minimising the Perceptron criterion function. Design cycle. Introduction: Machine perception. Pattern recognition systems. 4. image processing. Implementation of above concepts using C language 5. Implementation of above concepts using C language 6. Craig Hollabaugh. emulator and simulator. Parzen windows. keypads and display units. Timers/Counters. technical and medical diagnostics. Case studies and Applications of embedded systems: Applications to: Communication. Paper IV. Pearson Education 3. Minimum squared error procedure. RTLinux Text Books: 1. Daniel Lewis. Raj Kamal. Frank Vahid. Discriminant functions and Decision surfaces. classification. Memory. Simon.5. Serial communication interface. ID3. Bayesian estimation. Serial communication.4. Implementation of above concepts using C language. Sc (Computer Science) SUBJECT: PATTERN RECOGNITION (Elective . Blind counting synchronization and Gadfly Busy waiting. Nonparametric Techniques: Density estimation. Nearest-Neighbor rule. Normal density. DETAILED SYLLABUS 1. Two experiments on case study of advanced embedded systems CLASS: M. 2-Category linearly separable case. Matrics and Nearest-Neighbor classification 5. Process Control. such as engineering system design. to be utilized for problem-solving in a wide variety of applications. economics. “The 8051Microcontroller and Embedded Systems". Gramatical methods. Myke Predko. functions. Bayes Decision theory: discrete features 3. Pearson Education References: 1. Bayesian Decision Theory: Bayesian decision theory: Continuous features. “Embedded Linux". C4. Networking. Pearson Education. psychology. O’Cull. Muhammad Ali Mazidi and Janice Gillispie Mazidi. Learning and Adaptation 2. Nonmetric Methods: Decision tree. “An Embedded Software Primer ". Hidden Markov Model 4. Interfacing of controllers. Minimum-error rate classification. Term I Lectures: 4 Hrs per week Practical: 4 Hrs per week Theory: 75 Marks Term work / Practical: 25 Marks Objective: This course teaches the fundamentals of techniques for classifying multi-dimensional data. “Programming and Customizing the 8051 Microcontroller”. Gramatical 21 | DEPARTMENT OF COMPUTER SCIENCE. Ho-Kashyap procedures. Discriminant functions for normal density. Pearson Education 3. Parallel port interfacing with switches. Bayesian parameter estimation: Gaussian caseand General theory. TMH 2. Generalised linear discriminant functions. John Wiley 2. Non-separable behavior. Various methods of interfacing. “Embedded System Design: A Unified Hardware/Software Introduction". Parallel I/O interface. Relaxation procedure. Database.
Jean Ponce. “Image Processing. Image matching : Intensity matching of ID signals. Duda. Addison-Wesley. Split & merge. Local features. 6. methods and concepts which will enable the student to implement computer vision systems with emphasis on applications and problem solving DETAILED SYLLABUS 1. Unsupervised Learning and Clustering: Mixture densities and Identifiability. “Computer Vision: A Modern Approach” 2. 1993. Applications of Pattern Recognition Text Books: 1. Object Models And Matching: 2D representation. Shape numbers. Analysis. Labeling. Motion-based segmentation. Spatial operators for edge detection. Jain. 7. Ordered –Structural matching. Hierarchical clustering 9. Roger Boyle. Inverse perspective Projection. PHI TERM WORK 1. Mixed spatial gray-level moments. Matching. 3. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. Hierarchical image matching. 2. Photogrammetry – from 2D to 3D. Kasturi. Global vs. “Computer and Robot Vision”. MaximumLikelihood estimations. Robert Haralick and Linda Shapiro. region shrinking.Vaclav Hlavac. References: 1. Models database organization. Hough transform. Connected component labeling. Classification of shapes by labeling of edges. Morphological operators. Facet Model Recognition: Labeling lines. Back-tracking. Extracting. View class matching. General Frame Works: Distance –relational approach. 4. UNIVERSITY OF MUMBAI . Models database organization. 2. David A. “Pattern Recognition and Image analysis”. Knowledge Based Vision: Knowledge representation. Recognition of shapes. Paper IV. and B. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. Johnsonbaugh and Jost. Recognition Methodology: Conditioning. Text Books: 1. Spatial clustering. Curve fitting (Least-square fitting). Matching of 2D image. and Machine Vision” Thomson Learning 2. Milan Sonka. Edge detection. Spatial moments. 5. Gose. Schunk. 9. “Machine Vision”. Vol I. Algorithm Independent Machine Learning: Lack of inherent superiority of any classifier.structural matching. Bias and Variance. John Wiley and Sons. Thinning. Forsyth. Edge. R. Sc (Computer Science) SUBJECT: COMPUTER VISION (Elective . Information integration. Unsupervised Bayesian learning. Rule-based Segmentation. Line-Linking. External points. Area Extraction: Concepts. Ordered. 8. “Pattern Classification”. Resampling for estimating statistic. Understanding line drawings. Gradient based operators. Combining classifiers 8. and Stock. Grouping. Data-structures. Control-strategies. Data description and clustering criterion function for clustering. Binary Machine Vision: Thresholding. II. 22 | DEPARTMENT OF COMPUTER SCIENCE. View class matching. Perspective Projective geometry. Resampling for classifier design. Region growing. G. CLASS: M. Estimating and comparing classifiers.interfaces 7. Boundary analysis: Signature properties. Hart. Term II Lectures: 4 Hrs per week Practical: 4 Hrs per week Theory: 75 Marks Term work / Practical: 25 Marks Objective: To introduce the student to computer vision algorithms. Segmentation. TERM WORK 1. R. Application to normal mixtures. General Frame Works For Matching: Distance relational approach. Labeling of connected components.II). Line fitting. Consisting labeling problem. Region Analysis: Region properties. Hierarchal segmentation. McGraw-Hill.
Equilibrium Virtual Reality Hardware Sensor hardware. Interaction Text Books Virtual Reality Systems John Vince. realism. training. 3D clipping. VR systems Animating the Virtual Environment Dynamics of numbers. Modelling transformations. Collision detection A generic VR Systems The virtual Environment. 3D space curves. Physical simulation. simple pendulums. scientific land marks 3D Computer graphics The virtual world space. Modes of Java Programming Object oriented programming revisited. illumination models. radiosity. Entertainment. particle systems free-form Physical Simulation Objects falling in a gravitational field.II). Sc (Computer Science) SUBJECT: VIRTUAL REALITY AND VIRTUAL ENVIRONMENT (Elective . Scaling the VE. shape and object inbetweening. hiddensurface removal. Historical perspective. Modes of Interaction. virtual environment. shading algorithms. Acoustic hardware. UNIVERSITY OF MUMBAI . The ear. VR Technology. looping. JDK. stereographic images Geometric modelling From 2D to 3D. rotating wheels. Sc (Computer Science) SUBJECT: JAVA TECHNOLOGY (Elective . deformation.CLASS: M. Flight simulation. Stereo perspective projection. the perspective projection. Head-coupled displays. Human vision. Integrated VR Systems Virtual Reality Software Modelling Virtual worlds. simple 3D modelling.II). flight dynamics of an aircraft Human factors The eye. The computer environment. picking flying. Java Virtual machine-Platform independent-portabilityscalability Operators and expressions-decision making . colour theory. Elastic collisions. Benefits of virtual reality. Evolution of Virtual Reality. instances. Objects and 23 | DEPARTMENT OF COMPUTER SCIENCE. positioning the virtual observer. Term I Lectures: 4 Hrs per week Practical: 4 Hrs per week Theory: 75 Marks Term work / Practical: 25 Marks Real time computer graphics. Classes. VR tool kits Virtual Reality Applications Engineering. Paper IV.branching. Projectiles.Pearson Education Asia CLASS: M. springs. Geometrical Transformations Frames of reference. Paper IV. Education. 3D boundary representation. science. Term II Lectures: 4 Hrs per week Practical: 4 Hrs per week Theory: 75 Marks Term work / Practical: 25 Marks Future Virtual environment. the animation of objects. the somatic senses.
EMBnetNational Center for Biotechnology Information-NCBI. Information Networks Review of computer communication networks-the European molecular biology network. UNIVERSITY OF MUMBAI .virtual tourism. Protein Information resources Biological Data Bases-Primary sequence Databases-Composite Protein sequence databases-Secondary databases.Genome Projects-pattern recognition and prediction –the role of chaperones-sequence Analysis-Homology and analogy.The biological sequence structure deficit.Composite Protein pattern databases-structure classification databases-web addresses Genome Information resources DNA Sequence Analysis Pairwise alignment Techniques Multiple sequence alignment Secondary database searching Building a sequence search Protocol Analysis packages Term Work 10 assignments covering the entire syllabus 25 | DEPARTMENT OF COMPUTER SCIENCE.
Expert system: Introduction to expert system. Struart Russell and Peter Norvig. Interfacing First Order Logic: Interface rules involving quantifiers. The semantics of belief networks.Luger. First order logic: Syntax and Semantics. methodologies and techniques in design and implementation of intelligent system. Patrick Winston.II). Practical planning: Practical planners. Informed search methods. The wumpus world environment. Acting Logically: Planning. An example proof. Conditional planning 8. Perceptrons. Reinforcement learning: Passive learning in a known environment. Environments Problem Solving: Solving problems by searching. Explanation. Intelligent Agents: How agent should act. Genetic algorithms 10. Pearson Education 5. Representing knowledge in an uncertain domain. Intelligent Systems: Evolution of the concept.Aronson. “Artificial Intelligence: Structures and Strategies for Complex Problem Solving”. Efraim Turban Jay E. Generalization in reinforcement learning. Extensions and Notational variation.CLASS: M. Application of ANN. Vikas Publishing House TERM WORK 1. UNIVERSITY OF MUMBAI . Term II Lectures: 4 Hrs per week Practical: 4 Hrs per week Theory: 75 Marks Term work / Practical: 25 Marks Objectives: To understand and apply principles. George F. Building a Knowledge Base: Properties of good and bad knowledge base. Structure of intelligent agents. Learning in neural and belief networks: Introduction to neural networks. General ontology 6. Types of communicating agents. Knowledge engineering. Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus. 26 | DEPARTMENT OF COMPUTER SCIENCE. A formal grammar for a subset of English 11. Representation. Sasikumar and Others. Proportional logic. 2.Agents that Communicate: Communication as action. Forward and backward chaining. “Prolog Programming for Artificial Intelligence”. “Artificial Intelligence: A Modern Approach” 2. Artificial Intelligence: An overview. Reasoning. Nils J. Hierarchical decomposition. Representing and using domain knowledge. Paper IV. Pearson Education 4. Uncertain Knowledge and Reasoning: Uncertainty. Ivan Brakto. Completeness 7. Using first order logic 5. Game playing Knowledge and Reasoning: A knowledge based agent. Logic. Learning: Learning from observations: General model of learning agents. Inductive learning. Sc (Computer Science) SUBJECT: INTELLIGENT SYSTEMS (Elective . 3. M. Robotics Text Books: 1. Nillson. “Artificial Intelligence”. Expert system shells. Perception. Inference in belief networks 9. “Artificial Intelligence: A New Synthesis”. Ed. “Artificial Intelligence”. DETAILED SYLLABUS 1. “Decision Support Systems and Intelligent Systems” 6. Harcourt Asia 2. learning decision trees. Elaine Rich and Kevin Knight. Pearson Education References: 1. Multilayer feed-forward network. 4. “Artificial Intelligence : Theory and Practice” Proceedings of the International Conference KBCS-2002.Applications: Natural language processing. TMH 3. Knowledge acquisition 12.
unique / alternate / infinite optimal. Optimal design of elements and systems. Graphical method for two variable problems. As special cases of LP model. decision variables. mutual solution of problems involving upto three iterations. Owence and Walsh. UNIVERSITY OF MUMBAI . Knap sack. simplex algorithm and tabular representation. Transportation.S Rao.dual relations. Taha. Integer LP Models Gomary's Cutting plane algorithms. dual simplex method. napkin/caterer. Conference proceedings – Annual conference on Evolution programming . sensitivity analysis manual solution of problems involving upto three iterations. primal sub optimal . Sc (Computer Science) OPTIMIZATION (Elective) Periods per week Lecture Practical Tutorial Theory Exam Terwork / Practical Hours 3 -4 --Marks 75 -- Evaluation System Detailed Syllabus INTRODUCTION Need for optimization and historical development classification and formulation of optimization problem. Random search algorithms. Calculus based methods. Evolutionary algorithms. Enumerative schemes. cams etc. degenerate / non degenerate. product mix etc. High-speed machinery. objective function. Duality concept. constraints. sensitivity analysis for variation of parameter at a time. Optimization Theory and application by S. Classical optimization methods. Artificial Intelligence Through Simulated Evolution by Foged. shafts. Linear Programming model Formulation. canonical and standard forms. optimal / sub optimal. parameters and variables. and other primal . Optimization Methods by Mital K. Statistical Distribution in Engineering by Karl Bury. Exact and Interactive techniques. types of solution such as feasible / non feasible. cycling phenomena. REFERENCE BOOKS: Optimization for Engineering Design by Deb & Kalyanway. dual problem formulation. Problem formulation and optimality conditions in Vogel's penalty and Hungarian methods of solution.An Introduction by H. Limit equations and Normal redundant and incompatible specification. 27 | DEPARTMENT OF COMPUTER SCIENCE. classical problems such as crew scheduling. bearings.CLASS: M.. Formulation of Primary and Subsidiary design equations. traveling salesman problem as a special case of assignment problem. interpretation of dual variables. Transshipment and Assignment models. Duality Properties.V Operation Research . bounded / unbounded value and solution and their interpretations from simplex table. application in Probabilistic real life problems TERM WORK: 10 Assignments covering the entire syllabus.A. gears. TEXT BOOKS: 1.dual not feasible. branch and bound technique for integer programming Simulation Models Monte Carlo or experimenting method based on Probabilistic behavior data and random numbers.
Term work 10 assignments covering the entire syllabus. customer life style. planning & management. 4. prototyping & detailed proposal generation. Introduction to eCRM : difference between CRM & eCRM.IVR(interactive voice response). flexibility & performance. follow up. 6. Customer R elations Management by Kristin Anderson & Carol Kerr. CTI(computer telephony integration). barriers to successful SFA. customer interaction. automated intelligent call routing. UNIVERSITY OF MUMBAI . technological aspect of SFA: data synchronization. 2. reporting tools. 5.web enabling the call center. CRM technology components. Enterprise Marketing Automation (EMA): components of EMA. advantages & disadvantages of implementing ASP. 3. marketing camping.CRM at the speed of light by Paul Greenberg. requirements gathering. Introduction to ASP( application service provider): who are ASP’s?. what is ACD(automatic call distribution). logging & monitoring. EMA components (promotions.TMH. 7. Introduction to CRM : what is a customer? How do we define CRM? CRM technology. camping. Implementing CRM: pre implementation. features of eCRM. roll out & system hand off. TMH. response mgmt. ongoing support . business analytic tools. loyalty & retention programs). 2. training. Sales Force Automation (SFA): definition & need of SFA. system optimization. events. SFA: functionality. technological implementation. kick off meeting. their role & function. References: 1. Power User Beta Test & Data import.CLASS: M. development of customization. 28 | DEPARTMENT OF COMPUTER SCIENCE. Call Centers Mean Customer Interaction: the functionality. Sc (Computer Science) SUBJECT: CRM (Customer Relations Management) (Elective) Periods per week Lecture TW/Practical 4 -Hours 3 -Marks 75 -- Evaluation System Theory Examination TW/Practical 1.
Sc (Computer Science) Project I (I year) and II (II Year) Periods per week Lecture Practical Tutorial Project Examination Hours ---4 -Marks 50 50 Evaluation System Guidelines for submission of report of Project I and II Body of Project Introduction Literature Survey Objective Methodology Feasibility study Design/synthesis/Analysis Fabrication and Details Drawings Test set up and Tests Results Case Study Results / Discussion Conclusion Future work References Appendix This should contain Drawings.CLASS: M. 29 | DEPARTMENT OF COMPUTER SCIENCE. coding used etc. Graphs. UNIVERSITY OF MUMBAI .