Annamalai University 2010-4th Sem B.E Computer Science and Engineering , (ester) coec-403data structure s and algorithms - Question Paper

B.E. DEGREE EXAMINATION,2010

(COMPUTER SCIENCE AND ENGINEERING)

(FOURTH SEMESTER)

COEC-403. DATA STRUCTURE S AND ALGORITHMS
(New Regulation)

(For the students joined during 2007-08 onwards)
[may] [Time: 3hours]


Answer any 5 questions,
choosing 1 ques. from every Unit .
All ques. carry equal marks.



UNIT-I
1.Write the procedure to convert the infix to postfix
with an example . [marks 12]

2.Describe in detail about the performance analyze
of an algorithm. [marks 12]


UNIT-II

3.Define Linked list. discuss the Singly Linked list
With an example . [marks 12]

4.Describe briefly the dynamic Storage Management
techniques [marks 12]

UNIT-III

5.Explain binary tree with the tree traversal methods. [marks 12]

6.Define Expression tree . discuss the procedure to
construct the expression tree. [marks 12]

UNIT-IV

7.Define Hashing and discuss the hashing Techniques
with an example. [marks 12]

8.Construct a minimum spanning tree using krushal's
algorithm with your own example . [marks 12]

UNIT-V

9.Show a tree structure for recursive calls made in the
issue of tower of Hanoi. [marks 12]

10.Explain in detail about Game trees.
[marks 12]

Earning:   Approval pending.