Mohansharing: February 2013

Monday 25 February 2013

Appying Uml patterns s an introduction to objectoriented analysis and Design by Craig larman Ebook

Appying Uml patterns s an introduction to objectoriented analysis and Design
by Craig larman
Download:

Applying UML and Patterns 3rd Edition.pdf 15.2 MB

Friday 22 February 2013

CEH Certified Ethical Hacker v7 Tools

Career Academy CEH Certified Ethical Hacker v7 Tools (4 DVDs)

English | 4 DVDs ISO | 15.13 GB
Genre: Video Training

This class will immerse the student into an interactive environment where they will be shown how to scan, test, hack and secure their own systems. The lab intensive environment gives each student in-depth knowledge and practical experience with the current essential security systems.

Download:

WEB TECHNOLOGY QUESTION PAPER April/May 2010

IT1451 - WEB TECHNOLOGY ANNA UNIVERSITY PREVIOUS YEAR QUESTION PAPER

IT1451 - WEB TECHNOLOGY ANNA UNIVERSITY PREVIOUS YEAR QUESTION PAPER

B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2010.

Eighth Semester

Information Technology

IT1451 - WEB TECHNOLOGY

(Regulation 2004)

Time: Three hours Maximum:100 marks

Answer ALL Questions.

PART A- (10 X 2= 20 marks)

1. Mention the benefits of java scripts.

2. Name the methods and properties of window object in java script.

3. Define Event Bubbling.

4. What is the use of Blur Filter?

5. Give the importance of a Real One Player Object.

6. What is the need for Client Side Scripting?

7. Compare DTD and XML schema.

8. What are Cookies?

9. What is the primary purpose of an HTTP get request?

10. List the scripting components of JSP.

PART B- (5 X 16 = 80 Marks)

11. (a) (i) Explain the different HTML protocols. (8 Marks)

(ii) Write a Java Script that inputs several lines of text and a search character an determines the number of occurrences of the character in the text using suitable string methods. (8 Marks)

(Or)

(b) (i) Explain the global functions of Java Script. (8 Marks)

(ii) Write a Java Script to find and print the largest and smallest values among 10 elements of an array. (8 Marks)

12. (a) (i) How do you use the frames collection to access objects in a separate frame on your web page? Explain. (8 Marks)

(ii) Describe the event object properties. (8 Marks)

(Or)

(b) (i) Explain the way of creating gradients with alpha filters. (8 Marks)

(ii) Write a DHTML for binding data to a table element. (8 Marks)

13. (a) Explain the various e- business models in detail. (16 Marks)

(Or)

(b) (i) Describe how to use the windows media player activex control to play variety of media formats in web pages. (8 Marks)

(ii) Explain briefly the IIS web server. (8 Marks)

14. (a) Explain the various File system objects in ASP. (16 Marks)

(Or)

(b) (i) Why should namespaces be used in XML? Explain with an example. (8 Marks)

(ii) Discuss briefly the various XML Dom methods. (8 Marks)

15. (a) (i) Discuss the four important methods of HTTP servlet class. (8 Marks)

(ii) Write a servlet program to display a 'welcome' message on the client system. (8 Marks)

(Or)

(b) Explain the various standard actions of JSP. (16 Marks)

WEB TECHNOLOGY Question paper Nov/Dec 2011

