CSE

47

ANNA UNIVERSITY TIRUNELVELI : TIRUNELVELI 627 007

AFFILIATED INSTITUTIONS REGULATIONS – 2008

B.E. COMPUTER SCIENCE AND ENGINEERING CURRICULUM AND SYLLABI

SEMESTER V (Applicable to the students admitted from the Academic year 2008–2009 onwards)

CODE NO. COURSE TITLE L T P C

THEORY

CS51 Software Engineering 3 0 0 3 MA52 Discrete Mathematics 3 1 0 4 CS52 Computer Networks 3 0 0 3 CS53 Theory of Computation 3 1 0 4 CS54 System Software 3 1 0 4 CS55 Programming Paradigms 3 0 0 3 PRACTICAL

CS56 Network Lab 0 0 3 2 CS57 System Software Lab 0 0 3 2 CS58 Java Lab 0 0 3 2 HS510 English Language Laboratory - Cumulative

Skills - I 0 0 3 2

SEMESTER VI

(Applicable to the students admitted from the Academic year 2008–2009 onwards) Code No. Course Title L T P C

THEORY

CS61 Artificial Intelligence 3 0 0 3 CS62 Principles of Compiler Design 3 0 2 4 CS63 Object Oriented Analysis and Design 3 0 0 3 CS64 Advanced Computer Architecture 3 0 0 3 Elective – I 3 3 0 3 Elective – II 3 0 0 3 PRACTICAL

CS66 Object Oriented Analysis and Design Lab 0 0 3 2

48

HS610 English Language Laboratory - Cumulative Skills - II

0 0 3 2

CS67 Internet Programming Lab 1 0 3 2 SEMESTER VII

(Applicable to the students admitted from the Academic year 2008–2009 onwards) Code No. Course Title L T P C

THEORY

MG52 Engineering Economics & Financial Accounting 3 0 0 3 CS71 Computer Graphics 3 0 0 3 CS72 Mobile and Pervasive Computing 3 0 0 3 CS73 Digital Signal Processing 3 0 0 3 Elective III 3 0 0 3 Elective IV 3 0 0 3 PRACTICAL

CS76 Computer Graphics Lab 0 0 3 2 CS77 Open Source Lab 0 0 3 2

SEMESTER VIII (Applicable to the students admitted from the Academic year 2008–2009 onwards)

Code No. Course Title L T P C

THEORY

Elective V 3 0 0 3 Elective VI 3 0 0 3 PRACTICAL

CS81 Project Work 0 0 12 6

LIST OF ELECTIVES

SEMESTER VI – Elective I

Code No. Course Title L T P C

CS601 Multicore Programming 3 0 0 3 CS602 Visual Programming 3 0 0 3 CS603 Advanced JAVA Programming 3 0 0 3 CS604 Parallel Programming 3 0 0 3 IT63 Web Technology 3 0 0 3

49

SEMESTER VI – Elective II Code No. Course Title L T P C

CS605 UNIX Internals 3 0 0 3 MA51 Numerical Methods 3 0 0 3 IT64 Embedded Systems 3 0 0 3 CS606 Advanced Database Technology 3 0 0 3 IT707 Knowledge Management 3 0 0 3 CS607 High Performance Microprocessors 3 0 0 3

SEMESTER VII – Elective III Code No. Course Title L T P C

MG73 Resource Management Techniques 3 0 0 3 CS701 Data Warehousing and Data Mining 3 0 0 3 CS702 Real Time Systems 3 0 0 3 CS703 TCP/IP Design and Implementation 3 0 0 3 CS704 Natural Language Processing 3 0 0 3 IT604 User Interface Design 3 0 0 3 IT71 Service Oriented Architecture 3 0 0 3

SEMESTER VII – Elective IV Code No. Course Title L T P C

CS705 Advanced Operating Systems 3 0 0 3 CS706 C# and .NET Framework 3 0 0 3 IT62 Cryptography and Network Security 3 1 0 4 IT805 Systems Modeling & Simulation 3 0 0 3 GE71 Total Quality Management 3 0 0 3 IT61 Network Programming and Management 3 0 0 3 IT702 Software Testing 3 0 0 3

SEMESTER VIII – Elective V Code No. Course Title L T P C

GE609 Intellectual Property Rights 3 0 0 3 CS801 Graph Theory 3 0 0 3 IT706 Information Security 3 0 0 3

50

CS802 Soft Computing 3 0 0 3 IT603 Digital Image Processing 3 0 0 3 CS803 Software Quality Assurance 3 0 0 3 CS804 Distributed Systems 3 0 0 3 CS805 Knowledge Based Decision Support Systems 3 0 0 3 GE606 Professional Ethics in Engineering 3 0 0 3 CS806 Nano Science and Technology 3 0 0 3

SEMESTER VIII – Elective VI Code No. Course Title L T P C

GE610 Indian Constitution and Society 3 0 0 3 CS807 High Speed Networks 3 0 0 3 CS808 Robotics 3 0 0 3 IT73 Software Project Management 3 0 0 3 CS809 Quantum Computing 3 0 0 3 CS810 Grid Computing 3 0 0 3 CS811 Agent Based Intelligent Systems 3 0 0 3 IT703 Bio Informatics 3 0 0 3 IT807 Speech Signal Processing 3 0 0 3 CS51 SOFTWARE ENGINEERING L T P C

3 0 0 3 UNIT I SOFTWARE PRODUCT AND PROCESS 9 Introduction – S/W Engineering Paradigm – Verification – Validation – Life Cycle Models – System Engineering – Computer Based System – Business Process Engineering Overview – Product Engineering Overview. UNIT II SOFTWARE REQUIREMENTS 9 Functional and Non-Functional – Software Document – Requirement Engineering Process – Feasibility Studies – Software Prototyping – Prototyping in the Software Process – Data – Functional and Behavioral Models – Structured Analysis and Data Dictionary. UNIT III ANALYSIS, DESIGN CONCEPTS AND PRINCIPLES 9 Systems Engineering - Analysis Concepts - Design Process And Concepts – Modular Design – Design Heuristic – Architectural Design – Data Design – User Interface Design – Real Time Software Design – System Design – Real Time Executives – Data Acquisition System – Monitoring And Control System. UNIT IV TESTING 9 Taxonomy Of Software Testing – Types Of S/W Test – Black Box Testing – Testing Boundary Conditions – Structural Testing – Test Coverage Criteria Based On Data Flow Mechanisms – Regression Testing – Unit Testing – Integration Testing – Validation Testing – System Testing And Debugging – Software Implementation Techniques

51

UNIT V SOFTWARE PROJECT MANAGEMENT 9 Measures And Measurements – ZIPF’s Law – Software Cost Estimation – Function Point Models – COCOMO Model – Delphi Method – Scheduling – Earned Value Analysis – Error Tracking – Software Configuration Management – Program Evolution Dynamics – Software Maintenance – Project Planning – Project Scheduling– Risk Management – CASE Tools

Total= 45 Periods TEXT BOOKS: 1. Ian Sommerville, “Software engineering”, Seventh Edition, Pearson Education

Asia, 2007. 2. Roger S. Pressman, “Software Engineering – A practitioner’s Approach”, Sixth

Edition, McGraw-Hill International Edition, 2005. REFERENCES: 1. Watts S.Humphrey,”A Discipline for Software Engineering”, Pearson Education,

2007.

2. James F.Peters and Witold Pedrycz,”Software Engineering, An Engineering Approach”, Wiley-India, 2007.

3. Stephen R.Schach, “ Software Engineering”, Tata McGraw-Hill Publishing Company Limited, 2007.

4. S.A.Kelkar,”Software Engineering”, Prentice Hall of India Pvt, 2007.

MA52 DISCRETE MATHEMATICS L T P C 3 1 0 4 AIM To extend student’s Logical and Mathematical maturity and ability to deal with abstraction and to introduce most of the basic terminologies used in computer science courses and application of ideas to solve practical problems. OBJECTIVES

At the end of the course, students would

Have knowledge of the concepts needed to test the logic of a program..

Have an understanding in identifying structures on many levels. Be aware of a class of functions which transform a finite set into another

finite set which relates to input output functions in computer science. Be aware of the counting principles Be exposed to concepts and properties of algebraic structures such as

semi groups, monoids and groups. UNIT I LOGIC AND PROOFS 9 + 3

52

Propositional Logic – Propositional equivalences-Predicates and quantifiers-Nested Quantifiers-Rules of inference-introduction to Proofs-Proof Methods and strategy UNIT II COMBINATORICS 9+3 Mathematical inductions-Strong induction and well ordering-.The basics of counting-The pigeonhole principle –Permutations and combinations-Recurrence relations-Solving Linear recurrence relations-generating functions-inclusion and exclusion and applications. UNIT III GRAPHS 9 + 3 Graphs and graph models-Graph terminology and special types of graphs-Representing graphs and graph isomorphism -connectivity-Euler and Hamilton graphs-planar graphs.

UNIT IV ALGEBRAIC STRUCTURES 9 + 3 Algebraic systems-Semi groups and monoids-Groups-Subgroups and homomorphisms-Cosets and Lagrange’s theorem- Ring & Fields (Definitions and examples) UNIT V LATTICES AND BOOLEAN ALGEBRA 9 +3 Partial ordering-Posets-Lattices as Posets- Properties of lattices-Lattices as Algebraic systems –Sub lattices –direct product and Homomorphism-Some Special lattices-Boolean Algebra

L: 45, T: 15, Total= 60 Periods

TEXT BOOKS: 1. Kenneth H.Rosen, “Discrete Mathematics and its Applications”, Special Indian

edition, Tata McGraw-Hill Pub. Co. Ltd., New Delhi, (2007). (For the units 1 to 3, Sections 1.1 to 1.7 , 4.1 & 4.2, 5.1 to 5.3, 6.1, 6.2, 6.4 to 6.6, 8.1 to 8.5)

2. Trembly J.P and Manohar R, “Discrete Mathematical Structures with Applications to Computer Science”, Tata McGraw–Hill Pub. Co. Ltd, New Delhi, 30th Re-print (2007).(For units 4 & 5 , Sections 2-3.8 & 2-3.9,3-1,3-2 & 3-5, 4-1 & 4-2)

REFERENCES:

1. Ralph. P. Grimaldi, “Discrete and Combinatorial Mathematics: An Applied Introduction”, Fourth Edition, Pearson Education Asia, Delhi, (2002).

2. Thomas Koshy, ”Discrete Mathematics with Applications”, Elsevier Publications, (2006).

3. Seymour Lipschutz and Mark Lipson, ”Discrete Mathematics”, Schaum’s Outlines, Tata McGraw-Hill Pub. Co. Ltd., New Delhi, Second edition, (2007).

53

CS52 COMPUTER NETWORKS L T P C 3 0 0 3

UNIT I 9 Network architecture – layers – Physical links – Channel access on links – Hybrid multiple access techniques - Issues in the data link layer - Framing – Error correction and detection – Link-level Flow Control UNIT II 9 Medium access – CSMA – Ethernet – Token ring – FDDI - Wireless LAN – Bridges and Switches UNIT III 9 Circuit switching vs. packet switching / Packet switched networks – IP – ARP – RARP – DHCP – ICMP – Queueing discipline – Routing algorithms – RIP – OSPF – Subnetting – CIDR – Interdomain routing – BGP – Ipv6 – Multicasting – Congestion avoidance in network layer UNIT IV 9 UDP – TCP – Adaptive Flow Control – Adaptive Retransmission - Congestion control – Congestion avoidance – QoS UNIT V 9 Email (SMTP, MIME, IMAP, POP3) – HTTP – DNS- SNMP – Telnet – FTP – Security – PGP - SSH

Total= 45 Periods TEXT BOOKS : 1. Larry L. Peterson, Bruce S. Davie, “Computer Networks: A Systems Approach”,

Third Edition, Morgan Kauffmann Publishers Inc., 2003. REFERENCES: 1. James F. Kuross, Keith W. Ross, “Computer Networking, A Top-Down Approach

Featuring the Internet”, Third Edition, Addison Wesley, 2004. 2. Nader F. Mir, “Computer and Communication Networks”, Pearson Education, 2007 3. Comer, “Computer Networks and Internets with Internet Applications”, Fourth Edition,

Pearson Education, 2003. 4. Andrew S. Tanenbaum, “Computer Networks”, Fourth Edition, 2003. 5. William Stallings, “Data and Computer Communication”, Sixth Edition, Pearson

Education, 2000 CS53 THEORY OF COMPUTATION L T P C 3 1 0 4 UNIT I AUTOMATA 9 Introduction to formal proof – Additional forms of proof – Inductive proofs –Finite Automata (FA) – Deterministic Finite Automata (DFA) – Non-deterministic Finite Automata (NFA) – Finite Automata with Epsilon transitions.

54

UNIT II REGULAR EXPRESSIONS AND LANGUAGES 9 Regular Expression – FA and Regular Expressions – Proving languages not to be regular – Closure properties of regular languages – Equivalence and minimization of Automata. UNIT III CONTEXT-FREE GRAMMARS AND LANGUAGES 9 Context-Free Grammar (CFG) – Parse Trees – Ambiguity in grammars and languages – Definition of the Pushdown automata – Languages of a Pushdown Automata – Equivalence of Pushdown automata and CFG– Deterministic Pushdown Automata. UNIT IV PROPERTIES OF CONTEXT-FREE LANGUAGES 9 Normal forms for CFG – Pumping Lemma for CFL – Closure Properties of CFL – Turing Machines – Programming Techniques for TM. UNIT V UNDECIDABALITY 9 A language that is not Recursively Enumerable (RE) – An undecidable problem that is RE – Undecidable problems about Turing Machine – Post’s Correspondence Problem – The classes P and NP.

L: 45, T: 15, Total= 60 Periods TEXT BOOKS: 1. J.E. Hopcroft, R. Motwani and J.D. Ullman, “Introduction to Automata Theory,

Languages and Computations”, second Edition, Pearson Education, 2007. REFERENCES: 1. H.R. Lewis and C.H. Papadimitriou, “Elements of the theory of Computation”,

Second Edition, Pearson Education, 2003. 2. Thomas A. Sudkamp,” An Introduction to the Theory of Computer Science,

Languages and Machines”, Third Edition, Pearson Education, 2007. 3. Raymond Greenlaw an H.James Hoover, “ Fundamentals of Theory of

Computation, Principles and Practice”, Morgan Kaufmann Publishers, 1998. 4. Micheal Sipser, “Introduction of the Theory and Computation”, Thomson

Brokecole, 1997. 5. J. Martin, “Introduction to Languages and the Theory of computation”

Third Edition, Tata Mc Graw Hill, 2007 CS54 SYSTEM SOFTWARE

L T P C 3 1 0 4

AIM To have an understanding of foundations of design of assemblers, loaders, linkers, and macro processors.

OBJECTIVES

55

To understand the relationship between system software and machine architecture.

To know the design and implementation of assemblers To know the design and implementation of linkers and loaders. To have an understanding of macroprocessors. To have an understanding of system software tools.

UNIT I INTRODUCTION 8 System software and machine architecture – The Simplified Instructional Computer (SIC) - Machine architecture - Data and instruction formats - addressing modes - instruction sets - I/O and programming.

UNIT II ASSEMBLERS 10 Basic assembler functions - A simple SIC assembler – Assembler algorithm and data structures - Machine dependent assembler features - Instruction formats and addressing modes – Program relocation - Machine independent assembler features - Literals – Symbol-defining statements – Expressions - One pass assemblers and Multi pass assemblers - Implementation example - MASM assembler. UNIT III LOADERS AND LINKERS 9 Basic loader functions - Design of an Absolute Loader – A Simple Bootstrap Loader - Machine dependent loader features - Relocation – Program Linking – Algorithm and Data Structures for Linking Loader - Machine-independent loader features - Automatic Library Search – Loader Options - Loader design options - Linkage Editors – Dynamic Linking – Bootstrap Loaders - Implementation example - MSDOS linker. UNIT IV MACRO PROCESSORS 9 Basic macro processor functions - Macro Definition and Expansion – Macro Processor Algorithm and data structures - Machine-independent macro processor features - Concatenation of Macro Parameters – Generation of Unique Labels – Conditional Macro Expansion – Keyword Macro Parameters-Macro within Macro-Implementation example - MASM Macro Processor – ANSI C Macro language. UNIT V SYSTEM SOFTWARE TOOLS 9 Text editors - Overview of the Editing Process - User Interface – Editor Structure. - Interactive debugging systems - Debugging functions and capabilities – Relationship with other parts of the system – User-Interface Criteria.

L: 45, T: 15, Total= 60 Periods

TEXT BOOK 1. Leland L. Beck, “System Software – An Introduction to Systems Programming”,

3rd Edition, Pearson Education Asia, 2006.

REFERENCES 1. D. M. Dhamdhere, “Systems Programming and Operating Systems”, Second

Revised Edition, Tata McGraw-Hill, 2000. 2. John J. Donovan “Systems Programming”, Tata McGraw-Hill Edition, 2000.

56

3. John R. Levine, Linkers & Loaders – Harcourt India Pvt. Ltd., Morgan Kaufmann Publishers, 2000.

CS55 PROGRAMMING PARADIGMS

L T P C 3 0 0 3

AIM: To understand the concepts of object-oriented, event driven, and concurrent programming paradigms and develop skills in using these paradigms using Java. UNIT I OBJECT-ORIENTED PROGRAMMING – FUNDAMENTALS 9 Review of OOP - Objects and classes in Java – defining classes – methods - access specifiers – static members – constructors – finalize method – Arrays – Strings - Packages – JavaDoc comments UNIT II OBJECT-ORIENTED PROGRAMMING – INHERITANCE 10 Inheritance – class hierarchy – polymorphism – dynamic binding – final keyword – abstract classes – the Object class – Reflection – interfaces – object cloning – inner classes – proxies UNIT III EVENT-DRIVEN PROGRAMMING 10 Graphics programming – Frame – Components – working with 2D shapes – Using color, fonts, and images - Basics of event handling – event handlers – adapter classes – actions – mouse events – AWT event hierarchy – introduction to Swing – Model-View-Controller design pattern – buttons – layout management – Swing Components UNIT IV GENERIC PROGRAMMING 8 Motivation for generic programming – generic classes – generic methods – generic code and virtual machine – inheritance and generics – reflection and generics – exceptions – exception hierarchy – throwing and catching exceptions – Stack Trace Elements - assertions - logging UNIT V CONCURRENT PROGRAMMING 8 Multi-threaded programming – interrupting threads – thread states – thread properties – thread synchronization – thread-safe Collections – Executors – synchronizers – threads and event-driven programming

