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

Commonly used sensing techniques. Objective: This course will introduce the basic ideas and techniques underlying intelligent robotics. Write Matlab Program for lossless Image Compression. 5 . Students will be familiar with terminologies used in Robotic Systems and understand Robotic Arm movements. Robotics and AI (Abbriviated as RAI) CLASS B. ( 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 Image sharpening. Write Matlab Program for Trimmed Average Filter. Basic understanding about Intelligent agent. Analysis of Algorithms. Write Matlab Program for Edge detection. knowledge representation and reasoning.E.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. Write Matlab Program for lossy Image Compression.

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

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

Crypto Arithmetic Problems. 2. Laboratory work (Experiments and Journal) 15 Marks 2. Practical Experiments must be implemented in Prolog/Lisp and C++. Development of Composite Rotation Matrix. 7. 6. 8 . Eight Queen Problem. 10. TWO assignments and at least ONE written test based on above mentioned syllabus. Distribution of marks for term work shall be as follows: 1. Graph Structures and Paths. 3.__________________________________________________________________________ TERMWORK _________________________________________________________________________ Term work should consist of at least 8 experiments. Knight’s Tour. 5. 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. Implementing Searching algorithm. ___________________________________________________________________________ __ 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. 8. Inverse Kinematics for Adept-I SCARA Robot. Wumpus world problem. 9. Water Jug Problem. 4.

Laboratory work (Experiments and Journal) 15 Marks 2. Term Work: Term work shall consist of at least 05 experiments and 03 assignments covering all topics and one written test.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.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. 9 . Distribution of marks for term work shall be as follows: 1. 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. 2) Use of Control-X simulation Control of Conveyor manually and thru Programming. Programming using sensors and conveyor.

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

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

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

Feistel Cipher. Malware. DES. 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. RC4. Access control Matrix.Authentication and Authorization: i. ii. Software reverse engineering. Kerberos. Confidentiality and Non-repudiation.Signature and Non-repudiation. Passwords. Tiger Hash. MD5. Software Flaws. Multiple level security model. Chapter 3 08 10 Chapter 4 13 . Block Ciphers.E . RSA. Digital Rights management.The final certification and acceptance of TW ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work. Biometric. ACLs. use of public key crypto. Use of Hash Function Access control . Triple DES. Symmetric Key Cryptography: Stream Ciphers. Covert channel. Hash Function: The Birthday Problem. Classic Cryptography ii. Multilateral security. CAPTCHA Software security: i. Race conditions ii. Salami attack. iv. Public Key Infrastructure. Defiie-Hellman. Crypto Basic. Authentication Protocol. Linearization Attacks. Single –sign on. Public Key Cryptography: Kanpsack. AES iii. Incomplete Mediation. 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. Trusting Software iii. A5/1. SHA-1. Authentication Methods.

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

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

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

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

