Anna University Semester 5 Computer engineering syllabus – The fifth semester syllabus for Anna University Computer engineering has one tough mathematics subject because it involves alot of theoretical maths as opposed to previous math subjects that were applied in nature.Other important subjects that share a common course with other branches include OOPS or Object oriented programming and internet programming.Theory subject for this semester is theory of computation and is easy to pass.
Anna University Semester 5 Computer engineering syllabus
UNIT I LOGIC AND PROOFS 9+3
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 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 9+3
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 9+3
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 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.
UNIT I JAVA PROGRAMMING 9
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 8
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 11
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 8
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 DefinitionXML
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 9
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 –
OBJECT ORIENTED ANALYSIS AND DESIGN
UNIT I UML DIAGRAMS 9
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 9
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 9
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 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 – Applying GoF design patterns.
UNIT V CODING AND TESTING 9
Mapping design to code – Testing: Issues in OO Testing – Class Testing – OO Integration Testing –
GUI Testing – OO System Testing.
THEORY OF COMPUTATION
UNIT I FINITE AUTOMATA 9
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 9
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 9
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 9
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 9
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.
UNIT I INTRODUCTION 9
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 9
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 10
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 7
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 10
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.