Anna University
B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011.
Sixth Semester
Computer Science and Engineering
IT 2353 – WEB TECHNOLOGY
(Common to Information Technology)
(Regulation 2008)
Time : Three hours
Maximum : 100 marks
Answer ALL questions.
PART A—(10 × 2 = 20 marks)
1. How will you create a password field in a HTML form?
2. List any four common browsers.
3. Give the syntax of a CSS rule.
4. What is a Javascript statement? Give an example.
5. Write code to return the full URL of a document.
6. How is session tracking achieved by URL rewriting?
7. How is XML parsing done with SAX?
8. What is the purpose of XSLT?
9. List the basic concepts behind JAX-RPC technology.
10. What is UDDI?
PART B — (5 × 16 = 80 marks)
11. (a) (i) Explain TCP/IP in detail. (8)
(ii) Explain the purpose and way of creating lists in HTML documents
Or
(b) (i) List any two differences between HTML respect to elements. and XHTML
with Also explain about the XHTML DTD. (8)
(ii) Discuss on any four HTTP request methods. (8)
12. (a) (i) Explain any eight CSS text properties. (8)
(ii) Discuss javascript Array object in detail. (8)
Or
(b) (i) Discuss about Javascript debugging. (8)
(ii) Explain in detail CSS border and CSS outline. (8)
13. (a) Explain in detail DOM event handling. Also explain with an example of creating a
context menu. [Note: A context menu is one that that is shown when the user rightclicks
anywhere in the document]. (16)
Or
(b) What is a session? Explain how client state is maintained using session and also
explain about session tracking and session management using an example. (16)
14. (a) (i) Explain XPATH nodes in detail. (8)
(ii) Explain about the object that helps AJAX reload parts of a webpage without
reloading the whole page. (8)
Or
(b) What is a JavaBeans component? How will you use the JSP language elements for
accessing Beans in your JSP pages? (16)
15. (a) Describe the significance and working of WSDL with an example. (16) Or
(b) Describe the major elements of SOAP. (16)

WEB TECHNOLOGY Question paper ,APRIL/MAY 2011

B.E/B.TECH.DEGREE EXAMINATION,APRIL/MAY 2011
Sixth Semester
Information Technology
IT 2353-- WEB TECHNOLOGY
(Common to Computer Science and Engineering)
(Regulation 2008)
Answer All Questions
PART A-(10*2=20 marks)
1. Define URI.
2. State the use of web server logs and list the contents of a message log.
3. Mention the need for cascading style sheets.
4. Explain array creation in Java script with example.
5. Explain in brief the interaction between a web server and a Servlet.
6. List some HTML intrinsic attributes.
7. What is meant by a XML namespace?
8. Explain in brief about Java scriplet.
9. What is meant by WSDL?
10. Define Serialization.
PART B-(5*16=80 marks)
11. (a) Explain in detail the working of the following Internet Protocols
(i) TCP/IP [8]
(ii)HTTP [8]
or
(b) (i) List and explain any four HTML elements in detail. [8]
(ii) State the types of lists supported by HTML and explain them in detail. [8]
12. (a) (i) List and explain in detail the various selector strings. [8]
(ii) Explain the features of cascading style sheets. [8]
or
(b) (i) State and explain the types of statements in Java script. [8]
(ii) Explain how functions can be written in Java script with an example. [8]
13. (a) (i) Explain about the document tree in detail. [8]
(ii) Explain DOM event handling in detail. [8]
or
(b) Explain the Servlet operation in detail with a sample Servlet program. [16]
14. (a) (i) List and explain the XML syntax rules in detail. [8]
(ii) Explain how a XML document can be displayed on a browser. [8]
or
(b) State and explain the information in a JSP document in detail. [16]
15. (a) Explain in detail the XML schema, built in and user defined data type in detail.
[16]
or
(b) (i) Explain the JDBC database access in detail. [8]
(ii) Explain the SOAP elements in detail. [8]

PRINCIPLES OF COMPILER DESIGN Question paper Nov/Dec 2011

Anna university
B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011.
Sixth Semester
Computer Science and Engineering
CS 2352 — PRINCIPLES OF COMPILER DESIGN
(Regulation 2008)
Time : Three hours
Maximum : 100 marks
Answer ALL questions.
PART A — (10 × 2 = 20 marks)
1.What is the role of lexical analyzer?
2. Give the transition diagram for an identifier.
3. Define handle pruning.
4. Mention the two rules for type checking.
5. Construct the syntax tree for the following assignment statement: a:=b*- c+b*-c.
6. What are the types of three address statements?
7. Define basic blocks and flow graphs.
8. What is DAG?
9. List out the criterias for code improving transformations.
10.When does dangling reference occur?
PART B — (5 × 16 = 80 marks)
11. (a) (i) Describe the various phases of compiler and trace it with theprogram
segment (position: = initial + rate * 60). (10)
(ii)State the complier construction tools. Explain them. (6)
Or
(b) (i) Explain briefly about input buffering in reading the source program for finding
the tokens. (8)
(ii) Construct the minimized DFA for the regular expression
(0+1)*(0+1) 10. (8)
12. (a) Construct a canonical parsing table for the grammar given below.
Also explain the algorithm used. (16)
E → E + T
F → (E )
E → T
F → id .
T → T * F
T → F
Or
(b) What are the different storage allocation strategies? Explain. (16)
13. (a) (i) Write down the translation scheme to generate code for assignment
statement. Use the scheme for generating three address code for the assignment
statement g: = a+b-c*d. (8)
(ii) Describe the various methods of implementing three-addressstatements. (8)
Or
(b) (i) How can Back patching be used to generate code for Boolean expressions and
flow of control statements? (10)
(ii) Write a short note on procedures calls. (6)
14. (a) (i) Discuss the issues in the design of code generator. (10)
(ii) Explain the structure-preserving transformations for basic
blocks. (6)
Or
(b) (i) Explain in detail about the simple code generator. (8)
(ii) Discuss briefly about the Peephole optimization. (8)
15. (a) Describe in detail the principal sources of optimization. (16)
Or
(b) (i) Explain in detail optimization of basic blocks with example. (8)
(ii) Write about Data flow analysis of structural programs. (8)

