ANNA UNIVERSITY : CHENNAI 600 025

B.E.DEGREE PRACTICAL EXAMINATIONS OCT/NOV 2012.

EE2209- DATA STRUCTURES AND ALGORITHMS LABORATORY
B.E (COMMON TO EEE,E&IE &ICE)
III SEMESTER
Regulations - 2008
Time: 3 Hours

Maximum Marks: 100

Write a C program to implement the following in a singly linked list with integers as 100
elements:
a) Addition of a node in between two nodes.
b) Addition of a node at the end.
c) Check and display all the duplicates in the list after adding 10
elements in the list.

Write a C program to implement the following in a singly linked list with integers as 100
elements:
a) Deletion of a node at the beginning.
b) Deletion of a node in between two nodes.
c) Deletion of a node at the end.
d) Search if key element is present in the list.

Write a C program to implement the following in a doubly linked list with integers as 100
elements:
a) Addition of a node at the beginning.
b) Addition of a node in between two nodes.
c) Addition of a node at the end.
d) Search if key element is present in the list.
Write a C program to implement the following in a doubly linked list with integers as 100
elements:
a) Deletion of a node at the beginning.
b) Deletion of a node in between two nodes.
c) Deletion of a node at the end.
d) Search if key element is present in the list.

Write a C program to implement the following in a singly linked list with 100
charactersaselements:
a) Addition of a node in the list.
b) Search if a key character is present in the list.

Write a C program to implement the following in a singly linked list with characters 100
as elements:
a) Creation of a list with 10 nodes with characters as elements.
b) Sort the elements in the list using any simple sorting technique.

Write a C program to perform addition of two polynomials using singly linked list.

100

Write a C program to perform polynomial addition using doubly linked list.

100

Write a C program to create a Stack ADT using arrays. Perform push and pop 100
operations. Write modules to check stack overflow and empty conditions.

10 Develop Push and Pop routines of Stack. Use it to convert an infix expression to 100
postfix expression.

11 Write a C program to implement the circular queue ADT and perform insertion and 100
deletion operations using arrays and use it to simulate producer consumer problem
with bounded buffer.

12 Obtain a binary expression as input from the user. Produce the output after 100
performing in-order and post-order traversal of the tree.

13 Represent the expression (a/b*c+(d+f))-h) as a tree. Produce the output after 100
performing pre-order and post - order traversal of the tree. Write non recursive
preorder and postorder procedures.

14 Create a binary search tree with n integers and perform insertion and search 100
operations on it.

15 Create a binary search tree with n integers and perform deletion of elements and 100
search oper

16 Create a binary search tree and perform insertion and search operations on it.

100

17 Write a C program to perform insertion in an AVL tree.

100

18 Write a C program to implement a priority queue using a binary min heap.

100

19 Write a C program to implement a priority queue using a binary max heap.

100

20 Write a C program to implement hashing with open addressing.

100

21 Write a C program to implement topological sort on a directed graph.

100

22 Write a C program to implement Prims algorithm to find the minimum spanning tree 100
of an undirected graph.

23 Write a C program to implement Kruskals algorithm to find the minimum spanning 100
tree of an undirected graph.

24 Write a C program to implement knapsack algorithm based on backtracking 100

technique.

25

Write a C program to implement travelling salesman algorithm using branch and 100
bound technique\

26 Write a C program to implement randomized quicksort algorithm.

100