CS6501 INTERNET PROGRAMMING SYLLABUS

ANNA UNIVERSITY CSE SYLLABUS

5TH SEM CSE
REGULATION 2013
OBJECTIVES:
The student should be made to:
Learn Java Programming.
Understand different Internet Technologies.
Be exposed to java specific web services architecture.
UNIT I JAVA PROGRAMMING
An overview of Java – Data Types – Variables and Arrays – Operators – Control Statements – Classes – Objects – Methods – Inheritance - Packages – Abstract classes – Interfaces and Inner classes – Exception handling - Introduction to Threads – Multithreading – String handling – Streams and I/O – Applets.

UNIT II WEBSITES BASICS, HTML 5, CSS 3, WEB 2.0
Web 2.0: Basics-RIA Rich Internet Applications - Collaborations tools - Understanding websites and web servers: Understanding Internet – Difference between websites and web server- Internet technologies Overview – Understanding the difference between internet and intranet; HTML and CSS: HTML 5.0 , XHTML, CSS 3.

UNIT III CLIENT SIDE AND SERVER SIDE PROGRAMMING
Java Script: An introduction to JavaScript–JavaScript DOM Model-Date and Objects,-Regular Expressions- Exception Handling- Validation-Built-in objects-Event Handling- DHTML with JavaScript. Servlets: Java Servlet Architecture- Servlet Life Cycle- Form GET and POST actions- Session Handling- Understanding Cookies- Installing and Configuring Apache Tomcat Web Server;-
DATABASE CONNECTIVITY: JDBC perspectives, JDBC program example - JSP: Understanding Java Server Pages-JSP Standard Tag Library(JSTL)-Creating HTML forms by embedding JSP code.

UNIT IV PHP and XML
An introduction to PHP: PHP- Using PHP- Variables- Program control- Built-in functions-Connecting to Database – Using Cookies-Regular Expressions; XML: Basic XML- Document Type Definition-XML Schema DOM and Presenting XML, XML Parsers and Validation, XSL and XSLT Transformation, News Feed (RSS and ATOM).

UNIT V INTRODUCTION TO AJAX and WEB SERVICES
AJAX: Ajax Client Server Architecture- XML Http Request Object-Call Back Methods; Web Services: Introduction- Java web services Basics – Creating, Publishing ,Testing and Describing a Web services (WSDL)-Consuming a web service, Database Driven web service from an application – SOAP.

TOTAL (L:45+T:15): 60 PERIODS

OUTCOMES:
At the end of the course, the student should be able to:
Implement Java programs.
Create a basic website using HTML and Cascading Style Sheets.
Design and implement dynamic web page with validation using JavaScript objects and by applying different event handling mechanisms.
Design rich client presentation using AJAX.
Design and implement simple web page in PHP, and to present data in XML format.
Design and implement server side programs using Servlets and JSP.
TEXT BOOKS:
1. Deitel and Deitel and Nieto, “Internet and World Wide Web - How to Program”, Prentice Hall, 5th Edition, 2011.
2. Herbert Schildt, “Java-The Complete Reference”, Eighth Edition, Mc Graw Hill Professional,2011.

REFERENCES:
1. Stephen Wynkoop and John Burke “Running a Perfect Website”, QUE, 2 nd Edition,1999.
2. Chris Bates, Web Programming – Building Intranet Applications, 3 rd Edition, Wiley
Publications, 2009.
3. Jeffrey C and Jackson, “Web Technologies A Computer Science Perspective”, Pearson
Education, 2011.
4. Gopalan N.P. and Akilandeswari J., “Web Technology”, Prentice Hall of India, 2011.
5. Paul Dietel and Harvey Deitel, “Java How to Program”, , 8 th Edition Prentice Hall of India.
6. Mahesh P. Matha, “Core Java A Comprehensive Study”, Prentice Hall of India, 2011.
7. Uttam K.Roy, “Web Technologies”, Oxford University Press, 2011.

CS6502 OBJECT ORIENTED ANALYSIS AND DESIGN SYLLABUS

ANNA UNIVERSITY CSE SYLLABUS