PRINCIPLES OF COMPILER DESIGN Question paper APRIL/MAY 2011

Anna University
B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2011
Sixth Semester
Computer Science and Engineering
CS 2352 — PRINCIPLES OF COMPILER DESIGN
(Regulation 2008)
Time : Three hours
Maximum : 100 marks
Answer ALL questions
PART A — (10 × 2 = 20 marks)
1. What is an interpreter?
2. Define token and lexeme.
3. What is handle pruning?
4. What are the limitations of static allocation?
5. List out the benefits of using machine-independent intermediate forms.
6. What is a syntax tree? Draw the syntax tree for the following statement:
. : c b c b a − ∗ + − ∗ =
7. List out the primary structure preserving transformations on basic block.
8. What is the purpose of next-use information?
9. Define dead-code elimination.
10. What is loop optimization?
PART B — (5 × 16 = 80 marks)
11. (a) (i) Describe the various phases of complier and trace the program
segment 4 : ∗ + = c b a for all phases. (10)
(ii) Explain in detail about compiler construction tools. (6)
Or
(b) (i) Discuss the role of lexical analyzer in detail. (8)
(ii) Draw the transition diagram for relational operators and unsigned
numbers in Pascal. (8)
12. (a) (i) Explain the error recovery strategies in syntax analysis. (6)
(ii) Construct a SLR construction table for the following grammar.
T E E + →
T E →
F T T ∗ →
F T →
( ) E F →
id F → (10)
Or
(b) (i) Distinguish between the source text of a procedure and its
activation at run time. (8)
(ii) Discuss the various storage allocation strategies in detail. (8)
13. (a) (i) Define three-address code. Describe the various methods of implementing
three-address statements with an example. (8)
(ii) Give the translation scheme for converting the assignments into
three address code. (8)
Or
(b) (i) Discuss the various methods for translating Boolean expression. (8)
(ii) Explain the process of generating the code for a Boolean expression in a single pass
using back patching. (8)
132 132 132
11267 3
14. (a) (i) Write in detail about the issues in the design of a code generator. (10)
(ii) Define basic block. Write an algorithm to partition a sequence of
three-address statements into basic blocks. (6)
Or
(b) (i) How to generate a code for a basic block from its dag
representation? Explain. (6)
(ii) Briefly explain about simple code generator. (10)
15. (a) (i) Write in detail about function-preserving transformations. (8)
(ii) Discuss briefly about Peephole Optimization. (8)
Or
(b) (i) Write an algorithm to construct the natural loop of a back edge. (6)
(ii) Explain in detail about code-improving transformations. (10)

OBJECT ORIENTED ANALYSIS AND DESIGN Question paper Nov/Dec 2011

