Follow by Email

JNTU Anantapur PhD and MPhil Admission Notification 2012-13 @www.jntuanantapur.org

JNTU Anantapur PhD and M. Phil Admission Notification 2016-17 @www.jntuanantapur.org

http://www.examresultstoday.com/
JNTU Anantapur PhD and M. Phil Admission Notification 2016-17 @www.jntuanantapur.org
: 1.Jawaharlal Nehru Technological University Ananthapur JNTUA has announced admission notification for research programmers’ in various discipline for the academic year 2016-17. The University is offering M. Phil and Ph. D Programmers’ in Full Time (Regular) and Part Time (External) Modes. The research courses are offered in Engineering, Management, Pharmacy and Science disciplines. Following are details of subjects, eligibility and application procedure :< /span>

2.JNTU Anantapur PhD and M. Phil Admission Notification 2016-17. Specializations:
1. Engineering (Mechanical, EEE, ECE, CSE, Civil, Chemical, Biotechnology, Food Technology etc.)
2. Pharmacy
3. Management
4. Sciences ( Math’s, Physics and Chemistry etc.)

3.JNTU Anantapur PhD and M .Phil Admission Eligibility: Candidates must have Post Graduation in the concerned subject with minimum 50 percent marks. Candidates can download application forms from JNTU Ananthapur website @ www.jntuanantapur.org or www.jntua.ac.in. Completed application forms should be sent along with relevant enclosures to The Director I/C, Admissions, JNTUA, Anantapur- 515001. Last date for submission of completed applications is 31st May 2016.
JNTU Anantapur Ph.

JNTU Anantapur PhD and M. Phil Admission Notification 2016-17 @www.jntuanantapur.org

http://www.examresultstoday.com/
JNTU Anantapur PhD and M. Phil Admission Notification 2016-17@www.jntuanantapur.org
: 1.Jawaharlal Nehru Technological University Ananthapur JNTUA has announced admission notification for research programmers’ in various discipline for the academic year 2016-17. The University is offering M. Phil and Ph. D Programmers’ in Full Time (Regular) and Part Time (External) Modes. The research courses are offered in Engineering, Management, Pharmacy and Science disciplines. Following are details of subjects, eligibility and application procedure:

2.JNTU Anantapur PhD and M. Phil Admission Notification 2016-17 Specializations:
1. Engineering (Mechanical, EEE, ECE, CSE, Civil, Chemical, Biotechnology, Food Technology etc.)
2. Pharmacy
3. Management
4. Sciences (Math’s, Physics and Chemistry etc.)

3.JNTU Anantapur PhD and M. Phil Admission Eligibility: Candidates must have Post Graduation in the concerned subject with minimum 50 percent marks. Candidates can download application forms from JNTU Ananthapur website @ www.jntuanantapur.org or www.jntua.ac.in. Completed application forms should be sent along with relevant enclosures to The Director I/C, Admissions, JNTUA, Anantapur- 515001. Last date for submission of completed applications is 31st May 2016.
JNTU Anantapur Ph D|jntu anantapur Ph.d notification 2016|jntu anantapur PhD notification 2016-17|jntu anantapur Ph.D notification| jntu anantapur Ph. D notification 2016|jntu anantapur p.hd notification 2016|jntu anantapur Ph.D syllabus|jntu anantapur Ph. D application|jntu anantapur Ph.D admission 2016|jntu anantapur Ph. D application form 2016|jntu anantapur Ph. D notification 2016-17pdf
.D|jntu anantapur Ph. D notification 2016|jntu anantapur Ph. D notification 2016-17|jntu anantapur Ph.D notification|jntu anantapur Ph. D notification 2016|jntu anantapur Ph. D notification 2016|jntu anantapur Ph. D syllabus|jntu anantapur Ph. D application|jntu anantapur Ph. D admission 2016|jntu anantapur Ph.D application form 2016|jntu anantapur Ph. D notification 2016-13 pdf
11:25 AM | 0 comments | Read More
Blogger Tricks

