Question

(In C Programming) Your program should start by asking the user how many nodes will be in the network. Nodes should be implemented by a node struct and maintained in a Linked List. •Each node should maintain all packets that have been generated and are ready to be be transmitted (one at a time). Packets should be implemented by a packet struct and maintained in a Linked List. •The protocol you will implement should run for 100 rounds. The first round is round #1. •During each round, each one of the nodes decides if it will create a packet for the other based on the following rule: •Each Node will produce a packet in every round that is a multiple of 2*node_number, two packets in every round that is a multiple of 3*node_num, and three packets in each round that is a multiple of 5*node_num. The numbering of nodes starts with node 1 •The destination of each packet is: –((node number of node generating the packet + round_number) % (total_number_of_nodes))+1 - if the destination calculated is the same as the source, then increase the destination by 1. •In each round: –Check which nodes created packets for other nodes. –Each node will transmit one packet to its destination. –Each nodes must keep track of the number of packets that it created and of the number of packets it received and from which other node •At the end of all rounds, the program must print out how many packets each node produced and how many packets each node received and from whom. It must also print out how many packets each node did nor deliver and are left each node’s the packet queue (its linked list).

Answer 1

#include<stdio.h>

#include<stdlib.h>

#include<stdbool.h>

struct test_struct

{

int val;

struct test_struct *next;

};

struct test_struct *head = NULL;

struct test_struct *curr = NULL;

struct test_struct* create_list(int val)

{

printf("\n creating list with headnode as [%d]\n",val);

struct test_struct *ptr = (struct test_struct*)malloc(sizeof(struct test_struct));

if(NULL == ptr)

{

printf("\n Node creation failed \n");

return NULL;

}

ptr->val = val;

ptr->next = NULL;

head = curr = ptr;

return ptr;

}

struct test_struct* add_to_list(int val, bool add_to_end)

{

if(NULL == head)

{

return (create_list(val));

}

if(add_to_end)

printf("\n Adding node to end of list with value [%d]\n",val);

else

printf("\n Adding node to beginning of list with value [%d]\n",val);

struct test_struct *ptr = (struct test_struct*)malloc(sizeof(struct test_struct));

if(NULL == ptr)

{

printf("\n Node creation failed \n");

return NULL;

}

ptr->val = val;

ptr->next = NULL;

if(add_to_end)

{

curr->next = ptr;

curr = ptr;

}

else

{

ptr->next = head;

head = ptr;

}

return ptr;

}

struct test_struct* search_in_list(int val, struct test_struct **prev)

{

struct test_struct *ptr = head;

struct test_struct *tmp = NULL;

bool found = false;

printf("\n Searching the list for value [%d] \n",val);

while(ptr != NULL)

{

if(ptr->val == val)

{

found = true;

break;

}

else

{

tmp = ptr;

ptr = ptr->next;

}

}

if(true == found)

{

if(prev)

*prev = tmp;

return ptr;

}

else

{

return NULL;

}

}

int delete_from_list(int val)

{

struct test_struct *prev = NULL;

struct test_struct *del = NULL;

printf("\n Deleting value [%d] from list\n",val);

del = search_in_list(val,&prev);

if(del == NULL)

{

return -1;

}

else

{

if(prev != NULL)

prev->next = del->next;

if(del == curr)

{

curr = prev;

}

else if(del == head)

{

head = del->next;

}

}

free(del);

del = NULL;

return 0;

}

void print_list(void)

{

struct test_struct *ptr = head;

printf("\n -------Printing list Start------- \n");

while(ptr != NULL)

{

printf("\n [%d] \n",ptr->val);

ptr = ptr->next;

}

printf("\n -------Printing list End------- \n");

return;

}

int main(void)

{

int i = 0, ret = 0;

struct test_struct *ptr = NULL;

print_list();

for(i = 5; i<10; i++)

add_to_list(i,true);

print_list();

for(i = 4; i>0; i--)

add_to_list(i,false);

print_list();

for(i = 1; i<10; i += 4)

{

ptr = search_in_list(i, NULL);

if(NULL == ptr)

{

printf("\n Search [val = %d] failed, no such element found\n",i);

}

else

{

printf("\n Search passed [val = %d]\n",ptr->val);

}

print_list();

ret = delete_from_list(i);

if(ret != 0)

{

printf("\n delete [val = %d] failed, no such element found\n",i);

}

else

{

printf("\n delete [val = %d] passed \n",i);

}

print_list();

}

return 0;

}