Anna University
B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011.
Sixth Semester
Computer Science and Engineering
CS 2353 — OBJECT ORIENTED ANALYSIS AND DESIGN
(Common to Information Technology)
(Regulation 2008)
Time : Three hours Maximum : 100 marks
Answer ALL questions.
PART A — (10 × 2 = 20 marks)
1. List out any four reasons for the complexity of software.
2. What do you mean by use cases and actors?
3. Give the hint to identify the attributes of a class.
4. Define swim lane.
5. What do you mean by sequence diagram? Mention its use.
6. What do you mean by sequence number in UML? Where and for what it is
used?
7. Distinguish between coupling and cohesion.
8. Write a note on Patterns.
9. Define component with an example.
10. How will you reflect the version control information in UML diagram?
PART B — (5 × 16 = 80 marks)
11. (a) What do you mean by Unified Process in OOAD? Explain the phases with
suitable diagrams. (16)
Or
(b) By considering the Library Management system, perform the Object Oriented
System Development and give the use case model for the same (use include,
extend and generalization). (16)
12. (a) Explain the relationships that are possible among the classes in the UML
representation with your own example. (16)
Or
(b) Explain the following with an example :
(i) Conceptual class diagram
(ii) Activity Diagram. (8 + 8)
13. (a) With a suitable example explain how to design a class. Give all possible
representation in a class (name, attribute, visibility, methods, responsibilities).
(16)
Or
(b) What do you mean by interaction diagrams? Explain them with a suitable
example. (16)
14. (a) What is GRASP? Explain the design patterns and the principles used in it.
(16)
Or
(b) What is design pattern? Explain the GoF design patterns. (16)
15. (a) Explain the state chart diagram with a suitable example. Also define its
components and use. (16)
Or
(b) Consider the Hospital Management System applicationwith the following
requirements
(i) System should handle the in-patient, out-patient information through
receptionist.
(ii) Doctors are allowed to view the patient history and give their prescription.
(iii) There should be a information system to provide the required information.
Give the state chart, component and deployment diagrams.(6 + 6 + 4)

OBJECT ORIENTED ANALYSIS AND DESIGN Question paper APRIL/MAY 2011

Anna University
B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2011
Sixth Semester
Computer Science and Engineering
CS 2353 — OBJECT ORIENTED ANALYSIS AND DESIGN
(Common to Information Technology)
(Regulation 2008)
Time : Three hours
Maximum : 100 marks
Answer ALL questions
PART A — (10 × 2 = 20 marks)
1. What is Object Oriented Analysis and Design?
2. Define the inception step.
3. What is a Domain Model?
4. Define Aggregation and Composition.
5. What is the use of System sequence diagram?
6. List the relationships used in class diagram.
7. What is Design Pattern?
8. Define Coupling.
9. What is the use of operation contracts?
10. Give the meaning of Event, State and transition.
PART B — (5 × 16 = 80 marks)
11. (a) Briefly explain the different phases of Unified Process.
Or
(b) Explain with an example, how usecase modeling is used to describe functional
requirements. Identify the actors, scenario and use casesfor the example.
12. (a) Describe the strategies used to identify conceptual classes. Describe the steps to
create a domain model used for representing conceptual classes.
Or
(b) Explain about activity diagram with an example.
13. (a) Illustrate with an example, the relationship between sequence diagram and use
cases.
Or
(b) Explain with an example Interaction diagram.
14. (a) Explain about GRASP Patterns.
Or
(b) Write short notes on adapter, singleton, factory and observer patterns.
15. (a) Explain about implementation model (mapping design to code).
Or
(b) Discuss about UML deployment and component diagrams. Draw the diagrams for a
banking application.

ARTIFICIAL INTELLIGENCE Question paper Nov/Dec 2011

