Syllabus

Subject Code  :CS6T1/ IS6T1                              Duration of Exam 3 Hrs
Subject Title Database Management Systems     Max. Exam. Marks 100
Total contact Hrs 48                                                       Max. l.A. Marks: 25

Contents

1. INTRODUCTION.                            6 Hrs.

Database and Database Users: Introduction to Database Management System, Examples, Characteristics of the database approach, Actors on the scene, Workers behind the Scene, Advantages of using a Database Management Systems, Implications of the Database Approach, When Not to Use a Database Management Systems. Database System Concepts and Architecture: Data Models, Schemas,and Instances, DBMS Architecture and Data Independence, Database Languages and Interfaces, The Database System Environment, Classification of Database Management Systems.

2.ER MODELS, RELATIONAL MODEL, AND RELATIONAL ALGEBRA      12 Hrs.
Database Modeling Using the Entite-Relationship Model: Using High-Level Conceptual Data Model for Database Design, An Example Database Application, Entity types, Entity Sets, Attributes, and Keys, Relationships, Relationship Types, Roles, and Structural Constrains, Weak Entity Types, Refining the ER Design for the COMPANY Database, ER Diagram, Naming Conventions, and Design Issues. The Relational Data Model, Relational Constraints, and the Relational Algebra: Relational Model Concepts, Relational Constraints and Relational Database Schemas, Update Operations and Dealing with Constraint Violations, Basic Relational Algebra Operations, Additional Relational Operations. Examples of Queries in Relational Algebra, Relational Database Design testing ER-to Relational Mapping.

3. DATABASE DESIGN.                   12 Hrs.
Functional Dependencies and Normalization for Relational Databases: Informal Design Guidelines for Schemas, Functional Dependencies, Normal Forms Based on Primary Keys, General Definitions of Second and Third Normal Forms, Boyce-Codd Normal Form. Relational Database Design Algorithms and Further Dependencies: Algorithms for Relational Database Schema Design, Multivalued Dependencies and Fourth Normal Form, Join Dependencies and Fifth Normal Form,Inclusion Dependencies, Other Dependencies and Normal Forms.

4. SQL - THE RELATIONAL DATABASE STANDARD 6 Hrs.
Data Definition, Constants, and Schema Changes in SQL, Basic Queries in SQl.Comp SQL Queries, Insert, Delete, and Update Statements in SQL, Views Virtual Tables) in SQL, Specifying General Constraints as Assertion, Additional Features of SQL.

5. TRANSACTION PROCESSING. 12Hrs
Transaction Processing Concepts . Introduction to Transaction Processing, Transaction and System Concepts, Desirable Properties of Transactions, Schedules and Recoverability, Serializability of Schedules, Transaction Support in SQL. Concurrency Control Techniques: Locking Techniques for Concurrency Control, Concurrency Control Based on Timestamp Ordering, Multiversion Concurrencv Control Techniques, Validation (Optimistic) Concurrency Control Techniques, Granularity of Data items and Multiple Granularity Luck mg, Using Locks for Concurrency Control in Indexes Some other Concurrency Control issues. Database Recovery Techniques: Recovery Concepts,Recovery Techniques Based on Deferred Update, Recovery Techniques Based on Immediate Update, shadow Paging, The ARIES Recovery Algorithm, Recovery in Multidatabase Systems, Database Backup and Recovery from Catastrophic Failures. Database Security and Authorization: Introduction to Database Security Issues, Discretionary Access Control Based on Granting/Revoking of Privileges, Mandatory Access Control for Multilevel Security, Introduction to Statistical Database Security.

Text Book:
Ehniasri and Navathe :Fundamentals of Database Systems ( Third Edition), Addison.Wesley, 1999. (Chapter 1l,2,3,7,8,9,14,15,19,20,21,22)

Reference Books:
1. Raghu Ramakrishnan: Database Management Systems, Second Edition, NicGraw Hill. 2000.
2. Date C.J: Introduction to Database Systems, Sixth Edition, Addison-Wesley , 1995.
3. Patrick 0' Neil & Database - Principles, Programming, Performance, Second Edition, Morgan Kaufman, 2000.


