University of Mumbai

Syllabus Structure(R-2007) At B.E. (Computer Engineering) Semester-VII Scheme of Instructions Periods per Week Each Period of 60 Min. Theory 1. 2. 3. 4. 5. 6. Digital Signal & Image Processing Robotics and AI Mobile Computing System Security Elective-I Project-I 4 4 4 4 4 Practical 2 2 2 2 2 2 12

Sr. No.

Subject

Scheme of Evaluation Paper Oral/ TW practical Hours Marks 3 3 3 3 3 -100 100 100 100 100 -500 25 25 25 25 25 25 150 25 25 25 25 25 25 150 Total 150 150 150 150 150 50 800

-20

Elective- I 1) Computer Simulation and Modeling 2) E-commerce 3) Project Management 4) Soft Computing

1

University of Mumbai
Syllabus Structure(R-2007) At B.E. (Computer Engineering) Semester-VIII Scheme of Instructions Periods per Week Each Period of 60 Min. Theory 1. 2. 3. 4. 5. Distributed Computing Multimedia System Design Software Architecture Elective-II Project-II 4 4 4 4 -16 Practical 2 2 2 2 4 12

Sr. No.

Subject

Scheme of Evaluation Paper Oral/practi TW cal Hours Marks 3 3 3 3 -100 100 100 100 -400 25 25 25 25 50 150 25 25 25 25 50 150 Total 150 150 150 150 100 700

Elective-II 1) Human Computing Interaction 2) Advanced Internet Technology 3) Computer Vision 4) Embedded System

University of Mumbai Class : B.E . Branch : Computer Semester : VII Engineering Subject ::DIGITAL SIGNAL & IMAGE PROCESSING(Abbreviated as DSIP) Periods per Week( Each 60 Min) Lecture 04 Practical 02 Tutorial ----Hours

Marks

2

Evaluation System

Theory Oral Term Work Total

03 -------

100 25 25 150

DETAILED SYLLABUS Module Chapter 1 Content Discrete Time Signal and System : Introduction:Signals, Systems and Signal processing, classification of signals, system, LTI system,Freqency domain representation of DTS & Signals. Convolution , Correlation. Z-Transforms: Introduction, Z-transforms , Inverse ZTransforms, properties,System Function , Application of ZTransform, Unilateral Z-Transform Discrete Fourier Transform: Introduction , DFT and its properties, FFT algorithms – direct, divide and conquer approach, radix-2 algorithm(Decimination In Time ), 2-D DFT & FFT . Lect 06 L Weit -age 10%

Chapter 2

06L

10%

Chapter 3

05 L

15%

02L Chapter 4 Introduction to Digital Image Processing Systems: Introduction, Brightness adoption and discrimination , Image sampling and quantization, basic relationship between pixels. Image Transforms : Introduction to Fourier Transform, 08L properties of Walsh Transform, Hadamard Transform, Discrete Cosine Transform, Slant Transform, Optimum Transform: Karhunen- Loeve (Hotelling) Transform , Radon , Comparison of Transform. Introduction to wavelet transform Image Enhancement: Image Enhancement in the Spatial domain : Spatial domain point operation and Neighbourhood Operation , Gray-Level Transformation,Median Filter , Bit plane slicing , Histogram Processing, Arithmetic and Logic Operation, Spatial filtering: Introduction, smoothing and sharpening filters., Image Enhancement in the frequency domain: Frequency-domain filters: smoothing and sharpening filters, homomorphic filtering Image Restoration and Denoising : Introduction,Image Degradation, Types of Image Blur , Classification of image restoration Techniques , Image Restoration Model , Linear and non-Linear image restoration Technique, Blind deconvolution , Image Denoising , Classification of Noise in 08L

5%

Chapter 5

15%

Chapter 6

15%

Chapter 7

5L

10%

3

Image, Trimmed Average Filter, Applications of Image restoration. Chapter 8 Image segmentation: Detections of discontinuities, edge-linking and boundary detection, thresholding, regionbased segmentation, Hough’s transform Image Data Compression: Fundamentals, redundancies: coding, inter-pixel, psychovisual, fidelity criteria, image compression models, error-free compression, lossy Compression 4L 10%

Chapter 9

4L

10%

BOOKS
1 2 Introduction to Digital signal processing – John G. Proakis, D.G. Manolakis (Maxwell Macmillan Int.) R. C.Gonsales R.E.Woods, “Digital Image Processing”,Second edition, Pearson Education REFERANCE : 1 2 3 4 S.Salivahanan “ Digital Signal processing “ TMH Anil K.jain, ‘Fundamentals of Image Processing’, PHI s.Jayaraman , S Esakkirajan , T Veerakumar “ Digital Image Processing “ Mc Graw Hill. TAMAL BOSE “ Digital Signal and Image Processing “ John Wiley & Sons , Inc.

TERM WORK 1.Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus (15 marks) A term Work test of 10 marks must be conducted .

List of Practicals 1. 2 3 4 Write Matlab Program for generation and Manipulation of signal. Write Matlab Program for convolution and correlation. Write C/C++ Program for Discrete Fourier Transform. Write Matlab Program for Image negative , Gray level Slicing

4

5 6 7 8 9 10 11 12 Write Matlab Program for Dynamic range compression &Bit plane slicing Write Matlab Program for Histogram Processing Write Matlab Program for Image smoothing. 5 . Write Matlab Program for Trimmed Average Filter. ( COMPUTER ENGINEERING) SEMESTER VII HOURS PER LECTURES : 04 WEEK TUTORIALS : -PRACTICALS : 02 HOURS MARKS EVALUATION THEORY 3 100 SYSTEM: PRACTICAL -ORAL -25 TERM WORK -25 Prerequisite: Data Structures. Write Matlab Program for lossy Image Compression.E. Students will be familiar with terminologies used in Robotic Systems and understand Robotic Arm movements. knowledge representation and reasoning. Write Matlab Program for Edge detection. Write Matlab Program for Image sharpening. Analysis of Algorithms. Basic understanding about Intelligent agent. Robotics and AI (Abbriviated as RAI) CLASS B. Objective: This course will introduce the basic ideas and techniques underlying intelligent robotics. Commonly used sensing techniques. Write Matlab Program for lossless Image Compression.

Iterative Depending. notation Direct and Inverse Kinematics: Co-ordinates Frames. Attributes of a sensor. BFS. Stereo camera pairs. First Order Predicate Logic Syntax and Semantics. heuristic Functions. Hrs 3 Text book referred Ch-1 Schilling 2 8 Ch-2 and Ch-3 Schilling 3 4 Ch-2 RusselNorvig 4 Common Sensing Techniques for reactive robots: Overview. Sonar. Problem Solving: Solving problems by searching. Uninformed Search Techniques-DFS. Uniform cost search. Robot Specification. Arm Equation of four Axis SCARA Robot. Comparing Different Techniques. A*. Agent Environments. Unification. CCD Cameras. 2 Ch-2 Robin Murphy 5 7 Ch-3 and Ch-4 RusselNorvig 6 4 Ch-6. TCV. Intelligent Agents : Concept of Rational Agent. Inverse Kinematics of Four Axis SCARA Robot. PROLOG. Structure of Intelligent agents.IDA*. Informed search methods-Best First Search.. Proximity Sensors. Knowledge and Reasoning: A knowledge Based Agent.9 RusselNorvig 6 . General Ontology. Infrared. WUMPUS WORLD Environment. Crypt Arithmetic. Laser. Resolution. backtracking for CSP. Forward and backward chaining. Rotations. Logical sensors. Light stripers. Propositional Logic.7 and 8.Module 1 Contents Introduction to Robotics: Robot Classification. Homogeneous Coordinates. Search Strategies. Problem formulation. Proprioceptive Sensors. GPS. Hill Climbing.