5TH SEM CSE
REGULATION 2013
OBJECTIVES:
The student should be made to:
Learn the basics of OO analysis and design
skills. Learn the UML design diagrams.
Learn to map design to code.
Be exposed to the various testing techniques.
UNIT I UML DIAGRAMS
Introduction to OOAD – Unified Process - UML diagrams – Use Case – Class Diagrams– Interaction Diagrams – State Diagrams – Activity Diagrams – Package, component and Deployment Diagrams.

UNIT II DESIGN PATTERNS
GRASP: Designing objects with responsibilities – Creator – Information expert – Low Coupling – High Cohesion – Controller - Design Patterns – creational - factory method - structural – Bridge – Adapter - behavioral – Strategy – observer.

UNIT III CASE STUDY
Case study – the Next Gen POS system, Inception -Use case Modeling - Relating Use cases – include, extend and generalization - Elaboration - Domain Models - Finding conceptual classes and description classes – Associations – Attributes – Domain model refinement – Finding conceptual class Hierarchies - Aggregation and Composition.

UNIT IV APPLYING DESIGN PATTERNS
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 - Applying GoF design patterns.

UNIT V CODING AND TESTING
Mapping design to code – Testing: Issues in OO Testing – Class Testing – OO Integration Testing – GUI Testing – OO System Testing.

TOTAL: 45 PERIODS

OUTCOMES:
At the end of the course, the student should be able to:
Design and implement projects using OO concepts.
Use the UML analysis and design diagrams.
Apply appropriate design patterns.
Create code from design.
Compare and contrast various testing techniques.
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. Simon Bennett, Steve Mc Robb and Ray Farmer, “Object Oriented Systems Analysis and Design Using UML”, Fourth Edition, Mc-Graw Hill Education, 2010. Richard Helm, Ralph Johnson, John Vlissides, “Design patterns:
2. Erich Gamma, a n d Elements of Reusable Object-Oriented Software”, Addison-Wesley, 1995.
3. Martin Fowler, “UML Distilled: A Brief Guide to the Standard Object Modeling Language”, Third edition, Addison Wesley, 2003.
4. Paul C. Jorgensen, “Software Testing:- A Craftsman’s Approach”, Third Edition, Auerbach
Publications, Taylor and Francis Group, 2008.

CS6504 COMPUTER GRAPHICS SYLLABUS

ANNA UNIVERSITY CSE SYLLABUS

5TH SEM CSE
REGULATION 2013
OBJECTIVES:
The student should be made to:
Gain knowledge about graphics hardware devices and software
used. Understand the two dimensional graphics and their
transformations. Understand the three dimensional graphics and their
transformations. Appreciate illumination and color models.
Be familiar with understand clipping techniques.
UNIT I INTRODUCTION
Survey of computer graphics, Overview of graphics systems – Video display devices, Raster scan systems, Random scan systems, Graphics monitors and Workstations, Input devices, Hard copy Devices, Graphics Software; Output primitives – points and lines, line drawing algorithms, loading the frame buffer, line function; circle and ellipse generating algorithms; Pixel addressing and object geometry, filled area primitives.

UNIT II TWO DIMENSIONAL GRAPHICS
Two dimensional geometric transformations – Matrix representations and homogeneous coordinates, composite transformations; Two dimensional viewing – viewing pipeline, viewing coordinate reference frame; widow-to-viewport coordinate transformation, Two dimensional viewing functions; clipping operations – point, line, and polygon clipping algorithms.

UNIT III THREE DIMENSIONAL GRAPHICS
Three dimensional concepts; Three dimensional object representations – Polygon surfaces- Polygon tables- Plane equations - Polygon meshes; Curved Lines and surfaces, Quadratic surfaces; Blobby objects; Spline representations – Bezier curves and surfaces -B-Spline curves and surfaces.
TRANSFORMATION AND VIEWING: Three dimensional geometric and modeling transformations – Translation, Rotation, Scaling, composite transformations; Three dimensional viewing – viewing pipeline, viewing coordinates, Projections, Clipping; Visible surface detection methods.