Marks 1. Laboratory work (Experiments and Journal) 2. the consequences of e-Business. 4. E-Commerce Fundamentals and application (Henry Chan) Wiley publication 2. Introduction to Hadoop. Enterprise Application Integration. impacts of e-business 7.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. 3. RPC and RMI. E-commerce Infrastructure Cluster of Servers. Strategic planning process.. Sales and Promotions. and Ajax enabled) Access control mechanism (session management) 18 . Technology and applications (David) Tata McGrawHill Introduction to E-commerce (jeffrey) Tata. Levels of e-business strategies. and web portals 6. Home page design Form validation (Ajax enabled) Catalog design and Search techniques (Web mining . E. Google Apps engine TEXT BOOKS: 1. 2.Mcgrawhill E-Business and Commerce. Service Oriented Architecture. E-commerce strategies: Strategies for marketing. 10 Marks 15 Marks Suggested List of Experiments Exp 1: All experiments should be part of final e-commerce portal development 1. Virtual Communities. e-business Requirements. Characteristics of e-Business.WS-security. Electronics Commerce (Gary Schneider) Thomson Course technology 3. EAI and web Services.Commerce Strategies. loosely Coupled e-Business solutions for integration. 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. Cloud computing. Success factors for implementation of e-business strategies. 2. Business process and collaborations 8. 9. e-business Integration. Strategies for Purchasing and support activities. Integration of Application: Approaches to Middleware. Strategies for Web Auctions. Virtualization Techniques. HDFS. Business models. E-Business -Introduction: E-Business vs E-commerce. E-Business Organizational and technical foundation (Michael P) Wiley Publication REFERENCES: 1. E-business strategies: Strategic positioning. 4. eBusiness role and their challenges. Strategic alignment. 5.5. Server consolidation using cloud. 3.

1 Developing Project Charter 3.3 What is project management 1.5.1 Project Manager's job description 1.3 Virtual Teams 3.4.5.5.2 Outsourcing 2.3. ( 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.1 Stakeholders 1.1 Project Selection 3.  To understand knowledge areas and tools-techniques for efficient project management focusing IT projects.1 Organizational Structure 2. Server side using Web Services Exp 2: Creating Hadoop clusters on Ubuntu Project Management (Elective-II) CLASS B. Project Scope Management 4. Project Management and IT context 2.1 Collecting Requirements 19 .3. Introduction to Project Management 1.5.4 Characteristics of IT project Team members 2.3 Nature of IT projects 2. Project Integration Management 3.  To understand the Life cycle and phases of project management.2 Suggested Skills for Project Manager 1.2 Project Life Cycle and Phases 2.2 Project Management Knowledge Area 1. Creating Web Site to integrate at least five REST web Services (Web Mashups) 6.3 Developing Project Management Plan 4.E.4. Contents of the Course 1.3 Project Management tools and techniques 1.2 The triple constraint 1.3 Importance of people and leadership skills 2.1 Globalization 2.4 Role of a Project Manager 1.1 What is project 1.4.3.5 Trends affecting IT Project Management 2.

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

10 Marks 15 Marks 21 . Laboratory work (Experiments and Journal) 2. 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. 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.E .Term work shall consist of at least 6 assignments/1 project which will contain detailed Class : B. Marks 1.

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. 08 3. 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 . 10 4. 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. No 1.Sr. 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. Objectives :  To introduce the ideas of fuzzy sets. 09 22 .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.

via a substantial piece of work carried out over an extended period. 1996. C.A term Work test of 10 marks must be conducted.E.PC Tools”.Mizutani.R. 2003.Dobbins. Davis E. Addison Wesley.Eberhart. N. “Neural Networks. 2004.S. Rajasekaran and G.Simpson and R. Fuzzy Logic and Genetic Algorithms”. ( 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. 1997.Sun and E.V. “Computational Intelligence . TERM WORK iii. 1989.Jang. 4. Oral Examination must be based upon the syllabus of 25 marks. 08 TEXT BOOK 1. P. For students to demonstrate proficiency in the design of a research project. APPLICATIONS OF COMPUTATIONAL INTELLIGENCE Printed Character Recognition – Inverse Kinematics Problems – Automobile Fuel Efficiency Prediction – Soft Computing for Color Recipe Prediction. Guidelines: 23 . iv. 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.Y. R. 3. “Genetic Algorithms: Search. McGraw-Hill. REFERENCES 1. S. 2. PROJECT – I CLASS B. PHI.. application of appropriate research methods. Pearson Education 2004. Timothy J.Pai.Goldberg. AP Professional.5. Optimization and Machine Learning”.A.T. collection and analysis of data and presentation of results. “Neuro-Fuzzy and Soft Computing”. J. Boston. “Fuzzy Logic with Engineering Applications”. PHI.Term work should consist of at least 8 practical experiments and two assignments covering the topics of the syllabus.Ross.

Project Report 15 Marks 2.1. Term End Presentation (Internal) 10 Marks The final certification and acceptance of TW ensures the satisfactory performance on the above three aspects.  Head of department and senior staff in the department will take decision regarding projects.  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. 65 percent projects must be in house. Project can be undertaken on any subject addressing IT programme. Project Topic:  To proceed with the project work it is very important to select a right topic.  Project work must be carried out by the group of at least two students and maximum three and must be original. Research and development projects on problems of practical and theoretical interest should be encouraged. 2. Term Work: Distribution of marks for term work shall be as follows: 1. 4. 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. This progress report can be used for awarding term work marks. visit by internal guide will be preferred.  In case of industry projects. Out of the total projects 35 percent may be allowed as to be industry projects.  The project work can be undertaken in a research institute or organization/company/any business establishment.  Make sure that external project guides are BE graduates.  Students can certainly take ideas from anywhere.  Student must consult internal guide along with external guide (if any) in selection of topic. Final Assessment: 24 . but be sure that they should evolve them in the unique way to suit their project requirements.

No. 2.I 1) Computer Simulation and Modeling 2) E-commerce 3) Project Management 4) Soft Computing 25 . (Computer Engineering) Semester-VII Scheme of Instructions Periods per Week Each Period of 60 Min. 4.E. 5. Students have to give demonstration and seminar on the Project – I. 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. 3. University of Mumbai Syllabus Structure(R-2007) At B.Project – I examination should be conducted by two examiners appointed by university. 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. 6. Theory 1.

