HTML and Data strutures lab manual

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
NAME OF THE SUBJECT: DATA STRUCTURES AND ALGORITHMS LABORATORY
SUBJECT CODE: EE 2209 BRANCH: EEE
STAFF NAME: ALAGENDRAN.S YEAR/ SEM: II/III
AIM:
To develop skills in design and implementation of data structures and their applications.

1. Implement singly and doubly linked lists.
2. Represent a polynomial as a linked list and write functions for polynomial addition.
3. Implement stack and use it to convert infix to postfix expression
4. Implement array-based circular queue and use it to simulate a producer-consumer problem.
5. Implement an expression tree. Produce its pre-order, in-order, and post-order traversals.
6. Implement binary search tree.
7. Implement insertion in AVL trees.
8. Implement priority queue using heaps
9. Implement hashing techniques
10. Perform topological sort on a directed graph to decide if it is acyclic.
11. Implement Dijkstra's algorithm using priority queues
12. Implement Prim's and Kruskal's algorithms
13. Implement a backtracking algorithm for Knapsack problem
14. Implement a branch and bound algorithm for traveling salesperson problem
15. Implement any randomized algorithm.

EX.NO:1(a) IMPLEMENTATION OF SINGLY LINKED LIST
AIM:
To write a ‘C’ program to create a singly linked list implementation.
ALGORITHM:
1. Start the program.
2. Get the choice from the user.
3. If the choice is to insert, get the data from the user and them to the list.
4. If the choice is to delete, get the data to be deleted and delete it from the list.
5. If the choice is to display, count the items in the list and display.
6. Terminate the program.
PROGRAM:
#include
#include
#include void insert (int x); void deletion (int x); void display (); struct node
{
int element; struct node *next;