1. C/C++
Create a inked list of up to 20 peripherals.
Hold data about peripheral in a structure.
Provide for adding new peripherals, finding and removing them.
Minimize code by leveraging code reuse.
struct peripheral
{
struct peripheral *next;
char *name;
char *description;
}
#define new(a) malloc(sizeof(struct a));
#define MAX_P 20;
int total = 0;
main
{
struct peripherial *root;
root = malloc(sizeof(struct peripheral));
(*root).next, or
root->next = new(peripheral);
root->name = “keyboard”;
root->next-> = “mouse”;
// find the mouse peripheral
struct peripherial *mouse = findByNameLast(root,”mouse”)->next; // ->next =’s findByName;

2. }
struct peripheral* findByNameLast(peripheral* start, char* input)
{
if(start->next != null)
{
if(strcmp(start->name,input) == 0)
{
return start;
}
else if(start->next != null)
{
findByNameLast(start->next,input);
}
else if(start->next-next != null)
{
findByNameLast(start->next,input);
}
else
{
return NULL;
}
}
else
{

3. return NULL;
}
}
struct peripheral* insertAfter(struct peripheral* start, char* input)
{
if(total < MAX_P)
{
struct peripheral* new = new(peripheral);
new->name = strcpy(input);
new->next = start->next;
start->next = new;
total++;
return start->next;
}
else
{
return NULL;
}
}
struct peripheral* removeByName(peripheral* start, char* input)
{
if(removeable == root)
{

4. root = root->next;
return root;
}
struct peripheral* last = findByNameLast(start,input);
if(last != NULL)
{
last->next = last-next->next;
return last->next;
}
return NULL;
}