Anna
University, Chennai Nov/Dec 2012 Examinations

Rejinpaul.com
Important Questions

Cs2201/
Data Structures

III
Sem CSE

Unit
I-V

1.
Derive
an ADT to perform insertion and deletion
in a singly linked list

2.
Describe
circular queue implementation in detail giving all the relevant features

3.
What
are the different operations that can be performed in a queue? Explain in
detail

4.
Explain
the different types of linked lists and its implementation

5.
Explain
in detail about ADT binary search tree

6.
Write
an algorirhm for pre-order and postorder traversal of a binary tree

7.
Explain
the three standard ways of traversing a binary tree T with a recursive algorithm

8.
Explain
the tree traversals. Give all the essential aspects

9.
Explain
the operations which are done in B- Tree with examples

10.What is heap order
property? Explain the operations which can be done in heap with examples

11.
Explain in detail about binary heap and construct a min heap tree
for the elements 7,3,8,7,2,3,6,9,4

12.What are AVL trees?
Describe the different rotations defined for AVL tree. Insert the following
elements step by step in sequence into an empty AVL tree 18, 19, 22, 20, 29,
32, 24

13.
Briefly
explain the three common collision resolution strategies in open addressing
hashing

14.Explain about
disjoint sets and its operation in detail

15.
Write
about the different types of hashing techniques in detail

16.Explain the
Dijkstra’s single source shortest path algorithm with an example

17.
Explain
the prim’s algorithm with an example

18.Explain topological
sort with an example

19.Explain BFS with an
example

Rejinpaul.com Comment

Facebook Comment