Subject Code CS6T2 /IS6T2                                Duration of Exam 3 Hrs
Subject Title Software Engineering                Max. Exam. Marks 100
Total contact hrs 48                                             Max. I.A. Marks 25

Contents
1. INTRODUCTION, REQUIREMENT ENGINEERING                      12Hrs.
Software products and software process; Process models; Waterfall model, Evolutionary development. Boelim's spiral model and overview of risk management; Process visibility, Professional responsibility. Computer-based systems Engineering Systems and their environment, System Procurement, The System Engineering process, System architecture modelling, Human factors, System reliability Engineering. Requirements Engineering.The Requirements Engineering Process, The software requirements document, Validation of requirements, Evolution of requirements. Requirement Analysis Viewpoint-oriented analysis, Method-based analysis, System contexts, So and Organizational factors. System Models: Data-flow models, Semantic data models, Object models. Data dictionaries. Requirement definition and specification: Requirements Definition. Requirement specification, Non-functional requirements. Software Prototyping: Prototyping in the software process. Prototyping Techniques, User-interface to typing.

2. Software Design                       12 Hrs.
The Design process, Design Strategies, Design quality. Architectural Design: System structuring, Control models, Modular decomposition, Domain-specific. Architectures; Object Oriented Design: Objects, Object classes and inheritance, Object identification, An Object-oriented design example, Concurrent objects. Function-oriented Design.' Data-flow design, Structural decomposition, Detailed design, A Comparison of Design strategies. User Interface Design.' Design Principles, User-System interaction, Information presentation, User guidance, Interface evaluation,

3. RELIABILITY, REUSE, VERIFICATION AND VALIDATION                           12Hrs.
Software Reliability .' Software reliability metrics, Software reliability specification, Statistical Testing. Reliability growth modeling. Programming for Reliability: Fault avoidance, Fault tolerance, Exception Handling, Defensive programming. Software Reuse.' Software Development with reuse, Software Development for reuse, Generator-based reuse, Application System portability. Verification and Validation The testing process, Test planning and Test strategies. Defect Testing: Black-box testing, Structural testing, Interface testing. Static Verification.' Program inspections, Mathematically-based verification, Static analysis tools, Cleanroom Software development.

4. MANAGEMENT ISSUES:                 12Hrs
Project Management: Management activities, Project Planning, Activity organization, Project Scheduling. Managing People: Cognitive fundamentals, Management implications, Project staffting, Group working, Working environments. Software Cost Estimation. Productivity, Estimation Techniques, Algorithmic cost modeling, Project duration and staffing. Quality Management. Process Quality assurance, Quality reviews, Software standards, Documentation standards, Software Metrics, Product Quality Metrics. Process Improvement: Process and product quality, Process analysis and modeling, Process measurement, The SEI capability Maturity model, Process classification. Computer Aided Software Engineering: CASE classification, Integrated CASE, The CASE life cycle.


Text Books:
1. Ian Sommerville: Software Engineering (Fifth Edition), Addison-Wesley, 1996.(Chapters I to 8,12 to 15,17 to 20,22 to 25,28 to 31).

Reference Books:
1. Roger S. Pressman: Software Engineering - A Practitioner's Approach (Fourth Edition), McGraw Hill, 1997.
2. Carlo Ghezzl et al : Fundamentals of Software Engineering, Prentice-Hall India, 1991. 3. Pankaj Jalote: An Integrated Approach to Software Engineering (Second Edition), Narosa Publishing House, 1997.
4. F. P. Brooks: The Mythical Man Month (Second Edition), Addison-Wesley, 1995.


Subject Code  CS6T3 /IS6T3                          Duration of Exam 3 Hrs
Subject Title Data Communications               Max. Exam. Marks :100
Total contact hrs 48                                     Max. I.A. Marks 25

Contents:
1. INTRODUCTION               6 Hours
Communication Networks and Services; Approaches to Network Design - Network Functions and Network Topology, Message, Packet, and Circuit Switching, Telegraph Networks and Message Switching, Telephone Networks and Circuit Switching, The Internet and Packet Switching; Key Factors in Communication Network Evolution; Layered Architecture and Applications - Examples of Layering, OSI Reference Model, TCP/IP Model, Telnet, FTP, and IP utilities.