Total= 45 Periods TEXT BOOK

1. Cay S. Horstmann and Gary Cornell, “Core Java: Volume I – Fundamentals”, Eighth Edition, Sun Microsystems Press, 2008.

REFERENCES

1. K. Arnold and J. Gosling, “The JAVA programming language”, Third edition, Pearson Education, 2000.

2. Timothy Budd, “Understanding Object-oriented programming with Java”, Updated Edition, Pearson Education, 2000.

57

3. C. Thomas Wu, “An introduction to Object-oriented programming with Java”, Fourth Edition, Tata McGraw-Hill Publishing company Ltd., 2006.

CS56 NETWORKS LAB

L T P C 0 0 3 2

1. Programs using TCP Sockets (like date and time server & client, echo server &

client, etc..) 2. Programs using UDP Sockets (like simple DNS) 3. Programs using Raw sockets (like packet capturing and filtering) 4. Programs using RPC 5. Simulation of sliding window protocols

Experiments using simulators (like OPNET)

6. Performance comparison of MAC protocols 7. Performance comparison of Routing protocols 8. Study of TCP/UDP performance

Total= 45 Periods

58

Requirement for a batch of 30 students

S.No. Description of Equipment Quantity required

Quantity available

Deficiency %

1. SOFTWARE C++ Compiler J2SDK (freeware) Linux NS2/Glomosim/OPNET (Freeware)

30

2. Hardware PCs

30 Nos

CS57 SYSTEM SOFTWARE LAB

L T P C 0 0 3 2

(Using C)

1. Implement a symbol table with functions to create, insert, modify, search, and display.

2. Implement pass one of a two pass assembler. 3. Implement pass two of a two pass assembler. 4. Implement a single pass assembler. 5. Implement a two pass macro processor 6. Implement a single pass macro processor. 7. Implement an absolute loader. 8. Implement a relocating loader. 9. Implement pass one of a direct-linking loader. 10. Implement pass two of a direct-linking loader.

59

11. Implement a simple text editor with features like insertion / deletion of a character, word, and sentence.

12. Implement a symbol table with suitable hashing

(For loader exercises, output the snap shot of the main memory as it would be, after the loading has taken place)

Total= 45 Periods Requirement for a batch of 30 students

S.No. Description of Equipment Quantity required

Quantity available

Deficiency %

1. Hardware – Pentium PC Desktops 30 Nos.

2. Software – Turbo C (Freely download) Multiuser

CS58 JAVA LAB

L T P C 0 0 3 2

1. Develop Rational number class in Java. Use JavaDoc comments for

documentation. Your implementation should use efficient representation for a rational number, i.e. (500 / 1000) should be represented as (½).

2. Develop Date class in Java similar to the one available in java.util package. Use JavaDoc comments.

3. Implement Lisp-like list in Java. Write basic operations such as 'car', 'cdr', and 'cons'. If L is a list [3, 0, 2, 5], L.car() returns 3, while L.cdr() returns [0,2,5].

4. Design a Java interface for ADT Stack. Develop two different classes that implement this interface, one using array and the other using linked-list. Provide necessary exception handling in both the implementations.

5. Design a Vehicle class hierarchy in Java. Write a test program to demonstrate polymorphism.

6. Design classes for Currency, Rupee, and Dollar. Write a program that randomly generates Rupee and Dollar objects and write them into a file using object serialization. Write another program to read that file, convert to Rupee if it reads a Dollar, while leave the value as it is if it reads a Rupee.

7. Design a scientific calculator using event-driven programming paradigm of Java. 8. Write a multi-threaded Java program to print all numbers below 100,000 that are

both prime and fibonacci number (some examples are 2, 3, 5, 13, etc.). Design a thread that generates prime numbers below 100,000 and writes them into a pipe. Design another thread that generates fibonacci numbers and writes them to

60

another pipe. The main thread should read both the pipes to identify numbers common to both.

9. Develop a simple OPAC system for library using even-driven and concurrent programming paradigms of Java. Use JDBC to connect to a back-end database.

10. Develop multi-threaded echo server and a corresponding GUI client in Java. 11. [Mini-Project] Develop a programmer's editor in Java that supports syntax-

highlighting, compilation support, debugging support, etc.

Total= 45 Periods HS510 English Language Laboratory - Cumulative Skills - I

Fifth Semester

Regulations 2008

(Common to all B.E / B.Tech.) 0 0 3 2

(To be conducted as a Practical Paper by the Department of English for 3 hrs per week) OBJECTIVES

To help the learners improve their communicative skill

To facilitate the learners to improve the pronunciation of words with proper stress

To help the learners acquire the skills related to Group Discussion and Interview

To inculcate the habit of reading among the learners

To equip the learners face the linguistic demands by spotting out errors in

sentences

To improve the active vocabulary of the learners

COURSE CONTENT

A) Interview (5 hrs)

B) Pronunciation - Stress Shift (5 hrs)

C) Group Discussion (15hrs)

D) Reading Comprehension, Error Correction, Vocabulary Target words

61

(1500 words) (20 hrs)

RECORD LAY OUT

Every student has to maintain a record in which he / she has to incorporate the following

details.

A. Hard copy of the application letter and resume

B. Group Discussion

Grouping (each group consisting of 10 members)

Topics* (15 topics – 3 topics to be selected by each group - to be practiced in

cycles)

Pre performance preparation

Performance

They have to collect materials related to topics given for Group Discussion

*GD Topics

1. Advertising is a legalized form of lying- Discuss. 2. Impact of the media and internet on modern youth. 3. Communicative competency in English is the golden key for success in the Global

arena. 4. Is EQ more important than IQ? 5. Attitude decides one’s altitude in life. 6. Should an aspiring student go for a course which is in demand or for a course

which he/she likes? 7. Is westernization a cultural degradation or enrichment? 8. Is coalition government sustainable? 9. Should there be a ban on fashion show? 10. No two generations see eye to eye- Discuss. 11. Is scientific advancement a boon or a bane? 12. Should brain drain be banned? 13. Cyber crimes and steps to prevent and control. 14. Is the press in India really free? 15. Does ragging develop friendship?

C. Reading Comprehension – 10 passages

D. Error correction - 10 sentences for each section

a. concord b. words followed by prepositions (list to be provided)

62

c. conjunctions d. structure e. usage f. use of pronouns-antecedent g. adverbs placement h. particles i. use of tenses

E. Use of Vocabulary 10 assignments (each 20 words) using the target words in sentences of their own.

Separate word lists to be allotted to students so that all the words in the target vocabulary

are covered

Assignments to be written in the record notebook only after the approval of the Course

Teacher

VOCABULARY LIST

The colleges are requested to train the third year B.E./B.Tech. students in the use of

following words as part of the syllabus for Cumulative Skill Lab - I and it will be tested

for 20 marks during the practical examinations.

(Words from Barron’s GRE Test – ‘Abase’ to ‘Dermatologist’- 1500 words – V

Semester)

(Words from D+ to Z from Barron’s GRE Test will be added in the syllabus for the

practical examination in the VI semester)

STRESS SHIFT

WORD LIST

‘accident acci’dental de’mocracy demo’cratic ‘argument argumen’tative ‘demonstrate demons’tration ‘advice ad’vise de’termine deter’mination as’similate assimil’ation ‘different diffe’rential as’sociate associ’ation ‘diplomat diplo’matic ‘astronaut a’stronomy ‘dogma dog’matic ‘benefit bene’ficial ‘durable dura’bility

63

Bi’ology bio’logical dy’namic ‘dynamism ‘bomb bom’bard ‘edit edi’tion ‘bureaucrat bureau’cracy ‘educate edu’cation ‘calculate calcul’ation ‘element ele’mental ‘capable capa’bility ‘energy ener’getic ‘category cata’gorical ‘equal e’quality ‘certify cer’tificate ‘error er’ratic ‘collect col’lection ‘feasible feas’ibility ‘commerce com’mercial ‘fertile fer’tility com’municate communi’cation ‘francise franci’see com’pete compe’tition ‘frequent(adj) fre’quent(v) com’plicate compli’cation ‘futile fu’tility con’serve conser’vation ‘generalise generali’sation ‘controversy contro’versial ‘generous gene’rosity ‘credible credi’bility ‘global globali’sation ‘cultivate culti’vation ‘grammar gram’matical ‘gymnast gym’nastic ‘officer of’ficial ‘habit ha’bitual ‘opposite oppo’sition ‘harmony har’monious ‘origin o’riginate ‘hero he’roic ‘palace pa’latial ‘history his’torical ‘paralyse pa’ralysis ‘hostile hos’tility ‘photograph pho’tographer ‘humanise hu’manity ‘possible possi’bility ‘hypocrite hy’pocrisy ‘problem proble’matic i’deal ide’alogy ‘record(n) re’cord(v) i’dentify identifi’cation ‘remedy re’medial ‘incident inci’dental ‘scholar scho’lastic Indi’vidual individu’ality ‘scientist scien’tific ‘industry in’dustrial ‘theme the’matic ‘influence influ’ential ‘technical tech’nology ‘injury in’jurious ‘volume vo’luminous ‘irony i’ronic ‘labour la’borious ‘legal le’gality ‘luxury lux’urious ‘magnet mag’netic ‘manifest manifes’tation ‘microscope micros’copic ‘migrant mig’rate ‘mystery mys’terious ‘necessary nec’cessity ‘neglect neg’ligence ‘object(n) ob’ject(v)

64

MODE OF EVALUATION INTERNAL ASSESSMENT (100 Marks to be converted to 20) 1. Interview skill (10 marks)

2. Pronunciation skill (10 marks)

3. Group discussion (20 for materials collection and 20 for performance) (40 marks)

4. Test in Reading Comprehension and Error Correction (40 marks)

EXTERNAL ASSESSMENT (100 Marks to be converted to 80) 1. Stress shift -10

2. Group discussion -30

3. Vocabulary -20

4. Reading comprehension -30

5. Error correction -10

Part A (40 minutes for the entire group) 1. Reading Comprehension (30 marks)

Two separate passages on scientific/technical themes to be given.

There will be 5 testing items (either MCQs or T/F or Cloze type) under each text.

(5x 2 = 10 testing items each carrying 3 marks)

6 such sets will be sent to the respective colleges during the practical.

Alternate sets to be allotted to students during testing.

2. Error correction (10 marks)

10 items ,covering all the specified areas, will be given

Sentences will have five segments (A,B,C,D,E) with E necessarily standing for

‘NO Error’

Alternate sets to be allotted to students during testing.

3. Vocabulary Testing (20 marks)

65

10 words to be tested The most exact synonym to be selected out of the five given alternatives. Each item carries 2 marks Alternate sets to be allotted to students during testing.

PART B 1. Stress shift (10 Marks) While testing the student’s proficiency in the use of stress shift each student should be

tested with a different question paper (one out of the 10 sets to be given).

2. Group discussion The students in the section should be put into a group of 10 each .Before the start of

group discussion the group leaders should select the topic at random from the given

topics. Marks should be allotted individually according to the following criteria.

A. Relevance of content (10 Marks)

B. The use of Language and power of argument (10 Marks)

C. Soft skills /social skills (10 marks)

NB: The responses for the use of vocabulary, error correction, reading comprehension

should be entered in the response coding sheet using black or blue ball point pen .Over

writing should be marked wrong.

CS61 ARTIFICIAL INTELLIGENCE L T P C 3 0 0 3 Aim: To learn the basics of designing intelligent agents that can solve general purpose problems, represent and process knowledge, plan and act, reason under uncertainty and can learn from experiences UNIT I PROBLEM SOLVING 9 Introduction – Agents – Problem formulation – uninformed search strategies – heuristics – informed search strategies – constraint satisfaction

66

UNIT II LOGICAL REASONING 9 Logical agents – propositional logic – inferences – first-order logic – inferences in first-order logic – forward chaining – backward chaining – unification – resolution UNIT III PLANNING 9 Planning with state-space search – partial-order planning – planning graphs – planning and acting in the real world UNIT IV UNCERTAIN KNOWLEDGE AND REASONING 9 Uncertainty – review of probability - probabilistic Reasoning – Bayesian networks – inferences in Bayesian networks – Temporal models – Hidden Markov models UNIT V LEARNING 9 Learning from observation - Inductive learning – Decision trees – Explanation based learning – Statistical Learning methods - Reinforcement Learning TOTAL: 45PERIODS TEXT BOOK:

1. S. Russel and P. Norvig, “Artificial Intelligence – A Modern Approach”, Second Edition, Pearson Education, 2003.

REFERENCES: 1. David Poole, Alan Mackworth, Randy Goebel, ”Computational Intelligence : a

logical approach”, Oxford University Press, 2004. 2. G. Luger, “Artificial Intelligence: Structures and Strategies for complex problem

solving”, Fourth Edition, Pearson Education, 2002. 3. J. Nilsson, “Artificial Intelligence: A new Synthesis”, Elsevier Publishers, 1998.

67

CS62 PRINCIPLES OF COMPILER DESIGN L T P C 3 0 2 4 UNIT I LEXICAL ANALYSIS 9 Introduction to Compiling- Compilers-Analysis of the source program-The phases-Cousins-The grouping of phases-Compiler construction tools. The role of the lexical analyzer- Input buffering-Specification of tokens-Recognition of tokens-A language for specifying lexical analyzer. UNIT II SYNTAX ANALYSIS and RUN-TIME ENVIRONMENTS 9 Syntax Analysis- The role of the parser-Context-free grammars-Writing a grammar-Top-down parsing-Bottom-up Parsing-LR parsers-Constructing an SLR(1) parsing table. Type Checking- Type Systems-Specification of a simple type checker. Run-Time Environments-Source language issues-Storage organization-Storage-allocation strategies. UNIT III INTERMEDIATE CODE GENERATION 9 Intermediate languages-Declarations-Assignment statements - Boolean expressions-Case statements- Backpatching-Procedure calls UNIT IV CODE GENERATION 9 Issues in the design of a code generator- The target machine-Run-time storage management-Basic blocks and flow graphs- Next-use information-A simple code generator-Register allocation and assignment-The dag representation of basic blocks - Generating code from dags. UNIT V CODE OPTIMIZATION 9 Introduction-The principle sources of optimization-Peephole optimization- Optimization of basic blocks-Loops in flow graphs- Introduction to global data-flow analysis-Code improving transformations. TEXT BOOK:

1. Alfred V. Aho, Ravi Sethi Jeffrey D. Ullman, “Compilers- Principles, Techniques, and Tools”, Pearson Education Asia, 2007.

REFERENCES: 1. David Galles, “Modern Compiler Design”, Pearson Education Asia, 2007 2. Steven S. Muchnick, “Advanced Compiler Design & Implementation”, Morgan Kaufmann Pulishers, 2000. 3. C. N. Fisher and R. J. LeBlanc “Crafting a Compiler with C”, Pearson Education, 2000.

68

CS63 OBJECT ORIENTED ANALYSIS AND DESIGN L T P C 3 0 0 3 OBJECTIVES:

1. To learn basic OO analysis and design skills through an elaborate case study 2. To use the UML design diagrams 3. To apply the appropriate design patterns

UNIT I 9 Introduction to OOAD – What is OOAD? – What is UML? What are the United process(UP) phases - Case study – the NextGen POS system, Inception -Use case Modeling - Relating Use cases – include, extend and generalization. UNIT II 9 Elaboration - Domain Models - Finding conceptual classes and description classes – Associations – Attributes – Domain model refinement – Finding conceptual class hierarchies- Aggregation and Composition- UML activity diagrams and modeling UNIT III 9 System sequence diagrams - Relationship between sequence diagrams and use cases Logical architecture and UML package diagram – Logical architecture refinement - UML class diagrams - UML interaction diagrams UNIT IV 9 GRASP: Designing objects with responsibilities – Creator – Information expert – Low Coupling –Controller – High Cohesion – Designing for visibility - Applying GoF design patterns – adapter, singleton, factory and observer patterns. UNIT V 9 UML state diagrams and modeling - Operation contracts- Mapping design to code -UML deployment and component diagrams

TOTAL : 45 PERIODS TEXT BOOK : 1. Craig Larman,"Applying UML and Patterns: An Introduction to object-oriented

Analysis and Design and iterative development”, Third Edition, Pearson Education, 2005

REFERENCES: 1. Mike O’Docherty, “Object-Oriented Analysis & Design: Understanding System Development with UML 2.0”, John Wiley & Sons, 2005. 2. James W- Cooper, Addison-Wesley, “Java Design Patterns – A Tutorial”, 2000. 3. Micheal Blaha, James Rambaugh, “Object-Oriented Modeling and Design with UML”, Second Edition, Prentice Hall of India Private Limited, 2007 4. Erich Gamma, Richard Helm, Ralph Johnson, John Vlissides,“Design patterns: Elements of Reusable object-oriented software”, Addison-Wesley, 1995.

69

CS64 ADVANCED COMPUTER ARCHITECTURE L T P C 3 0 0 3 UNIT I INSTRUCTION LEVEL PARALLELISM 9 ILP – Concepts and challenges – Hardware and software approaches – Dynamic scheduling – Speculation - Compiler techniques for exposing ILP – Branch prediction.

UNIT II MULTIPLE ISSUE PROCESSORS 9 VLIW & EPIC – Advanced compiler support – Hardware support for exposing parallelism – Hardware versus software speculation mechanisms – IA 64 and Itanium processors – Limits on ILP.

UNIT III MULTIPROCESSORS AND THREAD LEVEL PARALLELISM 9 Symmetric and distributed shared memory architectures – Performance issues – Synchronization – Models of memory consistency – Introduction to Multithreading.

UNIT IV MEMORY AND I/O 9 Cache performance – Reducing cache miss penalty and miss rate – Reducing hit time – Main memory and performance – Memory technology. Types of storage devices – Buses – RAID – Reliability, availability and dependability – I/O performance measures – Designing an I/O system.

