# 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

University of Mumbai Branch : Computer Semester : VII Engineering Subject ::DIGITAL SIGNAL & IMAGE PROCESSING(Abbreviated as DSIP) Class : B.E . Periods per Week( Each 60 Min) Lecture 04 Practical 02 Tutorial ----Hours Theory 03 Oral --Term Work --Total --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%

Evaluation System

Marks 100 25 25 150

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

5%

Chapter 5

15%

PHI s.) R.Image Degradation.E. regionbased segmentation. Image segmentation: Detections of discontinuities.Salivahanan “ Digital Signal processing “ TMH Anil K. Blind deconvolution . edge-linking and boundary detection. Image Restoration Model . Applications of Image restoration. homomorphic filtering Image Restoration and Denoising : Introduction. thresholding. Proakis. Inc. Classification of Noise in Image. inter-pixel. Trimmed Average Filter. lossy Compression 08L 15% 5L 10% Chapter 8 4L 10% Chapter 9 4L 10% BOOKS 1 2 Introduction to Digital signal processing – John G.Woods.Second edition. error-free compression.G. image compression models. Hough’s transform Image Data Compression: Fundamentals. . “Digital Image Processing”. psychovisual. Image Enhancement in the frequency domain: Frequency-domain filters: smoothing and sharpening filters.jain. fidelity criteria. Arithmetic and Logic Operation. Histogram Processing. redundancies: coding. Types of Image Blur . Spatial filtering: Introduction. Gray-Level Transformation. TAMAL BOSE “ Digital Signal and Image Processing “ John Wiley & Sons . S Esakkirajan . Pearson Education REFERANCE : 1 2 3 4 S. Bit plane slicing .. smoothing and sharpening filters. C.Median Filter . Classification of image restoration Techniques . Manolakis (Maxwell Macmillan Int.Gonsales R. D. T Veerakumar “ Digital Image Processing “ Mc Graw Hill. ‘Fundamentals of Image Processing’.Jayaraman . Linear and non-Linear image restoration Technique. Image Denoising .Chapter 6 Chapter 7 Image Enhancement: Image Enhancement in the Spatial domain : Spatial domain point operation and Neighbourhood Operation .

2 3 4 5 6 7 8 9 10 11 12 Write Matlab Program for generation and Manipulation of signal. Write Matlab Program for lossy Image Compression. Write Matlab Program for Edge detection. Write Matlab Program for lossless Image Compression. . Gray level Slicing Write Matlab Program for Dynamic range compression &Bit plane slicing Write Matlab Program for Histogram Processing Write Matlab Program for Image smoothing. List of Practicals 1. Write Matlab Program for Image negative . Write C/C++ Program for Discrete Fourier Transform. Write Matlab Program for convolution and correlation.TERM WORK 1. Write Matlab Program for Trimmed Average Filter. Write Matlab Program for Image sharpening.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 .

Five axis Articulated robot). methodology and techniques of intelligent systems to robotics. Robot Specifications. Problem-solution Techniques used in Artificial Intelligence. Hrs 4 2 12 3 10 4 8 5 4 6 7 6 4 . The goal of this course is to familiarize the students with the basic concepts of robotics. StraightLine Motion. Robot control and Intelligence. artificial intelligence and intelligent machines.E. Homogeneous Coordinates. FineMotion Planning. (IK analysis of . Expert Systems. Uncertainty. Production Systems. Sensory perception. It will help students to understand and apply principles. Robot Classification. The pick-and-place operation. Grasp Planning. (DK analysis of . Work envelope of 5-axis articulated Robot. Rotations. Module 1 Contents Intelligent Robotics: Automation and Robots.Robotics and AI (Abbriviated as RAI) CLASS B. Tool Configuration.2 Axis and 3 Axis Planar robot. ( 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: Exposure to linear algebra and matrix operations. Four axis SCARA Robot. Task Planning: Task-Level Programming. The arm Equation. Continuous-Path Motion. Gross-Motion Planning. Objective: The field of robotics is in a state of rapid development. Workspace Analysis and Trajectory Planning: Workspace analysis. Interpolated Motion. As computer technology improved. Task Planning Problem.2 Axis and 3 Axis Planar robot. Direct Kinematics: Coordinate Frames. Workspace Fixtures. Semantic Networks. Computer engineer plays a very crucial role in converting such mechanical devices into intelligent machines through a branch of computer science called artificial intelligence (AI). Configuration Space. Five axis Articulated robot). robots become more sophisticated. Basic Concepts of Artificial Intelligence: Intelligence. Early robots were nothing more than mechanical devices. Work envelope of 4-axis SCARA Robot. Exposure to programming in a high level language. Problem representation in Artificial Intelligence. Inverse Kinematics: General Properties of Solutions. Elements of Knowledge Representation: Logic. Four axis SCARA Robot.

Nagel and Odrey. “Industrial Robotics. 4. McGraw Hill. Groover. PHI 2. 2. Pearson Education. 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.Text Book 1. Gonzales and Lee. and applications”. Pearson Education References: 1. McGraw Hill 5.Technology. Fu. George F. Robert Schilling. Elaine Rich and Kevin Knight. TMH 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. programming. Laboratory work (Experiments and Journal) 15 Marks 2. . “Robotics and AI”. 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. Andrew Staugaard. 2) Use of Control-X simulation Control of Conveyor manually and thru Programming. “Fundamentals of Robotics. Craig. “Robotics”. “Artificial Intelligence”. Distribution of marks for term work shall be as follows: 1. Weiss. 3. Pearson Education. Term Work: Term work shall consist of at least 05 experiments and 03 assignments covering all topics and one written test. “Artificial Intelligence: Structures and Strategies for Complex Problem Solving”. “Introduction to Robotics”.Analysis and Control”. J. J. Luger.

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

Wireless transport layer security. "Wireless and Mobile Network Architectures'. Nicklous. Pahlavan. Springer 1. Jochen Schiller. John Wiley K. WAP Developer Toolkits and application environment. Support for Mobility: Mobile Computing Architecture: Three Tier Architecture for mobile computing. Portals. Application Server. Mobile Agents Synchronization : Synchronization Software for Mobile Devices . "Principles of Wireless Networks" Introduction to Wireless Telecommunication System and Networks by Mullett (Cengage Learning) 6. 2. Martin S. Mobile Computing through Internet. WML script. Lothar Merk. Voice XML. Krishnamurthy. Language Support: Hypertext markup language (XHTML)-MP.Mobile Application Languages-XML. . Thomas Stober. J2ME and JavaCard. Wireless telephony application. Gateways. "Wireless Networks'. User Agent Profile . Security. Threats and Security Issues in Mobile Computing: 09 Books Text Books: 1. Java. Wireless markup language. Caching Model . References : Rappaort. SyncML-Synchronization Language for Mobile Computing. Mobile Computing by RajKamal (Oxford). Pearson Education 2. John Wiley P. Examples. WAP UAProf and Caching . Uwe Hansmann. Sync4J (Funambol) Synchronized Multimedia Markup Language (SMIL). 3. EPOC. Design considerations. 5. "Mobile communications". Wireless session protocol. Device Management Wireless devices and their Operating System : PalmOS. Mobile File System. P. Wireless and Mobile Network Architecture : Yi Bang Lin and Imrich Chlamtech (Wiley). "Wireless Communications Principals and Practices' YI Bing Lin. Mobile agents. Wireless transaction protocol. Wireless application protocol: Architecture. m-commerce. World Wide Web: Hypertext transfer protocol. “ Principles of Mobile Computing.8. File systems: Consistency. 3. Nicopolitidis. Wireless Bearers for WAP . Windows CE. 4. Addison wisely. Service Discovery. Wireless datagram protocol. Symbian OS. Mobile databases. Linux for Mobile Devices. Synchronization Protocols.

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 The final certification and acceptance of TW ensures the satisfactory Performance of laboratory Work and Minimum Passing in the term work. J2ME Program for Mobile Node Discovery 8. Design and Program Income Tax and Loan EMI Calculator for Mobile Phones. Study of Bluetooth Protocol and Applications 4. Mobile Internet and WML 7. Branch : Computer Semester : VII Engineering Subject :: SYSTEM SECURITY (Abbreviated as SS) 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 . 10.Term work Term work should consist of least 10 practical experiments and two assignments covering the topic of the syllabus.E . Implementation of Mobile Network using Network Simulator (NS2) 6. Setup & Configuration of Wireless Access Point (AP) 2. GSM modem study (Nokia 30) and SMS client-server application 5. Study of WLAN : Ad Hoc & Infrastructure Mode 3. Mobile protocol study using omnet++ 9. Orals Oral examination is to be conducted based on the above syllabus University of Mumbai Class: B. Suggested Laboratory Exercises of Mobile Computing: 1.

Biometric. use of public key crypto.. Covert channel. Incomplete Mediation. iv. Software reverse engineering. Forouzan. Classic Cryptography ii. Public Key Cryptography: Kanpsack. Network security basics ii. Session Hijacking. Buffer Overflow. and Honey pots Text Books Hours 03 10 Chapter 3 08 10 Chapter 4 Chapter 5 15 1) Cryptography and Network Security by Behrouz A. Salami attack. Trusting Software iii. Linearization Attacks. Digital Rights management. iv. Kerberos. Software Flaws. Confidentiality and Non-repudiation. Packet sniffing. Crypto Basic. Intrusion Detection System. Denial of Service viii. ii. TCP/IP Model and Port No. Authentication Protocol. MD5. SHA-1. CAPTCHA Software security: i. AES iii. Symmetric Key Cryptography: Stream Ciphers. Public Key Infrastructure. Use of Hash Function Access control . Pfleeger . Block Ciphers. Multilateral security. Firewall. iv. Enterprise wide network Design and Vulnerabilities. Pearson Education .Signature and Non-repudiation. ARP Spoofing vi. Authentication Methods. Web site and web server vulnerabilities vii. Feistel Cipher.Module Chapter 1 Chapter 2 Content Introduction to Information Security: Security Goals Cryptography: i. Single –sign on. Operating System and Security Network Security: i. RC4. Triple DES. Passwords. Reconnaissance of network v. Protocol flaws iii. 2) Security in Computing by Charles P. Tiger Hash. ACLs. DES. Hash Function: The Birthday Problem. Defiie-Hellman. RSA.Authentication and Authorization: i. TATA McGraw hill. Multiple level security model. SSL and IPSec protocol ix. Malware. A5/1. Race conditions ii. Access control Matrix.