UNIT IV ILLUMINATION AND COLOUR MODELS
Light sources - basic illumination models – halftone patterns and dithering techniques; Properties of light - Standard primaries and chromaticity diagram; Intuitive colour concepts - RGB colour model - YIQ colour model - CMY colour model - HSV colour model - HLS colour model; Colour selection.

UNIT V ANIMATIONS & REALISM
ANIMATION GRAPHICS: Design of Animation sequences – animation function – raster animation – key frame systems – motion specification –morphing – tweening.
COMPUTER GRAPHICS REALISM : Tiling the plane – Recursively defined curves – Koch curves – C curves – Dragons – space filling curves – fractals – Grammar based models – fractals –turtle graphics – ray tracing.

TOTAL: 45 PERIODS

OUTCOMES:
At the end of the course, the student should be able to:
Design two dimensional graphics.
Apply two dimensional transformations.
Design three dimensional graphics.
Apply three dimensional transformations.
Apply Illumination and color models.
Apply clipping techniques to graphics.
Design animation sequences.
TEXT BOOKS:
1. John F. Hughes, Andries Van Dam, Morgan Mc Guire ,David F. Sklar , James D. Foley, Steven K. Feiner and Kurt Akeley ,”Computer Graphics: Principles and Practice”, , 3 rd Edition, Addison-Wesley Professional,2013. (UNIT I, II, III, IV).
2. Donald Hearn and Pauline Baker M, “Computer Graphics", Prentice Hall, New Delhi, 2007 (UNIT V).

REFERENCES:
1. Donald Hearn and M. Pauline Baker, Warren Carithers,“Computer Graphics With Open GL”, 4th Edition, Pearson Education, 2010.
2. Jeffrey McConnell, “Computer Graphics: Theory into Practice”, Jones and Bartlett Publishers, 2006.
3. Hill F S Jr., "Computer Graphics", Maxwell Macmillan” , 1990.
4. Peter Shirley, Michael Ashikhmin, Michael Gleicher, Stephen R Marschner, Erik Reinhard, Kelvin Sung, and AK Peters, Fundamental of Computer Graphics, CRC Press, 2010.
5. William M. Newman and Robert F.Sproull, “Principles of Interactive Computer Graphics”, Mc Graw Hill 1978.
6. http://nptel.ac.in/

CS6503 THEORY OF COMPUTATION SYLLABUS

ANNA UNIVERSITY CSE SYLLABUS

5TH SEM CSE
REGULATION 2013

OBJECTIVES:
The student should be made to:
Understand various Computing models like Finite State Machine, Pushdown Automata,and Turing Machine.

Be aware of Decidability and Un-decidability of various
problems.
Learn types of grammars.
UNIT I FINITE AUTOMATA
Introduction- Basic Mathematical Notation and techniques- Finite State systems – Basic Definitions –Finite Automaton – DFA & NDFA – Finite Automaton with €- moves – Regular Languages- Regular Expression – Equivalence of NFA and DFA – Equivalence of NDFA’s with and without €-moves – Equivalence of finite Automaton and regular expressions –Minimization of DFA- - Pumping Lemma for Regular sets – Problems based on Pumping Lemma.

UNIT II GRAMMARS
Grammar Introduction– Types of Grammar - Context Free Grammars and Languages– Derivations and Languages – Ambiguity- Relationship between derivation and derivation trees – Simplification of CFG – Elimination of Useless symbols - Unit productions - Null productions – Greiback Normal form –Chomsky normal form – Problems related to CNF and GNF.

UNIT III PUSHDOWN AUTOMATA
Pushdown Automata- Definitions – Moves – Instantaneous descriptions – Deterministic pushdown automata – Equivalence of Pushdown automata and CFL - pumping lemma for CFL – problems based on pumping Lemma.

UNIT IV TURING MACHINES
Definitions of Turing machines – Models – Computable languages and functions –Techniques for Turing machine construction – Multi head and Multi tape Turing Machines - The Halting problem – Partial Solvability – Problems about Turing machine- Chomskian hierarchy of languages.