Pearson. “ Decision Support Systems and Intelligent Systems” PHI. A partial order planning algorithm. Blocks world Shaky’s world Metric Path Planning: Configuration Space. Learning Decision Trees 3 Ch-18 RusselNorvig 9 Planning: A Simple Planning Agent. 2002. 4 Ch-14. Behaviors as objects in OOP. Robin R Murphy. Introduction to Artificial Intelligence and Expert System. Tata MeGraw-Hill. 4. Winston. Artificial Intelligence. 2.5 Robin Murphy Text Book: 1. 3 Ch-11 RusselNorvig Ch-10 Robin Murphy 10 Introduction and overview of Robotics paradigms: Reactive Paradigms Designing a Reactive Implementation: Overview. 2. Steps in Designing a Reactive Behavioral System.7 Uncertain Knowledge and Reasoning: Uncertainty. Artificial Intelligence. 3. 2nd Edition. A Partial Order Planning example. Representing knowledge in an Uncertain Domain. Narosa Publication. Elaine Rich. General Model of Learning Agents. Nilsson. Robert J. Knowledge engineering foe planning. Case Study: Unmanned Ground Robotics Competition . Reference Book: 1. PHI. Pearson Publication. “Al-Structures and Strategies for and Strategies for Complex Problem solving”. Paterson.15 RusselNorvig 8 Learning: Learning from Observations. Dan W. Stuart Russell and Peter Norvig. Kevin Knight. Artificial Intelligence: A Modern Approach. Basic representation for planning. 7 . 4/e. Introduction to AI Robotics ISBN-81-203-2458-7 PHI Publication. Inductive learning. Ephraim Turban Jay E. 2nd Edition. Fu. 6. Assemblages of Behaviors 4 Ch – 4. 7. Schilling. Representation. Aronson. Robotics. Graph based planners. 3. 5. Gonzales and Lee. Planning in Situation calculus. McGraw Hill. 3rd Edition. Simple Inference in Belief Networks. Patrick H. Principles of Artificial Intelligence. George Lugar. Belif Networks. Nils J. Pearson Educations. Fundamentals of Robotics: Analysis and Control PHI Publication.

___________________________________________________________________________ __ ORAL Oral/Practical Examination should be or 25 Marks must be based on the syllabus Suggested list of experiments but not restricted to 1. Develop and arm matrix for Adept-1 SCARA robot. 9. 8. Laboratory work (Experiments and Journal) 15 Marks 2. Water Jug Problem. Eight Queen Problem. Wumpus world problem. 3. Test (at least one) 10 Marks The final certification and acceptance of TW ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work. Knight’s Tour. 6. 5. 10. Inverse Kinematics for Adept-I SCARA Robot. Practical Experiments must be implemented in Prolog/Lisp and C++. 2. Implementing Searching algorithm. 8 . 7. Graph Structures and Paths. 4.__________________________________________________________________________ TERMWORK _________________________________________________________________________ Term work should consist of at least 8 experiments. Distribution of marks for term work shall be as follows: 1. Crypto Arithmetic Problems. Development of Composite Rotation Matrix. TWO assignments and at least ONE written test based on above mentioned syllabus.

Distribution of marks for term work shall be as follows: 1. Term Work: Term work shall consist of at least 05 experiments and 03 assignments covering all topics and one written test. 2) Use of Control-X simulation Control of Conveyor manually and thru Programming.List of Practicals These experiments can be performed using 1) Use of Control-X simulation Control of X-Y Position Table manually and thru Programming. 3) Use of Control-X simulation Program for bottling plant experiment using Conveyer and Pneumatics 4) Use of P-Simulator design a pneumatic circuit using a double acting cylinder and 5/2 Air Spring Valve to open the main gate of a factory which can be controlled by a security personnel from the security room. Programming using sensors and conveyor.Test (at least one) 10 Marks The final certification and acceptance of TW ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work. Laboratory work (Experiments and Journal) 15 Marks 2. 9 .

System Architecture. Cordless Telephony and Low-Tier PCS: Cordless Telephone.Detection and Assignment: Strategies for Handoff Detection. 10 . Personal Handy Phone System (PHS). Roaming Management. Multiple access with collision avoidance. Mobility Management: Handoff (Inter-BS. Signal propagation. Antennas. Security. Frequency for radio 05 transmission. CDMA: Spread Aloha multiple access Telecommunication Systems I: PCS Architecture. Channel Assignment. with desktop browsing the exception. Signals. Handoff Management – Radio Link Transfer: Hard and Soft Handoff. Modulation. Cellular systems (DSSS & FHSS). Unlicensed Systems. The iGSM 2. Such predictions are based on the huge growth in the wireless phone market and the success of wireless data services. Near and Far terminals. current developments in mobile communication systems and wireless computer networks. Protocols. UMTS. Cellular Telephony: Advanced 05 Mobile Phone Service(AMPS). Motivation for a specialized MAC: Hidden and Exposed terminals. VOIP service for Mobile Networks : GSM on the Net. Global System for Mobile Communication (GSM). Multiplexing. Indeed. GSM Short Message Service.E . Network Signaling : Signaling System No. Telecommunication Systems II: GSM: Mobile services. EIA/TIA IS-136 Digital Cellular System. Handover. New data services. Applications.7. Digital European Cordless Telephone (DECT). ubiquitous wireless networks has made mobile computing a reality. Intersystem).Class : B. it is widely predicted that within the next few years access to Internet services will be primarily from wireless devices. 3G Wireless systems. Personal Access Communications System (PACS) . Interconnection and Message Routing. EIA/TIA IS-95 Digital Cellular System. Inhibit sense multiple access. Localization and Calling. Polling. Pre-requisites: Computer Networks. This course will help in understanding fundamental concepts. Handoff Management . Hrs Introduction: Short history of wireless communication. Radio 09 interface. University of Mumbai Branch : Computer Semester : VII Engineering Subject :: MOBILE COMPUTING (Abbreviated as MC) Lecture 04 Practical 02 Tutorial ----Hours Theory 03 Oral --Term Work --Total --- Periods per Week( Each 60 Min) Evaluation System Marks 100 25 25 150 Objective: Recent developments in portable devices and high-bandwidth. Spread Spectrum. 3. Second Generation (CT2). Topic to be covered 1 . Mobility Management.

Wireless ATM working group. International Roaming for GSM. Mobile Number Portability. Wireless Sensor Networks: Applications. Snooping TCP. Mobile Agents Synchronization : Synchronization Software for Mobile Devices . iGSM Procedures and Message Flows: Registration. Entities and Terminology. Wireless markup language. Radio access layer: Requirements. Portals. EDGE. BRAN Mobile Network and Transport Layer: Mobile IP: Goals. Wireless Bearers for WAP . TETRA.11: System architecture. Agent advertisement and discovery. Transmission/time-out freezing. UMTS. Call Delivery to the IP Network: Implementation Issues. WAP UAProf and Caching . Improvements on Core Network. MAC management. Wireless Broadband (WiMax) Wireless ATM: Motivation for WATM. MEO. Dynamic source routing. Mobility supporting network side. UTRA TDD mode. Satellite Systems: History. Mobile TCP. Service Discovery. & Maintenance.323 Network. Hierarchical algorithms. Bluetooth: User Scenarios. assumptions and requirements. Gs Interface. Medium Access Control layer. Ipv6. Synchronization Protocols. Wireless transport layer security. Applications. IP packet delivery. Reference model: Example configurations. Functions: Wireless mobile terminal side. Deployment Issues.4 5 6 7. iGSM Architecture. and IMT-2000: UMTS Basic Architecture.3. HLR and VLR.Gb Interface. Routing. Linux for Mobile Devices. Wireless datagram protocol. Information bases and Networking. Wireless Local Loop Technologies. Networking. Examples. GPRS Support Node. MAC layer. Mobile Internet Connectivity. GPRS: Functional Groups. Design considerations. Gn and Gp Interfaces. Selective retransmission. Capacity Planning for WPBX. LEO. RFID. Generic reference model. GPRS Architecture. Basics: GEO. Quality of Service in 3G. Fast retransmit/fast recovery. Deregistration. Localization. IEEE 802. IrDA ZigBee. Support for Mobility: Mobile Computing Architecture: Three Tier Architecture for mobile computing. Wireless telephony application. GSM Operations. Alternative metrics. Wireless session protocol. Security. Transaction oriented TCP. TR-45 Service Description. and Personal Area Network 01 08 05 06 8. GPRS Interfaces: Um Interface. EPOC. link management. Physical Layer. Destination sequence distance vector. GPRS Network Nodes:18. Channel access control sublayer. SyncML-Synchronization Language for Mobile Computing. Mobile Transport Layer: Traditional TCP: Congestion control. Radio transmission. Examples.Mobile Application Languages-XML. GPRS Procedures.1 Mobile Station. Caching Model . UTRA FDD mode. Voice XML. Ad hoc networks MANET: Routing. Administration. Dynamic host configuration protocol. Sync4J (Funambol) 09 11 . Wireless VoIP Solution. Language Support: Hypertext markup language (XHTML)-MP. Gateways. Protocol architecture. Wireless transaction protocol. Symbian OS. Infrastructure and Ad hoc Networks. J2ME and JavaCard. Tunneling and Encapsulation. Wireless application protocol: Architecture. Implications on mobility. Java. Wireless LAN: Infrared vs. WAP Developer Toolkits and application environment. Optimizations. Slow start. Fast retransmit/fast recovery. Indirect TCP. Mobile File System. Enterprise PCS: Office Level . User Agent Profile . HIPERLAN: Protocol architecture. WML script. WATM services. Windows CE. Local Area Wireless: An Example of WPBX. Physical layer. Wireless Local Loop: Wireless Local Loop Architecture. Handover. Registration. Gi Interface. Mobile databases. File systems: Consistency. Base Station System. Application Server. Reverse tunneling. Mobile agents. World Wide Web: Hypertext transfer protocol. Physical layer. Third-Generation Systems :W-CDMA and cdma2000. Mobile Computing through Internet. Medium Access Control sublayer. Future development. The H. Device Management Wireless devices and their Operating System : PalmOS.