UNIT V MULTI-CORE ARCHITECTURES 9

Software and hardware multithreading – SMT and CMP architectures – Design issues – Case studies – Intel Multi-core architecture – SUN CMP architecture - heterogenous multi-core processors – case study: IBM Cell Processor.

TOTAL : 45 HOURS

TEXT BOOKS:

1. John L. Hennessey and David A. Patterson, “ Computer architecture – A quantitative approach”, Morgan Kaufmann / Elsevier Publishers, 4th. edition, 2007.

REFERENCES: 1. David E. Culler, Jaswinder Pal Singh, “Parallel computing architecture : A

hardware/software approach” , Morgan Kaufmann /Elsevier Publishers, 1999. 2. Kai Hwang and Zhi.Wei Xu, “Scalable Parallel Computing”, Tata McGraw Hill, New

Delhi, 2003.

70

CS66 OOAD LAB 0 0 3 2 OBJECTIVE: To develop a mini-project following the 12 exercises listed below. 1. To develop a problem statement. 2. Develop an IEEE standard SRS document. Also develop risk management and

project plan (Gantt chart). 3. Identify Use Cases and develop the Use Case model. 4. Identify the business activities and develop an UML Activity diagram. 5. Identity the conceptual classes and develop a domain model with UML Class

diagram. 6. Using the identified scenarios find the interaction between objects and represent

them using UML Interaction diagrams. 7. Draw the State Chart diagram. 8. Identify the User Interface, Domain objects, and Technical services. Draw the

partial layered, logical architecture diagram with UML package diagram notation. 9. Implement the Technical services layer. 10. Implement the Domain objects layer. 11. Implement the User Interface layer. 12. Draw Component and Deployment diagrams.

Suggested domains for Mini-project.

1. Passport automation system. 2. Book bank 3. Exam Registration 4. Stock maintenance system. 5. Online course reservation system 6. E-ticketing 7. Software personnel management system 8. Credit card processing 9. e-book management system 10. Recruitment system 11. Foreign trading system 12. Conference Management System 13. BPO Management System

Suggested SoftwareTools ArgoUML, Eclipse IDE, Visual Paradigm, Visual case, and Rational Suite

71

HS610 English Language Laboratory - Cumulative Skills - II

Semester VI

Regulations 2008

(Common to all B.E. / B.Tech.)

(To be conducted as a Practical Paper by the Department of English for 3 hrs per week)

OBJECTIVES

To equip the learners face the linguistic demands of post-degree entrance examinations

To improve the IV level active vocabulary

To reactivate and reinforce the language functions introduced in earlier papers

To help the learner infer message from non-verbal cues and speak fluently on them

To help the learners inculcate the micro skills of debating on a subject

To motivate the learners read English dailies and react critically to news items

To help the learners acquire the skills related to organization of thoughts while writing

articles.

COURSE CONTENT

A) Target words (20 hrs)

((Words D+ to Z from Barron’s GRE Test)

B) Writing articles on media-based themes (10 hrs)

C) Debate (8 hrs)

D) Channel conversion (Speaking on Non-Verbal representations) (7 hrs)

RECORD LAY OUT Every student has to maintain record in which he/she has to incorporate the following

details.

Part I: Use of Vocabulary

10 assignments (each 20 words) using the target words in sentences of their own.

72

Separate word lists to be allotted to students so that all the words in the target

vocabulary are covered.

Assignments to be written in the record notebook only after the approval of the

professor in charge.

Part II: Article based on newspaper reading

One article (750 words) based on any theme emerging out of the news items.

(According to the methodology suggested)

It should be written only on the odd pages.

News items (at least 5) should be collected from English dailies and pasted on the

even pages.

Part III: Internal Question Papers on Target Vocabulary Testing & Coding sheets

Six Question papers to be pasted ( 2 for synonyms, 2 for antonyms and 2 for

sentence completion)

The corrected coding sheets (6) to be pasted.

The record should be duly signed by the Course Teacher and submitted to the External

Examiner for verification during the semester practical.

MODE OF EVALUATION Internal Assessment (20 marks) (10 marks for the Record and 10 marks for the six tests

on Target Vocabulary)

External Assessment (100 marks-to be converted to 80 marks)

The external practical * will consist of two segments (a) Written Test and (b) Testing

Speaking

73

Written Test (1 hr)

a) Testing Target Vocabulary (40 objective type items – 15 synonyms, 15 antonyms

and 10 sentence completion) (40 marks)

b) Writing articles on the theme emerging from the given newspaper, items given (5

newspaper items based on a single theme will be given) (20 marks)

Testing Speaking (3 + 3 minutes)

a) Debate (Each student will be required to speak for three minutes for or against a

given topic) (20 marks)

b) Speaking on the given diagram / chart / table (20 marks)

(*Every learner will be assessed with a different set of question which he / she will

choose a random) CS67 INTERNET PROGRAMMING LAB L T P C 1 0 3 2 LIST OF EXPERIMENTS 1.Create a web page with the following using HTML

i) To embed an image map in a web page ii) To fix the hot spots iii) Show all the related information when the hot spots are clicked.

2. Create a web page with all types of Cascading style sheets.

3. Client Side Scripts for Validating Web Form Controls using DHTML

4. Write programs in Java to create applets incorporating the following features:

Create a color palette with matrix of buttons Set background and foreground of the control text area by selecting a color from

color palette. In order to select Foreground or background use check box control as radio buttons To set background images

6. Write programs in Java using Servlets:

To invoke servlets from HTML forms To invoke servlets from Applets

74

7. Write programs in Java to create three-tier applications using JSP and

Databases

for conducting on-line examination. for displaying student mark list. Assume that student information is

available in a database which has been stored in a database server.

8. Programs using XML – Schema – XSLT/XSL

9. Programs using AJAX

10. Consider a case where we have two web Services- an airline service and a travel agent and the travel agent is searching for an airline. Implement this scenario using Web Services and Data base.

Total 15 + 45 = 60 TEXT BOOK: 1. Robert W.Sebesta, “Programming the world wide web”, Pearson Education,

2006. REFERENCES: 1. Deitel, “Internet and world wide web, How to Program”, PHI, 3rd Edition, 2005. MG52 ENGINEERING ECONOMICS AND FINANCIAL ACCOUNTING 3 0 0 3 UNIT I INTRODUCTION 5 Managerial Economics - Relationship with other disciplines - Firms: Types, objectives and goals - Managerial decisions - Decision analysis. UNIT II DEMAND & SUPPLY ANALYSIS 10 Demand - Types of demand - Determinants of demand - Demand function - Demand elasticity - Demand forecasting - Supply - Determinants of supply - Supply function - Supply elasticity. UNIT III PRODUCTION AND COST ANALYSIS 10 Production function - Returns to scale - Production optimization - Least cost input - Isoquants - Managerial uses of production function. Cost Concepts - Cost function - Determinants of cost - Short run and Long run cost curves - Cost Output Decision - Estimation of Cost. UNIT IV PRICING 5 Determinants of Price - Pricing under different objectives and different market structures - Price discrimination - Pricing methods in practice. UNIT V FINANCIAL ACCOUNTING (ELEMENTARY TREATMENT) 10

75

Balance sheet and related concepts - Profit & Loss Statement and related concepts - -Financial Ratio Analysis - Cash flow analysis - Funds flow analysis - Comparative financial statements - Analysis & Interpretation of financial statements. UNIT VI CAPITAL BUDGETING. (ELEMENTARY TREATMENT) 5 Investments - Risks and return evaluation of investment decision - Average rate of return - Payback Period - Net Present Value - Internal rate of return. SUGGESTED BOOKS: 1. Samuelson. Paul A and Nordhaus W.D., 'Economics', Tata Mcgraw Hill

Publishing Company Limited, New Delhi, 2004. 2. McGuigan, Moyer and Harris, 'Managerial Economics; Applications, Strategy and

Tactics', Thomson South Western, 10th Edition, 2005. 3. Paresh Shah, 'Basic Financial Accounting for Management', Oxford University Press,

New Delhi, 2007. 4. Salvatore Dominick, 'Managerial Economics in a global economy'. Thomson South

Western, 4th Edition, 2001. 5. Prasanna Chandra. 'Fundamentals of Financial Management', Tata Mcgraw Hill

Publishing Ltd., 4th edition, 2005. CS71 COMPUTER GRAPHICS L T P C 3 0 0 3 UNIT I 2D PRIMITIVES 9 output primitives – Line, Circle and Ellipse drawing algorithms - Attributes of output primitives – Two dimensional Geometric transformation - Two dimensional viewing – Line, Polygon, Curve and Text clipping algorithms UNIT II 3D CONCEPTS 9 Parallel and Perspective projections - Three dimensional object representation – Polygons, Curved lines, Splines, Quadric Surfaces,- Visualization of data sets - 3D transformations – Viewing -Visible surface identification.

UNIT III GRAPHICS PROGRAMMING 9 Color Models – RGB, YIQ, CMY, HSV – Animations – General Computer Animation, Raster, Keyframe - Graphics programming using OPENGL – Basic graphics primitives – Drawing three dimensional objects - Drawing three dimensional scenes UNIT IV RENDERING 9 Introduction to Shading models – Flat and Smooth shading – Adding texture to faces – Adding shadows of objects – Building a camera in a program – Creating shaded objects – Rendering texture – Drawing Shadows.

76

UNIT V FRACTALS 9 Fractals and Self similarity – Peano curves – Creating image by iterated functions – Mandelbrot sets – Julia Sets – Random Fractals – Overview of Ray Tracing – Intersecting rays with other primitives – Adding Surface texture – Reflections and Transparency – Boolean operations on Objects TOTAL = 45 TEXT BOOKS:

1. Donald Hearn, Pauline Baker, Computer Graphics – C Version, second edition, Pearson Education,2004.

2. F.S. Hill, Computer Graphics using OPENGL, Second edition, Pearson Education, 2003.

REFERENCES:

1. James D. Foley, Andries Van Dam, Steven K. Feiner, John F. Hughes, Computer Graphics- Principles and practice, Second Edition in C, Pearson Education, 2007.

CS72 MOBILE AND PERVASIVE COMPUTING L T P C 3 0 0 3 UNIT I MOBILE NETWORKS 9 Cellular Wireless Networks – GSM – Architecture – Protocols – Connection Establishment – Frequency Allocation – Routing – Mobility Management – Security – GPRS. UNIT II WIRELESS NETWORKS 9 Wireless LANs and PANs – IEEE 802.11 Standard – Architecture – Services –Network – HiperLAN – Blue Tooth- Wi-Fi – WiMAX UNIT III ROUTING 9 Mobile IP – DHCP – AdHoc– Proactive and Reactive Routing Protocols – Multicast Routing. UNIT IV TRANSPORT AND APPLICATION LAYERS 9 Mobile TCP– WAP – Architecture – WWW Programming Model– WDP – WTLS – WTP – WSP – WAE – WTA Architecture – WML – WMLScripts. UNIT V PERVASIVE COMPUTING 9 Pervasive computing infrastructure-applications- Device Technology - Hardware, Human-machine Interfaces, Biometrics, and Operating systems– Device Connectivity –Protocols, Security, and Device Management- Pervasive Web Application architecture-Access from PCs and PDAs - Access via WAP

77

TOTAL = 45

TEXT BOOKS: 1. Jochen Schiller, “Mobile Communications”, PHI, Second Edition, 2003. 2. Jochen Burkhardt, Pervasive Computing: Technology and Architecture of Mobile

Internet Applications, Addison-Wesley Professional; 3rd edition, 2007 REFERENCES: 1. Frank Adelstein, Sandeep KS Gupta, Golden Richard, Fundamentals of Mobile and

Pervasive Computing, McGraw-Hill 2005 2. Debashis Saha, Networking Infrastructure for Pervasive Computing: Enabling

Technologies, Kluwer Academic Publisher, Springer; First edition, 2002 3. Introduction to Wireless and Mobile Systems by Agrawal and Zeng, Brooks/ Cole

(Thomson Learning), First edition, 2002 4. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, Principles of

Mobile Computing, Springer, New York, 2003.

78

CS73 DIGITAL SIGNAL PROCESSING L T P C

3 0 0 3 UNIT I SIGNALS AND SYSTEMS 9 Basic elements of DSP – concepts of frequency in Analog and Digital Signals – sampling theorem – Discrete – time signals, systems – Analysis of discrete time LTI systems – Z transform – Convolution (linear and circular) – Correlation.

UNIT II FREQUENCY TRANSFORMATIONS 9 Introduction to DFT – Properties of DFT – Filtering methods based on DFT – FFT Algorithms Decimation – in – time Algorithms, Decimation – in – frequency Algorithms – Use of FFT in Linear Filtering – DCT.

UNIT III IIR FILTER DESIGN 9 Structures of IIR – Analog filter design – Discrete time IIR filter from analog filter – IIR filter design by Impulse Invariance, Bilinear transformation, Approximation of derivatives – (HPF, BPF, BRF) filter design using frequency translation

UNIT IV FIR FILTER DESIGN 9 Structures of FIR – Linear phase FIR filter – Filter design using windowing techniques, Frequency sampling techniques – Finite word length effects in digital Filters

UNIT V APPLICATIONS 9 Multirate signal processing – Speech compression – Adaptive filter – Musical sound processing – Image enhancement.

TEXT BOOKS:

1. John G. Proakis & Dimitris G.Manolakis, “Digital Signal Processing – Principles, Algorithms & Applications”, Fourth edition, Pearson education / Prentice Hall, 2007.

2. Emmanuel C..Ifeachor, & Barrie.W.Jervis, “Digital Signal Processing”, Second edition, Pearson Education / Prentice Hall, 2002.

REFERENCES:

1. Alan V.Oppenheim, Ronald W. Schafer & Hohn. R.Back, “Discrete Time Signal

Processing”, Pearson Education, 2nd edition, 2005. 2. Andreas Antoniou, “Digital Signal Processing”, Tata McGraw Hill, 2001

79

CS76 COMPUTER GRAPHICS LABORATORY L T P C 0 0 3 2

1. Implementation of Bresenhams Algorithm – Line, Circle, Ellipse.

2. Implementation of Line, Circle and ellipse Attributes

3. Two Dimensional transformations - Translation, Rotation, Scaling, Reflection, Shear.

4. Composite 2D Transformations

5. Cohen Sutherland 2D line clipping and Windowing

6. Sutherland – Hodgeman Polygon clipping Algorithm

7. Three dimensional transformations - Translation, Rotation, Scaling

8. Composite 3D transformations

9. Drawing three dimensional objects and Scenes

10. Generating Fractal images

80

CS77 OPEN SOURCE LAB 0 0 3 2 Objective: To expose students to FOSS environment and introduce them to use open source packages 1. Kernel configuration, compilation and installation : Download / access the latest kernel source code from kernel.org,compile the kernel and install it in the local system.Try to view the source code of the kernel

2. Virtualisation environment (e.g., xen, kqemu or lguest) to test an applications, new kernels and isolate applications. It could also be used to expose students to other alternate OSs like *BSD

3. Compiling from source : learn about the various build systems used like the auto* family, cmake, ant etc. instead of just running the commands. This could involve the full process like fetching from a cvs and also include autoconf, automake etc.,

4. Introduction to packet management system : Given a set of RPM or DEB, how to build and maintain, serve packages over http or ftp. and also how do you configure client systems to access the package repository.

5. Installing various software packages

Either the package is yet to be installed or an older version is existing. The student can practice installing the latest version. Of course, this might need internet access.

Install samba and share files to windows Install Common Unix Printing System(CUPS)

6. Write userspace drivers using fuse -- easier to debug and less dangerous to the system (Writing full-fledged drivers is difficult at student level)

7. GUI programming : a sample programme – using Gambas since the students have VB knowledge. However, one should try using GTK or QT 8. Version Control System setup and usage using RCS, CVS, SVN

9. Text processing with Perl: simple programs, connecting with database e.g., MYSQL 10. Running PHP : simple applications like login forms after setting up a LAMP stack

11. Running Python : some simple exercise – e.g. Connecting with MySql database 12. Set up the complete network interface usinf ifconfig command liek setting gateway, DNS, IP tables, etc., Resources : An environment like FOSS Lab Server (developed by NRCFOSS containing the various packages)

81

OR Equivalent system with Linux distro supplemented with relevant packages Note: Once the list of experiments are finalised, NRCFOSS can generate full lab manuals complete with exercises, necessary downloads, etc. These could be made available on NRCFOSS web portal. CS605 UNIX INTERNALS L T P C 3 0 0 3 UNIT I 9 General Review of the System-History-System structure-User Perspective-Operating System Services- Assumptions About Hardware. Introduction to the Kernel-Architecture System Concepts-Data Structures- System Administration. UNIT II 9 The Buffer Cache-Headers-Buffer Pool-Buffer Retrieval-Reading and Writing Disk Blocks-Advantages and Disadvantages. Internal Representation of Files-Inodes- Structure-Directories-Path Name to Inode- Super Block-Inode Assignment-Allocation of Disk Blocks -Other File Types. UNIT III 9 System Calls for the File System-Open-Read-Write-Lseek-Close-Create-Special files Creation-Change Directory and Change Root-Change Owner and Change Mode- Stat-Fstat-Pipes-Dup-Mount-Unmount-Link-Unlink-File System Abstraction- Maintenance. UNIT IV 9 The System Representation of Processes-States-Transitions-System Memory-Context of a Process-Saving the Context-Manipulation of a Process Address Space-Sleep Process Control-signals-Process Termination-Awaiting-Invoking other Programs-The Shell-System Boot and the INIT Process. UNIT V 9 Memory Management Policies-Swapping-Demand Paging-a Hybrid System-I/O Subsystem-Driver Interfaces-Disk Drivers-Terminal Drivers. TEXT: 1. Maurice J. Bach, "The Design of the Unix Operating System", Pearson Education, 2002. REFERENCES: 1. Uresh Vahalia, "UNIX Internals: The New Frontiers", Prentice Hall, 2000. 2. John Lion, "Lion's Commentary on UNIX", 6th edition, Peer-to-Peer Communications, 2004. 3. Daniel P. Bovet & Marco Cesati, “Understanding the Linux Kernel”, O’REILLY, Shroff Publishers &Distributors Pvt. Ltd, 2000. 4. M. Beck et al, “Linux Kernel Programming”, Pearson Education Asia, 2002

