Anna University Coimbatore 2009 B.E Electrical and Electronics Engineering /data structures and algorithms - Question Paper

ANNA UNIVERSITY COIMBATORE
B.E./B.Tech. DEGREE EXAMINATION:DECEMBER 2009
REGULATION-2008
THIRD SEMESTER
(COMMON TO EEE/EIE/ICE)
080300003-DATA STRUCTURES AND ALGORITHMS
Time : three hours Maximum : 100 marks
Answer ALL ques..
PART A — (20 * two = 40 marks)
1. elaborate the advantage of modularity?
2. elaborate the 2 basic operation on array?
3. provide any 2 example for linked list
4. What is circularly linked list?
5. Differentiate LIFO and FIFO and provide typical examples of it.
6. What is a tree?why it is used.
7. What is the need for non-linear data structure?
8. elaborate the operation on the binary tree?
9. What is the majar drawback of sepsrste chaining hashing?
10.What is a balance factor for any node in AVL tree?
11.What is heap?
12.What is linear probing?
13.Define the following:
(i)Graph (ii)cycle
14.What is Biconnectivity?
15.Give any tow typical application of graphs.
16.where is Huffman coding is used?
17.What is principle of divide and conquer algorithms?
18.What do you mean by best fit in Bin packing?
19.What is the principle of randomized algorithms?
20.List out any 2 examples for NP complete issues.

PART B — (5 * 12 = 60 marks)

21.Explain the operation of a linked list.Also compara linked list and Array
22.Explain the different traversals in binary tree with example.
23.What is AVL tree? Also write suitable rotation algorithm.
24.Expain the shortest path algorithm with diagram.
25.Expain the kruskal's algorithm with diagram.
26.Expain the concept of stack and briefed on its 2 functions.
27.What is hashing?list out the different techniques of hashing.
28.Write short noteson folloeing:(i)B-tree(ii)Dynamic programming

Attachment: anna-university-coimbatore-2009-b-e-electrical-and-electronics-engineering-694-1.txt

Earning:   Approval pending.