P. 2. Thomas Stober. J2ME Program for Mobile Node Discovery 8. 10. References : Rappaort. GSM modem study (Nokia 30) and SMS client-server application 5. Design and Program Income Tax and Loan EMI Calculator for Mobile Phones. "Wireless and Mobile Network Architectures'. 3. m-commerce. Term work Term work should consist of least 10 practical experiments and two assignments covering the topic of the syllabus. "Principles of Wireless Networks" Introduction to Wireless Telecommunication System and Networks by Mullett (Cengage Learning) Uwe Hansmann. Wireless Network Security : kismet and Netstumbler Distribution of marks for term work shall be as follows: Laboratory work (Experiments and Journal) 15 Marks Test (at least one) 10 Marks 12 . Study of WLAN : Ad Hoc & Infrastructure Mode 3. “ Principles of Mobile Computing.Synchronized Multimedia Markup Language (SMIL). Wireless and Mobile Network Architecture : Yi Bang Lin and Imrich Chlamtech (Wiley). Pearson Education 2. 6. Pahlavan. "Mobile communications". Security. Springer 1. Lothar Merk. "Wireless Networks'. Martin S. Mobile protocol study using omnet++ 9. Mobile Computing by RajKamal (Oxford). 3. Mobile Internet and WML 7. John Wiley K. Suggested Laboratory Exercises of Mobile Computing: 1. Threats and Security Issues in Mobile Computing: Books Text Books: 1. Study of Bluetooth Protocol and Applications 4. John Wiley P. Setup & Configuration of Wireless Access Point (AP) 2. Nicklous. "Wireless Communications Principals and Practices' YI Bing Lin. 5. Implementation of Mobile Network using Network Simulator (NS2) 6. 4. Jochen Schiller. Nicopolitidis. Addison wisely. Krishnamurthy.

Single –sign on. Biometric. RC4.E . Linearization Attacks. Trusting Software iii. Public Key Infrastructure. Access control Matrix. Defiie-Hellman. Software Flaws. Confidentiality and Non-repudiation. RSA. Race conditions ii. Salami attack. ii. SHA-1.Authentication and Authorization: i. MD5. Malware. Kerberos. Block Ciphers. Digital Rights management. A5/1. Tiger Hash. Use of Hash Function Access control . Orals Oral examination is to be conducted based on the above syllabus University of Mumbai Branch : Computer Semester : VII Engineering Subject :: SYSTEM SECURITY (Abbreviated as SS) Lecture 04 Practical 02 Tutorial ----Hours Theory 03 Oral --Term Work --Total --- Class: B. Feistel Cipher. Authentication Protocol. ACLs. Multiple level security model.Signature and Non-repudiation. Classic Cryptography ii. Incomplete Mediation. Crypto Basic. Triple DES. Periods per Week( Each 60 Min) Evaluation System Marks 100 25 25 150 Hours 03 10 Module Chapter 1 Chapter 2 Content Introduction to Information Security: Security Goals Cryptography: i. Buffer Overflow. Covert channel. Software reverse engineering. use of public key crypto. Hash Function: The Birthday Problem. iv. CAPTCHA Software security: i. Authentication Methods. Passwords.The final certification and acceptance of TW ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work. DES. AES iii. Symmetric Key Cryptography: Stream Ciphers. Multilateral security. Chapter 3 08 10 Chapter 4 13 . Public Key Cryptography: Kanpsack.

Wiley Network security bible 2nd edition. Nina Godbole.E. Michael E. Branch: Computer Semester: VII Engineering Subject: COMPUTER SIMULATION AND MODELING(Abbreviated CSM) Periods per Week Lecture 04 (each 60 min) Practical 02 Tutorial -- 14 . Network security basics ii.A term Work test of 10 marks must be conducted. iv. Firewall. ORAL Oral / Practical Examination must be based upon the syllabus of 25 marks. ARP Spoofing vi. Packet sniffing. Enterprise wide network Design and Vulnerabilities. cengage learning Information Systems Security. University of Mumbai Class: B. TCP/IP Model and Port No. Prentice hall Principles of Information Security. Reconnaissance of network v. Eric Cole 1) 2) 3) 4) 5) TERM WORK i. Web site and web server vulnerabilities vii. Protocol flaws iii. SSL and IPSec protocol ix.iv. and Honey pots Text Books 1) Cryptography and Network Security by Behrouz A. William Stalling. Denial of Service viii. Pearson Education Reference Books Information security Principles and Practice by Mark Stamp. TATA McGraw hill. ii. Session Hijacking. Forouzan. Distribution of marks for term work shall be as follows: Laboratory work (Experiments and Journal) 15 Marks Test (at least one) 10 Marks The final certification and acceptance of TW ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work. Chapter 5 Operating System and Security 15 Network Security: i. Term work should consist of at least 8 practical experiments and two assignments covering the topics of the syllabus... Intrusion Detection System. Pfleeger . Wiley publication Cryptography and Network Security. 2) Security in Computing by Charles P.

advantages and disadvantage. 2. continuous distribution. 3. long run measures of performance of queueing systems. parameter estimation. general – purpose simulation packages. 5. System and system environment. goodness 15 . manufacturing. suggested estimators. Pre-requisites: Probability and Statistics 1. By the end of the course students will be able to formulate simulation model for a given problem. steps to build a useful model of input data. Manual Simulation of Systems: Simulation of Queuing Systems such as single channel and multi channel queue. inventory system and dump truck problem using event scheduling approach. an evaluation and selection technique for simulation software. direct transformation technique. Input Modeling: Introduction. different techniques to generate random variate:. 6. M/M/c) overview of finite capacity and finite calling population models. techniques for generating random numbers. identifying the distribution with data.inverse transform technique. Random Variate Generation: Introduction. Emphasis of the course will be on modeling and on the use of simulation software. simulation world views or formalisms. implement the model in software and perform simulation analysis of the system. 8. inventory system. model components. M/M/1. reliability problem. autocorrelation. useful statistical model.Evaluation System Theory Oral Term Work Total Hours 03 --03 Marks 100 25 25 150 Objectives of the course: The objective of this course is to teach students methods for modeling of systems using discrete event simulation. type of systems. Random Number Generation: Properties of random numbers. hypothesis testing. gap. application areas. components of system. job-shop model. The students are expected to understand the importance of simulation in IT sector. Steady state behavior of Markovian models (M/G/1. poker). Queueing Models: Characteristics of queueing systems. queueing notations. lead time demand. discrete distribution. telecommunication. model of a system. various tests for uniformity (Kolmogorov-Smirnov and chi-Square) and independence (runs. history of simulation software. and service industries etc. 4. Statistical Models in Simulation: Overview of probability and statistics. empirical distribution and Poisson process. simulation of single channel queue. multi channel queue. a discrete event system simulation. timeshared computer model. convolution method and acceptance rejection techniques. Network of Queues. Discrete Event Formalisms: Concepts of discrete event simulation. 7. generation of true and pseudo random numbers. types of models and steps in simulation study. appropriate and not appropriate. Introduction to Simulation and Modeling: Simulation – introduction. data collection.

and Bryan. Aczel & Sounderpandian. 6. “Introduction to Probability and Random Variables”. J. 2. McGraw-Hill. 11. validating input-output transformation. Cobweb model. 7.. “Discrete Event System Simulation”. 3rd edition. model building. Frank L. Pearson Education. 1960. Output Analysis: Types of simulations with respect to output analysis. input output validation using historical data and Turing test. PHI. stochastic nature of output data. selection input model without data. M. “System Modeling and Simulation” 5. and Kelton. Simulation of Material Handling system. Carson J. Levin & Ruben. W. “System Simulation”. Simulation of computer systems. 10.. M.validation process. PHI. Distribution of marks for term work shall be as follows: Laboratory work (Experiments and Journal) 15 Marks Test (at least one) 10 Marks The final certification and acceptance of TW ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work. measure of performance and their estimation. 2000. “System Analysis and Modeling”. calibration and validation of models:. Gordon Geoffrey. 10. 2nd edition. P. 2001. Bernard. output analysis for steady state simulation.of fit tests. Text Book: Banks J. Term Work: Term work shall consist of at least 10 experiments covering all topics and one written test. covariance and correlation. McGraw-Hill. “Theory Of Modeling and Simulation” 9. Academic Press Harcourt India. S. multivariate and time series input models. face validity.. and Nicol D. 1982. Body. 9. Donald W. “System Simulation with Digital Computer”. Narsing Deo. Reference Books: 1.. 3. “Statistics for Management”. Verification and Validation of Simulation Model: Introduction. S. “Business Statistics”.. power of test... Simulation of super market. “Probability and Statistics with Reliability. 8. 1978. G. Queueing. D.. Suggested Experiment list 16 .. L. Case Studies: Simulation of manufacturing systems. t-test. and Computer Science Applications”. 4. output analysis of terminating simulators. 3rd edition. Nelson B. validation of model. “Simulation Modeling and Analysis”. Trivedi K. Law A. Severance. and any service sectors. Wadsworth G. verification of simulation models. PHI.

Data Mining. Case studies from the reference book can be used for experiment.E. Micropayment system 17 . Periods per Week (Each 60 Min) Evaluation System Marks 100 25 25 150 Objectives of the course:  To understand Technical aspect of E-commerce and E-Business  To describe the process of E-commerce and E-business  To understand Infrastructure design issues of E-commerce Contents of the Course Part 1: E-commerce 1. different type of ecommerce. Single Server System 2.0. Database connectivity.The experiments should be implemented using Excel. 4. Advance technologies of E-commerce: Mobile Agent. N) . Web Mashup. E-cash. some e-commerce scenario. XML. SET Protocol for credit card payment. Introduction: Electronic commerce and Physical Commerce. REST Web Services. 3.) Elective-I Lecture 04 Practical 02 Tutorial ----Hours Theory 03 Oral -Term Work -Total -- Class: B. (M.Inventory System 4. simulation language like GPSS and/or any simulation packages. Basic technologies of Ecommerce: Client side Programming. Server Side Programming. Job-Shop Model 6. Multi serve system like Able – Baker 3. Web 2. Working of Search Engines. Cafeteria 8. Manufacturing System 7. session tracking techniques. Dump Truck Problem 5. WAP. 1. Rich Internet Application. Independence Testing University of Mumbai Branch : Computer Semester : VII Engineering Subject: E-Commerce (Abbreviated as e-com. Uniformity Testing 10. E-check. Internet Security. Advantages of e-commerce 2. Internet Payment System: Characteristics of payment system. Telecommunication System 9.

E-Commerce Fundamentals and application (Henry Chan) Wiley publication 2. Cloud computing.Strategic Thinking and Practice (Brahm) biztantra Using Google Aps engine (Severance) O’reilly Hadoop : The Definitive Guide (White) O’reilly Term Work Term work shall consist of at least 6 assignments/programming assignments and one written test. e-business Integration. E.5. 2. RPC and RMI. Sales and Promotions. Characteristics of e-Business.Commerce Strategies. 9. Integration of Application: Approaches to Middleware. 5. E-Business Organizational and technical foundation (Michael P) Wiley Publication REFERENCES: 1. Virtualization Techniques. Strategic planning process. Strategies for Web Auctions. Technology and applications (David) Tata McGrawHill Introduction to E-commerce (jeffrey) Tata. 3. Virtual Communities. Test (at least one) The final certification and acceptance of TW ensures the satisfactory performance of laboratory Work and Minimum Passing in the term work. 4. loosely Coupled e-Business solutions for integration. Strategies for Purchasing and support activities. 10 Marks 15 Marks Suggested List of Experiments Exp 1: All experiments should be part of final e-commerce portal development 1. Service Oriented Architecture. Business process and collaborations 8. and web portals 6. Marks 1.WS-security. Google Apps engine TEXT BOOKS: 1. 2. E-Business -Introduction: E-Business vs E-commerce. and Ajax enabled) Access control mechanism (session management) 18 . Server consolidation using cloud. E-commerce Infrastructure Cluster of Servers.Mcgrawhill E-Business and Commerce. impacts of e-business 7. HDFS. EAI and web Services. Strategic alignment. Levels of e-business strategies.. Laboratory work (Experiments and Journal) 2. 3. Business models. Electronics Commerce (Gary Schneider) Thomson Course technology 3. eBusiness role and their challenges. Home page design Form validation (Ajax enabled) Catalog design and Search techniques (Web mining . Introduction to Hadoop. E-commerce strategies: Strategies for marketing. the consequences of e-Business. 4. Success factors for implementation of e-business strategies. e-business Requirements. E-business strategies: Strategic positioning. Enterprise Application Integration.

5. Introduction to Project Management 1.1 Project Selection 3.1 Organizational Structure 2.5.2 Suggested Skills for Project Manager 1.1 Developing Project Charter 3. Project Scope Management 4.3 What is project management 1. Server side using Web Services Exp 2: Creating Hadoop clusters on Ubuntu Project Management (Elective-II) CLASS B.E.4 Role of a Project Manager 1.2 Project Life Cycle and Phases 2.5 Trends affecting IT Project Management 2.1 Collecting Requirements 19 .3 Developing Project Management Plan 4. Creating Web Site to integrate at least five REST web Services (Web Mashups) 6.4 Characteristics of IT project Team members 2.4.4.4.3 Project Management tools and techniques 1. Contents of the Course 1.3 Importance of people and leadership skills 2.1 Project Manager's job description 1.1 Stakeholders 1.3.1 What is project 1. Project Management and IT context 2.3.2 The triple constraint 1. Project Integration Management 3.1 Globalization 2.3 Virtual Teams 3.2 Outsourcing 2.5.5.3.  To understand the Life cycle and phases of project management.2 Project Management Knowledge Area 1. ( Computer Engineering) Elective SEMESTER VIII HOURS PER WEEK LECTURES : 04 TUTORIALS : -PRACTICALS : 02 HOURS MARKS EVALUATION THEORY 3 100 SYSTEM: ORAL 25 TERM WORK 25 Objectives of the course:  To understand Much of the unique knowledge needed to manage projects.3 Nature of IT projects 2.  To understand knowledge areas and tools-techniques for efficient project management focusing IT projects.

2.2. Wiley India Edition. Mantel et.4 Planning Risk Response 11. Chitkara Term Work 20 .2 Qualitative Risk Analysis : Probability and Impact Matrix 10. K. 3. PMP Project Management Professional Study Guide.3 Multi project Scheduling and Resource Allocation 9. Gopalan.Common Sources of Risk in IT Projects 10. Project Risk Management 10.2 Performing Quality Assurance 7.2 Critical Path Method 5.3 Creating Work Breakdown Structure 4. Project Resource Management 8. Project Quality Management 7.3 Quantitative Risk Analysis : Decision Trees 10.2 Defining Scope 4. Project Communication Management 9. Project Cost Management 6.3 Incorporating Project Uncertainty .4.R.1 Gantt Chart 5.3 Quality Control – Tools and Techniques 8.1 Identifying Stakeholders 9.2.2. Project Procurement Management 11.2 Earned Value Management 7.3 Resource loading and Resource Leveling 5.4 Controlling Scope 5.1 Defining and Sequencing Project Activities and Dependencies 5. With M. Third Edition by Joseph Phillips 2.2 Planning Communication 10.2 Developing Schedule 5.1 Estimating Techniques 6.PERT 5. Project Management Handbook by Uddesh Kohli. Project Management – Core Text Book .1 Planning Quality 7.1 Identifying Risks . Project Time Management 5.2 Project Organizational Chart and Responsibility Assignment 8. Samuel J.1 Planning and conducting procurement TEXT BOOKS: 1. K.4 Schedule Controlling 6.al.1 Development of Human Resource Plan 8.4 Critical Chain Method 5.

10 Marks 15 Marks 21 . Laboratory work (Experiments and Journal) 2. University of Mumbai Branch : Computer Engineering Semester : VII Subject : SOFT COMPUTING (Abbreviated as SC) Periods per Week( Each Lecture 60 Min) Practical Tutorial Evaluation System Theory Oral Term Work Total (Elective-I) 04 02 ----Hours 03 ----03 Marks 100 25 25 150 documentation of each of the project management phases and one written test. Test (at least one) The final certification and acceptance of TW ensures the satisfactory performance of laboratory Work and Minimum Passing in the term work.Term work shall consist of at least 6 assignments/1 project which will contain detailed Class : B.E . Marks 1.

Sr. Objectives :  To introduce the ideas of fuzzy sets. OPTIMIZATION Derivative-based Optimization – Descent Methods – The Method of Steepest Descent – Classical Newton’s Method – Step Size Determination – Derivative-free Optimization – Genetic Algorithms – Simulated Annealing – Random Search – Downhill Simplex Search NEURAL NETWORKS Supervised Learning Neural Networks – Perceptrons . No 1.Adaline – Backpropagation Mutilayer Perceptrons – Radial Basis Function Networks – Unsupervised Learning Neural Networks – Competitive Learning Networks – Kohonen SelfOrganizing Networks – Learning Vector Quantization – Hebbian Learning. fuzzy logic and use of heuristics based on human experience  To become familiar with neural networks that can learn from available examples and generalize to form appropriate rules for inferencing systems  To provide the mathematical background for carrying out the optimization associated with neural network learning  To familiarize with genetic algorithms and other random search procedures useful while seeking global optimum in self-learning situations  To introduce case studies utilizing the above and illustrate the intelligent behavior of programs based on soft computing 2. 09 22 . 08 3. NEURO FUZZY MODELING Adaptive Neuro-Fuzzy Inference Systems – Architecture – Hybrid Learning Algorithm – Learning Methods that Cross-fertilize ANFIS and RBFN – Coactive Neuro Fuzzy Modeling – Framework Neuron Functions for Adaptive Networks – Neuro Fuzzy Spectrum. 10 4. FUZZY SET THEORY: Introduction to Neuro – Fuzzy and Soft Computing – Fuzzy Sets – Basic Definition and Terminology – Set-theoretic Operations – Member Function Formulation and Parameterization – Fuzzy Rules and Fuzzy Reasoning – Extension Principle and Fuzzy Relations – Fuzzy If-Then Rules – Fuzzy Reasoning – Fuzzy Inference Systems – Mamdani Fuzzy Models – Sugeno Fuzzy Models – Tsukamoto Fuzzy Models – Input Space Partitioning and Fuzzy Modeling. DETAILED SYLLABUS Topics Hours 10 AIM : To introduce the techniques of soft computing and adaptive neuro-fuzzy inferencing systems which differ from conventional AI and computing in terms of its tolerance to imprecision and uncertainty.

2003. ( COMPUTER ENGINEERING) SEMESTER VII HOURS PER LECTURES : -WEEK TUTORIALS : -PRACTICALS : 02 HOURS MARKS EVALUATION THEORY --SYSTEM: PRACTICAL --ORAL -25 TERM WORK -25 Objective: The Project work enables students to develop further skills and knowledge gained during the programme by applying them to the analysis of a specific problem or issue.S.Eberhart. C. For students to demonstrate proficiency in the design of a research project.Ross. Distribution of marks for term work shall be as follows: Laboratory work (Experiments and Journal) 15 Marks Test (at least one) 10 Marks The final certification and acceptance of TW ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work. “Genetic Algorithms: Search.PC Tools”. R. PROJECT – I CLASS B.A term Work test of 10 marks must be conducted.V. “Neuro-Fuzzy and Soft Computing”. J. Optimization and Machine Learning”. McGraw-Hill.R. 08 TEXT BOOK 1. collection and analysis of data and presentation of results.. “Neural Networks. Timothy J.E.Term work should consist of at least 8 practical experiments and two assignments covering the topics of the syllabus.T. “Computational Intelligence . Addison Wesley. AP Professional. Guidelines: 23 . P. 3. S. Boston. N.Dobbins.5.A. Fuzzy Logic and Genetic Algorithms”.Goldberg. TERM WORK iii. 1989. 2004. PHI. “Fuzzy Logic with Engineering Applications”.Y. 4.Pai. 2. Davis E. PHI.Mizutani. iv. via a substantial piece of work carried out over an extended period. Pearson Education 2004.Simpson and R. Oral Examination must be based upon the syllabus of 25 marks. APPLICATIONS OF COMPUTATIONAL INTELLIGENCE Printed Character Recognition – Inverse Kinematics Problems – Automobile Fuel Efficiency Prediction – Soft Computing for Color Recipe Prediction. application of appropriate research methods. 1997. 1996.Sun and E. REFERENCES 1.Jang. Rajasekaran and G.

 In case of industry projects. Term Work: Distribution of marks for term work shall be as follows: 1. This progress report can be used for awarding term work marks.  Project work must be carried out by the group of at least two students and maximum three and must be original. Project Report Format: At the end of semester a project report should preferably contain at least following details: Abstract  Introduction  Aims and objectives  Literature Surveyed  Existing system (if any)  Problem Statement  Scope  Proposed System  Methodology (your approach to solve the problem)  Analysis  Details of Hardware & Software  Design details  Implementation Plan for next semester 3. 65 percent projects must be in house.  The project work can be undertaken in a research institute or organization/company/any business establishment. visit by internal guide will be preferred. Term End Presentation (Internal) 10 Marks The final certification and acceptance of TW ensures the satisfactory performance on the above three aspects. Project Report 15 Marks 2. Final Assessment: 24 .  Student must consult internal guide along with external guide (if any) in selection of topic. but be sure that they should evolve them in the unique way to suit their project requirements.  Students can certainly take ideas from anywhere. Project Topic:  To proceed with the project work it is very important to select a right topic.  Make sure that external project guides are BE graduates. Project can be undertaken on any subject addressing IT programme. 2.  Student has to submit weekly progress report to the internal guide and where as internal guide has to keep track on the progress of the project and also has to maintain attendance report.  Head of department and senior staff in the department will take decision regarding projects. Out of the total projects 35 percent may be allowed as to be industry projects. Research and development projects on problems of practical and theoretical interest should be encouraged.1. 4.

Project – I examination should be conducted by two examiners appointed by university. Theory 1.E. 3. 2. Students have to give demonstration and seminar on the Project – I. University of Mumbai Syllabus Structure(R-2007) At B. No. 5. 6. Subject Scheme of Evaluation Paper Oral/ TW practical Hours Marks 3 3 3 3 3 -100 100 100 100 100 -500 25 25 25 25 25 25 150 25 25 25 25 25 25 150 Total 150 150 150 150 150 50 800 -20 Elective. 4. (Computer Engineering) Semester-VII Scheme of Instructions Periods per Week Each Period of 60 Min.I 1) Computer Simulation and Modeling 2) E-commerce 3) Project Management 4) Soft Computing 25 . Digital Signal & Image Processing Robotics and AI Mobile Computing System Security Elective-I Project-I 4 4 4 4 4 Practical 2 2 2 2 2 2 12 Sr.

E. Theory 1. (Computer Engineering) Semester-VIII Scheme of Instructions Periods per Week Each Period of 60 Min. Distributed Computing Multimedia System Design Software Architecture Elective-II Project-II 4 4 4 4 -16 Practical 2 2 2 2 4 12 Sr.University of Mumbai Syllabus Structure(R-2007) At B. 3.E. 26 . No. 2. 4. 5. Subject Scheme of Evaluation Paper Oral/practi TW cal Hours Marks 3 3 3 3 -100 100 100 100 -400 25 25 25 25 50 150 25 25 25 25 50 150 Total 150 150 150 150 100 700 Elective-II 1) Human Computing Interaction 2) Advanced Internet Technology 3) Computer Vision 4) Embedded System University of Mumbai Branch : Computer Semester : VIII Engineering Subject :: Distributed System (Abbreviated as DS) Periods per Week( Each Lecture 04 Class: B.

system model. Deadlock. File-Caching Schemes. Thrashing. File models. Distributed File Systems: Introduction. process migration. Load balancing approach. Synchronization: clock synchronization. File sharing Semantics. special types of RPCs. Issues in message passing. implementing RPC mechanism. Group communication. Heterogeneous DSM. event ordering. Task assignment approach. Transparency of RPC. 4. structure of shared memory space. distributed operating system.60 Min) Evaluation System Practical 02 Tutorial ----Hours Theory 03 Oral -Term Work -Total 03 Marks 100 25 25 150 Objective: This course aims to build concepts regarding the fundamental principles of distributed systems. Design and implementation of DSM. Resource and Process Management: Desirable Features of global Scheduling algorithm. call Semantics. load sharing approach. File Replication. Threads 7. Fault Tolerance. Exception Handling . 27 . Parameter-passing Semantics . Process addressing. Remote procedure call: RPC model. Lightweight RPC. Encoding and decoding of message data. Communication protocols for RPCs. File Accessing models. Marshaling arguments and Results. Atomic Transactions and design principles. Distributed Shared Memory: General architecture of DSM systems. Complicated RPC Client server binding. Server Management. Election Algorithm 6. The design issues and distributed system concepts are covered Pre-requites: Operating Systems and Computer network DETAILED SYLLABUS 1. Security. Fundamentals: Distributed computing. Replacement Strategy. multidatagram messages . Optimizations for better performance. 3. Stub generation. mutual exclusion. consistency models. Introduction to process management. designing operating system. RPCs in Heterogeneous Environments. Granularity. other approaches to DSM. Failure handling. buffering. synchronization. Message Passing : Desirable features message passing system. good features of DFS. and Advantages of DSM 5. Introduction to DCE 2.

A. List of assignment ( Minimum 10 ) 1. Coulouris. A. M. 11.S.8. Kindberg “Distributed Systems : Concepts and design” Pearson Edition 2. Singhal. Naming : Introduction. 5. Case study/implementation of DCOM 9. Client server implementation using CORBA architecture. 4. 28 . for Distributed System 10. 6. Java socket programming. Implementation of Deadlock 3. Desirable features of Naming system. G. Study of data centric & client centric consistency model. System oriented Names. Object locating mechanisms. Name Caches and Naming and Security BOOKS Text Books: Pradeep K Sinha “ Distributed Operating Systems : Concepts and design” IEEE computer society press 2. 8. human oriented Names. N. Implementation of Election Algorithm 2. ROMER “Distributed Systems Architecture : Middleware approach” ELSEVIER publication References: 1. Tanuenbaum “Distributed Operating System” Pearson Edition 3. Study project on Java Beans R. Fundamental concepts. PUDER. Shivaratri “ Advanced Concepts in Operating Systems” TMH 1. J. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. Dollimore and T. Client-server implementation using RPC/RMI. Implementation of Clock synchronization 7. Study experiment on Network operating system and Distributed operating system with example Implementation name resolution 12. TERM WORK Term work should consist of at least 10 practical experiments and two assignments covering the topics of the syllabus Distribution of marks for term work shall be as follows: Laboratory work (Experiments and Journal) 15 Marks Test (at least one) 10 Marks The final certification and acceptance of TW ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work.

HDTV Computer Video format.RIFF. computer support. JPEG 2000 standard. Performance comparison of JPEG and JPEG2000 05 Video Chapter 4 Introduction to digital video: Types – Chromasub sampling. Types: Traditional Vs Continuous. network architecture Evolving Technologies. Standards used – H.image. Objects of multimedia systems.JPEG methodology.IMA.E . 2D logarithmic. workstation . CCITT group 3 1D. Multimedia system Architecture:. presentation. Color Image.Application subsystem.264 . storage.Managing resources during multimedia transmission 06 Chapter 3 Compression & Decompression Introduction to digitization principle -text . network Architectural Issues Multimedia communication subsystems :.13. Packbit encoding (RLE). representation.Comparison of MPEG and H.2. File formats – RTF. TIFF.4. basic concepts establishing and closing multimedia call . Study/ implementation of stateful server and stateless server Class : B. Interactive application over internet. communication systems. Hierarchal search. University of Mumbai Branch : Computer Semester : VIII Engineering Subject :: Multimedia System Design (Abbreviated as MSD) Lecture 04 Practical 02 Tutorial ----Hours Theory 03 Oral -Term Work -Total 03 Content Periods per Week( Each 60 Min) Evaluation System Marks 100 25 25 150 Lect 06 Module Chapter 1 Introduction: What is multimedia. MPEG 1. CCIR . Transport subsystem. Global structure. video. Binary (Text ) compression scheme.261. Entertainment and application Requirements : User. transmission. QoS and resource management. audio.7 and File formats – DVI 05 29 . Properties of multimedia systems: Independency. Video compression: Based on motion compression Motion vector search technique : Sequential. Applications of multimedia Chapter 2 Multimedia data and interactions Data Streams:-Elements of multimedia systems. information exchange Multimedia communication system Model:.Interpersonal communication. Medium: perception. types of data compression .3 21D and 4 2D compression. Need .

MIDI Devices. plotters Multimedia database system :Characteristics. Distributed C. Pearson Edu Multimedia communications.Chapter 5 Audio/Sound Basic sound concepts :Computer representation of sound.Rao. synchronization. Designing. Speech Analysis. Audio formatsMIDI. Effective HCI 04 Chapter 9 Applications Copyright Act for multimedia and method of licensing Applications:-Multimedia animation. Juke box.M. MPEG audio 05 Chapter 6 Storage Requirements Basic technology: Video disk :Audio data rate – SNR wrt VCD player . MIDI Messages. Pearson Edu. Pearson Education 3) “ Fundamentals of Multimedia .S operations. 30 . Pearson Education 2) “ Multimedia System design “. Architecture.S. standards and networks. Ze-Nian Li. Virtual Reality.Milovanovic References:1) 2) 3) 4) Multimedia database systems :. Requirement. Prabhat K. Mark.J.Edu Multimedia Systems – Koegel Buford. MIDI SMPTE timing standard MIDI Software:Speech. digital camera Output devices :.Drew 4) “ Multimedia Communication Systems: Techniques.Subramanian. Halshall. CD player. Peripherals and databases required for multimedia Input devices :. Kiran Thakrar 3) “ Multimedia Systems”. Speech Transmission Audio Compression: ADPCM in speech coding.Electronic pen. relational databases 07 Chapter 7 Distributed Multimedia Systems Components of distributed MM system.R. Design Issues Approaches. Data structures Operations. managing distributed objects. MM object server . Koegel Buford. Streaming protocols 07 Chapter 8 Multimedia presentation and Authoring Multimedia system design & its Issues. Andheigh. Real time multimedia. Authoring Systems. Pearson. DVD. Types. Models : Object oriented. laser) . Knowledge based multimedia systems 04 Textbooks :1) “ Multimedia: Computing.D. Presentation design knowledge. Communications and Applications”. Scanner.Kaufman Computer Networking :.F. Speech Generation. Steinmetz Ralf and Nahrstedt Klara.Kurose . K. List of Experiments ( reference ) :At least 10 experiments to clear the concepts behind multimedia system design needs to be performed.Printers ( Inkjet.WAV Music: MIDI concepts. User Interface Issues. Information characteristics for presentation.

this course focuses on supporting creation of real implemented systems. its setting. Rather than focusing on one method. Branch: Computer Engineering Subject: Software Architecture (Abbreviated as SA) Periods per Week Lecture (each 60 min) Practical Tutorial Evaluation System Theory Oral Term Work Total Semester: VIII 04 02 -Hours 03 --03 Marks 100 25 25 150 Objectives of the course: Software architecture is foundational to the development of large. Hence the course details not only modeling techniques. but design. Pre-requisites: Object Oriented Software Engineering 31 . implementation. Study of streaming audio/video for distributed network Study of VRML Create a 3D object using 2D and show special effects for the same Oral / Practical Examination must be based upon the syllabus University of Mumbai Class: B.as well as a host of other topics -. this new course widely surveys software architecture techniques. enabling us to choose the right tool for the job at hand.putting the elements in context and comparing and contrasting them with one another. 1 2 3 4 5 6 7 8 9 10 11 12 13 List of Practical Experiments Study of MAYA software Study of FLASH software Creating a banner Creating a ghost (unshaped) 2D object Create animation using (expt 3. or process. streaming and non streaming techniques. tool. and system adaptation -.Distribution of marks for term work shall be as follows: Laboratory work (Experiments and Journal) 15 Marks Test (at least one) 10 Marks The final certification and acceptance of TW ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work.E. notation.4 ) Add sound to above expt (with play button ) Create moving objects (using expt 5) Create a game using action script Create a flash based presentation (4/5 frames) with UI controls Study of VLC player. Sr. Critically.No. deployment. practical software-intensive applications.

1 The Design Process. 5.2 Ambiguity.1 Analysis Goals. 8.Module 1 2 3 4 5 6 7 8 Contents Basic Concepts 1.1 Pipes and Filters 7. 5.4 Architectural Conception in Absence of Experience.5 Example Connectors.4 Connector Types and Their Variation Dimensions. 2.5 Specific Modeling Techniques.2 Architectures for Network-Based Applications.2 Connector Foundations.2 Event. Designing Architectures 2.3 Processes.2 Existing Frameworks. Connectors 3. Analysis 5. 4. 6. 5.6 Analysis Techniques. 4.1 Distributed and Networked Architectures. 8.2 Scope of Analysis.1 Concepts. 3.3 Software Architecture and Deployment.1 Modeling Concepts.4 Level of Formality of Architectural Models. 4. 6. 1. 8.4 Stakeholders.3 Complex Modeling: Mixed Content and Multiple Views.based.4 Repositories 7.2 Architectural Conception.3 Connector Roles. 4.5 Type of Analysis. Implementation and Deployment 6. and Precision.3 Architectural Concern being Analyzed. 1. 3.3 Decentralized Architectures. Conventional Architectural styles 7. 2.3 Layered systems 7.2 Models. Implicit Invocation 7. 2. Accuracy.5 Interpreters 7.3 Refined Experience in Action: Styles and Architectural Patterns.4 Evaluating Modeling Techniques.1 Connectors in Action: A Motivating Example. 3.6 Process control Applied Architectures and Styles 8. 5. Modeling 4. 3.1 Concepts of Software Architecture 1.4 Service-Oriented Architectures and Web Services. Designing for Non-Functional Properties Hours 03 02 06 04 08 04 05 08 9 04 32 .4 Software Architecture and Mobility. 5. 6.

Pearson ”Pattern Oriented Software Architecture” by Frank Buchnan etal. 2. Theory.0 Integrate software components using a middleware Use middleware to implement connectors Wrapper to connect two applications with different architectures Creating web service Architecture for any specific domain BOOKS 04 1. 4. Text Books: 1. TOPICS FOR EXPERIMENT Modeling using xADL Analysis – Case study Visualization using xADL 2. Wiley India. 3.2 Domain-Specific Software Architecture. Domain-Specific Software Engineering 10.2 Complexity. 3.1 Efficiency. “Software Architecture: Foundations. Product Lines. 8. Albin References: 1. Nenad Medvidovic. and Practice” by Richard N. 7. Hall. Shaw: Software Architecture Perspectives on an Emerging Discipline. 9. 10. PRACTICAL/ORAL EXAMINATION A Practical/Oral examination is to be conducted based on the above syllabus. “The Art of Software Architecture” by Stephen T.5 Dependability. PrenticeLen Bass. Paul Clements.3 Scalability and Heterogeneity. 5. 9.3 DSSAs. 9. ISBN: 978-0-470-16774-8 M.1 Domain-Specific Software Engineering in a Nutshell. 9. and Architectural Styles. 6. 2. Rick Kazman: Software Architecture in Practice. 2.4 Adaptability. TERM WORK Term work should be based on the Lab experiments (15 Marks) and at least one term test must be conducted with a weightage of (10 Marks).10 9. 33 . Taylor. 10. Eric Dashofy .

the concept of direct manipulation. characteristics.Class : B. and computer science on user interface development projects. and ideas for interface design.  To introduce the student to the literature of human-computer interaction.Principles of user interface. techniques. Hours Introduction: Importance of user Interface – definition. Benefits of good design. Design process – Human interaction with computers. design.Design goals – Screen planning and purpose. importance of good design. 04 2.  To expose the future user interface designer to tools.  To stress the importance of good user interface design DETAILED SYLLABUS Topics Sr. Web user – Interface popularity. importance of human characteristics human consideration. and understanding business junctions. Characteristics. graphical system. University of Mumbai Branch : Computer Engineering Semester : VIII Subject : HUMAN COMPUTER INTERACTION (Abbreviated as HCI) (Elective-I) Periods per Week( Each 60 Min) Lecture 04 Practical 02 Tutorial ----Hours Theory 03 Oral -Term Work --Total --- Evaluation System Marks 100 25 25 150 Objectives  To facilitate communication between students of psychology. 06 3. A brief history of Screen design.E . No 1. ordering of screen data and content – screen navigation and flow – Visually pleasing composition – amount of information – focus and emphasis – presentation information simply and meaningfully – information 10 34 . Human interaction speeds. Screen Designing:.  To provide the future user interface designer with concepts and strategies for making design decisions. 05 4. The graphical user interface – popularity of graphics. organizing screen elements.

selection of devices based and screen based controls. Interaction Devices – Keyboard and function keys – pointing devices – speech recognition digitization and generation – image and video displays – drivers.retrieval on web – statistical graphics – Technological consideration in interface design. Abowd. Pearson Education 2. 04 6 7 8 Components – text and messages. Sharps. The essential guide to user interface design. Oral Examination must be based upon the syllabus of 25 marks.E. 3. Soren Lauesen . Pearson Education. Alan Dix. Icons and increases – Multimedia. Pearson Education Asia. 2. 5 Windows – New and Navigation schemes selection of window. Wilbert O Galitz. REFERENCE BOOKS: 1. Wiley DreamTech. TERM WORK v. 04 03 06 TEXT BOOKS : 1. Russell Bealg. Interaction Design Prece. Janet Fincay. 3rd Edition Ben Shneidermann .Term work should consist of at least 8 practical experiments and two assignments covering the topics of the syllabus. Designing the user interface. Human – Computer Interaction. interface – Building Tools. Rogers. colors.A term Work test of 10 marks must be conducted. User Interface Design. Software tools – Specification methods. Distribution of marks for term work shall be as follows: Laboratory work (Experiments and Journal) 15 Marks Test (at least one) 10 Marks The final certification and acceptance of TW ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work. uses problems. vi. Wiley Dreamtech. choosing colors. ( Computer Engineering) SEMESTER VIII 35 . Advanced Internet Technology (Elective-II) Abbreviated as (AINT) Class: B. Gre Goryd.

DHCP.FTP. Type of Records in DNS. Working of FTP. Multimedia over Internet.HOURS PER WEEK LECTURES TUTORIALS PRACTICALS : : : EVALUATION SYSTEM: THEORY ORAL TERM WORK 04 -02 HOURS 3 - MARKS 100 25 25 Objectives of the course:  To understand Technical aspect of Internet Technology  To learn Advanced web programming Contents of the Course Section 1: Advanced Internet Protocols DNS. Secure Payment Mechanism. Consuming Web Service with AJAX. Hierarchical Routing. CIDR. Section 3. forward and Reverse lookup. and Routing Protocol over internet. Working of DNS. working of DDNS . Working principle of search engines Section 4: Internet Security Public Key Infrastructure. Virtual Private network Section 2: Internet as a Distributed computing platform 1) Understanding Web Services technology. Configuration of OS Public FTP server and Private FTP server Understanding IPv6. Resource Syndication (RSS). Configuration of OS DHCP . FLEX . REST based web services (Resource Oriented Architecture) and Service oriented Architecture. Integrating PHP and AJAX. Velte : Tata McGraw-Hill 2) Using Google App Engine: By Charles : O’reilly Press 3) Cloud Application Architecture: By George: O’reilly Press 4) RESTful web services: By Leonard: O’Reilly Press 36 . Working of DHCP. Rich Internet Technology. AJAX. Configuration of Open Source (OS) DNS. 2) Introduction to cloud computing. Voice over IP. Server Side Vulnerabilities.0. Client side Vulnerabilities. 3) Working of Peer to Peer over internet with case study of Bittorent . Database Vulnerabilities. Forouzan : Tata McGraw-Hill Section 2: 1) Cloud Computing : A practical Approach: By Anthony T. DHCP header. Security issues in cloud TEXT BOOKS /REFERENCE BOOKS: Section1: 1) TCP/IP Protocol Suite : By Behrouz A. case study and working of Google App engine and Amazon cloud. DNS Header. Advanced Internet programming 1) HTML 5.

Branch: Computer Engineering Subject: Computer Vision(Elective-II) Periods per Week Lecture (each 60 min) Practical Tutorial Evaluation System Theory Oral Term Work Semester: VIII 04 02 -Hours 03 --Marks 100 25 25 37 . Suggested List of Experiments Students need to perform three Mini projects based on the syllabus.E. Time duration for each project will be three weeks.0 Programming : By Eric : Wrox Press 3) HTML 5.5) Web Services Essentials:By Ethan: O’Reilly Section 3: 1) Rich Internet Application AJAX and Beyond: B y Dana moore : Wrox press 2) Web 2.0: By Mark: O’reilly Press 4) Web Technologies NEW :Black Book : Dreamtech Section 4: 1) Information Security :By Mark Stamp : Wiley Publication 2) Cloud Security and Privacy: By Tim : O’Reilly Marks 1. Laboratory work (Mini Projects and Journal) 15 Marks 2. Suggested List of Mini Projects 1) 2) 3) 4) 5) Configuration of Private cloud using open source technology Development of DMZ for the college Creating RIA web Site Working with SOA and REST based Web Services Working With Goggles APP engine (In Python) University of Mumbai Class: B. Test (at least one) 10 Marks The final certification and acceptance of TW ensures the satisfactory performance of laboratory Work and Minimum Passing in the term work.

Information Integration. Spatial moments. Matching. Hough transform. Connected component labeling. Boundary analysis: Signature properties. Recognition of shapes. Morphological Image Processing: Introduction. Line fitting. Area Extraction: Concepts. Mixed spatial gray-level moments. Understanding line drawings. External points. Thinning. Morphological algorithm operations on binary images. Region descriptors Binary Machine Vision: Thresholding. Hierarchal segmentation. Photogrammetry . Orderedstructural matching. Object recognition Hough transforms and other simple object recognition methods Hours 02 04 3 4 04 06 5 6 05 05 7 04 8 04 9 10 02 03 11 03 12 13 03 02 38 . General Frame Works: Distance -relational approach. Segmentation. Global vs. Motion-based segmentation. Edge. Opening. Classification of shapes by labeling of edges.Total 03 150 Objectives of the course: To introduce the student to computer vision algorithms. Closing. Image matching : Intensity matching of ID signals. View class matching. region shrinking. Facet Model Recognition: Labeling lines.from 2D to 3D. Rule-based Segmentation. Boundary descriptors. Hierarchical image matching. Matching of 2D image. Knowledge Based Vision: Knowledge representation. Image Representation and Description: Representation schemes. Data-structures. Models database organization. Split & merge. Local features General Frame Works For Matching: Distance relational approach. View class matching. Dilation. Region Analysis: Region properties. Ordered Structural matching. Curve fitting (Least-square fitting). Extracting. Object Models And Matching: 2D representation. Grouping. Shape numbers. Labeling. Morphological algorithm operations on gray-scale images.Hit-or-Miss transformation. Line-Linking. Inverse perspective Projection. methods and concepts which will enable the student to implement computer vision systems with emphasis on applications and problem solving Pre-requisites: Introduction to Image Processing. Back-tracking Algorithm Perspective Projective geometry. Erosion. Module 1 2 Contents Recognition Methodology: Conditioning. Consisting labeling problem. Controlstrategies. Models database organization. Spatial clustering. Region growing. Thickining .

