2024 2025 Student Forum > Management Forum > Main Forum

 
  #1  
8th December 2012, 02:02 PM
Unregistered
Guest
 
Anna University Previous Year Question Papers For EEE Third Semester

Hello Sir, I am looking for Anna University Previous Year Question Papers For EEE third semester So can you provide me the page where i can download the test papers.
Similar Threads
Thread
BPUT Previous Year Semester Question Paper
Anna university model question papers for first semester
Anna University Previous Year Question Papers for EEE
Anna University Question Papers For CSE 3rd Semester
Anna University BE Electrical Engineering 5th Sem previous year question papers
Question papers of B.E ECE of 5th semester Anna University
Anna University Coimbatore Previous Year Question Papers for ECE
Anna University Chennai CS 5th semester last year question papers
Anna University MCA 4th semester question papers
Previous year question papers of MBA 1st semester of Punjab Technical University
B.Com 1st Semester Previous Question Papers
B.SC Physics 1st semester previous year question papers of Maharshi Dayanand Universi
Anna University BE CSE 5th semester previous year question papers
BE Civil Engineering 6th semester last year question papers of Anna University
Previous year question papers of BE CSE 5th semester of Anna University
M.Com semester 1 previous year question papers of Karnataka State Open University
Anna University BE CSE previous year question papers of DBMS
BA LLB 1st semester previous year question papers of Karnataka Law University
Anna University Chennai 6th semester question papers
Anna University BE ECE 6th semester previous year question papers
  #2  
10th December 2012, 09:09 AM
Super Moderator
 
Join Date: May 2012
Re: Anna University Previous Year Question Papers For EEE Third Semester

Here I am giving you Previous Year Question Paper of
Electrical and Electronics Engineering of Data Structures and Algorithms subject of Anna University as belwo:-

PART A — (10 × 2 = 20 Marks)

1. List out the areas in which data structures are applied extensively.
2. Convert the expression ((A+B)*C-(D-E)^(F +G)) to equivalent Prefix and
Post fix notations.
3. How many different trees are possible with 10 nodes?
4. What is an almost complete binary tree?
5. In an AVL tree, at what condition the balancing is to be done?
6. What is the bucket size, when the overlapping and collision occur at same
time?
7. Define graph.
8. What is a minimum spanning tree?
9. Define NP hard and NP complete.
10. What is meant by dynamic programming?

PART B — (5 × 16 = 80 Marks)

11. (a) (i) What is a linked list? Explain with suitable program segments any
four operations of a linked list. (Marks 12)
(ii) Explain with a pseudo code how a linear queue could be converted
into a circular queue. (Marks 4)
Or
(b) (i) What is a stack ADT? Write in detail about any three applications
of stack. (Marks 11)
(ii) With a pseudo code explain how a node can inserted at a user
specified position of a doubly linked list. (Marks 5)
12. (a) (i) Discuss the various representations of a binary tree in memory with
suitable example. (Marks 8)
(ii) What are the basic operations that can be performed on a binary
tree? Explain each of them in detail with suitable example. (Marks 8)
Or
(b) (i) Give an algorithm to convert a general tree to binary tree. (Marks 8)
(ii) With an example, explain the algorithms of in order and post order
traversals on a binary search tree. (Marks 8)
13. (a) What is an AVL tree? Explain the rotations of an AVL tree. (Marks 16)
Or
(b) (i) Explain the binary heap in detail. (Marks 8)
(ii) What is hashing? Explain any two methods to overcome collision
problem of hashing. (Marks 8)
14. (a) (i) Explain Dijkstra's algorithm and solve the single source shortest
path problem with an example. (Marks 12)
(ii) Illustrate with an example, the linked list representation of graph.
(Marks 4)
Or
(b) (i) Write the procedures to perform the BFS and DFS search of a
graph. (Marks 8)
(ii) Explain Prim's algorithm to construct a minimum spanning tree
from an undirected graph. (Marks 8)
15. (a) (i) With an example, explain how will you measure the efficiency of an
algorithm. (Marks 8)
(ii) Analyze the linear search algorithm with an example. (Marks 8)
Or
(b) Explain how the travelling salesman problem can be solved using greedy
algorithm. (Marks 16)


Tags
previous papers

Quick Reply
Your Username: Click here to log in

Message:
Options

Thread Tools



All times are GMT +5. The time now is 10:57 PM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2024, vBulletin Solutions Inc.
SEO by vBSEO 3.6.0 PL2

1 2 3 4