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

PROJECT 1 

• 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.

#include "list.h"

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("\nEnter the number of Nodes in seconds 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("\nValue of head1 and head2 :%d %d",head1,head2);
#endif
#ifdef DEBUG_MAIN
	printf("\nValue 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("\nValue 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);

}

#ifndef LIST_H_
#define LIST_H_

LIST CODE 2:-

• Intersection of data of two list.
• Union of data of two list

#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,*head_union,*head_intersection,*newnode,*tail,*res_union,*res_intersection;


// define the functions

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_ */

CODE 3:-

# 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 currents node
		  tail = tail->next; // advanced 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 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;
}