Anna University
B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011.
Sixth Semester
Computer Science and Engineering
CS 2351 — ARTIFICIAL INTELLIGENCE
(Common to Seventh Semester – Electronics and Instrumentation Engineering)
(Regulation 2008)
Time : Three hours
Maximum : 100 marks
Answer ALL questions.
PART A — (10 × 2 = 20 marks)
1. What is a rational agent?
2. State the significance of using heuristic functions?
3. Distinguish between predicate and propositional logic.
4. What factors justify whether the reasoning is to be done in forward or backward
reasoning?
5. Distinguish between state space search and plan space search.
6. Define partial order planning.
7. List two applications of Hidden Markov model.
8. What are the logics used in reasoning with uncertain information?
9. Define Inductive learning.
10. Distinguish between supervised learning and unsupervised learning.
PART B — (5 × 16 = 80 marks)
11. (a) Explain AO* algorithm with a suitable example. State the limitations in the
algorithm.
Or
(b) Explain the constraint satisfaction procedure to solve the crypt arithmetic problem.
CROSS
+ ROADS
DANGER
12. (a) Consider the following facts
Team India
Team Australia
Final match between India and Australia
India scored 350 runs Australia score 350 runs India lost 5 wickets Australia lost 7
wickets
The team which scored the maximum runs wins
If the scores are same then the team which lost minimum wickets wins the match.
Represent the facts in predicate, convert to clause form and prove by resolution
"India wins the match".
Or
(b) Analyse the missionaries and Cannibals problem which is stated as follows. 3
missionaries and 3 cannibals are on one side of the river along with a boat that can
hold one or two people. Find a way to get everyone to the other side, without leaving
a group of missionaries in one place outnumbered by the cannibals in that place.
(i) Formulate a problem precisely making only those distinctions necessary to
ensure a valid solution. Draw a diagram of the complete state space.
(ii) Design appropriate search algorithm for it.
13. (a) Explain the concept of planning with state space search. How is it different from
partial order planning?
Or
(b) What are planning graphs? Explain the methods of planning and acting in the real
world.
14. (a) Explain the concept of Bayesian network in representing knowledge in an
uncertain domain.
Or
(b) Write short notes on : (i) Temporal models
(ii) Probabilistic Reasoning.
15. (a) Explain in detail learning from observation and explanation based learning.
Or
(b) Explain in detail statistical learning methods and reinforcement learning.

ARTIFICIAL INTELLIGENCE QUESTION PAPER APRIL/MAY 2011

Anna University
B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2011
Sixth Semester
Computer Science and Engineering
CS 2351 — ARTIFICIAL INTELLIGENCE
(Regulation 2008)
Time : Three hours
Maximum : 100 marks
Answer ALL questions
PART A — (10 × 2 = 20 marks)
1. List down the characteristics of intelligent agent.
2. What do you mean by local maxima with respect to search technique?
3. What factors determine the selection of forward or backward reasoning
approach for an AI problem?
4. What are the limitations in using propositional logic to represent the
knowledge base?
5. Define partial order planner.
6. What are the differences and similarities between problem solving and
planning?
7. List down two applications of temporal probabilistic models.
8. Define Dempster-Shafer theory.
9. Explain the concept of learning from example.
10. How statistical learning method differs from reinforcementlearning method?
PART B — (5 × 16 = 80 marks)
11. (a) Explain in detail on the characteristics and applications of learning agents.
Or
(b) Explain AO* algorithm with an example.
12. (a) Explain unification algorithm used for reasoning under predicate logic with an
example.
Or
(b) Describe in detail the steps involved in the knowledge Engineering process.
13. (a) Explain the concept of planning with state space search using suitable examples.
Or
(b) Explain the use of planning graphs in providing better heuristic
estimates with suitable examples.
14. (a) Explain the method of handling approximate inference in Bayesian Networks.
Or
(b) Explain the use of Hidden Markov Models in Speech Recognition.
15. (a) Explain the concept of learning using decision trees and neural network
approach.
Or
(b) Write short notes on :
(i) Statistical learning. (8)
(ii) Explanation based learning. (8)

ADVANCED COMPUTER ARCHITECTURE Nov/Dec 2011

Anna University
B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011.
Sixth Semester
Computer Science and Engineering
CS 2354 — ADVANCED COMPUTER ARCHITECTURE
(Regulation 2008)
Time : Three hours
Maximum : 100 marks
Answer ALL questions.
PART A — (10 × 2 = 20 marks)
1. What is instruction level parallelism?
2. What are the advantages of loop unrolling?
3. What are the limitations of VLIW?
4. What is the use of branch-target buffer?
5. Distinguish between shared memory multiprocessor and messagepassing
multiprocessor.
6. Differentiate multithreading computers from multiprocessor systems
7. Define the terms cache miss and cache hit.
8. What is RAID?
9. What is a multi-core processor?
10. What is a cell processor?
PART B — (5 × 16 = 80 marks)
11. (a) (i) Explain the data and name dependencies with suitable example. (10)
(ii) Discuss about the benefits and limitations of static branch prediction and
dynamic branch prediction (6)
Or
(b) Briefly explain how to overcome data hazards with dynamic scheduling using
Tomasula’s approach. (16)
12. (a) (i) Describe the architecture of Itanium processor with the help of a block
diagram. (8)
(ii) Explain how ILP is achieved in EPIC processors (8)
Or
(b) (i) Describe the architectural features of IA64 processor in detail.(8)
(ii) What are the advantages and disadvantages of software-based and hardwarebased
speculation mechanism? (8)
13. (a) (i) Briefly compare instruction level parallelism with threadlevel
parallelism. (8)
(ii) Explain the basic architecture of a distributed memorymultiprocessor system.
(8)
Or
(b) (i) Explain various memory consistency models in detail. (10)
(ii) What is multithreading and what are the advantages ofmultithreading? (6)
14. (a) What is meant by cache coherence problem? Describe various protocols
for cache coherence. (16)
Or
(b) Briefly explain various I/O performance measures. (16)
15. (a) (i) Describe the architecture of typical CMT processor. (8)
(ii) Discuss the design issues for simultaneous multithreading. (8)
Or
(b) (i) Explain the architectural features of IBM cell processor in detail. (10)
(ii) Briefly compare SMT and CMP architectures. (6)

