Question

C PROGRAMMING

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

struct nodet
{
int data;
struct nodet *link;
};

struct nodet *makeAnode(int val)
{
struct nodet *box;
box = malloc(sizeof(struct nodet) );
box->data = val;
box->link = NULL;
return box;
}

void printList(struct nodet *L)
{
struct nodet = *mov;
mov = L;
while(mov != NULL)
{
printf("%d ", mov->data);
mov = mov->link;
}
printf("\n");
}

// THIS SHOULD COUNT HOW MANY ITEMS (NODES) ARE IN THE LIST.

int listLen(struct nodet **L)
{
int c = 0;
while(*L != NULL)
{
L = L->link;
c++;
}
return c;
}

// find the highest & lowest value in the list. Return 1 if things went as expected. Return error code -1 if the list was empty and you were unable to perform the task. Recall this list //can contain any integer value. If the list has a single value, that is both the highest & lowest. If the high number is repeated in the list, that is still the biggest.

int listMaxAndMin(struct nodet **L)
{
int max, min;
mov = *L;
if(*L == NULL)
return -1;
while(*L != NULL)
{
max = 0;
if(max < box->data)
max = box->data;
mov = mov-link;

min = 0;
if(min > box->data)
min = box->data;
mov = mov->link;
}
return 1;
}

// add the integer value X to each item in the list. The list is changed when you are done. So if you were to print the list the values would be modified.

void addXto( struct nodet **L, int val)
{
struct nodet *mov;
mov = *L;
while(*L != NULL)
{
box->data = box->data + val;
mov = mov->link;
}
}

int main()
{
}

I'm not sure if the code I have so far is right because I'm not sure how to write the main. Any pointers are helpful.

Answer 1

• Firstly, we have to clear all the compilation errors in the code.
• In three of the functions, struct nodet** variable is being passed. This is unnecessary. stuct nodet* will be enough, it's already a pointer.
• Then, in listMinAndMax(), min and max variables must be intialized outside the while loop. And it is better to intialize them to data in the first node of the list, rather than 0.
• Also, the variable box is used in the functions. There is no vaiable named box declated anywhere. mov pointer must be used in its place.
• In main(), we must create a sample linked list and test the written functions on it.

modified program: (modifications are given in bold letters)

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

struct nodet
{
int data;
struct nodet *link;
};

struct nodet *makeAnode(int val)
{
struct nodet *box;
box = malloc(sizeof(struct nodet) );
box->data = val;
box->link = NULL;
return box;
}

void printList(struct nodet *L)
{
struct nodet *mov;
mov = L;
while(mov != NULL)
{
printf("%d ", mov->data);
mov = mov->link;
}
printf("\n");
}

// THIS SHOULD COUNT HOW MANY ITEMS (NODES) ARE IN THE LIST.

int listLen(struct nodet *L)
{
int c = 0;
while(L!= NULL)
{
L = L->link;
c++;
}
return c;
}

// find the highest & lowest value in the list. Return 1 if things went as expected. Return error code -1 if the list was empty and you were unable to perform the task. Recall this list //can contain any integer value. If the list has a single value, that is both the highest & lowest. If the high number is repeated in the list, that is still the biggest.

int listMaxAndMin(struct nodet *L)
{
int max, min;
struct nodet* mov;
mov = L;
if(L == NULL)
return -1;
max = mov->data;
min = mov->data;
while(mov != NULL)
{
if(max < mov->data)
max = mov->data;

if(min > mov->data)
min = mov->data;
mov = mov->link;
}
printf("Minimum value in list: %d\n", min);
printf("Maximum value in list: %d\n", max);
return 1;
}

// add the integer value X to each item in the list. The list is changed when you are done. So if you were to print the list the values would be modified.

void addXto( struct nodet *L, int val)
{
struct nodet *mov;
mov = L;
while(mov != NULL)
{
mov->data = mov->data + val;
mov = mov->link;
}
}

int main()
{
struct nodet* n1 = makeAnode(1);
struct nodet* n2 = makeAnode(2);
struct nodet* n3 = makeAnode(3);
n1->link = n2;
n2->link = n3;
printList(n1);
int len = listLen(n1);
printf("Lenght of list = %d\n", len);
listMaxAndMin(n1);
printf("Adding 5 to list elements\n");
addXto(n1, 5);
printList(n1);
}

output:

1 2 3 Lenght of list = 3 Minimum value in list: 1 Maximum value in list: 3 Adding 5 to list elements 6 7 8