82

MA51 NUMERICAL METHODS 3 0 0 3 AIM

With the present development of the computer technology, it is necessary to develop efficient algorithms for solving problems in science, engineering and technology. This course gives a complete procedure for solving different kinds of problems occur in engineering numerically.

OBJECTIVES

At the end of the course, the students would be acquainted with the basic concepts in numerical methods and their uses are summarized as follows:

i. The roots of nonlinear (algebraic or transcendental) equations, solutions of large system of linear equations and eigen value problem of a matrix can be obtained numerically where analytical methods fail to give solution.

ii. When huge amounts of experimental data are involved, the methods

discussed on interpolation will be useful in constructing approximate polynomial to represent the data and to find the intermediate values.

iii. The numerical differentiation and integration find application when the

function in the analytical form is too complicated or the huge amounts of data are given such as series of measurements, observations or some other empirical information.

iv. Since many physical laws are couched in terms of rate of change of one/two

or more independent variables, most of the engineering problems are characterized in the form of either nonlinear ordinary differential equations or partial differential equations. The methods introduced in the solution of ordinary differential equations and partial differential equations will be useful in attempting any engineering problem.

1. SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS 9 Solution of equation –Fixed point iteration – Newton Raphson method – Solution of linear system by Gaussian elimination and Gauss-Jordon method– Iterative method - Gauss-Seidel method - Inverse of a matrix by Gauss Jordon method – Eigen value of a matrix by power method and by Jacobi method for symmetric matrix. 2. INTERPOLATION AND APPROXIMATION 9 Gauss Forward and Backward difference formulae - Lagrangian Polynomials – Divided differences – Interpolating with a cubic spline – Newton’s forward and backward difference formulas.

3. NUMERICAL DIFFERENTIATION AND INTEGRATION 9

83

Differentiation using interpolation formulae –Numerical integration by trapezoidal and Simpson’s 1/3 and 3/8 rules – Romberg’s method – Two and Three point Gaussian quadrature formulae – Double integrals using trapezoidal and Simpsons’s rules. 4. INITIAL VALUE PROBLEMS FOR ORDINARY DIFFERENTIAL

EQUATIONS 9 Single step methods: Taylor series method – Euler method for first order equation – Euler’s modified and improved methods for first order equation – Fourth order Runge – Kutta method for solving first and second order equations – Multistep methods: Milne’s and Adam’s predictor and corrector methods.

5. BOUNDARY VALUE PROBLEMS IN ORDINARY AND PARTIAL

DIFFERENTIAL EQUATIONS 9 Finite difference solution of second order ordinary differential equation – Finite difference solution of one dimensional heat equation by explicit and implicit methods – One dimensional wave equation and two dimensional Laplace and Poisson equations. L = 45 T = 15 Total = 60 TEXT BOOKS

1. Veerarjan, T and Ramachandran, T. ‘Numerical methods with programming in ‘C’ Second Editiion, Tata McGraw-Hill Publishing.Co.Ltd. (2007).

2. Sankara Rao K, ‘Numerical Methods for Scientisits and Engineers’ – 3rd editiion Printice Hall of India Private Ltd, New Delhi, (2007).

REFERENCE BOOKS 1. Chapra, S. C and Canale, R. P. “Numerical Methods for Engineers”, 5th Edition, Tata

McGraw-Hill, New Delhi, 2007. 2. Gerald, C. F. and Wheatley, P.O., “Applied Numerical Analysis”, 6th Edition, Pearson

Education Asia, New Delhi, 2006. 3. Grewal, B.S. and Grewal,J.S., “ Numerical methods in Engineering and Science”, 6th

Edition, Khanna Publishers, New Delhi, 2004 CS601 MULTICORE PROGRAMMING L T P C 3 0 0 3 UNIT I INTRODUCTION TO MULTIPROCESSORS AND SCALABILITY

ISSUES 9 Scalable design principles – Principles of processor design – Instruction Level Parallelism, Thread level parallelism. Parallel computer models –- Symmetric and distributed shared memory architectures – Performance Issues – Multi-core Architectures - Software and hardware multithreading – SMT and CMP architectures – Design issues – Case studies – Intel Multi-core architecture – SUN CMP architecture.

84

UNIT II PARALLEL PROGRAMMING 9 Fundamental concepts – Designing for threads – scheduling - Threading and parallel programming constructs – Synchronization – Critical sections – Deadlock. Threading APIs.

UNIT III OPENMP PROGRAMMING 9 OpenMP – Threading a loop – Thread overheads – Performance issues – Library functions. Solutions to parallel programming problems – Data races, deadlocks and livelocks – Non-blocking algorithms – Memory and cache related issues.

UNIT IV MPI PROGRAMMING 9 MPI Model – collective communication – data decomposition – communicators and topologies – point-to-point communication – MPI Library.

UNIT V MULTITHREADED APPLICATION DEVELOPMENT 9 Algorithms, program development and performance tuning.

TOTAL: 45 HOURS

TEXT BOOKS:

1. Shameem Akhter and Jason Roberts, “Multi-core Programming”, Intel Press, 2006.

2. Michael J Quinn, Parallel programming in C with MPI and OpenMP, Tata Macgraw Hill, 2003.

REFERENCES: 1. John L. Hennessey and David A. Patterson, “ Computer architecture – A

quantitative approach”, Morgan Kaufmann/Elsevier Publishers, 4th. edition, 2007.

2. David E. Culler, Jaswinder Pal Singh, “Parallel computing architecture : A hardware/ software approach” , Morgan Kaufmann/Elsevier Publishers, 1999.

CS602 VISUAL PROGRAMMING L T P C 3 0 0 3 UNIT I 9 Windows Programming Fundamentals – MFC – Windows – Graphics – Menus – Mouse and keyboard – Bitmaps – Palettes – Device-Independent Bitmaps UNIT II 9 Controls – Modal and Modeless Dialog – Property – Data I/O – Sound – Timer

85

UNIT III 9 Memory management – SDI – MDI – MFC for Advanced windows user Interface – status bar and Toolbars – Tree view – List view – Threads UNIT IV 9 ODBC – MFC Database classes – DAO - DLLs – Working with Images UNIT V 9 COM Fundamentals – ActiveX control – ATL – Internet Programming TEXT BOOK:

1. Richard C.Leinecker and Tom Archer, “Visual C++ 6 Programming Bible”, Wiley DreamTech Press, 2006.

REFERENCES:

1. Lars Klander, “Core Visual C++ 6”, Pearson Education, 2000 2. Deital, DEital, Liperi and Yaeger “Visual V++ .NET How to Program” , Pearson

Education, 2004. IT64 EMBEDDED SYSTEMS L T P C 3 0 0 3 UNIT I EMBEDDED COMPUTING 9 Challenges of Embedded Systems – Embedded system design process. Embedded processors – 8051 Microcontroller, ARM processor – Architecture, Instruction sets and programming.

UNIT II MEMORY AND INPUT / OUTPUT MANAGEMENT 9 Programming Input and Output – Memory system mechanisms – Memory and I/O devices and interfacing – Interrupts handling. UNIT III PROCESSES AND OPERATING SYSTEMS 9 Multiple tasks and processes – Context switching – Scheduling policies – Interprocess communication mechanisms – Performance issues. UNIT IV EMBEDDED SOFTWARE 9 Programming embedded systems in assembly and C – Meeting real time constraints – Multi-state systems and function sequences. Embedded software development tools – Emulators and debuggers.

UNIT V EMBEDDED SYSTEM DEVELOPMENT 9 Design issues and techniques – Case studies – Complete design of example embedded systems.

TOTAL = 45

86

TEXT BOOKS: 1. Wayne Wolf, “Computers as Components: Principles of Embedded Computer

System Design”, Elsevier, 2006. 2. Michael J. Pont, “Embedded C”, Pearson Education , 2007.

REFERENCES:

1. Steve Heath, “Embedded System Design”, Elsevier, 2005. 2. Muhammed Ali Mazidi, Janice Gillispie Mazidi and Rolin D. McKinlay, “The 8051

Microcontroller and Embedded Systems”, Pearson Education, Second edition, 2007.

CS606 ADVANCED DATABASE TECHNOLOGY L T P C 3 0 0 3 UNIT I RELATIONAL MODEL ISSUES 9 ER Model - Normalization – Query Processing – Query Optimization - Transaction Processing - Concurrency Control – Recovery - Database Tuning.

UNIT II DISTRIBUTED DATABASES 9 Parallel Databases – Inter and Intra Query Parallelism – Distributed Database Features – Distributed Database Architecture – Fragmentation – Distributed Query Processing – Distributed Transactions Processing – Concurrency Control – Recovery – Commit Protocols. UNIT III OBJECT ORIENTED DATABASES 9 Introduction to Object Oriented Data Bases - Approaches - Modeling and Design - Persistence – Query Languages - Transaction - Concurrency – Multi Version Locks – Recovery – POSTGRES – JASMINE –GEMSTONE - ODMG Model.

UNIT IV EMERGING SYSTEMS 9 Enhanced Data Models - Client/Server Model - Data Warehousing and Data Mining - Web Databases – Mobile Databases- XML and Web Databases.

UNIT V CURRENT ISSUES 9 Rules - Knowledge Bases - Active and Deductive Databases - Multimedia Databases– Multimedia Data Structures – Multimedia Query languages - Spatial Databases.

TOTAL = 45 PERIODS TEXT BOOKS: 1. Thomas Connolly and Carlolyn Begg, “Database Systems, A Practical Approach to Design, Implementation and Management”, Third Edition, Pearson Education 2003.

87

REFERENCES: 1. R. Elmasri, S.B. Navathe, “Fundamentals of Database Systems”, Fifth Edition,

Pearson Education, 2006. 2. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, “Database System

Concepts”, Fifth Edition, Tata McGraw Hill, 2006. 3. C.J.Date, A.Kannan, S.Swamynathan, “An Introduction to Database Systems”,

Eighth Edition, Pearson Education, 2006. IT707 KNOWLEDGE MANAGEMENT L T P C

3 0 0 3

UNIT I KNOWLEDGE MANAGEMENT 9 KM Myths – KM Life Cycle – Understanding Knowledge – Knowledge, intelligence – Experience – Common Sense – Cognition and KM – Types of Knowledge – Expert Knowledge – Human Thinking and Learning.

UNIT II KNOWLEDGE MANAGEMENT SYSTEM LIFE CYCLE 9 Challenges in Building KM Systems – Conventional Vrs KM System Life Cycle (KMSLS) – Knowledge Creation and Knowledge Architecture – Nonaka’s Model of Knowledge Creation and Transformation. Knowledge Architecture.

UNIT III CAPTURING KNOWLEDGE 9 Evaluating the Expert – Developing a Relationship with Experts – Fuzzy Reasoning and the Quality of Knowledge – Knowledge Capturing Techniques, Brain Storming – Protocol Analysis – Consensus Decision Making – Repertory Grid- Concept Mapping – Blackboarding.

UNIT IV KNOWLEDGE CODIFICATION 9 Modes of Knowledge Conversion – Codification Tools and Procedures – Knowledge Developer’s Skill Sets – System Testing and Deployment – Knowledge Testing – Approaches to Logical Testing, User Acceptance Testing – KM System Deployment Issues – User Training – Post implementation.

UNIT V KNOWLEDGE TRANSFER AND SHARING 9 Transfer Methods – Role of the Internet – Knowledge Transfer in e-world – KM System Tools – Neural Network – Association Rules – Classification Trees – Data Mining and Business Intelligence – Decision Making Architecture – Data Management – Knowledge Management Protocols – Managing Knowledge Workers. TOTAL: 45 PERIODS TEXT BOOK:

1. Elias.M. Award & Hassan M. Ghaziri – “Knowledge Management” Pearson Education 2003.

88

REFERENCES:

1. Guus Schreiber, Hans Akkermans, Anjo Anjewierden, Robert de Hoog, Nigel Shadbolt, Walter Van de Velde and Bob Wielinga, “Knowledge Engineering and Management”, Universities Press, 2001.

2. C.W. Holsapple, “Handbooks on Knowledge Management”, International Handbooks on Information Systems, Vol 1 and 2, 2003

CS607 HIGH PERFORMANCE MICROPROCESSORS 3 0 0 3 AIM

To do a detailed study of CISC and RISC principles, study the architecture & special features of the Pentium processors and typical RISC processors and to study the architecture of special purpose processors.

OBJECTIVES To study the principles of CISC To study the Pentium processor family To study the principles of RISC To study the architecture & special features of typical RISC processors. To study the architecture & function of special purpose processors. UNIT I CISC PRINCIPLES 9 Classic CISC microprocessors, Intel x86 Family: Architecture - register set - Data formats - Addressing modes - Instruction set - Assembler directives – Interrupts - Segmentation, Paging, Real and Virtual mode execution – Protection mechanism, Task management 80186, 286, 386 and 486 architectures.

UNIT II PENTIUM PROCESSORS 10

Introduction to Pentium microprocessor – Special Pentium Registers – Pentium Memory Management – New Pentium instructions – Introduction to Pentium Pro and its special features – Architecture of Pentium-II, Pentium-III and Pentium4 microprocessors.

UNIT III RISC PRINCIPLES 10

RISC Vs CISC – RISC properties and evaluation – On chip register File Vs Cache evaluation – Study of a typical RISC processor – The PowerPC – Architecture & special features – Power PC 601 – IBM RS/6000, Sun SPARC Family – Architecture – Super SPARC.

UNIT IV RISC PROCESSOR 8

MIPS Rx000 family – Architecture – Special features – MIPS R4000 and R4400 – Motorola 88000 Family – Architecture – MC 88110 – MC 88100 and MC 88200.

UNIT V SPECIAL PURPOSE PROCESSORS 8

EPIC Architecture – ASIPs – Network Processors – DSPs – Graphics / Image Processors.

TOTAL : 45

89

TEXT BOOK

1. Daniel Tabak, “Advanced Microprocessors”, Tata McGraw-Hill, 1995, 2nd Edition.

REFERENCES 1. www.intel.com/products/server/processors/server/itanium2 (Unit V:EPIC) 2. www.hpl.hp.com/techreports/1999/HPL-1999-111.html (Unit V: Network

Processor) 3. www.intel.com/design/network/products/npfamily (Unit V: Network Processor) 4. www.national.com/appinfo/imaging/processors.html(Unit V: Image Processor) 5. Barry B.Brey, “The Intel Microprocessors, 8086/8088, 80186/80188, 80286,

80386, 80486, Pentium, PentiumPro Processor, PentiumII, PentiumIII, PentiumIV, Architecture, Programming & Interfacing”, 6th Edition, Pearson Education/PHI, 2002.

CS603 ADVANCED JAVA PROGRAMMING L T P C 3 0 0 3 AIM: To enable the students to design and develop enterprise strength distributed and multi-tier applications – Using Java Technology.

OBJECTIVES:

To learn advanced Java programming concepts like interface, threads,Swings etc.

To develop network programs in Java To understand Concepts needed for distributed and multi-tier applications To understand issues in enterprise applications development.

UNIT I JAVA FUNDAMENTALS 9 Java I/O streaming – filter and pipe streams – Byte Code interpretation - Threading – Swing. UNIT II NETWORK PROGRAMMING IN JAVA 9 Sockets – secure sockets – custom sockets – UDP datagrams – multicast sockets – URL classes – Reading Data from the server – writing data – configuring the connection – Reading the header – telnet application – Java Messaging services UNIT III APPLICATIONS IN DISTRIBUTED ENVIRONMENT 9 Remote method Invocation – activation models – RMI custom sockets – Object Serialization – RMI – IIOP implementation – CORBA – IDL technology – Naming Services – CORBA programming Models - JAR file creation

90

UNIT IV MULTI-TIER APPLICATION DEVELOPMENT 9 Server side programming – servlets – Java Server Pages - Applet to Applet communication – applet to Servlet communication - JDBC – Applications on databases – Multimedia streaming applications – Java Media Framework.

UNIT V ENTERPRISE APPLICATIONS 9 Server Side Component Architecture – Introduction to J2EE – Session Beans – Entity Beans – Persistent Entity Beans .

TOTAL: 45 PERIODS TEXT BOOKS:

1. Elliotte Rusty Harold, “ Java Network Programming”, O’Reilly publishers, 2000 (UNIT II)

2. Ed Roman, “Mastering Enterprise Java Beans”, John Wiley & Sons Inc., 1999. (UNIT III and UNIT V)

3. Hortsmann & Cornell, “CORE JAVA 2 ADVANCED FEATURES, VOL II”, Pearson Education, 2002. (UNIT I and UNIT IV)

REFERENCES:

1. Web reference: http://java.sun.com.

2. Patrick Naughton, “COMPLETE REFERENCE: JAVA2”, Tata McGraw-Hill, 2003.

CS604 PARALLEL PROGRAMMING L T P C

3 0 0 3 UNIT I PARALLEL PROGRAMMING 9 Introduction to parallel programming – data parallelism – functional parallelism – pipelining – Flynn's taxonomy – parallel algorithm design – task/channel model – Foster's design methodology – case studies: boundary value problem – finding the maximum – n-body problem – Speedup and efficiency – Amdahl's law – Gustafson-Barsis's Law – Karp-Flatt Metric – Isoefficiency metric UNIT II MESSAGE-PASSING PROGRAMMING 9 The message-passing model – the message-passing interface – MPI standard – basic concepts of MPI: MPI_Init, MPI_Comm_size, MPI_Comm_rank, MPI_Send, MPI_Recv, MPI_Finalize – timing the MPI programs: MPI_Wtime, MPI_Wtick – collective communication: MPI_Reduce, MPI_Barrier, MPI_Bcast, MPI_Gather, MPI_Scatter – case studies: the sieve of Eratosthenes, Floyd's algorithm, Matrix-vector multiplication UNIT III SHARED-MEMORY PROGRAMMING 9 Shared-memory model – OpenMP standard – parallel for loops – parallel for pragma – private variables – critical sections – reductions – parallel loop optimizations – general data parallelism – functional parallelism – case studies: the sieve of Eratosthenes, Floyd's algorithm, matrix-vector multiplication – distributed shared-memory programming – DSM primitives

