Question

Suppose a linked list (implemented using the array implementation) is ordered by the ABC123 ID and a node is represented by the following Node definition: #define MAX NODES 100 tvpedef struct shac. szAbc1231d[7]: double dGPA; int iNext: Node; Node nodeMIMAX NODES]; int iHead; int ifind, iBest, iPrecedes; // assume the linked list has been populated with values and // iHead points to the first node in that array. // practice problem #1- sample invocation iFind searchLL(nodeM, iHead, "XYZ321", &iprecedes): if (iFind1) printf.("Not found\n"); 1. Modify the searchLL function from class to be passed an ABC123 ID and find the specified student in the linked list. If it is found, return the subscript to that student. If it is not found, return LL_NULL. Also, return (via the parameter list) the subscript to the node that precedes that node. If there isn't a preceding node, this should be LL NULL

Answer 1

SOURCE CODE:

#include<stdio.h>
#define MAX_NODES 100
#define LL_NULL -1
typedef struct
{
char szAbc123Id[7];
double dGPA;
int iNext;
}Node;
Node nodeM[MAX_NODES];
int iHead;
int iFind,iBest,iPrecedes;
int comp(char a[],char b[])
{
int i=0;
for(i=0;i<6;i++)
if(a[i]!=b[i])
return -1;
return 0;

}
int searchLL(Node nodeM[],int iHead, char c[7],int *iPrecedes)
{
int i,*j;
int l=0;
i=iHead;
j=LL_NULL;
while(1)
{
if(comp(nodeM[i].szAbc123Id,c)==0)
return i;
else
{
*j=i;
iPrecedes=j;
i=nodeM[i].iNext;
}
if(l==1)
break;
if(nodeM[i].iNext==LL_NULL)
l=1;
}
return LL_NULL;
}
void main()
{

iFind = searchLL(nodeM,iHead,"XYZ321",&iPrecedes);
if(iFind==-1)
printf("Not Found\n");
}

SCREENSHOTS:

Blocks 17.1 Eile Edit Yiew Search Project Build Debug Fortran wmith Iools Tools Plugins DoxyBlocks Settings Help <global> searchLL(Node nodeM, int iHead, char c], int Precedes): int main.c × | Projects Symbols Fles # include<stdio.h> #define MAX NODES 100 #define LL NULL -1 typedcf struct Workspace Sources main.c char s2Abc123Id[71 double dGPA: int iNext: Node Node nodeM[wix NODES] int iHead: int ifind, iBest, iPrecedes: int comp(har a,cha b) 10 12 13 15 16 17 18 19 20 21 int i-O for (1-0;恥6; i++) if (a[i]!-bi) return-1: return0 Logs & others Code: :Blods X -SSearch results X Cocc >Buid log XrBuild messages 4CppCheck vera ++ X」CppCheck vera + + messages XI CoopeX DebuggcP X X File Line Hessage Build: Debug in s (eomiler: GNU GOC Compiler In functュon . search.LL. : rarning: assignment makes pointer from integer rithout a cast -int arning: retun type of 'main i not 'inE-mainj C: Werslanunk... 27 Build finished: exzor(s), 2 warnings) [0 ninute (), 4 second(s)) 30 Pos 377