II. gnu insight with step level trace debugging. "Computer Vision: A Modern Approach" References: 3. SOC). peripheral modules. "Image Processing. Binary file formats for processor executable files.Robert Haralick and Linda Shapiro.Shape correspondence and shape matching Principal component analysis Shape priors for recognition BOOKS Text Books: 1. Byte ordering 39 . "Computer and Robot Vision". David A.E. Hardware/Software co-design. operating modes with ARM core. and at least one term test must be conducted with a weightage of (10 Marks). Elective – II: EMBEDDED SYSTEMS CLASS: B. programming with Linux environment and gnu debugging. Timers. and Machine Vision" Thomson Learning TERM WORK Term work should be based on the Lab experiments (15 Marks) . (COMPUTERS) HOURS PER WEEK LECTURES TUTORIALS PRACTICALS THEORY PRACTICAL ORAL TERM WORK Hours 03 SEMESTER – VIII (Elective) 04 -02 Marks 100 25 25 EVALUATION SYSTEM 1. Embedded Software Development Assemblers. make file interaction. Introduction to Embedded Systems Review of microcontrollers and Digital Signal Processors (DSP).Vaclav Hlavac. architecture. Forsyth. Design with ARM Processor Introduction to ARM instruction set. AddisonWesley. RISC. ARMTDMI modes. Analysis. 1993. Milan Sonka. Jean Ponce. Roger Boyle. 2. Interrupt structure. addressing modes. Architecture of embedded systems. 2. 3. Typical structure of timer-interrupt driven programs. interrupts structure. addressing modes. linkers and loaders. hardware multiplier. 1. CISC. ADC. Vol I. Embedded micro controller cores (ARM. building and execution. pipelining. GNU-GCC compiler introduction.

Embedded Linux – Hollabaugh. Real-time Operating System Real Time Operating System Concepts. System design with ARM processor. Architecture.(LE.RT Linux. Simon – Pearson Education South Asia. Semaphore Management. Thumb mode normal mode instructions changes. 6. Applications of Embedded Systems Database applications. Message Queue Management. 4. Embedded / Real-Time Systems: Concepts. 5. Pankaj Gupta – Tata McGraw Hill. 2. Process-control. Priorities. Task Management. Ltd. ARM9. 3. Embedded Microcomputer Systems Real Time Interfacing . solenoids. 40 . Design & Programming – Dr. Prasad – dreamtech Press. Programming and Design – Raj Kamal – Tata McGraw Hill. Reference Books: 1. Embedded Realtime Systems Programming . An Embedded Software Primer – David E. analog interfacing and data acquisition systems. Deadlocks. India. V. and ARM11 with new features additions. transistors used for digitalcontrolled current switches. Mutual Exclusion. ARM System Developer’s Guide Designing and Optimizing System Software – Andrew N.Jonathan W. K. Automation. Memory Management. AC and stepper motors. Critical Sections. Schedulers. Image processing. Event Control Blocks. Pipeline utilization with all register allocations. K. BE). Sloss. 2. Fundamentals of Microcontrollers and Applications in Embedded Systems – Ramesh Gaonkar – Penram International Publishing (India) Pvt. Time Management. DC. K. 4. digital-controlled relays. RTOS implementation. Text Books: 1. Valvano – Thomson Asia Pte Ltd. Embedded Systems. Synchronization. Examples of OSs for embedded systems . 3. Message Mailbox Management. Multitasking. Compare with ARM7. Term Work: Term work should consist of at least 8 practicals and one mini project. Security and communication. Dominic Sysmes and Chris Wright – Elsevier Inc. Robotics. Objective type term work test shall be conducted with a weightage of 10 marks. Input / Output Interfacing Interfacing with switches. LED’s. 4. Pearson Education. LCD’s. uC/OS. keyboards. Kernel Structure.Sriram V Iyer.

In-Circuit Emulator (ICE) and In-Circuit Debugger (ICD) 13. Spectrum Analyzer 15. 4. 2. 9. 5. 7. LEDs and Keyboard Interface 16x2 LCD Interface Counting external events with on chip counters DC Motor Control Relay and Buzzer Control for alarm events Unipolar and Bipolar Stepper Motor Control On chip ADC SPI / I2C / CAN Interface Blue tooth/Zig-bee interface Topic-3: Device Driver Development [Any Two] 1. Drivers for RS-232 41 . 3. Logic Analyzer 14. 6. List of Experiments: Topic-1: Troubleshooting Tools [Any Two] 12. 8.Marks: Distribution of marks for term work shall be as follows:  Laboratory work (Experiments and Project)  Test (at least one) 15 Marks 10 Marks The final certification and acceptance of Term Work ensures the satisfactory performance of laboratory work and minimum passing in term work. Pattern generator and Digital Storage Oscilloscope Topic -2: ARM Processors & Interfaces [Any Two] 1.

0 3. Test cases. Requirement Analysis. ( COMPUTER ENGINEERING) SEMESTER VIII HOURS PER LECTURES : -WEEK TUTORIALS : -PRACTICALS : 04 HOURS MARKS EVALUATION THEORY --SYSTEM: PRACTICAL --ORAL -50 TERM WORK -50 Objective: The primary objective is to meet the milestones formed in the overall project plan decided in Project .2. conclusion and future work.E. Project Report Format: At the end of semester a student need to prepare a project report which should preferably contain at least following details:Abstract. and Appendix consisting of user Manuals. required utilities. Drivers for Graphics LCD/Touch Screen Topic-4: Real Time Operating System (RTOS) [Any Two] 1. Project time line. Problem Statement. Implementation code. references. The project will culminate in the production of a thesis by each individual student. Project design. Implementation Details. Technologies used . Drivers for USB2. Introduction and Motivation. Guidelines: 5. uCLinux porting to ARM Architecture 3. Project overview. printed and hard bound report. Drivers for Ethernet 4.I. The idea presented in Project – I should be implemented in Project – B with results. Software’s and user Manuals need to be attached. Every student must prepare well formatted. Task Distribution. GCC porting to RISC Architecture PROJECT – II CLASS B. 6. RTLinux porting to x86 Architecture 2. Term Work: Student has to submit weekly progress report to the internal guide and where as internal guide has to keep track on the progress of the project and also has to maintain attendance 42 . conclusion & future work. Along with project report a CD containing: project documentation.

Project Report (Hard Bound) 25 Marks 2. Computer Engineering Equivalent subjects Semester VII R 2001 i) Digital signal processing ii) Advanced Microprocessor iii) software Engineering iv)Inteligent system v)Elective –I a) Mobile computing b)Computer Simulation & Semester VII R2007 i) Digital signal processing (R2001) ii) Advanced Microprocessor(R2001 iii) Project Management ( Sem 7-R2007) iv) Inteligent system (R2001) v) Elective -I a)Mobile computing (Sem VII R2007) b) Computer simulation & 43 . This progress report can be used for awarding term work marks. In case of industry projects. Final Assessment: Project – II examination should be conducted by two examiners appointed by university. 7. Distribution of marks for term work shall be as follows: 1. Term End Presentation (Internal) 25 Marks The final certification and acceptance of TW ensures the satisfactory performance on the above three aspects. visit by internal guide will be preferred to get the status of project. Students have to give demonstration and seminar on the Project – II.report.

modeling c) Pattern Recognition d)Embeded system e) Advanced Computer Network f) Image Processing vi) Project A modeling ( sem VII R2007) c) Pattern Recognition (R2001) d) Embeded system (R2001) e) Advanced computer network (R2001) f) Image processing (R2001) vi) Project A Semester VIII 2001 i) System Security ii) Multimedia system iii) Distributed Computing iv) Elective –II a) Data ware housing and Mining b) Computer Vision c) Software testing d)Neural network & fuzzy system e) Parallel Processing v) Project B Semester VIII R 2007 i) System security ( Sem VII R 2007) ii) Multimedia system design (R 2007) iii) Distributed Computing (R2007) iv) Elective –II a) Data ware housing and Mining (R2001) b) Computer vision (R2007) c) Software Testing (R2001) d) Neural network & fuzzy system ( R 2001) e) Parallel Processing (R2001) v) Project B 44 .

Sign up to vote on this title
UsefulNot useful