Project 1 - Creation of user defined data type to implement the user interfaces for working with ‘Set’ (Mathematical Set theory) using Linked List
Overview of the Project:
In this project, interfaces for mathematical Set Theory are implemented using C programming language. User can give the input like two list of data and this program will give the output as the union and intersection of these two lists.
Aim:
Goals:
- Implementation of interface for mathematical Set Theory using C programming.
- Giving two list of data as input to get the output as union & intersection for given list of data.
Key Highlights of the Project:
- Creating two list of data using linked list method.
- Insert the node to 1st and 2nd list accordingly.
- Intersection of data of two lists.
- Getting Union of two list.
Deliverables of this project:
- Intersection of data of two list.
- Union of data of two list
Expected Outcomes:
- Student will get the Knowledge of creating the nodes using Linked List.
- Getting the intersection and Union of data of two list.
- Comparing the elements of two list.
Solution:
The main objective of the project is to do the mathematical set operation. The set operation has many operations such as
- UNION
- INTERSECTION
The created as a linked list and so I creating a structure it has collection of the different data. The main concept of linked list is self- referential structure .
Using the C Programming:
#include
#include
#include
struct Node {
int data;
struct Node* next;
};
void push(struct Node** head_ref, int new_data);
int isPresent(struct Node* head, int data);
struct Node* getUnion(struct Node* head1, struct Node* head2)
{
struct Node* result = NULL;
struct Node *t1 = head1, *t2 = head2;
while (t1 != NULL)
{
push(&result, t1->data);
t1 = t1->next;
}
while (t2 != NULL)
{
if (!isPresent(result, t2->data))
{
push(&result, t2->data);
}
t2 = t2->next;
}
return result;
}
struct Node* getIntersection(struct Node* head1, struct Node* head2)
{
struct Node* result = NULL;
struct Node* t1 = head1;
while (t1 != NULL)
{
if (isPresent(head2, t1->data))
{
push(&result, t1->data);
}
t1 = t1->next;
}
return result;
}
void push(struct Node** head_ref, int new_data)
{
struct Node* new_node = (struct Node*)malloc(sizeof(struct Node));
new_node->data = new_data;
new_node->next = (*head_ref);
(*head_ref) = new_node;
}
void printList(struct Node* node)
{
while (node != NULL)
{
printf("%d ", node->data);
node = node->next;
}
}
int isPresent(struct Node* head, int data)
{
struct Node* t = head;
while (t != NULL)
{
if (t->data == data)
{
return 1;
}
t = t->next;
}
return 0;
}
int main()
{
int n,m,temp,i;
printf("enter the value of number of value in link list(both):-");
fflush(stdout);
scanf("%d %d", &n, &m);
struct Node* head1 = NULL;
struct Node* head2 = NULL;
struct Node* intersecn = NULL;
struct Node* unin = NULL;
for(i=0;i { printf("Enter the value in link list1 %d:-",i); fflush(stdout); scanf("%d", &temp); push(&head1, temp); } for(i=0;i { printf("Enter the value in link list2 %d:-",i); fflush(stdout); scanf("%d", &temp); push(&head2, temp); } intersecn = getIntersection(head1, head2); unin = getUnion(head1, head2); printf("\n First list is "); printList(head1); printf("\n Second list is "); printList(head2); printf("\n Intersection list is "); printList(intersecn); printf("\n Union list is "); printList(unin); return 0; } Output 1: Output 2:
