AIM:- To write a C program to create a singly linked list implementation.

Size: px

Start display at page:

Download "AIM:- To write a C program to create a singly linked list implementation."

Abel Patrick
5 years ago
Views:

1 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 add records, get the data from the user and add them to the list. 4. If the choice is to delete records, get the data to be deleted and delete it from the list. 5. If the choice is to display number of records, count the items in the list and display. 6. If the choice is to search for an item, get the item to be searched and respond yes if the item is found, otherwise no. 7. Terminate the program PROGRAM: # include<stdio.h> # include<conio.h> # include<stdlib.h> int pos,pos1,i; struct list int no; struct list *next; *q,*temp,*head; void insert(); void del(); void display(); void exit(); void main() int choice; clrscr(); head=(struct list*)malloc(sizeof(struct list)); head->next=null; while(1) printf("\n 1.insert\n2.delete\n3.list all\n 4.exit"); printf("\nenter the choice:"); scanf("%d",&choice);

2 switch(choice) case 1: insert(); case 2: del(); case 3: display(); default: exit(0); void insert() int ch; temp = (struct list*) malloc(sizeof(struct list)); printf("\n enter the element:"); scanf("%d",&temp->no); head->next=temp; temp->next=null; printf("\n Enter the position u want to insert:"); printf("\n1.first\n2.middle\n3.end\n--->"); scanf("%d",&ch); switch(ch) case 1: temp->next=head->next; head->next=temp; case 2: printf("\n Enter the position:"); scanf("%d",&pos); for(i=1;i<pos-1;i++)

3 temp->next=q->next; q->next=temp; case 3: while(q->next!=null) q->next=temp; temp->next=null; void del() printf("\nlist is empty"); printf("\n Enter the position u want to delete:"); scanf("%d",&pos1); if(pos1==1) head->next=q->next; for(i=1;i<pos1-1;i++) q->next=q->next->next; void display() printf("\nlist is empty");

4 printf("\n the elements present in the list are:\n"); while(q!=null) printf("%d->",q->no); getch(); OUTPUT: RESULT: Thus the c program for creating singly linked list is implemented, executed, tested and verified successfully. DOUBLY LINKED LIST AIM:- To write a C program to implement a doubly linked list. ALGORITHM:- 1. Start the program. 2. Get the choice from the user. 3. If the choice is to add records, get the data from the user and add them to the list. 4. If the choice is to delete records, get the data to be deleted and delete it from the list. 5. If the choice is to display number of records, count the items in the list and display. 6. If the choice is to search for an item, get the item to be searched and respond yes if the item is found, otherwise no. 7. Terminate the program PROGRAM:

5 # include<stdio.h> # include<conio.h> # include<stdlib.h> int pos,pos1,i; struct list int no; struct list *prev,*next; *p,*q,*temp,*head; void insert(); void del(); void display(); void exit(); void main() int choice; clrscr(); head=(struct list*)malloc(sizeof(struct list)); head->next=null; while(1) printf("\n 1.insert\n2.delete\n3.list all\n 4.exit"); printf("\nenter the choice:"); scanf("%d",&choice); switch(choice) case 1: insert(); case 2: del(); case 3: display(); default: exit(0); void insert()

6 int ch; temp = (struct list*) malloc(sizeof(struct list)); printf("\n enter the element:"); scanf("%d",&temp->no); head->next=temp; temp->prev=head; temp->next=null; printf("\n Enter the position u want to insert:"); printf("\n1.first\n2.middle\n3.end\n--->"); scanf("%d",&ch); switch(ch) case 1: temp->next=q; q->prev=temp; head->next=temp; temp->prev=head; case 2: printf("\n Enter the position:"); scanf("%d",&pos); for(i=1;i<pos-1;i++) p=q->next; temp->next=p; p->prev=temp; q->next=temp; temp->prev=q; case 3: while(q->next!=null) q->next=temp; temp->prev=q; temp->next=null;

7 void del() printf("\nlist is empty"); printf("\n Enter the position u want to delete:"); scanf("%d",&pos1); if(pos1==1) head->next=q->next; q->prev=head; for(i=1;i<pos1-1;i++) p=q->next; q->next=p->next; p->prev=q; void display() printf("\nlist is empty"); printf("\n the elements present in the list are:\n"); while(q!=null) printf("%d->",q->no); getch();

8 OUTPUT: RESULT: Thus the c program for creating Doubly linked list is implemented, executed, tested and verified successfully.

POLYNOMIAL ADDITION. AIM:- To write a C program to represent a polynomial as a linked list and write functions for polynomial addition.

POLYNOMIAL ADDITION. AIM:- To write a C program to represent a polynomial as a linked list and write functions for polynomial addition. POLYNOMIAL ADDITION AIM:- To write a C program to represent a polynomial as a linked list and write functions for polynomial addition. ALGORITHM:- 1. Start the program 2. Get the coefficients and powers