The students are expected to understand the importance of simulation in IT sector. Wiley Network security bible 2nd edition. Pre-requisites: Probability and Statistics . A term Work test of 10 marks must be conducted. Wiley publication Cryptography and Network Security.1) 2) 3) 4) 5) Reference Books Information security Principles and Practice by Mark Stamp. 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. ii. Branch: Computer Semester: VII Engineering Subject: COMPUTER SIMULATION AND MODELING(Abbreviated CSM) Periods per Week Lecture 04 (each 60 min) Practical 02 Tutorial -Hours Marks Evaluation System Theory 03 100 Oral -25 Term Work -25 Total 03 150 Objectives of the course: The objective of this course is to teach students methods for modeling of systems using discrete event simulation. Prentice hall Principles of Information Security.E. Michael E. University of Mumbai Class: B. implement the model in software and perform simulation analysis of the system. Eric Cole TERM WORK i. William Stalling. cengage learning Information Systems Security.. Term work should consist of at least 8 practical experiments and two assignments covering the topics of the syllabus. and service industries etc. Emphasis of the course will be on modeling and on the use of simulation software. ORAL Oral / Practical Examination must be based upon the syllabus of 25 marks. telecommunication. manufacturing. By the end of the course students will be able to formulate simulation model for a given problem. Nina Godbole.