No.University of Mumbai Syllabus Structure(R-2007) At B. 2. Theory 1. 26 . (Computer Engineering) Semester-VIII Scheme of Instructions Periods per Week Each Period of 60 Min. E.E. 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. 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. 4. 3.

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

A. Case study/implementation of DCOM 9. Singhal. Dollimore and T. J. Implementation of Election Algorithm 2. Object locating mechanisms. Study of data centric & client centric consistency model. Name Caches and Naming and Security BOOKS Text Books: Pradeep K Sinha “ Distributed Operating Systems : Concepts and design” IEEE computer society press 2. N. Desirable features of Naming system. Kindberg “Distributed Systems : Concepts and design” Pearson Edition 2. 28 . ROMER “Distributed Systems Architecture : Middleware approach” ELSEVIER publication References: 1. Implementation of Deadlock 3. Tanuenbaum “Distributed Operating System” Pearson Edition 3. 6. System oriented Names. Coulouris. for Distributed System 10. 5.8. A. Study experiment on Network operating system and Distributed operating system with example Implementation name resolution 12. Naming : Introduction. PUDER. 4. 8. Fundamental concepts. Shivaratri “ Advanced Concepts in Operating Systems” TMH 1. ORAL EXAMINATION An oral examination is to be conducted based on the above syllabus. List of assignment ( Minimum 10 ) 1. Client server implementation using CORBA architecture. human oriented Names. Implementation of Clock synchronization 7. M. Client-server implementation using RPC/RMI. Java socket programming. 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. Study project on Java Beans R.S. G. 11.

Applications of multimedia Chapter 2 Multimedia data and interactions Data Streams:-Elements of multimedia systems. Study/ implementation of stateful server and stateless server Class : B. Standards used – H. video. 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.Interpersonal communication.RIFF. computer support. QoS and resource management. communication systems. Color Image. types of data compression .13. Properties of multimedia systems: Independency. Hierarchal search.JPEG methodology. CCIR . Interactive application over internet. basic concepts establishing and closing multimedia call . network architecture Evolving Technologies.image. Performance comparison of JPEG and JPEG2000 05 Video Chapter 4 Introduction to digital video: Types – Chromasub sampling.Application subsystem. storage. transmission. CCITT group 3 1D. Packbit encoding (RLE). representation. JPEG 2000 standard. Need .7 and File formats – DVI 05 29 . Entertainment and application Requirements : User. presentation.2. audio. HDTV Computer Video format.E . TIFF. network Architectural Issues Multimedia communication subsystems :. MPEG 1. File formats – RTF.IMA. workstation . Global structure. Video compression: Based on motion compression Motion vector search technique : Sequential.4. Medium: perception.261. 2D logarithmic.3 21D and 4 2D compression.264 .Managing resources during multimedia transmission 06 Chapter 3 Compression & Decompression Introduction to digitization principle -text . Types: Traditional Vs Continuous. Binary (Text ) compression scheme.Comparison of MPEG and H. Transport subsystem. information exchange Multimedia communication system Model:. Multimedia system Architecture:. Objects of multimedia systems.

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

this new course widely surveys software architecture techniques. notation. deployment. 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. Critically. Hence the course details not only modeling techniques. and system adaptation -. tool. implementation.putting the elements in context and comparing and contrasting them with one another. its setting. but design. this course focuses on supporting creation of real implemented systems.as well as a host of other topics -. streaming and non streaming techniques. Rather than focusing on one method.E. Pre-requisites: Object Oriented Software Engineering 31 . practical software-intensive applications. or process.No.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. 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.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. enabling us to choose the right tool for the job at hand. 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. Sr.

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

9.2 Complexity. Paul Clements. and Practice” by Richard N. 5. 8.4 Adaptability. 2. Hall. Albin References: 1. Shaw: Software Architecture Perspectives on an Emerging Discipline. 6. 4. PrenticeLen Bass.10 9. ISBN: 978-0-470-16774-8 M. 33 . Pearson ”Pattern Oriented Software Architecture” by Frank Buchnan etal. 2. 3. “Software Architecture: Foundations. and Architectural Styles. “The Art of Software Architecture” by Stephen T. TOPICS FOR EXPERIMENT Modeling using xADL Analysis – Case study Visualization using xADL 2. Domain-Specific Software Engineering 10. Taylor. PRACTICAL/ORAL EXAMINATION A Practical/Oral examination is to be conducted based on the above syllabus. Eric Dashofy .3 DSSAs. 10. 2. Text Books: 1.1 Domain-Specific Software Engineering in a Nutshell.3 Scalability and Heterogeneity. 9. Nenad Medvidovic.2 Domain-Specific Software Architecture. Theory. 3. 10.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. 7. Rick Kazman: Software Architecture in Practice. 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).1 Efficiency.5 Dependability. Wiley India. 9. 9. Product Lines.