2. DIGITAL TRANSMISSION AND TRANSMISSION SYSTEMS              15 Hours
Digital Representation of Information; Properties of Digital Transmission; Characterization of Communication Channels - Frequency Domain and Time domain; Fundamental Limits in Digital Communication - The Nyquist signaling Rate, The Shannon Channel Capacity; Line coding; Modems and Digital Modulation; Properties of Media and Digital Transmission Systems - Twisted Pair, Coaxial Cable, Optical Fiber, Radio Transmission, Infrared Light; Error Detection and Correction - Error Detection, Two-dimensional Parity checks, Internet Checksum, Polynomial Codes, Standardized Polynomial Codes, Error-Detecting capability of a Polynomial Code; Multiplexing - Frequency- Division, Time-Division; SONET; Wavelength-Division Multiplexing; Circuit Switches; Telephone Network; Signaling; Traffic and Overload Control in Telephone Networks- Concentration, Overloaded controls; Cellular Telephone Networks; Satellite Cellular Networks.

3. PEER-TO-PEER PROTOCOLS                               9 Hours
Peer-to-Peer protocols and Service Models; ARQ Protocols - Stop and Wait, Go-back-N, Selective Repeat, Transmission Efficiency of ARQ protocols; Other Adaptation function - Sliding Window Flow control, Timing Recovery in Syncltronous Services, Reliable stream service; Data Link Control HDLC, PPP; Statistical Multiplexing.


4. LOCAL AREA NETWORKS AND MEDIUM ACCESS CONTROL PROTOCOLS    12 Hours Multiple access communications; Local Area Networks - LAN structure, MAC sublayer, Logical link control Layer; Random access protocols - ALOHA, Slotted ALOHA, CSMA, CSMA/CD; Scheduling Approaches to Medium Access Control - Reservation systems, Polling, Token- Passing Rings, Comparison of Scheduling approaches to Medium Access Control, Comparison of Random access and Scheduling Medium Access Controls; Channelization - FDMA, TDMA, CDMA; LAN Standards - Ethernet and IEEE 802,3 LAN standard, Token Ring and IEEE 802.5 LAN standard, FDDI, Wireless LAN. and IEEE 802.11 standard; LAN Bridges - Transparent Bridges, Source Routing Bridges, Mixed-Media Bridges.

5. PACKET-SWITCHING NETWORKS           6 Hours
Network services and Internal Network Operation; Packet Network Topology; Datagrams and Virtual circuits; Structure of Switch Router; Connectionless Packet Switching; Virtual-Circuit Packet Switching; Overview of Routing and Congestion in Packet Networks - Routing algorithm classification, Routing tables, Shortest path routing algorithms, Flooding, Hierarchical mounting, Distance vector routing, Link state routing, Congestion control algorithms.

Text book:
1. Alberto Leon-Garcia & Indra Widjaja, Communication Networks Fundamental Concepts and Key Architectures, McGraw-Hill, 2000. (Chapters 1, 2, 3, 4, 5, 6, 7; Except 2.4, 3.8.7, 3.8.8, 5.5.2, 6.5.4, 6.5.5, 7.6, 7.7)

Reference books:
1. William Stallings, Data and Computer Communications, Fifth Edition, Prentice Hall India, 1999.
2. Andrew S Tanenbaum, Computer Networks, Third Edition, Prentice Hall India, 1998.
3. Keshav, An Engineering Approach to Computer Networks, Addison-Wesley, 1997.
4. Behrouz Forouzan, Introduction to Data Communications and Networking, TMH, 1999.
5. Larry L Peterson & Bruce S Davis: Computer Networks, Second Edition, Morgan Kaufman, 2000.

Subject Code CS6L5 / IS6L5                                 Duration of Exam 3Hrs
Subject Title Database Applications Lab           Max. Exam. Marks :100
Max. I.A. Marks 25

