Challenge

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

Overview of the Project:-

  • In this Project we are going to implement the Mathematical Set Theory by using the two sets of data list and getting the output in Intersection of two sets.
  • Set Theory means is a Branch of Mathematical Logic where we learn about the sets.
  • Intersection of Two Sets means we are going to get the output when the common elements are present in two sets.
  • Here we are using the Linked List concept for to Initilaze the two sets os numbers or elements.
  • Getting the output in the union form.

Goals:-

  • We need to implement the 2 sets by the using the linked list to perform Mathematical Set Operation.
  • We need to use insert_node function,display_list function ,get_union function, get_intersection function and we need to compare the 2 sets and get the output only the same elements in the 2 sets.

Key Highlights of the Project:-

  • By using the Singly Linked list concept we are implementing the two sets in c-Programming.
  • First we need to enter the set 1 number of nodes and read the values and again we need to give the set 2 number of nodes and then reads the values.
  • The values will store in the node in Head Pointer(Starting Address of list),Tail Pointer(Temporary Pointer used for tranversing in the list) and the address of next node(Points the new created node).
  • After giving the 2 sets. we need to read the set by last in first out process and print the 2 sets.
  • We want to Comparing the two sets and find out the common elements in the sets.
  • From Union we are going to get only the common elements in the set.

Deliverables of this Project:

  • Create the input for number of nodes in the 1st set.
  • Take multiple inputs for the data on nodes in 1st set and insert the nodes in the first set using Insert_elemnet() function. Loop is used for multiple iteration.
  • Call display_list function to display 1st set.
  • Repeat above steps for the 2nd set.
  • Need to save the head pointer address return to the get_union function pointer to a Node type pointer res_union.
  • Pass the address of res_union to the display_list function and display the union list.

Expected Outcomes:-

  • By using the Linked List we can creat the set of elements.
  • By getting the 2 sets we need to store the outputs in the union.
  • We need to compare the common number/elements in the set by using intersection concept.
Your portfolio, next

Ship work like this
in your own course.

Talk to a career counsellor

Free 20-minute call. We'll map the right course to where you want to work.

By submitting you agree to our Terms and Privacy Policy.

Talk to a career counsellor

Free 20-minute call. We'll map the right course to where you want to work.

By submitting you agree to our Terms and Privacy Policy.