and understanding business junctions. 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.  To expose the future user interface designer to tools. organizing screen elements.Design goals – Screen planning and purpose. No 1. A brief history of Screen design. The graphical user interface – popularity of graphics. 04 2. and ideas for interface design. importance of good design. techniques. Screen Designing:. Benefits of good design. Hours Introduction: Importance of user Interface – definition. 06 3. Design process – Human interaction with computers. 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 . characteristics.Class : B.E . Web user – Interface popularity.Principles of user interface. design. Characteristics. graphical system. importance of human characteristics human consideration. the concept of direct manipulation.  To introduce the student to the literature of human-computer interaction. and computer science on user interface development projects. Human interaction speeds. 05 4.  To provide the future user interface designer with concepts and strategies for making design decisions.  To stress the importance of good user interface design DETAILED SYLLABUS Topics Sr.

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

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. Security issues in cloud TEXT BOOKS /REFERENCE BOOKS: Section1: 1) TCP/IP Protocol Suite : By Behrouz A. Resource Syndication (RSS). Section 3. Voice over IP. Working of FTP. Working of DNS. Integrating PHP and AJAX. Database Vulnerabilities. Client side Vulnerabilities. Configuration of Open Source (OS) DNS. forward and Reverse lookup. Forouzan : Tata McGraw-Hill Section 2: 1) Cloud Computing : A practical Approach: By Anthony T. Virtual Private network Section 2: Internet as a Distributed computing platform 1) Understanding Web Services technology. 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 .FTP. DHCP header. Rich Internet Technology. Working of DHCP.DHCP. CIDR. Type of Records in DNS. Multimedia over Internet. 3) Working of Peer to Peer over internet with case study of Bittorent . Secure Payment Mechanism. working of DDNS . FLEX . Hierarchical Routing. case study and working of Google App engine and Amazon cloud. and Routing Protocol over internet. Configuration of OS Public FTP server and Private FTP server Understanding IPv6. Configuration of OS DHCP .0. DNS Header. Server Side Vulnerabilities. AJAX. Advanced Internet programming 1) HTML 5. REST based web services (Resource Oriented Architecture) and Service oriented Architecture. Working principle of search engines Section 4: Internet Security Public Key Infrastructure. Consuming Web Service with AJAX. 2) Introduction to cloud computing.

0 Programming : By Eric : Wrox Press 3) 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 .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.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. Time duration for each project will be three weeks. Suggested List of Experiments Students need to perform three Mini projects based on the syllabus. 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. 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. Laboratory work (Mini Projects and Journal) 15 Marks 2.

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

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

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

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. 8. Logic Analyzer 14. 6. 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. Spectrum Analyzer 15. Pattern generator and Digital Storage Oscilloscope Topic -2: ARM Processors & Interfaces [Any Two] 1. 2. 4. In-Circuit Emulator (ICE) and In-Circuit Debugger (ICD) 13. 5. 7. 9. List of Experiments: Topic-1: Troubleshooting Tools [Any Two] 12. 3. Drivers for RS-232 41 .

The idea presented in Project – I should be implemented in Project – B with results. Software’s and user Manuals need to be attached. 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. Drivers for Ethernet 4. required utilities. Project design. 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 . Implementation Details.E. Along with project report a CD containing: project documentation.I. Implementation code. Task Distribution. Guidelines: 5. Technologies used . RTLinux porting to x86 Architecture 2. references. Project time line.0 3. Problem Statement. ( 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 . Project overview. The project will culminate in the production of a thesis by each individual student. Test cases. Introduction and Motivation. Drivers for USB2. and Appendix consisting of user Manuals. GCC porting to RISC Architecture PROJECT – II CLASS B. conclusion and future work. uCLinux porting to ARM Architecture 3. printed and hard bound report.2. Every student must prepare well formatted. conclusion & future work. Requirement Analysis. Drivers for Graphics LCD/Touch Screen Topic-4: Real Time Operating System (RTOS) [Any Two] 1. 6.

report. Project Report (Hard Bound) 25 Marks 2. Term End Presentation (Internal) 25 Marks The final certification and acceptance of TW ensures the satisfactory performance on the above three aspects. 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 . visit by internal guide will be preferred to get the status of project. 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. Students have to give demonstration and seminar on the Project – II. Distribution of marks for term work shall be as follows: 1. 7.

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

Master Your Semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

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

Cancel anytime.