UNIT V UNSOLVABLE PROBLEMS AND COMPUTABLE FUNCTIONS
Unsolvable Problems and Computable Functions – Primitive recursive functions – Recursive and recursively enumerable languages – Universal Turing machine. MEASURING AND CLASSIFYING
COMPLEXITY : Tractable and Intractable problems- Tractable and possibly intractable problems - P and NP completeness - Polynomial time reductions.

TOTAL: 45 PERIODS

OUTCOMES:
At the end of the course, the student should be able to:
Design Finite State Machine, Pushdown Automata, and Turing
Machine. Explain the Decidability or Undecidability of various problems
TEXT BOOKS:
1. Hopcroft J.E., Motwani R. and Ullman J.D, “Introduction to Automata Theory, Languages and Computations”, Second Edition, Pearson Education, 2008. (UNIT 1,2,3)
2. John C Martin, “Introduction to Languages and the Theory of Computation”, Third Edition, Tata McGraw Hill Publishing Company, New Delhi, 2007. (UNIT 4,5)

REFERENCES:
1. Mishra K L P and Chandrasekaran N, “Theory of Computer Science - Automata, Languages and Computation”, Third Edition, Prentice Hall of India, 2004.
2. Harry R Lewis and Christos H Papadimitriou, “Elements of the Theory of Computation”, Second Edition, Prentice Hall of India, Pearson Education, New Delhi, 2003.
3. Peter Linz, “An Introduction to Formal Language and Automata”, Third Edition, Narosa
Publishers, New Delhi, 2002.
4. Kamala Krithivasan and Rama. R, “Introduction to Formal Languages, Automata Theory
and Computation”, Pearson Education 2009.

MA6566 DISCRETE MATHMATICS syllabus

ANNA UNIVERSITY CSE SYLLABUS
5TH SEM CSE
REGULATION 2013
OBJECTIVES:
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.

UNIT I LOGIC AND PROOFS
Propositional Logic – Propositional equivalences - Predicates and Quantifiers – Nested Quantifiers – Rules of inference - Introduction to proofs – Proof methods and strategy.

UNIT II COMBINATORICS
Mathematical induction – 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 principle and its applications.

UNIT III GRAPHS
Graphs and graph models – Graph terminology and special types of graphs – Matrix representation of graphs and graph isomorphism – Connectivity – Euler and Hamilton paths.

UNIT IV ALGEBRAIC STRUCTURES
Algebraic systems – Semi groups and monoids - Groups – Subgroups – Homomorphism’s – Normal subgroup and cosets – Lagrange’s theorem – Definitions and examples of Rings and Fields.

UNIT V LATTICES AND BOOLEAN ALGEBRA
Partial ordering – Posets – Lattices as posets – Properties of lattices - Lattices as algebraic systems – Sub lattices – Direct product and homomorphism – Some special lattices – Boolean algebra.

TOTAL (L: 45+T:15): 60 PERIODS

OUTCOMES:
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 and output functions in computer science.
Be aware of the counting principles.
Be exposed to concepts and properties of algebraic structures such as groups, rings and fields.

TEXT BOOKS:
1. Kenneth H.Rosen, "Discrete Mathematics and its Applications", 7 th Edition, Tata Mc Graw Hill Pub. Co. Ltd., New Delhi, Special Indian Edition, 2011.
2. Tremblay J.P. and Manohar R, "Discrete Mathematical Structures with Applications to Computer Science", Tata Mc Graw Hill Pub. Co. Ltd, New Delhi, 30th Reprint, 2011.

REFERENCES:
1. Ralph.P.Grimaldi., "Discrete and Combinatorial Mathematics: An Applied Introduction", 4th Edition, Pearson Education Asia, Delhi, 2007.
2. Thomas Koshy., "Discrete Mathematics with Applications", Elsevier Publications, 2006.
3. Seymour Lipschutz and Mark Lipson., "Discrete Mathematics", Schaum’s Outlines, Tata Mc Graw Hill Pub. Co. Ltd., New Delhi, 3 rd Edition, 2010.