91

UNIT IV PARALLEL ALGORITHMS – I 9 Monte Carlo methods – parallel random number generators – random number distributions – case studies – Matrix multiplication – rowwise block-stripped algorithm – Cannon's algorithm – solving linear systems – back substitution – Gaussian elimination – iterative methods – conjugate gradient method UNIT V PARALLEL ALGORITHMS – II 9 Sorting algorithms – quicksort – parallel quicksort – hyperquicksort – sorting by regular sampling – Fast fourier transform – combinatorial search – divide and conquer – parallel backtrack search – parallel branch and bound – parallel alpha-beta search TEXT BOOK: 1. Michael J. Quinn, “Parallel Programming in C with MPI and OpenMP”, Tata McGraw-Hill Publishing Company Ltd., 2003. REFERENCES:

1. B. Wilkinson and M. Allen, “Parallel Programming – Techniques and applications using networked workstations and parallel computers”, Second Edition, Pearson Education, 2005.

2. M. J. Quinn, “Parallel Computing – Theory and Practice”, Second Edition, Tata McGraw-Hill Publishing Company Ltd., 2002.

IT63 WEB TECHNOLOGY L T P C 3 0 0 3 UNIT I 9 Web Essentials: Clients, Servers, and Communication. The Internet-Basic Internet Protocols -The World Wide Web-HTTP request message-response message-Web Clients Web Servers-Case Study. Markup Languages: XHTML. An Introduction to HTML History-Versions-Basic XHTML Syntax and Semantics-Some Fundamental HTML Elements-Relative URLs-Lists-tables-Frames-Forms-XML Creating HTML Documents Case Study. UNIT II 9 Style Sheets: CSS-Introduction to Cascading Style Sheets-Features-Core Syntax-Style Sheets and HTML Style Rle Cascading and Inheritance-Text Properties-Box Model Normal Flow Box Layout-Beyond the Normal Flow-Other Properties-Case Study. Client-Side Programming: The JavaScript Language-History and Versions Introduction JavaScript in Perspective-Syntax-Variables and Data Types-Statements-Operators- Literals-Functions-Objects-Arrays-Built-in Objects-JavaScript Debuggers. UNIT III 9 Host Objects : Browsers and the DOM-Introduction to the Document Object Model DOM History and Levels-Intrinsic Event Handling-Modifying Element Style-The Document

92

Tree-DOM Event Handling-Accommodating Noncompliant Browsers Properties of window-Case Study. Server-Side Programming: Java Servlets- Architecture -Overview-A Servelet-Generating Dynamic Content-Life Cycle- Parameter Data-Sessions-Cookies-URL Rewriting-Other Capabilities-Data Storage Servlets and Concurrency-Case Study-Related Technologies. UNIT IV 9 Representing Web Data: XML-Documents and Vocabularies-Versions and Declaration-Namespaces JavaScript and XML: Ajax-DOM based XML processing Event-oriented Parsing: SAX-Transforming XML Documents-Selecting XML Data:XPATH-Template-based Transformations: XSLT-Displaying XML Documments in Browsers-Case Study-Related Technologies. Separating Programming and Presentation: JSP Technology Introduction-JSP and Servlets-Running JSP Applications Basic JSP-JavaBeans Classes and JSP-Tag Libraries and Files-Support for the Model-View-Controller Paradigm-Case Study-Related Technologies. UNIT V 9 Web Services: JAX-RPC-Concepts-Writing a Java Web Service-Writing a Java Web Service Client-Describing Web Services: WSDL- Representing Data Types: XML Schema-Communicating Object Data: SOAP Related Technologies-Software Installation-Storing Java Objects as Files-Databases and Java Servlets. TEXT BOOK: 1. Jeffrey C. Jackson, "Web Technologies--A Computer Science Perspective",

Pearson Education, 2006. REFERENCES: 1. Robert. W. Sebesta, "Programming the World Wide Web", Fourth Edition, Pearson Education, 2007 . 2. Deitel, Deitel, Goldberg, "Internet & World Wide Web How To Program", Third Edition, Pearson Education, 2006. 3. Marty Hall and Larry Brown,”Core Web Programming” Second Edition, Volume I and II, Pearson Education, 2001. 4. Bates, “Developing Web Applications”, Wiley, 2006. MG73 RESOURCE MANAGEMENT TECHNIQUES 3 0 0 3

1. LINEAR PROGRAMMING: 9 Principal components of decision problem – Modeling phases – LP Formulation and graphic solution – Resource allocation problems – Simplex method – Sensitivity analysis.

93

2. DUALITY AND NETWORKS: 9

Definition of dual problem – Primal – Dual relation ships – Dual simplex methods – Post optimality analysis – Transportation and assignment model shortest route problem. 3. INTEGER PROGRAMMING: 9 Cutting plan algorithm – Branch and bound methods, Multistage (Dynamic) programming. 4. CLASSICAL OPTIMISATION THEORY: 9 Unconstrained external problems, Newton – Ralphson method – Equality constraints – Jacobean methods – Lagrangian method – Kuhn – Tucker conditions – Simple problems. 5. OBJECT SCHEDULING: 9 Network diagram representation – Critical path method – Time charts and resource leveling – PERT.

TOTAL = 45 REFERNECES: 1. Anderson ‘Quantitative Methods for Business’, 8th Edition, Thomson Learning,

2002. 2. Winston ‘Operation Research’, Thomson Learning, 2003. 3. H.A.Taha, ‘Operation Research’, Prentice Hall of India, 2002. 4. Vohra, ‘Quantitative Techniques in Management’, Tata McGraw Hill, 2002. 5. Anand Sarma, ‘Operation Research’, Himalaya Publishing House, 2003.

CS701 DATA WAREHOUSING AND DATA MINING L T P C 3 0 0 3 UNIT I DATA WAREHOUSING 10 Data warehousing Components –Building a Data warehouse –- Mapping the Data Warehouse to a Multiprocessor Architecture – DBMS Schemas for Decision Support – Data Extraction, Cleanup, and Transformation Tools –Metadata. UNIT II BUSINESS ANALYSIS 8 Reporting and Query tools and Applications – Tool Categories – The Need for Applications – Cognos Impromptu – Online Analytical Processing (OLAP) – Need – Multidimensional Data Model – OLAP Guidelines – Multidimensional versus Multirelational OLAP – Categories of Tools – OLAP Tools and the Internet. UNIT III DATA MINING 8 Introduction – Data – Types of Data – Data Mining Functionalities – Interestingness of Patterns – Classification of Data Mining Systems – Data Mining Task Primitives – Integration of a Data Mining System with a Data Warehouse – Issues –Data Preprocessing.

94

UNIT IV ASSOCIATION RULE MINING AND CLASSIFICATION 11 Mining Frequent Patterns, Associations and Correlations – Mining Methods – Mining Various Kinds of Association Rules – Correlation Analysis – Constraint Based Association Mining – Classification and Prediction - Basic Concepts - Decision Tree Induction - Bayesian Classification – Rule Based Classification – Classification by Backpropagation – Support Vector Machines – Associative Classification – Lazy Learners – Other Classification Methods - Prediction UNIT V CLUSTERING AND APPLICATIONS AND TRENDS IN DATA MINING 8 Cluster Analysis - Types of Data – Categorization of Major Clustering Methods - K-means – Partitioning Methods – Hierarchical Methods - Density-Based Methods –Grid Based Methods – Model-Based Clustering Methods – Clustering High Dimensional Data - Constraint – Based Cluster Analysis – Outlier Analysis – Data Mining Applications.

TEXT BOOKS: 1. Alex Berson and Stephen J. Smith, “ Data Warehousing, Data Mining & OLAP”,

Tata McGraw – Hill Edition, Tenth Reprint 2007. 2. Jiawei Han and Micheline Kamber, “Data Mining Concepts and Techniques”,

Second Edition, Elsevier, 2007.

REFERENCES: 1. Pang-Ning Tan, Michael Steinbach and Vipin Kumar, “ Introduction To Data

Mining”, Person Education, 2007. 2. K.P. Soman, Shyam Diwakar and V. Ajay “, Insight into Data mining Theory and

Practice”, Easter Economy Edition, Prentice Hall of India, 2006. 3. G. K. Gupta, “ Introduction to Data Mining with Case Studies”, Easter Economy

Edition, Prentice Hall of India, 2006. 4. Daniel T.Larose, “Data Mining Methods and Models”, Wile-Interscience, 2006.

CS702 REAL TIME SYSTEMS L T P C 3 0 0 3 UNIT I INTRODUCTION 9 Introduction - Issues in Real Time Computing, Structure of a Real Time System. Task Classes, Performance Measures for Real Time Systems, Estimating Program Run times. Task Assignment and Scheduling - Classical Uniprocessor scheduling algorithms, UniProcessor scheduling of IRIS Tasks, Task Assignment, Mode Changes, and Fault Tolerant Scheduling.

UNIT II PROGRAMMING LANGUAGES AND TOOLS 9 Programming Language and Tools – Desired Language characteristics, Data Typing, Control structures, Facilitating Hierarchical Decomposition, Packages, Run-time (Exception) Error handling, Overloading and Generics, Multitasking, Low Level programming, Task scheduling, Timing Specifications, Programming Environments, Run-time Support.

95

UNIT III REAL TIME DATABASES 9 Real time Databases - Basic Definition, Real time Vs General Purpose Databases, Main Memory Databases, Transaction priorities, Transaction Aborts, Concurrency Control Issues, Disk Scheduling Algorithms, Two-phase Approach to improve Predictability, Maintaining Serialization Consistency, Databases for Hard Real Time systems.

UNIT IV COMMUNICATION 9 Real-Time Communication - Communications Media, Network Topologies Protocols, Fault Tolerant Routing. Fault Tolerance Techniques - Fault Types, Fault Detection. Fault Error containment Redundancy, Data Diversity, Reversal Checks, Integrated Failure handling.

UNIT V EVALUATION TECHNIQUES 9 Reliability Evaluation Techniques - Obtaining Parameter Values, Reliability Models for Hardware Redundancy, Software Error models. Clock Synchronization - Clock, A Nonfault-Tolerant Synchronization Algorithm, Impact of Faults, Fault Tolerant Synchronization in Hardware, Fault Tolerant Synchronization in Software TOTAL= 45

TEXT BOOKS: 1. C.M. Krishna, Kang G. Shin, “Real-Time Systems”, McGraw-Hill International

Editions, 1997.

REFERENCES: 1. Stuart Bennett, “Real Time Computer Control-An Introduction”,Second edition

Perntice Hall PTR, 1994. 2. Peter D. Lawrence, “Real time Micro Computer System Design – An

Introduction”, McGraw Hill, 1988. 3. S.T. Allworth and R.N. Zobel, “Introduction to real time software design”,

Macmillan, II Edition, 1987. 4. R.J.A Buhur, D.L. Bailey, “ An Introduction to Real-Time Systems”, Prentice-Hall

International, 1999. 5. Philip.A.Laplante “Real Time System Design and Analysis” PHI , III Edition, April

2004. CS703 TCP/IP DESIGN AND IMPLEMENTATION L T P C 3 0 0 3 UNIT I INTRODUCTION 9 Internetworking concepts and architecture model – classful Internet address – CIDR – Subnetting and Supernetting – AARP – RARP- IP- IP Routing – ICMP – IPV6.

96

UNIT II TCP 9 Services – header – connection establishment and termination – interactive data flow – bulk data flow – timeout and retransmission – persist timer – keep alive timer – futures and performance. UNIT III IP IMPLEMENTATION 9 IP global software organization – routing table – routing algorithms – fragmentation and reassembly – error processing (ICMP) – Multicast Processing (IGMP). UNIT IV TCP IMPLEMENTATION I 9 Data structure and input processing – transmission control blocks – segment format – comparision – finite state machine implementation – Output processing – mutual exclusion – computing the TCP Data length. UNIT V TCP IMPLEMENTATION II 9 Timers – events and messages – timer process – deleting and inserting timer event – flow control and adaptive retransmission – congestion avoidance and control – urgent data processing and push function. TEXT BOOKS: 1. Douglas E Comer,”Internetworking with TCP/IP Principles,Protocols and Architecture”,Vol 1 and 2, Vth Edition 2. W.Richard Stevans “TCP/IP Illustrated” Vol 1.2003. REFERENCES: 1. Forouzan, “ TCP/IP Protocol Suite” Second Edition, Tate MC Graw Hill, 2003. 2. W.Richard Stevens “TCP/IP Illustrated” Volume 2, Pearson Education 2003 CS706 C# AND .NET FRAMEWORK L T P C 3 0 0 3 UNIT I 9 Review of OOP Concepts - Overview of .NET Framework - Basic Elements of C# - Program Structure and simple Input and Output Operations – Operators and Expressions – Statements – Arrays and Structures. UNIT II 9 Inheritance - Namespace – Polymorphism – Interface and Overloading – Multiple Inheritance – Property – Indexes – Delegates – Publish/Subscribe Design Patterns-Operator Overloading-Method Overloading UNIT II 9 C# Concepts for creating Data Structures - File Operation – File Management systems – Stream Oriented Operations- Multitasking – Multithreading – Thread Operation – Synchronization.

97

UNIT IV 9 Working with XML – Techniques for Reading and Writing XML Data - Using XPath and Search XML - ADO.NET Architecture – ADO.NET Connected and Disconnected Models – XML and ADO.NET – Simple and Complex Data Binding– Data Grid View Class. UNIT V 9 Application Domains – Remoting – Leasing and Sponsorship - .NET Coding Design Guidelines –Assemblies – Security – Application Development – Web Services - Building an XML Web Service - Web Service Client – WSDL and SOAP – Web Service with Complex Data Types – Web Service Performance.

TOTAL = 45

TEXT BOOKS:

1. S. Thamarai Selvi and R. Murugesan “A Textbook on C# “, Pearson Education,2003.

2. Stephen C. Perry “ Core C# and .NET”, Pearson Education,2006. REFERENCES:

1. Jesse Liberty, “Programming C#”, Second Edition, O’Reilly Press, 2002. 2. Robinson et al, “Professional C#”, Fifth Edition, Wrox Press, 2002. 3. Herbert Schildt, “The Complete Reference: C#”, Tata McGraw Hill, 2004. 4. Andrew Troelsen, “C# and the .NET Platform”, A! Press, 2003. 5. Thuan Thai and Hoang Q. Lam, “. NET Framework Essentials”, Second

Edition, O’Reilly, 2002. IT62 CRYPTOGRAPHY AND NETWORK SECURITY L T P C

3 1 0 4 UNIT I 9 Security trends – Attacks and services – Classical crypto systems – Different types of ciphers – LFSR sequences – Basic Number theory – Congruences – Chinese Remainder theorem – Modular exponentiation – Fermat and Euler's theorem – Legendre and Jacobi symbols – Finite fields – continued fractions. UNIT II 9 Simple DES – Differential cryptoanalysis – DES – Modes of operation – Triple DES – AES – RC4 – RSA – Attacks – Primality test – factoring. UNIT III 9 Discrete Logarithms – Computing discrete logs – Diffie-Hellman key exchange – ElGamal Public key cryptosystems – Hash functions – Secure Hash – Birthday attacks - MD5 – Digital signatures – RSA – ElGamal – DSA. UNIT IV 9 Authentication applications – Kerberos, X.509, PKI – Electronic Mail security – PGP, S/MIME – IP security – Web Security – SSL, TLS, SET.

98

UNIT V 9 System security – Intruders – Malicious software – viruses – Firewalls – Security Standards. TEXT BOOKS: 1. Wade Trappe, Lawrence C Washington, “ Introduction to Cryptography with coding

theory”, 2nd ed, Pearson, 2007. 2. William Stallings, “Crpyptography and Network security Principles and Practices”, Pearson/PHI, 4th ed, 2006. REFERENCES: 1. W. Mao, “Modern Cryptography – Theory and Practice”, Pearson Education, Second Edition, 2007. 2. Charles P. Pfleeger, Shari Lawrence Pfleeger – Security in computing Third Edition – Prentice Hall of India, 2006

99

CS704 NATURAL LANGUAGE PROCESSING L T P C 3 0 0 3 UNIT I 9 Introduction – Models -and Algorithms - The Turing Test -Regular Expressions Basic Regular Expression Patterns -Finite State Automata -Regular Languages and FSAs – Morphology -Inflectional Morphology - Derivational Morphology -Finite-State Morphological Parsing - Combining an FST Lexicon and Rules -Porter Stemmer UNIT II 9 N-grams Models of Syntax - Counting Words - Unsmoothed N-grams – Smoothing-Backoff - Deleted Interpolation – Entropy - English Word Classes - Tagsets for English -Part of Speech Tagging -Rule-Based Part of Speech Tagging - Stochastic Part of Speech Tagging - Transformation-Based Tagging - UNIT III 9 Context Free Grammars for English Syntax- Context-Free Rules and Trees - Sentence-Level Constructions –Agreement – Sub Categorization – Parsing – Top-down – Earley Parsing -Feature Structures - Probabilistic Context-Free Grammars UNIT IV 9 Representing Meaning - Meaning Structure of Language - First Order Predicate Calculus - Representing Linguistically Relevant Concepts -Syntax-Driven Semantic Analysis -Semantic Attachments - Syntax-Driven Analyzer - Robust Analysis - Lexemes and Their Senses - Internal Structure - Word Sense Disambiguation -Information Retrieval UNIT V 9 Discourse -Reference Resolution - Text Coherence -Discourse Structure - Dialog and Conversational Agents - Dialog Acts – Interpretation – Coherence -Conversational Agents - Language Generation – Architecture -Surface Realizations - Discourse Planning – Machine Translation -Transfer Metaphor – Interlingua – Statistical Approaches TEXT BOOKS:

1. D. Jurafsky and J. Martin “Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition”,

2. C. Manning and H. Schutze, “Foundations of Statistical Natural Language Processing”,

REFERENCE:

1. James Allen. “Natural Language Understanding”, Addison Wesley, 1994.

100

IT805 SYSTEM MODELING AND SIMULATION L T P C

3 0 0 3 UNIT I INTRODUCTION TO SIMULATION 9 Introduction – Simulation Terminologies- Application areas – Model Classification – Types of Simulation- Steps in a Simulation study- Concepts in Discrete Event Simulation - Simulation Examples