ADVANCED COMPUTER ARCHITECTURE April/May 2011 Question paper

Anna University
B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2011
Sixth Semester
Computer Science and Engineering
CS 2354—ADVANCED COMPUTER ARCHITECTURE
(Regulation 2008)
Time : Three hours
Maximum : 100 marks
Answer ALL questions
PART A — (10 × 2 = 20 marks)
1. What is loop unrolling? and what are its advantages?
2. Differentiate between static and dynamic branch prediction approaches.
3. What is fine-grained multithreading and what is the advantage and
disadvantages of fine-grained multithreading?
4. What a VLIW processor?
5. What is sequential consistency?
6. State the advantages of threading.
7. Differentiate between write-through cache and snoopy cache.
8. Compare SDRAM with DRAM.
9. What is multi–core processor and what are the application areas of multi-core
processors?
10. What is a Cell Processor?
PART B — (5 × 16 = 80 marks)
11. (a) Briefly describe any techniques to reduce the control hazard stalls. (16)
Or
(b) (i) Discuss about any two compiler techniques for exposing ILP in
detail. (8)
(ii) Explain how ILP is achieved using dynamic scheduling. (8)
12. (a) (i) Describe the architectural features of IA 64 Processors in detail. (10)
(ii) Explain the architecture of a typical VLIW processor in detail. (6)
Or
(b) (i) Describe the architectural features of Itanium Processor. (10)
(ii) Explain how instruction level parallelism is achieved in EPIC
processor. (6)
13. (a) (i) Describe the basic structure of a centralized shared-memory multiprocessor
in detail. (6)
(ii) Describe the implementation of directory-based cache coherence
protocol. (10)
Or
(b) (i) What are the advantages and disadvantages of distributed-memory
Multiprocessors? Describe the basic structure of a distributedmemory multiprocessor
in detail. (8)
(ii) Describe sequential and relaxed consistency model. (8)
14. (a) (i) With suitable diagram, explain how virtual address is mapped to L2 cache
address. (10)
(ii) Discuss about the steps to be followed in designing I/O system. (6)
Or
(b) Describe the optimizations techniques used in compilers to reduce cache miss rate.
(16)
15. (a) (i) Describe the features of SUN CMP architecture in detail. (6)
(ii) What are Multi Core processors? Explain how a multi core
processors works. (10)
Or
(b) (i) Discuss about the SMT kernel structure in detail. (8)
(ii) Describe the architecture of the IBM Cell Processor in detail. (8)

Tuesday 12 February 2013

Anna University,Chennai Nov/Dec 2012 Results

Anna University Nov/Dec 2012, January 2013 Results Is Getting Ready Together, Latest Official Information from Sources Today Reveals That First Semester Results Will Be Announced Along With Higher Semester and Anna University Results are Likely to Be Announced Soon

Result Processing Work Is In Progress. Official People Working For Results Publication Process, Anna University, Chennai Nov/Dec 2012/January 2013 Results Has Again Delayed Due To Pending Work and Undisclosed Reason Anna University, Chennai Results Will Be Announced Any time on the Basis of Work Completion. Sources Reveals That There Will Be a Huge Delay in Publication of Results (i.e) Results Publication May Be Pushed Towards Very End Of Feb 2013(Last Day) Or March 2013 First Week