WEB TECHNOLOGY (WT)–Nov / Dec 2016 Question Paper

Anna University

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2016.

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 Java-script 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 HTML with Also explain about the HTML DTD. (8)

(ii) Discuss on any four HTTP request methods. (8)

12. (a) (i) Explain any eight CSS text properties. (8)

(ii) Discuss java-script Array object in detail. (8)

Or

(b) (i) Discuss about Java-script 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 right-clicks 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 X PATH nodes in detail. (8)

(ii) Explain about the object that helps AJAX reload parts of a web page without reloading the whole page. (8)

Or

(b) What is a Java-beans 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)

11:02 AM | 0 comments | Read More

ADVANCED COMPUTER ARCHITECTURE (ACA)–April / May 2011 Question Paper

Anna University

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

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 multi-threading and what is the advantage and
disadvantages of fine-grained multi-threading?
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 Titanium 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 distributed-memory 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)

10:58 AM | 0 comments | Read More

ADVANCED COMPUTER ARCHITECTURE (ACA)–Nov / Dec 2011 Question Paper

ADVANCED COMPUTER ARCHITECTURE (ACA)–Nov / Dec 2011 Question Paper


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 message-passing 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 hardware-based speculation mechanism? (8)


13. (a) (i) Briefly compare instruction level parallelism with thread-level parallelism. (8)
(ii) Explain the basic architecture of a distributed memory multiprocessor system. (8)


Or


(b) (i) Explain various memory consistency models in detail. (10)
(ii) What is multithreading and what are the advantages of multithreading? (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)

10:51 AM | 0 comments | Read More

OBJECT ORIENTED ANALYSIS AND DESIGN (OOAD)–April / May 2011 Question Paper

OBJECT ORIENTED ANALYSIS AND DESIGN (OOAD)–April / May 2016 Question Paper

http://www.examresultstoday.com/

Anna University

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

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 cases for 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.

10:49 AM | 0 comments | Read More

OBJECT ORIENTED ANALYSIS AND DESIGN (OOAD)–Nov / Dec 2016 Question Paper

OBJECT ORIENTED ANALYSIS AND DESIGN (OOAD)–Nov / Dec 2016 Question Paper

http://www.examresultstoday.com/

Anna University

B.E./B. tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2016.

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 application with 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)

10:45 AM | 0 comments | Read More

PRINCIPLES OF COMPILER DESIGN (POCD)–April / May 2011 Question Paper

PRINCIPLES OF COMPILER DESIGN (POCD)–April / May 2011 Question Paper

http://www.examresultstoday.com/

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 tran

sformations. (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)

10:33 AM | 0 comments | Read More

PRINCIPLES OF COMPILER DESIGN (POCD)–Nov / Dec 2016 Question Paper

http://www.allexamnews.in
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 criteria’s 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 the program 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-address statements. (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
|principles of compiler design pdf
|principles of compiler design aho ullman pdf
|principles of compiler design pdf download
|principles of compiler design aho ullman
|principles of compiler design by a.a.puntambekar
|principles of compiler design question bank
|principles of compiler design syllabus
|principles of compiler design aho ullman free ebook download
|principles of compiler design ppt
|principles of compiler design by a.puntambekar pdf


7:10 PM | 0 comments | Read More

ARTIFICIAL INTELLIGENCE–Nov / Dec 2016 Question Paper

http://www.allexamnews.in
B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2016.
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 cryptarithmetic problem.
1
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)
Analyses 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
|artificial intelligence
|artificial intelligence movie
|artificial intelligence chat
|artificial intelligence a modern approach
|artificial intelligence software
|artificial intelligence definition
|artificial intelligence future
|artificial intelligence programs
|artificial intelligence robot
|artificial intelligence in medicine

7:06 PM | 0 comments | Read More