UNIT II MATHEMATICAL MODELS 9 Statistical Models - Concepts – Discrete Distribution- Continuous Distribution – Poisson Process- Empirical Distributions- Queueing Models – Characteristics- Notation – Queueing Systems – Markovian Models- Properties of random numbers- Generation of Pseudo Random numbers- Techniques for generating random numbers-Testing random number generators- Generating Random-Variates- Inverse Transform technique – Acceptance- Rejection technique – Composition & Convolution Method.

UNIT III ANALYSIS OF SIMULATION DATA 9 Input Modeling - Data collection - Assessing sample independence - Hypothesizing distribution family with data - Parameter Estimation - Goodness-of-fit tests - Selecting input models in absence of data- Output analysis for a Single system – Terminating Simulations – Steady state simulations. UNIT IV VERIFICATION AND VALIDATION 9 Model Building – Verification of Simulation Models – Calibration and Validation of Models – Validation of Model Assumptions – Validating Input – Output Transformations.

UNIT V SIMULATION OF COMPUTER SYSTEMS AND CASE STUDIES 9 Simulation Tools – Model Input – High level computer system simulation – CPU – Memory Simulation – Comparison of systems via simulation – Simulation Programming techniques - Development of Simulation models.

TEXT BOOKS: 1. Jerry Banks and John Carson, “ Discrete Event System Simulation”, Fourth

Edition, PHI, 2005.

2. Geoffrey Gordon, “System Simulation”, Second Edition, PHI, 2006 (Unit – V).

REFERENCES: 1. Frank L. Severance, “ System Modeling and Simulation”, Wiley, 2001.

2. Averill M. Law and W.David Kelton, “ Simulation Modeling and Analysis, Third Edition, McGraw Hill, 2006.

3. Jerry Banks, “Handbook of Simulation: Principles, Methodology, Advances, Applications and Practice”, Wiley, 1998.

101

IT604 USER INTERFACE DESIGN L T P C

3 0 0 3 UNIT I INTRODUCTION 8 Human–Computer Interface – Characteristics Of Graphics Interface –Direct Manipulation Graphical System – Web User Interface –Popularity –Characteristic & Principles. UNIT II HUMAN COMPUTER INTERACTION 10 User Interface Design Process – Obstacles –Usability –Human Characteristics In Design – Human Interaction Speed –Business Functions –Requirement Analysis – Direct – Indirect Methods – Basic Business Functions – Design Standards – System Timings – Human Consideration In Screen Design – Structures Of Menus – Functions Of Menus– Contents Of Menu– Formatting – Phrasing The Menu – Selecting Menu Choice– Navigating Menus– Graphical Menus. UNIT III WINDOWS 9 Characteristics– Components– Presentation Styles– Types– Managements– Organizations– Operations– Web Systems– Device– Based Controls Characteristics– Screen – Based Controls – Operate Control – Text Boxes– Selection Control– Combination Control– Custom Control– Presentation Control.

UNIT IV MULTIMEDIA 9 Text For Web Pages – Effective Feedback– Guidance & Assistance– Internationalization– Accesssibility– Icons– Image– Multimedia – Coloring. UNIT V WINDOWS LAYOUT– TEST 9 Prototypes – Kinds Of Tests – Retest – Information Search – Visualization – Hypermedia – WWW– Software Tools.

TOTAL= 45 TEXT BOOKS: 1. Wilbent. O. Galitz ,“The Essential Guide To User Interface Design”, John Wiley&

Sons, 2001. 2. Ben Sheiderman, “Design The User Interface”, Pearson Education, 1998. REFERENCES: 1. Alan Cooper, “The Essential Of User Interface Design”, Wiley – Dream Tech Ltd.,

2002.

102

GE71 TOTAL QUALITY MANAGEMENT L T P M 3 0 0 3 UNIT I INTRODUCTION 9 Introduction - Need for quality - Evolution of quality - Definition of quality - Dimensions of manufacturing and service quality - Basic concepts of TQM - Definition of TQM – TQM Framework - Contributions of Deming, Juran and Crosby – Barriers to TQM. UNIT II TQM PRINCIPLES 9 Leadership – Strategic quality planning, Quality statements - Customer focus – Customer orientation, Customer satisfaction, Customer complaints, Customer retention - Employee involvement – Motivation, Empowerment, Team and Teamwork, Recognition and Reward, Performance appraisal - Continuous process improvement – PDSA cycle, 5s, Kaizen - Supplier partnership – Partnering, Supplier selection, Supplier Rating.

UNIT III TQM TOOLS & TECHNIQUES I 9 The seven traditional tools of quality – New management tools – Six-sigma: Concepts, methodology, applications to manufacturing, service sector including IT – Bench marking – Reason to bench mark, Bench marking process – FMEA – Stages, Types.

UNIT IV TQM TOOLS & TECHNIQUES II 9 Quality circles – Quality Function Deployment (QFD) – Taguchi quality loss function – TPM – Concepts, improvement needs – Cost of Quality – Performance measures.

UNIT V QUALITY SYSTEMS 9 Need for ISO 9000- ISO 9000-2000 Quality System – Elements, Documentation, Quality auditing- QS 9000 – ISO 14000 – Concepts, Requirements and Benefits – Case studies of TQM implementation in manufacturing and service sectors including IT.

TOTAL: 45 PERIODS TEXT BOOK: 1. Dale H.Besterfiled, et at., “Total Quality Management”, Pearson Education Asia, 3rd Edition, Indian Reprint (2006).

REFERENCES: 1. James R. Evans and William M. Lindsay, “The Management and Control of

Quality”, 6th Edition, South-Western (Thomson Learning), 2005. 2. Oakland, J.S., “TQM – Text with Cases”, Butterworth – Heinemann Ltd., Oxford,

3rd Edition, 2003. 3. Suganthi,L and Anand Samuel, “Total Quality Management”, Prentice Hall

(India) Pvt. Ltd.,2006. 4. Janakiraman, B and Gopal, R.K, “Total Quality Management – Text and Cases”,

Prentice Hall (India) Pvt. Ltd., 2006.

103

IT61 NETWORK PROGRAMMING AND MANAGEMENT L T P C 3 0 0 3

UNIT I ELEMENTARY TCP SOCKETS 9 Introduction to Socket Programming – Overview of TCP/IP Protocols –Introduction to Sockets – Socket address Structures – Byte ordering functions – address conversion functions – Elementary TCP Sockets – socket, connect, bind, listen, accept, read, write, close functions – Iterative Server – Concurrent Server.

UNIT II APPLICATION DEVELOPMENT 9 TCP Echo Server – TCP Echo Client – Posix Signal handling – Server with multiple clients – boundary conditions: Server process Crashes, Server host Crashes, Server Crashes and reboots, Server Shutdown – I/O multiplexing – I/O Models – select function – shutdown function – TCP echo Server (with multiplexing) – poll function – TCP echo Client (with Multiplexing). UNIT III SOCKET OPTIONS, ELEMENTARY UDP SOCKETS 9 Socket options – getsocket and setsocket functions – generic socket options – IP socket options – ICMP socket options – TCP socket options – Elementary UDP sockets – UDP echo Server – UDP echo Client – Multiplexing TCP and UDP sockets – Domain name system – gethostbyname function – Ipv6 support in DNS – gethostbyadr function – getservbyname and getservbyport functions. UNIT IV ADVANCED SOCKETS 9 Ipv4 and Ipv6 interoperability – threaded servers – thread creation and termination – TCP echo server using threads – Mutexes – condition variables – raw sockets – raw socket creation – raw socket output – raw socket input – ping program – trace route program. UNIT V SIMPLE NETWORK MANAGEMENT 9 SNMP network management concepts – SNMP management information – standard MIB’s – SNMPv1 protocol and Practical issues – introduction to RMON, SNMPv2 and SNMPv3. TOTAL = 45 PERIODS TEXT BOOKS: 1. W. Richard Stevens, “Unix Network Programming Vol-I”, Second Edition, Pearson

Education, 1998. 2. Mani Subramaniam, “Network Management: Principles and Practice“, Addison

Wesley”, First Edition, 2001. REFERENCES: 1. D.E. Comer, “Internetworking with TCP/IP Vol- III”, (BSD Sockets Version), Second

Edition, Pearson Education, 2003.

104

2. William Stallings, “SNMP, SNMPv2, SNMPv3 and RMON 1 and 2”, Third Edition, Addison Wesley, 1999.

IT702 SOFTWARE TESTING L T P C 3 0 0 3

UNIT I INTRODUCTION 9 Testing as an Engineering Activity – Role of Process in Software Quality – Testing as a Process – Basic Definitions – Software Testing Principles – The Tester’s Role in a Software Development Organization – Origins of Defects – Defect Classes – The Defect Repository and Test Design – Defect Examples – Developer/Tester Support for Developing a Defect Repository.

UNIT II TEST CASE DESIGN 9 Introduction to Testing Design Strategies – The Smarter Tester – Test Case Design Strategies – Using Black Box Approach to Test Case Design Random Testing – Requirements based testing – positive and negative testing -–– Boundary Value Analysis – decision tables - Equivalence Class Partitioning state-based testing– cause-effect graphing – error guessing - compatibility testing – user documentation testing – domain testing Using White–Box Approach to Test design – Test Adequacy Criteria – static testing vs. structural testing – code functional testing - Coverage and Control Flow Graphs – Covering Code Logic – Paths – Their Role in White–box Based Test Design – code complexity testing – Evaluating Test Adequacy Criteria.

UNIT III LEVELS OF TESTING 9 The Need for Levels of Testing – Unit Test – Unit Test Planning –Designing the Unit Tests. The Test Harness – Running the Unit tests and Recording results – Integration tests – Designing Integration Tests – Integration Test Planning – scenario testing – defect bash elimination -System Testing – types of system testing - Acceptance testing – performance testing - Regression Testing – internationalization testing – ad-hoc testing - Alpha – Beta Tests – testing OO systems – usability and accessibility testing

UNIT IV TEST MANAGEMENT 9 People and organizational issues in testing – organization structures for testing teams – testing services - Test Planning – Test Plan Components – Test Plan Attachments – Locating Test Items – test management – test process - Reporting Test Results – The role of three groups in Test Planning and Policy Development – Introducing the test specialist – Skills needed by a test specialist – Building a Testing Group.

UNIT V CONTROLLING AND MONITORING 9 Software test automation – skills needed for automation – scope of automation – design and architecture for automation – requirements for a test tool – challenges in automation - Test metrics and measurements –project, progress and productivity metrics – Status Meetings – Reports and Control Issues – Criteria for Test Completion – SCM – Types of reviews – Developing a review program – Components of Review Plans– Reporting Review Results. – evaluating software quality – defect prevention – testing maturity model

105

TOTAL = 45 TEXT BOOKS:

1. Srinivasan Desikan and Gopalaswamy Ramesh, “ Software Testing – Principles and Practices”, Pearson education, 2006.

2. Aditya P.Mathur, “Foundations of Software Testing”, Pearson Education,2008. REFERENCES: 1. Boris Beizer, “Software Testing Techniques”, Second Edition,Dreamtech, 2003

2. Elfriede Dustin, “Effective Software Testing”, First Edition, Pearson Education, 2003.

3. Renu Rajani, Pradeep Oak, “Software Testing – Effective Methods, Tools and Techniques”, Tata McGraw Hill, 2004.

IT71 SERVICE ORIENTED ARCHITECTURE L T P C

3 0 0 3 OBJECTIVES:

To gain understanding of the basic principles of service orientation To learn service oriented analysis techniques To learn technology underlying the service design To learn advanced concepts such as service composition, orchestration and

Choreography To know about various WS-* specification standards

UNIT I 9 Roots of SOA – Characteristics of SOA - Comparing SOA to client-server and distributed internet architectures – Anatomy of SOA- How components in an SOA interrelate - Principles of service orientation UNIT II 9 Web services – Service descriptions – Messaging with SOAP –Message exchange Patterns – Coordination –Atomic Transactions – Business activities – Orchestration – Choreography - Service layer abstraction – Application Service Layer – Business Service Layer – Orchestration Service Layer UNIT III 9 Service oriented analysis – Business-centric SOA – Deriving business services- service modeling - Service Oriented Design – WSDL basics – SOAP basics – SOA composition guidelines – Entity-centric business service design – Application service design – Task-centric business service design UNIT IV 9 SOA platform basics – SOA support in J2EE – Java API for XML-based web services (JAX-WS) - Java architecture for XML binding (JAXB) – Java API for XML Registries

106

(JAXR) - Java API for XML based RPC (JAX-RPC)- Web Services Interoperability Technologies (WSIT) - SOA support in .NET – Common Language Runtime - ASP.NET web forms – ASP.NET web services – Web Services Enhancements (WSE) UNIT V 9 WS-BPEL basics – WS-Coordination overview - WS-Choreography, WS-Policy, WS-Security

Total Hours: 45 TEXT BOOK:

1. Thomas Erl, “Service-Oriented Architecture: Concepts, Technology, and Design”, Pearson Education, 2005.

REFERENCES:

1. Thomas Erl, “SOA Principles of Service Design “(The Prentice Hall Service-Oriented Computing Series from Thomas Erl), 2005.

2. Newcomer, Lomow, “Understanding SOA with Web Services”, Pearson Education, 2005.

3. Sandeep Chatterjee, James Webber, “Developing Enterprise Web Services, An Architect’s Guide”, Pearson Education, 2005.

4. Dan Woods and Thomas Mattern, “ Enterprise SOA Designing IT for Business Innovation” O’REILLY, First Edition, 2006

CS705 ADVANCED OPERATING SYSTEMS 3 0 0 3 AIM To understand the principles in the design of modern operating systems, distributed and multiprocessor operating systems OBJECTIVES

To get a comprehensive knowledge of the architecture of distributed systems. To understand the deadlock and shared memory issues and their solutions in

distributed environments. To know the security issues and protection mechanisms for distributed

environments. To get a knowledge of multiprocessor operating system and database operating

systems. UNIT I 9 Architectures of Distributed Systems - System Architecture types - issues in distributed operating systems - communication networks – communication primitives. Theoretical Foundations - inherent limitations of a distributed system – lamp ports logical clocks – vector clocks – casual ordering of messages – global state – cuts of a distributed computation – termination detection. Distributed Mutual Exclusion – introduction – the classification of mutual exclusion and associated algorithms – a comparative performance analysis.

107

UNIT II 9 Distributed Deadlock Detection -Introduction - deadlock handling strategies in distributed systems – issues in deadlock detection and resolution – control organizations for distributed deadlock detection – centralized and distributed deadlock detection algorithms –hierarchical deadlock detection algorithms. Agreement protocols – introduction-the system model, a classification of agreement problems, solutions to the Byzantine agreement problem, applications of agreement algorithms. Distributed resource management: introduction-architecture – mechanism for building distributed file systems – design issues – log structured file systems. UNIT III 9 Distributed shared memory-Architecture– algorithms for implementing DSM – memory coherence and protocols – design issues. Distributed Scheduling – introduction – issues in load distributing – components of a load distributing algorithm – stability – load distributing algorithm – performance comparison – selecting a suitable load sharing algorithm – requirements for load distributing -task migration and associated issues. Failure Recovery and Fault tolerance: introduction– basic concepts – classification of failures – backward and forward error recovery, backward error recovery- recovery in concurrent systems – consistent set of check points – synchronous and asynchronous check pointing and recovery – check pointing for distributed database systems- recovery in replicated distributed databases. UNIT IV 9 Protection and security -preliminaries, the access matrix model and its implementations.-safety in matrix model- advanced models of protection. Data security – cryptography: Model of cryptography, conventional cryptography- modern cryptography, private key cryptography, data encryption standard- public key cryptography – multiple encryption – authentication in distributed systems. UNIT-V 9 Multiprocessor operating systems - basic multiprocessor system architectures – inter connection networks for multiprocessor systems – caching – hypercube architecture. Multiprocessor Operating System - structures of multiprocessor operating system, operating system design issues- threads- process synchronization and scheduling. Database Operating systems :Introduction- requirements of a database operating system Concurrency control : theoretical aspects – introduction, database systems – a concurrency control model of database systems- the problem of concurrency control – serializability theory- distributed database systems, concurrency control algorithms – introduction, basic synchronization primitives, lock based algorithms-timestamp based algorithms, optimistic algorithms – concurrency control algorithms, data replication.

TOTAL : 45

108

TEXT BOOK 1. Mukesh Singhal, Niranjan G.Shivaratri, "Advanced concepts in operating

systems: Distributed, Database and multiprocessor operating systems", TMH, 2001 REFERENCES

1. Andrew S.Tanenbaum, "Modern operating system", PHI, 2003 2. Pradeep K.Sinha, "Distributed operating system-Concepts and design", PHI,

2003. 3. Andrew S.Tanenbaum, "Distributed operating system", Pearson education, 2003

GE609 INTELLECTUAL PROPERTY RIGHTS (IPR) L T P C

3 0 0 3 UNIT I 5 Introduction – Invention and Creativity – Intellectual Property (IP) – Importance – Protection of IPR – Basic types of property (i). Movable Property ii. Immovable Property and iii. Intellectual Property. UNIT II 10 IP – Patents – Copyrights and related rights – Trade Marks and rights arising from Trademark registration – Definitions – Industrial Designs and Integrated circuits – Protection of Geographical Indications at national and International levels – Application Procedures..

UNIT III 10 International convention relating to Intellectual Property – Establishment of WIPO – Mission and Activities – History – General Agreement on Trade and Tariff (GATT). UNIT IV 10 Indian Position Vs WTO and Strategies – Indian IPR legislations – commitments to WTO-Patent Ordinance and the Bill – Draft of a national Intellectual Property Policy – Present against unfair competition. UNIT V 10 Case Studies on – Patents (Basumati rice, turmeric, Neem, etc.) – Copyright and related rights – Trade Marks – Industrial design and Integrated circuits – Geographic indications – Protection against unfair competition.

TOTAL: 45 PERIDOS TEXT BOOKS:

109

1. Subbaram N.R. “Handbook of Indian Patent Law and Practice “, S. Viswanathan Printers and Publishers Pvt. Ltd., 1998.

