Syllabus

Subject Code :CS8J1 /IS8J1                 Subject Title Advanced Algorithms
Total contact hrs 48                             Duration of Exams:3hrs
Max. Exam. Marks 100                           Max. 1.A. Marks 25

Contents:
1. ANALYSIS TECIINIQUES: 6 Hrs
Growth functions, Recurrences and solution of recurrence equations; Amortized analysis: Aggregate, Accounting, and Potential methods.

2. STRING MATCHING ALGORITHMS: 6 Hrs.
Naive algorithm; Robin-Karp algorithm; String matching with finite automata, Knuth-morris -Pratt andBoyer-Moore algorithms.

3.NUMBER THEORETIC ALGORITHMS:
Elementary notions, GCD, Modular arithmetic, solving, modular linear equations. the chirese remainder theorem, powers of an element, RSA cryptosy testing, Integer factorization.

4.HUFFMAN CODES,POLYNOMIALS ,FFT          6hrs
huffman codes: Concepts, construction, Proof ot correctness of Hut!man 's algorithm polynomials, DFT and FFT, Efficient implementation of FFT.

5.GRAPH ALGORITHMS: 6 Hrs.
Bellman-Ford Algorithm, Shotest paths in a DAG, Johnson's Algorithm for sparse graphs, Flow tworks and the Ford-Fulkerson algorithm, Maximum bipartite matching.


6.COMPUTATIONAL GEOMETRY-I: 6 Hrs.
geometric data s:ructures using C++: Vectors, Points, Polygons, Edges; Geometric objects in space; iding the intersection of a line and a triangle, Finding star-shaped polygons and convex hulls using 'remental insertion.

7.COMPUTATIONAL GEOMETRY-II: I2Hrs.
Point Enclosure: Ray-shooting and Signed angle methods; Clipping: Cyrus-Beck and Sutherland-'odgman Algorithms; Triangulating monotonic polygons; Convex hulls: Gift wrapping and Graham an; Removing hidden surfaces1 Intersection of convex polygons; convex hulls, contour of the union ~ rectangles, Decomposing polygons into monotone pieces.

TextBooks:
1.Thomas H.Cormen et al: Introduction to Algorithms, Prentice Hall India, 1990.(Chapter 2,4.1 to 3,17.3.18.1. to 18.3, 25.3, 25.4, 26.3 27.1 to 27.3 32, 33, 34)
2.Michael J. Laszlo: Computational Geometry and Computer Graphics in C++. Prentice Hall India, 1996 (chapter 4.1 to 4.6,5.3 to 5.8, 6.2 to 6.5, 7.3, 7.4).

Subject Code CS8J2 / 1S8J2                                 Duration of Exam 3 Hrs
Subject Title: Pattern Recognition                       Max. Exam. Marks :100
Contact hrs 48                                              Max. I.A. Marks 25

Contents:
1.INTRODUCTION
Machine perception, An example, The classification model, The Descriptive approach. Decision theory, The continuous case, Two category classification, Minimum error rate classification, Classifiers, Discriminant ftinctions and Decision surfaces, Discrininant flinctions for the al density, Bayesion Decision theory : the discrete case, Independent Binary features, Compound Decision Theory and.Context. 8 hours

2.PARAMETER ESTIMATION AND SUPERVISED LEARNING: num likelihood estimation, Bayes Classifier, Learning the mean of a Normal density, General 'ian learning, Sufficient Statistics and exponential family, Problems of dimensionality, Estimating the rate.
8 hours

3.NON PARAMETRIC TECHNIQUES: juction, Density estimation, Parzen windows, Nearest neighbor Estimation, Estimation of A riori Probabilities, The nearest neighbor rule, The k-nearest Neighbor rule, Approximations by Series isions, Fishers Linear Discriminant function. Multiple Discriminant Analysis. 8 hours

4.LINEAR DISCRIMINANT FUNCTIONS: juction, linear discriminant functions and decision surfaces, Generalised disc riminant functions, The 'ategory linearly separable case, minimising the perceptron criterion function, Relaxation procedures. ,-eparable behavior, Minimum squared Error procedures. 8 hours

5.UNSUPERVISED LEARNING AND CLUSTERING:
Introduction, Mixture densitites and identifiability. Maximum likelihood estimates,Application to normal, Unsupervised Bayesianlearning ,Data description and clustering .similarity measure ,Criterion functions for clustering, Iterative optimization, Hierarchical Clustering, Graph theoretic methods, The problem of validity, Low dimensional representations and Multidimensional scaling, Ciusterint a!]d Dimensionality reduction. 8 hours
6. NEURAL PATTERtN RECOGNITION:
Introduction to Neural networks, Neurons and Neural nets, Neural Network strucuires for Pattern recognition applications, Physical neural networks. The artiflcial Neural ne~vork model inroductiun to neural pattern associators and matrix approaches: Neural Ne~vork based Pattern associators, matrix approaches and examples. 8 hours

