Вы находитесь на странице: 1из 2

# ANNA UNIVERSITY : CHENNAI 600 025

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

IT2205- DATA STRUCTURES AND ALGORITHMS LAB

## B.TECH INFORMATION TECHNOLOGY

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
1
elements:
a) Addition of a node in the list
b) Deletion of a node from the list.
Write a C program to implement the following in a singly linked list with integers as 100
2
elements:
a) Addition of a node in the list.
b) Check if there are duplicating elements in the list.

Write a C program to implement the following in a singly linked list with characters 100
3
as elements:
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
4
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 implement the following in a doubly linked list with integers as 100
5
elements:
a) Addition of a node in the list.
b) Deletion of a node from the list.
Write a C program to implement the following in a doubly linked list with integers as 100
6
elements:
a) Addition of a node in the list.
b) Check if there are duplicating elements in the list.

Write a C program to implement the following in a doubly linked list with integers as 100
7
elements:
a) Addition of a node in the list.
b) Search if the key element is present in the list.

Write a C program to perform addition of two polynomials using singly linked list.
8 100
Write a C program to perform addition of polynomials using doubly linked list.
9 100

10 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.
11 Implement a Stack ADT using singly linked lists and perform push and pop 100
operations.
12 Develop Push and Pop routines of Stack. Use it to convert an infix expression to 100
postfix expression.
13 Write a C program to implement array based circular queue. Perform insertion, 100
deletion and search operations in it.
14 Write a C program to simulate producer consumer problem using array based circular 100
queue.

15 Write the non recursive procedures for inorder and postorder traversals of a tree. 100

16 Write the non recursive procedures for inorder and preorder traversals of a tree. 100

17 Represent the expression a*b + (c/(d+f))*g-h as a tree. Produce the output after 100
performing recursive inorder and postorder traversal of the tree.
Represent the expression a+b / (c/(d+f))+g-h as a tree. Produce the output after
18 100
performing recursive inorder and pre-order traversal of the tree.
Develop a C program to create a binary search tree with 10 integers and perform
19 100
insertion and deletion operations on it.
Develop a C program to create a binary search tree and perform insertion and search
20 100
operations on it.
Write a C program to implement a priority queue using a binary min heap.
21 100

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

## 23 Write a C program to implement hashing with open addressing. 100

24 Write a C program to implement Dijkstras algorithm to find the shortest path 100
between nodes in a graph.

25 Develop a program to find the maximum profit obtained in a knapsack problem. 100