REFERENCES:

1. Eli Whitney, United States Patent Number: 72X, Cotton Gin, March 14, 1794. 2. Intellectual Property Today: Volume 8, No. 5, May 2001, [www.iptoday.com]. 3. Using the Internet for non-patent prior art searches, Derwent IP Matters, July

2000. www.ipmatters.net/features/000707_gibbs.html. CS201 GRAPH THEORY L T P C

3 0 0 3

UNIT I NTRODUCTION 9 Graphs – Introduction – Isomorphism – Sub graphs – Walks, Paths, Circuits – Connectedness – Components – Euler Graphs – Hamiltonian Paths and Circuits – Trees – Properties of trees – Distance and Centers in Tree – Rooted and Binary Trees. UNIT II TREES, CONNECTIVITY, PLANARITY 9 Spanning trees – Fundamental Circuits – Spanning Trees in a Weighted Graph – Cut Sets – Properties of Cut Set – All Cut Sets – Fundamental Circuits and Cut Sets – Connectivity and Separability – Network flows – 1-Isomorphism – 2-Isomorphism – Combinational and Geometric Graphs – Planer Graphs – Different Representation of a Planer Graph. UNIT III MATRICES, COLOURING AND DIRECTED GRAPH 9 Incidence matrix – Submatrices – Circuit Matrix – Path Matrix – Adjacency Matrix – Chromatic Number – Chromatic partitioning – Chromatic polynomial – Matching – Covering – Four Color Problem – Directed Graphs – Types of Directed Graphs – Digraphs and Binary Relations – Directed Paths and Connectedness – Euler Graphs – Adjacency Matrix of a Digraph. UNIT IV ALGORITHMS 9 Algorithms: Connectedness and Components – Spanning tree – Finding all Spanning Trees of a Graph – Set of Fundamental Circuits – Cut Vertices and Separability – Directed Circuits. UNIT V ALGORITHMS 9 Algorithms: Shortest Path Algorithm – DFS – Planarity Testing – Isomorphism.

TOTAL = 45

TEXT BOOKS: 1. Narsingh Deo, “Graph Theory: With Application to Engineering and Computer

Science”, Prentice Hall of India, 2003. REFERENCES:

110

1. R.J. Wilson, “Introduction to Graph Theory”, Fourth Edition, Pearson Education, 2003.

IT706 INFORMATION SECURITY 3 0 0 3

AIM To study the critical need for ensuring Information Security in Organizations OBJECTIVES 1. To understand the basics of Information Security 2. To know the legal, ethical and professional issues in Information Security 3. To know the aspects of risk management 4. To become aware of various standards in this area 5. To know the technological aspects of Information Security

UNIT 1 INTRODUCTION 9

History, What is Information Security?, Critical Characteristics of Information, NSTISSC Security Model, Components of an Information System, Securing the Components, Balancing Security and Access, The SDLC, The Security SDLC

UNIT II SECURITY INVESTIGATION 9 Need for Security, Business Needs, Threats, Attacks, Legal, Ethical and Professional Issues UNIT III SECURITY ANALYSIS 9 Risk Management: Identifying and Assessing Risk, Assessing and Controlling Risk UNIT IV LOGICAL DESIGN 9 Blueprint for Security, Information Security Poicy, Standards and Practices, ISO 17799/BS 7799, NIST Models, VISA International Security Model, Design of Security Architecture, Planning for Continuity UNIT V PHYSICAL DESIGN 9

Security Technology, IDS, Scanning and Analysis Tools, Cryptography, Access Control Devices, Physical Security, Security and Personnel

TOTAL : 45 TEXT BOOK

1. Michael E Whitman and Herbert J Mattord, “Principles of Information Security”, Vikas Publishing House, New Delhi, 2003

REFERENCES

1. Micki Krause, Harold F. Tipton, “ Handbook of Information Security Management”, Vol 1-3 CRC Press LLC, 2004.

111

2. Stuart Mc Clure, Joel Scrambray, George Kurtz, “Hacking Exposed”, Tata McGraw-Hill, 2003

3. Matt Bishop, “ Computer Security Art and Science”, Pearson/PHI, 2002. CS807 HIGH SPEED NETWORKS L T P C

3 0 0 3 UNIT I HIGH SPEED NETWORKS 9 Frame Relay Networks – Asynchronous transfer mode – ATM Protocol Architecture, ATM logical Connection – ATM Cell – ATM Service Categories – AAL. High Speed LAN’s: Fast Ethernet – Gigabit Ethernet– Fibre Channel – Wireless LAN’s, WiFi and WiMax Networks applications, requirements – Architecture of 802.11. UNIT II CONGESTION AND TRAFFIC MANAGEMENT 8 Queuing Analysis – Queuing Models – Single Server Queues – Effects of Congestion – Congestion Control – Traffic Management – Congestion Control in Packet Switching Networks – Frame Relay Congestion Control.

UNIT III TCP AND ATM CONGESTION CONTROL 12 TCP Flow control – TCP Congestion Control – Retransmission – Timer Management – Exponential RTO backoff – KARN’s Algorithm – Window management – Performance of TCP over ATM. Traffic and Congestion control in ATM – Requirements – Attributes – Traffic Management Frame work, Traffic Control – ABR traffic Management – ABR rate control, RM cell formats – ABR Capacity allocations – GFR traffic management.

UNIT IV INTEGRATED AND DIFFERENTIATED SERVICES 8 Integrated Services Architecture – Approach, Components, Services- Queuing Discipline – FQ – PS – BRFQ – GPS – WFQ – Random Early Detection – Differentiated Services. UNIT V PROTOCOLS FOR QOS SUPPORT 8

RSVP – Goals & Characteristics, Data Flow, RSVP operations – Protocol Mechanisms – Multiprotocol Label Switching – Operations, Label Stacking – Protocol details – RTP – Protocol Architecture – Data Transfer Protocol– RTCP.

TOTAL= 45 TEXT BOOKS: 1. William Stallings, “High speed networks and internet”, Second Edition, Pearson

Education, 2002. REFERENCES: 1. Warland, Pravin Varaiya, “High performance communication networks”, Second

Edition , Jean Harcourt Asia Pvt. Ltd., , 2001. 2. Irvan Pepelnjk, Jim Guichard, Jeff Apcar, “MPLS and VPN architecture”, Cisco Press, Volume 1 and 2, 2003. 3. Abhijit S. Pandya, Ercan Sea, “ATM Technology for Broad Band Telecommunication Networks”, CRC Press, New York, 2004.

112

CS808 ROBOTICS 3 0 0 3

UNIT I SCOPE OF ROBOTS 4 The scope of industrial Robots - Definition of an industrial robot - Need for industrial robots - applications.

UNIT II ROBOT COMPONENTS 9 Fundamentals opf Robot Technology - Automation and Robotics - Robot anatomy - Work volume - Prescision of movement - End effectors - Sensors.

UNIT III ROBOT PROGRAMMING 9 Robot Programming - Methods - interlocks textual languages. Characteristics of Robot level languages, characteristic of task level languages.

UNIT IV ROBOT WORK CELL 9 Robot Cell Design and Control - Remote Cemter compilance - Safety in Robotics.

UNIT V FUTURE TRENDS 14 Advanced robotics, Advanced robotics in Space - Specific features of space robotics systems - long-term technical developments, Advanced robotics in under - water operations. Robotics Technology of the Future - Future Applications.

TOTAL : 45

TEXTBOOK 1. Barry Leatham - Jones, "Elements of industrial Robotics" PITMAN Publishing, 1987. REFERENCE 1. Mikell P.Groover, Mitchell Weiss, Roger N.Nagel Nicholas G.Odrey, "Industrial

Robotics Technology, Programming and Applications ", McGraw Hill Book Company 1986.

2. Fu K.S. Gonzaleaz R.C. and Lee C.S.G., "Robotics Control Sensing, Visioon and Intelligence " McGraw Hill International Editions, 1987.

3. Bernard Hodges and Paul Hallam, " Industrial Robotics", British Library Cataloging in Publication 1990.

4. Deb, S.R. Robotics Technology and flexible automation, Tata Mc GrawHill, 1994.

113

CS802 SOFT COMPUTING L T P C

3 0 0 3 UNIT I FUZZY SET THEORY 10 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.

UNIT II OPTIMIZATION 8 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. UNIT III ARTIFICIAL INTELLIGENCE 10 Introduction, Knowledge Representation – Reasoning, Issues and Acquisition: Prepositional and Predicate Calculus Rule Based knowledge Representation Symbolic Reasoning Under Uncertainity Basic knowledge Representation Issues Knowledge acquisition – Heuristic Search: Techniques for Heuristic search Heuristic Classification - State Space Search: Strategies Implementation of Graph Search Search based on Recursion Patent-directed Search Production System and Learning. UNIT IV NEURO FUZZY MODELING 9 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. UNIT V APPLICATIONS OF COMPUTATIONAL INTELLIGENCE 8 Printed Character Recognition – Inverse Kinematics Problems – Automobile Fuel Efficiency Prediction – Soft Computing for Color Recipe Prediction. TOTAL: 45 TEXT BOOKS:

1. J.S.R.Jang, C.T.Sun and E.Mizutani, “Neuro-Fuzzy and Soft Computing”, PHI, 2004, Pearson Education 2004.

2. N.P.Padhy, “Artificial Intelligence and Intelligent Systems”, Oxford University Press, 2006.

REFERENCES:

1. Elaine Rich & Kevin Knight, Artificial Intelligence, Second Edition, Tata Mcgraw Hill Publishing Comp., 2006, New Delhi.

114

2. Timothy J.Ross, “Fuzzy Logic with Engineering Applications”, McGraw-Hill, 1997. 3. Davis E.Goldberg, “Genetic Algorithms: Search, Optimization and Machine

Learning”, Addison Wesley, N.Y., 1989. 4. S. Rajasekaran and G.A.V.Pai, “Neural Networks, Fuzzy Logic and Genetic

Algorithms”, PHI, 2003. 5. R.Eberhart, P.Simpson and R.Dobbins, “Computational Intelligence - PC Tools”,

AP Professional, Boston, 1996. 6. Amit Konar, “Artificial Intelligence and Soft Computing Behaviour and Cognitive

model of the human brain”, CRC Press, 2008. IT603 DIGITAL IMAGE PROCESSING 3 0 0 3 AIM: The aim is to inculcate a basic training in the processing of

images for practical applications in the domain of medical, remoting sessions and in general.

OBJECTIVES:

To introduce basic concepts in acquiring, storage and Process of images

To introduce for enhancing the quality of images. To introduce techniques for extraction and processing of region of

interest To introduce case studies of Image Processing.

UNIT I FUNDAMENTALS OF IMAGE PROCESSING 9 Introduction – Steps in Image Processing Systems – Image Acquisition – Sampling and Quantization – Pixel Relationships – Colour Fundamentals and Models, File Formats, Image operations – Arithmetic, Geometric and Morphological.

.

UNIT II IMAGE ENHANCEMENT 9 Spatial Domain Gray level Transformations Histogram Processing Spatial Filtering – Smoothing and Sharpening. Frequency Domain : Filtering in Frequency Domain – DFT, FFT, DCT – Smoothing and Sharpening filters – Homomorphic Filtering.

. UNIT III IMAGE SEGMENTATION AND FEATURE ANALYSIS 9 Detection of Discontinuities – Edge Operators – Edge Linking and Boundary Detection – Thresholding – Region Based Segmentation – Morphological WaterSheds – Motion Segmentation, Feature Analysis and Extraction.

UNIT IV MULTI RESOLUTION ANALYSIS AND COMPRESSIONS 9 Multi Resolution Analysis : Image Pyramids – Multi resolution expansion – Wavelet Transforms. Image Compression : Fundamentals – Models – Elements of Information Theory – Error Free Compression – Lossy Compression – Compression Standards.

115

UNIT V APPLICATIONS OF IMAGE PROCESSING 9 Image Classification – Image Recognition – Image Understanding – Video Motion Analysis – Image Fusion – Steganography – Digital Compositing – Mosaics – Colour Image Processing..

TOTAL = 45 TEXT BOOKS:

1. Rafael C.Gonzalez and Richard E.Woods, “Digital Image Processing” Second Edition, Pearson Education, 2003.

REFERENCES: 1. Milan Sonka, Vaclav Hlavac and Roger Boyle, “Image Processing, Analysis and

Machine Vision”, Second Edition, Thomson Learning, 2001 2. Anil K.Jain, “Fundamentals of Digital Image Processing”, PHI, 2006. 3. Sanjit K. Mitra, & Giovanni L. Sicuranza, “Non Linear Image Processing”, Elsevier,

2007. 4. Richard O. Duda, Peter E. HOF, David G. Stork, “Pattern Classification” Wiley

Student Edition, 2006.

CS803 SOFTWARE QUALITY ASSURANCE 3 0 0 3

UNIT I FUNDAMENTALS OF SOFTWARE QUALITY ASSURANCE 9 The Role of SQA – SQA Plan – SQA considerations – SQA people – Quality Management – Software Configuration Management

UNIT II MANAGING SOFTWARE QUALITY 9 Managing Software Organizations – Managing Software Quality – Defect Prevention – Software Quality Assurance Management

UNIT III SOFTWARE QUALITY ASSURANCE METRICS 9 Software Quality – Total Quality Management (TQM) – Quality Metrics – Software Quality Metrics Analysis

UNIT IV SOFTWARE QUALITY PROGRAM 9 Software Quality Program Concepts – Establishment of a Software Quality Program – Software Quality Assurance Planning – An Overview – Purpose & Scope.

UNIT V SOFTWARE QUALITY ASSURANCE STANDARDIZATION 9 Software Standards–ISO 9000 Quality System Standards - Capability Maturity Model and the Role of SQA in Software Development Maturity – SEI CMM Level 5 – Comparison of ISO 9000 Model with SEI’s CMM

Total = 45

116

TEXT BOOKS: 1. Mordechai Ben-Menachem / Garry S Marliss, “Software Quality”, Vikas

Publishing House, Pvt, Ltd., New Delhi.(UNIT III to V) 2. Watts S Humphrey, “ Managing the Software Process”, Pearson Education

Inc.( UNIT I and II)

REFERENCES: 1. Gordon G Schulmeyer, “Handbook of Software Quality Assurance”, Third

Edition, Artech House Publishers 2007 2. Nina S Godbole, “Software Quality Assurance: Principles and Practice”,

Alpha Science International, Ltd, 2004 IT73 SOFTWARE PROJECT MANAGEMENT 3 0 0 3 UNIT I INTRODUCTION TO SOFTWARE PROJECT MANAGEMENT 9 Project Definition – Contract Management – Activities Covered By Software Project Management – Overview Of Project Planning – Stepwise Project Planning.

UNIT II PROJECT EVALUATION 9 Strategic Assessment – Technical Assessment – Cost Benefit Analysis –Cash Flow Forecasting – Cost Benefit Evaluation Techniques – Risk Evaluation. UNIT III ACTIVITY PLANNING 9 Objectives – Project Schedule – Sequencing and Scheduling Activities –Network Planning Models – Forward Pass – Backward Pass – Activity Float – Shortening Project Duration – Activity on Arrow Networks – Risk Management – Nature Of Risk – Types Of Risk – Managing Risk – Hazard Identification – Hazard Analysis – Risk Planning And Control. UNIT IV MONITORING AND CONTROL 9 Creating Framework – Collecting The Data – Visualizing Progress – Cost Monitoring – Earned Value – Priortizing Monitoring – Getting Project Back To Target – Change Control – Managing Contracts – Introduction – Types Of Contract – Stages In Contract Placement – Typical Terms Of A Contract – Contract Management – Acceptance.

UNIT V MANAGING PEOPLE AND ORGANIZING TEAMS 9 Introduction – Understanding Behavior – Organizational Behaviour:A Background – Selecting The Right Person For The Job – Instruction In The Best Methods – Motivation – The Oldman – Hackman Job Characteristics Model – Working In Groups – Becoming A Team –Decision Making – Leadership – Organizational Structures – Stress –Health And Safety – Case Studies.

TOTAL = 45

117

TEXT BOOK: 1. Bob Hughes, Mikecotterell, “Software Project Management”, Third Edition, Tata

McGraw Hill, 2004. REFERENCES:

1. Ramesh, Gopalaswamy, "Managing Global Projects", Tata McGraw Hill, 2001. 2. Royce, “Software Project Management”, Pearson Education, 1999. 3. Jalote, “Software Project Manangement in Practive”, Pearson Education, 2002.

CS804 DISTRIBUTED SYSTEMS 3 0 0 3 UNIT I 9 Characterization of Distributed Systems-Introduction-Examples-Resource Sharing and the Web-Challenges. System Models-Architectural-Fundamental. Interprocess Communication-Introduction-API for Internet protocols-External data representation and marshalling--Client-server communication-Group communication-Case study: Interprocess Communication in UNIX. UNIT II 9 Distributed Objects and Remote Invocation-Introduction-Communication between distributed objects-Remote procedure calls-Events and notifications-Case study: Java RMI. Operating System Support-Introduction-OS layer-Protection-Processes and threads-Communication and invocation OS architecture. UNIT III 9 Distributed File Systems-Introduction-File service architecture-Case Study:Sun Network File System-Enhancements and further developments. Name Services-Introduction-Name Services and the Domain Name System-Directory Services-Case Study: Global Name Service. UNIT IV 9 Time and Global States-Introduction-Clocks, events and process states-Synchronizing physical clocks-Logical time and logical clocks-Global states-Distributed debugging. Coordination and Agreement-Introduction-Distributed mutual exclusion-Elections-Multicast communication-Consensus and related problems. UNIT V 9 Distributed Shared Memory-Introduction-Design and implementation issues-Sequential consistency and Ivy case study Release consistency and Munin case study-Other consistency models. CORBA Case Study- Introduction-CORBA RMI-CORBA services.

118