Text Books:
1 Richard. O..Duda and Peter E. Hart; Pattern recognition (Pattern Ciassifleation and Scene Analysis Secoud Edition, 2000. (Chapters l.l to 1.4,2.1 to 2.11,4.1 to 4.', 4. to 4.11,5.1 tO 5.8 10.1 to 10.14)
2. Roberrj. Schalkoff: Pattern Recognition: Statistical ,Structuial and Neural approaches, John Wiley and Sons,Inc .New York(Chapters 10 and 11)

Subject Code CS8J3 / IS8J3                   Subject Title Management in Engineering Total contact hrs 48                                 Duration of Exam:3hrs
Max. Exam. Marks 100                             Max. l.A. Marks 25


1.Nature of Organizations
Introduction, The aim of organizations (corporate objeetives), .The organizations, Strategies for survival . Case study- JP Engineering. 8hrs

2. Personnel Management
Case study and Introduction, Structure of organizations Employing people, Motivation and leadership. Appraisal of employees, Training and development, Job design and payment systemm. (12 hrs)

3. Team working and creativity
Introduction, Team working , Group dynamic.;. Managing the creativc process. 8 hrs

4. Personal management
Introduction, Personal organization, Qbjective setting, Self-appraisal. (8 hrs)

5. Communication skills

Introduction, Communications in the workplace, Information gathering, Written communications, Oral Communications, 'Managing meetings, Case study: Stephen Lever. (8 hrs)

6. Engineering management in practice
The vocation of engineering management .The Cu 100 project at oxford lasers ltd,.The Cu-100 project debrief. 6hrs

Text Book:
1. Management in Engineering- Gail Freeman;Bell James Balkwill. - PHI


Reference Book:
1. Management - A Global Perspective- Koontz, O'Donnell and \V. Heinz -International Saunders Editions

Subject Code CS8K1/IS8K1                  Duration of Exam 3 Hrs
Subject Title Robotics                          Max. Exam. Marks:100
Total contact hrs 48                             Max. I.A. Marks 25


Contents:
I. INTRODUCTION : 3hrs
Background, The Mechanics and control of mechanical manipulators, Notations.

2. SPATIAL DESCRIPTIONS AND TRANSFORMATIONS: 12 hrs
Introduclion; Descriptions: Positions, Olientations and flames, Mappings: changing descriptions from franie to frame, Operators;Transformation, rotations, Transformation,Summary of interpretations, Transformation, arithimetic , Transformation,equations,More on representations: Summary of interpretations. Transformation,of free vectors, Computational consideratious.


3.MANlPULATOR KINEMATICS: 12 Hrs
Introduction, Link description Link Connection Description, Convention of frames to links, Manipulators Kinematics. Inverse Manipulator Kinematics : Introduction, Solvability, Repeatability and accuracy.

4. MANIPULATOR MECHANISM DESlGN: 6Hrs.
Introduction, Basing the design on task requirements, Kinematic Configuration, Position Sensing, i'orce sensing.

5. LINEAR CONTROL OFMANIPULATORS 3 HRS
Introduction, Feed back and Closed loop Control, Second-order linear Systems, control of secoid order Systems

6. ROBOT PROGRAMMING LANGUAGES AND SYSTEMS: 6 Hrs
Introduction, The three levels of robot programming, A sample application, Requirements Prograniniing Language, problem peculiar to robot programming languages. of a Robot

7. OFF-LINE PROGRAMMIG SYSTEMS: 6 Hrs
Introduction, Central issues in OLP systems, CimStation, Automating subtasks in OLP systems,

TextBook:
1.Introduction to Robotics -Mechanics and Control ,Jhno J.Craig Addison Wesley 2nd Edition 1999(chapter 1,2,3.1to 1

Reference Books:
1.K.S.Fu.R.C.Gonzalez,C.S.G.Lee Robotics-Control ,Sesing ,Vision and Intelligence,McGraaw Hill Book Company.
2.Fundamentals of Robotics -Anlysis and control ,Robert J.Schilling (Prentice Hall of India),1996

Subject Code:CS8K2/IS8K2            Duration of Exam:3hrs
Subject Title:Data Warehouses      Max.Marks:100
Max.I.A.Marks :25                          Total contact hrs:48


Content:
1.Introduction                6hrs
what is data warehouse?Delivery Process,Architectures system Process-overview,Typical process flow within a data warehouse,extract and load process ,clean and tranfrom process ,backup and archive process.Quality management process;Proces Architecture -Load manger,Warehouse manger,Query manager,Detailed Infromation ,Summary Infromation,Metadata,Data marting

2.Design-I
Database Schema: Starflake schemas ,Identifying facts and dimensions;Designing fact tables.Dimension tables, and Starflake schema;Query ,multidimensional schemas.Partitioning strategy:Horizontal partitioning .Vertical partitioning .Hardware partitioning ;key for partitionaing sizing the partition.Aggregations:why aggregate and what is an aggregation ? Designing summary tables and deciding on the summaries to create:

3. DESIGN-II                                        6hrs
Data Marting :When is a datamart appropriate?Designing data marts;Costs of data marts.meta data Data transformation and laod; data mangaement ,Query generation, metadata and tools.Process mangaers:Tools system Mangers and Process mangers;local manger;warehouse manager;Query manger.Security:Requirements:performance impact of security impacts on design

4.OPERATIONS:             6hrs
Backup and recovery:Definitions;backup strategies ,testing the strategy.disaster recovery  Service level agreement:Types of system;defining the serve level Agreement.Operating the warehouse .day-to-Day operations;overnight processing .Capacity Planning :the process estimating the load.Tunning :Assessing the performance :Tunning the dtad load;Tunning queries .Testing ;Test plan :Testing backup recovery ,Operational environment ,databse ,and the application;Logistics of the test.

5.BUILDING A WAREHOUSE USING ORACLE-I           12HRS
The Physical data warehouse :VLDB,NLS,parallelism;gathering statics for optimization.Table space segregation,Implementation;Dual Schema approach;Physical Impelmentation check list moving datainto warehouse database objects:SQL loader Import and Export .Dta mart state;engine -based tools ;code generation tools ;transparent gareways .partitioning .partitioning option;traditional partitioning ;striping .indexing the warehouse .what columns to index;single column and composite indexes.

6.IMPLEMENTATION                    12HRS
Backup:backup recovery and restoration .Sercurity :Policy :tool based security:PAsswork security:management of database users .Enterprise manager and security .Getting data to the users Query tools;Using SQL plus Oracle discover:Impromptu.Ralational OLAP and aggregate navigators OLAP,ROLAP and MOLAP.Data Modeling.The three faces of ROLAP.OLAP.Tools Evaluation.Setting up OLAP models.Data mining .What is data mining ?Benefints,Techniques and solution checklist .Data ware house and WWW,intranets.

Text Books:
1. Sam Anahory, Dennis Murray:Data Warehousing, Addison-Wesley, 1997.( Chapters 1 to 10.13 to 19).
2. Corey et al : ORACLE S - Data Warehousing, Tata NIcGra\v Hili, 199S.(Chapters 7,8,9,10,1 1,12,14,15,16,18,19)

Reference Books:
I. Mark Humphries et al: Data Warehousitig, Addison-Wesley. 1999.
2. William H Inmon: Building the Data Warehouse (Second Edition), John Wiley, 1996.
3. Pieler Adriaans and Dolt Zantinge:Data Niming, Addison-Wesley,1996

Subject Code CS8K3 /IS8K3                     Duration of Exam. 3 hrs
Subject Title Web Commerce                    Max  Exam MArks:100
Total contact hrs:48                                 Max.I.A.Marks:25


Contents:
1.INTRODUCTION
Electronic Comerce Environment and opportunties Background .The electronic Commerce environmrnt. Electronic marketplace technologies.Modes of electronic commerce: Overview, Electronic Data Interchange (EDI), Migration to open EDI, e-commercewith Intemet/WWW, CommerceNet Advocacy. Web Commerce Going Fortvard. Approaches ,o to safe e-commerce: Overview, Secure Transport protocol, SecureTransactions secure Electronic Payment Protocol Secure Electronic Transaction, Certificate for Authenticatio Security on Web Servers and Entcrprise Networks.

1.PAYMENTS AND SECURITY 12hrs
Electronic Payment Systems: Types, Digital Token-Based Electronic Payment Systems Smart cards and Electronic Payment Systems, Credit card-Based Electronic Payment Systems. Risk and Electronic Payment Systems, Designing Electronic Payment Systems. Master card/Visa secure elecronic transaction Introduction, Business Requirern tits, Concepts, Payment Processing e-maoil and secure e-mail technologies .Introduction .The means of distribution ,A Model for message Handling.working of e-mail ,MIME,S/MIME and MOSS ,Comparisons of security methods ,MIME and related facilities for EDI over the Internet.

I.APPLICATIONS-I 12hrs
Consumer-Oriented e-commerce:Applications,Mereantile process models ,Mercantile Models from the Consumer's Perspective and from theMerchants Perspective. interorganizational commerce and EDI/EDI.Application ED! in business, legal, Security and Privacy  Issues; EDI and e-Commerce; Standardization and DI., ED! Software Istandardization and. EDI Envepe for Message Transport. ;!alue Added Networks, Internet-Based EDI. intraorganizational e-Commerce: Interna Information systems, Niacroforces and Internal Commerce, Workflow Automation and Coordination, Customization and Internal Commerce, Supply Chain Management.

1. APPLICATIONS-II                   12hrs
 Advertising and Marketing: The New Age of Information-Based Marketing, Advertising on the Internet, Charting the On-Line Marketing Process, Marketing Research. Consumer search and Resources Discovery: Search and Resource Discovery Paradignis, Information Search and Retrieval, e Commerce Catalogs or Directories, Information Filtering, Consumer-Data Interface: Emerging Tools Eleetionic Pi~blishing: EP and Web-Bascd EP, Intellectual Property Issues in the Age of EP Intellectual Property Issues for Multimedia I' Hypermedia Develupment.

Text Books:
1. DanIel Minoli, Emitia Minoll: Web Con'~erce Technology Handbook, Tata McGraw -Hill, l998 (Chapters 1,2,3,6,7,11).
2. Ravi Kalakota, Andrew B. Whinston:Frontiers of lectronic Commerce .Addison Wesley 1996.(Chapters l,7,8,9,10,11,13,' .)

Reference Books:
1. Danici Lynch and Leslie Lundquist: Digital: Money: The New Eraof Internet Commerce. J0h Wiley, 1996.

Subject Code CS8K4 / IS8K4              Subject Title:Genetic Algorihms
Duration of Exam:3hrs                         Total contact hrs:48
Max Exam Marks:100                            Max.I.A.Marks:25

1 GENETIC ALGORITHMS
Robustness of traditional optimization and search techniques .Goals of optimization ,A Simple General ,Algorithm,Similarity Templates. 12 hrs

2 MATHEMATICAl FOUNDATIONS
Fundamental theorem. Schems, Processing, 2 armed and K armed bandit problem, building block hypothesis, minimal deceptive, similarity templates as hyper planes. 12 hours

3 COMPUTER IMPLEMENTATION OF GENETIC ALGORITHMS
Data structure, reproduction, crossover and mutation, mapping objecti' functions to fitness for, fitness scaling 12 hours

4 ADVANCED OPERATORS AND TECHNIQUFS IN GENETIC ALGORITHMS SEARCH Dominance, Diploidy and abeyance, inversion and other re-ordering operators, Macro operators, niche and special speciation, multi objective optimization, knowledge based techniques, Genetic Algorithms and Parallel processors, Genetic Based machine learning, Classifier Systems. 12 hours

5 INDUSTRIAL APPLICATION OF GENETIC ALGORITHMS
Datamining using genetic Algorithms, using genetic operators to d~s~inguish chaotic behavior from Noise in a time series

Text Books:
1 David Goldberg, Genetic Algorithms in search, optimization and machine learning, Addison wesley International student edition, 1999. (Chapter 1, 2, 3 (Pages 59 to 79 both inclusive), 5, 6)
2Charles L Karr and L. Michael Freeman, Industrial applications of Genetic Algorithms, CRC Press, Washington DC, 1998 (Chapters: 9, 13)

Subject Code  CS8K5/IS8K5                                     Duration of Exam 3hrs
Subject Title Cryptography and Network Security     Max. Exam. Marks :100
Max. I.A. Marks 25                                                  Total contact hrs 48

Contents:
1. Cryptography-I            12hrs
Introduction: Attacks, Services, and Mechanisms, Security Attacks, Secutirty services, A Model Internetwork Security. Conventional Encryption Model, Steganography, Classical ncryption Techniques. Simplified DES, Block Cipher Principles, The Data Encryption Standarad, Strength of DES, Differential and Linear Cryptanalysis. Algorithms: Triple DES, International Data F ryption Algorithm, Blowfish. Confidentiality Using Conventinal Encryption: Placement of Lncryption Function, Traffic Cotifidentiality, Key Distrubution, Random Number Generation.

2. Cryptography-II       12Hrs
Public-Key Cryptography: Principles of Public-Key Cryptosysteins, The RSA Algorithm, Key Management, Diffie-Heilman Key Exchange. Number Theory: Prime and Relatively Prime Numbers, Modular Arithmetic, Fermat's and Euler's Theorems, Testing for Primality, EulersAlgorithms The Chinese Remainder Theorem, Discrete Logarithms. Message Authentication and Hash Functions: Authentication Requirements, Authentication Functions, Message Authentication Codes, MD5 Message Digest Algorithm. Digital Signatures and Authentication Protocols: Digital Signatures, Authentication Protocols, Digital Signature Standarad.

3, Network Security-I           12Hrs
Authentication Applications: Kerberos, X.509 Directory Authentication Service. Electronic Mail Security: Pretty Good Privacy, S/MIME. IP Secuny: IP Security Overyiew, IP Security Architecture, Authentication Header, Encapsulating Security Payload, Combining Security Associations, Key Management.