Contents:
A mini-project implemented in an RDBMS environment like INGRES, ORACLE, SYBASE etc. chosen by the institution (Excluding dBase-like systems).
The mini-project may be carried out individually or by a batch of not more than two students. The students will pick a topic in consultation with a local faculty. The faculty is expected to guide the students. The mini-project must be carried out in the college only.

The mini-project tasks would involve:
Understanding the mini-world description and the application specification of the mini-project ·
Bringing out the Conceptual design ( Entity-relationship representation) of the mini-project ·
Converting the Conceptual design to the Relational design ·
Normalization of the Relational design upto 3NF (desirable 5NF)
Documentation and Submission of Report

Each student in a team should equally participate in the tasks mentioned above.

Typical mini-projects:
Room reservation - front office need of a luxury hotel ·
Railway reservation for lndian Railways ·
Airline reservation for lndian Airlines·
Sales management of consumer products company ·
Library management ·
A city tourist assistance service.
Bus reservation for a state trausport corporation ·
Front offfice management for a large Bank.
Patient and services management for a large hospital ·
Admissions management for large University ·
Managing of Placement center ·
Sports databases ·
Examination system management ·
Online enquiry service for products and services in a city like Yellow pages


Subject Code CS6L6                                     Subject Title Computer Graphics Lab
Duration of exam:3hrs                                   Max Exam Marks:100
Max I.A.Marks:25


Contents
a)Implementation of graphics algorithms such as the following using C,C++ Generation of Lines, Circles & Figures, Clipping, Transformations etc.

b) Development of a graphic package.



Subject Code:CS6D1/IS6D1                           Duration of Exam:3hrs
Subject Title:Digital Signal Processing            Max Exam Marks:100
Total contact hrs:48                                      Max I.A.Marks:25

Contents
1. Review of Basic Concepts               12Hrs .
Signals and Signal Processing: Characterization and Classification of Signals, Typical Signal Processing Operations, Examples of Typical Signals, Typical Signal Processing Application.Why Digital Signal Processing?. Transformations Domain Representations of L T I Systems: The Frequency Response ,The Transfer Function, Types of Transfer Functions, Allpass Transfer Function, Minimum-Phase and Maximum Phase Transfer Functions, Complementary transfer Functions, Digital Two-Pairs, .Stability Test, Discrete- time Processing of Random Signals.


2. Digital Filters                           12hrs
Structures: Block Diagram Representation, Signal Flow Graph Representation, Equivalent Structures,Basic FIR Digital Filter Structures, Basic Hk Filter Structures, State-Space Structures, Alpass Fiters, Tunable hR Digital Filters, Cascaded Lattice Realization of hR and FIR Filters, Parallel Allpass Realization of hR Transfer Functions, Digital Sine-Cosine Generator, Computation Compexity of Digital Filter Structures. Design: Preliminary Consideration, Impulse Invariance Method of HR Filter Design, Bilinear Transform Method of hR Filter Design, Design of Digital hR Notch Filters, Lowpass HR Digital Filter Design Examples Spectral Transformations of HR Filters ,FIR Filters Design Based on Truncated Fourier Series, FIR Filters Design Based frequency Sampling Approach,Computer Aided Design of Digital Filters.

3. Digital Signal Processors                   12hrs
Overview of Motorola DSP563XX Family of Digital Signal Processors, Architectures of D5P56307: Assembly Language Instructions and Programming; Typical Software Applications.

4. Implementation, Applications             12Hrs
Implementation Considerations: Basic Issues, Software Implementation, Computation of the Discrete Fourier Transform, The Quantization Process and Errors, Analysis of Coefficient Quantization effects Analysis of Coefficient Quantization Effects in FIR Filters. Representative Applications: Dual -Tone Multifrequency Signal Detection, Spectral Analysis Using DFT, Short-term Discrete Fourier Transform, Musical Sound Processing, Digital FM Stereo Generation, Discrete-Time Analytic Signal Generation, Voice Privacy System, Subband Codination of Speech and Audio Signals.


Text Books:
1. Sanjit K. Mitra: Digital Signal Processing- A Computer -Based Approach, Tata MeCraw-Hill, 199S. (Chapters 1,4,6,7,8.1 to 8.3,9.1 to 9.10,11,1 to 11.8)
2. Motorola: DSP56300 Family Manual, 1999.

Reference Books:
1. Alan V. Oppenhein, and Ronald W. Schafer : Discrete-Time Signal Proeessing(Second Prentice-Hall, 1998.
2. John G. Proakis & Dimitris G. Manolakis: DJP Principles, Algorithm., and Applications Prentice -Hall, 1996.
3. Richard G. Lyons:understanding Digital Signal Processing ,Addison-Wesley,1997


Subject Code CS6D2 /IS6D2                               Subject Title VLSI Design
Total contact hrs 48                                           Duration of Exam:3hrs
Max. Exam. Marks :100                                       Max. I.A. Marks 25

Contents:
1. Introduction:                               12Hrs
Digital Systems and VLSI: Why Design Integrated Circuits, Integrated Circuit Manufacturing, CMOS Technology, Integrated Circuit Design Techniques, Transistors and Layout: Fabrication Processes, Transistors, Wires. and Vias, Design Rules, Layout Design and Tools.

2. LogicGates, Combination Logic Networks 12Hrs
Introduction, Combinational Logic Functions, Static Complementary Gates, Wires and Delay, Switch Logic, Layout Design Methods, Simulation, Combinational Network Delay, Crosstalk, Power Optimization, Switch Logic Networks, Combinational Logic Testing.

3. Sequential Machines, Subsystem Design, Floor Planning: 12Hrs
Sequential Machines: Introduction, Latches and flip-flops, Sequential Systems and Clocking Disciplines, Sequential System Design, Power Optimization, Design Validation, Sequential Testing, Subsystem Design: Introduction, Subsystem Design Principles, Combinational Shifters Adders, High- Density Memory, Field-Programmable Gate Arrays, Programmable Logic Arr vs, Floorplanning: Introduction, Floorplanning Methods.

4. Architecture Design, Chip Design, CAD, Design Modeling 12Hrs
Architecture Design: Introduction, Register-Transfer Design, High-Level Synthesis, Architectures for Low Power, Architecture Testing. Chip Design: Introduction, Design Methodologies, Kitchen Timer Chip. CAD Systems and Algorithms: Introduction, CAD Systems, Simulation, Layout Synthesis, Layout Analysis, Timing Analysis and Optimization, Logic Synthesis, Test Generation. Design Modeling: Introduction, Hardware Modeling in VHDL.

Text Books
1. Wayne Wolf: Modern VLSI Design, Second Edition, Addison-Wesley, 1998. (Chapter 1,2,3.1 to 4,5,6.1 to6.4,6.7 to 6.9,7.1,7.2,8,9.1 to 9.3,10.1 to 10.8, Appendix C.1, C.2)

Reference Books:
1. Weste, N.H.E and K. Eshraghian: Principles of CMOS VLSI Design- A System Perspective(Sec Edition) Addison-Wesley 1993.
2. Michael John Sebastian Smith: Application-Specific Integrated Circuits, Addison-Wesley, 1997.


Subject Code : CS6E1 /IS6E1                          Duration of Exam :3 Hrs
Subject Title Unix System programming          Max. Exam. Marks :100
Total contact hrs 48                                        Max. I.A. Marks 25

Contents:

1. Introduction            12hrs
UNIX and ANSI Standards: The ANSI C Standard, The ANSI/ISO C++ Standard, Differences between ANSI C and C++, The POSIX Standards, The POSIX. 1 FIPS Standard, The X/Open Standards.
UNIX and POSIXAPIs: The POSIX APIs, The UNIX and P0SIX Development Environment, APICommon Characteristics.UNIXFiles: File Types, The UNIX and POSIX File System, The UNIX and POSIX File Attributes, modes in UNIX System V, Application Program Interface to Files, UNIX Kernel Support for Files, Relationship of C Stream Pointers and File Descriptors, Directory Files, Hard and Symbolic Links.
UNIX File APIs: General File APIs, File and Record Locking, Directory File APIs, Device File APIs, FIFO File APIs, Symbolic Link File APIs, General File Class, Regfile Class for Regular Files, dirfile class for Directory Files, FIFO File Class, Device File Class, Symbolic Link File Class, File Listing Program.



2. UNIX Processes                         12hrs
Environment of a UNIX Process: Introduction, main Function, Process Termination, Command -Line Arguments, Environment List, Memory Layout of a C Program, Shared Libraries, Memory Allocation, Environment Variables', setjmp and longjmp Functions, getrlimit and setrlimit Functions. Process control: Introduction, Process Identifiers, fork, vfork, exit, wait, waitpid, wait3, wait4 Functions, Race Conditions, exec Functions, Changing User IDs and Group IDs, Interpreter Files, system Function, Process Accounting, User Identification, Process Timers.
Process Relationships: Introduction, Terminal Login; Network Logins, Process Groups, Sessions, Controlling Terminal, tcgetpgrp and tcsetpgrp Functions, Job Control, Shell Execution of Programs, Orphaned Process Groups. A MiniShellExample in C++

3. Signals, Daemon Processes                 12hrs
Signals: Introduction, Signal concepts, signal Function, Unreliable Signals, Interrupted System Calls, Reentrant Functions, SIGCLD Scmantics, Reliablc Signal Terminology and Semantics, kill and raise Functions, alarm and pa Functions, Signal Sets, sigprocmask, sigpending, sigaction, sigsetjmp, siglongjmp, sigsuspend, abort, system, sleep Functions, Job Control Signals, Additional Features, Interval Timers, POSIX. lb Timers, timer Class. Program examples in C and C++. Daernon Processes: Introduction, Daemon Characteristics, Coding Rules, Error Logging, Client-Server model, Programming Examples.

4. Interprocess Communication                12hrs
Overview of IPC methods, Pipes, popen and pclose Functions, Coprocesses, FIFOs, System V IPC, Message Queues Semaphores, Shared memory, Client-Server Properties, Stream Pipes, Passing File Descriptors, An Open Server (Version I), Client-Server Conncction Functions, An Open Server (Version 2), POSIX. lb Messages, POSIX. lb Semaphores, Memory Mapped I/O, P0SIX. lb Shared Memory, Programming Examples in C and C++.

Text Books:
1. Terrence Chan : UNIX System Programming Using C++, Prentice Hall India, 1999. (Chapters 1,5,6,7,8,9,10).
2. W. Richard Stevens: Advanced Programming in the UNIX Environment, Addison-Wesley, 1993. (Chapters 7.8.9.l0.13.I4.l5).

Reference Book:
1. Keith Haviland et al : UNIX System Programming, Addison-Wesley, 1998.
2. Kernighan B. W and Pike R:The UNIX Programming Environment, Prentice-Hall India, 1984.


Subject Code CS6E2/ IS6E2                              Duration of Exam 3 Hrs
Subject Title Multi-Media Computing                     Max. Exam. Marks 100
Total contact hrs 48                                         Max. I.A. Marks 25

Contents:
1. Introduction, medium, main properties of a multimedia system, traditional data streams, characteristics, sound, music and speech. 12 hours
2. Image and graphics,Basic concepts, computer image processing. 6 hours
3. Video and Animation, Basic concepts, Television, computer based animation. Data compression, JPEG, MPEG. 12 hours
4. Optical storage media, computer technology, multimedia operating systems. 6 hours 5. Networking, multimedia communication systems, multimedia server. 12hours


Text Book:
1. Ralf Steinmetz and Klara Nahrstedt, Multimedia: Computing, communications and Applications, Prentice-Hall PTR, 1995. (Chapters 1.1 to 1.4,2.1 to 2.6,3.1 to 3.3,4.1 to 4.3,5.1 to 5.3,6.1 to 6.5,6.7,7.1 to 7.10,8.1 to 8.3 9.1 to 9.8, 10.1 to 10.6,11.1 to 11.4)


Reference Book:
1. Guojun Lu : Communication and computing for distributed Multimedia systems. Artech House Inc, 1996. (Chapters 8.1 to 8.9)

Subject Code : CS6F1 /IS6F1                                   Duration of Exam : 3 Hrs
Subject Title : System Simulation Concepts              Max. Exam. Marks :100
Total contact hrs : 48                                              Max. I.A. Marks : 25

Contents:
1. INTRODUCTION:                         9 Hours
Definition of System and Simulation, merits and demerits of simulation, areas of application, types of systems, various types of models to represent them, associated terminology, stages of a typical simulation study, Simulation examples, concept of a system clock, event scheduling Vs time advance algorithm.

2. RANDOM NUMBERS:                    3 Hours
Role of random numbers in simulation, pseudo random number generation techniques, their properties, methods of testing PRN sequences.

3. RANDOM VARIETIES:    6 Hours
Generation, inverse transformation technique (with exponential distribution and empirical continuous distribution as examples), Direct transformation (with normal distribution as example, and acceptance -rejection technique (with poisson distribution)

4. SIMULATION LANGUAGES:                          12 Hours
Need for special purpose simulation languages, detailed study of GPSS, Introduction to object oriented simulation.

5. INPUT MODELING:           6 Hours
Data collection, same normally encountered distribution (Normal, poisson and exponential distributions may be studied), estimation of their parameters, Goodness of fit tests - Chi square test. Input models without data, effect of covariance and correlation of the quality of data.

6. VERIFICATION AND VALIDATION OF MODELS:         6 Hours
Input Guidelines for verification ot models their calibration & validation, face validity, validation of model assumptions, validating input-output transforms, use of historical data.

7. EVALUATION OF SIMULATION EXPERIMENTS:          6 Hours
Length of simulation runs, static and dynamic stochastic simulations elimination of transients, Auto correlated observations variance reduction techniques.

Text Books:
1. Jerry Banks, John S Carson & Barry L.Nelson, Discrete Event System Simulation, 2nd edition., PHI India, 1998, (Chapters 1, 2.1,2.2,3.1,4.6,4.7,8,9 (9.l.1,9.1.2,9.l.4,9.2,9.4.l),l0, 11, 12
2. Geoffrey Gordon." System Simulation", 2nd edition, PHI 1998, ( Chapters 3,9,10)

Reference Books:
1.James A Payne, Introduction to Simulation: Programming Techniques & methods of analysis", McGraw Hill, 1988.
2. N.Deo. "System Simulation with digital computer". PHI 1979.

Subject Code CS6F2/IS6F2                           Subject Title Neural Networks
Total contact hrs 48                                      Duratration  of Exam :3hrs
Max. Exam. Marks:100                                       Max. IA. Marks :25

Contents:
1. Neural computing:
Definition, overview and applications, ANN : mapping view point, structure view point and learning approaches 6 hours

2. Mathematical foundation
Vector and Matrix fundamentals, geometry for state space visualization, optimization, graphs and digraphs. 6 hours

3. Elementary ANN building blocks.
Biological neural networks, Artificial neural networks, Activation functions, model extensions, linear separability, Batch and iterative processing, multilayer perceptrons, gradient descent learning. 8 hours

4. Feed Forward Networks
Structure, Delta rule, generalized Delta Rule, architecture, training extensions, weight space, error surfaces and search, Generalization, non-Euclidean norms, cascade correlation architecture. ----8hours

5. Recurrent Neural Networks
Introduction, Basic parameters and recurrent network design, weight storage prescription and network capacity, Network synthesis procedures, energy function characteristics, Bi-directional associative memory. Boltzman machines. 8 hours

6. Competitive and Self Organizing Networks. Introduction, general clustering procedures, competitive learning architectures and algorithms self organizing feature maps. 6 hours

7 Adaptive Resonance Theory Stability, plasticity dilemma, Radial Basis function neural works, Time delay neural networks. 6 hours

Text Books:
1. Robert J Schalkoff, Artificial Neural Networks, McGraw Hill international edition, 1997. (Chapters 1.1 to 1.7,2.1 to 2.4,3.1 to 3.5,42 to 4.6,6.1 to 6.4,7.1 to 7.4,7.9,8.1 to 8.5,8.7,9.1 to 9.4)
2. B.Yegnanarayana, Artificial neural networks, PHI 1999. (Chapters: 7.3, 7.4)