TEXT: 1. George Coulouris, Jean Dollimore, Tim Kindberg, , "Distributed Systems: Concepts and Design", 4th Edition, Pearson Education, 2005. REFERENCES: 1. A.tS. Tanenbaum and M. V. Steen, "Distributed Systems: Principles and Paradigms", Second Edition, Prentice Hall, 2006. 2. M.L.Liu, “Distributed Computing Principles and Applications”, Pearson Addison Wesley, 2004. 3. Mukesh Singhal, “Advanced Concepts In Operating Systems”, McGrawHill Series in Computer Science, 1994. 4. Nancy A. Lynch, "Distributed Algorithms", The Morgan Kaufmann Series in Data Management System, Morgan Kaufmann Publishers, 2000. CS809 QUANTUM COMPUTING 3 0 0 3 UNIT I FOUNDATION 9 Overview of traditional computing – Church-Turing thesis – circuit model of computation – reversible computation – quantum physics – quantum physics and computation – Dirac notation and Hilbert Spaces – dual vectors – operators – the spectral theorem – functions of operators – tensor products – Schmidt decomposition theorem UNIT II QUBITS AND QUANTUM MODEL OF COMPUTATION 9 State of a quantum system – time evolution of a closed system – composite systems – measurement – mixed states and general quantum operations – quantum circuit model – quantum gates – universal sets of quantum gates – unitary transformations – quantum circuits UNIT III QUANTUM ALGORITHMS – I 9 Superdense coding – quantum teleportation – applications of teleportation – probabilistic versus quantum algorithms – phase kick-back – the Deutsch algorithm – the Deutsch-Jozsa algorithm – Simon's algorithm – Quantum phase estimation and quantum Fourier Transform – eigenvalue estimation UNIT IV QUANTUM ALGORITHMS – II 9 Order-finding problem – eigenvalue estimation approach to order finding – Shor's algorithm for order finding – finding discrete logarithms – hidden subgroups – Grover's quantum search algorithm – amplitude amplification – quantum amplitude estimation – quantum counting – searching without knowing the success probability

119

UNIT V QUANTUM COMPUTATIONAL COMPLEXITY AND ERROR CORRECTION 9 Computational complexity – black-box model – lower bounds for searching – general black-box lower bounds – polynomial method – block sensitivity – adversary methods – classical error correction – classical three-bit code – fault tolerance – quantum error correction – three- and nine-qubit quantum codes – fault-tolerant quantum computation TEXT BOOK: 1. P. Kaye, R. Laflamme, and M. Mosca, “An introduction to Quantum Computing”, Oxford University Press, 1999. REFERENCES:

1. V. Sahni, “Quantum Computing”, Tata McGraw-Hill Publishing Company, 2007. CS805 KNOWLEDGE BASED DECISION SUPPORT SYSTEM 3 0 0 3 UNIT I 9 Decision Making and computerized support: Management support systems. Decision making systems modeling- support. UNIT II 9 Decision Making Systems – Modeling and Analysis – Business Intelligence – Data Warehousing, Data Acquisition - Data Mining. Business Analysis – Visualization - Decision Support System Development. UNIT III 9 Collaboration, Communicate Enterprise Decision Support System & Knowledge management – Collaboration Com Technologies Enterprise information system – knowledge management. UNIT IV 9 Intelligent Support Systems – AI & Expert Systems – Knowledge based Systems – Knowledge Acquisition , Representation & Reasoning, Advanced intelligence system – Intelligence System over internet. UNIT V 9 Implementing MSS in the E-Business ERA – Electronic Commerce – integration, Impacts and the future management support systems. TEXT BOOKS: 1. Decision Support Systems & Intelligent Systems – Seventh edition Efraim Turban & Jay E. Aronson Ting-Peng Liang - Pearson/prentice Hall 2. Decision support Systems – Second Edition – George M Marakas - Pearson/prentice Hall.

120

REFERENCES: 1. Decision Support Systems – V.S. Janakiraman & K. Sarukesi 2. Decision Support systems and Data warehouse Systems by Efrem G Mallach- Mc Graw Hill CS 810 GRID COMPUTING 3 0 0 3 UNIT I CONCEPTS AND ARCHITECTURE 9 Introduction-Parallel and Distributed Computing-Cluster Computing-Grid Computing- Anatomy and Physiology of Grid-Review of Web Services-OGSA-WSRF. UNIT II GRID MONITORING 9 Grid Monitoring Architecture (GMA) - An Overview of Grid Monitoring Systems- GridICE – JAMM -MDS-Network Weather Service-R-GMA-Other Monitoring Systems- Ganglia and GridMon UNIT III GRID SECURITY AND RESOURCE MANAGEMENT 9 Grid Security-A Brief Security Primer-PKI-X509 Certificates-Grid Security-Grid Scheduling and Resource Management-Scheduling Paradigms- Working principles of Scheduling -A Review of Condor, SGE, PBS and LSF-Grid Scheduling with QoS. UNIT IV DATA MANAGEMENT AND GRID PORTALS 9 Data Management-Categories and Origins of Structured Data-Data Management Challenges-Architectural Approaches-Collective Data Management Services-Federation Services-Grid Portals-First-Generation Grid Portals-Second-Generation Grid Portals. UNIT V GRID MIDDLEWARE 9 List of globally available Middlewares - Case Studies-Recent version of Globus Toolkit and gLite - Architecture, Components and Features.

TEXT BOOK:

1. Maozhen Li, Mark Baker, The Grid Core Technologies, John Wiley & Sons ,2005.

REFERENCES:

1. Ian Foster & Carl Kesselman, The Grid 2 – Blueprint for a New Computing Infrascture , Morgan Kaufman – 2004

2. Joshy Joseph & Craig Fellenstein, “Grid Computing”, Pearson Education 2004. 3. Fran Berman,Geoffrey Fox, Anthony J.G.Hey, “Grid Computing: Making the

Global Infrastructure a reality”, John Wiley and sons, 2003.

121

CS811 AGENT BASED INTELLIGENT SYSTEMS 3 0 0 3 1. INTRODUCTION 9 Definitions - Foundations - History - Intelligent Agents-Problem Solving-Searching - Heuristics -Constraint Satisfaction Problems - Game playing. 2. KNOWLEDGE REPRESENTATION AND REASONING 9 Logical Agents-First order logic-First Order Inference-Unification-Chaining- Resolution Strategies-Knowledge Representation-Objects-Actions-Events 3. PLANNING AGENTS 9 Planning Problem-State Space Search-Partial Order Planning-Graphs-Nondeterministic Domains-Conditional Planning-Continuous Planning-MultiAgent Planning. 4. AGENTS AND UNCERTAINITY 9 Acting under uncertainty – Probability Notation-Bayes Rule and use - Bayesian Networks-Other Approaches-Time and Uncertainty-Temporal Models- Utility Theory - Decision Network – Complex Decisions. 5. HIGHER LEVEL AGENTS 9 Knowledge in Learning-Relevance Information-Statistical Learning Methods-Reinforcement Learning-Communication-Formal Grammar-Augmented Grammars- Future of AI.

Total No of periods: 45 TEXT BOOK: 1. Stuart Russell and Peter Norvig, “Artificial Intelligence - A Modern Approach”,2nd Edition, Prentice Hall, 2002 REFERENCES: 1. Michael Wooldridge, “An Introduction to Multi Agent System”, John Wiley, 2002. 2. Patrick Henry Winston, Artificial Intelligence, 3rd Edition, AW, 1999. 3. Nils.J.Nilsson, Principles of Artificial Intelligence, Narosa Publishing House, 1992

122

GE606 PROFESSIONAL ETHICS IN ENGINEERING

L T P C 3 0 0 3

UNIT I ENGINEERING ETHICS 9 Senses of ‘Engineering Ethics’ – Variety of moral issues – Types of inquiry – Moral dilemmas – Moral Autonomy – Kohlberg’s theory – Gilligan’s theory – Consensus and Controversy – Professions and Professionalism – Professional Ideals and Virtues – Uses of Ethical Theories

UNIT II ENGINEERING AS SOCIAL EXPERIMENTATION 9 Engineering as Experimentation – Engineers as responsible Experimenters – Research Ethics - Codes of Ethics – Industrial Standards - A Balanced Outlook on Law – The Challenger Case Study UNIT III ENGINEER’S RESPONSIBILITY FOR SAFETY 9 Safety and Risk – Assessment of Safety and Risk – Risk Benefit Analysis – Reducing Risk – The Government Regulator’s Approach to Risk - Chernobyl Case Studies and Bhopal

UNIT IV RESPONSIBILITIES AND RIGHTS 9 Collegiality and Loyalty – Respect for Authority – Collective Bargaining – Confidentiality – Conflicts of Interest – Occupational Crime – Professional Rights – Employee Rights – Intellectual Property Rights (IPR) - Discrimination UNIT V GLOBAL ISSUES 9 Multinational Corporations – Business Ethics - Environmental Ethics – Computer Ethics - Role in Technological Development – Weapons Development – Engineers as Managers – Consulting Engineers – Engineers as Expert Witnesses and Advisors – Honesty – Moral Leadership – Sample Code of Conduct

Total :45 TEXT BOOKS:

1. Mike Martin and Roland Schinzinger, “Ethics in Engineering”, McGraw Hill, New York, 2005.

2. Charles E Harris, Michael S Pritchard and Michael J Rabins, “Engineering Ethics – Concepts and Cases”, Thompson Learning, 2000. REFERENCES: 1. Charles D Fleddermann, “Engineering Ethics”, Prentice Hall, New Mexico, 1999.

123

2. John R Boatright, “Ethics and the Conduct of Business”, Pearson Education, 2003

3. Edmund G Seebauer and Robert L Barry, “Fundamentals of Ethics for Scientists and Engineers”, Oxford University Press, 2001.

4. Prof. (Col) P S Bajaj and Dr. Raj Agrawal, “Business Ethics – An Indian Perspective”, Biztantra, New Delhi, 2004.

5. David Ermann and Michele S Shauf, “Computers, Ethics and Society”, Oxford University Press, (2003)

CS806 NANO SCIENCE AND TECHNOLOGY L T P C 3 0 0 3 UNIT I INTRODUCTION 10 Nanoscale Science and Technology- Implications for Physics, Chemistry, Biology and Engineering-Classifications of nanostructured materials- nano particles- quantum dots, nanowires-ultra-thinfilms-multilayered materials. Length Scales involved and effect on properties: Mechanical, Electronic, Optical, Magnetic and Thermal properties. Introduction to properties and motivation for study (qualitative only). UNIT II PREPARATION METHODS 10 Bottom-up Synthesis-Top-down Approach: Precipitation, Mechanical Milling, Colloidal routes, Self-assembly, Vapour phase deposition, MOCVD, Sputtering, Evaporation, Molecular Beam Epitaxy, Atomic Layer Epitaxy, MOMBE. UNIT III PATTERNING AND LITHOGRAPHY FOR NANOSCALE DEVICES 5 Introduction to optical/UV electron beam and X-ray Lithography systems and processes, Wet etching, dry (Plasma /reactive ion) etching, Etch resists-dip pen lithography UNIT IV PREPARATION ENVIRONMENTS 10 Clean rooms: specifications and design, air and water purity, requirements for particular processes, Vibration free environments: Services and facilities required. Working practices, sample cleaning, Chemical purification, chemical and biological contamination, Safety issues, flammable and toxic hazards, biohazards. UNIT V CHARECTERISATION TECHNIQUES 10 X-ray diffraction technique, Scanning Electron Microscopy - environmental techniques, Transmission Electron Microscopy including high-resolution imaging, Surface Analysis techniques- AFM, SPM, STM, SNOM, ESCA, SIMS-Nanoindentation

45 hrs TEXT BOOKS: 1. A.S. Edelstein and R.C. Cammearata, eds., Nanomaterials: Synthesis, Properties and Applications, (Institute of Physics Publishing, Bristol and Philadelphia, 1996) 2. N John Dinardo, Nanoscale charecterisation of surfaces & Interfaces, Second edition, Weinheim Cambridge, Wiley-VCH, 2000 REFERENCES:

124

1. G Timp (Editor), Nanotechnology, AIP press/Springer, 1999 2. Akhlesh Lakhtakia (Editor) The Hand Book of Nano Technology, “Nanometer

Structure”, Theory, Modeling and Simulations. Prentice-Hall of India (P) Ltd, New Delhi, 2007.

GE610 INDIAN CONSTITUTION AND SOCIETY L T P C

3 0 0 3 UNIT-I 9 Historical Background – Constituent Assembly of India – Philosophical foundations of the Indian Constitution – Preamble – Fundamental Rights – Directive Principles of State Policy – Fundamental Duties – Citizenship – Constitutional Remedies for citizens. UNIT- II 9 Union Government – Structures of the Union Government and Functions – President – Vice President – Prime Minister – Cabinet – Parliament – Supreme Court of India – Judicial Review. UNIT-III 9 State Government – Structure and Functions – Governor – Chief Minister – Cabinet – State Legislature – Judicial System in States – High Courts and other Subordinate Courts. UNIT-IV 9 Indian Federal System – Center – State Relations – President’s Rule – Constitutional Amendments – Constitutional Functionaries - Assessment of working of the Parliamentary System in India. UNIT- V 9 Society : Nature, Meaning and definition; Indian Social Structure; Caste, Religion, Language in India; Constitutional Remedies for citizens – Political Parties and Pressure Groups; Right of Women, Children and Scheduled Castes and Scheduled Tribes and other Weaker Sections.

TOTAL: 45 PERIODS

TEXT BOOKS:

1. Durga Das Basu, “ Introduction to the Constitution of India “, Prentice Hall of India, New Delhi.

2. R.C.Agarwal, (1997) “Indian Political System”, S.Chand and Company, New Delhi.

125

3. Maciver and Page, “ Society: An Introduction Analysis “, Mac Milan India Ltd., New Delhi.

4. K.L.Sharma, (1997) “Social Stratification in India: Issues and Themes”, Jawaharlal Nehru University, New Delhi.

REFERENCES:

1. Sharma, Brij Kishore, “ Introduction to the Constitution of India:, Prentice Hall of India, New Delhi.

2. U.R.Gahai, “Indian Political System “, New Academic Publishing House, Jalaendhar.

3. R.N. Sharma, “Indian Social Problems “, Media Promoters and Publishers Pvt. Ltd.

IT703 BIO INFORMATICS 3 0 0 3 UNIT I 9 Introduction to molecular biology – the genetic material – gene structure – protein structure – chemical bonds – molecular biology tools – genomic information content UNIT II 9 Data searches – simple alignments – gaps – scoring matrices – dynamic programming – global and local alignments – database searches – multiple sequence alignments Patterns for substitutions – estimating substitution numbers – evolutionary rates – molecular clocks – evolution in organelles UNIT III 9 Phylogenetics – history and advantages – phylogenetic trees – distance matrix methods – maximum likelihood approaches – multiple sequence alignments – Parsimony – ancestral sequences – strategies for faster searches – consensus trees – tree confidence – comparison of phylogenetic methods – molecular phylogenies UNIT IV 9 Genomics – prokaryotic genomes: prokaryotic gene structure – GC content - gene density – eukaryotic genomes: gene structure – open reading frames – GC content – gene expression – transposition – repeated elements – gene density UNIT V 9 Amino acids – polypeptide composition – secondary structure – tertiary and quaternary structure – algorithms for modeling protein folding – structure prediction – predicting RNA secondary structures Proteomics – protein classification – experimental techniques – inhibitors and drug design – ligand screening – NMR structures – empirical methods and prediction techniques – post-translational modification prediction

Total: 45

126

TEXT BOOK: 1. D. E. Krane and M. L. Raymer, “Fundamental concepts of Bioinformatics”, Pearson Education, 2003. REFERENCES:

1. Arthur M. Lesk, “Introduction to Bioinformatics”, Second Edition, Oxford University Press, 2005.

2. T. K. Attwood, D. J. Parry-Smith, and S. Phukan, “Introduction to Bioinformatics”, Pearson Education, 1999.

3. Vittal R. Srinivas, “Bioinformatics – A Modern Approach”, Prentice-Hall of India Pvt. Ltd., 2005.

IT807 SPEECH SIGNAL PROCESSING 3 0 0 3 UNIT I MECHANICS OF SPEECH 9 Speech production: Mechanism of speech production, Acoustic phonetics - Digital models for speech signals - Representations of speech waveform: Sampling speech signals, basics of quantization, delta modulation, and Differential PCM - Auditory perception: psycho acoustics. UNIT II TIME DOMAIN METHODS FOR SPEECH PROCESSING 9 Time domain parameters of Speech signal – Methods for extracting the parameters Energy, Average Magnitude, Zero crossing Rate – Silence Discrimination using ZCR and energy – Short Time Auto Correlation Function – Pitch period estimation using Auto Correlation Function. UNIT III FREQUENCY DOMAIN METHOD FOR SPEECH PROCESSING 9 Short Time Fourier analysis: Fourier transform and linear filtering interpretations, Sampling rates - Spectrographic displays - Pitch and formant extraction - Analysis by Synthesis - Analysis synthesis systems: Phase vocoder, Channel Vocoder - Homomorphic speech analysis: Cepstral analysis of Speech, Formant and Pitch Estimation, Homomorphic Vocoders. UNIT IV LINEAR PREDICTIVE ANALYSIS OF SPEECH 9 Basic Principles of linear predictive analysis – Auto correlation method – Covariance method – Solution of LPC equations – Cholesky method – Durbin’s Recursive algorithm – Application of LPC parameters – Pitch detection using LPC parameters – Formant analysis – VELP – CELP. UNIT V APPLICATION OF SPEECH & AUDIO SIGNAL PROCESSING 9 Algorithms: Dynamic time warping, K-means clustering and Vector quantization, Gaussian mixture modeling, hidden Markov modeling - Automatic Speech Recognition: Feature Extraction for ASR, Deterministic sequence recognition, Statistical Sequence recognition, Language models - Speaker identification and verification – Voice response system – Speech synthesis: basics of articulatory, source-filter, and concatenative synthesis – VOIP

127

TEXT BOOKS: 1. L. R. Rabiner and R. W. Schaffer, “Digital Processing of Speech signals”,

Prentice Hall, 1978. 2. Ben Gold and Nelson Morgan, “Speech and Audio Signal Processing”, John

Wiley and Sons Inc., Singapore, 2004.

REFERENCES: 1. Quatieri, “Discrete-time Speech Signal Processing”, Prentice Hall, 2001. 2. L.R. Rabiner and B. H. Juang, “Fundamentals of speech recognition”, Prentice Hall, 1993.