Question

Must be written and C, and compile with MinGW. Thank you!

am Specification For this assignment, you will write a multi-file C program to define, implement and use a dynamic linked lists. Please refer to Lab 07 for the definition of a basic linked list. In this assignment you will need to use the basic ideas of a node and of a linked list of nodes to implement a suit of functions which can be used to create and maintain two specific kinds of lists (of node s) as well as other hybrid lists: 1. A list where all adds and removes occur at the start of the list (a Stack) 2. A list where all adds occur at the end of the list, and removes the start of the list (a Queue) s: You must write lists.c-given the following lists.h (which can not be modified) // a recursive data type definition // se typedef struct node rves as the nodes of a list int id char name; struct node* next; node; // create and return a new node- given its component's values node* create_node (int id, const char* name); // strdup ? // free the contents of*, then n and finally set void free node (node* n); NULL // print the contents of a node void print node (const node+ n); // create an empty list set *node NULL void create list (node* +head); // add a ne笞node to the front of the list void add front (node* +head, node *new_node) // add a nev node to the end of the list void add_end (nodes shead, node *new node); // remove and return the node at the front of the list or NULL if empty node* rem_front (nodes *head); // remove and return the node at the end of the list or NULL if empty node* rem_end (node head); // return the number of nodes in the list int list_len (const node head); // print the data values of all the nodes in the list (from start to end) void print_list (const node *head) // free the entire list and set +head NULL void free list (node +head) You must write main.c which tests your list impl completely

Answer 1

/**** List.h ****/

/***** List Header File ***/

//Structure Definition
typedef struct node
{
int id;
char *name;
struct node* next;
} node;

//Function prototypes declared here

node getNode(int id, char name);

void print_list(node **head);

int list_len(node **head);

void add_front(node *head, int id, char name);

void add_end(node *head, int id, char name);

void rem_front(node** head);

void rem_end(node** head);

void create_list(node **head);

/**** List.h Ends ****/

/**** List.c ********/

/ Header Inclusion /
#include "Lists.h"

//Function to construct node
node getNode(int id, char name)
{
node* n = (node*)malloc(sizeof(node));

n->id = id;
n->name = strdup(name);
n->next = NULL;

return n;
}

//Fucntuon to print entire list
void print_list(node **head)
{
node ptr = head;

while(ptr)
{
printf("%d %s\n", ptr->id, ptr->name);
ptr = ptr->next;
}
}

//Function to print length of list
int list_len(node **head)
{
int count = 0;

node ptr = head;

while(ptr)
{
count++;
ptr = ptr->next;
}
return count;
}

//Function to add node at front
void add_front(node *head, int id, char name)
{
node* newNode = getNode(id, name);

newNode->next = *head;
*head = newNode;

}

//Function to add node at end
void add_end(node *head, int id, char name)
{
node* newNode = getNode(id, name);

node ptr = head;

if(ptr == NULL)
{
(*head) = newNode;
}
else
{
while(ptr->next)
{
ptr = ptr->next;
}
ptr->next = newNode;
}

}

//Function to remove from front
void rem_front(node** head)
{
if(*head == NULL)
printf("\nUnder Flow");
else
{
node ptr = head;
head = (head)->next;
free(ptr);
}
}

//Function to remove from end
void rem_end(node** head)
{
if(*head == NULL)
printf("Under Flow");
else
{
if((*head)->next == NULL)
{
rem_front(head);
}
else
{
node ptr = head;
node* prev = ptr;

while(ptr->next)
{
prev = ptr;
ptr = ptr->next;
}
prev->next = NULL;
free(ptr);
}
}
}

//Function to create list until stopped
void create_list(node **head)
{

int num;
char ch, str[30];

do
{
printf("Enter ID : ");
scanf("%d", &num);
getchar();
printf("Enter Name : ");
scanf("%s", str);

add_end(head, num, str);

printf("Do yo want to contine (Y/N) : ");
scanf(" %c", &ch);

} while(ch == 'Y' || ch == 'y');

}

/***** List.c Ends *****/

/***** Main.c *********/

/ C language Used /
/ Program to implement Linked List /

//File Inclusion
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

//Linked List file inclusion
#include "Lists.c"

//Driver Function to test
int main()
{
node* list = NULL;

print_list(&list);

// add_front(&list, 10, "AAA");
// add_front(&list, 20, "BBB");
// add_end(&list, 30, "CCC");
// add_end(&list, 40, "DDD");

create_list(&list);

// rem_end(&list);

print_list(&list);

return 0;
}

/*** Main.c Ends ******/
Output:

Note: The program is tested with the provided main function and the output is attached. For any query drop a comment.

causersiTusharlDesktoplNew folder.Main.exe Enter ID 23 Enter Name BOB Do yo want to contine (Y/N) Y Enter ID 67 Enter Name PETE Do yo want to contine (Y/N) : y Enter ID 89 Enter Name TOM Do yo want to contine (Y/N) n 23 BOB 67 PETE 89 TOM Process exited after 21.28 seconds with return value Press any key to continue . . .