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

OFFLINE

1.

#include <stdio.h>
#include <stdlib.h>

// A structure of linked list node
struct node

{
int data;
struct node *next;

} *indA, *indB, *unionind, *intersectionind;

void initialize()

{
indA = indB = NULL;
}
//Given a Inserts a node in front of a singly linked list.

void insert(struct node **head, int num)

{
// Create a new Linked List node
struct node* newNode = (struct node*) malloc(sizeof(struct node));
newNode->data = num;
// Next pointer of new node will point to head node of linked list
newNode->next = *head;
//make new node as new head of linked list
*head = newNode;
}

// Searches an element in Linked List by linearly traversing from head to tail
int search(struct node *head, int num)

{
while (head != NULL)

{
if (head->data == num)

{
return 1;
}
head = head->next;
}
return 0;

}

//Returns the union of two given linked list

struct node* findunion(struct node *indA, struct node *indB)

{
unionind = NULL;
// Add all nodes of first Linked List to unionind
struct node *temp = indA;
while(temp != NULL)

{
insert(&unionind, temp->data);
temp = temp->next;
}
// Insert those nodes of indB which is not present in indA
while(indB != NULL)

{
if(!search(indA, indB->data))

{
insert(&unionind, indB->data);
}
indB = indB->next;
}
return unionind;
}

//Returns the Linked List which contains common nodes of two given linked list

struct node* intersection(struct node *indA, struct node *indB)

{
intersectionind = NULL;
//Search every element of indA in intB, If found then add it to intersection List
while(indA != NULL)

{
if(search(indB, indA->data))

{
insert(&intersectionind, indA->data);
}
indA = indA->next;
}
return intersectionind;
}
//Prints a linked list from head node till tail node

void printLinkedList(struct node *nodePtr)

{
while (nodePtr != NULL)

{
printf("%d", nodePtr->data);
nodePtr = nodePtr->next;
if(nodePtr != NULL)
printf("***");

}
}

int main()

{
int i, indACount, indBCount, temp;
initialize();
//Creating First linked List
printf("Enter number of nodes in first Linked List\n");
scanf("%d", &indACount);
printf("Enter %d integers\n", indACount);
for(i=0; i<indACount; i++)

{
scanf("%d", &temp);
insert(&indA, temp);
}
printLinkedList(indA);
printf("\nEnter number of nodes in second Linked List\n");
scanf("%d", &indBCount);
printf("Enter %d integers\n", indBCount);
for(i=0; i<indBCount; i++)

{
scanf("%d", &temp);
insert(&indB, temp);
}
printLinkedList(indB);
//printing Union of two given linked list
findunion(indA, indB);
intersection(indA, indB);
printf("\nUnion ind\n");
printLinkedList(unionind);
printf("\nIntersection ind\n");
printLinkedList(intersectionind);

return 0;
}