Case Studies: Simulation of manufacturing systems. advantages and disadvantage. 7. verification of simulation models. model components. lead time demand. . steps to build a useful model of input data. useful statistical model. selection input model without data. a discrete event system simulation. 3. different techniques to generate random variate:. discrete distribution. an evaluation and selection technique for simulation software. queueing notations. application areas. 5. components of system. Simulation of super market.inverse transform technique. simulation world views or formalisms. Cobweb model. validating input-output transformation. generation of true and pseudo random numbers. multi channel queue. calibration and validation of models:. input output validation using historical data and Turing test. continuous distribution. Manual Simulation of Systems: Simulation of Queuing Systems such as single channel and multi channel queue. inventory system. face validity. multivariate and time series input models. parameter estimation. Steady state behavior of Markovian models (M/G/1. data collection. type of systems. 10. Introduction to Simulation and Modeling: Simulation – introduction. general – purpose simulation packages. Network of Queues. validation of model. Verification and Validation of Simulation Model: Introduction. reliability problem. output analysis of terminating simulators. poker). Random Number Generation: Properties of random numbers. Output Analysis: Types of simulations with respect to output analysis. 9. appropriate and not appropriate. Discrete Event Formalisms: Concepts of discrete event simulation. job-shop model. goodness of fit tests. 11. hypothesis testing. model of a system. power of test. identifying the distribution with data. M/M/c) overview of finite capacity and finite calling population models. history of simulation software. t-test. 6. stochastic nature of output data. simulation of single channel queue. Input Modeling: Introduction. measure of performance and their estimation. techniques for generating random numbers. M/M/1. 4. 8.1. suggested estimators. direct transformation technique. 2. Simulation of computer systems. covariance and correlation. autocorrelation. empirical distribution and Poisson process. long run measures of performance of queueing systems. and any service sectors. Queueing Models: Characteristics of queueing systems. types of models and steps in simulation study. Statistical Models in Simulation: Overview of probability and statistics. output analysis for steady state simulation. Random Variate Generation: Introduction. inventory system and dump truck problem using event scheduling approach. timeshared computer model. model building.validation process. various tests for uniformity (Kolmogorov-Smirnov and chi-Square) and independence (runs. gap. convolution method and acceptance rejection techniques. Simulation of Material Handling system. System and system environment.

Queueing. 3rd edition. 1960. Narsing Deo. 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. Telecommunication System 9. L. Multi serve system like Able – Baker 3.. Levin & Ruben. 8. simulation language like GPSS and/or any simulation packages. Uniformity Testing 10.. “Probability and Statistics with Reliability. Donald W.. Academic Press Harcourt India. 4. W. Independence Testing . and Computer Science Applications”. Body. Carson J. “System Analysis and Modeling”. “Introduction to Probability and Random Variables”. 3. 2nd edition. M. McGraw-Hill. PHI. Reference Books: 1. P. 10. Aczel & Sounderpandian. McGraw-Hill. “Statistics for Management”. Cafeteria 8. “Discrete Event System Simulation”. Dump Truck Problem 5.Inventory System 4. S. “System Simulation with Digital Computer”. J.. Single Server System 2. PHI.. Case studies from the reference book can be used for experiment.. Job-Shop Model 6. “System Modeling and Simulation” 5. N) . Bernard. S. Manufacturing System 7. Suggested Experiment list The experiments should be implemented using Excel. Pearson Education. Frank L.. “Business Statistics”. G. Severance. Wadsworth G. and Nicol D.. and Kelton. Trivedi K. 6. D. “Simulation Modeling and Analysis”. M. PHI. “System Simulation”. 2001. Law A.Text Book: Banks J. 2. Gordon Geoffrey. 3rd edition. 2000. Nelson B. 1. and Bryan. 1978. (M. Term Work: Term work shall consist of at least 10 experiments covering all topics and one written test.. “Theory Of Modeling and Simulation” 9. 7. 1982.

E. and Ajax enabled) Access control mechanism (session management) Creating Web Site to integrate at least five REST web Services (Web Mashups) Server side using Web Services . RPC and RMI. e-business Integration. 3. Home page design Form validation (Ajax enabled) Catalog design and Search techniques (Web mining . EAI and web Services. Enterprise Application Integration. Google Apps engine TEXT BOOKS: 1.Commerce Strategies. 5. Virtualization Techniques. Laboratory work (Experiments and Journal) 2. 2. Technology and applications (David) Tata McGrawHill Introduction to E-commerce (jeffrey) Tata. 9. Test (at least one) 15 Marks 10 Marks The final certification and acceptance of TW ensures the satisfactory performance of laboratory Work and Minimum Passing in the term work. E-commerce Infrastructure Cluster of Servers. Introduction to Hadoop. 4.Mcgrawhill E-Business and Commerce.WS-security. Cloud computing. HDFS. Server consolidation using cloud. E-Business Organizational and technical foundation (Michael P) Wiley Publication REFERENCES: 1.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. 4. loosely Coupled e-Business solutions for integration. 2. 5. Electronics Commerce (Gary Schneider) Thomson Course technology 3.8. Integration of Application: Approaches to Middleware. Service Oriented Architecture. 6. 3. Marks 1. Suggested List of Experiments Exp 1: All experiments should be part of final e-commerce portal development 1. E-Commerce Fundamentals and application (Henry Chan) Wiley publication 2.

2 Suggested Skills for Project Manager 1.1 Project Selection 3.3 Virtual Teams 3. Project Management and IT context 2.3 What is project management 1.2 Project Management Knowledge Area 1.3.3.4 Role of a Project Manager 1. Project Integration Management 3. Introduction to Project Management 1.3 Project Management tools and techniques 1.5.1 Organizational Structure 2.4 Characteristics of IT project Team members 2.5.4.1 Stakeholders 1.3 Nature of IT projects 2.1 Globalization 2.1 Project Manager's job description 1.3 Developing Project Management Plan .2 Outsourcing 2.5 Trends affecting IT Project Management 2.4.3.2 Project Life Cycle and Phases 2.3 Importance of people and leadership skills 2.4.2 The triple constraint 1.Exp 2: Creating Hadoop clusters on Ubuntu Project Management (Elective-II) CLASS B. ( 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.E.1 Developing Project Charter 3. To understand the Life cycle and phases of project management. Contents of the Course 1.1 What is project 1. To understand knowledge areas and tools-techniques for efficient project management focusing IT projects.5.

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

Laboratory work (Experiments and Journal) 2. Test (at least one) 15 Marks 10 Marks 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 Term Work Term work shall consist of at least 6 assignments/1 project which will contain detailed documentation of each of the project management phases and one written test. .Class : B. Marks 1.E .

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. 10 4. 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.Adaline – Backpropagation Mutilayer Perceptrons – Radial Basis Function Networks – Unsupervised Learning Neural Networks – Competitive Learning Networks – Kohonen SelfOrganizing Networks – Learning Vector Quantization – Hebbian Learning. 08 3. No 1. DETAILED SYLLABUS Topics 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. 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 . 09 . Objectives : • To introduce the ideas of fuzzy sets. 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.Sr.

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

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

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