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

main.c

#include"list.h"
//#define DEBUG_MAIN
int main()
{
int first_list_nodes = 0, second_list_nodes = 0, first_list_items = 0, second_list_items = 0;

printf("Enter the number of Nodes in first List: ");
fflush(stdout);
scanf("%d",&first_list_nodes);
printf("Enter %d the elements: ",first_list_nodes);
for(int i=0;i<first_list_nodes;i++)
{
fflush(stdout);
scanf("%d",&first_list_items);
head1 = insert_node(head1,first_list_items);
}
display_list(head1);
printf("\n Enter the number of Nodes in Second List:");
fflush(stdout);
scanf("%d",&second_list_nodes);
printf("Enter %d the elements: ",second_list_nodes);
for(int i=0;i<second_list_nodes;i++)
{
fflush(stdout);
scanf("%d",&second_list_items);
head2 = insert_node(head2,second_list_items);
}
display_list(head2);
res_union = get_union(head1,head2);

#ifdef DEBUG_MAIN
printf("\n Value of Head1 and Head2 : %d %d",head1,head2);
#endif

#ifdef DEBUG_MAIN
printf("\n VAlue of Head1 and Head2 after performing union: %d %d \n",head1,head2);
printf("Value of res_union: %d \n",res_union);
#endif

printf("Here is the result of union: ");
display_list(res_union);
res_intersection = get_intersection(head1,head2);

#ifdef DEBUG_MAIN
printf("\n Value of HEad1 and Head2 after performing union : %d %d\n",head1,head2);
printf("Value of res_intersection: %d\n",res_intersection);
#endif

printf("Here is the result of intersection: ");
display_list(res_intersection);
}

List.h

#ifndef LIST_H_
#define LIST_H_

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

//....Define the Node..../
typedef struct node
{
int data;
struct node *next;
}Node;

static Node *head1,*head2,*head,*head_union,*head_intersection,*newnode,*tail,*res_union,*res_intersection;

//....Define the Function.../

Node *insert_node(Node *head_ref, int n);
void display_list(Node *head_ref);
Node *get_union(Node *head_pointer1,Node *head_pointer2);
Node *get_intersection(Node *head_pointer1,Node *head_pointer2);
int compare(Node *head,int data);

#endif /LIST_H_/

List.c

#include "list.h"

void display_list(Node *head_ref)
{
#ifdef DEBUG
printf("Entering Display function\n");
#endif
if(head_ref == 0)
{
printf(" List is empty.");
}
else
{
tail = head_ref;
while(tail != 0)
{
printf("%d ", tail->data);// prints the data of current node
tail = tail->next;// advances the position of current node
}
tail = newnode;
}
#ifdef DEBUG
printf("Value of tail is :%d\n",tail);
#endif
}

Node *insert_node(Node *head_ref,int n)
{
printf("\nInserting Elements at the beginning...\n");
newnode =(Node*) malloc(sizeof(Node));
printf("Address of created newnode :%d\n",newnode);
newnode->data = n;
printf("Inserted value is :%d\n",newnode->data);
newnode->next = head_ref;
head_ref = newnode;
#ifdef DEBUG
printf("Head Address: %d\n",head_ref);
printf("Newnode Address: %d\n",newnode);
printf("Exiting insert function\n");
#endif
return head_ref;
}

Node *get_union(Node *head_pointer1,Node *head_pointer2)
{
while(head_pointer1 != 0)
{
head_union = insert_node(head_union,head_pointer1->data);
head_pointer1 = head_pointer1->next;

}
while(head_pointer2 != 0)
{
if(!compare(head_union,head_pointer2->data))
head_union = insert_node(head_union,head_pointer2->data);
head_pointer2 = head_pointer2->next;
}
return head_union;
}

int compare(Node *head,int data)
{
while (head != NULL)
{
if (head->data == data)
return 1;
head = head->next;
}
return 0;
}

Node *get_intersection(Node *head_pointer1,Node *head_pointer2)
{
while (head_pointer1 != 0)
{
if (compare(head_pointer2, head_pointer1->data))
head_intersection = insert_node(head_intersection,head_pointer1->data);
head_pointer1 = head_pointer1->next;
}

return head_intersection;
}

Output:

Enter the number of Nodes in first List: 5
Enter 5 the elements: 2 3 4 5 6

Inserting Elements at the beginning...
Address of created newnode :12721208
Inserted value is :2

Inserting Elements at the beginning...
Address of created newnode :12721224
Inserted value is :3

Inserting Elements at the beginning...
Address of created newnode :12721240
Inserted value is :4

Inserting Elements at the beginning...
Address of created newnode :12721256
Inserted value is :5

Inserting Elements at the beginning...
Address of created newnode :12721272
Inserted value is :6
6 5 4 3 2
Enter the number of Nodes in Second List:5
Enter 5 the elements: 4 5 6 7 8

Inserting Elements at the beginning...
Address of created newnode :12719736
Inserted value is :4

Inserting Elements at the beginning...
Address of created newnode :12719752
Inserted value is :5

Inserting Elements at the beginning...
Address of created newnode :12719768
Inserted value is :6

Inserting Elements at the beginning...
Address of created newnode :12719784
Inserted value is :7

Inserting Elements at the beginning...
Address of created newnode :12719800
Inserted value is :8
8 7 6 5 4
Inserting Elements at the beginning...
Address of created newnode :12719816
Inserted value is :6

Inserting Elements at the beginning...
Address of created newnode :12719832
Inserted value is :5

Inserting Elements at the beginning...
Address of created newnode :12719848
Inserted value is :4

Inserting Elements at the beginning...
Address of created newnode :12719864
Inserted value is :3

Inserting Elements at the beginning...
Address of created newnode :12719880
Inserted value is :2

Inserting Elements at the beginning...
Address of created newnode :12719896
Inserted value is :8

Inserting Elements at the beginning...
Address of created newnode :12719912
Inserted value is :7
Here is the result of union: 7 8 2 3 4 5 6
Inserting Elements at the beginning...
Address of created newnode :12742528
Inserted value is :6

Inserting Elements at the beginning...
Address of created newnode :12720400
Inserted value is :5

Inserting Elements at the beginning...
Address of created newnode :12720416
Inserted value is :4
Here is the result of intersection: 4 5 6

Coding: