Project 1 - Creation of user defined data type to implement the user interfaces for working with ‘Set’ (Mathematical Set theory)

PROJECT:1

#include<stdio.h>
#define SIZE 50

int S1[SIZE],S2[SIZE],S3[SIZE];
void accept(int S[],int n)
{
int i;
for(i=1;i<=n;i++)
scanf("%d",&S[i]);
S[0]=n;

}
void display(int S[])
{
int n,i;
n=S[0];
printf("{");
for(i=1;i<=n;i++)
printf("%d",S[i]);
printf("}");
}
int ele_pre(int S[],int x)
{
int n,i;
n=S[0];
for(i=1;i<=n;i++)
if(S[i]==x)
return 1;
return 0;
}
void set_union(int S1[],int S2[])
{
int n,i,m;
n=S1[0];
for(i=1;i<=n;i++)
S3[i]=S1[i];
m=S2[0];
for(i=1;i<=m;i++)
if(!ele_pre(S1,S2[i]))
S3[++n]=S2[i];
S3[0]=n;

}

void intersection(int S1[],int S2[])
{
int n,i,j=0;
n=S1[0];
for(i=1;i<=n;i++)
if(ele_pre(S2,S1[i]))
S3[++j]=S1[i];
S3[0]=j;

}
int main()
{
int n;
printf("--------------------------------------------");
printf("nProgram to perform the set operations");
printf("n--------------------------------------------");
printf("nHow many element for Set-1");
scanf("%d",&n);
printf("nEnter elementsn");
accept(S2,n);

set_union(S1,S2);
printf("nS1^S2=S3=");
display(S3);

intersection(S1,S2);
printf("nS1^S2=S3=");
display(S3);
printf("n--------------------------------------------n");
}

BY LINKLIST METHOD

#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
/* Link list node */
struct Node {
int data;
struct Node* next;
};

void push(struct Node** head_ref, int new_data);

bool isPresent(struct Node* head, int data);

/* Function to get union of two
linked lists head1 and head2 */
struct Node* getUnion(
struct Node* head1,
struct Node* head2)
{
struct Node* result = NULL;
struct Node *t1 = head1, *t2 = head2;

// Insert all elements of
// list1 to the result list
while (t1 != NULL) {
push(&result, t1->data);
t1 = t1->next;
}

// Insert those elements of list2
// which are not present in result list
while (t2 != NULL) {
if (!isPresent(result, t2->data))
push(&result, t2->data);
t2 = t2->next;
}

return result;
}

/* Function to get intersection of
two linked lists head1 and head2 */
struct Node* getIntersection(struct Node* head1,
struct Node* head2)
{
struct Node* result = NULL;
struct Node* t1 = head1;

// Traverse list1 and search each element of it in
// list2. If the element is present in list 2, then
// insert the element to result
while (t1 != NULL) {
if (isPresent(head2, t1->data))
push(&result, t1->data);
t1 = t1->next;
}

return result;
}

/* A utility function to insert a
node at the beginning of a linked list*/
void push(struct Node** head_ref, int new_data)
{
/* allocate node */
struct Node* new_node
= (struct Node*)malloc(
sizeof(struct Node));

/* put in the data */
new_node->data = new_data;

/* link the old list off the new node */
new_node->next = (*head_ref);

/* move the head to point to the new node */
(*head_ref) = new_node;
}

/* A utility function to print a linked list*/
void printList(struct Node* node)
{
while (node != NULL) {
printf("%d ", node->data);
node = node->next;
}
}

/* A utility function that returns true if data is
present in linked list else return false */
bool isPresent(struct Node* head, int data)
{
struct Node* t = head;
while (t != NULL) {
if (t->data == data)
return 1;
t = t->next;
}
return 0;
}

/* Driver program to test above function*/
int main()
{
/* Start with the empty list */
struct Node* head1 = NULL;
struct Node* head2 = NULL;
struct Node* intersecn = NULL;
struct Node* unin = NULL;

/*create a linked lists 10->15->5->20 */
push(&head1, 10);
push(&head1, 20);
push(&head1, 30);
push(&head1, 40);

/*create a linked lists 8->4->2->10 */
push(&head2, 5);
push(&head2, 10);
push(&head2, 15);
push(&head2, 20);

intersecn = getIntersection(head1, head2);
unin = getUnion(head1, head2);

printf("\n First list is \n");
printList(head1);

printf("\n Second list is \n");
printList(head2);

printf("\n Intersection list is \n");
printList(intersecn);

printf("\n Union list is \n");
printList(unin);

return 0;
}